
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
F. Leymarie, M.D. Levine, "Simulating the Grassfire Transform Using an Active Contour Model," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 14, no. 1, pp. 5675, January, 1992.  
BibTex  x  
@article{ 10.1109/34.107013, author = {F. Leymarie and M.D. Levine}, title = {Simulating the Grassfire Transform Using an Active Contour Model}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {14}, number = {1}, issn = {01628828}, year = {1992}, pages = {5675}, doi = {http://doi.ieeecomputersociety.org/10.1109/34.107013}, 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  Simulating the Grassfire Transform Using an Active Contour Model IS  1 SN  01628828 SP56 EP75 EPD  5675 A1  F. Leymarie, A1  M.D. Levine, PY  1992 KW  region features; grassfire transform simulation; pattern recognition; active contour model; shape description; boundary features; elastic contours; Euclidean metric; digital grid; curvature extremum significance; filtering and prediction theory; pattern recognition; picture processing VL  14 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
A method for shape description of planar objects that integrates both region and boundary features is presented. The method is an implementation of a 2D dynamic grassfire that relies on a distance surface on which elastic contours minimize an energy function. The method is based on an active contour model. Numerous implementation aspects of the shape description method were optimized. A Euclidean metric was used for optimal accuracy, and the active contour model permits bypassing some of the discretization limitations inherent in using a digital grid. Noise filtering was performed on the basis of both contour feature measures and region measures, that is, curvature extremum significance and ridge support, respectively, to obtain robust shape descriptors. Other improvements and variations of the algorithmic implementation are proposed.
[1] S. M. Ali and R. E. Burge, "A new algorithm for extracting the interior of bounded regions based on chain coding,"Comput. Vision Graphics Image Processing, vol. 43, pp. 256264, 1988.
[2] C. Arcelli, "Pattern thinning by contour tracing,"Comput. Graphics Image Processing, vol. 17, pp. 130144, 1981.
[3] C. Arcelli, L. P. Cordella, and S. Leviadi, "From local maxima to connected skeletons,"IEEE Trans. Patt. Anal. Machine Intell., vol. PAMI3, pp. 134143, Mar. 1981.
[4] C. Arcelli and G. Sanniti di Baja, "On the sequential approach to medial line transformation,"IEEE Trans. Syst. Man Cybern., vol. SMC8, no. 2, pp. 139144, 1978.
[5] C. Arcelli and G. Sanniti di Baja, "A widthindependent fast thinning algorithm,"IEEE Trans. Patt. Anal. Machine Intell., vol. PAMI7, pp. 463474, July 1985.
[6] C. Arcelli and G. Sanniti di Baja, "Finding multiple pixels," inImage Analysis and Processing(S. L. V. Cantoni and G. Musso, Eds.) New York: Plenum, 1986, pp. 137144.
[7] C. Arcelli and G. Sanniti di Baja, "On the simplicity of digital curves and contours," inProc. 8th Int. Conf. Patt. Recogn.(Paris, France), Oct. 1986, pp. 283285.
[8] C. Arcelli and G. Sanniti di Baja, "A contour characterization for multiply connected figures,"Patt. Recogn. Lett., vol. 6, pp. 245249, Sept. 1987.
[9] C. Arcelli and G. Sanniti di Baja, "A onepass twooperations process to detect the skeletal pixels on the 4distance transform,"IEEE Trans. Patt. Anal. Machine Intell., vol. 11, pp. 411414, Apr. 1989.
[10] F. Attneave, "Some informational aspects of visual perception,"Psycholog. Rev., vol. 61, no. 3, pp. 183193, 1954.
[11] F. Attneave, "Criteria for a tenable theory of form perception," inModels for the Perception of Speech and Visual Form(W. WathenDunn, ed.). Cambridge, MA: MIT Press, 1967, pp. 5667.
[12] A. Benson and D. J. Evans, "A normalized algorithm for the solution of positive definite symmetric quindiagonal systems of linear equations,"ACM Trans. Math. Software, vol. 3, pp. 96103, Mar. 1977.
[13] M. O. Berger, "Active contour models and growing methods," Tech. Rep. CRIN 90R081, Centre de Recherche en Informatique de Nancy, Campus Scientifique, VandoeuvrelesNancy Cedex, France, Dec. 1989.
[14] M. O. Berger and R. Mohr, "Toward autonomy in active contour models," inProc. 10th Int. Conf. Patt. Recogn.(Atlantic City, NJ), June 1990, pp. 847851, vol. 1.
[15] H. Blum, "An associative machine for dealing with the visual field and some of its biological implications," inBiological Prototypes and Synthetic Systems(E. E. Bernard and M. R. Kare, eds.). New York: Plenum, 1962, pp. 244260.
[16] H. Blum, "A machine for performing visual recognition by use of antennapropagation concepts," inInst. Radio Engineers, Wescon Conv. Rec.(Los Angeles, CA), Aug. 1962, vol. 6.
[17] H. Blum, "A transformation for extracting new descriptors of shape," inModels for the Perception of Speech and Visual Form(W. WathenDunn, ed.). Cambridge, MA: MIT Press, 1967, pp. 362380.
[18] H. Blum, "Biological shape and visual science (part I),"J. Theoretical Biology, vol. 38, pp. 205287, 1973.
[19] H. Blum and R. Nagel, "Shape description using weighted symmetric axis features,"Patt. Recogn., vol. 10, pp. 167180, 1978.
[20] F. L. Bookstein, "The line skeleton,"Comput. Graphics Image Processing, vol. 11, pp. 123137, 1979.
[21] G. Borgefors, "Distance transformations in arbitrary dimensions,"Comput. Vision Graphics Image Processing, vol. 27, pp. 321345, Sept. 1984.
[22] G. Borgefors and G. Sanniti di Baja, "Skeletonizing the distance transform on the hexagonal grid," inProc. 9th Int. Conf. Patt. Recogn.(Rome, Italy), Nov. 1988, pp. 504507, vol. 1.
[23] G. Bouligand,IntroductionàLa Géométrie Infinitésimale Directe. Paris, France: Vuibert, 1932.
[24] M. Brady and H. Asada, "Smoothed local symmetries and their implementation,"Int. J. Robotics Res., vol. 3, pp. 3661, Fall 1984.
[25] I. N. Bronshtein and K. A. Semendyayev,Handbook of Mathematics, 3rd ed.(K. A. Hirsch, Ed.). New York: Van Nostrand Reinhold, 1985.
[26] P. J. Burt, "Fast filter transforms for image processing,"Comput. Graphics Image Processing, vol. 16, pp. 2051, 1981.
[27] R. T. Chin, H. K. Wan, D. L. Stover, and R. D. Iverson, "A onepass thinning algorithm and its parallel implementation,"Comput. Vision Graphics Image Processing, vol. 40, pp. 3040, 1987.
[28] P. E. Danielsson, "Euclidean distance mapping,"Comput. Graphics Image Processing, vol. 14, pp. 227248, 1980.
[29] C. David and S. Zucker, "Potentials, valleys, and dynamic global coverings," McRCIM Tech. Rep. CIM891, McGill Univ., Elect. Eng. Dept., Montreal, Canada, Mar. 1989.
[30] E. R. Davies and A. P. N. Plummer, "Thinning algorithms: A critique and a new methodology,"Patt. Recogn., vol. 14, no. 1, pp. 5363, 1981.
[31] R. Desimone and L. G. Ungerleider, "Neural mechanisms of visual processing in monkeys," inHandbook of Neuropsychology(F. Bollers and J. Grafman, Eds.). New York: Elsevier, 1989, pp. 267299, vol. 2, ch. 14.
[32] A. R. Dill, M. D. Levine, and P. B. Noble, "Multiple resolution skeletons,"IEEE Trans. Patt. Anal. Machine Intell., vol. PAMI9, pp. 495504, July 1987.
[33] A. Dobbins, S. W. Zucker, and M. Cynader, "Endstopped neurons in the visual cortex as a substrate for calculating curvature,"Nature, vol. 329, pp. 438441, Oct. 1987.
[34] L. Dorst, "PseudoEuclidean skeletons," inProc. 8th Int. Conf. Patt. Recogn.(Paris, France), Oct. 1986, pp. 286288.
[35] A. Favre and H. Keller, "Parallel syntactic thinning by recoding of binary pictures,"Comput. Vision Graphics Image Processing, vol. 23, pp. 99112, 1983.
[36] H. Goldstein,Classical Mechanics. Reading, MA: AddisonWesley, 1980, 2nd ed.
[37] A. W. Goodman, "A partial differential equation and parallel plane curves,"Amer. Math. Monthly, vol. 71, pp. 257264, Mar. 1964.
[38] P. Hanks, ed.,The Collins Dictionary of the English Language. London, England: Collins, 1986, 2nd edition, 1986.
[39] C. J. Hilditch, "Linear skeletons from square cupboards,"Machine Intell., vol. 4, pp. 403420, 1969.
[40] C. J. Hilditch, "Comparison of thinning algorithms on a parallel processor,"Image Vision Comput., vol. 1, pp. 115132, Aug. 1983.
[41] S. B. Ho and C. R. Dyer, "Shape smoothing using medal axis transform,"IEEE Trans. Patt. Anal. Machine Intell., vol. PAMI8, pp. 512520, July 1986.
[42] D. A. H. Jacobs, ed.,The State of the Art in Numerical Analysis. London, England: Academic, 1977.
[43] M. Kass, A. Witkin, and D. Terzopoulos, "Snakes: Active contour models," inProc. 1st Int. Conf. Comput. Vision(London, England), June 1987, pp. 259268.
[44] F. Klein and O. Kubler, "Euclidean distance transformation and modelguided image interpretation,"Patt. Recogn. Lett., vol. 5, pp. 1930, Jan. 1987.
[45] J. C. Kotelly, "A mathematical model of Bum's theory of pattern recognition," Res. Rep. AFCRL63164, Air Force Cambridge Res. Labs., Bedford, MA, Apr. 1963.
[46] D. T. Lee, "Medal axis transformation of a planar shape,"IEEE Trans. Patt. Anal. Machine Intell., vol. PAMI8, pp. 363369, July 1982.
[47] G. Levi and U. Montanari, "A greyweighted skeleton,"Inform. Contr., vol. 17, pp. 6291, Aug. 1970.
[48] M. D. Levine,Vision in Man and Machine. Computer Engineering Series. New York: McGrawHill, 1985.
[49] F. Leymarie, "Tracking and describing deformable objects using active contour models," McRCIM Tech. Rep. CIM909, Master's thesis, McGill Univ., Elec. Eng. Dept., Montreal, Canada, Feb. 1990.
[50] F. Leymarie and M. D. Levine, "Fast raster scan distance propagation on the discrete rectangular lattice," to be published inComput. Vision Graphics Image Processing.
[51] F. Leymarie and M. D. Levine, "Curvature morphology," McRCIM Tech. Rep. CIM8826, McGill Univ., Elec. Eng. Dept., Montreal, Canada, Dec. 1988.
[52] F. Leymarie and M. D. Levine, "Snakes and skeletons," McRCIM Tech. Rep. CIM893, McGill Univ., Elect. Eng. Dept., Montreal, Canada, Jan. 1989.
[53] F. Leymarie and M. D. Levine, "Shape features using curvature morphology," inProc. SPIE "Intell. Robots Comput. Vision VIII: Algorithms Techniques" Conf.(Philadelphia, PA), Nov. 1989, pp. 536547, vol. 1192, pt. 2.
[54] F. Leymarie and M. D. Levine, "New method for shape description based on an active contour model," inProc. SPIE "Visual Commun. Image Processing '89" Conf.(Philadelphia, PA), 1989, pp. 390401, vol. 1199, pt. 1.
[55] F. Leymarie and M. D. Levine, "Skeletons from snakes," inProgress in Image Analysis and Processing(V. Cantoniet al., Eds.). Singapore: World Scientific, 1990, pp. 186193; inProc. 5th Int. Conf. Image Anal. Processing(Positano, Italy), Sept. 1989, pp. 2022.
[56] M. Leyton, "Symmetrycurvature duality,"Comput. Vision Graphics Image Processing, vol. 38, pp. 327341, 1987.
[57] M. Leyton, "A process grammar for shape,"Artificial Intell. J., vol. 34, pp. 213247, Mar. 1988.
[58] M. P. MartínezPérez, J. Jiménez, and J. Navalón, "A thinning algorithm based on contours,"Comput. Vision Graphics Image Processing, vol. 39, pp. 186201, 1987.
[59] G. Matheron, "Examples of topological properties of skeletons," inImage Analysis and Mathematical Morphology; Volume 2: Theoretical Advances(J. Serra, Ed.). London, England: Academic, 1988, pp. 217238, ch. 11.
[60] F. Meyer, "Skeletons in digital spaces," inImage Analysis and Mathematical Morphology; Volume 2: Theoretical Advances(J. Serra, Ed.) London, England: Academic, 1988, pp. 258296, ch. 13.
[61] U. Montanari, "A method for obtaining skeletons using a quasiEuclidean distance,"J. Assoc. Comput. Machinery, vol. 15, pp. 600624, Oct. 1968.
[62] U. Montanari, "Continuous skeletons from digitized images,"J. Assoc. Comput. Machinery, vol. 16, pp. 534549, Oct. 1969.
[63] A. Montanvert, "Medal line: Graph representation and shape description," inProc. 8th Int. Conf. Patt. Recogn.(Paris, France), Oct. 1986, pp. 430432.
[64] T. Motzkin, "Sur quelques propriétés caractéristiques des ensembles convexes,"Atti Della Accademia Nazionale Dei Lincei, vol. 21, pp. 562567, 1935.
[65] T. Motzkin, "Sur quelques propriétés caractéristiques des ensembles bornés non convexes,"Atti Della Accademia Nazionale Dei Lincei, vol. 21, pp. 773779, 1935.
[66] P. B. Noble and M. D. Levine,ComputerAssisted Analyses of Cell Locomotion and Chemotaxis. Boca Raton, FL: CRC, 1986.
[67] N. Okabe, J.I. Toriwaki, and T. Fukumura, "Paths and distance functions on threedimensional digitized pictures,"Patt. Recogn. Lett., vol. 1, pp. 205212, 1983.
[68] T. Pavlidis, "Algorithms for shape analysis of contours and waveforms,"IEEE Trans. Patt. Anal. Machine Intell., vol. PAMI2, pp. 301312, July 1980.
[69] T. Pavlidis, "A thinning algorithm for discrete binary images,"Comput. Graphics Image Processing, vol. 13, pp. 142157, 1980.
[70] T. Pavlidis, "An asynchronous thinning algorithm,"Comput. Graphics Image Processing, vol. 20, pp. 133157, 1982.
[71] A. Rosenfeld and J. Pfaltz, "Sequential operations in digital picture processing,"J. ACM, vol. 4, 1966.
[72] J. Serra,Image Analysis and Mathematical Morphology, Volume 1. London, England: Academic, 1982.
[73] B. Shapiro, J. Pisa, and J. Sklansky, "Skeleton generation fromx, yboundary sequences,"Comput. Graphics Image Processing, vol. 15, pp. 136153, 1981.
[74] F. Y. Shih and C. C. Pu, "Medal axis transformation with singlepixel and connectivity preservation using Euclidean distance computation," inProc. 10th Int. Conf. Patt. Recogn.(Atlantic City, NJ), June 1990, pp. 723725, vol. 1.
[75] G. Y. Tang and B. Lien, "Region filling with the use of the discrete Green theorem,"Comput. Vision Graphics Image Processing, vol. 42, pp. 297305, 1988.
[76] C.H. Teh and R. T. Chin, "On the detection of dominant points on digital curves,"IEEE Trans. Patt. Anal. Machine Intell., vol. 11, pp. 859872, Aug. 1989.
[77] D. Terzopoulos, "On matching deformable models to images," inTopical Meeting on Machine Vision Technical Digest Series. Washington, D.C.: Opt. Soc. Amer., 1987, pp. 160163, vol. 12; presented at the Opt. Soc. Amer. Machine Vision Topical Mtg., Incline Village, NV, Mar. 1820, 1987.
[78] D. Terzopoulos, "Matching deformable models to images: Direct and iterative solutions," inTopical Mtg. Machine Vision Tech. Dig. Series, (Washington, D.C.) 1987, pp. 164167, vol. 12.
[79] D. Terzopoulos, "Elastically deformable models," inProc. SISGRAPH '87(Anaheim, CA), July 1987.
[80] Y. F. Tsao and K. S. Fu, "Stochastic skeleton modeling of objects,"Computer Vision Graphics Image Processing, vol. 25, pp. 348370, 1984.
[81] Y. Xia, "Skeletonization via the realization of the fire front's propagation and extinction in binary shapes,"IEEE Trans. Patt. Anal. Machine Intell., vol. 11, pp. 10761086, Oct. 1989.
[82] W. Ku and C. Wang, "CGT: A fast thinning algorithm implemented on a sequential computer,"IEEE Trans. System Man Cybern., vol. SMC17, pp. 847851, Sept. 1987.
[83] Q.Z. Ye, "The signed Euclidean distance transform and its applications," inProc. 9th Int. Conf. Patt. Recogn.(Rome, Italy), Nov. 1988, pp. 495499.
[84] Y. M. Youssef, "Quantification and characterization of the motion and shape of a moving cell," PhD thesis, McGill Univ., Elect. Eng. Dept., Montreal, Canada, May 1982.
[85] A. Yoille and M. Leyton, "3D symmetrycurvature duality theorems," inProc. 1st Int. Conf. Comput. Vision(London, England), June 1987, pp. 721726.
[86] S.W. Zucker, C. David, L. Dobbins, and L. Iverson, "The organization of curve detection: Coarse tanget fields and fine spline coverings," inProc. 2nd ICCV, Tarpon Springs, FL, 1988, pp. 568577.