Signal-adapted decomposition of graph signals
| Title: | Signal-adapted decomposition of graph signals |
|---|---|
| Authors: | Behjat, Harry H., Westin, Carl-Fredrik, Ossenkoppele, Rik, Van De Ville, Dimitri |
| Publication Year: | 2025 |
| Subject Terms: | Electrical Engineering and Systems Science - Signal Processing |
| More Details: | Analysis of signals defined on complex topologies modeled by graphs is a topic of increasing interest. Signal decomposition plays a crucial role in the representation and processing of such information, in particular, to process graph signals based on notions of scale (e.g., coarse to fine). The graph spectrum is more irregular than for conventional domains; i.e., it is influenced by graph topology, and, therefore, assumptions about spectral representations of graph signals are not easy to make. Here, we propose a tight frame design that is adapted to the graph Laplacian spectral content of given classes of graph signals. The design is based on using the ensemble energy spectral density, a notion of spectral content of given signal sets that we determine either directly using the graph Fourier transform or indirectly through a polynomial-based approximation scheme. The approximation scheme has the benefit that (i) it does not require eigendecomposition of the Laplacian matrix making the method feasible for large graphs, and (ii) it leads to a smooth estimate of the spectral content. A prototype system of spectral kernels each capturing an equal amount of energy is initially defined and subsequently warped using the signal set's ensemble energy spectral density such that the resulting subbands each capture an equal amount of ensemble energy. This approach accounts at the same time for graph topology and signal features, and it provides a meaningful interpretation of subbands in terms of coarse-to-fine representations. We also show how more simplified designs of signal-adapted decomposition of graph signals can be adopted based on ensemble energy estimates. We show the application of proposed methods on the Minnesota road graph and three different designs of brain graphs derived from neuroimaging data. |
| Document Type: | Working Paper |
| Access URL: | http://arxiv.org/abs/2502.11845 |
| Accession Number: | edsarx.2502.11845 |
| Database: | arXiv |
| FullText | Text: Availability: 0 CustomLinks: – Url: http://arxiv.org/abs/2502.11845 Name: EDS - Arxiv Category: fullText Text: View this record from Arxiv MouseOverText: View this record from Arxiv – Url: https://resolver.ebsco.com/c/xy5jbn/result?sid=EBSCO:edsarx&genre=article&issn=&ISBN=&volume=&issue=&date=20250217&spage=&pages=&title=Signal-adapted decomposition of graph signals&atitle=Signal-adapted%20decomposition%20of%20graph%20signals&aulast=Behjat%2C%20Harry%20H.&id=DOI: Name: Full Text Finder (for New FTF UI) (s8985755) Category: fullText Text: Find It @ SCU Libraries MouseOverText: Find It @ SCU Libraries |
|---|---|
| Header | DbId: edsarx DbLabel: arXiv An: edsarx.2502.11845 RelevancyScore: 1147 AccessLevel: 3 PubType: Report PubTypeId: report PreciseRelevancyScore: 1146.56518554688 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Signal-adapted decomposition of graph signals – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Behjat%2C+Harry+H%2E%22">Behjat, Harry H.</searchLink><br /><searchLink fieldCode="AR" term="%22Westin%2C+Carl-Fredrik%22">Westin, Carl-Fredrik</searchLink><br /><searchLink fieldCode="AR" term="%22Ossenkoppele%2C+Rik%22">Ossenkoppele, Rik</searchLink><br /><searchLink fieldCode="AR" term="%22Van+De+Ville%2C+Dimitri%22">Van De Ville, Dimitri</searchLink> – Name: DatePubCY Label: Publication Year Group: Date Data: 2025 – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%22Electrical+Engineering+and+Systems+Science+-+Signal+Processing%22">Electrical Engineering and Systems Science - Signal Processing</searchLink> – Name: Abstract Label: Description Group: Ab Data: Analysis of signals defined on complex topologies modeled by graphs is a topic of increasing interest. Signal decomposition plays a crucial role in the representation and processing of such information, in particular, to process graph signals based on notions of scale (e.g., coarse to fine). The graph spectrum is more irregular than for conventional domains; i.e., it is influenced by graph topology, and, therefore, assumptions about spectral representations of graph signals are not easy to make. Here, we propose a tight frame design that is adapted to the graph Laplacian spectral content of given classes of graph signals. The design is based on using the ensemble energy spectral density, a notion of spectral content of given signal sets that we determine either directly using the graph Fourier transform or indirectly through a polynomial-based approximation scheme. The approximation scheme has the benefit that (i) it does not require eigendecomposition of the Laplacian matrix making the method feasible for large graphs, and (ii) it leads to a smooth estimate of the spectral content. A prototype system of spectral kernels each capturing an equal amount of energy is initially defined and subsequently warped using the signal set's ensemble energy spectral density such that the resulting subbands each capture an equal amount of ensemble energy. This approach accounts at the same time for graph topology and signal features, and it provides a meaningful interpretation of subbands in terms of coarse-to-fine representations. We also show how more simplified designs of signal-adapted decomposition of graph signals can be adopted based on ensemble energy estimates. We show the application of proposed methods on the Minnesota road graph and three different designs of brain graphs derived from neuroimaging data. – Name: TypeDocument Label: Document Type Group: TypDoc Data: Working Paper – Name: URL Label: Access URL Group: URL Data: <link linkTarget="URL" linkTerm="http://arxiv.org/abs/2502.11845" linkWindow="_blank">http://arxiv.org/abs/2502.11845</link> – Name: AN Label: Accession Number Group: ID Data: edsarx.2502.11845 |
| PLink | https://login.libproxy.scu.edu/login?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsarx&AN=edsarx.2502.11845 |
| RecordInfo | BibRecord: BibEntity: Subjects: – SubjectFull: Electrical Engineering and Systems Science - Signal Processing Type: general Titles: – TitleFull: Signal-adapted decomposition of graph signals Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Behjat, Harry H. – PersonEntity: Name: NameFull: Westin, Carl-Fredrik – PersonEntity: Name: NameFull: Ossenkoppele, Rik – PersonEntity: Name: NameFull: Van De Ville, Dimitri IsPartOfRelationships: – BibEntity: Dates: – D: 17 M: 02 Type: published Y: 2025 |
| ResultId | 1 |