Fast Hough transform on multiprocessors: A branch and bound approach
From MaRDI portal
Publication:1373801
DOI10.1006/JPDC.1997.1362zbMATH Open0888.68018OpenAlexW2003983497MaRDI QIDQ1373801FDOQ1373801
Authors: Nicolás Guil, E. L. Zapata
Publication date: 17 December 1997
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/c9bb954de3d63b4a96230afa737bf71022ee5d35
Recommendations
Cited In (8)
- Computing Hough transforms on hypercube multicomputers
- Fast Hough transform on a mesh connected processor array
- Title not available (Why is that?)
- Title not available (Why is that?)
- Constant-time Hough transform on the processor arrays with reconfigurable bus systems
- Analysis of properties of dyadic patterns for the fast Hough transform
- The Hough Transform Has $O(N)$ Complexity on $N \times N$ Mesh Connected Computers
- A parallel Hough transform algorithm for nonuniform images
This page was built for publication: Fast Hough transform on multiprocessors: A branch and bound approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373801)