Parallel algorithms for contour extraction and coding on an EREW PRAM computer

Its'hak Dinstein; Gad M. Landau

doi:10.1016/0167-8655(90)90118-L

Parallel algorithms for contour extraction and coding on an EREW PRAM computer

Research output: Contribution to journal › Article › peer-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(n²/logn) processors, the algorithm runs in O(logn) time, where, n by n is the size of the processed binary image.

Original language	English
Pages (from-to)	87-93
Number of pages	7
Journal	Pattern Recognition Letters
Volume	11
Issue number	2
DOIs	https://doi.org/10.1016/0167-8655(90)90118-L
State	Published - Feb 1990
Externally published	Yes

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.

Keywords

Image contour analysis
image shape analysis
parallel algorithms

ASJC Scopus subject areas

Software
Signal Processing
Computer Vision and Pattern Recognition
Artificial Intelligence

Access to Document

10.1016/0167-8655(90)90118-L

Cite this

@article{332f45721f1a42a0af6811d13623e638,

title = "Parallel algorithms for contour extraction and coding on an EREW PRAM computer",

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/logn) processors, the algorithm runs in O(logn) time, where, n by n is the size of the processed binary image.",

keywords = "Image contour analysis, image shape analysis, parallel algorithms",

author = "Its'hak Dinstein and Landau, {Gad M.}",

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.",

year = "1990",

month = feb,

doi = "10.1016/0167-8655(90)90118-L",

language = "English",

volume = "11",

pages = "87--93",

journal = "Pattern Recognition Letters",

issn = "0167-8655",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - Parallel algorithms for contour extraction and coding on an EREW PRAM computer

AU - Dinstein, Its'hak

AU - Landau, Gad M.

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

PY - 1990/2

Y1 - 1990/2

N2 - 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/logn) processors, the algorithm runs in O(logn) time, where, n by n is the size of the processed binary image.

AB - 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/logn) processors, the algorithm runs in O(logn) time, where, n by n is the size of the processed binary image.

KW - Image contour analysis

KW - image shape analysis

KW - parallel algorithms

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

U2 - 10.1016/0167-8655(90)90118-L

DO - 10.1016/0167-8655(90)90118-L

M3 - Article

AN - SCOPUS:45149140716

SN - 0167-8655

VL - 11

SP - 87

EP - 93

JO - Pattern Recognition Letters

JF - Pattern Recognition Letters

IS - 2

ER -

Parallel algorithms for contour extraction and coding on an EREW PRAM computer

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this