Optimal multi-scale matching

Michael S. Lew, Thomas S. Huang

Research output: Contribution to journalConference articlepeer-review

Abstract

The coarse-to-fine search strategy is extensively used in current reported research. However, it has the same problems as any hill climbing algorithm, most importantly, it often finds local instead of global minima. Drawing upon the artificial intelligence literature, we applied an optimal graph search, namely A*, to the problem. Using real stereo and video test sets, we compared the A* method to both template and hill climbing. Our results show that A* has greater accuracy than the ubiquitous coarse-to-fine hill climbing pyramidal search algorithm in both stereo matching and motion tracking.

Original languageEnglish (US)
Pages (from-to)88-93
Number of pages6
JournalProceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Volume1
StatePublished - Jan 1 1999
Externally publishedYes
EventProceedings of the 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'99) - Fort Collins, CO, USA
Duration: Jun 23 1999Jun 25 1999

ASJC Scopus subject areas

  • Software
  • Computer Vision and Pattern Recognition

Fingerprint

Dive into the research topics of 'Optimal multi-scale matching'. Together they form a unique fingerprint.

Cite this