Translator Disclaimer
9 September 2019 Tight framelets on graphs for multiscale data analysis
Author Affiliations +
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.
© (2019) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
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
PROCEEDINGS
12 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

Image segmentation using optical wavelets
Proceedings of SPIE (June 30 1992)
Exact sampling results for 1D and 2D signals with finite...
Proceedings of SPIE (September 17 2005)

Back to Top