Translator Disclaimer
4 April 1997 Recursive binary dilation using digital line-structuring elements in arbitrary orientations
Author Affiliations +
Abstract
Performing morphological operations such as dilation and erosion of binary images, using very long line structuring elements is computationally expensive when performed brute- force following the definitions. In this paper, we present a two-pass algorithm that runs at constant time for obtaining dilations, irrespective of the lengths and orientations of the line structuring elements. We use the concept of orientation error between the continuous line and its discrete counterpart in generating the basic digital line structuring element used in obtaining what we call the dilation transform. To obtain any dilation, we just threshold the dilation transform with a value that is the length of the desired line structuring element. We implemented the algorithm in general image processing system environment on a sun sparc station 10, and tested them on a set of 240 X 250 sized salt and pepper noise images with probability of a pixel being a 1-pixel set to 0.25, for orientations (theta) (epsilon) [ (pi) /2, 3(pi) /2 ] of the normals of the continuous lines, of which the digital line structuring elements are a discretization, and their lengths in the range 5 to 145 pixels. We achieved a speed up of about 50 over the conventional methods when the structuring elements had lengths of 145 pixels. The algorithm ran at a constant time of 200ms. We required only one minimum operation per result pixel.
© (1997) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Desikachari Nadadur, Robert M. Haralick, and Florence H. Sheehan "Recursive binary dilation using digital line-structuring elements in arbitrary orientations", Proc. SPIE 3026, Nonlinear Image Processing VIII, (4 April 1997); https://doi.org/10.1117/12.271112
PROCEEDINGS
11 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT


Back to Top