Geometric Matching in Computer Vision--Algorithms and Open Problems
| Type of publication: | Idiap-RR |
| Citation: | breuel-93.03 |
| Number: | Idiap-RR-07-1993 |
| Year: | 1993 |
| Institution: | IDIAP |
| Abstract: | 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. |
| Userfields: | ipdmembership={vision} |
| Keywords: | |
| Projects: |
Idiap |
| Authors: | |
| Added by: | [UNK] |
| Total mark: | 0 |
|
Attachments
|
|
|
|
|
Notes
|
|
|
|
|
