Graph-based fusion for change detection in multi-spectral images

• URL: http://arxiv.org/abs/2004.00786v1
• Date: Thu, 2 Apr 2020 02:59:00 GMT
• Title: Graph-based fusion for change detection in multi-spectral images
• Authors: David Alejandro Jimenez Sierra, Hern\'an Dar\'io Ben\'itez Restrepo, Hern\'an Dar\'io Vargas Cardonay, Jocelyn Chanussot
• Abstract summary: We address the problem of change detection in multi-spectral images by proposing a data-driven framework of graph-based data fusion. We validated our approach in two real cases of remote sensing according to both qualitative and quantitative analyses.
• Score: 16.365393959740718
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper we address the problem of change detection in multi-spectral images by proposing a data-driven framework of graph-based data fusion. The main steps of the proposed approach are: (i) The generation of a multi-temporal pixel based graph, by the fusion of intra-graphs of each temporal data; (ii) the use of Nystr\"om extension to obtain the eigenvalues and eigenvectors of the fused graph, and the selection of the final change map. We validated our approach in two real cases of remote sensing according to both qualitative and quantitative analyses. The results confirm the potential of the proposed graph-based change detection algorithm outperforming state-of-the-art methods.

Related papers

• Graph-Dictionary Signal Model for Sparse Representations of Multivariate Data [49.77103348208835]
  We define a novel Graph-Dictionary signal model, where a finite set of graphs characterizes relationships in data distribution through a weighted sum of their Laplacians. We propose a framework to infer the graph dictionary representation from observed data, along with a bilinear generalization of the primal-dual splitting algorithm to solve the learning problem. We exploit graph-dictionary representations in a motor imagery decoding task on brain activity data, where we classify imagined motion better than standard methods.
  arXiv  Detail & Related papers  (2024-11-08T17:40:43Z)
• Integrating Graph Neural Networks with Scattering Transform for Anomaly Detection [0.0]
  We present two novel methods in Network Intrusion Detection Systems (NIDS) using Graph Neural Networks (GNNs) The first approach, Scattering Transform with E-GraphSAGE (STEG), utilizes the scattering transform to conduct multi-resolution analysis of edge feature vectors. The second approach improves node representation by initiating with Node2Vec, diverging from standard methods of using uniform values.
  arXiv  Detail & Related papers  (2024-04-16T00:02:12Z)
• Visualization for Multivariate Gaussian Anomaly Detection in Images [0.0]
  This paper introduces a simplified variation of the PaDiM (Pixel-Wise Anomaly Detection through Instance Modeling) method for anomaly detection in images. We introduce an intermediate step in this framework by applying a whitening transformation to the feature vectors. The results show the importance of visual model validation, providing insights into issues that were otherwise invisible.
  arXiv  Detail & Related papers  (2023-07-12T10:12:57Z)
• Score-based Generative Modeling of Graphs via the System of Stochastic Differential Equations [57.15855198512551]
  We propose a novel score-based generative model for graphs with a continuous-time framework. We show that our method is able to generate molecules that lie close to the training distribution yet do not violate the chemical valency rule.
  arXiv  Detail & Related papers  (2022-02-05T08:21:04Z)
• Bayesian Graph Contrastive Learning [55.36652660268726]
  We propose a novel perspective of graph contrastive learning methods showing random augmentations leads to encoders. Our proposed method represents each node by a distribution in the latent space in contrast to existing techniques which embed each node to a deterministic vector. We show a considerable improvement in performance compared to existing state-of-the-art methods on several benchmark datasets.
  arXiv  Detail & Related papers  (2021-12-15T01:45:32Z)
• Self-Supervised Graph Representation Learning via Topology Transformations [61.870882736758624]
  We present the Topology Transformation Equivariant Representation learning, a general paradigm of self-supervised learning for node representations of graph data. In experiments, we apply the proposed model to the downstream node and graph classification tasks, and results show that the proposed method outperforms the state-of-the-art unsupervised approaches.
  arXiv  Detail & Related papers  (2021-05-25T06:11:03Z)
• A Multiscale Graph Convolutional Network for Change Detection in Homogeneous and Heterogeneous Remote Sensing Images [12.823633963080281]
  Change detection (CD) in remote sensing images has been an ever-expanding area of research. In this paper, a novel CD method based on the graph convolutional network (GCN) and multiscale object-based technique is proposed for both homogeneous and heterogeneous images.
  arXiv  Detail & Related papers  (2021-02-16T09:26:31Z)
• Fusion Moves for Graph Matching [35.27002115682325]
  We contribute to approximate algorithms for the quadratic assignment problem also known as graph matching. Inspired by the success of the fusion moves technique developed for multilabel discrete Markov random fields, we investigate its applicability to graph matching. We show how it can be efficiently combined with the dedicated state-of-the-art Lagrange dual methods.
  arXiv  Detail & Related papers  (2021-01-28T16:09:46Z)
• Multilayer Clustered Graph Learning [66.94201299553336]
  We use contrastive loss as a data fidelity term, in order to properly aggregate the observed layers into a representative graph. Experiments show that our method leads to a clustered clusters w.r.t. We learn a clustering algorithm for solving clustering problems.
  arXiv  Detail & Related papers  (2020-10-29T09:58:02Z)
• Offline detection of change-points in the mean for stationary graph signals [55.98760097296213]
  We propose an offline method that relies on the concept of graph signal stationarity. Our detector comes with a proof of a non-asymptotic inequality oracle.
  arXiv  Detail & Related papers  (2020-06-18T15:51:38Z)
• Guiding Graph Embeddings using Path-Ranking Methods for Error Detection innoisy Knowledge Graphs [0.0]
  This work presents various mainstream approaches and proposes a hybrid and modular methodology for the task. We compare different methods on two benchmarks and one real-world biomedical publications dataset, showcasing the potential of our approach.
  arXiv  Detail & Related papers  (2020-02-19T11:04:11Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.