提出可处理任意尺寸图像的快速霍夫变换算法，精度更高且计算高效。
Generalization of Brady-Yong Algorithm for Fast Hough Transform to Arbitrary Image Size
- 基于布雷迪-永算法思想，拓展至任意图像尺寸
- 计算复杂度最优，精度显著优于现有方法
- 适合需要高精度霍夫变换的工业与医学图像应用
如今，霍夫变换（离散拉东变换，HT/DRT）已成为图像处理、计算机断层扫描等众多领域中极为强大且广泛应用的工具。高效利用霍夫变换解决实际问题，要求其具备加速能力和更高精度。然而，大多数快速霍夫变换算法，尤其是开创性的布雷迪-永算法，仅适用于2的幂次方尺寸的输入图像，无法适应任意尺寸图像。本文提出一种针对任意尺寸图像的霍夫变换新算法，该算法在继承布雷迪-永算法最优计算复杂度的基础上，实现了更高的计算精度。论文还提供了所提算法的计算复杂度与精度的理论分析，实验结果与理论预测一致。
原文摘要 · Abstract (English)
Nowadays, the Hough (discrete Radon) transform (HT/DRT) has proved to be an extremely powerful and widespread tool harnessed in a number of application areas, ranging from general image processing to X-ray computed tomography. Efficient utilization of the HT to solve applied problems demands its acceleration and increased accuracy. Along with this, most fast algorithms for computing the HT, especially the pioneering Brady-Yong algorithm, operate on power-of-two size input images and are not adapted for arbitrary size images. This paper presents a new algorithm for calculating the HT for images of arbitrary size. It generalizes the Brady-Yong algorithm from which it inherits the optimal computational complexity. Moreover, the algorithm allows to compute the HT with considerably higher accuracy compared to the existing algorithm. Herewith, the paper provides a theoretical analysis of the computational complexity and accuracy of the proposed algorithm. The conclusions of the performed experiments conform with the theoretical results.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。