• DocumentCode
    2423344
  • Title

    A parallel shape coding on SIMD architecture

  • Author

    Wójcik, Zbigniew

  • Author_Institution
    Div. of Math., Comput. Sci. & Stat., Texas Univ., San Antonio, TX, USA
  • fYear
    1989
  • fDate
    23-25 Oct 1989
  • Firstpage
    534
  • Lastpage
    540
  • Abstract
    A parallel shape analysis by simultaneous merging of elementary features detected through calculation of the number of objects within neighboring windows is presented. The parallel algorithm can be embedded on a SIMD (single-instruction, multiple-data) mesh architecture. Elementary image features are detected inside partly overlapping windows fixed in an image plane. Each window content is processed by a separate processing element (PE). Two neighboring elementary feature elements are merged by adjacent PEs, and the joined feature chunks are merged in the next step by every 22th PE possessing the same feature. Feature ends are propagated through 2n PEs in each nth parallel step toward opposite edges of the mesh array of PEs. The shape coding is completed if all the feature limits (e.g. edges) meet together on one PE. The approach has the property of mapping an image fragment directly into words and phrases
  • Keywords
    computerised pattern recognition; parallel algorithms; parallel architectures; SIMD architecture; edges; feature and propagation; feature limits; feature merging; mesh architecture; neighboring windows; parallel algorithm; partly overlapping windows; processing element; shape analysis; shape coding; Broadcasting; Computer architecture; Computer science; Computer vision; Labeling; Mathematics; Merging; Object detection; Shape; Statistics;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Tools for Artificial Intelligence, 1989. Architectures, Languages and Algorithms, IEEE International Workshop on
  • Conference_Location
    Fairfax, VA
  • Print_ISBN
    0-8186-1984-8
  • Type

    conf

  • DOI
    10.1109/TAI.1989.65364
  • Filename
    65364