
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
P. Meer, C.A. Sher, A. Rosenfeld, "The Chain Pyramid: Hierarchical Contour Processing," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 12, no. 4, pp. 363376, April, 1990.  
BibTex  x  
@article{ 10.1109/34.50622, author = {P. Meer and C.A. Sher and A. Rosenfeld}, title = {The Chain Pyramid: Hierarchical Contour Processing}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {12}, number = {4}, issn = {01628828}, year = {1990}, pages = {363376}, doi = {http://doi.ieeecomputersociety.org/10.1109/34.50622}, 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  The Chain Pyramid: Hierarchical Contour Processing IS  4 SN  01628828 SP363 EP376 EPD  363376 A1  P. Meer, A1  C.A. Sher, A1  A. Rosenfeld, PY  1990 KW  picture processing; interobject distance measure; medial axes; discrete distance maps; minimal pointtopoint distances; distance measurement; picture processing VL  12 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
A novel hierarchical approach toward fast parallel processing of chaincodable contours is presented. The environment, called the chain pyramid, is similar to a regular nonoverlapping image pyramid structure. The artifacts of contour processing on pyramids are eliminated by a probabilistic allocation algorithm. Building of the chain pyramid is modular, and for different applications new algorithms can be incorporated. Two applications are described: smoothing of multiscale curves and gap bridging in fragmented data. The latter is also employed for the treatment of branch points in the input contours. A preprocessing module allowing the application of the chain pyramid to raw edge data is also described. The chain pyramid makes possible fast, O(log(image/sub /size)), computation of contour representation in discrete scalespace.
[1] I. Agi, P. J. Hurst, and A. K. Jain, "An expandable VLSI processor array approach to contour tracing," inProc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing, New York, Apr. 1115, 1988, pp. 19691972.
[2] H. Asada and M. Brady, "The curvature primal sketch,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI8, no. 1, pp. 214, 1986.
[3] P. J. Burt, "Fast filter transforms for image processing,"Comput. Graphics Image Processing, vol. 16, pp. 2051, 1981.
[4] P. J. Burt and E. H. Adelson, "A multiresolution spline with application to image mosaics,"ACM Trans. Graphics, vol. 2, pp. 217 236, 1983.
[5] B. D. Chen and P. Siy, "Forward/backward contour tracing with feedback,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI 9, pp. 438446, 1987.
[6] 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.
[7] A. M. Darwish and A. K. Jain, "A rule based approach for visual pattern inspection,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI10, pp. 5668, 1988.
[8] I. Dinstein, D. W. L. Yen, and M. D. Flickner, "Handling memory overflow in connected component labeling applications,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI7, pp. 116121, 1985.
[9] S. Edelman, "Line connectivity algorithms for an asynchronous pyramid computer,"Comput. Vision Graphics Image Processing, vol. 24, pp. 169187, 1987.
[10] P. Fua and A. J. Hanson, "Using generic geometric models for intelligent shape extraction," inProc. Image Understanding Workshop, Los Angeles, CA, Feb. 2325, 1987. Los Altos, CA: Morgan Kaufmann, 1987, pp. 227233.
[11] M.A. Fischler and R. C. Bolles, "Perceptual organization and curve partitioning,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI8, no. 1, pp. 100105, 1986.
[12] H. Freeman, "Computer processing of linedrawing images,"Computer Surveys, vol. 6, no. 1, Mar. 1974.
[13] L. O'Gorman, "Primitives Chain Code,"Proc. Int'l Conf. Acoustics, Speech, and Signal Processing, IEEE, New York, 1988, pp. 792795.
[14] G. Hartmann, "Recognition of hierarchically encoded images by technical and biological systems,"Biol. Cybern., vol. 57, pp. 73 84, 1987.
[15] T. S. Hong, M. O. Shneier, R. L. Harley, and A. Rosenfeld, "Using pyramids to detect good continuation,"IEEE Trans. Syst., Man., Cybern., vol. SMC13, pp. 631635, 1983.
[16] E. Horowitz and S. Sahni,Fundamentals of Data Structures. Rockville, MD: Computer Science Press, 1976.
[17] J. Koplowitz and A. P. Sundar Raj, "A robust filtering algorithm for subpixel reconstruction of chain coded line drawings,"IEEE Trans. Patt. Anal. Machine Intell., vol. PAMI9, pp. 451457, 1987.
[18] W. G. Kropatsch, "Curve representation in multiple resolutions,"Pattern Recognition Lett., vol. 6, pp. 179184, 1987.
[19] J. V. Mahoney, "Image chunking: Defining spatial building blocks for scene analysis," Artificial Intell. Lab., Massachusetts Inst. Technol., Rep. AITR980, Aug. 1987.
[20] P. Meer, "Simulation of constant size multiresolution representations on image pyramids,"Pattern Recogn. Lett., vol. 8, pp. 229236, 1988.
[21] P. Meer, "Stochastic image pyramids,"Comput. Vision Graphics Image Processing, vol. 45, pp. 269294, 1989.
[22] R. Miller and Q. F. Stout, "Data movement techniques for the pyramid computer,"SIAM J. Comput., vol. 16, pp. 3860, 1987.
[23] T. Minami and K. Shinohara, "Encoding line drawings with multiple grid chain code,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI8, pp. 269276, 1986.
[24] F. Moktarian and A. Mackworth, "Scalebased description and recognition of planar curves and twodimensional shapes,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI8, no. 1, pp. 3443, Jan. 1986.
[25] F. P. Preparata and M. I. Shamos,Computational Geometry, an Introduction. New York: SpringerVerlag, 1985.
[26] G. Reynolds and J. R. Beveridge, "Searching for geometric structures in images of natural scenes," inProc. Image Understanding Workshop, Los Angeles, CA, Feb. 2325, 1987. Los Altos, CA: Morgan Kaufmann, 1987, pp. 257271.
[27] W. Richards, B. Dawson, and D. Whittington, "Encoding contour shape by curvature extrema,"J. Opt. Soc. Amer. A, vol. 3, pp. 1483 1491, 1986.
[28] A. Rosenfeld, "Recognizing unexpected objects: A proposed approach,"Int. J. Pattern Recognition Artificial Intell., vol. 1, pp. 7184, 1987.
[29] P. K. Sahoo, S. Soltani, and A. K. C. Wong, "A survey of thresholding techniques,"Comput. Vision Graphics Image Processing, vol. 41, pp. 233260, 1988.
[30] I. Bhandari, "Attribute focusing: Machineassisted knowledge discovery applied to software production process control," inProc. Workshop Knowledge Discovery in Databases, AAAI Tech. Rep. Series, Rep. No. WF9302, July 1993; also inKnowledge Acquisition, accepted for publication.
[31] A. Treisman, "Preattentive processing in vision,"Comput. Vision, Graphics, Image Processing, vol. 31, pp. 156177, 1985.
[32] D. L. Tuomenoksa, G. B. Adams, H. J. Siegel, and O. R. Mitchell, "A parallel algorithm for contour extraction: Advantages and architectural implications," inProc. IEEE Comput. Soc. Conf. Computer Vision and Pattern Recognition, Washington, DC, June 1923, 1983, pp. 336344.
[33] S. Ullman, "Visual routines,"Cognition, vol. 18, pp. 97159, 1984.