Linear algorithm for motion estimation: How to handle degenerate cases

T. S. Huang, Y. S. Shim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

For determining motion/structure of a 3-D rigid object from point correspondences over two perspective views, a linear algorithm was developed in Refs. 1 and 2. This algorithm fails when the 3-D points under observation satisfy certain geometrical constraints, as demonstrated in Refs. 3 and 4. In the present paper, we show that the linear algorithm can be resurrected in these degenerate cases.

Original languageEnglish (US)
Title of host publicationPattern Recognition - 4th International Conference, Proceedings
EditorsJ. Kittler
PublisherSpringer
Pages439-447
Number of pages9
ISBN (Print)9783540190363
DOIs
StatePublished - 1988
Event4th International Conference on Pattern Recognition, 1988 - Cambridge, United Kingdom
Duration: Mar 28 1988Mar 30 1988

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume301 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other4th International Conference on Pattern Recognition, 1988
Country/TerritoryUnited Kingdom
CityCambridge
Period3/28/883/30/88

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Linear algorithm for motion estimation: How to handle degenerate cases'. Together they form a unique fingerprint.

Cite this