paper-with-me

홈 › Papers

Generative inpainting of incomplete Euclidean distance matrices of trajectories generated by a fractional Brownian motion

2024-04-10 · Alexander Lobashev, Dmitry Guskov, Kirill Polovnikov

Fractional Brownian motion (fBm) features both randomness and strong scale-free correlations, challenging generative models to reproduce the intrinsic memory characterizing the underlying stochastic process. Here we examine a zoo of diffusion-based inpainting methods on a specific dataset of corrupted images, which represent incomplete Euclidean distance matrices (EDMs) of fBm at various memory exponents $H$. Our dataset implies uniqueness of the data imputation in the regime of low missing ratio, where the remaining partial graph is rigid, providing the ground truth for the inpainting. We find that the conditional diffusion generation readily reproduces the built-in correlations of fBm paths in different memory regimes (i.e., for sub-, Brownian and super-diffusion trajectories), providing a robust tool for the statistical imputation at high missing ratio. Furthermore, while diffusion models have been recently shown to memorize samples from the training database, we demonstrate that diffusion behaves qualitatively different from the database search and thus generalize rather than memorize the training dataset. As a biological application, we apply our fBm-trained diffusion model for the imputation of microscopy-derived distance matrices of chromosomal segments (FISH data) - incomplete due to experimental imperfections - and demonstrate its superiority over the standard approaches used in bioinformatics.

📄 PDF Abstract BibTeX arXiv:2404.07029

Code (1)

alobashev/fbm-inpainting-benchmark 공식 구현 pytorch

Tasks

Imputation

Methods 이 논문이 사용한 방법론

Inpainting Train a convolutional neural network to generate the contents of an arbitrary image region conditioned on its surroundings.
Diffusion Diffusion models generate samples by gradually removing noise from a signal, and their training objective can be expressed as a reweighted variational lower-bound…

Similar Papers 제목 키워드 기반

Kinetic Euclidean Distance Matrices

2019-03-15

Euclidean distance matrices (EDMs) are a major tool for localization from distances, with applications ranging from protein structure determination to global positioning and manifold learning. They are, however, static o…

Deterministic Equivalent of the Log-Euclidean Distance between Sample Covariance Matrices

2024-08-08 · Xavier Mestre, Roberto Pereira

Log-Euclidean distances are commonly used to quantify the similarity between positive definite matrices using geometric considerations. This paper analyzes the behavior of this distance when it is used to measure closene…

Riemannian Metric Learning for Symmetric Positive Definite Matrices

2015-01-10 · Raviteja Vemulapalli, David W. Jacobs

Over the past few years, symmetric positive definite (SPD) matrices have been receiving considerable attention from computer vision community. Though various distance measures have been proposed in the past for comparing…

ClusteringMetric Learning

A new metric on the manifold of kernel matrices with application to matrix geometric means

2012-12-01 · NeurIPS 2012 12 · Suvrit Sra

Symmetric positive definite (spd) matrices are remarkably pervasive in a multitude of scientific disciplines, including machine learning and optimization. We consider the fundamental task of measuring distances between t…

Generating valid Euclidean distance matrices

2019-10-07 · Moritz Hoffmann, Frank Noé

Generating point clouds, e.g., molecular structures, in arbitrary rotations, translations, and enumerations remains a challenging task. Meanwhile, neural networks utilizing symmetry invariant layers have been shown to be…

Translationvalid