Computing the Hough transform on a scan line array processor (image processing)

A parallel algorithm for a line-finding Hough transform that runs on a linearly connected, SIMD (single-instruction, multiple-data-stream) vector of processors is described. The authors show that a high-precision transform, usually considered to be an expensive global operation, can be performed eff...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on pattern analysis and machine intelligence Ročník 11; číslo 3; s. 262 - 265
Hlavní autoři: Fisher, A.L., Highnam, P.T.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Los Alamitos, CA IEEE 01.03.1989
IEEE Computer Society
Témata:
Algorithm design and analysis
Applied sciences
Artificial intelligence
Communication system control
Computer science; control theory; systems
Computerized monitoring
Exact sciences and technology
Image processing
Object detection
Parallel algorithms
Pattern recognition. Digital image processing. Computational geometry
Shift registers
US Department of Defense
Vectors
Wire
System architecture
Parallel algorithm
Array processor
Image processing
SIMD computer
Hough transform
Computer system
Artificial intelligence
ISSN:0162-8828
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A parallel algorithm for a line-finding Hough transform that runs on a linearly connected, SIMD (single-instruction, multiple-data-stream) vector of processors is described. The authors show that a high-precision transform, usually considered to be an expensive global operation, can be performed efficiently, in two to three times real time, with only local, communication on a long vector. The algorithm also illustrates a decomposition principle that has wide application in algorithm design for large linear arrays. A review of straight-line Hough transform implementations is also presented.< >
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0162-8828
DOI:10.1109/34.21795