A Greedy Approach to $\ell_{0,\infty}$-Based Convolutional Sparse Coding (Q5236637): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1812.10538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse and Redundant Modeling of Image Content Using an Image-Signature-Dictionary / 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: Shift & 2D Rotation Invariant Sparse Coding for Multivariate Signals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted Couple Sparse Representation With Classified Regularization for Impulse Noise Removal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Decomposition by Basis Pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ <sup>1</sup> minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncertainty principles and ideal atomic decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse and Redundant Representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching pursuits with time-frequency dictionaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4636996 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Working Locally Thinking Globally: Theoretical Guarantees for Convolutional Sparse Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double Sparsity: Learning Sparse Dictionaries for Sparse Signal Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trainlets: Dictionary Learning in High Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864293 / 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: Efficient Algorithms for Convolutional Sparse Representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convolutional Sparse and Low-Rank Coding-Based Image Decomposition / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964184986 / rank
 
Normal rank

Latest revision as of 10:27, 30 July 2024

scientific article; zbMATH DE number 7115024
Language Label Description Also known as
English
A Greedy Approach to $\ell_{0,\infty}$-Based Convolutional Sparse Coding
scientific article; zbMATH DE number 7115024

    Statements

    A Greedy Approach to $\ell_{0,\infty}$-Based Convolutional Sparse Coding (English)
    0 references
    0 references
    0 references
    0 references
    9 October 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    convolutional sparse coding
    0 references
    global modeling
    0 references
    local processing
    0 references
    greedy algorithms
    0 references
    sparse representations
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references