Computing Hough transforms on hypercube multicomputers
From MaRDI portal
(Redirected from Publication:547488)
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
Cites work
- scientific article; zbMATH DE number 3900666 (Why is no real title available?)
- scientific article; zbMATH DE number 49825 (Why is no real title available?)
- scientific article; zbMATH DE number 3635458 (Why is no real title available?)
- Efficient parallel algorithms for image template matching on hypercube SIMD machines
- Generalizing the Hough transform to detect arbitrary shapes
- Parallel Matrix and Graph Algorithms
- Sorting on a mesh-connected parallel computer
- The Hough Transform Has $O(N)$ Complexity on $N \times N$ Mesh Connected Computers
Cited in
(6)- Efficient implementation of fast Hough transform using CPCA coprocessor
- scientific article; zbMATH DE number 2080157 (Why is no real title available?)
- A parallel Hough transform algorithm for nonuniform images
- The Hough Transform Has $O(N)$ Complexity on $N \times N$ Mesh Connected Computers
- Computing a complete histogram of an image in \(\log(n)\) steps and minimum expected memory requirements using hypercubes
- Fast Hough transform on a mesh connected processor array
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)
