Abstract
This paper proposes a new evolutionary region merging method to improve segmentation quality result on oversegmented images. The initial segmented image is described by a modified Region Adjacency Graph model. In a second phase, this graph is successively partitioned in a hierarchical fashion into two subgraphs, corresponding to the two most significant components of the actual image, until a termination condition is met. This graph-partitioning task is solved as a variant of the min-cut problem (normalized cut) using a Hierarchical Social (HS) metaheuristic. We applied the proposed approach on different standard test images, with high-quality visual and objective segmentation results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gonzalez, R.C., Woods, R.: Digital Image Processing, 2nd edn. Prentice-Hall, Englewood Cliffs (2002)
Haris, K., et al.: Hybrid Image Segmentation Using Watersheds and Fast Region Merging. IEEE Trans. on Image Processing 7(12), 1684–1699 (1998)
Hernández, S.E., Barner, K.E.: Joint Region Merging Criteria for Watershed-Based Image Segmentation. In: International Conference on Image Processing, vol. 2, pp. 108–111 (2000)
Duarte, A.: Algoritmos Sociales Jerárquicos: Una metaheurística basada en la hibridación entre métodos constructivos y evolutivos, PhD Thesis, Universidad Rey Juan Carlos, Spain (2004)
Poli, R.: Genetic programming for image analysis. In: Koza, J. (ed.) Genetic Progr. (1996)
Ho, S.Y., Lee, K.Z.: Design and Analysis of an Efficient Evolutionary Image Segmentation Algorithm. J. VLSI Signal Processing 35, 29–42 (2003)
Yoshimura, M., Oe, S.: Evolutionary Segmentation of Texture Image using Genetic Algorithms. Pattern Recognition 32, 2041–2054 (1999)
Shi, J., Malik, J.: Normalized Cuts and Image Segmentation. IEEE Trans. Pattern Analysis and Machine Intelligence 22(8), 888–905 (2000)
Sonka, M., et al.: Image Processing, Analysis and Machine Vision, 2nd edn. PWS (1999)
Felzenszwalb, P.F., Huttenlocher, D.P.: Efficient Graph-Based Image Segmentation. International Journal of Computer Vision 59(2), 167–181 (2004)
Gothandaraman, A.: Hierarchical Image Segmentation using the Watershed Algorithm with a Streaming Implementation. PhD Thesis, University fo Tennessee, USA (2004)
Veskler, O.: Image Segmentation by Nested Cuts. In: Proc. of IEEE CVPR Conf., June 2000, pp. 339–344 (2000)
Wu, Z., et al.: Optimal Graph Theoretic Approach to Data Clustering: Theory and its Ap-plication to Image Segmentation. IEEE Trans. PAMI 15(11), 1101–1113 (1993)
Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts? In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002. LNCS, vol. 2352, pp. 65–81. Springer, Heidelberg (2002)
Roy, S., Cox, I.: A maximum-flow formulation of the n-camera stereo correspondence problem. In: Proc. ICCV Conference (1998)
Barbu, A., Zhu, S.: Graph Partitioning by Swendsen-Wang Cuts. J. of Pattern Recognition and Machine Intelligence (2005) (to appear)
Karp, R.M.: Reducibility among Combinatorial Problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)
Ding, C., He, X., Zha, H., Gu, M., Simon, H.: A Min-Max Cut Algorithm for Graph Partitioning and Data Clustering. In: Proc. of ICDM Conference (2001)
Duarte, A., Fernández, F., Sánchez, A., Sanz, A.: A Hierarchical Social Metaheuristic for the Max-Cut Problem. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2004. LNCS, vol. 3004, pp. 84–93. Springer, Heidelberg (2004)
Duarte, A., Fernández, F., Sánchez, A., Sanz, A., Pantrigo, J.J.: Top-Down Evolutionary Image Segmentation using a Hierarchical Social Metaheuristic. In: Raidl, G.R., Cagnoni, S., Branke, J., Corne, D.W., Drechsler, R., Jin, Y., Johnson, C.G., Machado, P., Marchiori, E., Rothlauf, F., Smith, G.D., Squillero, G. (eds.) EvoWorkshops 2004. LNCS, vol. 3005, pp. 301–310. Springer, Heidelberg (2004)
Duarte, A., Fernández, F., Sánchez, A.: Software Pipelining using Hierarchical Social Metaheuristic. In: Proc. of RASC 2004 (2004)
Fernández, F., Duarte, A., Sánchez, A.: A Software Pipelining Method based on a Hierarchical Social Algorithm. In: Proc. 1st MISTA 2003 Conference, pp. 382–385 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Duarte, A., Sśnchez, Á., Fernández, F., Sanz, A. (2005). Region Merging for Severe Oversegmented Images Using a Hierarchical Social Metaheuristic. In: Rothlauf, F., et al. Applications of Evolutionary Computing. EvoWorkshops 2005. Lecture Notes in Computer Science, vol 3449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32003-6_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-32003-6_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25396-9
Online ISBN: 978-3-540-32003-6
eBook Packages: Computer ScienceComputer Science (R0)