Computing Hough transforms on hypercube multicomputers
From MaRDI portal
Publication:547488
DOI10.1007/BF00127879zbMATH Open1215.65217OpenAlexW1984807396MaRDI QIDQ547488FDOQ547488
Authors: Sanjay Ranka, Sartaj Sahni 
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
Recommendations
- Fast Hough transform on multiprocessors: A branch and bound approach
- Fast Hough transform on a mesh connected processor array
- A parallel Hough transform algorithm for nonuniform images
- Exploiting Inherent Parallelisms for Accelerating Linear Hough Transform
- A fast efficient parallel Hough transform algorithm on LARPBS
- A probabilistic algorithm for computing Hough transforms
Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)
Cites Work
- Generalizing the Hough transform to detect arbitrary shapes
- Title not available (Why is that?)
- The Hough Transform Has $O(N)$ Complexity on $N \times N$ Mesh Connected Computers
- Parallel Matrix and Graph Algorithms
- Title not available (Why is that?)
- Sorting on a mesh-connected parallel computer
- Title not available (Why is that?)
- Efficient parallel algorithms for image template matching on hypercube SIMD machines
Cited In (5)
- Fast Hough transform on a mesh connected processor array
- Title not available (Why is that?)
- Computing a complete histogram of an image in \(\log(n)\) steps and minimum expected memory requirements using hypercubes
- 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: Computing Hough transforms on hypercube multicomputers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q547488)
