{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:34:59Z","timestamp":1725744899379},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404498"},{"type":"electronic","value":"9783642404504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40450-4_34","type":"book-chapter","created":{"date-parts":[[2013,8,15]],"date-time":"2013-08-15T23:22:47Z","timestamp":1376608967000},"page":"397-408","source":"Crossref","is-referenced-by-count":3,"title":["FPTAS for Minimizing Earth Mover\u2019s Distance under Rigid Transformations"],"prefix":"10.1007","author":[{"given":"Hu","family":"Ding","sequence":"first","affiliation":[]},{"given":"Jinhui","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","first-page":"121","volume-title":"Handbook of Computational Geometry","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 Computational Geometry, pp. 121\u2013153. Elsevier, Amsterdam (1999)"},{"key":"34_CR2","unstructured":"Andoni, A., Indyk, P., Krauthgamer, R.: Earth mover distance over high-dimensional spaces. In: SODA, pp. 343\u2013352 (2008)"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Andoni, A., Do Ba, K., Indyk, P., Woodruff, D.P.: Efficient Sketches for Earth-Mover Distance, with Applications. In: FOCS, pp. 324\u2013330 (2009)","DOI":"10.1109\/FOCS.2009.25"},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jda.2012.03.002","volume":"15","author":"M. Benkert","year":"2012","unstructured":"Benkert, M., Gudmundsson, J., Merrick, D., Wolle, T.: Approximate one-to-one point pattern matching. J. Discrete Algorithms\u00a015, 1\u201315 (2012)","journal-title":"J. Discrete Algorithms"},{"key":"34_CR5","unstructured":"Cohen, S.: Finding Color and Shape Patterns in Images. PhD thesis, Stanford University, Department of Compute Science (1999)"},{"issue":"2","key":"34_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.ipl.2007.08.003","volume":"105","author":"S. Cabello","year":"2008","unstructured":"Cabello, S., Giannopoulos, P., Knauer, C.: On the parameterized complexity of d-dimensional point set pattern matching. Inf. Process. Lett.\u00a0105(2), 73\u201377 (2008)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"34_CR7","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.comgeo.2006.10.001","volume":"39","author":"S. Cabello","year":"2008","unstructured":"Cabello, S., Giannopoulos, P., Knauer, C., Rote, G.: Matching Point Sets with Respect to the Earth Mover\u2019s Distance. Computational Geometry: Theory and Applications\u00a039(2), 118\u2013133 (2008)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"34_CR8","unstructured":"Cardoze, D.E., Schulman, L.J.: Pattern Matching for Spatial Point Sets. In: FOCS, pp. 156\u2013165 (1998)"},{"issue":"1","key":"34_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s00453-003-1043-4","volume":"38","author":"M. Gavrilov","year":"2004","unstructured":"Gavrilov, M., Indyk, P., Motwani, R., Venkatasubramanian, S.: Combinatorial and Experimental Methods for Approximatie Point Pattern Matching. Algorithmica\u00a038(1), 59\u201390 (2004)","journal-title":"Algorithmica"},{"issue":"4","key":"34_CR10","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/34.761267","volume":"21","author":"M.T. Goodrich","year":"1999","unstructured":"Goodrich, M.T., Mitchell, J.S.B., Orletsky, M.W.: Approximate Geometric Pattern Matching Under Rigid Motions. IEEE PAMI\u00a021(4), 371\u2013379 (1999)","journal-title":"IEEE PAMI"},{"key":"34_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1007\/11602613_101","volume-title":"Algorithms and Computation","author":"O. Klein","year":"2005","unstructured":"Klein, O., Veltkamp, R.C.: Approximation Algorithms for Computing the Earth Mover\u2019s Distance Under Transformations. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 1019\u20131028. Springer, Heidelberg (2005)"},{"issue":"2","key":"34_CR12","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 Movers Distance as a Metric for Image Retrieval. Int. J. of Comp. Vision\u00a040(2), 99\u2013121 (2000)","journal-title":"Int. J. of Comp. Vision"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40450-4_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T12:52:24Z","timestamp":1558011144000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40450-4_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404498","9783642404504"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40450-4_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}