Parallel algorithms for contour extraction and coding

Its'hak Dinstein, Gad M. Landau

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A parallel approach to contour extraction and coding on an Exclusive Read Exclusive Write (EREW) Parallel Random Access Machine (PRAM) is presented and analyzed. The algorithm is intended for binary images. The labeled contours can be represented by lists of coordinates, and/or chain codes, and/or any other user designed codes. Using O(n2/log n) processors, the algorithm runs in O(logn) time, where n by n is the size of the processed binary image.

Original languageEnglish
Title of host publicationProceedings of SPIE - The International Society for Optical Engineering
EditorsJoydeep Ghosh, G.Colin Harrison
PublisherPubl by Int Soc for Optical Engineering
Pages156-161
Number of pages6
ISBN (Print)0819402931
StatePublished - 1990
Externally publishedYes
EventParallel Architectures for Image Processing - Santa Clara, CA, USA
Duration: 14 Feb 199015 Feb 1990

Publication series

NameProceedings of SPIE - The International Society for Optical Engineering
Volume1246
ISSN (Print)0277-786X

Conference

ConferenceParallel Architectures for Image Processing
CitySanta Clara, CA, USA
Period14/02/9015/02/90

Bibliographical note

Funding Information:
This work was supported in part by the New York State Science & Technology Foundation, Center for Advanced Technology in Communications, Polytechnic University, Brooklyn, NY. * On leave from Ben-Gurion University, Beer Sheva, Israel. ** Partially supported by NSF Grant CCR-8908286.

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Parallel algorithms for contour extraction and coding'. Together they form a unique fingerprint.

Cite this