Share Email Print

Proceedings Paper

Automatic programming of binary morphological machines
Author(s): Junior Barrera; Flavio Soares Correa da Silva; Gerald Jean Franc Banon
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

An important aspect of Mathematical Morphology is the description of set operators by a formal language, the Binary Morphological Language, whose vocabulary are dilations, erosions, antidilations, antierosions, union and intersection. This language is complete (i.e. it can represent any set operator) and expressive (i.e. many useful operators can be represented as phrases with relatively few words). Since the sixties special machines, the Binary Morphological Machines (BMMach's), have been built to implement the BML with increasing efficiency. However, designing useful BMMach programs is not an elementary task. Recently, much research effort has been addressed to automating the programming of BMMach's. The goal is to find suitable knowledge representation formalisms to describe operations over geometric structures and to translate them into BMMach programs.

Paper Details

Date Published: 30 June 1994
PDF: 12 pages
Proc. SPIE 2300, Image Algebra and Morphological Image Processing V, (30 June 1994); doi: 10.1117/12.179194
Show Author Affiliations
Junior Barrera, Univ. de Sao Paulo (Brazil)
Flavio Soares Correa da Silva, Univ. de Sao Paulo (Brazil)
Gerald Jean Franc Banon, Instituto Nacional de Pesquisas Espaciais (Brazil)

Published in SPIE Proceedings Vol. 2300:
Image Algebra and Morphological Image Processing V
Edward R. Dougherty; Paul D. Gader; Michel Schmitt, Editor(s)

© SPIE. Terms of Use
Back to Top