paper-with-me

홈 › Papers

S2A: Wasserstein GAN with Spatio-Spectral Laplacian Attention for Multi-Spectral Band Synthesis

2020-04-08 · Litu Rout, Indranil Misra, S Manthira Moorthi, Debajyoti Dhar

Intersection of adversarial learning and satellite image processing is an emerging field in remote sensing. In this study, we intend to address synthesis of high resolution multi-spectral satellite imagery using adversarial learning. Guided by the discovery of attention mechanism, we regulate the process of band synthesis through spatio-spectral Laplacian attention. Further, we use Wasserstein GAN with gradient penalty norm to improve training and stability of adversarial learning. In this regard, we introduce a new cost function for the discriminator based on spatial attention and domain adaptation loss. We critically analyze the qualitative and quantitative results compared with state-of-the-art methods using widely adopted evaluation metrics. Our experiments on datasets of three different sensors, namely LISS-3, LISS-4, and WorldView-2 show that attention learning performs favorably against state-of-the-art methods. Using the proposed method we provide an additional data product in consistent with existing high resolution bands. Furthermore, we synthesize over 4000 high resolution scenes covering various terrains to analyze scientific fidelity. At the end, we demonstrate plausible large scale real world applications of the synthesized band.

📄 PDF Abstract BibTeX arXiv:2004.03867

Code (0)

등록된 구현이 없습니다.

Tasks

Domain Adaptation

Methods 이 논문이 사용한 방법론

Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…
Dogecoin Customer Service Number +1-833-534-1729 설명 없음

Similar Papers 제목 키워드 기반

Supra-Laplacian Encoding for Transformer on Dynamic Graphs

2024-09-26 · Yannis Karmim, Marc Lafon, Raphael Fournier S'niehotta, Nicolas Thome

Fully connected Graph Transformers (GT) have rapidly become prominent in the static graph community as an alternative to Message-Passing models, which suffer from a lack of expressivity, oversquashing, and under-reaching…

Dynamic Link PredictionLink Prediction

Spectral Forensics of Diffusion Attention Graphs for Copy-Move Forgery Detection

2026-04-19 · H. M. Shadman Tabib, Tasriad Ahmed Tias, Nafis Tahmid arxiv

Copy-move forgery, where a region within an image is duplicated to hide or fabricate content, remains a persistent threat to visual media integrity. We introduce GraphSpecForge, a training-free framework that detects cop…

Clustering Time-Evolving Networks Using the Spatio-Temporal Graph Laplacian

2024-07-12 · Maia Trower, Nataša Djurdjevac Conrad, Stefan Klus

Time-evolving graphs arise frequently when modeling complex dynamical systems such as social networks, traffic flow, and biological processes. Developing techniques to identify and analyze communities in these time-varyi…

Clustering

SVGD as a kernelized Wasserstein gradient flow of the chi-squared divergence

2020-06-03 · NeurIPS 2020 12 · Sinho Chewi, Thibaut Le Gouic, Chen Lu, Tyler Maunu 외

Stein Variational Gradient Descent (SVGD), a popular sampling algorithm, is often described as the kernelized gradient flow for the Kullback-Leibler divergence in the geometry of optimal transport. We introduce a new per…

Non-Parametric Manifold Learning

2021-07-16 · Dena Marie Asta

We introduce an estimator for distances in a compact Riemannian manifold based on graph Laplacian estimates of the Laplace-Beltrami operator. We upper bound the error in the estimate of manifold distances, or more precis…