Generalizing the Brady-Yong Algorithm: Efficient Fast Hough Transform for Arbitrary Image Sizes
The Hough (discrete Radon) transform (HT/DRT) is a digital image processing tool that has become indispensable in many application areas, ranging from general image processing to neural networks and X-ray computed tomography. The utilization of the HT in applied problems demands its computational ef...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2025-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10854475/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The Hough (discrete Radon) transform (HT/DRT) is a digital image processing tool that has become indispensable in many application areas, ranging from general image processing to neural networks and X-ray computed tomography. The utilization of the HT in applied problems demands its computational efficiency and increased accuracy. The de facto standard algorithm for the fast HT is the Brady-Yong algorithm. However, it is applicable only to images of a power-of-two width. The algorithm that generalizes the Brady-Yong algorithm for non-power-of-two image width with the same asymptotic complexity is known, but it has not been studied neither in terms of the constant in the asymptotics nor in accuracy. Thus, supported both by theory and experiments, generalization of the Brady-Yong algorithm for images of arbitrary size while maintaining asymptotic computational complexity and acceptable accuracy remains of paramount necessity. In this paper, we proposed 5 novel algorithms that incorporate the core idea of the Brady-Yong algorithm and are suitable for computing the fast HT for images of arbitrary size. We investigated the properties of 5 new algorithms, along with one previously proposed algorithm from the literature, through both theoretical analysis and experimental validation. As one of our major contributions, among the proposed algorithms, we singled out a <inline-formula> <tex-math notation="LaTeX">$FHT2DT$ </tex-math></inline-formula> algorithm and proved that it provides a substantial compromise between accuracy and computational complexity. The <inline-formula> <tex-math notation="LaTeX">$FHT2DT$ </tex-math></inline-formula> algorithm is significantly more accurate than the algorithm previously suggested in the literature and, hence, <inline-formula> <tex-math notation="LaTeX">$FHT2DT$ </tex-math></inline-formula> can substitute it in practical applications. During the analysis of the properties of the proposed algorithms, we created a map that characterizes the algorithms based on their accuracy and speed parameters. Users can select the method that best suits their needs — whether prioritizing computational complexity or accuracy — by referring to our map. |
|---|---|
| ISSN: | 2169-3536 |