Advertisement

Dimensionality Reduction in High-Dimensional Space for Multimedia Information Retrieval

  • Seungdo Jeong
  • Sang-Wook Kim
  • Byung-Uk Choi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4653)

Abstract

This paper proposes a novel method for dimensionality reduction based on a function approximating the Euclidean distance, which makes use of the norm and angle components of a vector. First, we identify the causes of errors in angle estimation for approximating the Euclidean distance, and discuss basic solutions to reduce those errors. Then, we propose a new method for dimensionality reduction that composes a set of subvectors from a feature vector and maintains only the norm and the estimated angle for every subvector. The selection of a good reference vector is important for accurate estimation of the angle component. We present criteria for being a good reference vector, and propose a method that chooses a good reference vector by using the Levenberg-Marquardt algorithm. Also, we define a novel distance function, and formally prove that the distance function consistently lower-bounds the Euclidean distance. This implies that our approach does not incur any false dismissals in reducing the dimensionality. Finally, we verify the superiority of the proposed approach via performance evaluation with extensive experiments.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aggarwal, C.C.: On the Effects of Dimensionality Reduction on High Dimensional Similarity Search. In: Proc. of Int’l. Symp. on Principles of Database Systems, pp. 256–266 (2001)Google Scholar
  2. 2.
    Agrawal, R., Faloutsos, C., Swami, A.: Efficient Similarity Search in Sequence Database. In: Proc. of Int’l. Conf. on Foundations of Data Organization and Algorithms, pp. 69–84 (1993)Google Scholar
  3. 3.
    Beyer, K.S., Goldstein, J., Ramakrishnan, R., Shaft, U.: When Is Nearest Neighbor Meaningful? In: Proc. of Int’l. Conf. on Database Theory, pp. 217–235 (1999)Google Scholar
  4. 4.
    Bohm, C., Berchtold, S., Keim, D.A.: Searching in High-Dimensional Spaces-Index Structures for Improving the Performance of Multimedia Databases. ACM Computing Surveys 33(3), 322–373 (2001)CrossRefGoogle Scholar
  5. 5.
    Egecioglu, O., Ferhatosmanoglu, H., Ogras, U.: Dimensionality Reduction and Similarity Computation by Inner Product Approximations. IEEE Trans. on Knowledge and Data Engineering, 714–726 (2004)Google Scholar
  6. 6.
    Jeong, S., Kim, S.-W., Kim, K., Choi, B.-U.: An Effective Method for Approximating the Euclidean Distance in High-Dimensional Space. In: Proc. of Int’l. Conf. on Databases and Expert Systems Applications, pp. 863–872 (2006)Google Scholar
  7. 7.
    Kanth, K.V.R., Agrawal, D., Singh, A.: Dimensionality Reduction for Similarity Searching in Dynamic Databases. In: Proc. of Int’l. Conf. on Management of Data. ACM SIGMOD, pp. 166–176. ACM Press, New York (1998)Google Scholar
  8. 8.
    Moon, T.K., Stirling, W.C.: Mathematical Methods and Algorithms for Signal Processing. Prentice-Hall, Englewood Cliffs (2000)Google Scholar
  9. 9.
    Pagel, B.-U., Six, H-W., Winter, M.: Window Query-Optimal Clustering of Spatial Objects. In: Proc. of Int’l. Conf. on Very Large Data Bases. VLDB., pp. 506–515 (1997)Google Scholar
  10. 10.
    Seidl, T., Kriegel, H.-P.: Optimal Multi-Step k-Nearest Neighbor Search. In: Proc. of Int’l. Conf. on Management of Data. ACM SIGMOD, pp. 154–165. ACM Press, New York (1998)Google Scholar
  11. 11.
    Weber, R., Schek, H.J., Blott, S.: A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces. In: Proc. of Int’l. Conf. on Very Large Data Bases. VLDB., pp. 194–205 (1998)Google Scholar
  12. 12.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Seungdo Jeong
    • 1
  • Sang-Wook Kim
    • 2
  • Byung-Uk Choi
    • 2
  1. 1.Department of Electrical and Computer Engineering, Hanyang University 
  2. 2.College of Information and Communications, Hanyang University, 17 Haengdang-dong, Sungdong-gu, Seoul, 133-791Korea

Personalised recommendations