Modeling Complex Object Changes in Satellite Image Time-Series: Approach based on CSP and Spatiotemporal Graph

• URL: http://arxiv.org/abs/2305.15091v1
• Date: Wed, 24 May 2023 12:15:19 GMT
• Title: Modeling Complex Object Changes in Satellite Image Time-Series: Approach based on CSP and Spatiotemporal Graph
• Authors: Zouhayra Ayadi, Wadii Boulila, Imed Riadh Farah
• Abstract summary: The process is divided into four steps: first, the identification of objects in each image; second, the construction of atemporal graph to model the changes of the complex objects; third, the creation of sub-graphs to be detected in the basetemporaltemporal graph; fourth, the analysis of the graph by detecting sub-graphs and solving a constraint network to determine relevant sub-CSPgraphs. Experiments were conducted using real-world images representing several cities in Saudi Arabia and the results demonstrate the effectiveness of the proposed approach.
• Score: 2.0303656145222857
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper proposes a method for automatically monitoring and analyzing the evolution of complex geographic objects. The objects are modeled as a spatiotemporal graph, which separates filiation relations, spatial relations, and spatiotemporal relations, and is analyzed by detecting frequent sub-graphs using constraint satisfaction problems (CSP). The process is divided into four steps: first, the identification of complex objects in each satellite image; second, the construction of a spatiotemporal graph to model the spatiotemporal changes of the complex objects; third, the creation of sub-graphs to be detected in the base spatiotemporal graph; and fourth, the analysis of the spatiotemporal graph by detecting the sub-graphs and solving a constraint network to determine relevant sub-graphs. The final step is further broken down into two sub-steps: (i) the modeling of the constraint network with defined variables and constraints, and (ii) the solving of the constraint network to find relevant sub-graphs in the spatiotemporal graph. Experiments were conducted using real-world satellite images representing several cities in Saudi Arabia, and the results demonstrate the effectiveness of the proposed approach.

Related papers

• On the use of Graphs for Satellite Image Time Series [3.2623791881739033]
  This paper is an effort to examine the integration of graph-based methods in remote-sensing analysis.<n>It aims to present a versatile graph-based pipeline to tackle SITS analysis.<n>The paper includes a review and two case studies, which highlight the potential of graph-based approaches for land cover mapping and water forecasting datasets.
  arXiv  Detail & Related papers  (2025-05-22T13:53:36Z)
• Persistent Homology-induced Graph Ensembles for Time Series Regressions [1.5728609542259502]
  We create an ensemble of Graph Neural Networks based on Persistent Homology filtration. The ensemble aggregates the signals from the individual learners via an attention-based routing mechanism. Four different real-world experiments on seismic activity prediction and traffic forecasting demonstrate that our approach consistently outperforms single-graph baselines.
  arXiv  Detail & Related papers  (2025-03-18T13:22:52Z)
• Improving embedding of graphs with missing data by soft manifolds [51.425411400683565]
  The reliability of graph embeddings depends on how much the geometry of the continuous space matches the graph structure. We introduce a new class of manifold, named soft manifold, that can solve this situation. Using soft manifold for graph embedding, we can provide continuous spaces to pursue any task in data analysis over complex datasets.
  arXiv  Detail & Related papers  (2023-11-29T12:48:33Z)
• Mending of Spatio-Temporal Dependencies in Block Adjacency Matrix [3.529869282529924]
  We propose a novel end-to-end learning architecture designed to mend the temporal dependencies, resulting in a well-connected graph. Our methodology demonstrates superior performance on benchmark datasets, such as SurgVisDom and C2D2.
  arXiv  Detail & Related papers  (2023-10-04T06:42:33Z)
• A Topological Distance Measure between Multi-Fields for Classification and Analysis of Shapes and Data [0.0]
  We propose an improved distance measure between two multi-fields by computing a multi-dimensional Reeb graph (MDRG) A hierarchy of persistence diagrams is then constructed by computing a persistence diagram corresponding to each Reeb graph of the MDRG. We show that the proposed measure satisfies the pseudo-metric and stability properties.
  arXiv  Detail & Related papers  (2023-03-06T05:38:13Z)
• GrannGAN: Graph annotation generative adversarial networks [72.66289932625742]
  We consider the problem of modelling high-dimensional distributions and generating new examples of data with complex relational feature structure coherent with a graph skeleton. The model we propose tackles the problem of generating the data features constrained by the specific graph structure of each data point by splitting the task into two phases. In the first it models the distribution of features associated with the nodes of the given graph, in the second it complements the edge features conditionally on the node features.
  arXiv  Detail & Related papers  (2022-12-01T11:49:07Z)
• Spatio-Temporal Joint Graph Convolutional Networks for Traffic Forecasting [75.10017445699532]
  Recent have shifted their focus towards formulating traffic forecasting as atemporal graph modeling problem. We propose a novel approach for accurate traffic forecasting on road networks over multiple future time steps.
  arXiv  Detail & Related papers  (2021-11-25T08:45:14Z)
• Spatial-spectral Hyperspectral Image Classification via Multiple Random Anchor Graphs Ensemble Learning [88.60285937702304]
  This paper proposes a novel spatial-spectral HSI classification method via multiple random anchor graphs ensemble learning (RAGE) Firstly, the local binary pattern is adopted to extract the more descriptive features on each selected band, which preserves local structures and subtle changes of a region. Secondly, the adaptive neighbors assignment is introduced in the construction of anchor graph, to reduce the computational complexity.
  arXiv  Detail & Related papers  (2021-03-25T09:31:41Z)
• Laplacian Change Point Detection for Dynamic Graphs [10.556288610354997]
  We propose Laplacian Anomaly Detection (LAD) which uses the spectrum of the Laplacian matrix of the graph structure at each snapshot to obtain low dimensional embeddings. In synthetic experiments, LAD outperforms the state-of-the-art method. We also evaluate our method on three real dynamic networks: UCI message network, US senate co-sponsorship network and Canadian bill voting network.
  arXiv  Detail & Related papers  (2020-07-02T16:24:24Z)
• Structural Landmarking and Interaction Modelling: on Resolution Dilemmas in Graph Classification [50.83222170524406]
  We study the intrinsic difficulty in graph classification under the unified concept of resolution dilemmas'' We propose SLIM'', an inductive neural network model for Structural Landmarking and Interaction Modelling.
  arXiv  Detail & Related papers  (2020-06-29T01:01:42Z)
• Disentangling and Unifying Graph Convolutions for Skeleton-Based Action Recognition [79.33539539956186]
  We propose a simple method to disentangle multi-scale graph convolutions and a unified spatial-temporal graph convolutional operator named G3D. By coupling these proposals, we develop a powerful feature extractor named MS-G3D based on which our model outperforms previous state-of-the-art methods on three large-scale datasets.
  arXiv  Detail & Related papers  (2020-03-31T11:28:25Z)

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.