Issue No. 01 - January (2006 vol. 28)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPAMI.2006.12
In this paper, we address the computation of globally minimal curves and surfaces for image segmentation and stereo reconstruction. We present a solution, simulating a continuous maximal flow by a novel system of partial differential equations. Existing methods are either grid-biased (graph-based methods) or suboptimal (active contours and surfaces). The solution simulates the flow of an ideal fluid with isotropic velocity constraints. Velocity constraints are defined by a metric derived from image data. An auxiliary potential function is introduced to create a system of partial differential equations. It is proven that the algorithm produces a globally maximal continuous flow at convergence, and that the globally minimal surface may be obtained trivially from the auxiliary potential. The bias of minimal surface methods toward small objects is also addressed. An efficient implementation is given for the flow simulation. The globally minimal surface algorithm is applied to segmentation in 2D and 3D as well as to stereo matching. Results in 2D agree with an existing minimal contour algorithm for planar images. Results in 3D segmentation and stereo matching demonstrate that the new algorithm is robust and free from grid bias.
Index Terms- Partial differential equations, graph-theoretic methods, edge and feature detection.
B. Appleton and H. Talbot, "Globally Minimal Surfaces by Continuous Maximal Flows," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 28, no. , pp. 106-118, 2006.