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) …

We obtain an estimate for the maximum deviation from a geometric straight line to a discrete
(dyadic) pattern approximating this line which is used for computing the fast Hough …

The work briefly describes the activities of the Moscow Scientific School of Digital Image
Processing, formed on the basis of a team led by Professor VL Arlazarov. This school is …

We present a three-dimensional generalization of linear Hough transform allowing fast
calculating of sums along all planes in discretized space. The main idea of this method is …

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

Hough transform is a popular low-level computer vision algorithm. Its computationally
effective modification, Fast Hough transform (FHT), makes use of special subsets of image …

АннотацияРабота посвящена исследованию алгоритмов вычисления быстрого
преобразования Хафа для двумерных и трехмерных изображений. Предложен метод …

В статье рассматривается задача ортогональной робастной линейной регрессии на
гистограммах. Доказано утверждение об эквивалентности вычисления М-оценки в …

The paper presents a new fast computation scheme for linear separation in two-dimensional
feature space. This scheme is based on a combination of several image processing …

Получена оценка максимального отклонения от геометрической прямой
аппроксимирующего ее дискретного (диадического) паттерна, используемого при …