Statistical significance based graph cut regularization for medical image segmentation

Graph cut minimization formulates the image segmentation as a linear combination of problem constraints. The salient constraints of the computer vision problems are data and smoothness which are combined through a regularization parameter. The main task of the regularization parameter is to determine the weight of the smoothness constraint on the graph energy. However, the difference in functional forms of the constraints forces the regularization weight to balance the inharmonious relationship between the constraints. This paper proposes a new idea: bringing the data and smoothness terms on the common base decreases the difference between the constraint functions. Therefore the regularization weight regularizes the relationship between the constraints more effectively. Bringing the constraints on the common base is carried through the statistical significance measurement. We measure the statistical significance of each term by evaluating the terms according to the other graph terms. Evaluating each term on its own distribution and expressing the cost by the same measurement unit decrease the scale and distribution differences between the constraints and bring the constraint terms on similar base. Therefore, the tradeoff between the terms would be properly regularized. Naturally, the minimization algorithm produces better segmentation results. We demonstrated the effectiveness of the proposed approach on medical images. Experimental results revealed that the proposed idea regularizes the energy terms more effectively and improves the segmentation results significantly.

Anahtar Kelimeler:

Medical image segmentation; statistical significance; graph cut minimization; markov random fields; regularization

Statistical significance based graph cut regularization for medical image segmentation

Keywords:

Medical image segmentation; statistical significance; graph cut minimization; markov random fields; regularization,

PDF

___

[1] L. Lorigo, O. Faugeras, E. Grimson, R. Keriven, R. Kikinis, C. Westin, ”Co-dimension 2 geodesic active contours for MRA segmentation”, Inf. Process Med Imaging, vol.16, pp.126-139, 1999.
[2] S. Osher, N. Paragios, ”Geometric level set methods in imaging, vision, and graphics”, Springer, 2003.
[3] A. Tsai, A. Yezzi, W. Wells, C. Tempany, D. Tucker, A. Fan, E. Grimson, A. Willsky, ”A shape based approach to curve evolution for segmentation of medical imagery”, IEEE Trans. Med. Imaging, vol.22, pp.137-154, 2003.
[4] Y. Boykov, M.P. Jolly, ”Interactive organ segmentation using graph cuts”, Lecture Notes In Computer Science, Proc. of the Third International Conference on MICCAI, pp. 276-286, 2000.
[5] Y. Boykov, M.P. Jolly, ”Interactive graph cuts for optimal boundary and region segmentation of objects in N-D images”, IEEE Conf. on Computer Vision, vol.1, pp.105-112, 2001.
[6] Y. Boykov, G. Funka-Lea, ”Graph cuts and efficient N-D image segmentation”, Int. J. Computer Vision, vol.70, pp.109-131, 2006.
[7] D. Freedman, T. Zhang, ”Interactive graph cut based segmentation with shape priors”, IEEE Conf. on Computer Vision and Pattern Recognition, vol.1, pp.755-762, 2005.
[8] J. Zhanga, Y. Wangb, X. Shia, ”An improved graph cut segmentation method for cervical lymph nodes on sonograms and its relationship with nodes shape assessment”, Computerized Medical Imaging and Graphics, vol.33, pp.602-607, 2009.
[9] J. Hadamard, ”Sur les problmes aux drives partielles et leur signification physique”, Princeton University Bulletin, 1902.
[10] D. Marr, T. Poggio, ”Cooperative computation of stereo disparity”, Science, pp.209-236, 1976.
[11] M. Bertero, T.A. Poggio, V. Torre, ”Ill-posed problems in early vision”, Proceedings of the IEEE, vol.76, pp.869-889, 1988.
[12] J. Marroquin, S. Mitter, T.A. Poggio, ”Probabilistic solution of ill-posed problems in computational vision”, J. Amer. Stat. Assoc., vol.82, pp.76-89, 1987.
[13] J. Besag, ”On the statistical analysis of dirty pictures”, J. of the Royal Statistical Society B., vol.48, pp.259-302, 1986.
[14] N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, E. Teller, ”Equations of state calculations by fast computing machines”, J. of Chemical Physics, vol.21, pp.1087-1091, 1953.
[15] S. Geman, D. Geman, ”Stochastic relaxation, Gibbs distribution, and the Bayesian restoration of images”, IEEE Trans. Pattern. Anal. Mach. Intell., vol.6, pp.721-741, 1984.
[16] S. Kirkpatrick, C.D.J. Gelatt, M.P. Vecchi, ”Optimization by simulated annealing”, Science, vol.220, pp.671-680, 1983.
[17] P. Carnevali, L. Coletti, S. Patarnello, ”Image processing by simulated annealing”, IBM Journal of Research and Development, vol.29, pp.569-579, 1985.
[18] D. M. Greig, B. T. Porteous, A.H. Seheult, ”Exact Maximum A Posteriori Estimation for Binary Images”, J. Royal Statistical Soc., Series B., vol.51, pp.271-279, 1989.
[19] J.M. Hammersley, P. Clifford, ”Markov field on finite graphs and lattices”, unpublished, 1971.
[20] D. Scharstein, R. Szeliski, ”A taxonomy and evaluation of dense two-frame stereo correspondence algorithms”, IEEE conf. on Computer Vision, vol.47, pp.7-42, 2002.
[21] A.N. Tikhonov, V.A. Arsenin, ”Solutions of ill-posed problems”, Washington, DC: Winston, 1977.
[22] K. Krajsek, R. Mester, ”Maximum Likelihood Estimator for Choosing the Regularization Parameters in Global Optical Flow Methods”, IEEE Conf. on Image Processing, pp.1081-1084, 2006.
[23] L. Zhang, S.M. Seitz, ”Estimating optimal parameters for MRF stereo from a single image pair”, IEEE Trans. Pattern. Anal. Mach. Intell., vol.29, pp.331-342, 2007.
[24] B. Peng, O. Veksler, ”Parameter selection for graph cut based image segmentation”, Proc. of the British Machine Vision Conference, 2008.
[25] Y. Boykov, O. Veksler, R. Zabih, ”Fast approximate energy minimization via graph cuts”, IEEE Trans. Pattern. Anal. Mach. Intell., vol.23, pp.1222-1239, 2001.
[26] Y. Boykov, V. Kolmogorov, ”Computing geodesics and minimal surfaces via graph cuts”, IEEE conf. on Computer Vision, vol.1, pp.26-33, 2003.
[27] C. Rother, V. Kolmogorov, A. Blake, ”GrabCut -interactive foreground extraction using iterated graph cuts”, SIGGRAPH, August, 2004.
[28] J.E. Freund, ”Mathematical statistics”, Prentice Hall. 2007.
[29] R.A. Fisher, ”The design of experiments”, New York: Hafner. 1935.
[30] S. Candemir, Y.S. Akgul, ”A nonparametric statistical approach for stereo correspondence”, IEEE conf. on Computer and Information Sciences, pp.1-6, 2007.
[31] http://www.via.cornell.edu/databases/lungdb.html [32] T.F.Chan, L.A.Vese, ”Active Contours Without Edges”, IEEE Trans. on Image Processing, vol.10, No.2., pp.266- 277, 2001.
[33] C.Lee, C.Xu, C.Gui, M.D.Fox, ”Level Set Evaluation Without RE-initialization: A New Variational Formulation”, IEEE Conf. on Computer Vision and Pattern Recognition, vol. 1, pp. 430-436, 2005.