Title :
Estimating optical flow from clustered trajectories in velocity-time
Author :
Agarwal, R. ; Sklansky, J.
Author_Institution :
Dept. of Electr. & Comput. Eng., California Univ., Irvine, CA, USA
fDate :
30 Aug-3 Sep 1992
Abstract :
Presents a new algorithm for the estimation of optical flow from a monocular sequence of images using clustered trajectories in velocity-time. In the new algorithm, the objects in the scene may exhibit rotation and translation in all three dimensions. In addition, interframe displacement may be large-of the order of many pixels. It is assumed that there is a known upper bound on the magnitudes of the x and y components of interframe displacement. The authors conducted tests to compare the performance of the algorithm with that of two prior algorithms for optical flow estimation. They present the results of these tests. The results suggest that the algorithm is an improvement over prior algorithms in its ability to compute the optical flow field accurately under several commonly encountered scene conditions that have posed problems to earlier algorithms for optical flow estimation
Keywords :
brightness; noise; picture processing; clustered trajectories; interframe displacement; known upper bound; monocular sequence; optical flow; rotation; scene conditions; translation; velocity-time; Clustering algorithms; Fuzzy sets; Image motion analysis; Image sequences; Layout; Optical computing; Optical filters; Optical noise; Optical sensors; Testing;
Conference_Titel :
Pattern Recognition, 1992. Vol.I. Conference A: Computer Vision and Applications, Proceedings., 11th IAPR International Conference on
Conference_Location :
The Hague
Print_ISBN :
0-8186-2910-X
DOI :
10.1109/ICPR.1992.201544