Lagrangian relaxation graph matching

DOI10.1016/J.PATCOG.2016.07.021zbMath1428.68310OpenAlexW2473511884MaRDI QIDQ2289603

Bin Luo, Jin Tang, Bo Jiang, Xiao-chun Cao

Publication date: 23 January 2020

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2016.07.021

zbMATH Keywords

Lagrangian relaxationgraph matchingmultiplicative updateinteger quadratic programming

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Machine vision and scene understanding (68T45)

Uses Software

• QAPLIB

Cites Work

• A sparse nonnegative matrix factorization technique for graph matching problems
• QAPLIB - a quadratic assignment problem library
• Spectral embedding of graphs.
• Robust Feature Point Matching With Sparse Model
• Learning with $\ell ^{1}$-graph for image analysis
• Compressed sensing

This page was built for publication: Lagrangian relaxation graph matching