On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD (Q741264): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034683677 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1301.3375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative thresholding for sparse approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Discrete Curvelet Transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to frames and Riesz bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ten Lectures on Wavelets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteratively reweighted least squares minimization for sparse recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive greedy approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable recovery of sparse overcomplete representations in the presence of noise / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dictionary Identification—Sparse Matrix-Factorization via $\ell_1$-Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dictionary Learning Algorithms for Sparse Representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: $K$-Dimensional Coding Schemes in Hilbert Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: CoSaMP: Iterative signal recovery from incomplete and inaccurate samples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dictionary Learning for L1-Exact Sparse Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Least Squares Dictionary Learning Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greed is Good: Algorithmic Results for Sparse Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the conditioning of random subdictionaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dictionary Learning for Sparse Approximations With the Majorization Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blind Source Separation by Sparse Decomposition in a Signal Dictionary / rank
 
Normal rank

Revision as of 00:34, 9 July 2024

scientific article
Language Label Description Also known as
English
On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD
scientific article

    Statements

    On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD (English)
    0 references
    0 references
    11 September 2014
    0 references
    dictionary learning
    0 references
    sparse coding
    0 references
    sparse component analysis
    0 references
    K-SVD
    0 references
    finite sample size
    0 references
    sampling complexity
    0 references
    dictionary identification
    0 references
    minimisation criterion
    0 references
    sparse representation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references