Unsupervised learning of compositional sparse code for natural image representation
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 1391397 (Why is no real title available?)
- rm K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- Atomic Decomposition by Basis Pursuit
- Composition systems
- Estimating the dimension of a model
- Exploratory Projection Pursuit
- From information scaling of natural images to regimes of statistical models
- Information and complexity in statistical modeling.
- LIBLINEAR: a library for large linear classification
- Matching pursuits with time-frequency dictionaries
- Mathematical classification and clustering
- Model Selection and Estimation in Regression with Grouped Variables
- Model-Based Clustering, Discriminant Analysis, and Density Estimation
- Support union recovery in high-dimensional multivariate regression
- Uncertainty principles and ideal atomic decomposition
Cited in
(6)- Unsupervised neural networks for the identification of minimum overcomplete basis in visual data
- Beyond Explicit Codebook Generation: Visual Representation Using Implicitly Transferred Codebooks
- A tale of three probabilistic families: discriminative, descriptive, and generative models
- scientific article; zbMATH DE number 1223038 (Why is no real title available?)
- Combining Reconstruction and Discrimination with Class-Specific Sparse Coding
- Learning sparse FRAME models for natural image patterns
This page was built for publication: Unsupervised learning of compositional sparse code for natural image representation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5420097)