This article presents a matching algorithm developed for a generic object tracking system. Matching is a critical part for the effectiveness of tracking. The proposed method is a probabilistic algorithm inspired from the emerging "discriminative random fields". Points are associated according to their visual similarity and to spatial relations in their neighborhood, based on a Delaunay triangulation. Experimental results are presented to validate this contribution.
Probabilistic matching algorithm for keypoint based object tracking using a Delaunay triangulation
WIAMIS 2007, 8th International Workshop on Image Analysis for Multimedia Interative Services, June 6-8, 2007, Santorin, Greece
© 2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
PERMALINK : https://www.eurecom.fr/publication/2232