Journal
2021 ASIA-PACIFIC SIGNAL AND INFORMATION PROCESSING ASSOCIATION ANNUAL SUMMIT AND CONFERENCE (APSIPA ASC)
Volume -, Issue -, Pages 330-336Publisher
IEEE
Keywords
-
Categories
Funding
- JST CREST [JPMJCR1662, JPMJCR1666]
- JSPS KAKENHI [20H02145, 19H04135, 18H05413]
- Grants-in-Aid for Scientific Research [19H04135, 18H05413, 20H02145] Funding Source: KAKEN
Ask authors/readers for more resources
This paper proposes a novel recovering framework for dynamic graph signal models that leverage both temporal and vertex-domain priors, by introducing regularization terms in a convex optimization problem to capture behaviors of graph signals in the two domains and integrate the dynamics of the dynamic graph topology. Experimental comparisons with conventional frameworks on synthetic datasets demonstrate the advantageous results of the proposed method in numerous settings.
Conventional studies on time-varying graph signal recovery involve leveraging priors of both temporal and vertex domains for effective estimations. However, these methods all assume a static graph, in spite of the time-varying signals. We believe that such assumption, a static graph signal model, is insufficient to represent some cases where the underlying graph is explicitly dynamic. In this paper, we propose a novel recovering framework for dynamic graph signal models that leverage both temporal and vertex-domain priors. To achieve this, we introduce regularization terms in a convex optimization problem that capture behaviors of graph signals in the two domains, respectively, and integrate the dynamics of the dynamic graph topology into the formulation. We compare the proposed framework to the conventional framework through experiments on synthetic datasets to show the advantageous results of our method in numerous settings.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available