Comparison of Dimension Reduction Methods for Database-Adaptive 3D Model Retrieval
- Cite this paper as:
- Ohbuchi R., Kobayashi J., Yamamoto A., Shimizu T. (2008) Comparison of Dimension Reduction Methods for Database-Adaptive 3D Model Retrieval. In: Boujemaa N., Detyniecki M., Nürnberger A. (eds) Adaptive Multimedia Retrieval: Retrieval, User, and Semantics. AMR 2007. Lecture Notes in Computer Science, vol 4918. Springer, Berlin, Heidelberg
Distance measures, along with shape features, are the most critical components in a shape-based 3D model retrieval system. Given a shape feature, an optimal distance measure will vary per query, per user, or per database. No single, fixed distance measure would be satisfactory all the time. This paper focuses on a method to adapt distance measure to the database to be queried by using learning-based dimension reduction algorithms. We experimentally compare six such dimension reduction algorithms, both linear and non-linear, for their efficacy in the context of shape-based 3D model retrieval. We tested the efficacy of these methods by applying them to five global shape features. Among the dimension reduction methods we tested, non-linear manifold learning algorithms performed better than the other, e.g. linear algorithms such as principal component analysis. Performance of the best performing combination is roughly the same as the top finisher in the SHREC 2006 contest.
Unable to display preview. Download preview PDF.