{"id":"https://openalex.org/W2176576141","doi":"https://doi.org/10.1109/lsp.2015.2501546","title":"A Path-following Algorithm for Robust Point Matching","display_name":"A Path-following Algorithm for Robust Point Matching","publication_year":2015,"publication_date":"2015-11-18","ids":{"openalex":"https://openalex.org/W2176576141","doi":"https://doi.org/10.1109/lsp.2015.2501546","mag":"2176576141"},"language":"en","primary_location":{"id":"doi:10.1109/lsp.2015.2501546","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lsp.2015.2501546","pdf_url":null,"source":{"id":"https://openalex.org/S120629676","display_name":"IEEE Signal Processing Letters","issn_l":"1070-9908","issn":["1070-9908","1558-2361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Signal Processing Letters","raw_type":"journal-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/A5100686312","display_name":"Wei Lian","orcid":null},"institutions":[{"id":"https://openalex.org/I115067436","display_name":"Changzhi University","ror":"https://ror.org/04svmxd14","country_code":"CN","type":"education","lineage":["https://openalex.org/I115067436"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Wei Lian","raw_affiliation_strings":["Department of Computer Science, Changzhi University, Changzhi, Shanxi, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Changzhi University, Changzhi, Shanxi, China","institution_ids":["https://openalex.org/I115067436"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100686312"],"corresponding_institution_ids":["https://openalex.org/I115067436"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.10864157,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"23","issue":"1","first_page":"89","last_page":"93"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9987999796867371,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.7343969345092773},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.609872043132782},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6078895926475525},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5485117435455322},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.4957626760005951},{"id":"https://openalex.org/keywords/term","display_name":"Term (time)","score":0.4827520251274109},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47447019815444946},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.47300535440444946},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46665048599243164},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4554843306541443},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4297780394554138},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.41665780544281006},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.38795047998428345},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14277306199073792}],"concepts":[{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.7343969345092773},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.609872043132782},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6078895926475525},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5485117435455322},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.4957626760005951},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.4827520251274109},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47447019815444946},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.47300535440444946},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46665048599243164},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4554843306541443},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4297780394554138},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.41665780544281006},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.38795047998428345},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14277306199073792},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lsp.2015.2501546","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lsp.2015.2501546","pdf_url":null,"source":{"id":"https://openalex.org/S120629676","display_name":"IEEE Signal Processing Letters","issn_l":"1070-9908","issn":["1070-9908","1558-2361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Signal Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1826433370","https://openalex.org/W2049981393","https://openalex.org/W2051906608","https://openalex.org/W2053913299","https://openalex.org/W2102895109","https://openalex.org/W2105996029","https://openalex.org/W2107855892","https://openalex.org/W2118104180","https://openalex.org/W2134236847","https://openalex.org/W2139688603","https://openalex.org/W2148821982","https://openalex.org/W2150190641","https://openalex.org/W2154566680","https://openalex.org/W2155775869","https://openalex.org/W2165107571","https://openalex.org/W2166524953","https://openalex.org/W2166820607","https://openalex.org/W2171490473","https://openalex.org/W2336641195"],"related_works":["https://openalex.org/W1592682627","https://openalex.org/W4295762832","https://openalex.org/W2054458431","https://openalex.org/W2371352078","https://openalex.org/W2366714142","https://openalex.org/W2945016732","https://openalex.org/W2362975861","https://openalex.org/W2358102224","https://openalex.org/W2040300855","https://openalex.org/W2290243676"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,12,50,60],"new":[3],"point":[4,26],"matching":[5,15,27,96],"algorithm":[6],"in":[7],"this":[8,33,46],"letter":[9],"by":[10,58],"minimizing":[11],"concave":[13,94],"geometric":[14,95],"cost":[16,97],"function":[17,22,67],"coming":[18],"from":[19,72],"the":[20,24,65,73,81,85,93,106],"objective":[21,66],"of":[23,32,80,92,105],"robust":[25],"algorithm.":[28],"Due":[29],"to":[30,64,84],"concavity":[31],"function,":[34],"naive":[35],"optimization":[36,55],"strategies":[37],"such":[38],"as":[39],"gradient":[40],"descent":[41],"will":[42],"fail.":[43],"To":[44],"address":[45],"problem,":[47],"we":[48],"use":[49],"path":[51],"following":[52],"strategy":[53],"for":[54],"which":[56],"works":[57],"adding":[59],"convex":[61,82],"quadratic":[62],"term":[63,83],"and":[68,112],"then":[69],"gradually":[70],"transitioning":[71],"state":[74,86],"that":[75,87],"there":[76,88],"is":[77,89],"only":[78,90],"weight":[79,91],"term.":[98],"Extensive":[99],"experimental":[100],"results":[101],"demonstrate":[102],"strong":[103],"robustness":[104],"method":[107],"over":[108],"several":[109],"state-of-the-art":[110],"methods":[111],"it":[113],"also":[114],"has":[115],"good":[116],"computational":[117],"efficiency.":[118]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}