Color Image Segmentation Using Voronoi Diagram and 2D Histogram
Segmentation divides an image into distinct regions where pixels in each region are characterised by characterised by the same feature. Even though the domain faces various challenges, this work tends to present an improved segmentation method for color image. The proposed algorithm is based on generalized Voronoi diagrams (VD), a renowned technique in computational geometry, which creates clusters of intensity values using information from the vertices of the external boundary of Delaunay Triangulations (DT). The outer boundary of Delaunay triangulation is the Convex Hull of the dotted clouds of the 2D histogram. Unlike the other works, Voronoi diagram is applied on 2D binary image histograms. Therefore, we overcome the fact that the classical 1D histogram ignores the spatial relationship information of the pixels that can give incorrect results. We have obtained promising results in addition to a fast time execution.
Disclaimer/Regarding indexing issue:
We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.