Geometric Matching in Computer Vision--Algorithms and Open Problems

In this paper, I review and discuss recent advances in the development of algorithms for solving the kinds of geometric matching problems that occur in computer vision, in particular under bounded error models. I examine both the one-model case (recognition) and the many-model case (indexing), and I discuss some open problems and directions for research.


Year:
1993
Publisher:
IDIAP
Keywords:
Laboratories:




 Record created 2006-03-10, last modified 2018-03-17

n/a:
Download fulltextPDF
External link:
Download fulltextURL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)