{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:10:42Z","timestamp":1742911842847,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540219842"},{"type":"electronic","value":"9783540246701"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24670-1_25","type":"book-chapter","created":{"date-parts":[[2010,8,4]],"date-time":"2010-08-04T04:50:04Z","timestamp":1280897404000},"page":"322-335","source":"Crossref","is-referenced-by-count":29,"title":["Many-to-Many Feature Matching Using Spherical Coding of Directed Graphs"],"prefix":"10.1007","author":[{"given":"M. Fatih","family":"Demirci","sequence":"first","affiliation":[]},{"given":"Ali","family":"Shokoufandeh","sequence":"additional","affiliation":[]},{"given":"Sven","family":"Dickinson","sequence":"additional","affiliation":[]},{"given":"Yakov","family":"Keselman","sequence":"additional","affiliation":[]},{"given":"Lars","family":"Bretzner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"25_CR1","first-page":"1073","volume":"28","author":"R. Agarwala","year":"1999","unstructured":"Agarwala, R., Bafna, V., Farach, M., Paterson, M., Thorup, M.: On the approximability of numerical taxonomy (fitting distances by tree metrics). SIAM Journal on Computing\u00a028(2), 1073\u20131085 (1999)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"25_CR2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1109\/34.993558","volume":"24","author":"S. Belongie","year":"2002","unstructured":"Belongie, S., Malik, J., Puzicha, J.: Shape matching and object recognition using shape contexts. IEEE PAMI\u00a024(4), 509\u2013522 (2002)","journal-title":"IEEE PAMI"},{"issue":"6","key":"25_CR3","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1109\/34.601245","volume":"19","author":"R. Beveridge","year":"1997","unstructured":"Beveridge, R., Riseman, E.M.: How easy is matching 2D line models using local search? IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a019(6), 564\u2013579 (1997)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"25_CR4","first-page":"387","volume-title":"Mathematics in the Archaeological and Historical Sciences","author":"P. Buneman","year":"1971","unstructured":"Buneman, P.: The recovery of trees from measures of dissimilarity. In: Hodson, F., Kendall, D., Tautu, P. (eds.) Mathematics in the Archaeological and Historical Sciences, pp. 387\u2013395. Edinburgh University Press, Edinburgh (1971)"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Cohen, S.D., Guibas, L.J.: The earth mover\u2019s distance under transformation sets. In: Proceedings of 7th International Conference on Computer Vision, Kerkyra, Greece, pp. 1076\u20131083 (1999)","DOI":"10.1109\/ICCV.1999.790393"},{"key":"25_CR6","volume-title":"Sphere Packing, Lattices and Groups","author":"J.H. Conway","year":"1998","unstructured":"Conway, J.H., Sloane, N.J.A.: Sphere Packing, Lattices and Groups. Springer, New York (1998)"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Demirci, F., Shokoufandeh, A., Keselman, Y., Dickinson, S., Bretzner, L.: Manyto- many matching of scale-space feature hierarchies using metric embedding. In: 4th International Conference on Scale Space Methods in Computer Vision, Isle of Skye, UK, June, 10\u201312, pp. 17\u201332 (2003)","DOI":"10.1007\/3-540-44935-3_2"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Gupta, A.: Embedding tree metrics into low dimensional euclidean spaces. In: Proceedings of the thirty-first annual ACM symposium on Theory of computing, pp. 694\u2013700 (1999)","DOI":"10.1145\/301250.301434"},{"key":"25_CR9","unstructured":"Indyk, P.: Algorithmic aspects of geometric embeddings. In: Proceedings of 42nd Annual Symposium on Foundations of Computer Science (2001)"},{"key":"25_CR10","unstructured":"Keselman, Y., Shokoufandeh, A., Demirci, F., Dickinson, S.: Many-to-many graph matching via low-distortion embedding. In: Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, Madison, WI (June 2003)"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-70659-3_13","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"S. Kosinov","year":"2002","unstructured":"Kosinov, S., Caelli, T.: Inexact multisubgraph matching using graph eigenspace and clustering models. In: Caelli, T.M., Amin, A., Duin, R.P.W., Kamel, M.S., de Ridder, D. (eds.) SPR 2002 and SSPR 2002. LNCS, vol.\u00a02396, pp. 133\u2013142. Springer, Heidelberg (2002)"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Liu, T.-L., Geiger, D.: Approximate tree matching and shape similarity. In: Proceedings of 7th International Conference on Computer Vision, Kerkyra, Greece, pp. 456\u2013462 (1999)","DOI":"10.1109\/ICCV.1999.791256"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BF02785579","volume":"237","author":"J. Matou\u0161ek","year":"1999","unstructured":"Matou\u0161ek, J.: On embedding trees into uniformly convex Banach spaces. Israel Journal of Mathematics\u00a0237, 221\u2013237 (1999)","journal-title":"Israel Journal of Mathematics"},{"key":"25_CR14","first-page":"231","volume-title":"Shape, Structure and Pattern Recognition","author":"B. Messmer","year":"1995","unstructured":"Messmer, B., Bunke, H.: Efficient error-tolerant subgraph isomorphism detection. In: Dori, D., Bruckstein, A. (eds.) Shape, Structure and Pattern Recognition, pp. 231\u2013240. World Scientific Publ. Co., Singapore (1995)"},{"issue":"6","key":"25_CR15","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1109\/34.862201","volume":"22","author":"R. Myers","year":"2000","unstructured":"Myers, R., Wilson, R., Hancock, E.: Bayesian graph edit distance. IEEE PAMI\u00a022(6), 628\u2013635 (2000)","journal-title":"IEEE PAMI"},{"issue":"2","key":"25_CR16","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. International Journal of Computer Vision\u00a040(2), 99\u2013121 (2000)","journal-title":"International Journal of Computer Vision"},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1098\/rspb.1991.0045","volume":"B244","author":"G. Scott","year":"1991","unstructured":"Scott, G., Longuet-Higgins, H.: An algorithm for associating the features of two patterns. Proceedings of Royal Society of London\u00a0B244, 21\u201326 (1991)","journal-title":"Proceedings of Royal Society of London"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Sebastian, T., Klein, P., Kimia, B.: Recognition of shapes by editing shock graphs. In: IEEE International Conference on Computer Vision, pp. 755\u2013762 (2001)","DOI":"10.1109\/ICCV.2001.937602"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/3-540-47977-5_50","volume-title":"Computer Vision - ECCV 2002","author":"A. Shokoufandeh","year":"2002","unstructured":"Shokoufandeh, A., Dickinson, S.J., J\u00f6nsson, C., Bretzner, L., Lindeberg, T.: On the representation and matching of qualitative shape at multiple scales. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002. LNCS, vol.\u00a02352, pp. 759\u2013775. Springer, Heidelberg (2002)"},{"key":"25_CR20","first-page":"1","volume":"30","author":"K. Siddiqi","year":"1999","unstructured":"Siddiqi, K., Shokoufandeh, A., Dickinson, S., Zucker, S.: Shock graphs and shape matching. International Journal of Computer Vision\u00a030, 1\u201324 (1999)","journal-title":"International Journal of Computer Vision"}],"container-title":["Lecture Notes in Computer Science","Computer Vision - ECCV 2004"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24670-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T19:44:37Z","timestamp":1740339877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24670-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540219842","9783540246701"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24670-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}