Analysis sparse representation for nonnegative signals based on determinant measure by DC programming
DOI10.1155/2018/2685745zbMATH Open1407.94041OpenAlexW2799712260MaRDI QIDQ1722682FDOQ1722682
Authors: Yujie Li, Benying Tan, Atsunori Kanemura, Shuxue Ding, Wuhui Chen 
Publication date: 18 February 2019
Published in: Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2018/2685745
Recommendations
- Dictionary learning based on nonnegative matrix factorization using parallel coordinate descent
- Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\)
- A fast algorithm for learning overcomplete dictionary for sparse representation based on proximal operators
- Efficient nonnegative matrix factorization by DC programming and DCA
- Study on \(L_1\) over \(L_2\) Minimization for nonnegative signal recovery
sparse codinganalysis dictionary learning algorithmanalysis sparse representationand signal updatecomplex nonconvex optimization problemdictionary updatedifference of convex (DC) programmingnonnegative signals
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Cites Work
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Non-negative matrix factorization with sparseness constraints
- Sparse and redundant representations. From theory to applications in signal and image processing.
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Compressed sensing
- Sparsity and incoherence in compressive sampling
- Sparse Approximate Solutions to Linear Systems
- Sparse image and signal processing. Wavelets, curvelets, morphological diversity
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- The cosparse analysis model and algorithms
- Performance Guarantees of the Thresholding Algorithm for the Cosparse Analysis Model
- Learning Multiscale Sparse Representations for Image and Video Restoration
- Extensions of compressed sensing
- Nonnegative matrix factorization for spectral data analysis
- Learning to Sense Sparse Signals: Simultaneous Sensing Matrix and Sparsifying Dictionary Optimization
- Greedy-like algorithms for the cosparse analysis model
- Analysis K-SVD: A Dictionary-Learning Algorithm for the Analysis Sparse Model
- Linear convergence of adaptively iterative thresholding algorithms for compressed sensing
- Comparing Measures of Sparsity
- Analysis Operator Learning and its Application to Image Reconstruction
- Reconstruction of reflectance spectra using robust nonnegative matrix factorization
- Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases
- Manifold optimization-based analysis dictionary learning with an \(\ell_{1/2}\)-norm regularizer
- Learning Sparsifying Transforms
- Blind Spectral Unmixing Based on Sparse Nonnegative Matrix Factorization
- Efficient nonnegative matrix factorization by DC programming and DCA
This page was built for publication: Analysis sparse representation for nonnegative signals based on determinant measure by DC programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1722682)
