Abstract
A superpixels based interactive image segmentation algorithm is proposed in this paper. Firstly the initial segmentation is obtained by MeanShift algorithm, and then a graph is built using pre-segmented regions as nodes, finally min-cut/maxflow algorithm is implemented for global solution. In this process, each region is represented by a color histogram and Bhattacharyya coefficient is chosen to calculate the similarity between any two regions. Extensive experiments are performed and the results show that the presented algorithm obtains much more satisfactory segmentation results with less user interaction and less comsuming time than MSRM algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
