This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Shape Modeling with Front Propagation: A Level Set Approach
February 1995 (vol. 17 no. 2)
pp. 158-175
ASCII Text
x 
 
Ravikanth Malladi, James A. Sethian, Baba C. Vemuri, "Shape Modeling with Front Propagation: A Level Set Approach," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 17, no. 2, pp. 158-175, February, 1995.
 
 
BibTex
x
 
@article{ 10.1109/34.368173,
author = {Ravikanth Malladi and James A. Sethian and Baba C. Vemuri},
title = {Shape Modeling with Front Propagation: A Level Set Approach},
journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence},
volume = {17},
number = {2},
issn = {0162-8828},
year = {1995},
pages = {158-175},
doi = {http://doi.ieeecomputersociety.org/10.1109/34.368173},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Pattern Analysis and Machine Intelligence
TI - Shape Modeling with Front Propagation: A Level Set Approach
IS - 2
SN - 0162-8828
SP158
EP175
EPD - 158-175
A1 - Ravikanth Malladi,
A1 - James A. Sethian,
A1 - Baba C. Vemuri,
PY - 1995
KW - Shape modeling
KW - shape recovery
KW - interface motion
KW - level sets
KW - hyperbolic conservation laws
KW - Hamilton-Jacobi equation
KW - entropy condition.
VL - 17
JA - IEEE Transactions on Pattern Analysis and Machine Intelligence
ER -
 

Abstract— Shape modeling is an important constituent of computer vision as well as computer graphics research. Shape models aid the tasks of object representation and recognition. This paper presents a new approach to shape modeling which retains some of the attractive features of existing methods and overcomes some of their limitations. Our techniques can be applied to model arbitrarily complex shapes, which include shapes with significant protrusions, and to situations where no a priori assumption about the object’s topology is made. A single instance of our model, when presented with an image having more than one object of interest, has the ability to split freely to represent each object. This method is based on the ideas developed by Osher and Sethian to model propagating solid/liquid interfaces with curvature-dependent speeds. The interface (front) is a closed, nonintersecting, hypersurface flowing along its gradient field with constant speed or a speed that depends on the curvature. It is moved by solving a “Hamilton-Jacobi” type equation written for a function in which the interface is a particular level set. A speed term synthesized from the image is used to stop the interface in the vicinity of object boundaries. The resulting equation of motion is solved by employing entropy-satisfying upwind finite difference schemes. We present a variety of ways of computing evolving front, including narrow bands, reinitializations, and different stopping criteria. The efficacy of the scheme is demonstrated with numerical experiments on some synthesized images and some low contrast medical images.

[1] D. Adalsteinsson and J. A. Sethian,“A fast level set method for propagating interfaces,” submitted for publication, J. of Computational Physics, 1994.
[2] A.A. Amini,T.E. Weymouth,, and R.C. Jain,“Using dynamic programming for solving variational problems in vision,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 12, no. 9, pp. 855-867, 1990.
[3] J. Bence,B. Merriman,, and S. Osher,“Motion of multiple triple junctions: A level set approach,” to appear in J. of Computational Physics, 1994.
[4] R.M. Bolle and B.C. Vemuri, "On Three-Dimensional Surface Reconstruction Methods," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, no. 1, Jan. 1991.
[5] A. Bourlioux and J. A. Sethian,“Projection methods coupled to level set interface methods,” to be submitted, J. of Computational Physics, 1994.
[6] A. Blake and A. Zisserman, Visual Reconstruction. MIT Press, 1987.
[7] V. Caselles,F. Catte,T. Coll,, and F. Dibos,“A geometric model for active contours in image processing,” Internal report no. 9210, CEREMADE, Universitéde Paris-Dauphine, France.
[8] D. L. Chopp,“Computing minimal surfaces via level set curvature flow,” J. of Computational Physics, vol. 106, pp. 77-91, 1993.
[9] D. L. Chopp and J. A. Sethian,“Curvature flow and singularity development,” submitted for publication in J. of Experimental Mathematics, 1993.
[10] L. D. Cohen,“On active contour models and balloons,” Computer Vision, Graphics, and Image Processing, vol. 53, No. 2, pp. 211-218, March 1991.
[11] H. Delingette, M. Hebert, and K. Ikeuchi, "Shape Representation and Image Segmentation Using Deformable Surfaces," IEEE Proc. Computer Vision and Pattern Recognition, pp. 467-472,Lahaina, Maui, Hawaii, June 1991.
[12] B. Engquist and S. Osher,“Stable and entropy satisfying approximations for transonic flow calculations,” Math. Comp., vol. 34,45, 1980.
[13] L. C. Evans and J. Spruck,“Motion of level sets by mean curvature. I,” J. of Differential Geometry, vol. 33, pp. 635-681, 1991.
[14] W. T. Freeman and E. H. Adelson,“Steerable filters for early vision, image analysis, and wavelet decomposition,” Proc. of ICCV, pp. 406-415,Osaka, Japan, 1990.
[15] M. Kass,A. Witkin,, and D. Terzopoulos,“Snakes: Active contour models,” Int’l. J. of Computer Vision, pp. 321-331, 1988.
[16] B. B. Kimia,A. R. Tannenbaum,, and S. W. Zucker,“Toward a computational theory of shape: An overview,” in Proc. of ECCV,Antibes, France, 1990.
[17] D. Lee and T. Pavlidis,“One-dimensional regularization with discontinuities,” IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 10, pp. 822-829, 1986.
[18] R. Malladi,“Deformable models: Canonical parameters for surface representation and multiple view integration,” Master’s thesis, Dept. of CIS, Univ. of Florida, Gainesville, FL, May 1991.
[19] R. Malladi,“A topology-independent shape modeling scheme,” Doctoral dissertation, Dept. of CIS, Univ. of Florida, Gainesville, FL, December 1993.
[20] R. Malladi,J. A. Sethian,, and B. C. Vemuri,“Evolutionary fronts for topology-independent shape modeling and recovery,” in Proc. of Third European Conf. on Computer Vision, LNCS vol. 800, pp. 3-13,Stockholm, Sweden, May 1994.
[21] R. Malladi and J. A. Sethian,“A unified framework for shape segmentation, representation, and recognition,” Report LBL-36069, Lawrence Berkeley Laboratory, Univ. of California, Berkeley, Aug. 1994.
[22] W. Mulder,S. Osher,, and J. A. Sethian,“Computing interface motion in compressible gas dynamics,” J. of Computational Physics, vol. 100, no. 2, pp. 209-228, 1992.
[23] S. Osher and J.A. Sethian, “Fronts Propagating with Curvature-Dependent Speed: Algorithms Based on Hamilton-Jacobi Formulations,” J. Computing in Physics, vol. 79, pp. 12-49, 1988.
[24] A. Pentland and S. Sclaroff, "Closed-Form Solutions for Physically-Based Shape Modeling and Recognition," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, no. 7, pp. 715-729, July 1991.
[25] C. Rhee,L. Talbot,, and J. A. Sethian,“Dynamical behavior of a premixed turbulent open V-Flame,” submitted for publication, J. of Fluid Mech., 1994.
[26] R. Samadani,“Changes in connectivity in active contour models,” Proc. of the Workshop on Visual Motion, pp. 337-343,Irvine, CA, March 1989.
[27] L. L. Schumaker,“Fitting surfaces to scattered data,” in Approximation Theory II, G. G. Lorentz, C. K. Chui, and L. L. Schumaker, (eds.). New York: Academic Press, 1976, pp. 203-267.
[28] J. A. Sethian,“Curvature and the evolution of fronts,” Comm. in Math. Physics, vol. 101, pp. 487-499, 1985.
[29] J. A. Sethian,“Numerical algorithms for propagating interfaces: Hamilton-Jacobi equations and conservation laws,” J. of Differential Geometry, vol. 31, pp. 131-161, 1990.
[30] J. A. Sethian and J. Strain,“Crystal growth and dendritic solidification,” J. of Computational Physics, vol. 98, pp. 231-253, 1992.
[31] M. Sussman,P. Smereka,, and S. Osher,“A level set approach for computing solutions to incompressible two-phase flow,” UCLA CAM Report 93-18, 1993.
[32] R. Szeliski and D. Tonnesen, "Surface Modelling with Oriented Particle Systems," Computer Graphics(Proc. Siggraph 92), vol. 26, no. 2, 1992, pp. 185-194.
[33] D. Terzopoulos, "Regularization of Inverse Visual Problems Involving Discontinuities," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 8, no. 4, pp. 413-424, 1986.
[34] D. Terzopolous, A. Witkin, and M. Kass, "Constraints on deformable models: Recovering 3D shape and nonrigid motion, AI, no. 36, pp. 91-123, 1988.
[35] D. Terzopoulos, "The Computation of Visible Surface Representations," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 10, no. 4, pp. 417-438, Apr. 1988.
[36] B. C. Vemuri and R. Malladi,“Surface griding with intrinsic parameters,” Pattern Recognition Letters, vol. 13, No. 11, pp. 805-812, Nov. 1992.
[37] B. C. Vemuri and R. Malladi,“Constructing intrinsic parameters with active models for invariant surface reconstruction,” IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 15, No. 7, pp. 668-681, July 1993.
[38] B. C. Vemuri,A. Mitiche,, and J. K. Aggarwal,“Curvature-based representation of objects from range data,” Int’l. J. of Image and Vision Computing, 4, pp. 107-114, 1986.
[39] Y. F. Wang and J. F. Wang,“Surface reconstruction using deformable models with interior and boundary constraints,” in Proc. of ICCV, pp. 300-303,Osaka, Japan, 1990.
[40] J. Zhu and J. A. Sethian,“Projection methods coupled to level set interface techniques,” J. of Computational Physics, vol. 102(1), pp. 128-138, 1992.

Index Terms:
Shape modeling, shape recovery, interface motion, level sets, hyperbolic conservation laws, Hamilton-Jacobi equation, entropy condition.
Citation:
Ravikanth Malladi, James A. Sethian, Baba C. Vemuri, "Shape Modeling with Front Propagation: A Level Set Approach," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 17, no. 2, pp. 158-175, Feb. 1995, doi:10.1109/34.368173
Usage of this product signifies your acceptance of the Terms of Use.