scispace - formally typeset
Proceedings ArticleDOI

Tight framelets on graphs for multiscale data analysis

TLDR
The construction and applications of decimated tight framelets on graphs based on graph clustering algorithms, where a coarse-grained chain of graphs can be constructed where a suitable orthonormal eigenpair can be deduced, are discussed.
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.

read more

Citations
More filters
Journal ArticleDOI

Fast Haar Transforms for Graph Neural Networks

TL;DR: Haar convolution as discussed by the authors is a sparse and localized orthonormal system for a coarse-grained chain on the graph, which allows Fast Haar Transforms (FHTs) to be applied to graph convolutions.
Posted Content

Decimated Framelet System on Graphs and Fast G-Framelet Transforms.

TL;DR: This paper proposes a novel multiscale representation system for graph data, called decimated framelets, which form a localized tight frame on the graph which has linear computational complexity O(N) for a graph of size N.
Journal ArticleDOI

Cell graph neural networks enable the precise prediction of patient survival in gastric cancer

TL;DR: In this paper , a graph neural network-based approach was proposed for the digital staging of tumor microenvironment (TME) and precise prediction of patient survival in gastric cancer, which is formulated as either a binary (short-term and long-term ) or ternary (shortterm, medium-term , and longterm ) classification task.
Journal ArticleDOI

Adaptive Directional Haar Tight Framelets on Bounded Domains for Digraph Signal Representations

TL;DR: It is shown that the adaptive directional Haar tight framelet systems can be used for digraph signal representations.
References
More filters
Book

A wavelet tour of signal processing

TL;DR: An introduction to a Transient World and an Approximation Tour of Wavelet Packet and Local Cosine Bases.
Journal ArticleDOI

Geometric Deep Learning: Going beyond Euclidean data

TL;DR: In many applications, such geometric data are large and complex (in the case of social networks, on the scale of billions) and are natural targets for machine-learning techniques as mentioned in this paper.
Journal ArticleDOI

Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps

TL;DR: The process of iterating or diffusing the Markov matrix is seen as a generalization of some aspects of the Newtonian paradigm, in which local infinitesimal transitions of a system lead to global macroscopic descriptions by integration.
Journal ArticleDOI

Framelets: MRA-based constructions of wavelet frames☆☆☆

TL;DR: Wavelet frames constructed via multiresolution analysis (MRA), with emphasis on tight wavelet frames, are discussed and it is shown how they can be used for systematic constructions of spline, pseudo-spline tight frames, and symmetric bi-frames with short supports and high approximation orders.
Journal ArticleDOI

Affine Systems in L2(Rd): The Analysis of the Analysis Operator.

TL;DR: In this paper, the affine product and quasi-affine system were introduced to characterize the structure of affine systems, and sufficient conditions for constructing tight affine frames from multiresolution were given.
Related Papers (5)