Browse > Article

Graph Cut-based Automatic Color Image Segmentation using Mean Shift Analysis  

Park, An-Jin (숭실대학교 미디어학과)
Kim, Jung-Whan (숭실대학교 미디어학과)
Jung, Kee-Chul (숭실대학교 미디어학부)
Abstract
A graph cuts method has recently attracted a lot of attentions for image segmentation, as it can globally minimize energy functions composed of data term that reflects how each pixel fits into prior information for each class and smoothness term that penalizes discontinuities between neighboring pixels. In previous approaches to graph cuts-based automatic image segmentation, GMM(Gaussian mixture models) is generally used, and means and covariance matrixes calculated by EM algorithm were used as prior information for each cluster. However, it is practicable only for clusters with a hyper-spherical or hyper-ellipsoidal shape, as the cluster was represented based on the covariance matrix centered on the mean. For arbitrary-shaped clusters, this paper proposes graph cuts-based image segmentation using mean shift analysis. As a prior information to estimate the data term, we use the set of mean trajectories toward each mode from initial means randomly selected in $L^*u^*{\upsilon}^*$ color space. Since the mean shift procedure requires many computational times, we transform features in continuous feature space into 3D discrete grid, and use 3D kernel based on the first moment in the grid, which are needed to move the means to modes. In the experiments, we investigate the problems of mean shift-based and normalized cuts-based image segmentation methods that are recently popular methods, and the proposed method showed better performance than previous two methods and graph cuts-based automatic image segmentation using GMM on Berkeley segmentation dataset.
Keywords
Graph Cuts; Mean Shift Analysis; Image Segmentation;
Citations & Related Records
연도 인용수 순위
  • Reference
1 K. Fukunaga and L.D. Hostetler, 'The Estimation of the Gradient of a Density Function, with Applications in Pattern Recognition,' IEEE Transactions on Information Theory, vol.21, pp.32-40, 1975   DOI
2 Y. Boykov and V. Kolmogorov, 'An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision,' IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.26, no.9, pp.1124-1137, 2004   DOI   ScienceOn
3 D. H. Greig, B. T. Porteous, and A. H. Seheult, 'Exact Maximum A Posterior Estimation for Binary Images,' Journal of Royal Statistical Society, Series B (Methodological), vol.51, no.2, pp.271-278, 1989
4 E. A. Dinic. Algorithm for solution of a problem of maximum flow in networks with power estimation. Soviet math. Dokl., 11:1277-1280, 1970
5 L. Ford and D. Fulkerson, 'Flows in Networks,' Princeton University Press, 1962
6 Andrew V. Goldberg and Robert E. Tarjan. A New approach to the maximum-flow problem. Journal of the Association for Computing Machinery, 35(4):921-940, October 1988   DOI   ScienceOn
7 D. Martin, C. Fowlkes, and J. Malik, 'Learning to Detect Natural Image Boundaries using Local Brightness, Color, and Texture Cues,' IEEE ransactions on Pattern Analysis and Machine Intelligence, vol.26, no.5, pp.530-549, 2004   DOI   ScienceOn
8 L. Vincent and P. Soille, 'Watersheds in Digital Spaces: An Efficient Algorithm based on Immersion Simulation,' IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.13, no.6, pp.583-597, 1991   DOI   ScienceOn
9 D. Comaniciu, 'Nonparametric Robust Methods for Computer Vision,' Ph.D. Thesis, ECE Department, Rutgers University, 2000
10 D. Comaniciu and P. Meer, 'Mean Shift: A Robust Approach toward Feature Space Analysis,' IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.23, no.5, pp.603-619, 2002   DOI   ScienceOn
11 S. Makrogiannis, G. Economou, and S. Fotopoulos, 'A Region Dissimilarity Relation that Combines Feature-Space and Spatial Information for Color Image Segmentation,' IEEE Transactions on System, Man, and Cybernetics, Part B, vol.35, no.1, pp.44-53, 2005   DOI   ScienceOn
12 A. P. Eriksson, C. Olsson, and F. Kahl, 'Image Segmentation with Context,' Proceedings of Scandinavian Conference on Image Analysis, Lecture Notes on Computer Science, vol.4522, pp. 283-292, 2007   DOI
13 N. Pal and S. Pal, 'A review on image segmentation techniques,' Pattern Recognition, vol.26, no.9, pp.1277-1294, 1993   DOI   ScienceOn
14 W. Tao, H. Jin, Y. Zhang, 'Color Image Segmentation based on Mean Shift and Normalized Cuts,' IEEE Transactions on Systems, Man, and Cybernetics, Part B, vol.37, no.5, pp.1382-1390, 2007   DOI   ScienceOn
15 L.G. Shapiro and G.C. Stockman, 'Computer Vision,' New Jersey, Prentice-Hall, 2001
16 Y. Li, J. Sun, C-K. Tang, and H-Y. Shum, 'Lazy Snapping,' ACM Transactions on Graphics, vol.23, Issue 3, pp.303-308, 2004   DOI   ScienceOn
17 Y. Boykov, O. Veksler, and R. Zabih, 'Fast Approximate Energy Minimization via Graph Cuts,' IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.23, no.11, pp.1222-1239, 2001   DOI   ScienceOn
18 G. Wyszecki and W. S. Stiles, Color Science : Concepts and Methods, Quantitative Data and Formulae, 2nd ed. New York : Wiley, 2000
19 J-S. Kim and K-S. Hong, 'A New Graph Cut-based Multiple Active Contour Algorithm without Initial Contours and Seed Points,' Machine Vision and Applications, vol.19, no.3, pp. 181-193, 2008   DOI   ScienceOn
20 J. Shi and J. Malik, 'Normalized Cuts and Image Segmentation,' IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.22, no.8, pp. 888-905, 2000   DOI   ScienceOn
21 Y. Boykov and G. Funka-Lea, 'Graph Cuts and Efficient N-D Image Segmentation,' International Journal of Computer Vision, vol.70, no.2, pp.109-131, 2006   DOI   ScienceOn
22 Y. Cheng, 'Mean Shift, Mode Seeking, and Clustering,' IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.17, no.8, pp.790-799, 1995   DOI   ScienceOn
23 R. Szeliski, R. Zabih and C. Rother, 'A Comparative Study of Energy Minimization Methods for Markov Random Fields,' IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.30, no.6, pp.1068-1080, 2008   DOI   ScienceOn
24 D. Martin, C. Fowlkers, D. Tal, and J. Malik, 'A Database of Human Segmented Natural Images and Its Application to Evaluating Segmentation Algorithms and Measuring Ecological Statics,' Proceedings of IEEE International Conference on Computer Vision, pp.416-423, 2001   DOI
25 C. Rother, V. Kolmogorov, and A. Blake, 'Grab-Cut: Interactive Foreground Extraction using Iterated Graph Cuts,' ACM Transactions on Graphics, vol.23, Issue 3, pp.309-314, 2004   DOI   ScienceOn