A heuristic search-based motion correspondence algorithm using fuzzy clustering
- 105 Downloads
Motion correspondence problem between many feature points of consecutive frames is computationally explosive. We present a heuristic algorithm for finding out the most probable motion correspondence of points in consecutive frames, based on fuzzy confidence degrees. The proposed algorithm consists of three stages: (i) reduction of the search space for candidate points of association, (ii) pairwise association cost estimation and (iii) complete association of every feature point between the consecutive frames. In the first stage, all the points in a frame, frame t-1 are grouped into several groups by using fuzzy clustering. This is done with a Euclidean distance as a similarity measure between the points. The points in the following frame, frame t are also clustered into the same number of groups with respect to the cluster centers of the previous frame. The association between the points of the consecutive frames is allowed only for the points that belong to the same group in each frame. In the second stage, the cost of each association of a point in frame t-1 with a point in frame t is estimated by using motion constraints that are based on the velocity vector and the orientation angle of each point. The cost is measured as a fuzzy confidence degree of each head point, i.e., a point in frame t-1, belonging to each measurement, i.e., a point in frame t. In the final stage, we search for the most likely associations among all the possible mappings between the feature points in the consecutive frames. A search tree is constructed in such a way that an ith level node represents an association of ith node in frame t-1 with a node in frame t. We devise a heuristic function of an admissible A* algorithm by using the pairwise association cost developed in the second stage. Experimental results show an accuracy of more than 98%.
KeywordsFuzzy clustering heuristic searching motion correspondence object tracking pairwise association
Unable to display preview. Download preview PDF.
- J. Y. Jung and M. H. Kim, “Automatic feature point extraction and tracking in image sequences with the multiple moving objects,” Journal of The Korean Institute of Information Scientists and Engineers, vol. 25, no. 3, pp. 562–573, March 1998.Google Scholar
- K. Y. Eom, J. Y. Jung, and M. H. Kim, “A motion correspondence algorithm based on point series similarity,” Journal of The Korean Institute of Information Scientists and Engineers, vol. 37, no. 4, pp. 305–310, April 2010.Google Scholar
- K.-Y. Eom, T.-K. Ahn, G.-J. Kim, G.-J. Jang, and M.-H. Kim, “Fast object tracking in intelligent surveillance system,” Proc. of ICCSA 2009, Part II, LNCS 5593, pp. 758–772, July 2009.Google Scholar
- L. Chen, M. T. Ozsu, and V. Oria, “Robust and fast similarity search for moving object trajectories,” Proc. of ACM SIGMOD, pp. 491–502, 2005.Google Scholar
- P. E. Hart, N. J. Nilsson, and B. Raphael, “A formal basis for the heuristic determination of minimum cost paths,” SIGART Newsletter, vol. 37, pp. 28–29, 1972.Google Scholar
- CAVIAR project, http://homepages.inf.ed.ac.uk/rbf/CAVIAR
- PETS 2009, http://www.cvg.rdg.ac.uk/PETS2009/
- F. Yin, D. Makris, and S. Velastin, “Performance evaluation of object tracking algorithms,” Proc. of the 10th Workshop on PETS2007, pp. 17–24, 2007.Google Scholar