Graph Learning Based on Signal Smoothness Representation for Homogeneous and Heterogeneous Change Detection

Graph-based methods are promising approaches for traditional and modern techniques in change detection (CD) applications. Nonetheless, some graph-based approaches omit the existence of useful priors that account for the structure of a scene, and the inter- and intra-relationships between the pixels are analyzed. To address this issue, in this article, we propose a framework for CD based on graph fusion and driven by graph signal smoothness representation. In addition to modifying the graph learning stage, in the proposed model, we apply a Gaussian mixture model for superpixel segmentation (GMMSP) as a downsampling module to reduce the computational cost required to learn the graph of the entire images. We carry out tests on 14 real cases of natural disasters, farming, and construction. The dataset contains homogeneous cases with multispectral (MS) and synthetic aperture radar (SAR) images, along with heterogeneous cases that include MS/SAR images. We compare our approach against probabilistic thresholding, unsupervised learning, deep learning, and graph-based methods. In terms of Cohen's kappa coefficient, our proposed model based on graph signal smoothness representation outperformed state-of-the-art approaches in ten out of 14 datasets.

Automated summary

This article introduces a change detection framework based on graph fusion and driven by graph signal smoothness representation. By applying a Gaussian mixture model as a downsampling module, the computational cost required for graph learning is reduced. The test results show that the proposed method outperforms other state-of-the-art approaches on multiple datasets.