New cyclic sparsity measures for deconvolution based on convex relaxation

DOI10.1007/S00034-015-9985-8zbMath1342.94046OpenAlexW1998858376MaRDI QIDQ736973

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

zbMATH Keywords

deconvolutionconvex relaxationcyclic sparsitycyclostationaryperiodic random impulses

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Uses Software

• PDCO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Least angle regression. (With discussion)
• Cyclostationary modeling of ground reaction force signals
• Pathwise coordinate optimization
• Coordinate descent algorithms for lasso penalized regression
• An affine scaling methodology for best basis selection
• Greed is Good: Algorithmic Results for Sparse Approximation
• Deconvolution of cyclostationary signals
• Orthogonal least squares methods and their application to non-linear system identification
• Atomic Decomposition by Basis Pursuit
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Matching pursuits with time-frequency dictionaries
• Shrinkage rules for variational minimization problems and applications to analytical ultracentrifugation
• Convergence of a block coordinate descent method for nondifferentiable minimization

This page was built for publication: New cyclic sparsity measures for deconvolution based on convex relaxation