Computing Hough transforms on hypercube multicomputers
From MaRDI portal
Publication:547488
DOI10.1007/BF00127879zbMath1215.65217OpenAlexW1984807396MaRDI QIDQ547488
Publication date: 2 July 2011
Published in: The Journal of Supercomputing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00127879
Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalizing the Hough transform to detect arbitrary shapes
- The Hough Transform Has $O(N)$ Complexity on $N \times N$ Mesh Connected Computers
- Parallel Matrix and Graph Algorithms
- Sorting on a mesh-connected parallel computer
- Efficient parallel algorithms for image template matching on hypercube SIMD machines