Comparative Assessment of the Image Divide and Link Algorithm in Different Color Spaces

Open access

Abstract

In this paper, a comparative assessment of the Image Divide and Link Algorithm (ID&L) in different color spaces is presented. This, in order to show the significance of choosing a specific color space when the algorithm computes the dissimilarity measure between adjacent pixels. Specifically, the algorithm procedure is based on treating a digital image as a graph, assigning a weight to each edge based on the dissimilarity measure between adjacent pixels. Then, the algorithm constructs a spanning forest through a Kruskal scheme to order the edges successively while partitions are obtained. This process is driven until all the pixels of the image are segmented, that is, there are as many regions as pixels. The results of the algorithm which have been compared with those generated using different color spaces are shown.

If the inline PDF is not rendering correctly, you can download the PDF file here.

  • [1] BASAVAPRASAD B.—RAVINDRA H.: A survey on traditional and graph theoretical techniques for image segmentation. In: IJCA Proceedings on National Conference on Recent Advances in Information Technology—NCRAIT ‘14 pp. 38–46.

  • [2] BOYKOV Y.—FUNKA-LEA G.: Graph cuts and efficient n-d image segmentation Int. J. Comput. Vis. 70 (2006) 109–131.

  • [3] CANNY J.: A computational approach to edge detection. In: IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-8 (1986) 679–698.

  • [4] CHENW.—SHI Y. Q.—XUAN G.: Identifying computer graphics using hsv color model and statistical moments of characteristic functions. In: IEEE International Conference on Multimedia and Expo—ICME ‘07 Beijin China 2007 IEEE pp. 1123–1126.

  • [5] CHENG H.-D.—SUN Y.: A hierarchical approach to color image segmentation using homogeneity IEEE Trans. Image Process. 9 (2000) 2071–2082.

  • [6] ESTRADA F. J.—JEPSON A. D.: Benchmarking image segmentation algorithms Int. J. Comput. Vis. 85 (2009) 167–181.

  • [7] GÓMEZ D.—ZARRAZOLA E.—YÁÑEZ J.—MONTERO J.: A divide-and-link algorithm for hierarchical clustering in networks Inform. Sci. 316 (2015) 308–328.

  • [8] GUADA C.—ZARRAZOLA E.—YÁÑEZ J.—RODRÍGUEZJ. T.—GÓMEZ D.– –MONTERO J.: A novel edge detection algorithm based on a hierarchical graph-partition approach J. Intell. Fuzzy Syst. 34 (2018) 1875–1892.

  • [9] KERMIT IMAGE TOOLKIT: Color formats for image and video processingwww.equasys.de/colorformat.html2017.

  • [10] KRUSKAL J.: On the shortest spanning subtree of a graph and the traveling salesman problem Proc. Amer. Math. Soc. 7 (1956) 48–50.

  • [11] LI S. Z.: Markov random field models in computer vision. In: 3rd European Conference on Computer Vision—ECCV ‘94 (J.-O. Eklundh ed.) Stockholm Sweden 1994 Lecture Notes in Comput. Sci. Vol. 801 Springer–Verlag Berlin 1994 pp. 361–370.

  • [12] MARTIN D.—FOWLKES C.—TAL D.—MALIK J.: A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics in: Proc. of the 8th Internat. Conf. in Computer Vision—ICCV ‘01 Vol. 2 (B. Werner ed.) Vancouver BC Canada 2001 IEEE pp. 416–423.

  • [13] MORTENSEN E.—BARRETT W.: Intelligent scissors for image composition In: Proceedings of the 22nd Annual Conference on Computer Graphics and Interactive Techniques—SIGGRAPH ‘95 (S. G. Mair et al. eds.) Los Angeles CA 1995 ACM New York NY USA 1995 pp. 191–198.

  • [14] RAMANATH R.—KUEHNI R. G.—SNYDER W. E.—HINKS D.: Spectral spaces and color spaces Color Res. Appl. 29 (2004) 29–37.

  • [15] RODRÍGUEZ J. T.—GUADA C.—GÓMEZ D.—YÁÑEZ J.—MONTERO J.: A methodology for hierarchical image segmentation evaluation In: Proc. of the 16th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems—IPMU ‘16 Eindhoven The Netherlands 2016 (J. P. Carvalho et al. eds.) Commun. Comput. Inf. Sci. Vol. 610 Springer-Verlag Berlin 2016 pp. 635–647.

  • [16] SHI J.—MALIK J.: Normalized cuts and image segmentation IEEE Trans. Pattern Anal. Mach. Intell. 22 (2000) 888–905.

  • [17] SOBEL I.: An isotropic 3x3 image gradient operator. In: Machine Vision for Three Dimensional Scenes (H. Freeman ed.) Acad. Press Inc. Orlando FL USA 1990 pp. 376–379.

  • [18] SONKA M.—HLAVAC V.—BOYLE R.: Image Processing Analysis and Machine Vision. Chapman and Hall Computing Gran Bretaña UK 1993.

  • [19] SURAL S.—QIAN G.—PRAMANIK S.: Segmentation and histogram generation using the hsv color space for image retrieval. In: IEEE Proceedings in International Conference on Image Processing 2:II–II Rochester NY USA 2002 IEEE pp. II–589.

  • [20] TETALI P.: Random walks and the effective resistance of networks J. Theoret. Probab. 4 (1991) 101–109.

  • [21] TKALCIC M.—TASIC J.: Colour spaces: Perceptual historical and applicational background In: Proc. of the IEEE Region Conference EUROCON ‘03. Computer as a Tool Ljubljana Slovenia 2003 pp. 304–308.

  • [22] TRÉMEAU A.—COLANTONI P.: Regions adjacency graph applied to color image segmentation IEEE Trans. Image Process. 9 (2000) 735–744.

Search
Journal information
Impact Factor


CiteScore 2018: 0.53

SCImago Journal Rank (SJR) 2018: 0.226
Source Normalized Impact per Paper (SNIP) 2018: 0.724

Mathematical Citation Quotient (MCQ) 2018: 0.17

Target audience:

researchers in the all fields of mathematical research

Metrics
All Time Past Year Past 30 Days
Abstract Views 0 0 0
Full Text Views 84 84 5
PDF Downloads 80 80 1