Results 1 - 10
of
114
Flexible camera calibration by viewing a plane from unknown orientations
- in ICCV
, 1999
"... We propose a flexible new technique to easily calibrate a camera. It only requires the camera to observe a planar pattern shown at a few (at least two) different orientations. Either the camera or the planar pattern can be freely moved. The motion need not be known. Radial lens distortion is modeled ..."
Abstract
-
Cited by 219 (5 self)
- Add to MetaCart
We propose a flexible new technique to easily calibrate a camera. It only requires the camera to observe a planar pattern shown at a few (at least two) different orientations. Either the camera or the planar pattern can be freely moved. The motion need not be known. Radial lens distortion is modeled. The proposed procedure consists of a closed-form solution, followed by a nonlinear refinement based on the maximum likelihood criterion. Both computer simulation and real data have been used to test the proposed technique, and very good results have been obtained. Compared with classical techniques which use expensive equipment such as two or three orthogonal planes, the proposed technique is easy to use and flexible. It advances 3D computer vision one step from laboratory environments to real world use. The corresponding software is available from the author’s Web page.
A Factorization Based Algorithm for Multi-Image Projective Structure and Motion
, 1996
"... . We propose a method for the recovery of projective shape and motion from multiple images of a scene by the factorization of a matrix containing the images of all points in all views. This factorization is only possible when the image points are correctly scaled. The major technical contribution of ..."
Abstract
-
Cited by 182 (14 self)
- Add to MetaCart
. We propose a method for the recovery of projective shape and motion from multiple images of a scene by the factorization of a matrix containing the images of all points in all views. This factorization is only possible when the image points are correctly scaled. The major technical contribution of this paper is a practical method for the recovery of these scalings, using only fundamental matrices and epipoles estimated from the image data. The resulting projective reconstruction algorithm runs quickly and provides accurate reconstructions. Results are presented for simulated and real images. 1 Introduction In the last few years, the geometric and algebraic relations between uncalibrated views have found lively interest in the computer vision community. A first key result states that, from two uncalibrated views, one can recover the 3D structure of a scene up to an unknown projective transformation [Fau92, HGC92]. The information one needs to do so is entirely contained in the fundam...
A survey of image-based rendering techniques
- In Videometrics, SPIE
, 1999
"... In this paper, we survey the techniques for image-based rendering. Unlike traditional 3D computer graphics in which 3D geometry of the scene is known, image-based rendering techniques render novel views directly from input images. Previous image-based rendering techniques can be classified into thre ..."
Abstract
-
Cited by 113 (8 self)
- Add to MetaCart
In this paper, we survey the techniques for image-based rendering. Unlike traditional 3D computer graphics in which 3D geometry of the scene is known, image-based rendering techniques render novel views directly from input images. Previous image-based rendering techniques can be classified into three categories according to how much geometric information is used: rendering without geometry, rendering with implicit geometry (i.e., correspondence), and rendering with explicit geometry (either with approximate or accurate geometry). We discuss the characteristics of these categories and their representative methods. The continuum between images and geometry used in image-based rendering techniques suggests that image-based rendering with traditional 3D graphics can be united in a joint image and geometry space. Keywords: Image-based rendering, survey. 1
3-D Scene Data Recovery using Omnidirectional Multibaseline Stereo
, 1995
"... A traditional approach to extracting geometric information from a large scene is to compute multiple 3-D depth maps from stereo pairs or direct range finders, and then to merge the 3-D data This is not only computationally intensive, but the resulting merged depth maps may be subject to merging erro ..."
Abstract
-
Cited by 108 (16 self)
- Add to MetaCart
A traditional approach to extracting geometric information from a large scene is to compute multiple 3-D depth maps from stereo pairs or direct range finders, and then to merge the 3-D data This is not only computationally intensive, but the resulting merged depth maps may be subject to merging errors, especially if the relative poses between depth maps are not known exactly. The 3-D data may also have to be resampled before merging, which adds additional complexity and potential sources of errors. This paper provides a means of directly extracting 3-D data covering a very wide field of view, thus by-passing the need for numerous depth map merging. In our work, cylindrical images are first composited from sequences of images taken while the camera is rotated 360 ffi about a vertical axis. By taking such image panoramas at different camera locations, we can recover 3-D data of the scene using a set of simple techniques: feature tracking, an 8-point structure from motion algorithm, and...
Robust parameter estimation in computer vision
- SIAM Reviews
, 1999
"... Abstract. Estimation techniques in computer vision applications must estimate accurate model parameters despite small-scale noise in the data, occasional large-scale measurement errors (outliers), and measurements from multiple populations in the same data set. Increasingly, robust estimation techni ..."
Abstract
-
Cited by 104 (10 self)
- Add to MetaCart
Abstract. Estimation techniques in computer vision applications must estimate accurate model parameters despite small-scale noise in the data, occasional large-scale measurement errors (outliers), and measurements from multiple populations in the same data set. Increasingly, robust estimation techniques, some borrowed from the statistics literature and others described in the computer vision literature, have been used in solving these parameter estimation problems. Ideally, these techniques should effectively ignore the outliers and measurements from other populations, treating them as outliers, when estimating the parameters of a single population. Two frequently used techniques are least-median of
Factorization methods for projective structure and motion
- In IEEE Conf. Computer Vision & Pattern Recognition
, 1996
"... This paper describes a family of factorization-based algorithms that recover 3D projective structure and motion from multiple uncalibrated perspective images of 3D points and lines. They can be viewed as generalizations of the Tomasi-Kanade algorithm from affine to fully perspective cameras, and fro ..."
Abstract
-
Cited by 85 (5 self)
- Add to MetaCart
This paper describes a family of factorization-based algorithms that recover 3D projective structure and motion from multiple uncalibrated perspective images of 3D points and lines. They can be viewed as generalizations of the Tomasi-Kanade algorithm from affine to fully perspective cameras, and from points to lines. They make no restrictive assumptions about scene or camera geometry, and unlike most existing reconstruction methods they do not rely on ‘privileged’ points or images. All of the available image data is used, and each feature in each image is treated uniformly. The key to projective factorization is the recovery of a consistent set of projective depths (scale factors) for the image points: this is done using fundamental matrices and epipoles estimated from the image data. We compare the performance of the new techniques with several existing ones, and also describe an approximate factorization method that gives similar results to SVDbased factorization, but runs much more quickly for large problems.
Simultaneous Linear Estimation of Multiple View Geometry and Lens Distortion
, 2001
"... A bugbear of uncalibrated stereo reconstruction is that cameras which deviate from the pinhole model have to be pre-calibrated in order to correct for nonlinear lens distortion. If they are not, and point correspondence is attempted using the uncorrected images, the matching constraints provided by ..."
Abstract
-
Cited by 60 (1 self)
- Add to MetaCart
A bugbear of uncalibrated stereo reconstruction is that cameras which deviate from the pinhole model have to be pre-calibrated in order to correct for nonlinear lens distortion. If they are not, and point correspondence is attempted using the uncorrected images, the matching constraints provided by the fundamental matrix must be set so loose that point matching is significantly hampered. This paper shows how linear estimation of the fundamental matrix from two-view point correspondences may be augmented to include one term of radial lens distortion. This is achieved by (1) changing from the standard radiallens model to another which (as we show) has equivalent power, but which takes a simpler form in homogeneous coordinates, and (2) expressing fundamental matrix estimation as a Quadratic Eigenvalue Problem (QEP), for which efficient algorithms are well known. I derive the new estimator, and compare its performance against bundle-adjusted calibration-grid data. The new estimator is fast enough to be included in a RANSAC-based matching loop, and we show cases of matching being rendered possible by its use. I show how the same lens can be calibrated in a natural scene where the lack of straight lines precludes most previous techniques. The modification when the multi-view relation is a planar homography or trifocal tensor is described. 1.
Mobile Robot Navigation Using Active Vision
, 1999
"... Active cameras provide a navigating vehicle with the ability to fixate and track features over extended periods of time, and wide fields of view. While it is relatively straightforward to apply fixating vision to tactical, short-term navigation tasks, using serial fixation on a succession of feature ..."
Abstract
-
Cited by 59 (6 self)
- Add to MetaCart
Active cameras provide a navigating vehicle with the ability to fixate and track features over extended periods of time, and wide fields of view. While it is relatively straightforward to apply fixating vision to tactical, short-term navigation tasks, using serial fixation on a succession of features to provide global information for strategic navigation is more involved. However, active vision is seemingly well-suited to this task: the ability to measure features over such a wide range means that the same ones can be used as a robot makes a wide range of movements. This has advantages for map-building and localisation. The core work of this thesis concerns simultaneous localisation and map-building for a robot with a stereo active head, operating in an unknown environment and using point features in the world as visual landmarks. Importance has been attached to producing maps which are useful for extended periods of navigation. Many map-building methods fail on extended runs because ...
Lines and Point in Three Views and the Trifocal Tensor
, 1997
"... This paper disc#274# the basic role of the trifoc al tensor insc#37 rec# nstr uc#r# n from three views. This 3 3 tensor plays a role in the analysis of sc#422 from three views analogous to the role played by the fundamental matrix in the two-viewc ase. In partic ular, the trifoc al tensor may ..."
Abstract
-
Cited by 58 (3 self)
- Add to MetaCart
This paper disc#274# the basic role of the trifoc al tensor insc#37 rec# nstr uc#r# n from three views. This 3 3 tensor plays a role in the analysis of sc#422 from three views analogous to the role played by the fundamental matrix in the two-viewc ase. In partic ular, the trifoc al tensor may bec omputed by a linear algorithm from a set of 13 linec orrespondenc#3 in three views. It is further shown in this paper, that the trifoc al tensor is essentially identic## to a set ofc oe#c#99 ts introduc#5 by Shashua toe#ec# point transfer in the three viewc##22 This observation means that the 13-line algorithm may be extended to allow for thec omputation of the trifoc al tensor given any mixture of su#c#36 tly many line and pointc orrespondenc#9# From the trifoc al tensor thec amera matric## of the images may be c#25371#- and the sc#35 may berec#31#-41562# For unrelatedunc# libratedc ameras, this rec# nstr uc#r# n will be unique up to projec#939# y. Thus, projec#61 e rec#376#-39162 of a set of lines and points may bec#40940 out linearly from three views.
Epipolar Geometry for Panoramic Cameras
, 1998
"... . This paper presents fundamental theory and design of central panoramic cameras. Panoramic cameras combine a convex hyperbolic or parabolic mirror with a perspective camera to obtain a large field of view. We show how to design a panoramic camera with a tractable geometry and we propose a simple ca ..."
Abstract
-
Cited by 57 (10 self)
- Add to MetaCart
. This paper presents fundamental theory and design of central panoramic cameras. Panoramic cameras combine a convex hyperbolic or parabolic mirror with a perspective camera to obtain a large field of view. We show how to design a panoramic camera with a tractable geometry and we propose a simple calibration method. We derive the image formation function for such a camera. The main contribution of the paper is the derivation of the epipolar geometry between a pair of panoramic cameras. We show that the mathematical model of a central panoramic camera can be decomposed into two central projections and therefore allows an epipolar geometry formulation. It is shown that epipolar curves are conics and their equations are derived. The theory is tested in experiments with real data. Keywords: omnidirectional vision, epipolar geometry, panoramic cameras, hyperbolic mirror, stereo, catadioptric sensors. 1 Introduction It is well known that egomotion estimation algorithms in some cases cannot ...

