This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Stochastic Jump-Diffusion Process for Computing Medial Axes in Markov Random Fields
November 1999 (vol. 21 no. 11)
pp. 1158-1169

Abstract—This paper proposes a statistical framework for computing medial axes of 2D shapes. In this paper, the computation of medial axes is posed as a statistical inference problem not as a mathematical transform. This paper contributes to three aspects in computing medial axes. 1) Prior knowledge is adopted for axes and junctions so that axes around junctions are regularized. 2) Multiple interpretations of axes are possible, each being assigned a probability. 3) A novel stochastic jump-diffusion process is proposed for estimating both axes and junctions in Markov random fields. We argue that the stochastic algorithm for computing medial axes is compatible with existing algorithms for image segmentation, such as region growing [31], snake [7], and region competition [26]. Thus, our method provides a new direction for computing medial axes from texture images. Experiments are demonstrated on both synthetic and real 2D shapes. This algorithm has been successfully applied to shape learning and sampling in a companion paper [30].

[1] H. Blum, “Biological Shape and Visual Science,” J. Theoretical Biology, vol. 33, pp. 205-287, 1973.
[2] J. Brady and H. Asada, “Smooth Local Symmetries and Their Implementations,” Int'l J. Robotics Reg., vol. 3, no. 3, 1984.
[3] J.L. Crowley, “A Representation for Shape Based on Peaks and Ridges in the Difference of Low-Pass Transform,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, no. 2, Mar. 1984.
[4] S. Geman and D. Geman, “Stochastic Relaxation, Gibbs Distributions and the Bayesian Restoration of Images,” IEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, pp. 721-741, 1984.
[5] P.J. Green, “Reversible Jump Markov Chain Monte Carlo Computation and Bayesian Model Determination,” Biometrika, vol. 82, no. 4, pp. 711-732, 1995.
[6] U. Grenander and M. Miller, “Representation of Knowledge in Complex Systems,” J. Royal Statistics Soc., vol. B56, pp. 97-109, 1994.
[7] M. Kass, A. Witkin, and D. Terzopoulos, “Snakes: Active Contour Models,” Proc. Int'l Conf. Computer Vision ICCV '87, London, 1987.
[8] M.F. Kelley and M.D. Levine, “Symmetry to Representation: The Abstraction of Object Information from Images,” TR-CIM-94-12, Centre for Intelligent Machines, McGill Univ., 1995.
[9] B.B. Kimia, A.R. Tannenbaum, and S.W. Zucker, “Shape, Shocks and Deformations I: The Components of 2D Shape and the Reaction-Diffusion Space,” Int'l J. Computer Vision, vol. 15, pp. 189-224, 1995.
[10] I. Kovacs and B. Julesz, “Perceptual Sensitivity Maps within Globally Defined Visual Shapes,” Nature, 1994.
[11] T.S. Lee, D.B. Mumford, and S.C. Zhu, “Sensitivity of V1 Neurons to Globally Defined Shapes,” Proc. Fifth Int'l Conf. Computational Neurosciences, 1996.
[12] F. Leymarie and M.D. Levine, “Simulating the Grassfire Transform Using an Active Contour Model,” IEEE Trans. Pattern Analysis and Machine Intellingence, vol. 14, no. 1, pp. 56-75, Jan. 1992.
[13] M. Leyton, Symmetry, Causality, Mind. Cambridge, Mass.: MIT Press, 1992.
[14] S. Li, “Object Recognition from Range Data,” Proc. Int'l Visualization Conf., Oct. 1992.
[15] S.Z. Li, Markov Random Field Modeling in Computer Vision. New York: Springer-Verlag, 1995.
[16] T. Liu, D. Geiger, and R. Kohn, “Representation and Self-Similarity of Shapes,” Proc. Int'l Conf. Computer Vision, Bombay, 1998.
[17] N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, and E. Teller, “Equations of State Calculations by Fast Computing Machines,” J. Chemistry and Physics, vol. 21, pp. 1,087-1,092, 1953.
[18] D. Mumford and J. Shah, “Optimal Approximations by Piecewise Smooth Functions and Associated Variational Problems,” Comm. Pure Applied Math., vol. 42, pp. 577-684, 1989.
[19] R. Navatia and T.O. Binford, “Description and Recognition of Curved Objects,” Artificial Intelligence, vol. 8, pp. 77-98, 1977.
[20] R.L. Ogniewicz, Discrete Voronoi Skeleton. Hartung-Gorre, 1993.
[21] G. Sapiro, “Affine Invariant Medial Axis and Skew Symmetry,” Proc. Int'l Conf. Computer Vision, Bombay, 1998.
[22] S. Tari and J. Shah, “Local Symmetries of Shapes in Arbitrary Dimension,” Proc. Int'l Conf. Computer Vision, Bombay, 1998.
[23] K. Siddiqi, A. Tannenbaum, and S. Zucker, “Hyperbolic Smoothing of Shapes,” Proc. Int'l Conf. Computer Vision, Bombay, 1998.
[24] Y.F. Tsao and K.S. Fu, “Stochastic Skeleton Modeling of Objects,” Computer Vision, Graphics, and Image Processing, vol. 25, pp. 384-370, 1984.
[25] M. Wright, R. Cipolla, and P. Giblin, “Skeletonisation Using an Extended Euclidean Distance Transform,” Image and Vision Computing, 1995.
[26] S.C. 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, pp. 884-900, 1996.
[27] S.C. Zhu and A.L. Yuille, “FORMS: A Flexible Object Recognition and Modeling System,” Int'l J. Computer Vision, vol. 20, no. 3, Dec. 1996
[28] S.C. Zhu and D. Mumford, “Prior Learning and Gibbs Reaction-Diffusion,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 11, Nov. 1997.
[29] S.C. Zhu, “Stochastic Computation of Medial Axis in the Markov Random Fields,” Proc. Int'l Conf. Computer Vision and Pattern Recognition, Santa Barbara, Calif., 1998.
[30] S. C. Zhu, “Embedding Gestalt Laws in Markov Random Fields,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 21, no. 11, Nov. 1999.
[31] S.W. Zucker, “Region Growing: Childhood and Adolescence,” Computer Vision, Graphics, and Image Processing, vol. 5, 1976.

Index Terms:
Medial axis transform, jump-diffusion process, energy minimization, Markov random field.
Citation:
Song-Chun Zhu, "Stochastic Jump-Diffusion Process for Computing Medial Axes in Markov Random Fields," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 21, no. 11, pp. 1158-1169, Nov. 1999, doi:10.1109/34.809109
Usage of this product signifies your acceptance of the Terms of Use.