This Article 
 Bibliographic References 
 Add to: 
Efficient Algorithms for the Soft Morphological Operators
November 1996 (vol. 18 no. 11)
pp. 1142-1147

Abstract—This correspondence presents two soft morphological algorithms that process multiple images simultaneously. The first algorithm performs best when the structuring elements contain less than 19 points; whereas, the second algorithm should be used for larger structuring elements. Theoretical and experimental analyses show these algorithms are faster than the conventional algorithm.

[1] E. Dougherty, An Introduction to Morphological Image Processing.Bellingham, Wash.: SPIE, 1992.
[2] R.M. Haralick,S.R. Sternberg,, and X. Zhuang,“Image analysis using mathematical morphology,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 9, no. 4, pp. 532-550, July 1988.
[3] J. Serra, Image Analysis and Mathematical Morphology.London: Academic Press, 1982.
[4] K. Preston, "Xi Filters," IEEE Trans. Acoustics, Speech, and Signal Processing, vol. 31, no. 4, pp. 861-876, 1983.
[5] S. Wilson, “Vector Morphology and Iconic Neural Networks,” IEEE Trans. Systems, Man, and Cybernetics, vol. 19, no. 6, pp. 1636-1644, 1989.
[6] L. Koskinen, J. Astola, and Y. Neuvo, "Soft Morphological Filters," SPIE Image Algebra and Morphological Image Processing II, pp. 262-270, 1991.
[7] M. Zmuda, L. Tamburino, and M. Rizki, "Efficient Software Techniques for Morphological Image Processing With Desktop Computers," SPIE Data Structures and Target Classification, pp. 183-189, 1991.
[8] G. Brassard and P. Brately, Algorithmics.Englewood Cliffs, N.J.: Prentice Hall, 1988.
[9] R. Sedgewick,Algorithms. Reading, MA: Addison-Wesley, 1983.
[10] R. L. Graham, D. E. Knuth, and O. Patashnik,Concrete Mathematics. Reading, MA: Addison-Wesley, 1989.

Index Terms:
Mathematical morphology, soft morphology, image processing algorithms, efficient algorithms.
Michael A. Zmuda, Louis A. Tamburino, "Efficient Algorithms for the Soft Morphological Operators," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 18, no. 11, pp. 1142-1147, Nov. 1996, doi:10.1109/34.544086
Usage of this product signifies your acceptance of the Terms of Use.