A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Globally minimal surfaces by continuous maximal flows
2006
IEEE Transactions on Pattern Analysis and Machine Intelligence
In this paper we consider the problem of computing globally minimal continuous curves and surfaces for image segmentation and 3D reconstruction. This is solved using a maximal flow approach expressed as a PDE model. Previously proposed techniques yield either grid-biased solutions (graphbased approaches) or sub-optimal solutions (active contours and surfaces). The proposed algorithm simulates the flow of an ideal fluid with a spatially varying velocity constraint derived from image data. A
doi:10.1109/tpami.2006.12
pmid:16402623
fatcat:6ankpqdbarewnfrthmh6vx3osu