An iterative method based on 1D subspace for projective reconstruction

Abstract

Heyden et al. introduced an iterative factorization method for projective reconstruction from image sequences. In their formulation, the projective structure and motion are computed by using an iterative factorization based on 4D subspace. In this paper, the problem is reformulated based on fact that the x, y, and z coordinates of each feature in projective space are known from their projection. The projective reconstruction, i.e., the relative depths w and the 3D motion, is obtained by a simple iterative factorization based on 1D subspace. This allows the use of very fast algorithms even when using a large number of features and large number of frames. The experiments with both simulate and real data show that the method presented in the paper is efficient and has good convergency.

A Spatially Varying Mean and Variance Active Contour Model

“…Image segmentation is a fundamental problem in the field of computer vision [1][2][3]. Over the last few decades, researchers have also done great efforts and a large variety of segmentation algorithms have been proposed to improve the performance of the image segmentation algorithms [4][5][6].…”

Active contours driven by normalized local image fitting energy

“…To solve the image segmentation problem, a wide variety of algorithms have been proposed [16][17][18][19][20]. Researchers have also carried out great efforts to improve the performance of the image segmentation algorithms [21][22][23][24][25].…”

A camera calibration method based on two orthogonal vanishing points

“…The technique was developed further , and the concept of the absolute conic that besides the plane at infinity is the only fixed entity for the group of Euclidean transformations is presented . Later on, most of self‐calibration methods are based on the absolute conic . The absolute conic is invariant under Euclidean transformations, and its projection is constant to a moving camera.…”