A Brief Survey of the Graph Wavelet Frame

Complexity 2022:1-12 (2022)
  Copy   BIBTEX

Abstract

In recent years, the research of wavelet frames on the graph has become a hot topic in harmonic analysis. In this paper, we mainly introduce the relevant knowledge of the wavelet frames on the graph, including relevant concepts, construction methods, and related theory. Meanwhile, because the construction of graph tight framelets is closely related to the classical wavelet framelets on ℝ, we give a new construction of tight frames on ℝ. Based on the pseudosplines of type II, we derive an MRA tight wavelet frame with three generators ψ 1, ψ 2, and ψ 3 using the oblique extension principle, which generate a tight wavelet frame in L 2 ℝ. We analyze that three wavelet functions have the highest possible order of vanishing moments, which matches the order of the approximation order of the framelet system provided by the refinable function. Moreover, we introduce the construction of the Haar basis for a chain and analyze the global orthogonal bases on a graph G. Based on the sequence of framelet generators in L 2 ℝ and the Haar basis for a coarse-grained chain, the decimated tight framelets on graphs can be constructed. Finally, we analyze the detailed construction process of the wavelet frame on a graph.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,674

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A logician's view of graph polynomials.J. A. Makowsky, E. V. Ravve & T. Kotek - 2019 - Annals of Pure and Applied Logic 170 (9):1030-1069.
Random generations of the countable random graph.Su Gao & A. Vershik - 2006 - Annals of Pure and Applied Logic 143 (1-3):79-86.
Isomorphisms and nonisomorphisms of graph models.Harold Schellinx - 1991 - Journal of Symbolic Logic 56 (1):227-249.
Effective coloration.Dwight R. Bean - 1976 - Journal of Symbolic Logic 41 (2):469-480.
Graph Spectra for Communications in Biological and Carbon Nanotube Networks.Stephen F. Bush & Sanjay Goel - forthcoming - Ieee Journal on Selected Areas in Communications:1--10.
On the finiteness of the recursive chromatic number.William I. Gasarch & Andrew C. Y. Lee - 1998 - Annals of Pure and Applied Logic 93 (1-3):73-81.

Analytics

Added to PP
2022-10-05

Downloads
9 (#1,272,715)

6 months
6 (#574,647)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references