On the Euclidean Distance of Images
|
We present a new Euclidean distance for images, which we call IMage Euclidean Distance (IMED). Unlike the traditional Euclidean distance, IMED takes into account the spatial relationships of pixels. Therefore, it is robust to small perturbation of images. We argue that IMED is the only intuitively reasonable Euclidean distance for images. IMED is then applied to image recognition. The key advantage of this distance measure is that it can be embedded in most image classification techniques such as SVM, LDA, and PCA. The embedding is rather efficient by involving a transformation referred to as Standardizing Transform (ST). We show that ST is a transform domain smoothing. Using the Face Recognition Technology (FERET) database and two state-of-the-art face identification algorithms, we demonstrate a consistent performance improvement of the algorithms embedded with the new metric over their original versions.
[1] 1334 R. Bajcsy and S. Lovacic, “Multiresolution Elastic Matching,” Computer Vision, Graphics, and Image Processing, vol. 46, pp. 1-21, 1989.
[2] S. Bochner, Lectures on Fourier Integrals, translated by M. Tenenbaum and H. Pollard, Princeton, N.J.: Princeton Univ. Press, 1959.
[3] J. Canny, “A Computational Approach to Edge Detection,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 8, no. 6, pp. 679-698, 1986.
[4] D.P. Huttenlocher, G.A. Klanderman, and W.J. Rucklidge, “Comparing Images Using the Hausdorff Distance,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 9, pp. 850-863, Sept. 1993.
[5] A.K. Jain, Fundamentals of Digital Image Processing. Prentice-Hall, 1989.
[6] A.K. Jain, ”Advances in Mathematical Models for Image Processing,” Proc. IEEE, vol. 69, no. 5, pp. 502-528, May 1981.
[7] I.T. Jolliffe, Principal Component Analysis. New York: Springer-Verlag, 1986.
[8] D. Keysers, R. Paredes, H. Ney, and E. Vidal, “Combinations of Tangent Vectors and Local Representations for Handwritten Digit Recognition,” http://wasserstoff.informatik.rwth-aachen.de/ keysers/Pubs/SPR2002comb.html, 2002.
[9] M. Kirby and L. Sirovich, “Application of the Karhunen-Loeve Procedure for the Characterization of Human Faces,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 12, no. 1, pp. 103-108, Jan. 1990.
[10] J. Li, G. Chen, and Z. Chi, “A Fuzzy Image Metric with Application to Fractal Coding,” IEEE Trans. Image Processing, vol. 11, no. 6, pp. 636-643, June 2002.
[11] K.V. Mardia, J.T. Kent, and J.M. Bibby, Multivariate Analysis. Academic Press, 1979.
[12] B. Moghaddam, “Bayesian Face Recognition,” Pattern Recognition, vol. 13, no. 11, pp. 1771-1782, Nov. 2000.
[13] P.J. Phillips, H. Moon, S.A. Rizvi, and P.J. Rauss, “The FERET Evaluation Methodology for Face-Recognition Algorithms,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 10, pp. 1090-1104, Oct. 2000.
[14] M. Postnikov, Lectures in Geometry, Semester I, Analytic Geometry, translated by V. Shokurov, Moscow: Mir Publishers, 1982.
[15] I.J. Schoenberg, “Metric Spaces and Completely Monotone Functions,” Ann. Math., vol. 39, no. 4, pp. 811-841, Oct. 1938.
[16] P. Simard, Y.L. Cun, and J. Dender, “Efficient Pattern Recognition Using a New Transformation Distance,” Advances in Neural Information Processing Systems, S. Hanson, J. Cowan, and C. Giles eds., pp. 50-58. San Mateo, Calif.: Morgan Kaufman, 1993.
[17] M.A. Turk and A.P. Pentland, “Face Recognition Using Eigenfaces,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 586-591, 1991.
[18] V. Vapnik, Statistical Learning Theory. New York: John Wiley, 1998.
Index Terms:
Index Terms- Image metric, Euclidean distance, face recognition, positive definite function.
Citation:
Liwei Wang, Yan Zhang, Jufu Feng, "On the Euclidean Distance of Images," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 27, no. 8, pp. 1334-1339, Aug. 2005, doi:10.1109/TPAMI.2005.165
PURCHASE ARTICLE: $19
IEEE Xplore Subscribers
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb