Advertisement

Neighborhood Decomposition of 3D Convex Structuring Elements for Morphological Operations

  • Syng-Yup Ohn
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3691)

Abstract

Morphological operations with 3D images require a huge amount of computation. The decomposition of structuring elements used in the morphological operations such as dilation and erosion greatly reduces the amount of computation. This paper presents a new method for the decomposition of a 3D convex structuring element into a set of neighborhood structuring elements. A neighborhood structuring element is a convex structuring element consisting of a subset of a set consisting of the origin voxel and its 26 neighborhood voxels. First, we derive the set of decomposition conditions on the lengths of the original and the basis convex structuring elements, and then the decomposition problem is converted to linear integer optimization problem. The objective of the optimization is to minimize a cost function representing the optimal criterion for the implementation of morphological operations. Thus, our method can be used to obtain the different optimal decompositions minimizing the amount of computation in different cases.

Keywords

mathematical morphology dilation erosion structuring element decomposition convex polyhedron 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Serra, J.: Introduction to Mathematical Morphology. Computer Vision, Graphics and Image Processing 35, 285–305 (1986)CrossRefGoogle Scholar
  2. 2.
    Serra, J.: Image Analysis and Mathematical Morphology. Academic Press, London (1982)zbMATHGoogle Scholar
  3. 3.
    Haralick, R.M., Sternberg, S.R., Zhuang, X.: Image Analysis Using Mathematical Morphology. IEEE Trans. on PAMI 9, 532–550 (1987)Google Scholar
  4. 4.
    Zhuang, X., Haralick, R.M.: Morphological Structuring Element Decomposition. Computer Vision. Graphics and Image Processing 35, 370–382 (1986)CrossRefGoogle Scholar
  5. 5.
    Dadda, L.: Parallel algorithms and architectures for CPUs and dedicated processors: development and trends Algorithms and Architectures for Parallel Processing. In: ICAPP 1995, vol. 2, pp. 939–948 (1995)Google Scholar
  6. 6.
    Svolos, A.I., Konstantopoulos, C.G., Kaklamanis, C.: Efficient Binary Morphological Algorithms on a Massively Parallel Processor. In: Proceedings of International Parallel and Distributed Processing Symposium 2000, pp. 281–286 (2000)Google Scholar
  7. 7.
    York, G., Managuli, R., Kim, Y.: Fast Binary and Grayscale Mathematical Morphology on VLIW. In: Proc. of SPIE: Real-Time Imaging IV, pp. 45–55 (1999)Google Scholar
  8. 8.
    Levialdi, S.: Computer Architectures for Image Analysis. In: 9th International Conference on Pattern Recognition, vol. 2, pp. 1148–1158 (1988)Google Scholar
  9. 9.
    Xu, J.: Decomposition of Convex Polygonal Morphological Structuring Elements into Neighborhood Subsets. IEEE Trans. on PAMI 13, 153–162 (1991)Google Scholar
  10. 10.
    Park, H., Chin, R.T.: Optimal Decomposition of Convex Morphological Structuring Elements for 4-connected Parallel Array Processors. IEEE Trans. on PAMI 16, 304–313 (1994)zbMATHGoogle Scholar
  11. 11.
    Aykac, D., Hoffman, E.A., McLennan, G., Reinhardt, J.M.: Segmentation and analysis of the human airway tree from three-dimensional X-ray CT images. IEEE Transactions on Medical Imaging 22, 940–950 (2003)CrossRefGoogle Scholar
  12. 12.
    Syslo, M.M., Deo, N., Kowalik, J.S.: Discrete Optimization Algorithms. Prentice Hall, Englewood Cliffs (1983)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Syng-Yup Ohn
    • 1
  1. 1.Department of Computer and Information EngineeringHankook Aviation UniversitySeoulKorea

Personalised recommendations