Improving image segmentation quality through effective region merging using a hierarchical social metaheuristic

Pattern Recognition Letters

Volumn 27, Issue 11, 2006, Pages 1239-1251

  Duarte, Abraham ^a   Sánchez, Ángel ^a   Fernández, Felipe ^b   Montemayor, Antonio S ^a  

^a UNIVERSIDAD REY JUAN CARLOS   (Spain)

^b UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

Author keywords

Evolutionary metaheuristics; Graph based segmentation; Hierarchical social algorithm; Image segmentation; Region merging; Watershed

Indexed keywords

GRAPH THEORY; HEURISTIC METHODS; HIERARCHICAL SYSTEMS; IMAGE ANALYSIS; IMAGE SEGMENTATION; METADATA;

EVOLUTIONARY METAHEURISTICS; GRAPH-BASED SEGMENTATION; HIERARCHICAL SOCIAL ALGORITHM; REGION MERGING; WATERSHED;

IMAGE QUALITY;

EID: 33646522180     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2005.07.022     Document Type: Article

References (35)

1. Barbu, A., Zhu, S.-C., 2003. Graph partitioning by Swendsen-Wang cuts. In: Ninth IEEE International Conference on Computer Vision, vol. 1, Nice, France, pp. 320-329.
2. Beucher, S., Lantuejoul, C., 1979. Use of watersheds in contour detection. In: Internat. Workshop on Image Processing, Real-Time Edge and Motion Detection/Estimation.
3. Ding, C., He, X., Zha, H., Gu, M., Simon, H., 2001. A min-max cut algorithm for graph partitioning and data clustering. In: Proc. of ICDM Conf.
4. Dorigo M., Maniezzo V., and Colorni A. Ant system: optimization by a colony of cooperating agents. IEEE Trans. Systems Man Cybernet. Part B 26 1 (1996) 29-41
5. Duarte, A., 2004. Algoritmos Sociales Jerárquicos: Una metaheurística basada en la hibridación entre métodos constructivos y evolutivos. PhD Thesis, Universidad Rey Juan Carlos, Madrid, Spain.
6. Duarte A., Fernández F., Sánchez A., and Sanz A. A hierarchical social metaheuristic for the max-cut problem. Lecture Notes in Compute Science vol. 3004 (2004), Springer, Berlin/Heidelberg 84-93
7. Duarte A., Fernández F., Sánchez A., Sanz A., and Pantrigo J.J. Top-Down Evolutionary Image Segmentation using a Hierarchical Social Metaheuristic. LNCS vol. 3005 (2004), Springer, Berlin/Heidelberg pp. 301-310
8. Duarte, A., Fernández, F., Sánchez, A., 2004c. Software Pipelining using a Hierarchical Social Metaheuristic. In: Proceedings of the 5th International Conference on Recent Advances in Soft Computing (RASC 2004), pp. 618-623.
9. Felzenszwalb P.F., and Huttenlocher D.P. Efficient graph-based image segmentation. Internat. J. Computer Vision 59 2 (2004) 167-181
10. Fernández, F., Duarte, A., Sánchez, A., 2003. A software pipelining method based on a hierarchical social algorithm. In: Proc. of the 1st MISTA'03 Conf. pp. 382-385.
11. In: Glover F., and Kochenberger G.A. (Eds). Handbook of Metaheuristics (2002), Kluwer, Dordrecht
12. Gonzalez R.C., and Woods R. Digital Image Processing. second ed. (2002), Prentice Hall, Englewood Cliffs, NJ
13. Gothandaraman, A., 2004. Hierarchical image segmentation using the watershed algorithm with a streaming implementation. PhD Thesis, University of Tennessee, USA.
14. Haris K., et al. Hybrid Image Segmentation Using Watersheds and Fast Region Merging. IEEE Trans. Image Process. 7 12 (1998) 1684-1699
15. Hernández, S.E., Barner, K.E., 2000. Joint region merging criteria for watershed-based image segmentation. In: Internat. Conf. Image Process., vol. 2. pp. 108-111.
16. Ho S.Y., and Lee K.Z. Design and analysis of an efficient evolutionary image segmentation algorithm. J. VLSI Signal Process. 35 (2003) 29-42
17. Karp R.M. Reducibility among combinatorial problems. In: Miller R., and Thatcher J. (Eds). Complexity of Computer Computations (1972), Plenum Press, New York 85-103
18. Kennedy J., Eberhart R.C., and Shi Y. Swarm Intelligence (2003), Morgan Kaufmann Publishers, Los Altos, CA
19. Kolmogorov, V., Zabih, R., 2002. What energy functions can be minimized via graph cuts? In: Proc. of ECCV, vol. 3, Copenhagen, Denmark. pp. 65-81.
20. Makrogiannis, S., Economou, G., Fotopoulos, S., 2001. A graph theory approach for automatic segmentation of colour images. In: Proc. Int. Workshop on Very Low Bitrate Video Coding (VLBV 2001), 11-12 October 2001, Athens, Greece. pp. 162-166.
21. Michalewicz Z., and Fogel D.B. How to Solve It: Modern Heuristics. second ed. (2000), Springer, Berlin
22. Parker J.R. Algorithms for Image Processing and Computer Vision (1996), John Wiley, New York
23. Poli R. Genetic programming for image analysis. In: Koza J. (Ed). Genetic Progr. (1996), The MIT Press, Cambridge, MA, USA
24. Reynolds R.G. Cultural algorithms: theory and applications. New Ideas in Optimization (1999), McGraw-Hill, New York 367-377 (Chapter 24)
25. Roy, S., Cox, I., 1998. A maximum-flow formulation of the n-camera stereo correspondence problem. In: Proc. of ICCV Conf.
26. Sarkar A., Biswas M.K., and Sharma K.M.S. A simple unsupervised MRF model based image segmentation approach. IEEE Trans. Image Process. 9 5 (2000) 801-811
27. Shi J., and Malik J. Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Machine Intel. 22 8 (2000) 888-905
28. Sonka M., et al. Image processing, analysis and machine vision. second ed. (1999), PWS
29. Urquhart R. Graph theoretical clustering based on limited neighborhood sets. Pattern Recognition 15 3 (1982) 173-187
30. Veskler, O., 2000. Image segmentation by nested cuts. In: Proc. of IEEE CVPR Conf., June 2000. pp. 339-344.
31. Vincent L., and Soille P. Watersheds in digital spaces: An efficient algorithm based on immersion simulations. IEEE PAMI 13 6 (1991) 583-598
32. Voss S. Meta-heuristics: the state of the art. In: Nareyek A. (Ed). LNAI vol. 2148 (2001), Springer, Berlin 1-23
33. Wu Z., et al. Optimal graph theoretic approach to data clustering: Theory and its application to image segmentation. IEEE Trans. PAMI 15 11 (1993) 1101-1113
34. Yoshimura M., and Oe S. Evolutionary segmentation of texture image using genetic algorithms. Pattern Recognition 32 (1999) 2041-2054
35. Zahn C.T. Graph-theoretic methods for detecting and describing gestalt clusters. IEEE Trans. Comput. 20 (1971) 68-86