{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:25:31Z","timestamp":1750307131198,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,9,19]],"date-time":"2011-09-19T00:00:00Z","timestamp":1316390400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,9,19]]},"DOI":"10.1145\/2034691.2034712","type":"proceedings-article","created":{"date-parts":[[2011,9,20]],"date-time":"2011-09-20T13:50:16Z","timestamp":1316526616000},"page":"93-96","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Skeleton comparisons"],"prefix":"10.1145","author":[{"given":"Jannis","family":"Stoppe","sequence":"first","affiliation":[{"name":"University of Bremen, Bremen, Germany"}]},{"given":"Bj\u00f6rn","family":"Gottfried","sequence":"additional","affiliation":[{"name":"University of Bremen, Bremen, Germany"}]}],"member":"320","published-online":{"date-parts":[[2011,9,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.32"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.70769"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-006-6993-y"},{"key":"e_1_3_2_1_4_1","series-title":"Lecture Notes in Computer Science","first-page":"643","volume-title":"Advances in Database Technology - EDBT","author":"Kailing K.","year":"2004","unstructured":"K. Kailing , H. Kriegel , S. Sch\u00f6nauer , and T. Seidl . Efficient similarity search for hierarchical data in large databases . In E. Bertino, S. Christodoulakis, D. Plexousakis, V. Christophides, M. Koubarakis, K. B\u00f6hm, and E. Ferrari, editors, Advances in Database Technology - EDBT 2004 , volume 2992 of Lecture Notes in Computer Science , pages 643 -- 644 . Springer Berlin \/ Heidelberg , 2004. K. Kailing, H. Kriegel, S. Sch\u00f6nauer, and T. Seidl. Efficient similarity search for hierarchical data in large databases. In E. Bertino, S. Christodoulakis, D. Plexousakis, V. Christophides, M. Koubarakis, K. B\u00f6hm, and E. Ferrari, editors, Advances in Database Technology - EDBT 2004, volume 2992 of Lecture Notes in Computer Science, pages 643--644. Springer Berlin \/ Heidelberg, 2004."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2000.855850"},{"volume-title":"Die mecklenburgischen domainenbauern und die mecklenburgische verfassung. Die Grenzboten, 28.2.1:20 ff","year":"1869","key":"e_1_3_2_1_6_1","unstructured":"Miscellaneous. Die mecklenburgischen domainenbauern und die mecklenburgische verfassung. Die Grenzboten, 28.2.1:20 ff , 1869 . Miscellaneous. Die mecklenburgischen domainenbauern und die mecklenburgische verfassung. Die Grenzboten, 28.2.1:20 ff, 1869."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/519627.790277"},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of the IEEE Workshop on Graph Algorithms and Computer Vision","author":"Shokoufandeh A.","year":"1999","unstructured":"A. Shokoufandeh and S. Dickinson . Applications of bipartite matching to problems in object recognition . In Proceedings of the IEEE Workshop on Graph Algorithms and Computer Vision , 1999 . A. Shokoufandeh and S. Dickinson. Applications of bipartite matching to problems in object recognition. In Proceedings of the IEEE Workshop on Graph Algorithms and Computer Vision, 1999."},{"key":"e_1_3_2_1_9_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/3-540-45129-3_6","volume-title":"C. Arcelli, L. Cordella, and G. di Baja","author":"Shokoufandeh A.","year":"2001","unstructured":"A. Shokoufandeh and S. Dickinson . A unified framework for indexing and matching hierarchical shape structures . In C. Arcelli, L. Cordella, and G. di Baja , editors, Visual Form 2001 , volume 2059 of Lecture Notes in Computer Science , pages 67 -- 84 . Springer Berlin \/ Heidelberg , 2001. A. Shokoufandeh and S. Dickinson. A unified framework for indexing and matching hierarchical shape structures. In C. Arcelli, L. Cordella, and G. di Baja, editors, Visual Form 2001, volume 2059 of Lecture Notes in Computer Science, pages 67--84. Springer Berlin \/ Heidelberg, 2001."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/938978.939101"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1860559.1860606"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/829510.830339"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12297-2_44"}],"event":{"name":"DocEng '11: ACM Symposium on Document Engineering","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGDOC ACM Special Interest Group for Design of Communications"],"location":"Mountain View California USA","acronym":"DocEng '11"},"container-title":["Proceedings of the 11th ACM symposium on Document engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2034691.2034712","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2034691.2034712","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:48:38Z","timestamp":1750240118000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2034691.2034712"}},"subtitle":["the junction neighbourhood histogram"],"short-title":[],"issued":{"date-parts":[[2011,9,19]]},"references-count":13,"alternative-id":["10.1145\/2034691.2034712","10.1145\/2034691"],"URL":"https:\/\/doi.org\/10.1145\/2034691.2034712","relation":{},"subject":[],"published":{"date-parts":[[2011,9,19]]},"assertion":[{"value":"2011-09-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}