• ETRI Journal
• /
• v.35 no.5
• /
• pp.939-942
• /
• 2013

We provide a new solution for the projective reconstruction problem based on coupled line cameras (CLCs) and their geometric properties. The proposed solution is composed of a series of optimized steps, and each step is more efficient than those of the initial solution proposed in [1]. We also give a new determinant condition for rectangle determination, which leads to less ambiguity in implementation. The key steps of the proposed solution can be represented with more compact analytic equations due to the intuitive geometric interpretations of the projective reconstruction problem based on CLCs: the center of projection corresponds to the intersection point of the two solution circles of each line camera involved.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.391-394
• /
• 2005

In this paper, we present an approach that is able to reconstruct 3 dimensional metric models from un-calibrated images acquired by a freely moved camera system. If nothing is known of the calibration of either camera, nor the arrangement of one camera which respect to the other, then the projective reconstruction will have projective distortion which expressed by an arbitrary projective transformation. The distortion on the reconstruction is removed from projection to metric through self-calibration. The self-calibration requires no information about the camera matrices, or information about the scene geometry. Self-calibration is the process of determining internal camera parameters directly from multiply un-calibrated images. Self-calibration avoids the onerous task of calibrating cameras which needs to use special calibration objects. The root of the method is setting a uniquely fixed conic(absolute quadric) in 3D space. And it can make possible to figure out some way from the images. Once absolute quadric is identified, the metric geometry can be computed. We compared reconstruction image from calibrated images with the result by self-calibration method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.2 s.302
• /
• pp.113-120
• /
• 2005

3D reconstruction of a scene structure from un-calibrated image sequences has been long one of the central problems in computer vision. For 3D reconstruction in Euclidean space, projective reconstruction, which is classified into the merging method and the factorization, is needed as a preceding step. By calculating all camera projection matrices and structures at the same time, the factorization method suffers less from dia and error accumulation than the merging. However, the factorization is hard to analyze precisely long sequences because it is based on the assumption that all correspondences must remain in all views from the first frame to the last. This paper presents a new projective reconstruction method for recovery of 3D structure over long sequences. We break a full sequence into sub-sequences based on a quantitative measure considering the number of matching points between frames, the homography error, and the distribution of matching points on the frame. All of the projective reconstructions of sub-sequences are registered into the same coordinate frame for a complete description of the scene. no experimental results showed that the proposed method can recover more precise 3D structure than the merging method.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.737-741
• /
• 2009

This paper addresses the factorization method to estimate the projective structure of a scene from feature (points) correspondences over images with occlusions. We propose both a column and a row space approaches to estimate the depth parameter using the subspace constraints. The projective depth parameters are estimated by maximizing projection onto the subspace based either on the Joint Projection matrix (JPM) or on the the Joint Structure matrix (JSM). We perform the maximization over significant observation and employ Tardif's Camera Basis Constraints (CBC) method for the matrix factorization, thus the missing data problem can be overcome. The depth estimation and the matrix factorization alternate until convergence is reached. Result of Experiments on both real and synthetic image sequences has confirmed the effectiveness of our proposed method.

• Journal of Korea Multimedia Society
• /
• v.15 no.6
• /
• pp.770-783
• /
• 2012

In this paper, we propose a novel structure recovery algorithm in the projective space using image feature points. We use normalized image feature coordinates for the numerical stability. To acquire an initial value of the structure and motion, we decompose the scaled measurement matrix using the singular value decomposition. When recovering structure and motion in projective space, we introduce matrix decomposition constraints. In the reconstruction procedure, a nonlinear iterative optimization technique is used. Experimental results showed that the proposed method provides proper accuracy and the error deviation is small.

• The KIPS Transactions:PartB
• /
• v.17B no.3
• /
• pp.183-188
• /
• 2010

A factorization-based 3D reconstruction system is realized to recover 3D scene from an image sequence. The image sequence is captured from uncalibrated perspective camera from several views. Many matched feature points over all images are obtained by feature tracking method. Then, these data are supplied to the 3D reconstruction module to obtain the projective reconstruction. Projective reconstruction is converted to Euclidean reconstruction by enforcing several metric constraints. After many triangular meshes are obtained, realistic reconstruction of 3D models are finished by texture mapping. The developed system is implemented in C++, and Qt library is used to implement the system user interface. OpenGL graphics library is used to realize the texture mapping routine and the model visualization program. Experimental results using synthetic and real image data are included to demonstrate the effectiveness of the developed system.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.191-194
• /
• 2003

The recovery of 3D scene structure from multiple views has been long one of the central problems in computer vision. This paper presents a new projective reconstruction method based on factorization for un-calibrated image sequences. The proposed algorithm provides an effective measure to construct frame groups by using various information between frames. The experimental results show that the proposed method can reconstruct a more precise 3D structure than the precious methods such as the merging method.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.2 s.40
• /
• pp.169-175
• /
• 2006

In this paper we propose a method of reconstruction of cylindrical panorama using simplified projective transform from the panning image on the fixed camera. For the practical construction of cylindrical panorama we consider the rotation of the camera on the Y-axis only, even though considering the rotation components on all of the X,Y,Z axis on three-dimensional space for projective transform between general panoramas. The restriction mentioned above simplifies projective transform with existing 8 degrees of freedom into the one with 4 degrees of freedom. In the results, overall computation for projective transform can be decreased to the great extents in quantify, because the number of corresponding points required for inducing the transforming formula is gone down by half. Proposed algorithm from the simulation carried out in this paper shows similar performance and decreased computational quantity compared with existing algorithm. Also, it shows the construction of cylindrical panorama using simplified projective transform.

• Korean Journal of Computational Design and Engineering
• /
• v.20 no.4
• /
• pp.357-366
• /
• 2015

We review recent research results on coupled line cameras (CLC) as a new geometric tool to reconstruct a scene quadrilateral from image quadrilaterals. Coupled line cameras were first developed as a camera calibration tool based on geometric insight on the perspective projection of a scene rectangle to an image plane. Since CLC comprehensively describes the relevant projective structure in a single image with a set of simple algebraic equations, it is also useful as a geometric reconstruction tool, which is an important topic in 3D computer vision. In this paper we first introduce fundamentals of CLC with reals examples. Then, we cover the related works to optimize the initial solution, to extend for the general quadrilaterals, and to apply for cuboidal reconstruction.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.5
• /
• pp.415-420
• /
• 2004

We present a new algorithm for the calibration of a camera and the recovery of 3D scene structure up to a scale from image sequences using known angles between lines in the scene. Traditional method for calibration using scene constraints requires various scene constraints due to the stratified approach. Proposed method requires only one type of scene constraint of known angle and also it directly recovers metric structure up to an unknown scale from projective structure. Specifically, we recover the matrix that is the homography between the projective structure and the Euclidean structure using angles. Since this matrix is a unique one in the given set of image sequences, we can easily deal with the problem of varying intrinsic parameters of the camera. Experimental results on the synthetic and real images demonstrate the feasibility of the proposed algorithm.