3 citations · 3 across the 1 of their papers we have counts for
2 papers
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 …
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 lower bound on operations count with respect to image size is obtained for two types of…