Efficient feature matching via nonnegative orthogonal relaxation

DOI10.1007/S11263-019-01185-1zbMath1477.68376OpenAlexW2947032895WikidataQ127759519 ScholiaQ127759519MaRDI QIDQ2193822

Bo Jiang, Bin Luo, Jin Tang

Publication date: 20 August 2020

Published in: International Journal of Computer Vision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11263-019-01185-1

zbMATH Keywords

feature matchingmultiplicative updateinteger quadratic programmingnonnegative orthogonal constraint

Mathematics Subject Classification ID

Integer programming (90C10) Quadratic programming (90C20) Machine vision and scene understanding (68T45)

Uses Software

• CASIA
• Gracker

Cites Work

• Unsupervised learning for graph matching
• Graph matching by simplified convex-concave relaxation procedure
• Concerning nonnegative matrices and doubly stochastic matrices
• An eigendecomposition approach to weighted graph matching problems
• Robust Point Matching via Vector Field Consensus
• Learning Correspondence Structures for Person Re-Identification

This page was built for publication: Efficient feature matching via nonnegative orthogonal relaxation