3D Point Cloud Reconstruction from Single Plenoptic Image

Novel plenoptic cameras sample the light field crossing the main camera lens. The information available in a plenoptic image must be processed, in order to create the depth map of the scene from a single camera shot. In this paper a novel algorithm, for the reconstruction of 3D point cloud of the scene from a single plenoptic image, taken with a consumer plenoptic camera, is proposed. Experimental analysis is conducted on several test images, and results are compared with state of the art methodologies. The results are very promising, as the quality of the 3D point cloud from plenoptic image, is comparable with the quality obtained with current non-plenoptic methodologies, that necessitate more than one image

Accurate automatic localization of surfaces of revolution for self-calibration and metric reconstruction

In this paper, we address the problem of the automatic metric reconstruction Surface of Revolution (SOR) from a single uncalibrated view. The apparent contour and the visible portions of the imaged SOR cross sections are extracted and classified. The harmonic homology that models the image projection of the SOR is also estimated. The special care devoted to accuracy and robustness with respect to outliers makes the approach suitable for automatic camera calibration and metric reconstruction from single uncalibrated views of a SOR. Robustness and accuracy are obtained by embedding a graph-based grouping strategy (Euclidean Minimum Spanning Tree) into an Iterative Closest Point framework for projective curve alignment at multiple scales. Classification of SOR curves is achieved through a 2-dof voting scheme based on a pencil of conics novel parametrization. The main contribution of this work is to extend the domain of automatic single view reconstruction from piecewise planar scenes to scenes including curved surfaces, thus allowing to create automatically realistic image models of man-made objects. Experimental results with real images taken from the internet are reported, and the effectiveness and limitations of the approach are discussed

3D Reconstruction from a Single Still Image Based on Monocular Vision of an Uncalibrated Camera

we propose a framework of combining Machine Learning with Dynamic Optimization for reconstructing scene in 3D automatically from a single still image of unstructured outdoor environment based on monocular vision of an uncalibrated camera. After segmenting image first time, a kind of searching tree strategy based on Bayes rule is used to identify the hierarchy of all areas on occlusion. After superpixel segmenting image second time, the AdaBoost algorithm is applied in the integration detection to the depth of lighting, texture and material. Finally, all the factors above are optimized with constrained conditions, acquiring the whole depthmap of an image. Integrate the source image with its depthmap in point-cloud or bilinear interpolation styles, realizing 3D reconstruction. Experiment in comparisons with typical methods in associated database demonstrates our method improves the reasonability of estimation to the overall 3D architecture of image’s scene to a certain extent. And it does not need any manual assist and any camera model information

Using Geometric Constraints for Camera Calibration and Positioning and 3D Scene Modelling

International audienceThis work concerns the incorporation of geometric information in camera calibration and 3D modelling. Using geometric constraints enables stabler results and allows to perform tasks with fewer images. Our approach is interactive; the user defines geometric primitives and constraints between them. It is based on the observation that constraints such as coplanarity, parallelism or orthogonality, are easy to delineate by a user, and are well adapted to model the main structure of e.g. architectural scenes. We propose methods for camera calibration, camera position estimation and 3D scene reconstruction, all based on such geometric constraints. Various approaches exist for calibration and positioning from constraints, often based on vanishing points. We generalize this by considering composite primitives based on triplets of vanishing points. These are frequent in architectural scenes and considering composites of vanishing points makes computations more stable. They are defined by depicting in the images points belonging to parallelepipedic structures (e.g. appropriate points on two connected walls). Constraints on angles or length ratios on these structures can then be easily imposed. A method is proposed that "collects" all these data for all considered images, and computes simultaneously the calibration and pose of all cameras via matrix factorization. 3D scene reconstruction is then performed using many more geometric constraints, i.e. not only those encapsulated by parallelepipedic structures. A method is proposed that reconstructs the whole scene in iterations, solving a linear equation system at each iteration, and which includes an analysis of the parts of the scene that can/cannot be reconstructed at the current stage. The complete approach is validated by various experimental results, for cases where a single or several views are available

Aprendizaje de estructuras 3D a partir de secuencias de imágenes

La reconstrucción 3D densa a partir de secuencias monoculares es una tecnología clave para varias aplicaciones y todavía un problema de investigación abierto. Este trabajo aprovecha resultados recientes en estimación de profundidad a partir de una sola vista utilizando CNN (Redes neuronales convolucionales) y los fusiona con la estimación de un método directo multi-vista. Ambas aproximaciones muestran fortalezas complementarias. Primero, los métodos basados en múltiples vistas son muy precisos en zonas con mucha textura en secuencias de alto paralaje. Segundo, el método que estima la profundidad a partir de una imagen captura muy bien la estructura local, incluidas las áreas sin textura, aunque carece de coherencia global. La fusión de estas dos estimaciones que proponemos tiene varios retos. En primer lugar, las dos profundidades están relacionadas por una deformación no rígida que depende en el contenido de la imagen. Y en segundo, la selección de los puntos de alta precisión del método multi-vista puede ser complicada en configuraciones de bajo paralaje. Presentamos una contribución a los dos problemas. Nuestros resultados en los conjuntos de datos públicos de NYU y TUM muestran que nuestro algoritmo mejora a las dos aproximaciones por separado

3D reconstruction of curved objects from single 2D line drawings.

Wang, Yingze.Thesis (M.Phil.)--Chinese University of Hong Kong, 2009.Includes bibliographical references (leaves 42-47).Abstract also in Chinese.Chapter 1 --- Introduction --- p.1Chapter 2 --- Related Work --- p.5Chapter 2.1 --- Line labeling and realization problem --- p.5Chapter 2.2 --- 3D reconstruction from multiple views --- p.6Chapter 2.3 --- 3D reconstruction from single line drawings --- p.7Chapter 2.3.1 --- Face identification from the line drawings --- p.7Chapter 2.3.2 --- 3D geometry reconstruction --- p.9Chapter 2.4 --- Our research topic and contributions --- p.13Chapter 3 --- Reconstruction of Curved Manifold Objects --- p.14Chapter 3.1 --- Assumptions and terminology --- p.14Chapter 3.2 --- Reconstruction of curved manifold objects --- p.17Chapter 3.2.1 --- Distinguishing between curved and planar faces --- p.17Chapter 3.2.2 --- Transformation of Line Drawings --- p.20Chapter 3.2.3 --- Regularities --- p.23Chapter 3.2.4 --- 3D Wireframe Reconstruction --- p.26Chapter 3.2.5 --- Generating Curved Faces --- p.28Chapter 3.2.6 --- The Complete 3D Reconstruction Algorithm --- p.33Chapter 4 --- Experiments --- p.35Chapter 5 --- Conclusions and Future Work --- p.40Chapter 5.1 --- Conclusions --- p.40Chapter 5.2 --- Future work --- p.40Bibliography --- p.4

Parameter optimization and learning for 3D object reconstruction from line drawings.

Du, Hao.Thesis (M.Phil.)--Chinese University of Hong Kong, 2010.Includes bibliographical references (p. 61).Abstracts in English and Chinese.Chapter 1 --- Introduction --- p.1Chapter 1.1 --- 3D Reconstruction from 2D Line Drawings and its Applications --- p.1Chapter 1.2 --- Algorithmic Development of 3D Reconstruction from 2D Line Drawings --- p.3Chapter 1.2.1 --- Line Labeling and Realization Problem --- p.4Chapter 1.2.2 --- 3D Reconstruction from Multiple Line Drawings --- p.5Chapter 1.2.3 --- 3D Reconstruction from a Single Line Drawing --- p.6Chapter 1.3 --- Research Problems and Our Contributions --- p.12Chapter 2 --- Adaptive Parameter Setting --- p.15Chapter 2.1 --- Regularities in Optimization-Based 3D Reconstruction --- p.15Chapter 2.1.1 --- Face Planarity --- p.18Chapter 2.1.2 --- Line Parallelism --- p.19Chapter 2.1.3 --- Line Verticality --- p.19Chapter 2.1.4 --- Isometry --- p.19Chapter 2.1.5 --- Corner Orthogonality --- p.20Chapter 2.1.6 --- Skewed Facial Orthogonality --- p.21Chapter 2.1.7 --- Skewed Facial Symmetry --- p.22Chapter 2.1.8 --- Line Orthogonality --- p.24Chapter 2.1.9 --- Minimum Standard Deviation of Angles --- p.24Chapter 2.1.10 --- Face Perpendicularity --- p.24Chapter 2.1.11 --- Line Collinearity --- p.25Chapter 2.1.12 --- Whole Symmetry --- p.25Chapter 2.2 --- Adaptive Parameter Setting in the Objective Function --- p.26Chapter 2.2.1 --- Hill-Climbing Optimization Technique --- p.28Chapter 2.2.2 --- Adaptive Weight Setting and its Explanations --- p.29Chapter 3 --- Parameter Learning --- p.33Chapter 3.1 --- Construction of A Large 3D Object Database --- p.33Chapter 3.2 --- Training Dataset Generation --- p.34Chapter 3.3 --- Parameter Learning Framework --- p.37Chapter 3.3.1 --- Evolutionary Algorithms --- p.38Chapter 3.3.2 --- Reconstruction Error Calculation --- p.39Chapter 3.3.3 --- Parameter Learning Algorithm --- p.41Chapter 4 --- Experimental Results --- p.45Chapter 4.1 --- Adaptive Parameter Setting --- p.45Chapter 4.1.1 --- Use Manually-Set Weights --- p.45Chapter 4.1.2 --- Learn the Best Weights with Different Strategies --- p.48Chapter 4.2 --- Evolutionary-Algorithm-Based Parameter Learning --- p.49Chapter 5 --- Conclusions and Future Work --- p.53Bibliography --- p.5

3D object reconstruction from line drawings.

Cao Liangliang.Thesis (M.Phil.)--Chinese University of Hong Kong, 2005.Includes bibliographical references (leaves 64-69).Abstracts in English and Chinese.Chapter 1 --- Introduction and Related Work --- p.1Chapter 1.1 --- Reconstruction from Single Line Drawings and the Applications --- p.1Chapter 1.2 --- Optimization-based Reconstruction --- p.2Chapter 1.3 --- Other Reconstruction Methods --- p.2Chapter 1.3.1 --- Line Labeling and Algebraic Methods --- p.2Chapter 1.3.2 --- CAD Reconstruction --- p.3Chapter 1.3.3 --- Modelling from Images --- p.3Chapter 1.4 --- Finding Faces of Line Drawings --- p.4Chapter 1.5 --- Generalized Cylinder --- p.4Chapter 1.6 --- Research Problems and Our Contribution --- p.5Chapter 1.6.1 --- A New Criteria --- p.5Chapter 1.6.2 --- Recover Objects from Line Drawings without Hidden Lines --- p.6Chapter 1.6.3 --- Reconstruction of Curved Objects --- p.6Chapter 1.6.4 --- Planar Limbs Assumption and the Derived Models --- p.6Chapter 2 --- A New Criteria for Reconstruction --- p.8Chapter 2.1 --- Introduction --- p.8Chapter 2.2 --- Human Visual Perception and the Symmetry Measure --- p.10Chapter 2.3 --- Reconstruction Based on Symmetry and Planarity --- p.11Chapter 2.3.1 --- Finding Faces --- p.11Chapter 2.3.2 --- Constraint of Planarity --- p.11Chapter 2.3.3 --- Objective Function --- p.12Chapter 2.3.4 --- Reconstruction Algorithm --- p.13Chapter 2.4 --- Experimental Results --- p.13Chapter 2.5 --- Summary --- p.18Chapter 3 --- Line Drawings without Hidden Lines: Inference and Reconstruction --- p.19Chapter 3.1 --- Introduction --- p.19Chapter 3.2 --- Terminology --- p.20Chapter 3.3 --- Theoretical Inference of the Hidden Topological Structure --- p.21Chapter 3.3.1 --- Assumptions --- p.21Chapter 3.3.2 --- Finding the Degrees and Ranks --- p.22Chapter 3.3.3 --- Constraints for the Inference --- p.23Chapter 3.4 --- An Algorithm to Recover the Hidden Topological Structure --- p.25Chapter 3.4.1 --- Outline of the Algorithm --- p.26Chapter 3.4.2 --- Constructing the Initial Hidden Structure --- p.26Chapter 3.4.3 --- Reducing Initial Hidden Structure --- p.27Chapter 3.4.4 --- Selecting the Most Plausible Structure --- p.28Chapter 3.5 --- Reconstruction of 3D Objects --- p.29Chapter 3.6 --- Experimental Results --- p.32Chapter 3.7 --- Summary --- p.32Chapter 4 --- Curved Objects Reconstruction from 2D Line Drawings --- p.35Chapter 4.1 --- Introduction --- p.35Chapter 4.2 --- Related Work --- p.36Chapter 4.2.1 --- Face Identification --- p.36Chapter 4.2.2 --- 3D Reconstruction of planar objects --- p.37Chapter 4.3 --- Reconstruction of Curved Objects --- p.37Chapter 4.3.1 --- Transformation of Line Drawings --- p.37Chapter 4.3.2 --- Finding 3D Bezier Curves --- p.39Chapter 4.3.3 --- Bezier Surface Patches and Boundaries --- p.40Chapter 4.3.4 --- Generating Bezier Surface Patches --- p.41Chapter 4.4 --- Results --- p.43Chapter 4.5 --- Summary --- p.45Chapter 5 --- Planar Limbs and Degen Generalized Cylinders --- p.47Chapter 5.1 --- Introduction --- p.47Chapter 5.2 --- Planar Limbs and View Directions --- p.49Chapter 5.3 --- DGCs in Homogeneous Coordinates --- p.53Chapter 5.3.1 --- Homogeneous Coordinates --- p.53Chapter 5.3.2 --- Degen Surfaces --- p.54Chapter 5.3.3 --- DGCs --- p.54Chapter 5.4 --- Properties of DGCs --- p.56Chapter 5.5 --- Potential Applications --- p.59Chapter 5.5.1 --- Recovery of DGC Descriptions --- p.59Chapter 5.5.2 --- Deformable DGCs --- p.60Chapter 5.6 --- Summary --- p.61Chapter 6 --- Conclusion and Future Work --- p.62Bibliography --- p.6