Abstract
In this paper, authors have proposed K-region-based clustering algorithm which is based on performing the clustering techniques in K number of regions of given image of size N × N. The K and N are power of 2 and K < N. The authors have divided the given image into 4 regions, 16 regions, 64 regions, 256 regions, 1024 regions, 4096 regions and 16384 regions based on the value of K. Authors have grouped the adjacent pixels of similar intensity value into same cluster in each region. The clusters of similar values in each adjacent region are grouped together to form the bigger clusters. The authors have obtained the different segmented images based on the K number of regions. These segmented images are useful for image understanding. The authors have been taken four parameters: Probabilistic rand index, variation of information, global consistency error and boundary displacement error. These parameters have used to evaluate and analyze the performance of the K-region-based clustering 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 callMore From: Journal of The Institution of Engineers (India): Series B
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.
