Graph-based methods for vision: A Yorkist manifesto

DOI10.1007/3-540-70659-3_3MaRDI QIDQ4808922zbMATH OpenFDO

Authors Edwin R. Hancock, Richard C. Wilson, Richard C. Wilson

Publication date 12 August 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/2396/23960031.htm

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Machine vision and scene understanding (68T45)

Recommendations

• scientific article; zbMATH DE number 6746354
• Recent advance on graph matching in computer vision: from two-graph matching to multi-graph matching
• The graph matching problem
• Graph-theoretical methods in computer vision
• Graph matching with nonnegative sparse model

Cited in

(8)

• Preface of special issue on ``Graph-based processing for pattern recognition
• An efficient A^* based algorithm for optimal graph matching applied to computer vision
• Unsupervised learning for graph matching
• Graph-theoretical methods in computer vision
• Graph matching with nonnegative sparse model
• Recent advance on graph matching in computer vision: from two-graph matching to multi-graph matching
• Grouping Using Factor Graphs: An Approach for Finding Text with a Camera Phone
• Structural, Syntactic, and Statistical Pattern Recognition

This page was built for publication: Graph-based methods for vision: A Yorkist manifesto

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