Efficient algorithms for image and high dimensional data processing using eikonal equation on graphs
ISVC'10 Proceedings of the 6th international conference on Advances in visual computing - Volume Part II
The least spanning area of a knot and the optimal bounding chain problem
Proceedings of the twenty-seventh annual symposium on Computational geometry
Generalized hard constraints for graph segmentation
SCIA'11 Proceedings of the 17th Scandinavian conference on Image analysis
Curvature regularization for curves and surfaces in a global optimization framework
EMMCVPR'11 Proceedings of the 8th international conference on Energy minimization methods in computer vision and pattern recognition
On a linear programming approach to the discrete willmore boundary value problem and generalizations
Proceedings of the 7th international conference on Curves and Surfaces
International Journal of Computer Vision
A survey of graph theoretical approaches to image segmentation
Pattern Recognition
| Hi-index | 0.14 |
Shortest paths have been used to segment object boundaries with both continuous and discrete image models. Although these techniques are well defined in 2D, the character of the path as an object boundary is not preserved in 3D. An object boundary in three dimensions is a 2D surface. However, many different extensions of the shortest path techniques to 3D have been previously proposed in which the 3D object is segmented via a collection of shortest paths rather than a minimal surface, leading to a solution which bears an uncertain relationship to the true minimal surface. Specifically, there is no guarantee that a minimal path between points on two closed contours will lie on the minimal surface joining these contours. We observe that an elegant solution to the computation of a minimal surface on a cellular complex (e.g., a 3D lattice) was given by Sullivan [47]. Sullivan showed that the discrete minimal surface connecting one or more closed contours may be found efficiently by solving a Minimum-cost Circulation Network Flow (MCNF) problem. In this work, we detail why a minimal surface properly extends a shortest path (in the context of a boundary) to three dimensions, present Sullivan's solution to this minimal surface problem via an MCNF calculation, and demonstrate the use of these minimal surfaces on the segmentation of image data.