160 likes | 169 Views
Explore a novel approach for fast learning and adaptive subspace construction using the ASSOM algorithm, achieving linear computational load. Discover how this method is applied to generate invariant image features for classification tasks.
E N D
Fast-Learning Adaptive-Subspace Self-Organizing Map: An Application to Saliency-BasedInvariant Image Feature Construction Presenter : You Lin Chen Authors : Huicheng Zheng, Member, IEEE, Grégoire Lefebvre, and Christophe Laurent 2007.WI.7
Outline • Motivation • Objective • Methodology • Experiments • Conclusion • Comments
Motivation The traditional learning procedure of the ASSOM involves computations related to a rotation operator matrix. The rotation computations which not only is memory demanding, but also has computational load quadratic to the input dimension.
2 4.8 3.3 22+4.82+3.32
Objectives In this paper will show that in the ASSOM learning which leads to a computational load linear to both the input dimension and the subspace dimension. we are also interested in applying ASSOM to saliency-based invariant feature construction for image classification.
Methodology_1 Kohonen’s ASSOM learning algorithm
Methodology_1 Robbins–Monro stochastic approximation
Methodology_1 BFL-ASSOM ASSOM BFL-ASSOM FL-ASSOM
Experiments_1 The input episodes are generated by filtering a whitenoise image with a second-order Butterworth filter. The cutoff frequency isset to 0.6 times the Nyquist frequency of the sampling lattice.
Conclusion • The ASSOMis useful for dimension reduction, invariant feature generation, and visualization. • BFL-ASSOM, where the increment of each basis vector is a linear combination of the component vectors in the input episode. • The SPMAS showed promising performance on a ten-category image classification problem
Comments • Advantage • … • Drawback • … • Application • …