Neural Comp. Sign up for ETOCS
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Grimes, D. B.
Right arrow Articles by Rao, R. P. N.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Grimes, D. B.
Right arrow Articles by Rao, R. P. N.
(Neural Computation. 2005;17:47-73.)
© 2005 The MIT Press


Letter

Bilinear Sparse Coding for Invariant Vision

David B. Grimes

grimes{at}cs.washington.edu, Department of Computer Science and Engineering, University of Washington, Seattle, WA 98195-2350, U.S.A

Rajesh P. N. Rao

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:


Home page
Neural Comput.Home page
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]


Home page
Neural Comput.Home page
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]


Home page
Neural Comput.Home page
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]


Home page
Neural Comput.Home page
P. Dayan
Images, Frames, and Connectionist Hierarchies.
Neural Comput., October 1, 2006; 18(10): 2293 - 2319.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
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
Copyright © 2005 by The MIT Press.