Filters








25,865 Hits in 6.1 sec

An Experimental Comparison of Discrete and Continuous Shape Optimization Methods [chapter]

Maria Klodt, Thomas Schoenemann, Kalin Kolev, Marek Schikora, Daniel Cremers
2008 Lecture Notes in Computer Science  
We also present a novel method to approximate length regularity in a graph cut based framework: Instead of using pairwise terms we introduce higher order terms.  ...  Shape optimization is a problem which arises in numerous computer vision problems such as image segmentation and multiview reconstruction.  ...  It hence allows intermediate values where the graph cut only allows binary values. (a) 4 -Fig. 4 . 44 Fig. 4.  ... 
doi:10.1007/978-3-540-88682-2_26 fatcat:jdxsk6ecvrd5lakoryknzb4yna

Continuous Global Optimization in Multiview 3D Reconstruction

Kalin Kolev, Maria Klodt, Thomas Brox, Daniel Cremers
2009 International Journal of Computer Vision  
In this work, we introduce a robust energy model for multiview 3D reconstruction that fuses silhouette-and stereo-based image information.  ...  In contrast to graph cut methods, discretizations of the continuous optimization technique are consistent and independent of the choice of the grid connectivity.  ...  Figure 3 shows reconstructions from the above image sequence by using discrete graph cuts and the proposed continuous optimization technique applied on the model described in section 3.  ... 
doi:10.1007/s11263-009-0233-1 fatcat:jlgah5ti5zdwhklfk5c675ieem

A Surface Reconstruction Method Using Global Graph Cut Optimization

Sylvain Paris, François X. Sillion, Long Quan
2006 International Journal of Computer Vision  
Disparity methods based on graph cuts Originally, Roy and Cox [4], [5] have formulated graph-cut methods applied to 3D reconstruction as an extension of the existing approaches based on dynamic programming  ...  Geometric method based on graph cuts The previous methods all rely on a disparity-based formulation.  ...  Up to now, graph-cut methods have mainly described the problem in terms of image disparity: different disparity values are selected and each image pixel has to be labeled with one of those values.  ... 
doi:10.1007/s11263-005-3953-x fatcat:gl3r7kkvu5g5bebahg6r5qlvm4

Global Depth from Epipolar Volumes--A General Framework for Reconstructing Non-Lambertian Surfaces

Timo Stich, Art Tevs, Marcus Magnor
2006 Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06)  
The proposed framework in conjunction with graph cut optimization is able to reconstruct also highly specular surfaces.  ...  Using Epipolar Image Analysis in the context of the correspondence finding problem in depth reconstruction has several advantages.  ...  Since we use graph cuts to optimize the energy function we have to discretize the depth. Thus the quality of the reconstructed volume depends on a sufficient discretization of the result space.  ... 
doi:10.1109/3dpvt.2006.69 dblp:conf/3dpvt/StichTM06 fatcat:anp24s64lbha5gwhvimqtu5qh4

A Practical Approach for Super-Resolution using Photometric cue and Graph Cuts

S. Sharma, M. V. Joshi
2007 Procedings of the British Machine Vision Conference 2007  
We model the high resolution structure (surface gradients) as a Markov Random Field (MRF) and use graph cuts with discontinuity preservation to get a high resolution depth map.  ...  Also, since we are using photometric cue, there is no need of registration as is required in motion based approaches.  ...  Although, not much difference can be seen in the high resolution images reconstructed using the two methods, the MSE values clearly show that the high resolution images obtained using our graph cuts based  ... 
doi:10.5244/c.21.83 dblp:conf/bmvc/SharmaJ07 fatcat:rptsec5l6fafjpfaagg7tkny5q

Surface Reconstruction by Propagating 3D Stereo Data in Multiple 2D Images [chapter]

Gang Zeng, Sylvain Paris, Long Quan, Maxime Lhuillier
2004 Lecture Notes in Computer Science  
This constrained optimization for a surface patch could be handled by a local graph-cut that we develop. Real experiments demonstrate the usability and accuracy of the approach.  ...  We present a novel approach to surface reconstruction from multiple images. The central idea is to explore the integration of both 3D stereo data and 2D calibrated images.  ...  Also thanks to Yichen Wei and Ajay Kumar for allowing us to use their head images.  ... 
doi:10.1007/978-3-540-24670-1_13 fatcat:42i5wwj6drdhhkm4s2oxp7t7tu

Multi-View Reconstruction using Narrow-Band Graph-Cuts and Surface Normal Optimization

A. Ladikos, S. Benhimane, N. Navab
2008 Procedings of the British Machine Vision Conference 2008  
This paper presents a new algorithm for reducing the minimal surface bias associated with volumetric graph cuts for 3D reconstruction from multiple calibrated images.  ...  The algorithm is based on an iterative graph-cut over narrow bands combined with an accurate surface normal estimation.  ...  This helps to avoid some of the discretization artifacts associated with graph cuts. Proposed Reconstruction Method We use an iterative graph-cut approach to recover the shape of the object.  ... 
doi:10.5244/c.22.15 dblp:conf/bmvc/LadikosBN08 fatcat:jwdmaa75xndorpgd672qgwnl2i

Multiview Stereo via Volumetric Graph-Cuts and Occlusion Robust Photo-Consistency

G. Vogiatzis, C. Hernandez, P.H.S. Torr, R. Cipolla
2007 IEEE Transactions on Pattern Analysis and Machine Intelligence  
The globally optimal 3D partitioning can be obtained as the minimum cut solution of a weighted graph.  ...  the reconstructed object.  ...  We adopt an implicit volumetric representation based on voxel occupancy, but we pose the reconstruction problem as finding the minimum cut of a weighted graph.  ... 
doi:10.1109/tpami.2007.70712 pmid:17934232 fatcat:jz6zojzxojhk5mts3wrjc4vhbq

Surface Reconstruction Using Power Watershed [chapter]

Camille Couprie, Xavier Bresson, Laurent Najman, Hugues Talbot, Leo Grady
2011 Lecture Notes in Computer Science  
Surface reconstruction from a set of noisy point measurements has been a well studied problem for several decades.  ...  Recently, variational and discrete optimization approaches have been applied to solve it, demonstrating good robustness to outliers thanks to a global energy minimization scheme.  ...  Results and comparative evaluation Comparison with Graph cuts and Total Variation We now demonstrate the performance of the power watershed algorithm for surface reconstruction with respect to two graph-based  ... 
doi:10.1007/978-3-642-21569-8_33 fatcat:lixyvagc3rgyddywlitot7ii5i

A Markovian Approach for InSAR Phase Reconstruction With Mixed Discrete and Continuous Optimization

A. Shabou, J. Darbon, F. Tupin
2011 IEEE Geoscience and Remote Sensing Letters  
Efficient discrete optimization algorithms based on the graph-cut technique are used to efficiently minimize the energy.  ...  Recently, Markovian models based on multichannel InSAR likelihood statistics and Total Variation prior have been proposed to reconstruct the noisy and wrapped phase.  ...  graph-cut based algorithms [5] .  ... 
doi:10.1109/lgrs.2010.2090336 fatcat:q3vloblpwzf5ppiyih5oxenwwy

Shape from shading using graph cuts

Ju Yong Chang, Kyoung Mu Lee, Sang Uk Lee
2008 Pattern Recognition  
In this paper, we investigate the applicability of graph cuts to the SFS (shape-from-shading) problem. We propose a new semi-global method for SFS using graph cuts.  ...  Experimental results on a variety of synthetic and real-world images show that the proposed algorithm reconstructs the 3-D shape of objects very efficiently.  ...  was supported in part by the ITRC program by Ministry of Information and Communication and in part by Defense Acquisition Program Administration and Agency for Defense Development, Korea, through the Image  ... 
doi:10.1016/j.patcog.2008.05.020 fatcat:p7hf3pys4jclnlwzsuivyiiggm

Reconstructing a dynamic surface from video sequences using graph cuts in 4D space-time

Tianli Yu, Ning Xu, N. Ahuja
2004 Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.  
We use a 4D node-cut algorithm to find a global minimum of the cost function and obtain the corresponding optimal hyper-surface.  ...  The imaging model of video cameras in 4D space-time is derived and a photo-inconsistency cost function is defined for a hyper-surface in the 4D spacetime.  ...  In this paper, we propose an extension of a graph cut based 3D reconstruction algorithm [3] to 4D space-time domain, i.e., to reconstruct a continuously changing 3D surface (not necessarily in rigid  ... 
doi:10.1109/icpr.2004.1334145 dblp:conf/icpr/YuXA04 fatcat:x3a3kulex5bdjbc6n5vf3233au

Globally minimal surfaces by continuous maximal flows

B. Appleton, H. Talbot
2006 IEEE Transactions on Pattern Analysis and Machine Intelligence  
The new algorithm is applied to segmentation in 2D and 3D medical images and to 3D reconstruction from a stereo image pair.  ...  In this paper we consider the problem of computing globally minimal continuous curves and surfaces for image segmentation and 3D reconstruction.  ...  WEIGHTED GRAPHS AND RIEMANNIAN SPACES A number of geometric optimisation techniques have been proposed for computer vision based on discrete graphs [14] , [13] and later continuous Riemannian spaces  ... 
doi:10.1109/tpami.2006.12 pmid:16402623 fatcat:6ankpqdbarewnfrthmh6vx3osu

Urban surface reconstruction in SAR tomography by graph-cuts

Clément Rambour, Loïc Denis, Florence Tupin, Hélène Oriot, Yue Huang, Laurent Ferro-Famil
2019 Computer Vision and Image Understanding  
This paper introduces a surface segmentation algorithm based on the computation of the optimal cut in a flow network.  ...  SAR (Synthetic Aperture Radar) tomography reconstructs 3-D volumes from stacks of SAR images. High-resolution satellites such as TerraSAR-X provide images that can be combined to produce 3-D models.  ...  Estimator Conclusion In this paper we introduced a graph-cut based segmentation algorithm to estimate the urban surfaces from a SAR tomographic reconstruction.  ... 
doi:10.1016/j.cviu.2019.07.011 fatcat:hqw7pn6q65funmx4ndxp2m2bpm

3D object modeling with a voxelset carving approach

G. Dainese, M. Marcon, A. Sarti, S. Tubaro
2005 IEEE International Conference on Image Processing 2005  
Every surface patch is obtained as a depth map using an algorithm based on graph cuts theory.  ...  In the past few years several systems for object reconstruction based on the analysis of 2D images have been proposed.  ...  In order to perform this task we presented a reconstruction algorithm based on graph cuts theory.  ... 
doi:10.1109/icip.2005.1529935 dblp:conf/icip/DaineseMST05 fatcat:bakg2nnrbjahzokkkfeai4ks5e
« Previous Showing results 1 — 15 out of 25,865 results