The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - June (2013 vol.35)
pp: 1298-1311
Hao Wu , Georgia Institute of Technology, Atlanta
Vikram Appia , Georgia Institute of Technology, Atlanta
Anthony Yezzi , Georgia Institute of Technology, Atlanta
ABSTRACT
In this paper, we propose an active contour model based on nonparametric independent and identically distributed (i.i.d.) statistics of the image that can segment an image without any a priori information about the intensity distributions of the region of interest or the background. This is not, however, the first active contour model proposed to solve the segmentation problem under these same assumptions. In contrast to prior active contour models based on nonparametric i.i.d. statistics, we do not formulate our optimization criterion according to any distance measure between estimated probability densities inside and outside the active contour. Instead, treating the segmentation problem as a pixel-wise classification problem, we formulate an active contour to minimize the unbiased pixel-wise average misclassification probability (AMP). This not only simplifies the problem by avoiding the need to arbitrarily select among many sensible distance measures to measure the difference between the probability densities estimated inside and outside the active contour, but it also solves a numerical conditioning problem that arises with such prior active contour models. As a result, the AMP model exhibits faster convergence with higher accuracy and robustness when compared to active contour models previously formulated to solve the same nonparametric i.i.d. statistical segmentation problem via probability distances. To discuss this improved numerical behavior more precisely, we introduce the notion of “conditioning ratio” and demonstrate that the proposed AMP active contour is numerically better conditioned (i.e., exhibits a much smaller conditioning ratio) than prior probability distance-based active contours.
INDEX TERMS
Active contours, Numerical models, Image segmentation, Adaptation models, Probability, Mathematical model, Optimization, localizing scale, Active contour, nonparametric region-based model, bounded gradient flow, conditioning ratio, clutter, adaptive global--to-local strategy
CITATION
Hao Wu, Vikram Appia, Anthony Yezzi, "Numerical Conditioning Problems and Solutions for Nonparametric i.i.d. Statistical Active Contours", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.35, no. 6, pp. 1298-1311, June 2013, doi:10.1109/TPAMI.2012.207
REFERENCES
[1] T.F. Chan, S. Esedoglu, and M. Nikolova, "Finding the Global Minimum for Binary Image Restoration," Proc. Int'l Conf. Image Processing, pp. 121-124, 2005.
[2] J. Lellmann, F. Becher, and C. schnorr, "Convex Optimization for Multi-Class Image Labeling with a Novel Family of Total Variation Based Regularizers," Proc. 12th IEEE Int'l Conf. Computer Vision, pp. 646-653, 2009.
[3] T. Pock, A. Chambolle, D. Cremers, and H. Bischof, "A Convex Relaxation Approach for Computing Minimal Partitions," Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 810-817, 2009.
[4] T. Brox and D. Cremers, "On Local Region Models and a Statistical Interpretation of the Piecewise Smooth Mumford-Shah Functional," Int'l J. Computer Vision, vol. 84, no. 2, pp. 184-193, 2009.
[5] M. Kass, A. Witkin, and D. Terzopoulos, "Snakes: Active Contour Models," Int'l J. Computer Vision, vol. 1, no. 4, pp. 321-332, 1988.
[6] V. Caselles, R. Kimmel, and G. Sapiro, "Geodesic Active Contours," Proc. Fifth IEEE Int'l Conf. Computer Vision, pp. 694-699, 1995.
[7] S. Kichenessamy, A. Kumar, P. Olver, A. Tannenbaum, and A. Yezzi, "Gradient Flows and Geometric Active Contour Models," Proc. Fifth IEEE Int'l Conf. Computer Vision, pp. 810-815, 1995.
[8] M. Brejl and M. Sonka, "Object Localization and Border Detection Criteria Design in Edge-Based Image Segmentation: Automated Learning From Examples," IEEE Trans. Medical Imaging, vol. 19, no. 10, pp. 973-985, Oct. 2000.
[9] D. Mumford and J. Shah, "Optimal Approximations by Piecewise Smooth Functions and Associated Variational Problems," Comm. Pure and Applied Math., vol. 42, pp. 577-684, 1989.
[10] T. Chan and L. Vese, "Active Contours without Edges," IEEE Trans. Image Processing, vol. 10, no. 2, pp. 266-277, Feb. 2001.
[11] S. Zhu and A. Yuille, "Region Competition: Unifying Snakes, Region Growing, and Bayes/MDL for Multiband Image Segmentation," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 9, pp. 884-900, Sept. 1996.
[12] A. Yezzi, A. Tsai, and A. Willsky, "A Fully Global Approach to Image Segmentation via Coupled Curve Evolution Equations," J. Visual Comm. and Image Representation, vol. 13, pp. 195-216, 2002.
[13] G. Unal, A. YezziJr., and H. Krim, "Information-Theoretic Active Polygons for Unsupervised Texture Segmentation," Int'l J. Computer Vision, vol. 62, no. 3, pp. 199-220, 2002.
[14] R. Ronfard, "Region-Based Strategies for Active Contour Models," Int'l J. Computer Vision, vol. 13, no. 2, pp. 229-251, 1994.
[15] E. Gokcay and J.C. Principe, "Information Theoretic Clustering," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 2, pp. 158-171, Feb. 2002.
[16] J. Kim, J. Fisher, A. Yezzi, M. Cetin, and A. Willsky, "A Nonparametric Statistical Method for Image Segmentation Using Information Theory and Curve Evolution," IEEE Trans. Image Processing, vol. 14, no. 10, pp. 1486-1502, Oct. 2005.
[17] Michaelovich, Y. Rathi, and A. Tannenbaum, "Image Segmentation Using Active Contours Driven by the Bhattacharyya Gradient Flow," IEEE Trans. Image Processing, vol. 16, no. 11, pp. 2787-2801, Nov. 2007.
[18] S. Geman and D. Geman, "Stochastic Relaxation, Gibbs Distributions and the Bayesian Restoration of Images," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, no. 11, pp. 721-741, Nov. 1984.
[19] N. Paragios and R. Deriche, "Geodesic Active Regions: A New Framework to Deal with Frame Partition Problems in Computer Vision," J. Visual Comm. and Image Presentation, vol. 13, no. 1, pp. 249-268, 2002.
[20] G. Unal, A. YezziJr., and H. Krim, "Information-Theoretic Active Polygons for Unsupervised Texture Segmentation," Int'l J. Computer Vision, vol. 62, no. 3, pp. 199-220, 2002.
[21] D. Panjwani and G. Healey, "Markov Random Field Models for Unsupervised Segmentation of Textured Color Images," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 10, pp. 939-954, Oct. 1995.
[22] G. Doretto, A. Chiuso, Y.N. Wu, and S. Soatto, "Dynamic Textures," Int'l J. Computer Vision, vol. 51, no. 2, pp. 91-109, 2003.
[23] S. Krishnamachari and R. Chellappa, "Multiresolution Gauss-Markov Random-Field Models for Texture Segmentation," IEEE Trans. Image Processing, vol. 6, no. 2, pp. 251-267, Feb. 1997.
[24] R. Malladi, J.A. Sethian, and B.C. Vemuri, "Shape Modeling with Front Propagation: A Level Set Approach," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 2, pp. 158-175, Feb. 1995.
[25] A. Adam, R. Kimmel, and E. Rivlin, "On Scene Segmentation and Histograms-Based Curve Evolution," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 31, no. 9, pp. 1708-1714, Sept. 2009.
[26] S. Kullback and R.A. Leibler, "On Information and Sufficiency," Annals of Math. Statistics, vol. 22, pp. 79-86, 1951.
[27] A. Bhattacharyya, "On a Measure of Divergence between Two Statistical Populations Defined by Their Probability Distributions," Bull. Calcutta Math. Soc., vol. 35, pp. 99-109, 1943.
[28] S. Lankton and A. Tannenbaum, "Localizing Region-Based Active Contours," IEEE Trans. Image Processing, vol. 17, no. 11, pp. 2029-2039, Nov. 2008.
[29] C. Darolti, A. Mertins, C. Bodensteiner, and U. Hofmann, "Local Region Descriptors for Active Contours Evolution," IEEE Trans. Image Processing, vol. 17, no. 12, pp. 2275-2288, Dec. 2008.
[30] S. Phumeechanya, C. Pluempitiwiriyawej, and S. Thongvigitmanee, "Iris Segmentation: Detecting Pupil, Limbus and Eyelids," Proc. Int'l Conf. Image Processing, pp. 654-656, 2010.
[31] B. Mory and R. Ardon, "Fuzzy Region Competition: A Convex Two-Phase Segmentation Framework," Proc. Scale Space and Variational Methods, pp. 214-226, 2007.
[32] G. Sundaramoorthi, S. Soatto, and A. Yezzi, "Curious Snakes: A Minimum Latency Solution to the Cluttered Background Problem in Active Contours," Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 2855-2863, 2010.
[33] E. Parzen, "On Estimation of a Probability Density Function and Mode," Annals of Math. Statistics, vol. 33, no. 3, pp. 1065-1076, 1962.
[34] M. Grayson, "The Heat Equation Shrinks Embedded Plane Curves to Round Points," J. Differential Geometry, vol. 26, pp. 285-314, 1987.
[35] D. Adalsteinsson and J. Sethian, "A Fast Level Set Method for Propagating Interfaces," J. Computational Physics, vol. 118, no. 2, pp. 269-277, 1995.
[36] W.N. Lie, "Automatic Target Segmentation by Locally Adaptive Image Thresholding," IEEE Trans. Image Processing, vol. 4, no. 7, pp. 1036-1041, July 1995.
[37] Y. Gdalyahu, D. Weinshall, and M. Werman, "Self-Organization in Vision: Stochastic Clustering for Image Segmentation, Perceptual Grouping and Image Database," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 10, pp. 1053-1074, Oct. 2001.
[38] A. Cavallaro, O. Steiger, and T. Ebrahimi, "Tracking Video Objects in Cluttered Background," IEEE Trans. Circuits and Systems for Video Technology, vol. 15, no. 4, pp. 575-584, Apr. 2005.
[39] R. Jensen, D. Erdogmus, J.C. Principe, and T. Eltoft, "The Laplacian PDF Distance: A Cost Function for Clustering in a Kernel Feature Space," Advances in Neural Information Processing Systems, vol. 17, pp. 625-632, 2005.
[40] R.J. Hathaway, J.C. Bezdek, and Y. Hu, "Generalized Fuzzy C-Means Clustering Strategies Using $L_p$ Norm Distances," IEEE Trans. Fuzzy Systems, vol. 8, no. 5, pp. 576-582, Oct. 2000.
[41] Y. Rubner, C. Tomasi, and L. Guibas, "The Earth Mover's Distance as a Metric for Image Retrieval," Int'l J. Computer Vision, vol. 40, no. 2, pp. 91-121, 2000.
[42] K. Ni, X. Bresson, T. Chan, and S. Esedoglu, "Local Histogram Based Segmentation Using the Wasserstein Distance," Int'l J. Computer Vision, vol. 84, no. 1, pp. 97-111, 2009.
35 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool