A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is
Convex relaxation techniques have become a popular approach to image segmentation as they allow to compute solutions independent of initialization to a variety of image segmentation problems. In this paper, we will show that shape priors in terms of moment constraints can be imposed within the convex optimization framework, since they give rise to convex constraints. In particular, the lowerorder moments correspond to the overall volume, the centroid, and the variance or covariance of the shapedoi:10.1109/iccv.2011.6126502 dblp:conf/iccv/KlodtC11 fatcat:5s5baj57ovchzjmxkmupqj34za