Image analysis with nonlinear adaptive dimension reduction
Xinlei Chen, Xinquan Qu, Zijian Li · 2011
In multimedia applications, dimension reduction is essential to the effectiveness and efficiency of an algorithm due to the curse of dimensionality. Recently, its adaptive variants have received considerable attention in unsupervised learning since a single pass without label information often fails to guarantee an optimal representation, especially when the parameters are not set properly. However, most such methods are basically linear, therefore unable to consider the geometrical structure of the data space. In this paper, we propose a novel algorithm called Nonlinear Adaptive Dimension Reduction (NADR), which adaptively learns the optimal low-dimensional coordinates that preserve the intrinsic geometric structure of the original data. Moreover, the incorporation of K-means enables NADR to be a powerful alternative for cluster analysis. Experiments on benchmark image data sets illustrate that NADR outperforms the state-of-the-art adaptive dimension reduction methods.