The Hough Transform Has $O(N)$ Complexity on $N \times N$ Mesh Connected Computers
From MaRDI portal
Publication:3495679
DOI10.1137/0219056zbMath0711.68099OpenAlexW2066963862MaRDI QIDQ3495679
No author found.
Publication date: 1990
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0219056
Computing methodologies for image processing (68U10) Parallel algorithms in computer science (68W10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Cellular automata (computational aspects) (68Q80)
Related Items (1)
This page was built for publication: The Hough Transform Has $O(N)$ Complexity on $N \times N$ Mesh Connected Computers