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

Syng Yup Ohn, Edward Wong

    Research output: Contribution to journalArticle

    Abstract

    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.

    Original languageEnglish (US)
    Article number413633
    Pages (from-to)560-564
    Number of pages5
    JournalProceedings - International Conference on Image Processing, ICIP
    Volume2
    DOIs
    StatePublished - 1994

    Fingerprint

    Cost functions
    Integer programming
    Linear equations
    Decomposition
    Image processing
    Processing

    ASJC Scopus subject areas

    • Software
    • Computer Vision and Pattern Recognition
    • Signal Processing

    Cite this

    Morphological decomposition of convex polytopes and its application in discrete image space. / Ohn, Syng Yup; Wong, Edward.

    In: Proceedings - International Conference on Image Processing, ICIP, Vol. 2, 413633, 1994, p. 560-564.

    Research output: Contribution to journalArticle

    @article{83ae19ffdfb54bf394659e0bf5a7f203,
    title = "Morphological decomposition of convex polytopes and its application in discrete image space",
    abstract = "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.",
    author = "Ohn, {Syng Yup} and Edward Wong",
    year = "1994",
    doi = "10.1109/ICIP.1994.413633",
    language = "English (US)",
    volume = "2",
    pages = "560--564",
    journal = "Proceedings - International Conference on Image Processing, ICIP",
    issn = "1522-4880",

    }

    TY - JOUR

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

    AU - Ohn, Syng Yup

    AU - Wong, Edward

    PY - 1994

    Y1 - 1994

    N2 - 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.

    AB - 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.

    UR - http://www.scopus.com/inward/record.url?scp=84997189944&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84997189944&partnerID=8YFLogxK

    U2 - 10.1109/ICIP.1994.413633

    DO - 10.1109/ICIP.1994.413633

    M3 - Article

    AN - SCOPUS:84997189944

    VL - 2

    SP - 560

    EP - 564

    JO - Proceedings - International Conference on Image Processing, ICIP

    JF - Proceedings - International Conference on Image Processing, ICIP

    SN - 1522-4880

    M1 - 413633

    ER -