Signal processing on simplicial complexes with vertex signals
In classical graph signal processing (GSP), the underlying topological structures are restricted in terms of dimensionality. A graph or a 1-complex is a combinatorial object that models binary relations, which do not directly capture complex high arity relations. One possible high dimensional genera...
Saved in:
Main Authors: | Ji, Feng, Kahn, Giacomo, Tay, Wee Peng |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Article |
Language: | English |
Published: |
2023
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/164992 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
SGAT: simplicial Graph attention network
by: Lee, See Hian, et al.
Published: (2022) -
Kernel ridge regression for generalized graph signal processing
by: Jian, Xingchao, et al.
Published: (2023) -
A Hilbert space theory of generalized graph signal processing
by: Ji, Feng, et al.
Published: (2021) -
Wide-sense stationarity and spectral estimation for generalized graph signal
by: Jian, Xingchao, et al.
Published: (2022) -
Graph signal processing over a probability space of shift operators
by: Ji, Feng, et al.
Published: (2023)