4.7 Article

Graph Signal Processing for Heterogeneous Change Detection

Journal

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TGRS.2022.3221489

Keywords

Graph signal processing (GSP); graph; heterogeneous change detection (HCD); image regression; spectral domain; structure; vertex domain

Funding

  1. National Key Research and Development Program of China [2021YFB3100800]
  2. National Natural Science Foundation of China [61872379, 12171481, 6197142]

Ask authors/readers for more resources

This article presents a new strategy for solving the heterogeneous change detection (HCD) problem using graph signal processing (GSP). The authors analyze the HCD problem from both the vertex domain and the spectral domain, proposing filtering methods and spectral analysis models for detecting changes between heterogeneous images. The effectiveness of these methods is demonstrated through experiments on real datasets.
This article provides a new strategy for the heterogeneous change detection (HCD) problem: solving HCD from the perspective of graph signal processing (GSP). We construct a graph to represent the structure of each image and treat each image as a graph signal defined on the graph. In this way, we convert the HCD into a GSP problem: a comparison of the responses of signals on systems defined on the graphs, which attempts to find structural differences and signal differences due to the changes between heterogeneous images. First, we analyze the GSP for HCD from the vertex domain. We show that, once a region has changed, the local structure of the image changes, i.e., the connectivity of the vertex containing this region changes. Therefore, we can compare the output signals of the same input graph signal passing through filters defined on the two graphs to detect changes. We analyze the negative effects of changing regions on the change detection results from the viewpoint of signal propagation, and we also design different filters from the vertex domain to explore the high-order neighborhood information hidden in original graphs. Second, we analyze the GSP for HCD from the spectral domain. We explore the spectral properties of different images on the same graph and show that their spectra exhibit commonalities and dissimilarities. Specifically, it is the change that leads to the dissimilarities of their spectra. With the help of graph spectral analysis, we propose a regression model for the HCD, which decomposes the source signal into the regressed signal and the changed signal, and constrains the spectral property of the regressed signal. Experiments conducted on seven real datasets show the effectiveness of the vertex domain filtering- and spectral domain analysis-based HCD methods.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available