Generalization of the Fast Hough Transform for Three-Dimensional Images
- Authors: Ershov E.I.1, Terekhin A.P.1, Nikolaev D.P.1
-
Affiliations:
- Kharkevich Institute for Information Transmission Problems
- Issue: Vol 63, No 6 (2018)
- Pages: 626-636
- Section: Mathematical Models and Computational Methods
- URL: https://journals.rcsi.science/1064-2269/article/view/199883
- DOI: https://doi.org/10.1134/S1064226918060074
- ID: 199883
Cite item
Abstract
This study is devoted to the analysis of algorithms of calculating the fast Hough transform for two- and three-dimensional images. A method for calculating the fast Hough transform (FHT) for straight lines in a three-dimensional image is proposed; its space and time complexity are Θ(n4), where n is the characteristic linear size of the input image. The FHT algorithms for approximation in two- and three-dimensional spaces are considered, and properties of the accuracy and completeness of the corresponding sets of dyadic patterns are investigated.
About the authors
E. I. Ershov
Kharkevich Institute for Information Transmission Problems
Author for correspondence.
Email: ershov@iitp.ru
Russian Federation, Moscow, 127051
A. P. Terekhin
Kharkevich Institute for Information Transmission Problems
Email: ershov@iitp.ru
Russian Federation, Moscow, 127051
D. P. Nikolaev
Kharkevich Institute for Information Transmission Problems
Email: ershov@iitp.ru
Russian Federation, Moscow, 127051