Paper
24 August 2015 Scalable filter banks
Youngmi Hur, Kasso A. Okoudjou
Author Affiliations +
Abstract
A finite frame is said to be scalable if its vectors can be rescaled so that the resulting set of vectors is a tight frame. The theory of scalable frame has been extended to the setting of Laplacian pyramids which are based on (rectangular) paraunitary matrices whose column vectors are Laurent polynomial vectors. This is equivalent to scaling the polyphase matrices of the associated filter banks. Consequently, tight wavelet frames can be constructed by appropriately scaling the columns of these paraunitary matrices by diagonal matrices whose diagonal entries are square magnitude of Laurent polynomials. In this paper we present examples of tight wavelet frames constructed in this manner and discuss some of their properties in comparison to the (non tight) wavelet frames they arise from.
© (2015) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Youngmi Hur and Kasso A. Okoudjou "Scalable filter banks", Proc. SPIE 9597, Wavelets and Sparsity XVI, 95970Q (24 August 2015); https://doi.org/10.1117/12.2186168
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Wavelets

Matrices

Mathematics

Current controlled current source

Linear algebra

Ranging

Seaborgium

RELATED CONTENT

Preconditioning of frames
Proceedings of SPIE (September 26 2013)
Quasi-symmetric designs and equiangular tight frames
Proceedings of SPIE (August 24 2015)
Tightness of stability bounds by null space property
Proceedings of SPIE (August 24 2015)
Spectral radius of sets of matrices
Proceedings of SPIE (October 11 1994)
Adapted wavelet computation methods
Proceedings of SPIE (April 06 1995)

Back to Top