Algorithmic techniques for computer vision on a fine-grained parallel machine

The authors describe several fundamentally useful primitive operations and routines and illustrate their usefulness in a wide range of familiar version processes. These operations are described in terms of a vector machine model of parallel computation. They use a parallel vector model because vecto...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on pattern analysis and machine intelligence Ročník 11; číslo 3; s. 244 - 257
Hlavní autori: Little, J.J., Blelloch, G.E., Cass, T.A.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Los Alamitos, CA IEEE 01.03.1989
IEEE Computer Society
Predmet:
Applied sciences
Artificial intelligence
Computational modeling
Computer science
Computer science; control theory; systems
Computer vision
Concurrent computing
Exact sciences and technology
Grid computing
Histograms
Image edge detection
Laboratories
Parallel machines
Pattern recognition. Digital image processing. Computational geometry
Computational geometry
Computer vision
Parallelism
Hough transform
Edge detection
Artificial intelligence
ISSN:0162-8828
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The authors describe several fundamentally useful primitive operations and routines and illustrate their usefulness in a wide range of familiar version processes. These operations are described in terms of a vector machine model of parallel computation. They use a parallel vector model because vector models can be mapped onto a wide range of architectures. They also describe implementing these primitives on a particular fine-grained machine, the connection machine. It is found that these primitives are applicable in a variety of vision tasks. Grid permutations are useful in many early vision algorithms, such as Gaussian convolution, edge detection, motion, and stereo computation. Scan primitives facilitate simple, efficient solutions of many problems in middle- and high-level vision. Pointer jumping, using permutation operations, permits construction of extended image structures in logarithmic time. Methods such as outer products, which rely on a variety of primitives, play an important role of many high-level algorithms.< >
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0162-8828
DOI:10.1109/34.21793