Compressed Data Separation With Redundant Dictionaries

DOI10.1109/TIT.2013.2252397MaRDI QIDQ5346459zbMATH OpenFDO

Authors

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2013.2252397

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cited in

(15)

• Compressed data separation via dual frames based split-analysis with Weibull matrices
• Phase retrieval of complex and vector-valued functions
• Iterative hard thresholding for compressed data separation
• Signal separation under coherent dictionaries and _p-bounded noise
• New conditions on stable recovery of weighted sparse signals via weighted l₁ minimization
• Compressed data structures: Dictionaries and data-aware measures
• Convex optimization in sums of Banach spaces
• Compressed data separation via unconstrained l1-split analysis
• Phase retrieval from short-time fractional Fourier measurements using alternating direction method of multipliers
• Inertial proximal ADMM for separable multi-block convex optimizations and compressive affine phase retrieval
• Stable Recovery of Sparsely Corrupted Signals Through Justice Pursuit De-Noising
• Compressed data separation via \(\ell_q\)-split analysis with \(\ell_\infty\)-constraint
• Sample complexity bounds for the local convergence of least squares approximation
• Compressed data separation under _p bounded noise
• Convergence on thresholding-based algorithms for dictionary-sparse recovery

This page was built for publication: Compressed Data Separation With Redundant Dictionaries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346459)