Abstract
Some extended versions of the 8-point algorithm of H.C. Longuet-Higgins (1981, 1984) are presented. First, the algorithm is extended to (not necessarily rigid) affine transformations. Differentiable transformations are also discussed. Second, the solution of all the affine transformations for the 8-point algorithm, given any point correspondences, is shown to have dimension 9-r, where r is the rank of given point configuration. It is argued that degenerate cases considered by Longuet-Higgins are covered by present extended version. >
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
