Computing Homographies from Three Lines or Points in an Image Pair
This paper deals with the computation of homographies from two views in a multi-plane scene. In the general case, homographies can be determined using four matched points or lines belonging to planes. We propose an alternative method when a first homography has been obtained, and then three matches are sufficient to compute a second homography. This process is based on the geometric constraint introduced by the first homography. In this work, the extraction and matching of features, points or lines, is automatically performed using robust techniques. Experimental results with synthetic data and real images show the advantages of this approach. Besides, the performance using points or lines as image features is compared.
KeywordsHomographies multi-plane scenes multi-view constraints point and line matching
- 1.Luong, Q., Faugeras, O.D.: Determining the fundamental matrix with planes: Unstability and new algorithms. In: Proc. Conference on Computer Vision and Pattern Recognition, pp. 489–494 (1993)Google Scholar
- 2.Vincent, E., Laganière, R.: Detecting planar homographies in an image pair. In: Proc. Second International Symposium on Image and Signal Processing and Analysis, pp. 182–187 (2001)Google Scholar
- 3.Shashua, A., Avidan, S.: The rank 4 constraint in multiple (≥ 3) view geometry. In: Proc. European Conf. Computer Vision, St. Louis, Missouri, pp. 196–206 (1996)Google Scholar
- 4.Zelnik-Manor, L., Irani, M.: Multiview subspace constraints on homographies. In: Proc. Int. Conf. Computer Vision, St. Louis, Missouri, pp. 710–715 (1999)Google Scholar
- 9.Van-Gool, L., Proesmans, M., Zisserman, A.: Grouping and invariants using planar homologies. In: Workshop on Geometrical Modeling and Invariants for Computer Vision (1995)Google Scholar