Hedgehog Shape Priors for Multi-Object Segmentation
Star-convexity prior is popular for interactive single object segmentation due to its simplicity and amenability to binary graph cut optimization. We propose a more general multi-object segmentation approach. Moreover, each object can be constrained by a more descriptive shape prior, "hedgehog". Each hedgehog shape has its surface normals locally constrained by an arbitrary given vector field, e.g. gradient of the user-scribble distance transform. In contrast to star-convexity, the tightness of our normal constraint can be changed giving better control over allowed shapes. For example, looser constraints, i.e. wider cones of allowed normals, give more relaxed hedgehog shapes. On the other hand, the tightest constraint enforces skeleton consistency with the scribbles. In general, hedgehog shapes are more descriptive than a star, which is only a special case corresponding to a radial vector field and weakest tightness. Our approach has significantly more applications than standard single star-convex segmentation, e.g. in medical data we can separate multiple non-star organs with similar appearances and weak edges. Optimization is done by our modified a-expansion moves shown to be submodular for multi-hedgehog shapes.
Code (0)
등록된 구현이 없습니다.
Tasks
DescriptiveObjectSegmentationSemantic SegmentationSimilar Papers 제목 키워드 기반
A-expansion for multiple "hedgehog" shapes
Overlapping colors and cluttered or weak edges are common segmentation problems requiring additional regularization. For example, star-convexity is popular for interactive single object segmentation due to simplicity and…
SegmentationSemantic SegmentationMCMC Shape Sampling for Image Segmentation with Nonparametric Shape Priors
Segmenting images of low quality or with missing data is a challenging problem. Integrating statistical prior information about the shapes to be segmented can improve the segmentation results significantly. Most shape-ba…
Image SegmentationSegmentationSemantic SegmentationThink out of the "Box": Generically-Constrained Asynchronous Composite Optimization and Hedging
We present two new algorithms, ASYNCADA and HEDGEHOG, for asynchronous sparse online and stochastic optimization. ASYNCADA is, to our knowledge, the first asynchronous stochastic optimization algorithm with finite-time d…
Stochastic OptimizationOptimal Multi-Object Segmentation with Novel Gradient Vector Flow Based Shape Priors
Shape priors have been widely utilized in medical image segmentation to improve segmentation accuracy and robustness. A major way to encode such a prior shape model is to use a mesh representation, which is prone to caus…
Image SegmentationMedical Image SegmentationSegmentationSemantic SegmentationIn the Shadows, Shape Priors Shine: Using Occlusion to Improve Multi-Region Segmentation
We present a new algorithm for multi-region segmentation of 2D images with objects that may partially occlude each other. Our algorithm is based on the observation hat human performance on this task is based both on prio…
Segmentation