Subgraph Matching with Semidefinite Programming

DOI10.1016/S1571-0653(04)00493-7MaRDI QIDQ3438926zbMATH OpenOpenAlexFDO

Authors Christian Schellewald, Christoph Schnörr

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s1571-0653(04)00493-7

zbMATH Keywords

combinatorial optimizationsemidefinite programmingobject recognitionsubgraph matching

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 2088028
• scientific article; zbMATH DE number 1844618
• Efficient joint object matching via linear programming
• On convex relaxation of graph isomorphism
• scientific article; zbMATH DE number 2086428

Cites work

• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 1302195 (Why is no real title available?)
• scientific article; zbMATH DE number 2040635 (Why is no real title available?)
• A fast dynamic link matching algorithm for invariant pattern recognition
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Object representation in computer vision. International NSF-ARPA Workshop, New York City, NY, USA, December 5-7, 1994. Proceedings
• Semidefinite Programming
• Solving quadratic assignment problems using convex quadratic programming relaxations

Cited in

(8)

• Simultaneous camera pose and correspondence estimation with motion coherence
• scientific article; zbMATH DE number 6297805 (Why is no real title available?)
• Solving subgraph isomorphism problems with constraint programming
• Graph-Based Representations in Pattern Recognition
• Efficient subgraph matching using topological node feature constraints
• Image clustering based on sparse patch alignment framework
• A convex relaxation bound for subgraph isomorphism
• Efficient joint object matching via linear programming

This page was built for publication: Subgraph Matching with Semidefinite Programming

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