Timur M. Khanipov

most citedComputational complexity lower bounds of certain discrete Radon transform approximations

3 citations · 3 across the 3 of their papers we have counts for

collaborators

Showing cs.CCShow all

2 papers · 1 filter

cs.CC2018

Ensemble computation approach to the Hough transform

Timur M. Khanipov

It is demonstrated that the classical Hough transform with shift-elevation parametrization of digital straight lines has additive complexity of at most $O (n^{3} / lo g n)$ …

cs.CC2018★ 3 cited

Computational complexity lower bounds of certain discrete Radon transform approximations

Timur M. Khanipov

For the computational model where only additions are allowed, the $Ω (n^{2} lo g n)$ lower bound on operations count with respect to image size $n \times n$ is obtained for two types of…