Graph Matching by Simplified Convex-Concave Relaxation Procedure

• Main Authors: LIU, Zhiyong, QIAO, Hong, YANG, Xu, HOI, Steven C. H.
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2014
• Subjects: Graph matching; Combinatorial optimization; Deterministic annealing; Graduated optimization; Feature correspondence; Computer Sciences; Databases and Information Systems
• Online Access: https://ink.library.smu.edu.sg/sis_research/2286; https://ink.library.smu.edu.sg/context/sis_research/article/3286/viewcontent/Graph_Matching_by_Simplified_Convex_Concave_Relaxation_Procedure.pdf
• Institution: Singapore Management University

The convex and concave relaxation procedure (CCRP) was recently proposed and exhibited state-of-the-art performance on the graph matching problem. However, CCRP involves explicitly both convex and concave relaxations which typically are difficult to find, and thus greatly limit its practical applica...