The representation and matching of categorical shape
2006 (English)In: Computer Vision and Image Understanding, ISSN 1077-3142, E-ISSN 1090-235X, Vol. 103, no 2, 139-154 p.Article in journal (Refereed) Published
We present a framework for categorical shape recognition. The coarse shape of an object is captured by a multiscale blob decomposition, representing the compact and elongated parts of an object at appropriate scales. These parts, in turn, map to nodes in a directed acyclic graph, in which edges encode both semantic relations (parent/child) as well as geometric relations. Given two image descriptions, each represented as a directed acyclic graph, we draw on spectral graph theory to derive a new algorithm for computing node correspondence in the presence of noise and occlusion. In computing correspondence, the similarity of two nodes is a function of their topological (graph) contexts.. their geometric (relational) contexts, and their node contents. We demonstrate the approach on the domain of view-based 3-D object recognition.
Place, publisher, year, edition, pages
2006. Vol. 103, no 2, 139-154 p.
generic object recognition, shape categorization, graph matching, scale-spaces, spectral graph theory, earth movers distance, subtree problem, curved objects, good algorithm, recognition, attention, spectra, model
IdentifiersURN: urn:nbn:se:kth:diva-15905DOI: 10.1016/j.cviu.2006.05.001ISI: 000239585800005ScopusID: 2-s2.0-33746037550OAI: oai:DiVA.org:kth-15905DiVA: diva2:333947
QC 201005252010-08-052010-08-05Bibliographically approved