Information and Modeling in ComplexityView this Special Issue
Key Issues in Modeling of Complex 3D Structures from Video Sequences
Construction of three-dimensional structures from video sequences has wide applications for intelligent video analysis. This paper summarizes the key issues of the theory and surveys the recent advances in the state of the art. Reconstruction of a scene object from video sequences often takes the basic principle of structure from motion with an uncalibrated camera. This paper lists the typical strategies and summarizes the typical solutions or algorithms for modeling of complex three-dimensional structures. Open difficult problems are also suggested for further study.
Over the past two decades, many researchers seek to reconstruct the model of a three-dimensional (3D) scene structure and camera motion from video sequences taken with an uncalibrated camera or unordered photo collections from the Internet. Most traditionally, depth measurement and 3D metric reconstruction can be done from two uncalibrated stereo images . Nowadays, reconstructing a 3D scene from a moving camera is one of the most important issues in the field of computer vision. This is a very challenging task because of its computational efficiency, generality, complexity, and exactitude. In this paper, we aim to show the development and current status of the 3D reconstruction algorithms on this topic.
The basic concept and knowledge of the problem can be found from the fundamentals of the multiview geometry through the books and thesis such as Multiple View Geometry in Computer Vision , The Geometry of Multiple Images , Triangulation , and some typical publications [5–8], which are independent for implementing an entire system. Multiple-view geometry is most fundamental in computer vision, and the algorithms of structure from motion are based on the perspective geometry, affine geometry, and the Euclidean geometry. For simultaneous computation of 3D points and camera positions, this is a linear algorithm framework for the Euclidean structure recovery utilizing a scaled orthographic view and perspective views based on having a reference plane visible in all views . There is an affine framework for perspective views that are captured by a single extremely simple equation based on a viewer-centered invariant, called relative affine structure . A comprehensive method is used for estimating scene structure and camera motion from an image sequence taken by affine cameras which can incorporate all point, line, and conic features in a unified manner . The other approach tries to calculate the cameras along with the 3D points, only relying on established correspondences between the observed images. These systems and improvements are covered in many publications [2, 6, 12–15]. The literature gives a compact yet accessible overview covering a complete reconstruction system.
For multiview modeling of a rigid scene, an approach is presented in , which merges traditional approaches to reconstructing image-extractable features, and modeling via user-provided geometry includes steps to obtain features for a first guess of the structure and motion, fit geometric primitives, correct the structure so that reconstructed features would lie exactly on geometric primitives, and optimize both structure and motion in a bundle adjustment manner. A nonlinear least square algorithm is presented in  for recovering 3D shape and motion from image streams.
Sparse 3D measurements of real scenes are readily estimated from N-view image sequences using structure-from-motion techniques. There is a fast algorithm for rigid structure from image sequences in . Hilton presents a geometric theory for reconstruction of surface models from sparse 3D data captured from N camera views  for 3D shape reconstruction by using vanishing points . Relative affine structure is given for canonical model for 3D from 2D geometry and applications .
The paper describes the progress in automatic recovering 3D scene structures together with 3D camera positions from a sequence of images acquired by an unknown camera undergoing unknown movement . The main departure from previous structure from motion strategies is that the processing is not sequential. Instead, a hierarchical approach is employed for building from image triplets and associated trifocal tensors. A method is presented for dealing with hundreds of images without precise calibration knowledge . Optimizing just over the motion unknowns is fast, and given the recovered motion, one can recover the optimal structure algebraically for two images .
In fact, reconstruction of nonrigid scenes is very important in structure from motion. The recovery of 3D structure and camera motion for nonrigid scenes from single-camera video footages is a key problem in computer vision. For an implicit imaging model of nonrigid scenes, there is an approach that gives a nonrigid structure-from-motion algorithm based on computing matching tensors over subsequences, and each nonrigid matching tensor is computed, along with the rank of the subsequence, using a robust estimator incorporating a model selection criterion that detects erroneous image points . Uncalibrated motion captures exploiting articulated structure constraints  such as humans. The technique shows promise as a means of creating 3D animations of dynamic activities such as sports events. For the problem of 3D reconstruction of nonrigid objects from uncalibrated image sequences, under the assumption of an affine camera and that the nonrigid object is composed of a rigid part and a deformation part, a stratification approach can be used to recover the structure of nonrigid objects by first reconstructing the structure in affine space and then upgrading it to the Euclidean space . In addition, a general framework of locally rigid motion for solving the M-point and N-view structure-from-motion problem for unknown bodies deforming under orthography is presented in . An incremental approach is presented in , where a new framework for nonrigid structure from motion simultaneously addresses three significant challenges: severe occlusion, perspective camera projection, and large non-linear deformation.
With the development of structure-from-motion algorithms, geometry constraint and optimization are necessary for reconstructing a good 3D model of the object or scene. Many researchers give us some useful approaches. For example, a technique is proposed in  for estimating piecewise planar models of objects from their images and geometric constraints and 3D structure from a single calibrated view using distance constraints . Marques and Costeira present an approach to estimating 3D shape from degenerated sequences with missing data . Beyond the epipolar constraint, it improves the effect of structure from motion .
3D affine measurements may be computed from a single perspective view of a scene given only minimal geometric information determined from the image. This minimal information is typically the vanishing line of a reference plane and a vanishing point for a direction not parallel to the plane. Without camera parameters, Criminisi et al.  show how to (i) compute the distance between planes parallel to the reference plane; (ii) compute area and length ratios on any plane parallel to the reference plane; (iii) determine the camera’ location. Direct estimation is the fundamental estimation of scene structure and camera motion from a sequence of images. No computation of optical flow or feature correspondences is required . A good critique on structure-from-motion algorithms can be found in  by Oliensis.
The remainder of this paper is organized as follows. Section 2 briefly gives some typical applications of structure from video sequences. Section 3 introduces the general reconstruction principle of structure from video sequences and unstructured photo collections. Section 4 outlines the methods for structure and motion estimation. Section 5 discusses the relevant available algorithms for every step to obtain a better result. We offer our impressions of current and future trends in the topic and conclude the development in Sections 6 and 7.
2. Typical Applications
2.1. Modeling and Reconstruction of 3D Buildings or Landmarks
For 3D reconstruction of an object or building, Pollefeys et al. typically present a complete system to build visual model with a hand-held camera . There is a system for photorealistic 3D reconstruction from hand-held cameras . Sinha et al.  present an algorithm for interactive 3D architectural models from unordered photo collections. There is a fully automated 3D reconstruction and visualization system for architectural scenes including its interiors and exteriors . The system utilizes structure-from-motion, multiview stereo and a stereo algorithm.
The 3D models of historical relics and buildings, for example, the Emperor Qin’s Terra-cotta Warriors and Piazza San Marco, have very significant meanings for archeologists. A system that can match and reconstruct 3D scenes from extremely large collections of photographs has been developed by Agarwal et al. . A method for enabling existing multiview stereo algorithms to operate on extremely large unstructured photograph collections has been contrived by Furukawa et al. . This approach is to decompose the collection into a set of overlapping sets of photos that can be processed in parallel and to merge the resulting reconstructions . People want to sightsee the famous buildings or landscapes from the Internet; they could tour the world via building a web-scale landmark recognition engine .
Modeling and recognizing landmarks at world scale is a useful yet challenging task. There exists no readily available list of worldwide landmarks. Obtaining reliable visual models for each landmark can also pose problems, and efficiency is another challenge for such a large-scale system. Zheng et al. leverage the vast amount of multimedia data on the web, the availability of an Internet image search engine, and advances in object recognition and clustering techniques, to address these issues .
2.2. Urban Reconstruction
Modeling the world and reconstructing a city present many challenges for a visualization system in computer vision. It can use some products such as Google Earth Google Map. For instance, Pollefeys et al.  present a system for automatic, georegistered, real-time multiview stereo 3D reconstruction form long image sequences of urban scenes. The system collects video streams, as well as GPS and inertia measurements in order to obtain the georegistered coordinates of the 3D models . Faugeras et al.  address the problem of recovery of a realistic textured model of a scene from a sequence of images, without any prior knowledge either about the parameters of the cameras or about their motion.
If the world’s model or the city’s reconstruction is exhaustively completed, we can obtain relative location of the buildings and find related views for navigation for robots or other vision systems. Photo Tourism can enable full 3D navigation and exploration of the set of images and world geometry, along with auxiliary information such as overhead maps . It gives several modes for navigation, including free-fight navigation, moving between related views, object-based navigation, and creating stabilized slideshows. The system by Pollefeys et al. also contains the navigation function . Supplying realistically textured 3D city models at ground level promises to be useful for previsualizing upcoming traffic situations in car navigation systems .
2.4. Visual Servoing
In the literature, there are applications that can employ SfM algorithms successfully in practical engineering. For instance, based on structure from controlled motion or on robust statistics, a visual servoing system is presented in . A general-purpose image understanding system via a control structure is designed by Marengoni et al.  and 3D video compression via topology matching . More applications are being developed by researchers and engineers in the community.
2.5. Scene Recognition and Understanding
3D reconstruction is an important application to face recognition, facial expression analysis, and so on. Fidaleo and Medioni  design a model-assisted system for reconstruction of 3D faces from a single-consumer quality camera using a structure-from-motion approach. Park and Jain  present an algorithm for 3D-model-based face recognition in video.
Reconstruction of 3D scene geometry is an important element for scene understanding, autonomous vehicle and robot navigation, image retrieval, and 3D television . Nedovic et al. propose accounting for the inherent structure of the visual world when trying to solve the scene reconstruction problem .
3. Information Organization
The goal of structure-form-motion is automatic recovery of camera motion and scene structure from two or more images. The problem of using pixel correspondences or track points to determine camera and point geometry in this manner is known as structure from motion. It is a self-calibration technique and called automatic camera tracking or match moving. We must consider several questions like (1)Correspondence (feature extracting and tracking or matching): given a point in one image, how does it constrain the position of the corresponding point in other images? (2)Scene geometry (structure): given point matches in two or more images, where are the corresponding points in 3D?(3)Camera geometry (motion): given a set of corresponding points in two or more images, what are the camera matrices for these views?
Based on these questions, we can give the 3D reconstruction pipeline as in Figure 1. The goal of correspondence is to build a set of matching 2D coordinates of pixels across the video sequences. It is a significant step in the flow of the structure from motion. Correspondence is always a challenging task in computer vision. So far, many researchers have developed some practical and robust algorithms. Given a video sequence of scene, how can we find matching points?
Firstly, there are some well-known algorithms for image sequences or videos; one popular is the KLT tracker [49–51]. It gives us an integrated system that can automatically detect the KLT feature points and track them. However, it cannot apply to the situations with wide baseline, illustration changing, variant scale, duplicate and similar structure, occlusion, noise, image distortion, and so on. Generally speaking, for video sequences, the KLT tracker can perform a good effect. Figures 2 and 3 show examples of the feature points of the KLT detector output with example images from http://www.ces.clemson.edu/~stb/klt/.
In the KLT tracker [49–51], if the time interval between two frames of video is sufficiently short, we can suppose that the positions of feature points move, but their intensities do not change; that is, where is the position of a feature point and is a transformation function.
In the papers of Lucas and Kanade , Tomasi and Kanade , and Shi and Tomasi , the authors made an important hypothesis that for high enough frame rates, can be approximated with a displacement vector :
Then symmetric definition for the dissimilarity between two windows, one in image and one in image , is as follows: where is the weighting function, usually set to the constant 1. The algorithm is calculating the vector which minimizes. Now, utilizing the first-order Taylor expansion of to truncate to the linear term and setting the derivative of with respect to to , obtaining the linear equation: where is the following matrix: and is the following vector: where .
On the other hand, for a completely unorganized set of images, the tracker becomes invalid. There is another popular algorithm in computer vision area, named scale-invariant feature transform (SIFT) . It is effective to feature detection and matching in a wide class of image transformation, including rotations, scales, and changes in brightness or contrast, and to recognize panoramas . Figures 4 and 5 show examples of the feature points of the SIFT output with example images from http://www.cs.ubc.ca/~lowe/keypoints/.
4. Structure and Motion Estimation
Assume that we have obtained a set of correspondences between images or video sequence, and then we use the set to reconstruct the 3D structure of each point in the set of correspondences and recover the motion of a camera. This task is called structure from motion. The problem has been an active research topic in computer vision since the development of the Longuet-Higgins eight-point algorithm  that focused on reconstructing geometry from two views. In the literature , several different approaches to solve the structure-from-motion problem are given.
There is a popular factorization algorithm for image streams under orthography, using many images and tracking many feature points to obtain highly redundant feature position information, which was firstly developed by Tomasi and Kanade  in the 1990s. The main idea of this algorithm is to factorize the tracking matrix into structure and motion matrices simultaneously via singular value decomposition (SVD) method with low-rank approximation, taking advantage of the linear algebraic properties of orthographic projection.
However, an orthographic formulation limits the range of motions the method can accommodate. Perspective projection is a projection model that closely approximates perspective projection by modeling several effects not modeled under orthographic projection, while retaining linear algebraic properties [56, 57]. Poelman and Kanade  have developed a paraperspective factorization method that can be applied to a much wider range of motion scenarios, including image sequences containing motion toward the camera and aerial image sequences of terrain taken from a low-altitude airplane.
With the development of factorization method, a factorization- based algorithm for multi-image projective structure and motion is developed by Sturm and Triggs . This technique is a practical approach for recovery of scaled feature points, using fundamental matrix and epipoles estimated from the image sequences.
Because matrix factorization is a key component for solving several computer vision problems, Tardif et al. have proposed batch algorithms for matrix factorization  that are based on closure and basis constraints, which handle the presence of missing or erroneous data, which often arise in structure from motion.
In mathematical expression of the factorization algorithm, assume that the tracked points are . The algorithm defines the measurement matrix . The rows of and are then registered by subtracting from each entry the mean of the entries in that row: The goal of the Tomasi-Kanade algorithm  is to factorize into two matrices as follows: where , named motion matrix, is a matrix which represents the camera rotation in each frame and , named structure matrix, is a matrix which denotes the positions of the feature points in object space. So in the absence of the Gauss noise, .
Then we can compute SVD decomposition of to obtain : where if the singular value of is , we can get the matrix and .
The method can also handle and obtain a full solution from a partially filled-in measurement matrix, which occurs when features appear and disappear in the video due to occlusions or tracking failures . This method gives accurate results and does not introduce smoothing in structure and motion. Using the above method, the problem can be solved for the video of general scene such as building and sculpture (Figure 6).
4.2. Bundle Adjustment
Bundle adjustment is a significant component of most structure from motion systems. It is the joint nonlinear refinement of camera and point parameters, so it can consume a large amount of time for large problems. Unfortunately, the optimization underlying structure from motion involves a complex, nonlinear objective function with no closed-form solution, due to nonlinearities in perspective geometry. Most modern approaches use nonlinear least squares algorithms  to minimize this objective function, a process known as bundle adjustment;  that is, basic mathematics of the bundle adjustment problem is well understood . Generally speaking, bundle adjustment is a global algorithm, but it consumes much time and cannot achieve real time to solve the minimize restriction. Mouragnon et al.  propose an approach for generic and real-time structure from motion using local bundle adjustment. It allows 3D points and camera poses to be refined simultaneously through the image sequence. Zhang et al.  apply bundle optimization to further improve the results of consistent depth maps from a video sequence.
To upgrade the projective and affine reconstruction to a metric reconstruction (i.e., determined up to an arbitrary Euclidean transformation and a scale factor), calibration techniques, to which we follow the approach described in [2, 6, 9, 15, 62], can deal with this problem. It can be done by imposing some constraints on the intrinsic camera parameters. This approach that is called self-calibration has received a lot of attention in recent years. The ambiguity on the reconstruction is restricted from projective to metric through self-calibration . Mostly self-calibration algorithms are concerned with unknown but constant intrinsic camera parameters [2, 4, 12]. The paper presented the problem of 3D Euclidean reconstruction of structured scenes from uncalibrated images based on the property of vanishing points . They propose a multistage linear approach, with structure from motion technique based on point and vanishing point matches in images .
4.4. Correlative Improvement
Traditional SFM algorithms using just two images often produce inaccurate 3D reconstructions, mainly due to incorrect estimation of the camera’ motion. Thomas and Oliensis  present a practical algorithm that can deal with noise in multiframe structure from motion. It describes a new incremental algorithm for reconstructing structure from multi-image sequences which estimates and corrects for the error in computing the camera motion. The research of structure from motion has shown great progress throughout several decades, but the algorithms on structure from motion still exhibit some faults and shortages. The result of Structure from Motion cannot satisfy people in many situations. However, many researchers present a lot of improving approaches, such as dual computation of projective shape and camera positions from multiple images .
For incremental algorithms that solve progressively larger bundle adjustment problems, Crandall et al. present an alternative formulation for structure from motion based on finding a coarse initial solution using a hybrid discrete-continuous optimization and then improve the solution using bundle adjustment. The initial optimization step uses a discrete Markov random field (MRF) formulation, coupled with a continuous Levenberg-Marquardt refinement .
For time efficiency, Havlena et al. present a method of efficient structure from motion by graph optimization . Gherardi et al. improve the algorithm of efficiency with hierarchical structure and motion .
For duplicate or similar structure, Roberts et al. couple an expectation maximization (EM) algorithm for structure from motion for scenes with large duplicate structures . A hierarchical framework that resamples 3D reconstructed points to reduce computation cost on time and memory for very-large-scale structure from motion . Savarese and Bao propose a formulation called semantic structure from motion (SSFM), where SSFM takes advantages of both semantic and geometrical properties associated with objects in the scene .
5. Relevant Algorithms
For the problem of camera motion and 3D structure reconstruction from line correspondences across multiple views, there is a triangulation algorithm that outperforms standard linear and bias-corrected quasi-linear algorithms, and that bundle adjustment using our orthonormal representation yields results similar to the standard maximum likelihood trifocal tensor algorithm, while being usable for any number of views . Spetsakis and Aloimonos  present a system for structure from motion using line correspondences. The recovery algorithm is formulated in terms of an objective function which measures the total squared distance in the image plane between the observed edge segments and the projections of the reconstructed lines . A linear method is developed for reconstruction using lines and points simultaneously .
Tubic et al.  present an approach for reconstructing a surface from a set of arbitrary, unorganized, and intersecting curves. There is an approach for reconstructing open surfaces from image data . Kaminski and Shashua  introduce a number of new results in the context of multiview geometry from general algebraic curves, which start with the recovery of camera geometry from matching curves. Berthilsson et al. present a method for reconstruction of general curves, using factorization and bundle adjustment .
Liang and Wong  develop an approach that produces relatively complete 3D models similar to volumetric approaches, with the topology conforming to what is observed from the silhouettes. In addition, the method neither assumes nor depends on the spatial order of viewpoints. Hartley and Kahl give us critical configurations for projective reconstruction from multiple views in . Joshi et al. design an algorithm for structure and motion estimation from dynamic silhouettes under perspective projection . Liu et al. present a method that is shaped from silhouette outlines using an adaptive dandelion model . Yemez and Wetherilt develop a volumetric fusion technique for surface reconstruction from silhouettes and range data .
5.2. Other Aspects
(1) Multiview Stereo
Multiview stereo (MVS) techniques take as input a set of images with known camera parameters (i.e., position and orientation of the camera, focal length, image distortion parameters) [38, 53, 86]. We can refer to  for a classification and evaluation of recent MVS techniques.
There are clustering techniques to partition the image set into groups of related images, based on the visual structure represented in the image connectivity graph for the collection [88, 89].
6. Existing Problems and Future Trends
While algorithms of structure from motion have been developed for 3D reconstruction in many applications, some problems of reconstructing geometry from video sequences still exist in computer vision and photography. Until recently, however, there have been no good computer vision techniques for recovering this kind of structure from motion. Many researchers are still making efforts to improve the methods mainly in the following aspects.
6.1. Feature Tracking and Matching
Zhang et al. give a robust and efficient algorithm on efficient nonconsecutive feature tracking for structure from motion via two main steps, that is, consecutive point tracking and nonconsecutive track matching . They improve the KTL tracker by the invariant feature points and a two-pass matching strategy to significantly extend the track lifetime and reduce the sensitivity of feature points to variant scale, duplicate and similar structure, and noise and image distortion. The results can be found at http://www.cad.zju.edu.cn/home/gfzhang/.
6.2. Active Vision
The method is based on the structure from controlled motion that constrains camera motions to obtain an optimal estimation of the 3D structure of a geometrical primitive . Stereo geometry is acquired from 3D egomotion streams . Wide-area egomotion estimation is acquired from known 3D structure . A work on estimating surface reflectance properties of a complex scene under captured natural illumination can be found in . Other algorithms are also attempted on selective attention of human eyes.
6.3. Unorganized Images
To solve the resulting large-scale nonlinear optimization, we reconstruct the scene incrementally, starting from a single pair of images, then adding new images and points in rounds, and running a global nonlinear optimization after each round . Structure from motion could be applied to photos found in the wild, reconstructing scenes from several large Internet photo collections . The large redundancy in online photo collections means that a small fraction of images may be sufficient to produce high-quality reconstructions. An investigation has begun to explore by extracting image “skeletons” from large collections . Perhaps the most important challenge is to find ways to effectively parallelize all the steps of the reconstruction pipeline to take advantage of multicore architectures and cloud computing [37, 38, 53, 89].
This paper has summarized the recent development of structure from motion algorithm that is able to metrically reconstruct complex scenes and objects. The wide applications have been addressed in computer vision area. Typical contributions are introduced for feature point detection, tracking, matching, factorization, bundle adjustment, multiview stereo, self-calibration, line detection and matching, modeling, and so forth. Representative works are listed for readers to have a general overview of the state of the art. Finally, a summary of existing problems and future trends of structure modeling is addressed.
This work was supported by the National Natural Science Foundation of China and Microsoft Research Asia (NSFC nos. 61173096, 60870002, and 60802087), Zhejiang Provincial S&T Department (2010R10006, 2010C33095), and Zhejiang Provincial Natural Science Foundation (R1110679).
R. Hartley and A. Zisserman, Multiple View Geometry in Computer Vision, Cambridge University Press, 2nd edition, 2004.
O. Faugeras and Q. T. Luong, The Geometry of Multiple Images, MIT Press, Cambridge, Mass, USA, 2001.
R. I. Hartley and P. Sturm, “Triangulation,” in Proceedings of the American Image Understanding Workshop, pp. 957–966, 1994.View at: Google Scholar
P. F. McLauchlan and D. W. Murray, “Unifying framework for structure and motion recovery from image sequences,” in Proceedings of the 5th International Conference on Computer Vision (ICCV '95), pp. 314–320, June 1995.View at: Google Scholar
A. Shashua and N. Navab, “Relative affine structure: canonical model for 3D from 2D geometry and applications,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 18, no. 9, pp. 873–883, 1996.View at: Google Scholar
A. W. Fitzgibbon and A. Zisserman, “Automatic camera recovery for closed or open image sequences,” in Proceedings of the ECCV, pp. 311–326, 1998.View at: Google Scholar
F. Schaffalitzky and A. Zisserman, “Multi-view matching for unordered image sets, or “How do I organize my holiday snaps?”,” in Proceedings of the IEEE Conference on Computer Vision, vol. 1, pp. 414–431, 2002.View at: Google Scholar
N. Snavely, S. M. Seitz, and R. Szeliski, “Photo tourism: exploring photo collections in 3D,” in Proceedings of the International Conference on Computer Graphics and Interactive Technologies, pp. 835–846, 2006.View at: Google Scholar
R. Hartley, “Euclidean reconstruction from uncalibrated views,” in Applications of Invariance in Computer Vision, J. L. Mundy, A. Zisserman, and D. Forsyth, Eds., Lecture Notes in Computer, 1994.View at: Google Scholar
P. M. Q. Aguiar and J. M. F. Moura, “A fast algorithm for rigid structure from image sequences,” in Proceedings of the IEEE International Conference on Image Processing (ICIP '99), vol. 3, pp. 125–129, Kobe, Japan, 1999.View at: Google Scholar
P. Parodi and G. Piccioli, “3D shape reconstruction by using vanishing points,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 18, no. 2, pp. 211–217, 1996.View at: Google Scholar
A. Bartoli and S. I. Olsen, “A batch algorithm for implicit non-rigid shape and motion recovery,” in Proceedings of the International Conference on Dynamical Vision, 2006.View at: Google Scholar
R. Gong and G. Xu, “3D structure from a single calibrated view using distance constraints,” IEICE Transactions on Information and Systems, vol. 87, no. 6, pp. 1527–1536, 2004.View at: Google Scholar
H. Joachim, “Direct estimation of structure and motion from multiple zframes,” MIT AI Lab. Memo 1190, Massachusetts Institute of Technology, Mass, USA, 190.View at: Google Scholar
Y. Furukawa, B. Curless, S. M. Seitz, and R. Szeliski, “Reconstructing building interiors from images,” in Proceedings of the International Conference on Computer Vision, pp. 80–87, 2009.View at: Google Scholar
Y. Furukawa, B. Curless, S. M. Seitz, and R. Szeliski, “Towards internet-scale multi-view stereo,” in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR '10), pp. 1434–1441, San Francisco, Calif, USA, June 2010.View at: Publisher Site | Google Scholar
O. Faugeras, L. Robert, S. Laveau et al., “3-D reconstruction of urban scenes from image sequences,” Computer Vision and Image Understanding, vol. 69, no. 3, pp. 292–309, 1998.View at: Google Scholar
D. Fidaleo and G. Medioni, “Model-assisted 3D face reconstruction from video,” in Proceedings of the 3rd International Workshop on Analysis and Modeling of Faces and Gestures (AMFG '07), vol. 4778 of Lecture Notes in Computer Science, pp. 124–138, 2007.View at: Google Scholar
U. Park and A. Jain, “3D model-based face recognition in video,” in Proceedings of the Proceedings International Conference on Advances in Biometrics (ICB '07), vol. 4642 of Lecture Notes in Computer Science, pp. 1085–1094, 2007.View at: Google Scholar
B. D. Lucas and T. Kanade, “An iterative image registration technique with an application to stereo vision,” in Proceedings of the International Joint Conference on Artificial Intelligence, pp. 674–679, 1981.View at: Google Scholar
C. Tomasi and T. Kanade, “Detection and tracking of point features,” Tech. Rep. CMU-91-132, CMU, 1991.View at: Google Scholar
J. Shi and C. Tomasi, “Good features to track,” in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp. 593–600, June 1994.View at: Google Scholar
C. J. Poelman and T. Kanade, “A paraperspective factorization method for shape and motion recovery,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 19, no. 3, pp. 206–218, 1997.View at: Google Scholar
P. Sturm and B. Triggs, “A factorization based algorithm for multi-image projective structure and motion,” in Proceedings of the 4th European Conference on Computer Vision, 1996.View at: Google Scholar
J. P. Tardif, A. Bartoli, M. Trudeau, N. Guilbert, and S. Roy, “Algorithms for batch matrix factorization with application to structure-from-motion,” in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR '07), June 2007.View at: Publisher Site | Google Scholar
B. Triggs, P. F. McLauchlan, R. I. Hartley, and A. W. Fitzgibbon, “Bundle adjustment—a modern synthesis,” in Proceedings of the International Workshop on Vision Algorithms, pp. 298–372, 1999.View at: Google Scholar
S. N. Sinha, D. Steedly, and R. Szeliski, “A multi-stage linear approach to structure from motion,” in Proceedings of the European Conference on Computer Vision (ECCV '10), 2010.View at: Google Scholar
S. Carlsson and D. Weinshall, “Dual computation of projective shape and camera positions from multiple images,” International Journal of Computer Vision, vol. 27, no. 3, pp. 227–241, 1998.View at: Google Scholar
D. Crandall, A. Owens, N. Snavely, and D. Huttenlocher, “Discrete-continuous optimization for large-scale structure from motion,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR '11), 2011.View at: Google Scholar
M. Havlena, A. Torii, and T. Pajdla, “Efficient structure from motion by graph optimization,” in Proceedings of the European Conference on Computer Vision (ECCV '10), 2010.View at: Google Scholar
R. Roberts, S. Sinha, R. Szeliski, and D. Steedly, “Structure from motion for scenes with large duplicate structures,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR '11), 2011.View at: Google Scholar
T. Fang and L. Quan, “Resampling structure from motion,” in Proceedings of the European Conference on Computer Vision (ECCV '10), 2010.View at: Google Scholar
S. Savarese and S. Y. Z. Bao, “Semantic structure from motion,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR '11), 2011.View at: Google Scholar
R. I. Hartley, “Linear method for reconstruction from lines and points,” in Proceedings of the 5th International Conference on Computer Vision (ICCV '95), pp. 882–887, June 1995.View at: Google Scholar
S. M. Seitz, B. Curless, J. Diebel, D. Scharstein, and R. Szeliski, “A comparison and evaluation of multi-view stereo reconstruction algorithms,” in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR '06), pp. 519–526, June 2006.View at: Publisher Site | Google Scholar
G. Zhang, Z. Dong, J. Jia, T. T. Wong, and H. Bao, “Efficient non-consecutive feature tracking for structure-from-motion,” in Proceedings of the European Conference on Computer Vision (ECCV '10), 2010.View at: Google Scholar
E. Marchand and F. Chaumette, “Active vision for complete scene reconstruction and exploration,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 21, no. 1, pp. 65–72, 1999.View at: Google Scholar
P. Debevec, C. Tchou et al., “Estimating surface reflectance properties of a complex scene under captured natural illumination,” Tech. Rep. ICT-TR-06.2004, University of Southern California Institute for Creative Technologies, Marina del Rey, Calif, USA, 2004.View at: Google Scholar