Evaluation of convex optimization techniques for the weighted graph-matching problem in computer vision

DOI10.1007/3-540-45404-7_48MaRDI QIDQ4449679zbMATH OpenFDO

Authors Christian Schellewald, Stefan Roth, Christoph Schnörr

Publication date 11 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2191/21910361.htm

Mathematics Subject Classification ID

Machine vision and scene understanding (68T45) Computing methodologies and applications (68U99)

Recommendations

• On convex relaxation of graph isomorphism
• A dynamical systems approach to weighted graph matching
• Graph matching by simplified convex-concave relaxation procedure
• scientific article; zbMATH DE number 6746354
• Convex relaxations for binary image partitioning and perceptual grouping

Cited in

(7)

• A dynamical systems approach to weighted graph matching
• On convex relaxation of graph isomorphism
• Subgraph Matching with Semidefinite Programming
• A general system for heuristic minimization of convex functions over non-convex sets
• scientific article; zbMATH DE number 6746354 (Why is no real title available?)
• Graph matching based on similarities in structure and attributes
• Graph matching by simplified convex-concave relaxation procedure

Describes a project that uses

Uses Software

• QAPLIB

This page was built for publication: Evaluation of convex optimization techniques for the weighted graph-matching problem in computer vision

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