An automatic and parameter-free information-based method for sparse representation in wavelet bases
From MaRDI portal
Publication:1998046
Recommendations
Cites work
- scientific article; zbMATH DE number 192914 (Why is no real title available?)
- scientific article; zbMATH DE number 1215245 (Why is no real title available?)
- scientific article; zbMATH DE number 194432 (Why is no real title available?)
- scientific article; zbMATH DE number 1380579 (Why is no real title available?)
- scientific article; zbMATH DE number 802858 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A fast computation method for time scale signal denoising
- A new matrix-free algorithm for the large-scale trust-region subproblem
- Adaptive greedy approximations
- Adaptive wavelet thresholding for image denoising and compression
- Atomic decomposition by basis pursuit
- Clustering by Compression
- Entropy-based algorithms for best basis selection
- Estimation of the mean of a multivariate normal distribution
- Greed is Good: Algorithmic Results for Sparse Approximation
- Ideal spatial adaptation by wavelet shrinkage
- Matching pursuits with time-frequency dictionaries
- Nonlinear solution of linear inverse problems by wavelet-vaguelette decomposition
- Practical Approximate Solutions to Linear Operator Equations When the Data are Noisy
- Ten Lectures on Wavelets
- The Similarity Metric
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
- Time-scale energy based analysis of contours of real-world shapes
- Time-scale similarities for robust image de-noising
Cited in
(4)
This page was built for publication: An automatic and parameter-free information-based method for sparse representation in wavelet bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1998046)