Scaling laplacian pyramids

Youngmi Hur, Kasso A. Okoudjou

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


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
Issue number1
Publication statusPublished - 2015

Bibliographical note

Publisher Copyright:
©2015 Society for Industrial and Applied Mathematics.

All Science Journal Classification (ASJC) codes

  • Analysis


Dive into the research topics of 'Scaling laplacian pyramids'. Together they form a unique fingerprint.

Cite this