Generalizing the Brady-Yong Algorithm: Efficient Fast Hough Transform for Arbitrary Image Sizes

IF 3.6 3区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Access Pub Date : 2025-01-27 DOI:10.1109/ACCESS.2025.3534405
Danil D. Kazimirov;Ekaterina O. Rybakova;Vitalii V. Gulevskii;Arseniy P. Terekhin;Elena E. Limonova;Dmitry P. Nikolaev
{"title":"Generalizing the Brady-Yong Algorithm: Efficient Fast Hough Transform for Arbitrary Image Sizes","authors":"Danil D. Kazimirov;Ekaterina O. Rybakova;Vitalii V. Gulevskii;Arseniy P. Terekhin;Elena E. Limonova;Dmitry P. Nikolaev","doi":"10.1109/ACCESS.2025.3534405","DOIUrl":null,"url":null,"abstract":"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>$FHT2DT$ </tex-math></inline-formula> algorithm and proved that it provides a substantial compromise between accuracy and computational complexity. The <inline-formula> <tex-math>$FHT2DT$ </tex-math></inline-formula> algorithm is significantly more accurate than the algorithm previously suggested in the literature and, hence, <inline-formula> <tex-math>$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.","PeriodicalId":13079,"journal":{"name":"IEEE Access","volume":"13 ","pages":"20101-20132"},"PeriodicalIF":3.6000,"publicationDate":"2025-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10854475","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Access","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10854475/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

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 $FHT2DT$ algorithm and proved that it provides a substantial compromise between accuracy and computational complexity. The $FHT2DT$ algorithm is significantly more accurate than the algorithm previously suggested in the literature and, hence, $FHT2DT$ 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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
推广Brady-Yong算法:任意图像大小的高效快速霍夫变换
Hough(离散Radon)变换(HT/DRT)是一种数字图像处理工具,已成为许多应用领域不可或缺的工具,从一般图像处理到神经网络和x射线计算机断层扫描。在实际问题中的应用要求其计算效率和精度的提高。事实上,快速HT的标准算法是布雷迪-杨算法。但是,它只适用于宽度为2的幂的图像。对于具有相同渐近复杂度的图像宽度的非2次幂的Brady-Yong算法的推广算法是已知的,但无论是在渐近常数方面还是在精度方面都没有研究过。因此,在理论和实验的支持下,将Brady-Yong算法推广到任意大小的图像,同时保持渐进的计算复杂度和可接受的精度仍然是至关重要的。在本文中,我们提出了5种新的算法,这些算法融合了Brady-Yong算法的核心思想,适用于计算任意大小图像的快速HT。我们通过理论分析和实验验证,研究了5种新算法的性质,以及文献中先前提出的一种算法。作为我们的主要贡献之一,在提出的算法中,我们挑出了FHT2DT算法,并证明它在精度和计算复杂性之间提供了实质性的妥协。$FHT2DT$算法比先前文献中提出的算法要精确得多,因此,$FHT2DT$可以在实际应用中替代它。在分析所提出算法的特性期间,我们根据算法的精度和速度参数创建了一个特征图。用户可以通过参考我们的地图选择最适合他们需要的方法——无论是优先考虑计算复杂性还是准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Access
IEEE Access COMPUTER SCIENCE, INFORMATION SYSTEMSENGIN-ENGINEERING, ELECTRICAL & ELECTRONIC
CiteScore
9.80
自引率
7.70%
发文量
6673
审稿时长
6 weeks
期刊介绍: IEEE Access® is a multidisciplinary, open access (OA), applications-oriented, all-electronic archival journal that continuously presents the results of original research or development across all of IEEE''s fields of interest. IEEE Access will publish articles that are of high interest to readers, original, technically correct, and clearly presented. Supported by author publication charges (APC), its hallmarks are a rapid peer review and publication process with open access to all readers. Unlike IEEE''s traditional Transactions or Journals, reviews are "binary", in that reviewers will either Accept or Reject an article in the form it is submitted in order to achieve rapid turnaround. Especially encouraged are submissions on: Multidisciplinary topics, or applications-oriented articles and negative results that do not fit within the scope of IEEE''s traditional journals. Practical articles discussing new experiments or measurement techniques, interesting solutions to engineering. Development of new or improved fabrication or manufacturing techniques. Reviews or survey articles of new or evolving fields oriented to assist others in understanding the new area.
期刊最新文献
Low-Cost FPGA-Enhanced CNN Accelerator for Real-Time YOLO Object Detection and Classification A Web-Ready and 5G-Ready Volumetric Video Streaming Platform: A Platform Prototype and Empirical Study Multi-Expert Trajectory Prediction for Highway Weaving Sections Using Conflict Potential Energy and GAN A Hybrid Fractional Chebyshev–Legendre Spectral Collocation Method for Hamilton–Jacobi–Bellman Equations Application-Specific Instruction-Set Processors (ASIPs) for Deep Neural Networks: A Survey
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1