Matching point sets with respect to the earth mover's distance

Lecture Notes in Computer Science

Volumn 3669, Issue , 2005, Pages 520-531

  Cabello, Sergio ^a   Giannopoulos, Panos ^b   Knauer, Christian ^b   Rote, Günter ^b  

^a INSTITUTE OF MATHEMATICS   (Slovenia)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DISTANCE MEASUREMENT; EARTHMOVING MACHINERY; IMAGE RETRIEVAL; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; EARTH MOVER'S DISTANCE (EMD); SHAPE MATCHING;

SET THEORY;

EID: 27144471877     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11561071_47     Document Type: Conference Paper

References (17)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice-Hall, 1993.
2. H. Alt and L. Guibas. Discrete geometric shapes: Matching, interpolation, and approximation. In J.R. Sack and J. Urrutia, editors, Handbook of Comp. Geom., pages 121-153. Elsevier Science Publishers B.V. North-Holland, 1999.
3. D.S. Atkinson and P.M. Vaidya. Using geometry to solve the transportation problem in the plane. Algorithmica, 13:442-461, 1995.
4. P. Bose, A. Maheshwari, and P. Morin. Fast approximations for sums of distances clustering and the Fermat-Weber problem. Comp. Geom. Theory & Appl., 24:135-146, 2003.
5. P.B. Callahan and S.R. Kosaraju. Faster algorithms for some geometric graph problems in higher dimensions. In Proc. of the 4th ACM-SIAM SODA, pages 291-300, 1993.
6. R. Chandrasekaran and A. Tamir. Algebraic optimization: The Fermat-Weber location problem. Math. Programming, 46(2):219-224, 1990.
7. S. Cohen and L. Guibas. The Earth Mover's Distance under transformation sets. In Proc. of the 7th IEEE ICCV, pages 173-187, 1999.
8. P. Giannopoulos and R. C. Veltkamp. A pseudo-metric for weighted point sets. In Proc. of the 7th ECCV, volume 2352 of LNCS, pages 715-731, 2002.
9. K. Grauman and T. Darell. Fast contour matching using approximate Earth Mover's Distance. In Proc. of the IEEE CVPR, pages 220-227, 2004.
10. P. Indyk and N. Thaper. Fast image retrieval via embeddings. In 3rd Int. Workshop on Statistical and Computational Theories of Vision, 2003.
11. O. Klein and R.C. Veltkamp. Approximation algorithms for the Earth Mover's Distance under transformations using reference points. Technical Report UU-CS-2005-003, IICS, Utrecht University, The Netherlands, 2005.
12. Q. Lv, M. Charikar, and K. Li. Image similarity search with compact data structures. In Proc. of the 13th ACM CIKM, pages 208-217, 2004.
13. D. Mumford. Mathematical theories of shape: Do they model perception? In SPIE vol. 1570 Geometric Methods in Comp. Vision, pages 2-10, 1991.
14. J. B. Orlin. A faster strongly polynomial minimum cost flow algorithm. Operations Research, 41(2):338-350, 1993.
15. Y. Rubner, C. Tomasi, and L.J. Guibas. The Earth Mover's Distance as a metric for image retrieval. Int. Journal of Computer Vision, 40(2):99-121, 2000.
16. R. Typke, P. Giannopoulos, R. C. Veltkamp, F. Wiering, and R. van Oostrum. Using transportation distances for measuring melodic similarity. In Proc of 4th Int. Symp. on Music Inf. Retrieval (ISMIR), pages 107-114, 2003.
17. K.R. Varadarajan and P.K. Agarwal. Approximation algorithms for bipartite and non-bipartite matching in the plane. In Proc. of the 10th ACM-SIAM SODA'99, pages 805-814, 1999.