2015
DOI: 10.1109/tsp.2014.2369013
|View full text |Cite
|
Sign up to set email alerts
|

Downsampling of Signals on Graphs Via Maximum Spanning Trees

Abstract: Abstract-Downsampling of signals living on a general weighted graph is not as trivial as of regular signals where we can simply keep every other samples. In this paper we propose a simple, yet effective downsampling scheme in which the underlying graph is approximated by a maximum spanning tree (MST) that naturally defines a graph multiresolution. This MST-based method significantly outperforms the two previous downsampling schemes, coloring-based and SVD-based, on both random and specific graphs in terms of c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
43
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 62 publications
(43 citation statements)
references
References 25 publications
0
43
0
Order By: Relevance
“…This is a mapping from N dimensional complex space to N {M dimensional complex space. Similar definitions for the decimator operator have been introduced in the literature [8], [9], [16], [35].…”
Section: Building Blocks For Multirate Processing On Graphsmentioning
confidence: 98%
“…This is a mapping from N dimensional complex space to N {M dimensional complex space. Similar definitions for the decimator operator have been introduced in the literature [8], [9], [16], [35].…”
Section: Building Blocks For Multirate Processing On Graphsmentioning
confidence: 98%
“…The performance of CS GWTs with vertex domain sampling varies according to the graph reduction method used. Graph coloring [26], [27], [51], [52], Kron reduction [11], [53], maximum spanning trees [54], weighted max-cut [55], and graph coarsening using algebraic distance [56] are examples of the various graph reduction methods. [29] Filt.…”
Section: Related Workmentioning
confidence: 99%
“…maximum graph cuts [21] and spanning trees [22]. Finally, there exist randomized sampling strategies, e.g., [23,24,25].…”
Section: Notation and Backgroundmentioning
confidence: 99%