The adaptive subspace map for texture segmentation

A nonlinear mixture-of-subspaces model is proposed to describe images. Images or image patches, when translated, rotated or scaled, lie in low-dimensional subspaces of the high-dimensional space spanned by the grey values. These manifolds can locally be approximated by a linear subspace. The adaptive subspace map is a method to learn such a mixture-of-subspaces from the data. Due to its general nature, various clustering and subspace-finding algorithms can be used. In the paper, two clustering algorithms are compared in an application to some texture segmentation problems. It is shown to compare well to a standard Gabor filter bank approach.

[1]  Teuvo Kohonen,et al.  Self-Organizing Maps , 2010 .

[2]  Geoffrey E. Hinton,et al.  Modeling the manifolds of images of handwritten digits , 1997, IEEE Trans. Neural Networks.

[3]  Heikki Riittinen,et al.  Spectral classification of phonemes by learning subspaces , 1979, ICASSP.

[4]  Christopher M. Bishop,et al.  Mixtures of Probabilistic Principal Component Analyzers , 1999, Neural Computation.

[5]  Samuel Kaski,et al.  Self-Organized Formation of Various Invariant-Feature Filters in the Adaptive-Subspace SOM , 1997, Neural Computation.

[6]  Anil K. Jain,et al.  Unsupervised texture segmentation using Gabor filters , 1990, 1990 IEEE International Conference on Systems, Man, and Cybernetics Conference Proceedings.

[7]  Helge J. Ritter,et al.  A neural 3-D object recognition architecture using optimized Gabor filters , 1996, Proceedings of 13th International Conference on Pattern Recognition.

[8]  Josef Kittler,et al.  The Adaptive Subspace Map for Image Description and Image Database Retrieval , 2000, SSPR/SPR.