Randomized kernels for large scale Earth observation applications

• URL: http://arxiv.org/abs/2012.03630v1
• Date: Mon, 7 Dec 2020 12:23:56 GMT
• Title: Randomized kernels for large scale Earth observation applications
• Authors: Adri\'an P\'erez-Suay, Julia Amor\'os-L\'opez, Luis G\'omez-Chova, Valero Laparra, Jordi Mu\~noz-Mar\'i, Gustau Camps-Valls
• Abstract summary: This paper introduces an efficient kernel method for fast statistical retrieval of bio-geo-physical parameters and image classification problems. We show that kernel regression and classification is now possible for datasets with millions of examples and high dimensionality.
• Score: 8.835750299747229
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Dealing with land cover classification of the new image sources has also turned to be a complex problem requiring large amount of memory and processing time. In order to cope with these problems, statistical learning has greatly helped in the last years to develop statistical retrieval and classification models that can ingest large amounts of Earth observation data. Kernel methods constitute a family of powerful machine learning algorithms, which have found wide use in remote sensing and geosciences. However, kernel methods are still not widely adopted because of the high computational cost when dealing with large scale problems, such as the inversion of radiative transfer models or the classification of high spatial-spectral-temporal resolution data. This paper introduces an efficient kernel method for fast statistical retrieval of bio-geo-physical parameters and image classification problems. The method allows to approximate a kernel matrix with a set of projections on random bases sampled from the Fourier domain. The method is simple, computationally very efficient in both memory and processing costs, and easily parallelizable. We show that kernel regression and classification is now possible for datasets with millions of examples and high dimensionality. Examples on atmospheric parameter retrieval from hyperspectral infrared sounders like IASI/Metop; large scale emulation and inversion of the familiar PROSAIL radiative transfer model on Sentinel-2 data; and the identification of clouds over landmarks in time series of MSG/Seviri images show the efficiency and effectiveness of the proposed technique.

Related papers

• Deep Generative Data Assimilation in Multimodal Setting [0.1052166918701117]
  In this work, we propose SLAMS: Score-based Latent Assimilation in Multimodal Setting. We assimilate in-situ weather station data and ex-situ satellite imagery to calibrate the vertical temperature profiles, globally. Our work is the first to apply deep generative framework for multimodal data assimilation using real-world datasets.
  arXiv  Detail & Related papers  (2024-04-10T00:25:09Z)
• Gaussian Ensemble Belief Propagation for Efficient Inference in High-Dimensional Systems [3.6773638205393198]
  Efficient inference in high-dimensional models is a central challenge in machine learning. We introduce the Ensemble Kalman Filter (EnKF) and Gaussian Belief Propagation (GaBP) GEnBP updates ensembles of prior samples into posterior samples by passing low-rank local messages over the edges of a graphical model.
  arXiv  Detail & Related papers  (2024-02-13T03:31:36Z)
• RFFNet: Large-Scale Interpretable Kernel Methods via Random Fourier Features [3.0079490585515347]
  We introduce RFFNet, a scalable method that learns the kernel relevances' on the fly via first-order optimization. We show that our approach has a small memory footprint and run-time, low prediction error, and effectively identifies relevant features. We supply users with an efficient, PyTorch-based library, that adheres to the scikit-learn standard API and code for fully reproducing our results.
  arXiv  Detail & Related papers  (2022-11-11T18:50:34Z)
• FaDIn: Fast Discretized Inference for Hawkes Processes with General Parametric Kernels [82.53569355337586]
  This work offers an efficient solution to temporal point processes inference using general parametric kernels with finite support. The method's effectiveness is evaluated by modeling the occurrence of stimuli-induced patterns from brain signals recorded with magnetoencephalography (MEG) Results show that the proposed approach leads to an improved estimation of pattern latency than the state-of-the-art.
  arXiv  Detail & Related papers  (2022-10-10T12:35:02Z)
• Inducing Gaussian Process Networks [80.40892394020797]
  We propose inducing Gaussian process networks (IGN), a simple framework for simultaneously learning the feature space as well as the inducing points. The inducing points, in particular, are learned directly in the feature space, enabling a seamless representation of complex structured domains. We report on experimental results for real-world data sets showing that IGNs provide significant advances over state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-04-21T05:27:09Z)
• Convolutional generative adversarial imputation networks for spatio-temporal missing data in storm surge simulations [86.5302150777089]
  Generative Adversarial Imputation Nets (GANs) and GAN-based techniques have attracted attention as unsupervised machine learning methods. We name our proposed method as Con Conval Generative Adversarial Imputation Nets (Conv-GAIN)
  arXiv  Detail & Related papers  (2021-11-03T03:50:48Z)
• SreaMRAK a Streaming Multi-Resolution Adaptive Kernel Algorithm [60.61943386819384]
  Existing implementations of KRR require that all the data is stored in the main memory. We propose StreaMRAK - a streaming version of KRR. We present a showcase study on two synthetic problems and the prediction of the trajectory of a double pendulum.
  arXiv  Detail & Related papers  (2021-08-23T21:03:09Z)
• Adaptive Local Kernels Formulation of Mutual Information with Application to Active Post-Seismic Building Damage Inference [1.066048003460524]
  Post-earthquake regional damage assessment of buildings is an expensive task. The information theoretic measure of mutual information is one of the most effective criteria to evaluate the effectiveness of the samples. A local kernels strategy was proposed to reduce the computational costs, but the adaptability of the kernels to the observed labels was not considered. In this article, an adaptive local kernels methodology is developed that allows for the conformability of the kernels to the observed output data.
  arXiv  Detail & Related papers  (2021-05-24T18:34:46Z)
• Deep Gaussian Processes for Biogeophysical Parameter Retrieval and Model Inversion [14.097477944789484]
  This paper introduces the use of deep Gaussian Processes (DGPs) for bio-geo-physical model inversion. Unlike shallow GP models, DGPs account for complicated (modular, hierarchical) processes, provide an efficient solution that scales well to big datasets.
  arXiv  Detail & Related papers  (2021-04-16T10:42:01Z)
• Deep Cellular Recurrent Network for Efficient Analysis of Time-Series Data with Spatial Information [52.635997570873194]
  This work proposes a novel deep cellular recurrent neural network (DCRNN) architecture to process complex multi-dimensional time series data with spatial information. The proposed architecture achieves state-of-the-art performance while utilizing substantially less trainable parameters when compared to comparable methods in the literature.
  arXiv  Detail & Related papers  (2021-01-12T20:08:18Z)
• Coded Stochastic ADMM for Decentralized Consensus Optimization with Edge Computing [113.52575069030192]
  Big data, including applications with high security requirements, are often collected and stored on multiple heterogeneous devices, such as mobile devices, drones and vehicles. Due to the limitations of communication costs and security requirements, it is of paramount importance to extract information in a decentralized manner instead of aggregating data to a fusion center. We consider the problem of learning model parameters in a multi-agent system with data locally processed via distributed edge nodes. A class of mini-batch alternating direction method of multipliers (ADMM) algorithms is explored to develop the distributed learning model.
  arXiv  Detail & Related papers  (2020-10-02T10:41:59Z)

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.