On Token-Matching in Real Time Motion Analysis

A token matching scheme for high-level motion analysis has been developed. The goal is real-time usage for-a constrained scenario. The demand for real-time has forced an unsophisticated method, which simply propagates certainties through normalizations.

[1]  Azriel Rosenfeld,et al.  Scene Labeling by Relaxation Operations , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[2]  Josef Kittler,et al.  Relaxation labelling algorithms - a review , 1986, Image Vis. Comput..

[3]  Johan Wiklund,et al.  Image Sequence Analysis for Object Tracking. , 1987 .

[4]  Shmuel Peleg,et al.  A New Probabilistic Relaxation Scheme , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Keith E. Price,et al.  Relaxation Matching Techniques-A Comparison , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Steven W. Zucker,et al.  On the Foundations of Relaxation Labeling Processes , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Karin Husballe Munk,et al.  Monitoring moving objects in real time , 1986 .

[8]  J. Kittler,et al.  RELAXATION LABELING ALGORITHMS - A REVIEW , 1985 .

[9]  Ishwar K. Sethi,et al.  Finding Trajectories of Feature Points in a Monocular Image Sequence , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.