Scaling laplacian pyramids

Youngmi Hur, Kasso A. Okoudjou

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Laplacian pyramid-based Laurent polynomial (LP2) matrices are generated by Laurent polynomial column vectors and have long been studied in connection with Laplacian pyramidal algorithms in signal processing. In this paper, we investigate when such matrices are scalable, that is, when right multiplication by Laurent polynomial diagonal matrices results in paraunitary matrices. The notion of scalability has recently been introduced in the context of finite frame theory and can be considered as a preconditioning method for frames. This paper significantly extends the current research on scalable frames to the setting of polyphase representations of filter banks. Furthermore, as applications of our main results we propose new construction methods for tight wavelet filter banks and tight wavelet frames.

Original languageEnglish
Pages (from-to)348-365
Number of pages18
JournalSIAM Journal on Matrix Analysis and Applications
Volume36
Issue number1
DOIs
Publication statusPublished - 2015 Jan 1

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Analysis

Cite this