Graph matching by simplified convex-concave relaxation procedure
From MaRDI portal
Publication:903552
DOI10.1007/S11263-014-0707-7zbMATH Open1328.68186OpenAlexW2165107571MaRDI QIDQ903552FDOQ903552
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
Recommendations
combinatorial optimizationgraph matchingdeterministic annealingfeature correspondencegraduated optimization
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- An eigendecomposition approach to weighted graph matching problems
- 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
Cited In (12)
- A quadratic penalty method for hypergraph matching
- Graph matching with hierarchical discrete relaxation
- Title not available (Why is that?)
- Lagrangian relaxation graph matching
- Title not available (Why is that?)
- An algorithm for weighted sub-graph matching based on gradient flows
- Title not available (Why is that?)
- 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
- Exact recovery with symmetries for the doubly stochastic relaxation
Uses Software
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)
