Computational Considerations on Randomized Hough Transform and Motion Analysis

A new and eecient version of the Hough Transform, the Randomized Hough Transform (RHT), has recently been suggested. The RHT has been applied to motion detection by the author and his coworkers and a novel method to calculate 2-D motion in a sequence of time-varying images has been proposed. The method, called Motion Detection using Randomized Hough Transform (MDRHT), utilizes the main ideas of the RHT, random sampling of, e.g., edge points of the original image, and a converging mapping of randomly sampled points into one point in a dynamically-linked accumulator. In this paper the generalized algorithm is suggested and computational behavior of this generalization is examined. Probability mechanisms of the MDRHT are considered on both translation and rotation.

[1]  Lei Xu,et al.  Randomized Hough transform applied to translational and rotational motion analysis , 1992, [1992] Proceedings. 11th IAPR International Conference on Pattern Recognition.

[2]  Josef Kittler,et al.  A survey of the hough transform , 1988, Comput. Vis. Graph. Image Process..

[3]  Erkki Oja,et al.  Motion Detection using Randomized , 1991 .

[4]  Jake K. Aggarwal,et al.  On the computation of motion from sequences of images-A review , 1988, Proc. IEEE.

[5]  Erkki Oja,et al.  A new curve detection method: Randomized Hough transform (RHT) , 1990, Pattern Recognit. Lett..