A New Optimization Algorithm for Dilation and Erosion

• Autorzy: Yin K.
• Języki publikacji: EN

Abstrakty

EN

Effectively optimizing dilation and erosion is an extensively studied but not completely resolved problem. In this paper, a new optimization algorithm is proposed to improve the efficiency of dilation and erosion. Four notions are given to define the edges for any simply connected structuring element (SE). An assistant algorithm is proposed to detect these edges. Based on these notions, three iteration equations can be derived, which redefine dilation and erosion as iteration calculation. Time complexity of the new algorithm is reduced to O(n³). In addition, the new algorithm is suitable for online applications without the decomposition of SE. Simulation shows that with the same parameters, the performance of the new algorithm is better than that of Yang's algorithm.

Słowa kluczowe

EN

dilation; erosion; optimization; iteration algorithm; time complexity analysis

• Wydawca: Społeczna Akademia Nauk w Łodzi
• Czasopismo: Journal of Applied Computer Science Methods
• Rocznik: 2011
• Tom: Vol. 3 No. 1
• Strony: 5--16
• Opis fizyczny: Bibliogr. 16 poz., rys.

Twórcy

autor

Yin K.

• Machine Intelligence Laboratory College of Computer Science, Sichuan University Chengdu 610065, P.R. China

Bibliografia

• 1. I. Pitas and A. N. Venetsanpoulos, Jan.1990, Morphological shape decomposition, IEEE Trans. Pattern Anal. Machine Intell., Vol. 12, No. 1, pp. 38-45.
• 2. R. M. Haralick, S. R. Stemberg, and X. Zhuang, July 1987, Image analysis using mathematical morphology, IEEE Trans. Pattern Anal. Machine Intell., Vol. 9, No. 4, pp. 532-550.
• 3 X. Zhuang and R. M. Haralick, Sept. 1986, Morphological structuring element decomposition, Computer Vision, Graphics, Image Processing, Vol. 35, pp. 370-382.
• 4. J. Xu, Feb. 1991, Decomposition of convex polygonal morphological structuring elements into neighborhood subsets, IEEE Trans. Pattern Anal. Machine Intell., Vol. 13, No. 2, pp. 153-162.
• 5. H. Park and R. T. Chin, Mar. 1994, Optimal decomposition of convex morphological structuring elements for 4-connected parallel array processors, IEEE Trans. Pattern Anal. Machine Intell., Vol. 16, No. 3, pp. 304-313.
• 6. D. Li and G. X. Ritter, 1990, Decomposition of separable and symmetric convex templates, Image Algebra and Morphological Image Processing, P. D. Gader, ed., Proc. SPIE 1350, pp. 408-418.
• 7. R. F. Hashimoto, J. Barrera, and C.E. Ferreira, August 2000, A combinatorial optimization technique for the sequential decomposition of erosions and dilations, Journal of Mathematical Imaging and Vision, Vol. 13, No. 1, pp. 17-33.
• 8. X. Zhuang, Jan. 1994, Decomposition of morphological structuring elements, Journal of Mathematical Imaging and Vision, Vol. 4, No. 1, pp. 5-18.
• 9. T. Kanungo, R. M. Haralick, and X. Zhuang, 1990, B-code dilation and structuring element decomposition for restricted convex shapes, Image Algebra and Morphological Image Processing, P. D. Gader, ed., Proc. SPIE 1350, pp. 419-429.
• 10. P. M. Pardalos, P. Sussner, and G. X. Ritter, June 1997, On integer programming approaches for morphological template decomposition problems in computer vision, Journal of Combinatorial Optimization, Vol. 1, No. 2, pp. 165-178.
• 11. H. Park and R. T. Chin, Jan. 1995, Decomposition of arbitrarily shaped morphological structuring elements, IEEE Trans. Pattern Anal. Machine Intell., Vol. 17, No. 1, pp. 2-15.
• 12. S. Y. Ohn, 2005, Decomposition of 3D Convex Structuring Element in Morphological Operation for Parallel Processing Architectures, Image analysis and recognition, Springer, ICIAR 2005, pp. 676-685.
• 13. S. Y. Ohn, 2006, Neighborhood decomposition of convex structuring elements for mathematical morphology on hexagonal grid, Computer and Information Sciences, Springer, ISCIS 2006, pp. 511-521.
• 14. K. Yang, L. B. Zeng, and D. C. Wang, Dec. 2005, A Fast Arithmetic for the Erosion and Dilation Operations of Mathematical Morphology, Computer engineering and application, Vol. 41, No. 34, pp. 54-56.
• 15. G. Anelli, A. Broggi, and G. Destri, Feb. 1998, Decomposition of arbitrarily shaped binary morphological structruing elements using genetic algorithm, IEEE Trans. Pattern Anal. Machine Intell., Vol.20, No.2, pp. 217-224.
• 16. R. F. Hashimoto and J. Barrera, Jan. 2002, A note on Park and Chin's algorithm, IEEE Trans. Pattern Anal. Machine Intell., Vol.24, No.1, pp. 139-144.