Graph matching by simplified convex-concave relaxation procedure
From MaRDI portal
Publication:903552
DOI10.1007/s11263-014-0707-7zbMath1328.68186MaRDI QIDQ903552
Steven C. H. Hoi, Xu Yang, Hong Qiao, Zhi-yong Liu
Publication date: 6 January 2016
Published in: International Journal of Computer Vision (Search for Journal in Brave)
Full work available at URL: https://ink.library.smu.edu.sg/sis_research/2286
combinatorial optimization; graph matching; deterministic annealing; feature correspondence; graduated optimization
Related Items
An algorithm for weighted sub-graph matching based on gradient flows, Efficient feature matching via nonnegative orthogonal relaxation, Dual \(L_1\)-normalized context aware tensor power iteration and its applications to multi-object tracking and multi-graph matching
Uses Software
Cites Work