1 November 1994 Efficient implementation of binary morphological image processing
Author Affiliations +
Abstract
Morphological image processing is an important tool for a broad range of problems in image processing. A 512-entry table lookup method is used for real-time implementation. But it is not efficient to transfer this method directly into software. The author proposes a fast software implementation technique, in which a 256-entry lookup table containing neighborhood information is built and a dynamic table lookup process is applied to reduce the number of logical matching operations and the number of accesses of the neighboring pixels. In this proposed method only the foreground pixels, which are pixels on the object, are processed. Among the foreground pixels, only at the starting pixel of each "run" of l's is it necessary to read the eight neighboring pixels. For the other pixels, it is necessary to read only three neighbors. This method shows a significant improvement in timesaving. In addition, for systems supporting fast access to consecutive address memory, the author proposes another implementation, which treats the image as a contiguous block of memory. Thus advantage is taken of RAM technology.
Brian K. Lien, Brian K. Lien, } "Efficient implementation of binary morphological image processing," Optical Engineering 33(11), (1 November 1994). https://doi.org/10.1117/12.183388 . Submission:
JOURNAL ARTICLE
6 PAGES


SHARE
RELATED CONTENT

A digital monocompilation system
Proceedings of SPIE (July 31 1990)
Image Processing With An Array Processor
Proceedings of SPIE (October 25 1983)
Detection of text strings from mixed text/graphics images
Proceedings of SPIE (December 20 2000)
System for line drawings interpretation
Proceedings of SPIE (July 31 1992)

Back to Top