Graph matching by simplified convex-concave relaxation procedure

DOI10.1007/S11263-014-0707-7MaRDI QIDQ903552zbMATH OpenOpenAlexFDO

Authors H. Qiao, Xu Yang, Steven C. H. Hoi, 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

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

Recommendations

• On convex relaxation of graph isomorphism
• Lagrangian relaxation graph matching
• Exact recovery with symmetries for the doubly stochastic relaxation
• scientific article; zbMATH DE number 2040635
• On spectral properties for graph matching and graph isomorphism problems

Cites work

• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• An eigendecomposition approach to weighted graph matching problems
• Geometric latent Dirichlet allocation on a matching graph for large-scale image datasets
• Statistical inference on parametric part for partially linear single-index model
• Unsupervised learning for graph matching

Cited in

(12)

• Exact recovery with symmetries for the doubly stochastic relaxation
• A quadratic penalty method for hypergraph matching
• Graph matching with hierarchical discrete relaxation
• scientific article; zbMATH DE number 2090220 (Why is no real title available?)
• Lagrangian relaxation graph matching
• scientific article; zbMATH DE number 2040635 (Why is no real title available?)
• An algorithm for weighted sub-graph matching based on gradient flows
• scientific article; zbMATH DE number 1844618 (Why is no real title available?)
• 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
• Efficient joint object matching via linear programming
• On convex relaxation of graph isomorphism

Describes a project that uses

Uses Software

• CASIA

This page was built for publication: Graph matching by simplified convex-concave relaxation procedure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q903552)