Answers are grounded in this paper and cite their sources.
The Hough transform, a widely used operation in image processing, suffers from being computationally intensive. In this letter, we propose a method called additive Hough transform (AHT) to accelerate Hough transform computation. It is based on parallel processing of k2points, obtained by dividing the edge map into uniform blocks using a k times k grid. It has been shown that AHT on verification gives the same Hough profile as the conventional Hough transform. Further, AHT reduces the total computation time by at least k2times as compared to existing Hough transform architectures.
No takes yet. Share an insight, caveat, or question.
Satzoda et al. (2008) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: