Optimal parallel analysis and decomposition of partially occluded strings

This is a theoretical study of partially occluded one-dimensional images. Here, we consider “valid” images composed from a given set of objects, where some objects appearing in the image may be partially obstructed by others. A CRCW PRAM algorithm is presented here for validating a one-dimensional i...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Parallel computing Jg. 26; H. 4; S. 483 - 494
Hauptverfasser: Iliopoulos, Costas S., Reid, James F.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.03.2000
Schlagworte:
Pattern recognition
PRAM algorithms
String algorithms
String algorithms
PRAM algorithms
Pattern recognition
ISSN:0167-8191, 1872-7336
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This is a theoretical study of partially occluded one-dimensional images. Here, we consider “valid” images composed from a given set of objects, where some objects appearing in the image may be partially obstructed by others. A CRCW PRAM algorithm is presented here for validating a one-dimensional image x of length n over a set of k objects of equal length in O( log logn) time with linear work, where k is a fixed integer.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0167-8191
1872-7336
DOI:10.1016/S0167-8191(99)00114-3