Exploration trees on highly complex scenes: A new approach for 3D segmentation

A new strategy for automatic object extraction in highly complex scenes is presented in this paper. The method proposed gives a solution for 3D segmentation avoiding most restrictions imposed in other techniques. Thus, our technique is applicable on unstructured 3D information (i.e. cloud of points), with a single view of the scene, scenes consisting of several objects where contact, occlusion and shadows are allowed, objects with uniform intensity/texture and without restrictions of shape, pose or location. In order to have a fast segmentation stopping criteria, the number of objects in the scene is taken as input. The method is based on a new distributed segmentation technique that explores the 3D data by establishing a set of suitable observation directions. For each exploration viewpoint, a strategy [3D data]-[2D projected data]-[2D segmentation]-[3D segmented data] is accomplished. It can be said that this strategy is different from current 3D segmentation strategies. This method has been successfully tested in our lab on a set of real complex scenes. The results of these experiments, conclusions and future improvements are also shown in the paper.     

具有强鲁棒性的三维对象多视变分分割方法

针对校准摄像机采集系列图像的三维分割重构问题,提出了一种新的面向概率描述的变分方法。首先,计算系列图像的极大似然曲面,可重构与分割保持一致的三维曲面;接着,融合联合概率,可重构目标对象及图像背景的平均强度及标准差;最后,采用水平集框架,可实现对曲面能量方程的数值模拟。该方法适用于复杂拓扑结构重构及噪声数据处理。实验结果表明,该方法实用性好,鲁棒性强,对任意三维对象的分割重构效果较形状雕刻方法及体视分割方法理想。     

A semi-interactive panorama based 3D reconstruction framework for indoor scenes

We present a semi-interactive method for 3D reconstruction specialized for indoor scenes which combines computer vision techniques with efficient interaction. We use panoramas, popularly used for visualization of indoor scenes, but clearly not able to show depth, for their great field of view, as the starting point. Exploiting user defined knowledge, in term of a rough sketch of orthogonality and parallelism in scenes, we design smart interaction techniques to semi-automatically reconstruct a scene from coarse to fine level. The framework is flexible and efficient. Users can build a coarse walls-and-floor textured model in five mouse clicks, or a detailed model showing all furniture in a couple of minutes interaction. We show results of reconstruction on four different scenes. The accuracy of the reconstructed models is quite high, around 1% error at full room scale. Thus, our framework is a good choice for applications requiring accuracy as well as application requiring a 3D impression of the scene.     

Interactive 3D reconstruction from multiple images: A primitive-based approach

This paper proposes a fast and stable image-based modeling method which generates 3D models with high-quality face textures in a semi-automatic way. The modeler guides untrained users to quickly obtain 3D model data via several steps of simple user interface operations using predefined 3D primitives. The proposed method contains an iterative non-linear error minimization technique in the model estimation step with an error function based on finite line segments instead of infinite lines. The error corresponds to the difference between the observed structure and the predicted structure from current model parameters. Experimental results on real images validate the robustness and the accuracy of the algorithm.     

3D reconstruction of free-formed line-like objects using NURBS representation

3D reconstruction of arbitrary free-formed objects is an important and challenging problem in computer vision. In this paper, we first discuss the importance of primitive selection in 3D reconstruction. Subsequently, a theorem, which reveals the perspective invariance of NURBS, is shown, making it a good choice as primitive in 3D reconstruction. Consequently, based on this theorem a new paradigm of free-formed line-like object reconstruction using NURBS as primitives is proposed. Furthermore, an approach for determining weights for 3D NURBS is presented, and the width effect of curved line-like objects is analyzed. Finally, experiments with line-like objects and machine part demonstrate the feasibility of our approach and prove the superiority of our approach over the point- or segment-based approaches as well as the B-spline-based reconstruction approach in terms of robustness and accuracy.     

Accurate spatio-temporal reconstruction of missing data in dynamic scenes

In this paper, the accurate method for texture reconstruction with non-desirable moving objects into dynamic scenes is proposed. This task is concerned to editor off-line functions, and the main criteria are the accuracy and visibility of the reconstructed results. The method is based on a spatio-temporal analysis and includes two stages. The first stage uses a feature points tracking to locate the rigid objects accurately under the assumption of their affine motion model. The second stage involves the accurate reconstruction of video sequence based on texture maps of smoothness, structural properties, and isotropy. These parameters are estimated by three separate neural networks of a back propagation. The background reconstruction is realized by a tile method using a single texton, a line, or a field of textons. The proposed technique was tested into reconstructed regions with a frame area up to 8–20%. The experimental results demonstrate more accurate inpainting owing to the improved motion estimations and the modified texture parameters.     

System for reconstruction of three-dimensional micro objects from multiple photographic images

We introduce a system to reconstruct a three-dimensiojnal (3D) polygonal model of 3D micro objects with outer dimensions ranging from several hundred microns to several millimeters from multiple two-dimensional (2D) images of an object taken from different views. The data acquisition system consists of a digital microscope that captures still images at a resolution of 1600 × 1200 pixels and a computer-controlled turntable. We employ the shape-from-silhouette (SFS) method to construct a voxel-based 3D model from silhouette images. The concave shapes are further carved by using the space carving technique. In order to make the resulting model compatible with a commercial CAD/CAM system, the voxel model is converted into a triangular mesh using the marching cubes algorithm. Because the mesh generated from the voxel model by using the marching cubes algorithm inherits the staircase effect, the mesh is adjusted to recover the object precisely by using silhouette images. Finally, we evaluate the accuracy of the proposed method. The reconstructed models of complex micro objects indicate the effectiveness of the 3D shape reconstruction system for micro objects.     

Building 3D anatomical scenes on the Web

We propose a new service for building user‐defined 3D anatomical structures on the Web. The Web server is connected to a database storing more than 1000 3D anatomical models reconstructed from the Visible Human. Users may combine existing models as well as planar oblique slices in order to create their own structured anatomical scenes. Furthermore, they may record sequences of scene construction and visualization actions. These actions enable the server to construct high‐quality video animations, downloadable by the user. Professionals and students in anatomy, medicine and related disciplines are invited to use the server and create their own anatomical scenes. Copyright © 2002 John Wiley & Sons, Ltd.     

A hand-held approach to 3D reconstruction using light stripe projections onto a cube frame

The current paper presents a new light-striping approach for reconstructing a 3D model from a real object. The proposed system consists of a light plane projector, camera, and cube frame with LEDs attached. Instead of a strictly controlled camera and light emitters, a freely movable hand-held device is used that enables one to scan self-occluded objects. As in other light-striping systems, the correspondence problem is solved by projecting a light plane onto an object inside a frame. In the proposed system, the 3D coordinates of an illuminated light stripe are obtained using a calibration-free approach or dynamic optical triangulation. Furthermore, the computed 3D point data does not require any registration process because the data is directly measured based on unified world coordinates. Experimental results proved the accuracy of the measurements and consistency of the outcomes without any knowledge of the camera and light source parameters. An erratum to this article can be found at     

3D reconstruction using silhouettes from unordered viewpoints

In this paper, we present a novel approach for reconstructing an object surface from its silhouettes. The proposed approach directly estimates the differential structure of the surface, and results in a higher accuracy than existing volumetric approaches for object reconstruction. Compared with other existing differential approaches, our approach 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. Experimental results on both synthetic and real world data are presented, and comparison is made with other existing approaches to demonstrate the superiority of the proposed approach.     

An automated pottery archival and reconstruction system

Motivated by the current requirements of archaeologists, we are developing an automated archival system for archaeological classification and reconstruction of ceramics. Our system uses the profile of an archaeological fragment, which is the cross‐section of the fragment in the direction of the rotational axis of symmetry, to classify and reconstruct it virtually. Ceramic fragments are recorded automatically by a 3D measurement system based on structured (coded) light. The input data for the estimation of the profile is a set of points produced by the acquisition system. By registering the front and the back views of the fragment the profile is computed and measurements like diameter, area percentage of the complete vessel, height and width are derived automatically. We demonstrate the method and give results on synthetic and real data. Copyright © 2003 John Wiley & Sons, Ltd.     

无序图像三维重构中的图像选择技术

针对无序图像的三维重构问题,本文提出了一种图像选择算法,在三维重构算法运行之前,首先利用图像间的全局运动估计,去除冗余的图像,有效的减少了问题的规模,同时保持图像间的大部分连接关系,并能够较好地防止出现退化情况。为了验证本文的算法,针对一系列图像进行了测试,实验结果证明,作为三维重构的一个预处理过程,提高了三维重构算法的运行效率和算法的鲁棒性,具有很高的实用价值。     

动态变形表面三维重建方法研究与实现*

提出一种对可变性物体表面的动态变形过程进行三维重建的方法.将图像序列第一帧中物体表面划分成多个图像块,利用优化函数寻找每个图像块在所有帧中的对应关系,最终实现物体运动过程的三维重建;完成每一帧的三维重建后,根据图像关联度和局部拓扑结构对结果进行错误检测,并对出错块进行重新优化.模拟实验、实际数据实验以及与同类算法的比较,验证了该方法的有效性和可行性.     

Three-dimensional motion and reconstruction of coronary arteries from biplane cineangiography

A new approach is described for reconstructing coronary arteries from two sequences of projection images. The estimation of motion is performed on three-dimensional line segments (or centrelines), and is based on a ‘predictionprojection-optimization’ loop. The method copes with time varying properties, deformations and superpositions of vessels. Experiments using simulated and real data have been carried out. and the results found to be robust over a full cycle of a human heart. Local and global kinetic features can then be derived to obtain a greater insight on the cardiac functional state     

Projective reconstruction of ellipses from multiple images

This paper presents a new approach for reconstructing 3D ellipses (including circles) from a sequence of 2D images taken by uncalibrated cameras. Our strategy is to estimate an ellipse in 3D space by reconstructing N(≥5) 3D points (called representative points) on it, where the representative points are reconstructed by minimizing the distances from their projections to the measured 2D ellipses on different images (i.e., 2D reprojection error). This minimization problem is transformed into a sequence of minimization sub-problems that can be readily solved by an algorithm which is guaranteed to converge to a (local) minimum of the 2D reprojection error. Our method can reconstruct multiple 3D ellipses simultaneously from multiple images and it readily handles images with missing and/or partially occluded ellipses. The proposed method is evaluated using both synthetic and real data.     

A column-space approach to projective reconstruction

The problem of projective reconstruction for multiple views is considered using a factorization method. A common difficulty of existing formulations of the factorization problem is that they do not adequately constrain the depth parameters thus allowing the algorithm to converge to ‘view-deficient’ solutions with entire views being suppressed. We propose to include a variance measure with an adaptive weighting parameter in the formulation of the factorization problem to overcome this difficulty. Algorithmic solutions with guaranteed convergence are provided to perform factorization under the condition that there may be missing data in the images.     

心内膜表面几何模型三维重建算法研究

心内膜三维表面重建是心内膜三维标测系统中的关键问题。为了满足实际应用需求, 根据采集到的散乱点云数据的特点, 提出了一种改进的泊松表面重建算法。在估计表面点云法向量的基础上, 对表面点云法向量进行法向量一致化处理, 有效地控制时间复杂度, 快速重建出平滑的心脏模型。针对泊松表面重建算法中构建MC曲面出现的二义性问题, 提出一种消除二义性的简化改进方法, 可以更加精确地获取模型逼真表面, 提高重建的速度和精度。同时, 可以根据医生的要求, 对重建出的模型实时修正, 满足临床应用。最后, 通过实验验证了算法的有效性和可行性。     

基于模型的航空影像矩形建筑物半自动建模

针对航空影像中矩形建筑物半自动重建进行了研究。该方法基于最小二乘模型影像匹配算法,通过使航空影像中提取的建筑物边缘与模型投影线之间距离和最小计算建筑物的参数。给出用CSG与B-Rep相结合描述的矩形体基本模型,人工在影像上选点建立建筑物的初始模型,将初始模型反投到影像上,并对影像进行边缘提取,根据最小二乘模型影像匹配算法求解最佳模型参数。实验结果证明该方法有较高的准确性。该算法除航空影像与影像方位元素外不需要其他辅助数据,只需人工计算初始值,其他计算由计算机完成,速度较快,节约了人力物力,具有较强的应用价值。     

Projective reconstruction from line-correspondences in multiple uncalibrated images

A new approach is proposed for reconstructing 3D lines and cameras from 2D corresponding lines across multiple uncalibrated views. There is no requirement that the 2D corresponding lines on different images represent the same segment of a 3D line, which may not appear on all images. A 3D line is reconstructed by minimizing a geometric cost function that measures the distance of the reprojected end points of the 3D segment from the measured 2D lines on different images. An algorithmic procedure is provided with guaranteed convergence to a solution where the geometric cost function achieves a (local) minimum.