Journal of the Korea Society for Simulation (한국시뮬레이션학회논문지)

The Korea Society for Simulation (한국시뮬레이션학회)
권호 표지

A Decomposition Algorithm for Convex Structuring Elements in Morphological Operation

모폴로지 연산에 사용되는 볼록 구조요소의 분해를 위한 알고리듬

  • 온승엽 (한국 항공대학교 전자 정보통신 컴퓨터 공학부)
  • Published : 2004.03.01
Download PDF
⟨ Previous Next ⟩

Abstract

The decomposition of a structuring element for a morphological operation reduces the amount of the computation required for executing the operation. In this paper, we present a new technique for the decomposition of convex structuring elements for morphological operations. We formulated the linear constraints for the decomposition of a convex polygon in discrete space, then the constraints are applied to the decomposition of a convex structuring element. Also, a cost function is introduced to represent the optimal criteria for decomposition. We use linear integer programming technique to find the combination of basis structuring elements which minimizes the amount of the computation required for executing the morphological operation. Formulating different cost functions for different implementation methods and computer architectures, we can determine the optimal decompositions which guarantee the minimal amounts of computation on different computing environment.

Keywords

References

  1. Random Sets and Integral Geometry G.Matheron
  2. IEEE Trans. on PAMI v.PAMI-9 no.4 Image analysis using mathematical morphology R.M.Harlick;S.R.Sternberg;X.Zhuang
  3. Computer Vision, Graphics and Image Processing v.35 Introduction to mathematicalmorphology J.Serra
  4. Image Analysis and Mathematical Morphology J.Serra
  5. Proceedings of the IEEE v.78 no.4 Morphological systems for multidimensional signal processing P.Maragos;R.W.Schafer
  6. CVGIP v.35 Morphological structuring element decomposition X.Zhuang;R.M.Haralick
  7. IEEE Trans. on PAMI v.PAMI-13 no.2 Decomposition of convex polygonal morphological structuring elements into neighborhood subsets J.Xu
  8. Comput. Biomedical image processing S.R.Sternberg
  9. IEEE Trans. on PAMI v.PAMI-16 no.3 Optimal decomposition of convex morphological structuring elements for 4-connected parallel array processors H.Park;R.T.Chin
  10. IEEE Transactions on Image Processing v.10 no.Issue: 1 Morphological decomposition of 2-D binary shapes into convex polygons: a heuristic algorithm Jianning Xu
  11. Image Processing, 1994. Proceedings. ICIP-94., IEEE International Conference v.2 Morphological decomposition of 2-D binary shapes into conditionally maximal convex polygons Jianning Xu
  12. Vision, Image and Signal Processing, IEE Proceedings- v.144 no.Issue: 3 Rotated texture classification by improved interative morphological decomposition Lam,W.K.;Li.C.K.
  13. Electronics Letters v.32 no.Issue: 6 Scale invariant texture classification by iterative morphological decomposition Lam,W.K.;Li,C.K.
  14. 2001. Proceedings. 2001 International Conference on Image Processing v.1 Hierarchical image segmentation based on contour dynamics image Processing Haris,K.;Efstratiadis,S.;Maglaveras,N.
  15. Computer Surveys v.6 no.1 Computer processing of line drawing images H.Freeman
  16. IEEE Trans. on Computers v.C-29 no.9 Design of a massively parallel processor K.E.Batcher
  17. Discrete Optimization Algorithms M.M.Syslo;N.Deo;J.S.Kowalik