1 July 1996 Set operations on closed intervals and their applications to the automatic programming of morphological machines
Author Affiliations +
J. of Electronic Imaging, 5(3), (1996). doi:10.1117/12.240717
Abstract
Mathematical morphology on sets can be understood as a formal language, whose vocabulary comprises erosions, dilations, complementation, intersection and union. This language is complete, that is, it is enough to perform any set operation. Since the sixties special machines, called morphological machines (MMachs), have been built to implement this language. In the literature, we find hundreds of MMach programs that are used to solve image analysis problems. However, the design of these programs is not an elementary task. Thus, recently much research effort has been addressed to automating the programming of MMachs. A very promising approach to this problem is the description of the target operator by input-output pairs of images and the translation of these data into efficient MMach programs. This approach can be decomposed into two equally important steps: (1) learning of the target operator from pairs of images; (2) search for economical representations for the operators learned. The theory presented in this paper is useful in the second step of this procedure. We present some set operations on collections of closed intervals and give efficient algorithms to perform them. These operations are used to parallelize MMach programs and to prove the equivalence between distinct MMach programs.
Junior Barrera, Guillermo Pablo Salas, "Set operations on closed intervals and their applications to the automatic programming of morphological machines," Journal of Electronic Imaging 5(3), (1 July 1996). https://doi.org/10.1117/12.240717
JOURNAL ARTICLE
18 PAGES


SHARE
RELATED CONTENT

Automatic programming of binary morphological machines
Proceedings of SPIE (June 30 1994)
Sublinear constant multiplication algorithms
Proceedings of SPIE (August 25 2006)
Edge detection based on dynamic morphology
Proceedings of SPIE (November 03 2005)
Fixed binary linear quadtree coding scheme for spatial data
Proceedings of SPIE (September 16 1994)
New trends in morphological algorithms
Proceedings of SPIE (April 01 1991)
High Speed Robot Vision Using Specialized Hardware
Proceedings of SPIE (January 17 1985)

Back to Top