Optimal 3 × 3 decomposable disks for morphological transformations

Maria Vanrell, Jordi Vitrià

    Research output: Contribution to journalArticleResearchpeer-review

    5 Citations (Scopus)

    Abstract

    Morphological operations can be efficiently computed on parallel architectures using the decomposition of the structuring elements. In some cases, decomposition is guided to optimize computation for a given underlying hardware, but in other cases it is the shape of the structuring elements which directs the decomposition. In this paper we present a method to decompose disks. Morphological operations with isotropic structuring elements present interesting properties as shape and size descriptors. The method developed is based on a constraint-satisfaction algorithm that gives an optimal decomposable disk. Optimality is given by the shape of the disk since it is the best discrete approximation of a circle that allows a 3 × 3 decomposition. © 1997 Elsevier Science B.V.
    Original languageEnglish
    Pages (from-to)845-854
    JournalImage and Vision Computing
    Volume15
    Issue number11
    Publication statusPublished - 1 Jan 1997

    Keywords

    • Discrete disk approximation
    • Disk decomposition
    • Mathematical morphology
    • Structuring element

    Fingerprint Dive into the research topics of 'Optimal 3 × 3 decomposable disks for morphological transformations'. Together they form a unique fingerprint.

    Cite this