The aim of this paper is to present a dissimilarity measure strategy by which a new philosophy for pattern classification pertaining to dissimilarity-based classifiers (DBCs) can be efficiently implemented. Proposed by Duin and his co-authors, DBCs are a way of defining classifiers among classes; they are not based on the feature measurements of individual patterns, but rather on a suitable dissimilarity measure among the patterns. The problem with this strategy is that we need to measure the inter-pattern dissimilarities for all the training samples to ensure there is no zero distance between objects of different classes. Consequently, the classes do not overlap, and therefore, the lower error bound is zero. In image classification tasks, such as face recognition, one of the most intractable problems is the distortion and lack of information caused by the differences in face directions and sizes. To overcome the above problem, in this paper, we propose a new method of measuring the dissimilarity distance between two images of an object when the images have different directions and sizes and there is no direct feature correspondence. In the proposed method, a dynamic programming technique, such as dynamic time warping, is used to overcome the limitation of one-to-one mapping. Furthermore, when determining the matching templates of two images in dynamic time warping, we use a correlation coefficient-based method. With this method, we can find an optimal warping path by surveying the images in a one-dimensional or two-dimensional way (that is, with vertical-only scanning or vertical-horizontal scanning). Our experimental results demonstrate that the proposed mechanism can improve the classification accuracy of conventional approaches for an artificial data set and two real-life benchmark databases.


  1. 1.
    Jain, A.K., Duin, R.P.W., Mao, J.: Statistical pattern recognition: A review. IEEE Trans. Pattern Anal. and Machine Intell. PAMI 22(1), 4–37 (2000)CrossRefGoogle Scholar
  2. 2.
    Pekalska, E., Duin, R.P.W.: The Dissimilarity Representation for Pattern Recognition: Foundations and Applications. World Scientific Publishing, Singapore (2005)CrossRefzbMATHGoogle Scholar
  3. 3.
    Pekalska, E., Duin, R.P.W., Paclik, P.: Prototype selection for dissimilarity-based classifiers. Pattern Recognition 39, 189–208 (2006)CrossRefzbMATHGoogle Scholar
  4. 4.
    Kim, S.-W., Oommen, B.J.: On using prototype reduction schemes to optimize dissimilarity-based classification. Pattern Recognition 40, 2946–2957 (2007)CrossRefzbMATHGoogle Scholar
  5. 5.
    Belhumeour, P.N., Hespanha, J.P., Kriegman, D.J.: Eigenfaces vs. Fisherfaces: Recognition using class specific linear projection. IEEE Trans. Pattern Anal. and Machine Intell., PAMI 19(7), 711–720 (2007)CrossRefGoogle Scholar
  6. 6.
    Zhou, W., Chellappa, R., Rosenfeld, A., Phillips, P.J.: Face recognition: a literature survey. ACM Compt. Surveys 35(4), 399–458 (2003)CrossRefGoogle Scholar
  7. 7.
    Lozano, M., Sotoca, J.M., Sanchez, J.S., Pla, F., Pekalska, E., Duin, R.P.W.: Experimental study on prototype optimisation algorithms for prototype-based classification in vector spaces. Pattern Recognition 39, 1827–1838 (2006)CrossRefzbMATHGoogle Scholar
  8. 8.
    Orezco-Alzate, M., Duin, R.P.W., Castellanos-Dominguez, C.G.: Generalizing dissimilarity representations using feature lines. In: Rueda, L., Mery, D., Kittler, J. (eds.) CIARP 2007. LNCS, vol. 4756, pp. 370–379. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  9. 9.
    Paredes, R., Vidal, E.: A class-dependent weighted dissimilarity measure for neareast neighbor classification problem. Pattern Recognition Letters 21(12), 1027–1036 (2000)CrossRefzbMATHGoogle Scholar
  10. 10.
    Wang, J., Neskovic, P., Cooper, L.N.: Improving neareast neighbor rule with a simple adaptive distance measure. Pattern Recognition Letters 28(2), 207–213 (2007)CrossRefGoogle Scholar
  11. 11.
    Kim, S.-W.: Optimizing dissimilarity-based classifiers using a newly modified Hausdorff distance. In: Hoffmann, A., Kang, B.-h., Richards, D., Tsumoto, S. (eds.) PKAW 2006. LNCS, vol. 4303, pp. 177–186. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  12. 12.
    Kim, S.-W., Duin, R.P.W.: On combining dissimilarity-based classifiers to solve the small sample size problem for appearance-based face recognition. In: Kobti, Z., Wu, D. (eds.) Canadian AI 2007. LNCS, vol. 4509, pp. 110–121. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  13. 13.
    Sakoe, H., Chiba, S.: A dynamic programming algorithm optimization for spoken word recognition. IEEE Trans. Acoust. Speech Signal Process. 26(1), 43–49 (1978)CrossRefzbMATHGoogle Scholar
  14. 14.
    Rabiner, L., Jung, B.H.: Fundamentals of Speech Recognition. Prentice Hall PTR, New Jersey (1993)Google Scholar
  15. 15.
    Ratan, A.L., Grimson, W.E.L., Wells, W.M.: Object detection and localization by dynamic template warping. International Journal of Computer Vision 36(2), 131–147 (2000)CrossRefGoogle Scholar
  16. 16.
    Sahbi, H., Boujemaa, N.: Robust face recognition using dynamic space warping. In: Tistarelli, M., Bigun, J., Jain, A.K. (eds.) ECCV 2002. LNCS, vol. 2359, pp. 121–132. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  17. 17.
    Qiao, Y., Yasuhara, M.: Affine invariant dynamic time warping and its application to online rotated handwriting recognition. In: Proceedings of International Conference on Pattern Recognition, ICPR 2006, vol. 2, pp. 905–908. IEEE Computer Society, Los Alamitos (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Sang-Woon Kim
    • 1
  • Jian Gao
    • 1
  1. 1.Dept. of Computer Science and EngineeringMyongji UniversityYonginSouth Korea

Personalised recommendations