This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Finding Trajectories of Feature Points in a Monocular Image Sequence
January 1987 (vol. 9 no. 1)
pp. 56-73
Ishwar K. Sethi, Department of Computer Science, Wayne State University, Detroit, MI 48202.
Ramesh Jain, Department of Electrical Engineering and Computer Science, The University of Michigan, Ann Arbor, MI 48109.
Identifying the same physical point in more than one image, the correspondence problem, is vital in motion analysis. Most research for establishing correspondence uses only two frames of a sequence to solve this problem. By using a sequence of frames, it is possible to exploit the fact that due to inertia the motion of an object cannot change instantaneously. By using smoothness of motion, it is possible to solve the correspondence problem for arbitrary motion of several nonrigid objects in a scene. We formulate the correspondence problem as an optimization problem and propose an iterative algorithm to find trajectories of points in a monocular image sequence. A modified form of this algorithm is useful in case of occlusion also. We demonstrate the efficacy of this approach considering synthetic, laboratory, and real scenes.
Citation:
Ishwar K. Sethi, Ramesh Jain, "Finding Trajectories of Feature Points in a Monocular Image Sequence," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 9, no. 1, pp. 56-73, Jan. 1987, doi:10.1109/TPAMI.1987.4767872
Usage of this product signifies your acceptance of the Terms of Use.