Filters








532 Hits in 4.7 sec

Spatio-Temporal Shape from Silhouette using Four-Dimensional Delaunay Meshing

Ehsan Aganj, Jean-Philippe Pons, Florent Segonne, Renaud Keriven
2007 2007 IEEE 11th International Conference on Computer Vision  
By considering time as an additional dimension, our approach exploits seamlessly the time coherence between different frames to produce a compact and high-quality 4D mesh representation of the visual hull  ...  Our numerical experiments demonstrate the effectiveness and flexibility of our approach for generating compact, high-quality, time-coherent visual hull representations from real silhouette image data.  ...  Static 3D Visual Hull Reconstruction Our first experiment focuses on static visual hull reconstruction.  ... 
doi:10.1109/iccv.2007.4409016 dblp:conf/iccv/AganjPSK07 fatcat:7t5oamoguvetvo34qfy5jbvkrq

High resolution surface reconstruction from overlapping multiple-views

Nader Salman, Mariette Yvinec
2009 Proceedings of the 25th annual symposium on Computational geometry - SCG '09  
Finally, a mesh is computed from the triangle soup using a reconstruction method that combines restricted Delaunay triangulation and Delaunay refinement.  ...  However, computing an accurate mesh of the scene based on such poor quality data points (noise, sparsity) is very difficult.  ...  A first class of stereo vision reconstruction algorithms is based on the concept of visual hull [9] .  ... 
doi:10.1145/1542362.1542386 dblp:conf/compgeom/SalmanY09 fatcat:zq6ywmozc5c2lp6aawa7rvodze

A Fast Progressive Image Sampling Using Lifting Scheme And Non-Uniform B-Splines

Siddavatam Rajesh, K. Sandeep, R.K. Mittal
2007 2007 IEEE International Symposium on Industrial Electronics  
The efficiency of the present method is shown and the visual qualities of the multiresolution images are compared with those obtained by other methods.  ...  An image, which is considered here as the functions of Non-uniform B-splines over the Delaunay triangulation, is developed by using recursively obtained scattered data set of significant pixels.  ...  Fig Fig 4, TIN obtained by Delaunay triangulation on 1925 points is displayed. A good visual quality of image is obtained after 7 th iteration as shown in Fig. 5.  ... 
doi:10.1109/isie.2007.4374851 fatcat:7z7gy4dh6vel5bf6d5dumhvd6i

On Volumetric Shape Reconstruction from Implicit Forms [chapter]

Li Wang, Franck Hétroy-Wheeler, Edmond Boyer
2016 Lecture Notes in Computer Science  
refinement and CVTs, including accuracy and shape quality of the resulting shape mesh.  ...  This is the case with image based reconstructions that produce point clouds from which implicit functions are computed, with for instance a Poisson reconstruction approach.  ...  They can also be built directly from image primitives, for instance the implicit visual hull form, e.g. [3] with image silhouettes.  ... 
doi:10.1007/978-3-319-46487-9_11 fatcat:yt5nphml55dmbae67luxw7dyeu

Mesh Generation from 3D Multi-material Images [chapter]

Dobrina Boltcheva, Mariette Yvinec, Jean-Daniel Boissonnat
2009 Lecture Notes in Computer Science  
In this paper, we propose a feature preserving Delaunay refinement algorithm which can be used to generate high-quality tetrahedral meshes from segmented images.  ...  The optimization property of the Delaunay triangulation makes these meshes suitable for the purpose of realistic visualization or finite element simulations.  ...  From these surface points, Delaunay-based meshing scheme outputs high-quality surface meshes.  ... 
doi:10.1007/978-3-642-04271-3_35 fatcat:idmfgcko7bh6tjszizzb6sd5a4

Convex bricks: A new primitive for visual hull modeling and reconstruction

Visesh Chari, Amit Agrawal, Yuichi Taguchi, Srikumar Ramalingam
2012 2012 IEEE International Conference on Robotics and Automation  
Using CB, we describe an algorithm to generate a polyhedral visual hull from polygonal silhouettes; the visual hull is reconstructed as a combination of 3D convex bricks.  ...  Using CB, we describe an algorithm to generate a polyhedral visual hull from polygonal silhouettes; the visual hull is reconstructed as a combination of 3D convex bricks.  ...  Recent state-of-the-art approach by Franco and Boyer [8] has shown high quality visual hull reconstruction by first retrieving the viewing edges.  ... 
doi:10.1109/icra.2012.6225055 dblp:conf/icra/ChariATR12 fatcat:voq6cyaofrcghjj3sz6p3642iq

Surface Reconstruction from Multi-View Stereo of Large-Scale Outdoor Scenes

Nader Salman, Mariette Yvinec
2010 International Journal of Virtual Reality  
It combines depth-maps construction in the image planes with surface reconstruction through restricted Delaunay triangulation. The method may handle very large scale outdoor scenes.  ...  This article describes an original method to reconstruct a 3D scene from a sequence of images.  ...  [16] interestingly mixes a 3D volumetric method and implicit methods to output high quality meshed models.  ... 
doi:10.20870/ijvr.2010.9.1.2758 fatcat:sbcz4ez4x5eyhjj2geoap77o3i

Terrain Modeling Using Voronoi Hierarchies [chapter]

Martin Bertram, Shirley E. Konkle, Hans Hagen, Bernd Hamann, Kenneth I. Joy
2003 Mathematics and Visualization  
We use the convex hull of the given sites as domain for our hierarchical representation.  ...  The quality of approximations obtained with our method compares favorably to results obtained from other multiresolution algorithms like wavelet transforms.  ...  We thank the members of the Visualization and Graphics Research Group at the Center for Image Processing and Integrated Computing (CIPIC) at the University of California, Davis.  ... 
doi:10.1007/978-3-642-55787-3_6 fatcat:bn2zdkvvxrcidfcof7fecpaq2y

Novel view image synthesis based on photo-consistent 3D model deformation

Meng Hsuan Chia, Chien Hsing He, Huei Yung Lin
2013 International Journal of Computational Science and Engineering (IJCSE)  
In this system, we first use the reconstructed visual hull from shape from silhouette and then refine this 3D model based on the view dependency.  ...  The key energy is the photo-consistency energy with additional smoothness energy and contour/visual hull energy.  ...  Refine non-outline points Our system uses visual hull for the initial model, but the concavity of the 3D model cannot be reconstructed based on the visual hull.  ... 
doi:10.1504/ijcse.2013.057296 fatcat:7esb4nv55jfqvek5xqlhmoiobq

Surface Reconstruction of Scenes Using a Catadioptric Camera [chapter]

Shuda Yu, Maxime Lhuillier
2011 Lecture Notes in Computer Science  
This paper presents a method to reconstruct a surface from images of a scene taken by an equiangular catadioptric camera.  ...  Experiments are provided from hundreds of photographs taken by a pedestrian.  ...  The 3d Delaunay has 59780 vertices and is reconstructed using the incremental 3d Delaunay of CGAL [3] . During the ray tracing step, 191947 tetrahedra are intersected by 398956 rays.  ... 
doi:10.1007/978-3-642-24136-9_13 fatcat:adahwhkgavazzh46lpkc73zh6u

3D reconstruction from 2D images with hierarchical continuous simplices

Yunhao Tan, Jing Hua, Ming Dong
2007 The Visual Computer  
Our experiments demonstrated that our approach can achieve high accuracy in the data reconstruction.  ...  Then a solid model is reconstructed using simplex splines with fitting and faring procedures. The reconstructed heterogenous volu-metric model can be quantitatively analyzed and easily visualized.  ...  This research was supported in part by Michigan Technology Tri-Corrdior grants MTTC05-135/GR686 and MTTC05-154/GR705.  ... 
doi:10.1007/s00371-007-0157-0 fatcat:xrd25uxeereffaaiajph7x42o4

Efficient Multi-View Reconstruction of Large-Scale Scenes using Interest Points, Delaunay Triangulation and Graph Cuts

Patrick Labatut, Jean-Philippe Pons, Renaud Keriven
2007 2007 IEEE 11th International Conference on Computer Vision  
Finally, it reconstructs the scene by labeling Delaunay tetrahedra as empty or occupied, thus generating a triangular mesh of the scene.  ...  Our motivation is that most existing multi-view stereovision approaches require some knowledge of the scene extent and often even of its approximate geometry (e.g. visual hull).  ...  This ranges from a tight bounding box to a closer approximation by the visual hull.  ... 
doi:10.1109/iccv.2007.4408892 dblp:conf/iccv/LabatutPK07 fatcat:kbcqvm724jc6xaxoompcykaaha

Spherical DCB-Spline Surfaces with Hierarchical and Adaptive Knot Insertion

Juan Cao, Xin Li, Zhonggui Chen, Hong Qin
2012 IEEE Transactions on Visualization and Computer Graphics  
Also, we develop a hierarchical and adaptive method that progressively improves the fitting quality by new knot-insertion strategies guided by surface geometry and fitting error.  ...  In this framework, we efficiently compute Delaunay configurations on sphere by the union of two planar Delaunay configurations.  ...  To generate a visually smooth high-quality surface, postprocessing procedures [25] , [27] are necessary.  ... 
doi:10.1109/tvcg.2011.156 pmid:21931175 fatcat:epbze77pv5gp5m4whdiygg4dy4

Meshing interfaces of multi-label data with Delaunay refinement

Tamal K. Dey, Firdaus Janoos, Joshua A. Levine
2011 Engineering with Computers  
We apply a recent Delaunay refinement algorithm to generate high quality triangular meshes which approximate the interface surfaces.  ...  In medical imaging, the generation of surface representations of anatomical objects, obtained by labeling images from various modalities, is a critical component for visualization.  ...  The tomato and orange datasets were produced at Lawrence Berkeley Laboratory by Bill Johnston and Wing Nip of the Information and Computing Sciences Division.  ... 
doi:10.1007/s00366-011-0217-y fatcat:zf5qdob6hfg7tkj2os4asslwgm

Carving for topology simplification of polygonal meshes

Nate Hagbi, Jihad El-Sana
2010 Computer-Aided Design  
We present quality results for two families of meshes that are difficult to simplify by all existing methods known to us: topologically complex meshes and highly clustered meshes.  ...  We further present a carving algorithm that is based on constrained Delaunay tetrahedralization.  ...  Acknowledgments This work was supported by the Lynn and William Frankel Center for Computer Sciences. In addition, we would like to thank the reviewers for their constructive comments.  ... 
doi:10.1016/j.cad.2009.04.001 fatcat:rsii7p3cera2hmpjz7s2vwxkja
« Previous Showing results 1 — 15 out of 532 results