SuperMatching : feature matching using supersymmetric geometric constraints
Feature matching is a challenging problem at the heart of numerous computer graphics and computer vision applications. We present the SuperMatching algorithm for finding correspondences between two sets of features. It does so by considering triples or higher order tuples of points, going beyond the...
Description complète
Détails bibliographiques
| Publié dans: | IEEE transactions on visualization and computer graphics. - 1998. - 19(2013), 11 vom: 12. Nov., Seite 1885-94
|
|---|
| Auteur principal: |
Cheng, Zhi-Quan
(Auteur) |
|---|
| Autres auteurs: |
Chen, Yin,
Martin, Ralph R,
Lai, Yu-Kun,
Wang, Aiping |
|---|
| Format: | Article en ligne
|
|---|
| Langue: | English |
|---|
| Publié: |
2013
|
|---|
| Accès à la collection: | IEEE transactions on visualization and computer graphics
|
|---|
| Sujets: | Journal Article
Research Support, Non-U.S. Gov't |
|---|