SOTAVerified

Dictionary Learning

Dictionary Learning is an important problem in multiple areas, ranging from computational neuroscience, machine learning, to computer vision and image processing. The general goal is to find a good basis for given data. More formally, in the Dictionary Learning problem, also known as sparse coding, we are given samples of a random vector $y\in\mathbb{R}^n$, of the form $y=Ax$ where $A$ is some unknown matrix in $\mathbb{R}^{n×m}$, called dictionary, and $x$ is sampled from an unknown distribution over sparse vectors. The goal is to approximately recover the dictionary $A$.

Source: Polynomial-time tensor decompositions with sum-of-squares

Papers

Showing 401410 of 823 papers

TitleStatusHype
Exploring the Effect of Sparse Recovery on the Quality of Image Superresolution0
Jointly Learning Non-negative Projection and Dictionary with Discriminative Graph Constraints for Classification0
Exploiting Low-dimensional Structures to Enhance DNN Based Acoustic Modeling in Speech Recognition0
Joint Projection and Dictionary Learning using Low-rank Regularization and Graph Constraints0
Joint Representation of Multiple Geometric Priors via a Shape Decomposition Model for Single Monocular 3D Pose Estimation0
Joint Sensing Matrix and Sparsifying Dictionary Optimization for Tensor Compressive Sensing0
Convolutional Dictionary Regularizers for Tomographic Inversion0
Joint Sparse Representations and Coupled Dictionary Learning in Multi-Source Heterogeneous Image Pseudo-color Fusion0
Explainable Trajectory Representation through Dictionary Learning0
Example Selection For Dictionary Learning0
Show:102550
← PrevPage 41 of 83Next →

No leaderboard results yet.