|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| R. Jones, I. Svalbe, "Morphological Filtering as Template Matching," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 16, no. 4, pp. 438-443, April, 1994. | |||
| BibTex | x | ||
| @article{ 10.1109/34.277599, author = {R. Jones and I. Svalbe}, title = {Morphological Filtering as Template Matching}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {16}, number = {4}, issn = {0162-8828}, year = {1994}, pages = {438-443}, doi = {http://doi.ieeecomputersociety.org/10.1109/34.277599}, 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 - Morphological Filtering as Template Matching IS - 4 SN - 0162-8828 SP438 EP443 EPD - 438-443 A1 - R. Jones, A1 - I. Svalbe, PY - 1994 KW - mathematical morphology; pipeline processing; pattern recognition; filtering and prediction theory; table lookup; morphological filtering; template matching; lookup table; binary morphology; pipeline processing; image processing VL - 16 JA - IEEE Transactions on Pattern Analysis and Machine Intelligence ER - | |||
Binary morphological operations with single and multiple structuring elements are implemented using look-up table (LUT) driven templates. Many complex operations can be implemented in one pipeline processing cycle for 3*3 regions of support and in four or five cycles for 5*5 regions of support. The basis representation of the operations is used to specify the required templates.
[1] J. Serra,Image Analysis and Mathematical Morphology(vol. I) andTheoretical Advances(vol. II). New York: Academic, 1982 and 1988.
[2] R.M. Haralick, S.R. Sternberg, and X. Zhuang, "Image analysis using mathematical morphology,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-9, no. 4, pp. 532-550, 1987.
[3] G. Matheron,Random Sets and Integral Geometry. New York: Wiley, 1975.
[4] P. Maragos, "A representation theory for morphological image and signal processing,"IEEE Trans. Pattern Anal. Machine Intell., vol. 11, no. 6, pp. 586-599, June 1989.
[5] I. D. Svalbe, "The geometry of basis sets for morphologic closure,"IEEE Trans. Pattern Anal. Machine Intell., vol. 13, no. 12, pp. 1214-1224, Dec. 1991.
[6] I. Svalbe and R. Jones, "The design of morphologic filters using multiple structuring elements. Part I: Openings and closings,"Pattern Recogn. Lett., vol. 13, pp. 123-129, 1992.
[7] R. Jones and I. Svalbe, "The design of morphologic filters using multiple structuring elements. Part II: Open(close) and close(open),"Pattern Recogn. Lett., vol. 13, pp. 175-181, 1992.
[8] R. Jones and I. Svalbe, "Algorithms for the decomposition of gray-scale morphological operations,"IEEE Trans. Pattern Anal. Machine Intell., to appear.
[9] T. R. Crimmins and W. R. Brown, "Image algebra and automatic shape recognition,"IEEE Trans. Aerosp. Electron. Syst., vol. AES-21, pp. 60-69, 1985.
[10] J. Song and E. J. Delp, "The analysis of morphological filters with multiple structuring elements,"Comp. Vision Graphics Image Processing, vol. 50, no. 3, pp. 308-328, June 1990.
[11] P. Wellset al., "Automated feature extraction from tomographic images of wood," inProc. DICTA-91, Melbourne, pp. 186-193, 1991.
[12] I. Svalbe, "Natural representations for straight lines and the Hough transform on discrete arrays,"IEEE Trans. Pattern Anal. Machine Intell., vol. 11, no. 9, pp. 941-950, Sept. 1989.