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

• 영문명: A Decomposition Algorithm for Convex Structuring Elements in Morphological Operation
• 발행기관: 한국시뮬레이션학회
• 저자명: 온승엽(Syng-Yup Ohn)
• 간행물 정보: 『한국시뮬레이션학회 논문지』제13권 제1호, 11~23쪽, 전체 13쪽
• 주제분류: 공학 > 기타공학
• 파일형태: PDF
• 발행일자: 2004.03.30

영문 초록

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.

목차

1. 서론

2. 디지털 볼록다각형의 분해

3. 최적 지역 분해

4. 분해 예제

5. 결론

참고문헌

키워드

morphological operation structuring element decomposition optimization