Fast binary dilation/erosion algorithm using kernel subdivision

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3852 LNCS, Issue , 2006, Pages 335-342

  Narayanan, Ajay ^a  

^a GE GLOBAL RESEARCH   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONTOUR MEASUREMENT; IMAGE ANALYSIS; OBJECT RECOGNITION; STATISTICAL METHODS;

EXECUTION TIME; KERNEL SUB-DIVISION ALGORITHM; N-DIMENSIONAL STRUCTURING ELEMENT; OBJECT CONTOURS;

ALGORITHMS;

EID: 33744932413     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11612704_34     Document Type: Conference Paper

References (5)

1. Desikachari Nadadur and Robert M. Haralick, Fellow, IEEE, "Recursive Binary Dilation and Erosion Using Digital Line Structuring Elements in Arbitrary Orientations." IEEE Transactions on Image Processing, Vol. 9, No. 5, MAY 2000.
2. Cuisenaire, O. (Universite Catholique de Louvain); Macq, B. "Fast Euclidean morphological operators using local distance transformation by propagation, and applications", IEEE Conference Publication, v 2, n 465, p 856-860, 1999.
3. P. Soille, E. J. Breen, and R. Jones, "Recursive implementation of erosions and dilations along discrete lines at arbitrary angles," IEEE Trans. Pattern Anal. Machine Intell., vol. 18, pp. 562-567, May 1996.
4. I. Ragnemalm, "Fast erosion and dilation by contour processing and thresholding of distance maps," Pattern Recognit. Let., vol. 13, pp. 161-166, 1985.
5. Parker, J.R. (Univ of Calgary), "System for fast erosion and dilation of bi-level images", Journal of Scientific Computing v5, n 3, p 187-198, Sep, 1990.