Mean squared error bounds for the Rangan-Goyal soft thresholding algorithm

DOI10.1016/J.ACHA.2009.11.001zbMATH Open1198.94049OpenAlexW1964499409MaRDI QIDQ711045FDOQ711045

Alexander M. Powell

Publication date: 25 October 2010

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.acha.2009.11.001

Recommendations

• Optimum thresholding using mean and conditional mean squared error
• A new linear convergence result for the iterative soft thresholding algorithm
• Linear convergence of iterative soft-thresholding
• Between hard and soft thresholding: optimal iterative thresholding algorithms
• scientific article
• On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty
• Thresholding implied by truncated quadratic regularization
• An iterative algorithm for minimum cross entropy thresholding
• Brakke's inequality for the thresholding scheme
• A note on the complexity of proximal iterative hard thresholding algorithm

zbMATH Keywords

consistent reconstructionestimation with uniform noisesoft thresholdingKaczmarz algorithmfinite frames

Mathematics Subject Classification ID

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

Cites Work

• A randomized Kaczmarz algorithm with exponential convergence
• Title not available (Why is that?)
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Complex wavelets for shift invariant analysis and filtering of signals
• Foundations of time-frequency analysis
• Frames and the Feichtinger conjecture
• Quantized overcomplete expansions in IR/sup N/: analysis, synthesis, and algorithms
• Quantized frame expansions with erasures
• Finite normalized tight frames
• Equal-norm tight frames with erasures
• Sigma-delta (/spl Sigma//spl Delta/) quantization and finite frames
• On simple oversampled A/D conversion in L/sup 2/(R)
• Recursive consistent estimation with bounded noise
• Resilience properties of redundant expansions under additive noise and quantization
• White Noise Hypothesis for Uniform Quantization Errors
• The art of frame theory
• On signal reconstruction without phase
• On general frame decompositions
• Second-order sigma-delta (\(\Sigma \Delta\)) quantization of finite frame expansions
• A Randomized Solver for Linear Systems with Exponential Convergence
• Dithered quantizers
• On the whiteness of high-resolution quantization errors
• Efficient quantization for overcomplete expansions in /spl Ropf//sup N/
• Randomly dithered quantization and sigma-delta noise shaping for finite frames
• Sigma-delta quantization errors and the traveling salesman problem
• The Validity of the Additive Noise Model for Uniform Scalar Quantizers
• A necessary and sufficient condition for quantization errors to be uniform and white
• Some iterative algorithms to compute canonical windows for Gabor frames

Cited In (7)

• Title not available (Why is that?)
• Frame permutation quantization
• Error bounds for consistent reconstruction: random polytopes and coverage processes
• Quantization and Finite Frames
• Wavelet optimal estimations for a density with some additive noises
• Iteratively consistent one-bit phase retrieval
• Almost sure convergence of the Kaczmarz algorithm with random measurements

This page was built for publication: Mean squared error bounds for the Rangan-Goyal soft thresholding algorithm

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