par Ronse, Christian 
;Macq, Benoît
Référence Signal processing, 25, 1, page (91-105)
Publication Publié, 1991
;Macq, BenoîtRéférence Signal processing, 25, 1, page (91-105)
Publication Publié, 1991
Article révisé par les pairs
| Résumé : | A new algorithm for multiscale description of binary digital regions is given. A region is represented by a growing sequence of subsets approximating it; each approximation is obtained from the previous one by addition of the opening by a structuring element chosen in a finite family. The structuring elements vary in size and shape, and are chosen at each step according to two criteria: largest structuring element size and greatest increment in the size of the approximation. The algorithm satisfies meaningful algebraic properties and converges to a final result in a bounded number of steps. It also allows an economical representation of shape in terms of structuring elements, and so it can be applied in binary image coding. © 1991. |
