The authors present a method which reduces an n-point problem to a set of four-point problems. The effort of reduction takes O(n) steps and it also takes O(n) steps to construct all possible mappings of an n-point set from the solution to a four-problem. Other results include (1) coplanarity condition of four points in two views, (2) recovering the tilt direction of the rotational axis using four points in two views, and (3) recovering the scaling factor.
|Original language||English (US)|
|Title of host publication||Proc CVPR 88 Comput Soc Conf on Comput Vision and Pattern Recognit|
|Publisher||Publ by IEEE|
|Number of pages||6|
|State||Published - Dec 1 1988|
|Name||Proc CVPR 88 Comput Soc Conf on Comput Vision and Pattern Recognit|
ASJC Scopus subject areas