New cyclic sparsity measures for deconvolution based on convex relaxation
From MaRDI portal
Publication:736973
DOI10.1007/S00034-015-9985-8zbMATH Open1342.94046OpenAlexW1998858376MaRDI QIDQ736973FDOQ736973
Authors: Khalid Sabri
Publication date: 5 August 2016
Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00034-015-9985-8
Recommendations
Cites Work
- Least angle regression. (With discussion)
- Pathwise coordinate optimization
- Coordinate descent algorithms for lasso penalized regression
- Title not available (Why is that?)
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Atomic Decomposition by Basis Pursuit
- Matching pursuits with time-frequency dictionaries
- An affine scaling methodology for best basis selection
- Greed is Good: Algorithmic Results for Sparse Approximation
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Title not available (Why is that?)
- Title not available (Why is that?)
- Shrinkage rules for variational minimization problems and applications to analytical ultracentrifugation
- Orthogonal least squares methods and their application to non-linear system identification
- Cyclostationary modeling of ground reaction force signals
- Title not available (Why is that?)
- Deconvolution of cyclostationary signals
Uses Software
This page was built for publication: New cyclic sparsity measures for deconvolution based on convex relaxation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q736973)