An automatic and parameter-free information-based method for sparse representation in wavelet bases

DOI10.1016/J.MATCOM.2019.09.016OpenAlexW2977103243WikidataQ127198304 ScholiaQ127198304MaRDI QIDQ1998046

L. Della Cioppa, Domenico Vitulano, Vittoria Bruni

Publication date: 6 March 2021

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.matcom.2019.09.016

zbMATH Keywords

differential entropysparse representationnon-linear approximationinformation measurenormalized information distance (NID)

Mathematics Subject Classification ID

Numerical approximation and computational geometry (primarily algorithms) (65Dxx) Communication, information (94Axx) Approximations and expansions (41Axx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx)

Related Items (2)

Applied scientific computing XV: innovative modeling and simulation in sciences ⋮ A solution for the greedy approximation of a step function with a waveform dictionary

Uses Software

• LSTRS
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast computation method for time scale signal denoising
• Estimation of the mean of a multivariate normal distribution
• Nonlinear solution of linear inverse problems by wavelet-vaguelette decomposition
• Time-scale energy based analysis of contours of real-world shapes
• Time-scale similarities for robust image de-noising
• A New Matrix-Free Algorithm for the Large-Scale Trust-Region Subproblem
• Atomic Decomposition by Basis Pursuit
• Adaptive wavelet thresholding for image denoising and compression
• Clustering by Compression
• The Similarity Metric
• Greed is Good: Algorithmic Results for Sparse Approximation
• Ten Lectures on Wavelets
• Practical Approximate Solutions to Linear Operator Equations When the Data are Noisy
• The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
• Ideal spatial adaptation by wavelet shrinkage
• Matching pursuits with time-frequency dictionaries
• Entropy-based algorithms for best basis selection
• Adaptive greedy approximations

This page was built for publication: An automatic and parameter-free information-based method for sparse representation in wavelet bases