Method of optimal directions for frame design

Published 1 January 1999

Kjersti Engan, S.O. Aase, J.H. Husøy

DOI10.1109/icassp.1999.760624

Citations1,254

TL;DR

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%.

Keywords

Computer ScienceEngineering

Vector Quantization and Signal Compression

7,039 Citations1992A. Gersho, Robert M. Gray

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.

Wavelets and Subband Coding

2,913 Citations1995Martin Vetterli, Jelena Kovačević

Wavelets and Subband Coding offered a unified view of the exciting field of wavelets and their discrete-time cousins, filter banks, or subband coding and developed the theory in both continuous and discrete time.

View PDF

SIAM Journal on ComputingSparse Approximate Solutions to Linear Systems

2,822 Citations1995B. K. Natarajan

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

IEEE Transactions on Information TheoryQuantized overcomplete expansions in IR/sup N/: analysis, synthesis, and algorithms

437 Citations1998Vivek K Goyal, Martin Vetterli +1 more

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.

View PDF

IEEE Transactions on Signal ProcessingAnalysis of low bit rate image transform coding

289 Citations1998Stéphane Mallat, Frédéric Falzon

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.

Signal processing with the sparseness constraint

92 Citations2002Bhaskar D. Rao

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.

Matching pursuit with damped sinusoids

71 Citations2002Michael M. Goodwin

The matching pursuit algorithm derives an expansion of a signal in terms of the elements of a large dictionary of time-frequency atoms to derive expansions with respect to dictionary subspaces, leading to a framework for deriving real-valued expansions of real signals using complex atoms.

Designing frames for matching pursuit algorithms

25 Citations2002Kjersti Engan, S.O. Aase +1 more

Experiments demonstrate that the approximation capabilities, in terms of mean square error (MSE), of the optimized frames are significantly better than those found using frames designed by ad hoc techniques.

IEEE Signal Processing LettersImage representation using nonorthogonal basis images with adaptive weight optimization

17 Citations1996Wasfy B. Mikhael, A.P. Berg

This paper presents a new adaptive parallel mixed transform technique for image representation with greatly reduced computational complexity compared to existing mixed-transform techniques, making mixed- transform-based image coding practical.

Zenodo (CERN European Organization for Nuclear Research)Optimized Frame Design For A Matching Pursuit Based Compression Scheme

2 Citations1998Kjersti Engan, John Håkon Husøy +1 more

A technique for designing frames to use with vector selection algorithms, for example Matching Pursuits (MP), is presented along with a novel compression scheme using these optimized frames to apply to electrocardiogram (ECG) signals.

View PDF