Graph matching by simplified convex-concave relaxation procedure

DOI10.1007/s11263-014-0707-7zbMath1328.68186OpenAlexW2165107571MaRDI 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

zbMATH Keywords

combinatorial optimizationgraph matchingdeterministic annealingfeature correspondencegraduated optimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Pattern recognition, speech recognition (68T10)

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

• CASIA

Cites Work

• Geometric latent Dirichlet allocation on a matching graph for large-scale image datasets
• Unsupervised learning for graph matching
• Statistical inference on parametric part for partially linear single-index model
• An eigendecomposition approach to weighted graph matching problems
• Unnamed Item
• Unnamed Item