scholarly journals A Linear Method to Derive 3D Projective Invariants from 4 Uncalibrated Images

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
YuanBin Wang ◽  
XingWei Wang ◽  
Bin Zhang ◽  
Ying Wang

A well-known method proposed by Quan to compute projective invariants of 3D points uses six points in three 2D images. The method is nonlinear and complicated. It usually produces three possible solutions. It is noted previously that the problem can be solved directly and linearly using six points in five images. This paper presents a method to compute projective invariants of 3D points from four uncalibrated images directly. For a set of six 3D points in general position, we choose four of them as the reference basis and represent the other two points under this basis. It is known that the cross ratios of the coefficients of these representations are projective invariant. After a series of linear transformations, a system of four bilinear equations in the three unknown projective invariants is derived. Systems of nonlinear multivariable equations are usually hard to solve. We show that this form of equations can be solved linearly and uniquely. This finding is remarkable. It means that the natural configuration of the projective reconstruction problem might be six points and four images. The solutions are given in explicit formulas.

2016 ◽  
Vol 2016 ◽  
pp. 1-14
Author(s):  
Yuanbin Wang ◽  
Xingwei Wang ◽  
Bin Zhang

The projective reconstruction of 3D structures from 2D images is a central problem in computer vision. Existing methods for this problem are usually nonlinear or indirect. In the previous direct methods, we usually have to solve a system of nonlinear equations. They are very complicated and hard to implement. The previous linear indirect methods are usually imprecise. This paper presents a linear and direct method to derive projective structures of 3D points from their 2D images. Algorithms to compute projective invariants from two images, three images, and four images are given. The method is clear, simple, and easy to implement. For the first time in the literature, we present explicit linear formulas to solve this problem.Mathematicacodes are provided to demonstrate the correctness of the formulas.


1995 ◽  
Vol 31 (25) ◽  
pp. 2162-2163
Author(s):  
Yan Xiong ◽  
Jia-xiong Peng ◽  
Ming-yue Ding ◽  
Dong-hui Xue

2020 ◽  
Vol 29 (1) ◽  
pp. 3-20
Author(s):  
Marina Bertolini ◽  
Luca Magri

In the context of multiple view geometry, images of static scenes are modeled as linear projections from a projective space P^3 to a projective plane P^2 and, similarly, videos or images of suitable dynamic or segmented scenes can be modeled as linear projections from P^k to P^h, with k>h>=2. In those settings, the projective reconstruction of a scene consists in recovering the position of the projected objects and the projections themselves from their images, after identifying many enough correspondences between the images. A critical locus for the reconstruction problem is a configuration of points and of centers of projections, in the ambient space, where the reconstruction of a scene fails. Critical loci turn out to be suitable algebraic varieties. In this paper we investigate those critical loci which are hypersurfaces in high dimension complex projective spaces, and we determine their equations. Moreover, to give evidence of some practical implications of the existence of these critical loci, we perform a simulated experiment to test the instability phenomena for the reconstruction of a scene, near a critical hypersurface.


1997 ◽  
Vol 30 (3) ◽  
pp. 513-517 ◽  
Author(s):  
Xiong Yan ◽  
Peng Jia-Xiong ◽  
Ding Ming-Yue ◽  
Xue Dong-Hui

2010 ◽  
Vol 43 (10) ◽  
pp. 3233-3242 ◽  
Author(s):  
Wang Yuanbin ◽  
Zhang Bin ◽  
Yao Tianshun

2006 ◽  
Vol 39 (5) ◽  
pp. 889-896 ◽  
Author(s):  
A.W.K. Tang ◽  
T.P. Ng ◽  
Y.S. Hung ◽  
C.H. Leung

Sign in / Sign up

Export Citation Format

Share Document