A heuristic search-based motion correspondence algorithm using fuzzy clustering

  • Ki-Yeol Eom
  • Jae-Young Jung
  • Moon-Hyun KimEmail author
Regular Papers Intelligent and Information Systems


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%.


Fuzzy clustering heuristic searching motion correspondence object tracking pairwise association 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    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
  2. [2]
    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
  3. [3]
    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
  4. [4]
    I. Sethi and R. Jain, “Finding trajectories of feature points in a monocular image sequence,” IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 9, no. 1, pp. 56–73, January 1987.CrossRefGoogle Scholar
  5. [5]
    K. Rangarajan and M. Shah, “Establishing motion correspondence,” Conference Vision Graphics Image Process, vol. 54, no. 1, pp. 56–73, July 1991.zbMATHGoogle Scholar
  6. [6]
    C. J. Veenman, M. J. T. Reinders, and E. Backer, “Resolving motion correspondence for densely moving points,” IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 23, no. 1, pp. 54–72, January 2001.CrossRefGoogle Scholar
  7. [7]
    K. Shafique and M. Shah, “A noniterative greedy algorithm for multiframe point correspondence,” IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 27, no. 1, pp. 51–65, January 2005.CrossRefGoogle Scholar
  8. [8]
    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
  9. [9]
    A. Yilmaz, O. Javed, and M. Shah, “Object tracking: a survey,” ACM Computing Surveys, vol. 38, no. 4, pp. 1–45, 2006.CrossRefGoogle Scholar
  10. [10]
    J. H. Kao, J. H. Chuang, and M. L. Hsieh, “Finding point correspondence using local similarity and global constraint under insignificant scaling and roll,” Electronics Letters, vol. 42, no. 23, pp. 1340–1341, November 2006.CrossRefGoogle Scholar
  11. [11]
    R. R. Yager and D. P Filev, “approximate clustering via the mountain method,” IEEE Trans. on Systems, Man, and Cybernetics, vol. 24, no. 8, pp. 1279–1284, 1994.CrossRefGoogle Scholar
  12. [12]
    J. S. Marques, “A fuzzy algorithm for curve and surface alignment,” Pattern Recognition Letters, vol. 19, no. 9, pp. 797–803, 1998.zbMATHCrossRefGoogle Scholar
  13. [13]
    Z. Xue, D. Shen, and E. K. Teoh, “An efficient fuzzy algorithm for aligning shapes under affine transformations,” Pattern Recognition, vol. 34, pp. 1171–1180, 2001.zbMATHCrossRefGoogle Scholar
  14. [14]
    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
  15. [15]
  16. [16]
  17. [17]
    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
  18. [18]
    T. K. An and M. H. Kim, “Context-aware video surveillance system,” Journal of Electrical Engineering & Technology, vol. 7, no. 1, pp. 115–123, 2012.CrossRefGoogle Scholar

Copyright information

© Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers and Springer-Verlag Berlin Heidelberg  2012

Authors and Affiliations

  1. 1.School of Information and Communication EngineeringSungkyunkwan UniversitySuwon, GyeonggidoKorea
  2. 2.Department of Computer Information WarfareDongYang UniversityYeongju, Gyeongsangbuk-doKorea

Personalised recommendations