Sparse coding with invariance constraints

20Citations
Citations of this article
35Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We suggest a new approach to optimize the learning of sparse features under the constraints of explicit transformation symmetries imposed on the set of feature vectors. Given a set of basis feature vectors and invariance transformations, from each basis feature a family of transformed features is generated. We then optimize the basis features for optimal sparse reconstruction of the input pattern ensemble using the whole transformed feature family. If the predefined transformation invariance coincides with an invariance in the input data, we obtain a less redundant basis feature set, compared to sparse coding approaches without invariances. We demonstrate the application to a test scenario of overlapping bars and the learning of receptive fields in hierarchical visual cortex models. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Wersing, H., Eggert, J., & Körner, E. (2003). Sparse coding with invariance constraints. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2714, 385–392. https://doi.org/10.1007/3-540-44989-2_46

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free