We present a new technique for the decomposition of convex structuring elements for morphological image processing. A unique feature of our approach is the use of linear integer programming technique to determine optimal decompositions for different parallel machine architectures. This technique is based on Shephard's theorem for decomposing Euclidean convex polygons. We formulated the necessary and sufficient conditions to decompose a Euclidean convex polygon into a set of basis convex polygons. We used a set of linear equations to represent the relationships between the edges and the positions of the original convex polygon and those of the basis convex polygons. This is applied to a class of discrete convex polygons in the discrete space. Further, a cost function was used to represent the total processing time for performing dilations on different machine architectures. Then integer programming was used to solve the linear equations based on the cost function. Our technique is general and flexible, so that different cost functions could be used, thus achieving optimal decompositions for different parallel machine architectures.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Morphological decomposition of convex polytopes and its application in discrete image space


    Contributors:
    Syng-Yup Ohn (author) / Wong, E.K. (author)


    Publication date :

    1994-01-01


    Size :

    429494 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Morphological Decomposition of Convex Polytopes and its Application in Discrete Image Space

    Ohn, S. Y. / Wong, E. K. / IEEE; Signal Processing Society | British Library Conference Proceedings | 1994


    Approximating Robot Reachable Space Using Convex Polytopes

    Skuric, Antun / Padois, Vincent / Daney, David | Springer Verlag | 2023


    Tunnel-MILP: Path Planning with Sequential Convex Polytopes

    Vitus, Michael / Pradeep, Vijay / Hoffmann, Gabriel et al. | AIAA | 2008


    Tunnel-MILP: Path Planning with Sequential Convex Polytopes

    Vitus, M. / Pradeep, V. / Hoffmann, G. et al. | British Library Conference Proceedings | 2008