|
|
||||||||
Letter |
grimes{at}cs.washington.edu, Department of Computer Science and Engineering, University of Washington, Seattle, WA 98195-2350, U.S.A
rao{at}cs.washington.edu, Department of Computer Science and Engineering, University of Washington, Seattle, WA 98195-2350, U.S.A
Recent algorithms for sparse coding and independent component analysis (ICA) have demonstrated how localized features can be learned from natural images. However, these approaches do not take image transformations into account. We describe an unsupervised algorithm for learning both localized features and their transformations directly from images using a sparse bilinear generative model. We show that from an arbitrary set of natural images, the algorithm produces oriented basis filters that can simultaneously represent features in an image and their transformations. The learned generative model can be used to translate features to different locations, thereby reducing the need to learn the same feature at multiple locations, a limitation of previous approaches to sparse coding and ICA. Our results suggest that by explicitly modeling the interaction between local image features and their transformations, the sparse bilinear approach can provide a basis for achieving transformation-invariant vision.
This article has been cited by other articles:
![]() |
X. Miao and R. P. N. Rao Learning the Lie Groups of Visual Invariance Neural Comput., October 1, 2007; 19(10): 2665 - 2693. [Abstract] [Full Text] [PDF] |
||||
![]() |
S. Hasler, H. Wersing, and E. Korner Combining reconstruction and discrimination with class-specific sparse coding. Neural Comput., July 1, 2007; 19(7): 1897 - 1918. [Abstract] [Full Text] [PDF] |
||||
![]() |
R. Turner and M. Sahani A maximum-likelihood interpretation for slow feature analysis. Neural Comput., April 1, 2007; 19(4): 1022 - 1038. [Abstract] [Full Text] [PDF] |
||||
![]() |
P. Dayan Images, Frames, and Connectionist Hierarchies. Neural Comput., October 1, 2006; 18(10): 2293 - 2319. [Abstract] [Full Text] [PDF] |
||||
![]() |
B. A. Olshausen and D. J. Field How Close Are We to Understanding V1? Neural Comput., August 1, 2005; 17(8): 1665 - 1699. [Abstract] [Full Text] [PDF] |
||||
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |
| J COGNITIVE NEUROSCIENCE | NEURAL COMPUTATION | MIT PRESS JOURNALS |