Unearthing InSights into Mars: Unsupervised Source Separation with
Limited Data
- URL: http://arxiv.org/abs/2301.11981v2
- Date: Wed, 31 May 2023 18:08:10 GMT
- Title: Unearthing InSights into Mars: Unsupervised Source Separation with
Limited Data
- Authors: Ali Siahkoohi, Rudy Morel, Maarten V. de Hoop, Erwan Allys, Gr\'egory
Sainton, Taichi Kawamura
- Abstract summary: An ill-posed set of source signals have been observed through a mixing operator.
This problem requires prior knowledge, or implicitly or unsupervised methods from existing data.
Thanks to wavelet scattering co-variances, we are able to separate glitches using a only few glitch-free data snippets.
- Score: 2.626095252463179
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Source separation involves the ill-posed problem of retrieving a set of
source signals that have been observed through a mixing operator. Solving this
problem requires prior knowledge, which is commonly incorporated by imposing
regularity conditions on the source signals, or implicitly learned through
supervised or unsupervised methods from existing data. While data-driven
methods have shown great promise in source separation, they often require large
amounts of data, which rarely exists in planetary space missions. To address
this challenge, we propose an unsupervised source separation scheme for domains
with limited data access that involves solving an optimization problem in the
wavelet scattering covariance representation space$\unicode{x2014}$an
interpretable, low-dimensional representation of stationary processes. We
present a real-data example in which we remove transient, thermally-induced
microtilts$\unicode{x2014}$known as glitches$\unicode{x2014}$from data recorded
by a seismometer during NASA's InSight mission on Mars. Thanks to the wavelet
scattering covariances' ability to capture non-Gaussian properties of
stochastic processes, we are able to separate glitches using only a few
glitch-free data snippets.
Related papers
- RoSAS: Deep Semi-Supervised Anomaly Detection with
Contamination-Resilient Continuous Supervision [21.393509817509464]
This paper proposes a novel semi-supervised anomaly detection method, which devises textitcontamination-resilient continuous supervisory signals
Our approach significantly outperforms state-of-the-art competitors by 20%-30% in AUC-PR.
arXiv Detail & Related papers (2023-07-25T04:04:49Z) - Martian time-series unraveled: A multi-scale nested approach with
factorial variational autoencoders [13.758556734097374]
Unsupervised source separation involves unraveling an unknown set of source signals recorded through a mixing operator.
This problem is inherently ill-posed and is challenged by the variety of timescales exhibited by sources.
We propose an unsupervised multi-scale clustering and source separation framework by leveraging wavelet scattering spectra.
arXiv Detail & Related papers (2023-05-25T15:49:38Z) - Score-based Diffusion Models in Function Space [140.792362459734]
Diffusion models have recently emerged as a powerful framework for generative modeling.
We introduce a mathematically rigorous framework called Denoising Diffusion Operators (DDOs) for training diffusion models in function space.
We show that the corresponding discretized algorithm generates accurate samples at a fixed cost independent of the data resolution.
arXiv Detail & Related papers (2023-02-14T23:50:53Z) - GibbsDDRM: A Partially Collapsed Gibbs Sampler for Solving Blind Inverse
Problems with Denoising Diffusion Restoration [64.8770356696056]
We propose GibbsDDRM, an extension of Denoising Diffusion Restoration Models (DDRM) to a blind setting in which the linear measurement operator is unknown.
The proposed method is problem-agnostic, meaning that a pre-trained diffusion model can be applied to various inverse problems without fine-tuning.
arXiv Detail & Related papers (2023-01-30T06:27:48Z) - ManiFlow: Implicitly Representing Manifolds with Normalizing Flows [145.9820993054072]
Normalizing Flows (NFs) are flexible explicit generative models that have been shown to accurately model complex real-world data distributions.
We propose an optimization objective that recovers the most likely point on the manifold given a sample from the perturbed distribution.
Finally, we focus on 3D point clouds for which we utilize the explicit nature of NFs, i.e. surface normals extracted from the gradient of the log-likelihood and the log-likelihood itself.
arXiv Detail & Related papers (2022-08-18T16:07:59Z) - A Robust and Flexible EM Algorithm for Mixtures of Elliptical
Distributions with Missing Data [71.9573352891936]
This paper tackles the problem of missing data imputation for noisy and non-Gaussian data.
A new EM algorithm is investigated for mixtures of elliptical distributions with the property of handling potential missing data.
Experimental results on synthetic data demonstrate that the proposed algorithm is robust to outliers and can be used with non-Gaussian data.
arXiv Detail & Related papers (2022-01-28T10:01:37Z) - Holistic Guidance for Occluded Person Re-Identification [7.662745552551165]
In real-world video surveillance applications, person re-identification (ReID) suffers from the effects of occlusions and detection errors.
We introduce a novel Holistic Guidance (HG) method that relies only on person identity labels.
Our proposed student-teacher framework is trained to address the problem by matching the distributions of between- and within-class distances (DCDs) of occluded samples with that of holistic (non-occluded) samples.
In addition to this, a joint generative-discriminative backbone is trained with a denoising autoencoder, allowing the system to
arXiv Detail & Related papers (2021-04-13T21:50:29Z) - Graph Embedding with Data Uncertainty [113.39838145450007]
spectral-based subspace learning is a common data preprocessing step in many machine learning pipelines.
Most subspace learning methods do not take into consideration possible measurement inaccuracies or artifacts that can lead to data with high uncertainty.
arXiv Detail & Related papers (2020-09-01T15:08:23Z) - Interpretable Anomaly Detection with Mondrian P{\'o}lya Forests on Data
Streams [6.177270420667713]
Anomaly detection at scale is an extremely challenging problem of great practicality.
Recent work has coalesced on variations of (random) $k$emphd-trees to summarise data for anomaly detection.
These methods rely on ad-hoc score functions that are not easy to interpret.
We contextualise these methods in a probabilistic framework which we call the Mondrian Polya Forest.
arXiv Detail & Related papers (2020-08-04T13:19:07Z) - Learning while Respecting Privacy and Robustness to Distributional
Uncertainties and Adversarial Data [66.78671826743884]
The distributionally robust optimization framework is considered for training a parametric model.
The objective is to endow the trained model with robustness against adversarially manipulated input data.
Proposed algorithms offer robustness with little overhead.
arXiv Detail & Related papers (2020-07-07T18:25: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.