Proceedings ArticleDOI
Method of optimal directions for frame design
Kjersti Engan,S.O. Aase,J. Hakon Husoy +2 more
- Vol. 5, pp 2443-2446
Reads0
Chats0
TLDR
Experiments demonstrate that the approximation capabilities, in terms of mean squared error (MSE), of the optimized frames are significantly better than those obtained using frames designed by the algorithm of Engan et.Abstract:
A frame design technique for use with vector selection algorithms, for example matching pursuits (MP), is presented. The design algorithm is iterative and requires a training set of signal vectors. The algorithm, called method of optimal directions (MOD), is an improvement of the algorithm presented by Engan, Aase and Husoy see (Proc. ICASSP '98, Seattle, USA, p.1817-20, 1998). The MOD is applied to speech and electrocardiogram (ECG) signals, and the designed frames are tested on signals outside the training sets. Experiments demonstrate that the approximation capabilities, in terms of mean squared error (MSE), of the optimized frames are significantly better than those obtained using frames designed by the algorithm of Engan et. al. Experiments show typical reduction in MSE by 20-50%.read more
Citations
More filters
Journal ArticleDOI
$rm K$ -SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
TL;DR: A novel algorithm for adapting dictionaries in order to achieve sparse signal representations, the K-SVD algorithm, an iterative method that alternates between sparse coding of the examples based on the current dictionary and a process of updating the dictionary atoms to better fit the data.
Journal ArticleDOI
Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries
Michael Elad,Michal Aharon +1 more
TL;DR: This work addresses the image denoising problem, where zero-mean white and homogeneous Gaussian additive noise is to be removed from a given image, and uses the K-SVD algorithm to obtain a dictionary that describes the image content effectively.
Journal ArticleDOI
Dictionaries for Sparse Representation Modeling
TL;DR: This paper surveys the various options such training has to offer, up to the most recent contributions and structures of the MOD, the K-SVD, the Generalized PCA and others.
Journal ArticleDOI
MR Image Reconstruction From Highly Undersampled k-Space Data by Dictionary Learning
TL;DR: Dramatic improvements on the order of 4-18 dB in reconstruction error and doubling of the acceptable undersampling factor using the proposed adaptive dictionary as compared to previous CS methods are demonstrated.
Journal ArticleDOI
Coupled Dictionary Training for Image Super-Resolution
TL;DR: This paper demonstrates that the coupled dictionary learning method can outperform the existing joint dictionary training method both quantitatively and qualitatively and speed up the algorithm approximately 10 times by learning a neural network model for fast sparse inference and selectively processing only those visually salient regions.
References
More filters
Book
Vector Quantization and Signal Compression
Allen Gersho,Robert M. Gray +1 more
TL;DR: The author explains the design and implementation of the Levinson-Durbin Algorithm, which automates the very labor-intensive and therefore time-heavy and expensive process of designing and implementing a Quantizer.
Journal ArticleDOI
Sparse Approximate Solutions to Linear Systems
TL;DR: It is shown that the problem is NP-hard, but that the well-known greedy heuristic is good in that it computes a solution with at most at most $\left\lceil 18 \mbox{ Opt} ({\bf \epsilon}/2) \|{\bf A}^+\|^2_2 \ln(\|b\|_2/{\bf
Journal ArticleDOI
Quantized overcomplete expansions in IR/sup N/: analysis, synthesis, and algorithms
TL;DR: Results suggest that optimal reconstruction methods will yield O(1/r/sup 2/) mean-squared error (MSE), and that consistency is sufficient to insure this asymptotic behavior.
Journal ArticleDOI
Analysis of low bit rate image transform coding
Stéphane Mallat,F. Falzon +1 more
TL;DR: Calculations based on high-resolution quantizations prove that the distortion rate D(R) of an image transform coding is proportional to 2/sup -2R/ when R is large enough, and shows that the compression performance of an orthonormal basis depends mostly on its ability to approximate images with a few nonzero vectors.
Proceedings ArticleDOI
Signal processing with the sparseness constraint
TL;DR: An overview is given of the role of the sparseness constraint in signal processing problems and it is shown that this is a fundamental problem deserving of attention.
Related Papers (5)
Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries
Michael Elad,Michal Aharon +1 more