.png){kind=icon}
.png){kind=icon}
Return
Segmentation with area constraints
.png){kind=icon}
OA
AI
DOI：10.1016/j.media.2012.09.002.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Image segmentation approaches typically incorporate weak regularity conditions such as boundary length or curvature terms, or use shape information. High-level information such as a desired area or volume, or a particular topology are only implicitly specified. In this paper we develop a segmentation method with explicit bounds on the segmented area. Area constraints allow for the soft selection of meaningful solutions, and can counteract the shrinking bias of length-based regularization. We analyze the intrinsic problems of convex relaxations proposed in the literature for segmentation with size constraints. Hence, we formulate the area-constrained segmentation task as a mixed integer program, propose a branch and bound method for exact minimization, and use convex relaxations to obtain the required lower energy bounds on candidate solutions. We also provide a numerical scheme to solve the convex subproblems. We demonstrate the method for segmentations of vesicles from electron tomography images. (C) 2012 Elsevier B.V. All rights reserved.
Keywords:
Segmentation
Area-constraint
Branch and bound
Alternating direction method of multipliers
Journal
IF:
11.8
Papers:
3.8K
Citations:
2.4W