A Tensor-Based Algorithm for High-Order Graph Matching

A Tensor-Based Algorithm for High-Order Graph Matching

This paper addresses the problem of establishing correspondences between two sets of visual features using higher order constraints instead of the unary or pairwise ones used in classical methods. Concretely, the corresponding hypergraph matching problem is formulated as the maximization of a multil...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on pattern analysis and machine intelligence. - 1979. - 33(2011), 12 vom: 07. Dez., Seite 2383-95
1. Verfasser: Duchenne, Olivier (VerfasserIn)
Weitere Verfasser: Bach, Francis, Kweon, In-So, Ponce, Jean
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2011
Zugriff auf das übergeordnete Werk:IEEE transactions on pattern analysis and machine intelligence
Schlagworte:Journal Article Research Support, Non-U.S. Gov't
Online verfügbar Volltext