𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fast wavelet-based Karhunen–Loeve transform

✍ Scribed by Ian R. Greenshields; Joel A. Rosiene

Book ID
104161926
Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
232 KB
Volume
31
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.

✦ Synopsis

The paper describes the role of the standard wavelet decomposition in computing a fast Karhunen-Loeve transform. The standard wavelet decomposition (which we show is different from the conventional wavelet transform) leads to a highly sparse and simply structured transformed version of the correlation matrix which can be easily subsetted (with little loss of Frobenius norm). The eigenstructure of this smaller matrix can be efficiently computed using standard algorithms such as QL. Finally, we provide an example of the use of the efficient transform by classifying a 219-channel AVIRIS image with respect to its eigensystem.

📜 SIMILAR VOLUMES

A Fast Approximate Karhunen-Loève Transf
A Fast Approximate Karhunen-Loève Transform (AKLT) for Data Compression
✍ Irving S. Reed; Leu-Shing Lan 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 508 KB

The Karhunen-Loève transform is known to be the optimal transform for data compression. However, since it is signal dependent and lacks a fast algorithm, it is not used in practice. In this paper, a fast approximate Karhunen-Loève transform (AKLT) is presented. This new transform is derived using pe

A Karhunen-Loève based Galerkin approxim
A Karhunen-Loève based Galerkin approximation to Boussinesq equation
✍ I.Hakan Tarman 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 714 KB

The Boussinesq equation which is derived from the Navier-Stokes equation is approximated by the amplitude equations constructed through the Karhunen-Loeve (K-L) based Galerkin projection. The construction is worked out in a systematic way and some numerical experiments are performed. It is shown n