Fptas for Minimizing Earth Mover’s Distance under Rigid Transformations and Related Problems∗
نویسندگان
چکیده
In this paper, we consider the problem (denoted as EMDRT) of minimizing the earth mover’s distance between two sets of weighted points A and B in a fixed dimensional Rd space under rigid transformation. EMDRT is an important problem in both theory and applications and has received considerable attentions in recent years. Previous research on this problem has resulted in only constant approximations and it has been an open problem for a long time to achieve PTAS solution. In this paper, we present the first FPTAS algorithm for EMDRT. Our algorithm runs roughly in O((nm)d+2(lognm)2d) time (which is close to a lower bound on any PTAS for this problem), where n and m are the sizes of A and B, respectively. Our result is based on several new techniques, such as the Sequential Orthogonal Decomposition (SOD) and Optimum Guided Base (OGB), and can be extended to several related problems, such as the problem of earth mover’s distance under similarity transformation and the alignment problem, to achieve FPTAS for each of them.
منابع مشابه
Approximation algorithms for the Earth mover's distance under transformations using reference points
Reference points have been introduced in [2] and [1] to construct approximation algorithms for matching compact subsets of R under a given class of transformations. Also a general discussion of reference point methods for matching according to the Hausdorffdistance has been given in [1]. Another distance measure used for shape matching is the Earth Mover’s Distance (EMD) for weighted point sets...
متن کاملThe Tangent Earth Mover's Distance
We present a new histogram distance, the Tangent Earth Mover’s Distance (TEMD). The TEMD is a generalization of the Earth Mover’s Distance (EMD) that is invariant to some global transformations. Thus, like the EMD it is robust to local deformations. Additionally, it is robuster to global transformations such as global translations and rotations of the whole image. The TEMD is formulated as a li...
متن کاملThe Earth Mover's Distance under Transformation Sets
The Earth Mover’s Distance (EMD) is a distance measure between distributions with applications in image retrieval and matching. We consider the problem of computing a transformation of one distribution which minimizes its EMD to another. The applications discussed here include estimation of the size at which a color pattern occurs in an image, lighting-invariant object recognition, and point fe...
متن کاملMatching point sets with respect to the Earth mover's distance
Let A and B be two sets of m resp. n weighted points in the plane, with m ≤ n. We present (1 + 6) and (2+6)-approximation algorithms for the minimum Euclidean Earth Mover’s Distance between A and B under translations and rigid motions respectively. In the general case where the sets have unequal total weights the algorithms run in O((nm/6) log(n/6)) time for translations and O((nm/6) log(n/6)) ...
متن کاملVideo-Based Face Recognition Using a Metric of Average Euclidean Distance
This paper presents a novel approach for video-based face recognition. We define a metric based on an average 2 L Euclidean distance between two videos as the classifier. This metric makes use of Earth Mover’s Distance (EMD) as the underlying similarity measurement between videos. Earth Mover’s Distance is a recently proposed metric for geometric pattern matching and it reflects the average gro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013