{"id":"https://openalex.org/W2122499640","doi":"https://doi.org/10.1109/iccv.2007.4409018","title":"Fast Matching of Planar Shapes in Sub-cubic Runtime","display_name":"Fast Matching of Planar Shapes in Sub-cubic Runtime","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2122499640","doi":"https://doi.org/10.1109/iccv.2007.4409018","mag":"2122499640"},"language":"en","primary_location":{"id":"doi:10.1109/iccv.2007.4409018","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccv.2007.4409018","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE 11th International Conference on Computer Vision","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109842006","display_name":"F. Schmidt","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Frank R. Schmidt","raw_affiliation_strings":["Computer Science Department, University of Bonn, Germany","University of Bonn, Bonn#TAB#"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]},{"raw_affiliation_string":"University of Bonn, Bonn#TAB#","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108362750","display_name":"Dirk Farin","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Dirk Farin","raw_affiliation_strings":["University of Technology, Eindhoven, Netherlands","University of Technology, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"University of Technology, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087710605","display_name":"Daniel Cremers","orcid":"https://orcid.org/0000-0002-3079-7984"},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Daniel Cremers","raw_affiliation_strings":["Computer Science Department, University of Bonn, Germany"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5109842006"],"corresponding_institution_ids":["https://openalex.org/I135140700"],"apc_list":null,"apc_paid":null,"fwci":5.8364,"has_fulltext":false,"cited_by_count":52,"citation_normalized_percentile":{"value":0.96788957,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12205","display_name":"Time Series Analysis and Forecasting","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12205","display_name":"Time Series Analysis and Forecasting","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T14339","display_name":"Image Processing and 3D Reconstruction","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10824","display_name":"Image Retrieval and Classification Techniques","score":0.9861000180244446,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6139106154441833},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5242586135864258},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5131364464759827},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.49476927518844604},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4848443269729614},{"id":"https://openalex.org/keywords/torus","display_name":"Torus","score":0.4723687767982483},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4476550817489624},{"id":"https://openalex.org/keywords/dynamic-time-warping","display_name":"Dynamic time warping","score":0.43142208456993103},{"id":"https://openalex.org/keywords/encode","display_name":"ENCODE","score":0.42527514696121216},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.4248099625110626},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.41639429330825806},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3800289034843445},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36485999822616577},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.31656235456466675},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21470844745635986},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.19526192545890808}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6139106154441833},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5242586135864258},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5131364464759827},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.49476927518844604},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4848443269729614},{"id":"https://openalex.org/C9767117","wikidata":"https://www.wikidata.org/wiki/Q12510","display_name":"Torus","level":2,"score":0.4723687767982483},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4476550817489624},{"id":"https://openalex.org/C88516994","wikidata":"https://www.wikidata.org/wiki/Q1268863","display_name":"Dynamic time warping","level":2,"score":0.43142208456993103},{"id":"https://openalex.org/C66746571","wikidata":"https://www.wikidata.org/wiki/Q1134833","display_name":"ENCODE","level":3,"score":0.42527514696121216},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.4248099625110626},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.41639429330825806},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3800289034843445},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36485999822616577},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31656235456466675},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21470844745635986},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.19526192545890808},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/iccv.2007.4409018","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccv.2007.4409018","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE 11th International Conference on Computer Vision","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.75.3158","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.75.3158","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://vca.ele.tue.nl/publications/data/Farin2007d.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.92.5906","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.92.5906","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-cvpr.iai.uni-bonn.de/pub/pub/SFC-07.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W177978885","https://openalex.org/W854934217","https://openalex.org/W1501400124","https://openalex.org/W1553058108","https://openalex.org/W1571000340","https://openalex.org/W1997669059","https://openalex.org/W2021202955","https://openalex.org/W2050831357","https://openalex.org/W2112074894","https://openalex.org/W2130118085","https://openalex.org/W2131529365","https://openalex.org/W2136706845","https://openalex.org/W2143357187","https://openalex.org/W2341171179","https://openalex.org/W6607241450","https://openalex.org/W6629865678","https://openalex.org/W6633241604","https://openalex.org/W6704298589"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294","https://openalex.org/W143403600","https://openalex.org/W2761711678"],"abstract_inverted_index":{"The":[0],"matching":[1,74,111],"of":[2,11,27,34,64,78,128],"planar":[3],"shapes":[4],"can":[5,43],"be":[6,44],"cast":[7,71],"as":[8,76],"a":[9,17,85,126,129],"problem":[10,42,75],"finding":[12,79],"the":[13,21,25,28,31,50,54,62,72,80,105],"shortest":[14,81,94],"path":[15,83],"through":[16],"graph":[18,29],"spanned":[19],"by":[20],"two":[22],"shapes,":[23],"where":[24],"nodes":[26],"encode":[30],"local":[32],"similarity":[33],"respective":[35],"points":[36],"on":[37,84],"each":[38],"contour.":[39],"While":[40],"this":[41,68,93],"solved":[45],"using":[46],"dynamic":[47],"time":[48],"warping,":[49],"complete":[51],"search":[52],"over":[53],"initial":[55],"correspondence":[56],"leads":[57],"to":[58,91,123],"cubic":[59],"runtime":[60],"in":[61],"number":[63],"sample":[65],"points.":[66],"In":[67],"paper,":[69],"we":[70,118],"shape":[73,110,130],"one":[77],"circular":[82],"torus.":[86],"We":[87],"propose":[88],"an":[89,116],"algorithm":[90,107],"determine":[92],"cycle":[95],"which":[96],"has":[97],"provably":[98],"sub-cubic":[99],"runtime.":[100],"Numerical":[101],"experiments":[102],"demonstrate":[103],"that":[104,120],"proposed":[106],"provides":[108],"faster":[109],"than":[112],"previous":[113],"methods.":[114],"As":[115],"application,":[117],"show":[119],"it":[121],"allows":[122],"efficiently":[124],"compute":[125],"clustering":[127],"data":[131],"base.":[132]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}