scispace - formally typeset
Proceedings ArticleDOI

Efficient signal coding with hierarchical lapped transforms

H.S. Malvar
- pp 1519-1522
Reads0
Chats0
TLDR
The hierarchical lapped transform has a much lower computational complexity than a tree-structured QMF filter bank, and so with HLTs a much larger number of bands can be used in practice.
Abstract
The hierarchical lapped transform (HLT) is defined. It is based on the modulated lapped transform (MLT). The HLT has a much lower computational complexity than a tree-structured QMF filter bank, and so with HLTs a much larger number of bands can be used in practice. The coding gain of HLTs is close to that of a full-length MLT, for the same number of bands, and therefore there is no significant loss of coding efficiency. With HLTs transient signals can be better reconstructed than with nonhierarchical transforms, as demonstrated by speech and image coding examples. In image coding applications, the HLT can also be used for progressive transmission. >

read more

Citations
More filters
Journal ArticleDOI

Perceptual coding of digital audio

TL;DR: This paper reviews methodologies that achieve perceptually transparent coding of FM- and CD-quality audio signals, including algorithms that manipulate transform components, subband signal decompositions, sinusoidal signal components, and linear prediction parameters, as well as hybrid algorithms that make use of more than one signal model.
Journal ArticleDOI

Best wavelet packet bases in a rate-distortion sense

TL;DR: A fast rate-distortion (R-D) optimal scheme for coding adaptive trees whose individual nodes spawn descendents forming a disjoint and complete basis cover for the space spanned by their parent nodes is presented.
BookDOI

The transforms and applications handbook

TL;DR: Poularikas et al. as discussed by the authors proposed the Hartley Transform, Kraig J. Olejniczak, University of Arkansas, Fayetteville Laplace Transforms, Samuel Seely (deceased), Westbrook, Connecticut The Z-Transform, Alexander D. Poularis et al., University of Alabama in Huntsville Hilbert Transform, Stefan L. Hahn, Warsaw University of Technology Radon and Abel Transforms.
Journal ArticleDOI

Biorthogonal and nonuniform lapped transforms for transform coding with reduced blocking and ringing artifacts

TL;DR: The HLBT has a significantly lower computational complexity than the lapped orthogonal transform (LOT), essentially no blocking artifacts, and fewer ringing artifacts than the commonly used discrete cosine transform (DCT).
Journal ArticleDOI

On denoising and best signal representation

TL;DR: A best basis algorithm for signal enhancement in white Gaussian noise is proposed and an estimator of the mean-square error is proposed based on a heuristic argument and the reconstruction performance based upon it is compared to that based on the Stein (1981) unbiased risk estimator.
References
More filters
Journal ArticleDOI

A theory for multiresolution signal decomposition: the wavelet representation

TL;DR: In this paper, it is shown that the difference of information between the approximation of a signal at the resolutions 2/sup j+1/ and 2 /sup j/ (where j is an integer) can be extracted by decomposing this signal on a wavelet orthonormal basis of L/sup 2/(R/sup n/), the vector space of measurable, square-integrable n-dimensional functions.
Journal ArticleDOI

The Laplacian Pyramid as a Compact Image Code

TL;DR: A technique for image encoding in which local operators of many scales but identical shape serve as the basis functions, which tends to enhance salient image features and is well suited for many image analysis tasks as well as for image compression.

Digital Coding of Waveforms

Peter No
Journal ArticleDOI

Subband coding of images

TL;DR: A simple yet efficient extension of this concept to the source coding of images by specifying the constraints for a set of two-dimensional quadrature mirror filters for a particular frequency-domain partition and showing that these constraints are satisfied by a separable combination of one-dimensional QMF's.
Journal ArticleDOI

The LOT: transform coding without blocking effects

TL;DR: An exact derivation of an optimal lapped orthogonal transform (LOT) is presented, related to the discrete cosine transform (DCT) in such a way that a fast algorithm for a nearly optimal LOT is derived.