{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:25:47Z","timestamp":1725549947081},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291183"},{"type":"electronic","value":"9783540319511"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561071_47","type":"book-chapter","created":{"date-parts":[[2005,10,6]],"date-time":"2005-10-06T12:46:24Z","timestamp":1128602784000},"page":"520-531","source":"Crossref","is-referenced-by-count":3,"title":["Matching Point Sets with Respect to the Earth Mover\u2019s Distance"],"prefix":"10.1007","author":[{"given":"Sergio","family":"Cabello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos","family":"Giannopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Knauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00fcnter","family":"Rote","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"47_CR1","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"47_CR2","first-page":"121","volume-title":"Handbook of Comp. Geom.","author":"H. Alt","year":"1999","unstructured":"Alt, H., Guibas, L.: Discrete geometric shapes: Matching, interpolation, and approximation. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Comp. Geom., pp. 121\u2013153. Elsevier Science Publishers B.V, North-Holland (1999)"},{"key":"47_CR3","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/BF01190848","volume":"13","author":"D.S. Atkinson","year":"1995","unstructured":"Atkinson, D.S., Vaidya, P.M.: Using geometry to solve the transportation problem in the plane. Algorithmica\u00a013, 442\u2013461 (1995)","journal-title":"Algorithmica"},{"key":"47_CR4","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0925-7721(02)00102-5","volume":"24","author":"P. Bose","year":"2003","unstructured":"Bose, P., Maheshwari, A., Morin, P.: Fast approximations for sums of distances clustering and the Fermat-Weber problem. Comp. Geom. Theory & Appl.\u00a024, 135\u2013146 (2003)","journal-title":"Comp. Geom. Theory & Appl."},{"key":"47_CR5","unstructured":"Callahan, P.B., Kosaraju, S.R.: Faster algorithms for some geometric graph problems in higher dimensions. In: Proc. of the 4th ACM-SIAM SODA, pp. 291\u2013300 (1993)"},{"issue":"2","key":"47_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01585739","volume":"46","author":"R. Chandrasekaran","year":"1990","unstructured":"Chandrasekaran, R., Tamir, A.: Algebraic optimization: The Fermat-Weber location problem. Math. Programming\u00a046(2), 219\u2013224 (1990)","journal-title":"Math. Programming"},{"key":"47_CR7","doi-asserted-by":"crossref","unstructured":"Cohen, S., Guibas, L.: The Earth Mover\u2019s Distance under transformation sets. In: Proc. of the 7th IEEE ICCV, pp. 173\u2013187 (1999)","DOI":"10.1109\/ICCV.1999.790393"},{"key":"47_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/3-540-47977-5_47","volume-title":"Computer Vision - ECCV 2002","author":"P. Giannopoulos","year":"2002","unstructured":"Giannopoulos, P., Veltkamp, R.C.: A pseudo-metric for weighted point sets. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002. LNCS, vol.\u00a02352, pp. 715\u2013731. Springer, Heidelberg (2002)"},{"key":"47_CR9","doi-asserted-by":"crossref","unstructured":"Grauman, K., Darell, T.: Fast contour matching using approximate Earth Mover\u2019s Distance. In: Proc. of the IEEE CVPR, pp. 220\u2013227 (2004)","DOI":"10.1109\/CVPR.2004.1315035"},{"key":"47_CR10","unstructured":"Indyk, P., Thaper, N.: Fast image retrieval via embeddings. In: 3rd Int. Workshop on Statistical and Computational Theories of Vision (2003)"},{"key":"47_CR11","doi-asserted-by":"crossref","unstructured":"Klein, O., Veltkamp, R.C.: Approximation algorithms for the Earth Mover\u2019s Distance under transformations using reference points. Technical Report UU-CS-2005-003, IICS, Utrecht University, The Netherlands (2005)","DOI":"10.1007\/11602613_101"},{"key":"47_CR12","doi-asserted-by":"crossref","unstructured":"Lv, Q., Charikar, M., Li, K.: Image similarity search with compact data structures. In: Proc. of the 13th ACM CIKM, pp. 208\u2013217 (2004)","DOI":"10.1145\/1031171.1031213"},{"key":"47_CR13","doi-asserted-by":"crossref","unstructured":"Mumford, D.: Mathematical theories of shape: Do they model perception? In: SPIE Geometric Methods in Comp. Vision, vol.\u00a01570, pp. 2\u201310 (1991)","DOI":"10.1117\/12.49981"},{"issue":"2","key":"47_CR14","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1287\/opre.41.2.338","volume":"41","author":"J.B. Orlin","year":"1993","unstructured":"Orlin, J.B.: A faster strongly polynomial minimum cost flow algorithm. Operations Research\u00a041(2), 338\u2013350 (1993)","journal-title":"Operations Research"},{"issue":"2","key":"47_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1023\/A:1026543900054","volume":"40","author":"Y. Rubner","year":"2000","unstructured":"Rubner, Y., Tomasi, C., Guibas, L.J.: The Earth Mover\u2019s Distance as a metric for image retrieval. Int. Journal of Computer Vision\u00a040(2), 99\u2013121 (2000)","journal-title":"Int. Journal of Computer Vision"},{"key":"47_CR16","unstructured":"Typke, R., Giannopoulos, P., Veltkamp, R.C., Wiering, F., van Oostrum, R.: Using transportation distances for measuring melodic similarity. In: Proc of 4th Int. Symp. on Music Inf. Retrieval (ISMIR), pp. 107\u2013114 (2003)"},{"key":"47_CR17","unstructured":"Varadarajan, K.R., Agarwal, P.K.: Approximation algorithms for bipartite and non-bipartite matching in the plane. In: Proc. of the 10th ACM-SIAM SODA 1999, pp. 805\u2013814 (1999)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561071_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:50:43Z","timestamp":1605642643000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561071_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291183","9783540319511"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11561071_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}