Proceedings Paper
Tight framelets on graphs for multiscale data analysis| Format | Member Price | Non-Member Price |
|---|---|---|
| $17.00 | $21.00 |
Paper 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.
Paper Details
Date Published: 9 September 2019
PDF: 12 pages
Proc. SPIE 11138, Wavelets and Sparsity XVIII, 111380B (9 September 2019); doi: 10.1117/12.2528414
Published in SPIE Proceedings Vol. 11138:
Wavelets and Sparsity XVIII
Dimitri Van De Ville; Manos Papadakis; Yue M. Lu, Editor(s)
PDF: 12 pages
Proc. SPIE 11138, Wavelets and Sparsity XVIII, 111380B (9 September 2019); doi: 10.1117/12.2528414
Show Author Affiliations
Yu Guang Wang, The Univ. of New South Wales (Australia)
Xiaosheng Zhuang, City Univ. of Hong Kong (Hong Kong, China)
Published in SPIE Proceedings Vol. 11138:
Wavelets and Sparsity XVIII
Dimitri Van De Ville; Manos Papadakis; Yue M. Lu, Editor(s)
© SPIE. Terms of Use
