Convex Shape Prior for Multi-Object Segmentation Using a Single Level Set Function
Many objects in real world have convex shapes. It is a difficult task to have representations for convex shapes with good and fast numerical solutions. This paper proposes a method to incorporate convex shape prior for multi-object segmentation using level set method. The relationship between the convexity of the segmented objects and the signed distance function corresponding to their union is analyzed theoretically. This result is combined with Gaussian mixture method for the multiple objects segmentation with convexity shape prior. Alternating direction method of multiplier (ADMM) is adopted to solve the proposed model. Special boundary conditions are also imposed to obtain efficient algorithms for 4th order partial differential equations in one step of ADMM algorithm. In addition, our method only needs one level set function regardless of the number of objects. So the increase in the number of objects does not result in the increase of model and algorithm complexity. Various numerical experiments are illustrated to show the performance and advantages of the proposed method.
Code (0)
등록된 구현이 없습니다.
Tasks
SegmentationSemantic SegmentationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Convex Shape Prior for Deep Neural Convolution Network based Eye Fundus Images Segmentation
Convex Shapes (CS) are common priors for optic disc and cup segmentation in eye fundus images. It is important to design proper techniques to represent convex shapes. So far, it is still a problem to guarantee that the o…
Image SegmentationSegmentationSemantic SegmentationHedgehog 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, e…
DescriptiveObjectSegmentationSemantic SegmentationA-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 SegmentationHadBalance: A Plug-and-Play Unified Global Geometric Prior Framework for Generalizable Biomedical Segmentation
Precise biomedical image segmentation is crucial for clinical diagnosis. Geometric cues (e.g., boundary, shape, and topology) can improve structural consistency, yet most are task-specific and lack a unified geometric fo…
Image SegmentationK-convexity shape priors for segmentation
This work extends popular star-convexity and other more general forms of convexity priors. We represent an object as a union of "convex'' overlappable subsets. Since an arbitrary shape can always be divided into convex p…
DescriptiveObjectSegmentation