A new Hough transform applied in track initiation

Hough transform which has low sensitivity to local fault and good ability in suppressing noisy and clutters, applies to track initiation in a cluttered environment. However, huge amount of computation and memory in Hough transform restricts its application in track initiation. A new Hough transform algorithm used in track initiation was put forward. Instead of according to points in standard Hough transform, new algorithm vote according to parameters fixed by several points in the observation space, which reduce the computation of voting. Moreover, new algorithm makes use of observed data's time sequence information and kinematics information of targets, which suppress false tracks formed by clutters. The result of simulation indicates that this algorithm has high computing speed and small memory, and meets the need of fast track initiation.

[1]  M. Smith Feature space transform for multitarget detection , 1980, 1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[2]  Hungwen Li,et al.  Fast Hough transform: A hierarchical approach , 1986, Comput. Vis. Graph. Image Process..

[3]  Tao Wang,et al.  Novel parallel Hough Transform on multi-core processors , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.