Tight framelets on graphs for multiscale data analysis

Yu Guang Wang; Xiaosheng Zhuang

doi:10.1117/12.2528414

9 September 2019 Tight framelets on graphs for multiscale data analysis

Yu Guang Wang, Xiaosheng Zhuang

Proceedings Volume 11138, Wavelets and Sparsity XVIII; 111380B (2019) https://doi.org/10.1117/12.2528414
Event: SPIE Optical Engineering + Applications, 2019, San Diego, California, United States

Abstract

In this paper, we discuss the construction and applications of decimated tight framelets on graphs. Based on graph clustering algorithms, a coarse-grained chain of graphs can be constructed where a suitable orthonormal eigenpair can be deduced. Decimated tight framelets can then be constructed based on the orthonormal eigen-pair. Moreover, such tight framelets are associated with filter banks with which fast framelet transform algorithms can be realized. An explicit toy example of decimated tight framelets on a graph is provided.

Citation Download Citation

Yu Guang Wang and Xiaosheng Zhuang "Tight framelets on graphs for multiscale data analysis", Proc. SPIE 11138, Wavelets and Sparsity XVIII, 111380B (9 September 2019); https://doi.org/10.1117/12.2528414

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available