Special Feature

User Panel

My Panel

My Panel

Bookmark Science Articles

Recent News
Bookmark / Share This Science Site

Morphological decomposition of 2-D binary shapes into convex polygons: a heuristic algorithm.

Morphological decomposition of 2-D binary shapes into convex polygons: a heuristic algorithm. Research Abstract Details 

Research Abstract Table of Contents

Jump to the:

  • Abstract Text of This Paper
  • Journal Published
  • MeSH Keywords of This Abstract
  • Chemicals and Substances Used in this Paper
  • Grants and Granting Agency of this Research
  • Database Accession Numbers Used in this Paper
  • Related Papers
  • Related Research Tags
  • Rate this Research Paper
  • Morphological decomposition of 2-D binary shapes into convex polygons: a heuristic algorithm. Abstract Text:

    j xuJ Xu,

    In many morphological shape decomposition algorithms, either a shape can only be decomposed into shape components of extremely simple forms or a time consuming search process is employed to determine a decomposition. In this paper, we present a morphological shape decomposition algorithm that decomposes a two-dimensional (2-D) binary shape into a collection of convex polygonal components. A single convex polygonal approximation for a given image is first identified. This first component is determined incrementally by selecting a sequence of basic shape primitives. These shape primitives are chosen based on shape information extracted from the given shape at different scale levels. Additional shape components are identified recursively from the difference image between the given image and the first component. Simple operations are used to repair certain concavities caused by the set difference operation. The resulting hierarchical structure provides descriptions for the given shape at different detail levels. The experiments show that the decomposition results produced by the algorithm seem to be in good agreement with the natural structures of the given shapes. The computational cost of the algorithm is significantly lower than that of an earlier search-based convex decomposition algorithm. Compared to nonconvex decomposition algorithms, our algorithm allows accurate approximations for the given shapes at low coding costs.

    Morphological decomposition of 2-D binary shapes into convex polygons: a heuristic algorithm. Publishing Authors By Initials

    j xuJ Xu,

    For similar abstracts research abstracts see: abstracts research

    PUBMED ID PMID:

    MEDLINE DATE:

    Morphological decomposition of 2-D binary shapes into convex polygons: a heuristic algorithm. Journal Published:

    PUBLICATION TYPE: Journal Article

    Journal: IEEE transactions on image processing : a publicat

    VOLUME: 10

    Page Numbers: 61-71

    Journal Abbreviation:

    ISSN: 1057-7149

    DAY: 5

    MONTH: 02

    YEAR: 2001

    Morphological decomposition of 2-D binary shapes into convex polygons: a heuristic algorithm. Information

    Number of References:

    LANGUAGE: eng

    NlmUniqueID: 9886191

    Morphological decomposition of 2-D binary shapes into convex polygons: a heuristic algorithm. Keywords Mesh Terms:

    KEYWORDS:

    MESH TERMS:

    Chemical & Substance for Abstract: Morphological decomposition of 2-D binary shapes into convex polygons: a heuristic algorithm. Information

    Substance Name:

    Registry Number:

    Grant and Affiliation Information for Morphological decomposition of 2-D binary shapes into convex polygons: a heuristic algorithm.

    AFFILIATION: Dept. of Comput. Sci., Rowan Univ., Glassboro, NJ.

    Country: United States

    United States Research PublicationUnited States Research Publication

    AGENCY:

    GRANT:

    ACRONYM:

    MEDLINETA: IEEE Trans Image Process

    REFSOURCE:

    DATABASENAME:

    ACCESSION NUMBER:

    Number Hits: 0

    Morphological decomposition of 2-D binary shapes into convex polygons: a heuristic algorithm Related Publications

     

    Molecular Station USER Menu

    Welcome to Molecular Station!

    You have to register before you can post on our forums or use our advanced features. Register Now! Its Free and Fast!

    Already registered? Login now below.

    User Name:

    Password:

    Already registered and Forgot your password? Click below to recover it.

    Recover Lost Password

    Join now - it's fast and free!

    Molecular Station is THE largest network of researchers, scientists and science lovers anywhere!

    Research Terms of Usage and Disclaimer
    Home
    Features

    Protocols

    DNA Forum

    Science Forum

    DNA Forum
    Biology Forum

    Science News


    [CaRP] XML error: Invalid document end at line 2

    For more click here:Science News