1 December 2001 Stochastic algorithm for approximating soft morphological operators
Author Affiliations +
Optical Engineering, 40(12), (2001). doi:10.1117/1.1419022
Abstract
A technique that approximates the output of the soft morphological operators is described. The soft operators can be viewed as a voting process across neighborhoods defined by the structuring element. Instead of processing all votes across a neighborhood, this approximation technique randomly samples elements in the neighborhood and uses these values as inputs to a two-state finite state machine, where the state of the machine corresponds to the output at a given pixel. When properly designed, the machines sample a small fraction of the neighborhood, obtain output that is 91 to 100% accurate at each pixel, and is one to two orders of magnitude faster than conventional algorithms. Experiments on binary textures and digits confirm the theoretical results.
Michael A. Zmuda, "Stochastic algorithm for approximating soft morphological operators," Optical Engineering 40(12), (1 December 2001). https://doi.org/10.1117/1.1419022
JOURNAL ARTICLE
7 PAGES


SHARE
RELATED CONTENT

ADA interpretative system for image algebra
Proceedings of SPIE (June 01 1992)
Getting The Most From Your Pipelined Processor
Proceedings of SPIE (March 21 1989)
Three-dimensional mathematical morphology algorithms
Proceedings of SPIE (July 01 1990)

Back to Top