|
This article is cited in 2 scientific papers (total in 2 papers)
Programming and Computer Software
Acceleration of summation over segments using the fast Hough transformation pyramid
K. V. Soshinab, D. P. Nikolaevb, S. A. Gladilinb, E. I. Ershovb a Moscow Institute of Physics and Technology, Dolgoprudny, Russian Federation
b Institute for Information Transmission Problems (Kharkevich Institute), Moscow, Russian Federation
Abstract:
In this paper, we propose an algorithm for fast approximate calculation of the sums over arbitrary segments given by a pair of pixels in the image. Using the results of intermediate calculations of the fast Hough transform, the proposed algorithm allows to calculate the sum over arbitrary line segment with a logarithmic complexity depending on the linear size of the original image (also called fast discrete Radon transform or Brady transform). In this approach, the key element of the algorithm is the search for the dyadic straight line passing through two given pixels. We propose an algorithm for solving this problem that does not degrade the general asymptotics. We prove the correctness of the algorithm and describe a generalization of this approach to the three-dimensional case for segments of straight lines and of planes.
Keywords:
search for segments, fast Hough transformation, discrete Radon transformation, Brady algorithm, fast discrete Radon transformation, dyadic pattern, beamlet pyramid.
Received: 25.11.2019
Citation:
K. V. Soshin, D. P. Nikolaev, S. A. Gladilin, E. I. Ershov, “Acceleration of summation over segments using the fast Hough transformation pyramid”, Vestnik YuUrGU. Ser. Mat. Model. Progr., 13:1 (2020), 129–140
Linking options:
https://www.mathnet.ru/eng/vyuru536 https://www.mathnet.ru/eng/vyuru/v13/i1/p129
|
|