A Surface Reconstruction Method Using Global Graph Cut Optimization

A Volumetric Reconstruction Method from Multiple Calibrated Views using Global Graph Cut Optimization

In this paper, a new formulation and solution to volumetric reconstruction from multiple calibrated images is presented. This problem has been previously formulated either as a continuous geometric optimization process driven by local numerical methods, or as a discrete labelling problem solved by global techniques for computing only stereo disparities. Our new formulation builds a bridge betwe...

A Non-Heuristic Reduction Method For Graph Cut Optimization

Graph cuts optimization permits to minimize some Markov Random Fields (MRF) by computing a minimum cut (min-cut) in a relevant graph. Graph-cuts are very efficient and are now a well established field of research. However, due to the large amount of memory required for storing the graph, there application remains limited to the minimization of MRF involving a relatively small number of variable...

Variational surface reconstruction based on Delaunay triangulation and graph cut

A novel method for surface reconstruction from an unorganized point set is presented. An energy functional based on a weighted minimal surface model is proposed for surface reconstruction, which is efficiently minimized by graph cut methods. By solving the minimization problem on the graph dual to a Delaunaybased tetrahedral mesh, the advantages of explicit and implicit methods for surface reco...

Noise Robust Surface Reconstruction by Combining PU and Graph-cut

Image Segmentation by Using Graph Cut Method

Image segmentation is used in Image Processing. Seed-based methods for region based image segmentation are known to provide the results for a few applications, being usually easy to extend to multidimensional images. The region growing procedure is finished by image foresting transformation which develops the initial seed region by finding the close by pixels identified with seed region. To exa...