Abstract

The main task of image segmentation is to partition an image into disjoint sets of pixels called clusters. Spectral clustering algorithm has been developed rapidly in recent years and it has been widely used in image segmentation. The traditional spectral clustering algorithm requires huge amount of computation to process colour images with high resolution. While one possible solution is reducing image resolution, but it will lead to the loss of image information and reduce segmentation performance. To overcome the problem of traditional spectral clustering, an image segmentation algorithm based on superpixel clustering is proposed. Firstly, the algorithm uses the superpixel preprocessing technique to quickly divide the image into a certain number of superpixel regions with specific information. Then, the similarity matrix is used to provide the input information to the spectral clustering algorithm to cluster the superpixel regions and get the final image segmentation results. The experiment results show that the proposed algorithm can effectively improve the performance in image segmentation compared with the traditional spectral clustering algorithm, and finally the substantial improvement has been obtained in respect of computational complexity, processing time and the overall segmentation effect.

Full Text
Paper version not known

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 call

Disclaimer: 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.