The Hough Transform Has $O(N)$ Complexity on $N \times N$ Mesh Connected Computers (Q3495679)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4170140
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Hough Transform Has $O(N)$ Complexity on $N \times N$ Mesh Connected Computers |
scientific article; zbMATH DE number 4170140 |
Statements
The Hough Transform Has $O(N)$ Complexity on $N \times N$ Mesh Connected Computers (English)
0 references
1990
0 references
parallel algorithms
0 references
image processing
0 references
Hough transform
0 references
mesh connected computer
0 references
Radon transform
0 references
0.85051966
0 references
0.8464051
0 references
0.82790667
0 references
0.8096189
0 references
