Layered graph matching with composite cluster sampling
This paper presents a framework of layered graph matching for integrating graph partition and matching. The objective is to find an unknown number of corresponding graph structures in two images. We extract discriminative local primitives from both images and construct a candidacy graph whose vertic...
Publié dans: | IEEE transactions on pattern analysis and machine intelligence. - 1998. - 32(2010), 8 vom: 18. Aug., Seite 1426-42 |
---|---|
Auteur principal: | |
Autres auteurs: | , |
Format: | Article en ligne |
Langue: | English |
Publié: |
2010
|
Accès à la collection: | IEEE transactions on pattern analysis and machine intelligence |
Sujets: | Journal Article Research Support, Non-U.S. Gov't Research Support, U.S. Gov't, Non-P.H.S. |
Accès en ligne |
Volltext |