This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Encoding of a priori Information in Active Contour Models
September 1996 (vol. 18 no. 9)
pp. 863-872

Abstract—The theory of active contours models the problem of contour recovery as an energy minimization process. The computational solutions based on dynamic programming require that the energy associated with a contour candidate can be decomposed into an integral of local energy contributions. In this paper we propose a grammatical framework that can model different local energy models and a set of allowable transitions between these models. The grammatical encodings are utilized to represent a priori knowledge about the shape of the object and the associated signatures in the underlying images. The variability encountered in numerical experiments is addressed with the energy minimization procedure which is embedded in the grammatical framework. We propose an algorithmic solution that combines a nondeterministic version of the Knuth-Morris-Pratt algorithm for string matching with a time-delayed discrete dynamic programming algorithm for energy minimization. The numerical experiments address practical problems encountered in contour recovery such as noise robustness and occlusion.

[1] N. Friedland and D. Adam, “Automatic Ventricular Cavity Boundary Detection from Sequential Ultrasound Images Using Simulated Annealing,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 8, no. 4, pp. 344-353, 1989.
[2] G. Storvik, "A Bayesian Approach to Dynamic Contours," PhD thesis, Norwegian Computing Center, Oslo, Oct. 1992.
[3] H.L Tan, S.B. Gelfand, and E.J. Delp, "A Cost Minimization Approach to Edge Detection Using Simulated Annealing," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 14, no. 1, pp. 3-18, Jan. 1991.
[4] 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.
[5] M. Kass, A. Witkin, and D. Terzopoulos, "Snakes: Active Contour Models," Int'l J. Computer Vision, vol. 1, no. 4, pp. 321-331, 1988.
[6] F. Leymarie and M. Levine, "Tracking deformable objects in the plane using an active contour model, IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 6, pp. 617-634, June 1993.
[7] H. Yamada, C. Merrit, and T. Kasvand, "Recognition of Kidney Glomerulus by Dynamic Programming Matching Method," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 10, no. 5, pp. 731-737, Sept. 1988.
[8] D.J. Williams and M. Shah,“A fast algorithm for active contours and curvature estimation,” Computer Vision, Graphics, Image Processing, vol. 55, pp. 14-26, 1992.
[9] U. Grenander and D.M. Keenan, "Towards Automated Image Understanding," J. Applied Statistics, vol. 16, pp. 207-221, 1989.
[10] B. Olstad, "Active Contours with Grammatical Description," Proc. Progress in Image Analysis and Processing II, pp. 430-437,Como, Italy, Sept. 1991, World Scientific Publishing Co. Pte. Ltd., Proc. Sixth Int'l Conf. Image Analysis and Processing.
[11] Y. He and A. Kundu, 2-D Shape Classification Using Hidden Markov Model IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, no. 11, pp. 1172-1184, Nov. 1991.
[12] D.M. Wuescher and K.L. Boyer,“Robust contour decomposition using a constant curvature criterion,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, no. 1, pp. 41-51, 1991.
[13] J. Canny, “A Computational Approach to Edge Detection,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 8, no. 6, pp. 679-698, June 1986.
[14] R.C. Gonzalez and R.E. Woods, Digital Image Processing, Addison-Wesley, New York, 1993.
[15] B. Olstad and H.E. Tysdahl, "Improving the Computational Complexity of Active Contour Algorithms," Proc. Eighth Scandinavian Conf. Image Analysis (SCIA '93), vol. 1, pp. 257-263, May 1993.
[16] A.V. Aho, R. Sethi, and J.D. Ullman, Compilers, Principles, Techniques and Tools.New York: Addison-Wesley, 1985.
[17] A. Gill, Applied Algebra for the Computer Sciences. Prentice Hall, 1976.
[18] R.C. Gonzalez and M.G. Thomason, Syntactic Pattern Recognition, An Introduction. Addison Wesley, 1978.
[19] J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Apr. 1979.
[20] R. Sedgewick,Algorithms. Reading, MA: Addison-Wesley, 1983.
[21] L.R. Rabiner and B.H. Juang, "An Introduction to Hidden Markov Models," IEEE Acoustics, Speech, and Signal Processing Magazine, vol. 3, pp. 4-16, Jan. 1986.

Index Terms:
Active contours, grammatical encoding, string matching, dynamic programming.
Citation:
Bjørn Olstad, Anders H. Torp, "Encoding of a priori Information in Active Contour Models," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 18, no. 9, pp. 863-872, Sept. 1996, doi:10.1109/34.537341
Usage of this product signifies your acceptance of the Terms of Use.