Skip to main navigation Skip to search Skip to main content

Tight framelets on graphs for multiscale data analysis

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

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.
Original languageEnglish
Title of host publicationWavelets and Sparsity XVIII
EditorsDimitri Van De Ville, Manos Papadakis, Yue M. Lu
PublisherSPIE
ISBN (Electronic)9781510629707
ISBN (Print)9781510629691
DOIs
Publication statusPublished - Aug 2019
EventConference on Wavelets and Sparsity XVIII - San Diego, United States
Duration: 13 Aug 201915 Aug 2019

Publication series

NameProceedings of SPIE - The International Society for Optical Engineering
Volume11138
ISSN (Print)0277-786X
ISSN (Electronic)1996-756X

Conference

ConferenceConference on Wavelets and Sparsity XVIII
PlaceUnited States
CitySan Diego
Period13/08/1915/08/19

Research Keywords

  • coarse-grained chain
  • decimated framelets
  • fast algorithms
  • fast framelet transforms
  • filter banks
  • framelets on graphs
  • graph Laplacian
  • graph signal processing
  • spectral graph theory
  • Tight framelets

Fingerprint

Dive into the research topics of 'Tight framelets on graphs for multiscale data analysis'. Together they form a unique fingerprint.

Cite this