Bipartite graph matching for points on a line or a circle
Journal of Algorithms
A linear time algorithm for a matching problem on the circle
Information Processing Letters
The space complexity of approximating the frequency moments
Journal of Computer and System Sciences
The Earth Mover's Distance as a Metric for Image Retrieval
International Journal of Computer Vision
A Metric for Distributions with Applications to Image Databases
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
Distinctive Image Features from Scale-Invariant Keypoints
International Journal of Computer Vision
Efficient Image Matching with Distributions of Local Invariant Features
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
Robust tracking with motion estimation and local Kernel-based color modeling
Image and Vision Computing
Planar Earthmover Is Not in $L_1$
SIAM Journal on Computing
A Statistical Approach to the Matching of Local Features
SIAM Journal on Imaging Sciences
Efficient Sketches for Earth-Mover Distance, with Applications
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
On the exact space complexity of sketching and streaming small norms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Transportation Distances on the Circle
Journal of Mathematical Imaging and Vision
| Hi-index | 0.00 |
The Earth Mover Distance (EMD) between point sets A and B is the minimum cost of a bipartite matching between A and B. EMD is an important measure for estimating similarities between objects with quantifiable features and has important applications in several areas including computer vision. The streaming complexity of approximating EMD between point sets in a two-dimensional discretized grid is an important open problem proposed in [8,9]. We study the problem of approximating EMD in the streaming model, when points lie on a discretized circle. Computing the EMD in this setting has applications to computer vision [13] and can be seen as a special case of computing EMD on a discretized grid. We achieve a (1 ±ε) approximation for EMD in Õ (ε-3) space, for every 0ε