The Hough Transform Has O(N) Complexity on N \times N Mesh Connected Computers

DOI10.1137/0219056MaRDI QIDQ3495679zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

image processingRadon transformparallel algorithmsHough transformmesh connected computer

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Cellular automata (computational aspects) (68Q80) Parallel algorithms in computer science (68W10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• Computing Hough transforms on hypercube multicomputers
• Fast Hough transform on a mesh connected processor array
• Fast Hough transform on multiprocessors: A branch and bound approach
• A probabilistic algorithm for computing Hough transforms
• The Hough transform

Cited in

(2)

• Computing Hough transforms on hypercube multicomputers
• A fast efficient parallel Hough transform algorithm on LARPBS

This page was built for publication: The Hough Transform Has $O(N)$ Complexity on $N \times N$ Mesh Connected Computers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3495679)