
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
R. Jones, I. Svalbe, "Algorithms for the Decomposition of GrayScale Morphological Operations," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 16, no. 6, pp. 581588, June, 1994.  
BibTex  x  
@article{ 10.1109/34.295903, author = {R. Jones and I. Svalbe}, title = {Algorithms for the Decomposition of GrayScale Morphological Operations}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {16}, number = {6}, issn = {01628828}, year = {1994}, pages = {581588}, doi = {http://doi.ieeecomputersociety.org/10.1109/34.295903}, 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  Algorithms for the Decomposition of GrayScale Morphological Operations IS  6 SN  01628828 SP581 EP588 EPD  581588 A1  R. Jones, A1  I. Svalbe, PY  1994 KW  image processing; mathematical morphology; filtering and prediction theory; decomposition; gray scale morphological operations; structuring elements; image processing; mathematical morthology; data level description; morphological filters VL  16 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
The choice and detailed design of structuring elements plays a pivotal role in the morphologic processing of images. A broad class of morphological operations can be expressed as an equivalent supremum of erosions by a minimal set of basis filters. Diverse morphological operations can then be expressed in a single, comparable framework. The set of basis filters are datalike structures, each filter representing one type of local change possible under that operation. The datalevel description of the basis set is a natural starting point for the design of morphological filters. This paper promotes the use of the basis decomposition of grayscale morphological operations to design and apply morphological filters. A constructive proof is given for the basis decomposition of general grayscale morphological operations, as are practical algorithms to find all of the basis set members for these operations.
[1] R.M. Haralick, S.R. Sternberg, and X. Zhuang, "Image analysis using mathematical morphology,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI9, no. 4, pp. 532550, 1987.
[2] J. Serra,Image Analysis and Mathematical Morphology. Vol. 2: Theoretical Advances. New York: Academic, 1988.
[3] H.J.A.M. Heijmans and C. Ronse, "The algebraic basis of mathematical morphology. Part I: Dilations and erosions,"Comput. Vision, Graphics, Image Processing, vol. 50, pp. 245295, 1990.
[4] H. Heijmans, "Theoretical aspects of graylevel morphology,"IEEE Pattern Anal. Machine Intell., vol. 13, no. 6, pp. 568582, June 1991.
[5] G. Matheron,Random Sets and Integral Geometry. New York: Wiley, 1975.
[6] P. Maragos, "A representation theory for morphological image and signal processing,"IEEE Trans. Pattern Anal. Machine Intell., vol. 11, no. 6, pp. 586599, June 1989.
[7] C. R. Giardina and E. R. Dougherty,Morphological Methods in Image and Signal Processing. Englewood Cliffs, N.J.: PrenticeHall, 1988.
[8] P. A. Maragos and R. W. Schafer, "Morphological filtersPart I: Their settheoretic analysis and relations to linear shiftinvariant filters,"IEEE Trans. Acoustics, Speech, Signal Processing, vol. ASSP 35, pp. 11531169, 1987.
[9] I. D. Svalbe, "The geometry of basis sets for morphologic closing,"IEEE Trans. Pattern Anal. Machine Intell., vol. 13, no. 12, pp. 12141224, Dec. 1991.
[10] F. Shih and O. R. Mitchel, "Decomposition of grayscale morphological structuring elements,"Pattern Recogn., vol. 24, no. 3, pp. 195203, 1991.
[11] P. D. Gader, "Separable decompositions and approximations of greyscale morphological templates,"Comput. Vision, Graphics, Image Processing: Image Understanding, vol. 53, no. 3, pp. 288296, May 1991.
[12] 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. 308328, June 1990.
[13] R. L. Stevenson and G. R. Arce, "Morphological filters: Statistics and further syntactic properties,"IEEE Trans. Circuits Systems, vol. CAS34, no. 11, pp. 12921305, Nov. 1987.
[14] 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. 123129, 1992.
[15] R. Jones and I. Svalbe, "Morphological filtering as template matching," to be published inIEEE Trans. Pattern Anal. Machine Intell., vol. 16, no. 4, pp. 438443, Apr. 1994.
[16] E. R. Dougherty and R. Loce, "Efficient design strategies for the optimal binary digital morphological filter: Probabilities, constraints, and structuring element libraries,"Mathematical Morphology in Image Processing, E. Dougherty, Ed. New York: Marcel Dekker, 1992.
[17] G. J. F. Banon and J. Barrera, "Minimal representations of translationinvariant set mappings by mathematical morphology,"SIAM J. Appl. Math., vol. 51, no. 6, Dec. 1991.
[18] G. J. F. Banon and J. Barrera, "A decomposition theorem in mathematical morphology," inProc. Int. Workshop on Mathematical Morphol., Barcelona, Spain, May 1993.
[19] M. Khosravi and R. W. Schafer, "A finite maxmin representation for ILTI filters,"Proc. Int. Workshop on Mathematical Morphol., Barcelona, Spain, May 1993.
[20] C. Ronse and H.J.A.M. Heijmans, "The algebraic basis of mathematical morphology. Part II: Openings and closings,"Comput. Vision, Graphics, Image Processing: Image Understanding, 1991, to be published.
[21] 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. 175181, 1992.