Title :
Efficient tracking with the Bounded Hough Transform
Author :
Greenspan, Michael ; Shang, Limin ; Jasiobedzki, Piotr
Author_Institution :
Dept. of Electr. & Comput. Eng., Queen´´s Univ., Kingston, Ont., Canada
fDate :
27 June-2 July 2004
Abstract :
The Bounded Hough Transform is introduced to track objects in a sequence of sparse range images. The method is based upon a variation of the General Hough Transform that exploits the coherence across image frames that results from the relationship between known bounds on the object´s velocity and the sensor frame rate. It is extremely efficient, running in O(N) for N range data points, and effectively trades off localization precision for runtime efficiency. The method has been implemented and tested on a variety of objects, including freeform surfaces, using both simulated and real data from Lidar and stereovision sensors. The motion bounds allow the inter-frame transformation space to be reduced to a reasonable, and indeed small size, containing only 729 possible states. In a variation, the rotational subspace is projected onto the translational subspace, which further reduces the transformation space to only 54 states. Experimental results confirm that the technique works well with very sparse data, possibly comprising only tens of points per frame, and that it is also robust to measurement error and outliers.
Keywords :
Hough transforms; image sequences; motion estimation; optical radar; optical tracking; satellite tracking; stereo image processing; bounded Hough transform; freeform surfaces; interframe transformation space; lidar; measurement error; object tracking; rotational subspace; sensor frame rate; sparse range image sequence; stereovision sensors; transformation space reduction; translational subspace; Airports; Data mining; Feature extraction; Image sensors; Iterative closest point algorithm; Laser radar; Measurement errors; Robustness; Runtime; Testing;
Conference_Titel :
Computer Vision and Pattern Recognition, 2004. CVPR 2004. Proceedings of the 2004 IEEE Computer Society Conference on
Print_ISBN :
0-7695-2158-4
DOI :
10.1109/CVPR.2004.1315076