{"id":"https://openalex.org/W1917573513","doi":"https://doi.org/10.1109/cvpr.2015.7299142","title":"Subgraph matching using compactness prior for robust feature correspondence","display_name":"Subgraph matching using compactness prior for robust feature correspondence","publication_year":2015,"publication_date":"2015-06-01","ids":{"openalex":"https://openalex.org/W1917573513","doi":"https://doi.org/10.1109/cvpr.2015.7299142","mag":"1917573513"},"language":"en","primary_location":{"id":"doi:10.1109/cvpr.2015.7299142","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2015.7299142","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)","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/A5104016960","display_name":"Yumin Suh","orcid":null},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Yumin Suh","raw_affiliation_strings":["Department of ECE, Seoul National University, Seoul, Korea","Department of ECE, ASRI, Seoul National University, Korea"],"affiliations":[{"raw_affiliation_string":"Department of ECE, Seoul National University, Seoul, Korea","institution_ids":["https://openalex.org/I139264467"]},{"raw_affiliation_string":"Department of ECE, ASRI, Seoul National University, Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081148743","display_name":"Kamil Adamczewski","orcid":"https://orcid.org/0000-0002-2917-4392"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Kamil Adamczewski","raw_affiliation_strings":["Department of ECE, Seoul National University, Seoul, Korea","Department of ECE, ASRI, Seoul National University, Korea"],"affiliations":[{"raw_affiliation_string":"Department of ECE, Seoul National University, Seoul, Korea","institution_ids":["https://openalex.org/I139264467"]},{"raw_affiliation_string":"Department of ECE, ASRI, Seoul National University, Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046504049","display_name":"Kyoung Mu Lee","orcid":"https://orcid.org/0000-0001-7210-1036"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Kyoung Mu Lee","raw_affiliation_strings":["Department of ECE, Seoul National University, Seoul, Korea","Department of ECE, ASRI, Seoul National University, Korea"],"affiliations":[{"raw_affiliation_string":"Department of ECE, Seoul National University, Seoul, Korea","institution_ids":["https://openalex.org/I139264467"]},{"raw_affiliation_string":"Department of ECE, ASRI, Seoul National University, Korea","institution_ids":["https://openalex.org/I139264467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5104016960"],"corresponding_institution_ids":["https://openalex.org/I139264467"],"apc_list":null,"apc_paid":null,"fwci":1.2887,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.86172993,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"5070","last_page":"5078"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"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/T11106","display_name":"Data Management and Algorithms","score":0.9987999796867371,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/outlier","display_name":"Outlier","score":0.6052156090736389},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5633310079574585},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5449929237365723},{"id":"https://openalex.org/keywords/compact-space","display_name":"Compact space","score":0.5361112952232361},{"id":"https://openalex.org/keywords/precision-and-recall","display_name":"Precision and recall","score":0.5261998772621155},{"id":"https://openalex.org/keywords/clutter","display_name":"Clutter","score":0.5169679522514343},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4827274978160858},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.463683545589447},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.45450693368911743},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.43532097339630127},{"id":"https://openalex.org/keywords/markov-chain-monte-carlo","display_name":"Markov chain Monte Carlo","score":0.42983928322792053},{"id":"https://openalex.org/keywords/feature-vector","display_name":"Feature vector","score":0.42854422330856323},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.4277816414833069},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4118993282318115},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2887161374092102},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22474709153175354},{"id":"https://openalex.org/keywords/bayesian-probability","display_name":"Bayesian probability","score":0.12798860669136047},{"id":"https://openalex.org/keywords/radar","display_name":"Radar","score":0.07849568128585815}],"concepts":[{"id":"https://openalex.org/C79337645","wikidata":"https://www.wikidata.org/wiki/Q779824","display_name":"Outlier","level":2,"score":0.6052156090736389},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5633310079574585},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5449929237365723},{"id":"https://openalex.org/C18648836","wikidata":"https://www.wikidata.org/wiki/Q381892","display_name":"Compact space","level":2,"score":0.5361112952232361},{"id":"https://openalex.org/C81669768","wikidata":"https://www.wikidata.org/wiki/Q2359161","display_name":"Precision and recall","level":2,"score":0.5261998772621155},{"id":"https://openalex.org/C132094186","wikidata":"https://www.wikidata.org/wiki/Q641585","display_name":"Clutter","level":3,"score":0.5169679522514343},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4827274978160858},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.463683545589447},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.45450693368911743},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.43532097339630127},{"id":"https://openalex.org/C111350023","wikidata":"https://www.wikidata.org/wiki/Q1191869","display_name":"Markov chain Monte Carlo","level":3,"score":0.42983928322792053},{"id":"https://openalex.org/C83665646","wikidata":"https://www.wikidata.org/wiki/Q42139305","display_name":"Feature vector","level":2,"score":0.42854422330856323},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.4277816414833069},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4118993282318115},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2887161374092102},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22474709153175354},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.12798860669136047},{"id":"https://openalex.org/C554190296","wikidata":"https://www.wikidata.org/wiki/Q47528","display_name":"Radar","level":2,"score":0.07849568128585815},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cvpr.2015.7299142","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2015.7299142","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W35665245","https://openalex.org/W115730240","https://openalex.org/W1503398984","https://openalex.org/W1582614941","https://openalex.org/W1587878450","https://openalex.org/W1676552347","https://openalex.org/W1744214816","https://openalex.org/W1988650493","https://openalex.org/W1998840160","https://openalex.org/W2074972585","https://openalex.org/W2076080556","https://openalex.org/W2078789330","https://openalex.org/W2079272365","https://openalex.org/W2091408439","https://openalex.org/W2094539604","https://openalex.org/W2098894541","https://openalex.org/W2101639445","https://openalex.org/W2103375950","https://openalex.org/W2107855892","https://openalex.org/W2121225280","https://openalex.org/W2124404372","https://openalex.org/W2138910149","https://openalex.org/W2142726150","https://openalex.org/W2150760714","https://openalex.org/W2151103935","https://openalex.org/W2152953631","https://openalex.org/W2158256890","https://openalex.org/W2159537329","https://openalex.org/W2166820607","https://openalex.org/W2170432751","https://openalex.org/W3152330821","https://openalex.org/W6637324600","https://openalex.org/W6670543124","https://openalex.org/W6675328369","https://openalex.org/W6675352095","https://openalex.org/W6682759379"],"related_works":["https://openalex.org/W2130674020","https://openalex.org/W2093748878","https://openalex.org/W2121543990","https://openalex.org/W2333771223","https://openalex.org/W2402800040","https://openalex.org/W4252969132","https://openalex.org/W2000020320","https://openalex.org/W2120056845","https://openalex.org/W2805799113","https://openalex.org/W1981531423"],"abstract_inverted_index":{"Feature":[0],"correspondence":[1,81],"plays":[2],"a":[3,16,69,87,94,101,123],"central":[4],"role":[5],"in":[6],"various":[7],"computer":[8],"vision":[9],"applications.":[10],"It":[11],"is":[12],"widely":[13],"formulated":[14,85],"as":[15,29,86],"graph":[17,48],"matching":[18,89,97],"problem":[19],"due":[20],"to":[21],"its":[22,65],"robust":[23],"performance":[24,165],"under":[25,166],"challenging":[26,167],"conditions,":[27],"such":[28],"background":[30],"clutter,":[31],"object":[32],"deformation":[33,173],"and":[34,41,78,111,159,172],"repetitive":[35],"patterns.":[36],"A":[37],"variety":[38],"of":[39,52,59,141],"fast":[40],"accurate":[42],"algorithms":[43],"have":[44],"been":[45],"proposed":[46,157],"for":[47],"matching.":[49],"However,":[50],"most":[51],"them":[53],"focus":[54],"on":[55,126,135],"improving":[56],"the":[57,60,117,136,142,149,163],"recall":[58,79],"solution":[61,70,144,150],"while":[62],"rarely":[63],"considering":[64],"precision,":[66],"thus":[67],"inducing":[68],"with":[71],"numerous":[72],"outliers.":[73,114],"To":[74,115],"address":[75],"both":[76,170],"precision":[77],"feature":[80],"should":[82],"rather":[83],"be":[84],"subgraph":[88,96],"problem.":[90],"This":[91],"paper":[92],"proposes":[93],"new":[95,118],"formulation":[98,158],"which":[99],"uses":[100],"compactness":[102],"prior,":[103],"an":[104],"additional":[105],"constraint":[106],"that":[107,155],"prefers":[108],"sparser":[109],"solutions":[110],"effectively":[112],"eliminates":[113],"solve":[116],"optimization":[119],"problem,":[120],"we":[121],"propose":[122],"meta-algorithm":[124],"based":[125],"Markov":[127,133],"chain":[128,134],"Monte":[129],"Carlo.":[130],"By":[131],"constructing":[132],"restricted":[137],"search":[138],"space":[139],"instead":[140],"original":[143],"space,":[145],"our":[146,156],"method":[147],"approximates":[148],"effectively.":[151],"The":[152],"experiments":[153],"indicate":[154],"algorithm":[160],"significantly":[161],"improve":[162],"baseline":[164],"conditions":[168],"when":[169],"outliers":[171],"noise":[174],"are":[175],"present.":[176]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}