کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
530858 | 869796 | 2011 | 15 صفحه PDF | دانلود رایگان |
In the paper an iteratively unsupervised image segmentation algorithm is developed, which is based on our proposed multiphase multiple piecewise constant (MMPC) model and its graph cuts optimization. The MMPC model use multiple constants to model each phase instead of one single constant used in Chan and Vese (CV) model and cartoon limit so that heterogeneous image object segmentation can be effectively dealt with. We show that the multiphase optimization problem based on our proposed model can be approximately solved by graph cuts methods. Four-Color theorem is used to relabel the regions of image after every iteration, which makes it possible to represent and segment an arbitrary number of regions in image with only four phases. Therefore, the computational cost and memory usage are greatly reduced. The comparison with some typical unsupervised image segmentation methods using a large number of images from the Berkeley Segmentation Dataset demonstrates the proposed algorithm can effectively segment natural images with a good performance and acceptable computational time.
► Multiphase multiple piecewise constant (MMPC) model is proposed.
► Proposed model can be discretely optimized by graph cuts.
► Four-Color theorem is used to relabel region.
► Iteratively solving the four-phase optimization and relabeling the regions.
► An arbitrary number of regions in image can be segmented with only four phases.
Journal: Pattern Recognition - Volume 44, Issue 12, December 2011, Pages 2819–2833