Unsupervised Anomaly Detection through Mass Repulsing Optimal Transport

• URL: http://arxiv.org/abs/2502.12793v1
• Date: Tue, 18 Feb 2025 11:54:12 GMT
• Title: Unsupervised Anomaly Detection through Mass Repulsing Optimal Transport
• Authors: Eduardo Fernandes Montesuma, Adel El Habazi, Fred Ngole Mboula,
• Abstract summary: We tackle anomaly detection by forcing samples to displace its mass, while keeping the least effort objective.<n>We use these concepts to design a new anomaly score.
• Score: 5.042313273982193
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Detecting anomalies in datasets is a longstanding problem in machine learning. In this context, anomalies are defined as a sample that significantly deviates from the remaining data. Meanwhile, optimal transport (OT) is a field of mathematics concerned with the transportation, between two probability measures, at least effort. In classical OT, the optimal transportation strategy of a measure to itself is the identity. In this paper, we tackle anomaly detection by forcing samples to displace its mass, while keeping the least effort objective. We call this new transportation problem Mass Repulsing Optimal Transport (MROT). Naturally, samples lying in low density regions of space will be forced to displace mass very far, incurring a higher transportation cost. We use these concepts to design a new anomaly score. Through a series of experiments in existing benchmarks, and fault detection problems, we show that our algorithm improves over existing methods.

Related papers

• Density-based Object Detection in Crowded Scenes [54.037103707572136]
  We propose density-guided anchors (DGA) and density-guided NMS (DG-NMS) DGA computes optimal anchor assignments and reweighing, as well as an adaptive NMS. Experiments on the challenging CrowdHuman dataset with Citypersons dataset demonstrate that our proposed density-guided detector is effective and robust to crowdedness.
  arXiv  Detail & Related papers  (2025-04-14T02:41:49Z)
• Dynamical Measure Transport and Neural PDE Solvers for Sampling [77.38204731939273]
  We tackle the task of sampling from a probability density as transporting a tractable density function to the target. We employ physics-informed neural networks (PINNs) to approximate the respective partial differential equations (PDEs) solutions. PINNs allow for simulation- and discretization-free optimization and can be trained very efficiently.
  arXiv  Detail & Related papers  (2024-07-10T17:39:50Z)
• Industrial Anomaly Detection and Localization Using Weakly-Supervised Residual Transformers [44.344548601242444]
  We introduce a novel framework, Weakly-supervised RESidual Transformer (WeakREST), to achieve high anomaly detection accuracy.<n>We reformulate the pixel-wise anomaly localization task into a block-wise classification problem.<n>We develop a novel ResMixMatch algorithm, capable of handling the interplay between weak labels and residual-based representations.
  arXiv  Detail & Related papers  (2023-06-06T08:19:30Z)
• Estimating Latent Population Flows from Aggregated Data via Inversing Multi-Marginal Optimal Transport [57.16851632525864]
  We study the problem of estimating latent population flows from aggregated count data. This problem arises when individual trajectories are not available due to privacy issues or measurement fidelity. We propose to estimate the transition flows from aggregated data by learning the cost functions of the MOT framework.
  arXiv  Detail & Related papers  (2022-12-30T03:03:23Z)
• InfoOT: Information Maximizing Optimal Transport [58.72713603244467]
  InfoOT is an information-theoretic extension of optimal transport. It maximizes the mutual information between domains while minimizing geometric distances. This formulation yields a new projection method that is robust to outliers and generalizes to unseen samples.
  arXiv  Detail & Related papers  (2022-10-06T18:55:41Z)
• Approximating Optimal Transport via Low-rank and Sparse Factorization [19.808887459724893]
  Optimal transport (OT) naturally arises in a wide range of machine learning applications but may often become the computational bottleneck. A novel approximation for OT is proposed, in which the transport plan can be decomposed into the sum of a low-rank matrix and a sparse one.
  arXiv  Detail & Related papers  (2021-11-12T03:10:45Z)
• Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmark [133.46066694893318]
  We evaluate the performance of neural network-based solvers for optimal transport. We find that existing solvers do not recover optimal transport maps even though they perform well in downstream tasks.
  arXiv  Detail & Related papers  (2021-06-03T15:59:28Z)
• Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solution [8.465228064780748]
  We prove that computing the Wasserstein distance between a discrete probability measure supported on two points is already #P-hard. We introduce a distributionally robust dual optimal transport problem whose objective function is smoothed with the most adverse disturbance distributions. We show that smoothing the dual objective function is equivalent to regularizing the primal objective function.
  arXiv  Detail & Related papers  (2021-03-10T18:53:59Z)
• Minibatch optimal transport distances; analysis and applications [9.574645423576932]
  Optimal transport distances have become a classic tool to compare probability distributions and have found many applications in machine learning. A common workaround is to compute these distances on minibatches to average the outcome of several smaller optimal transport problems. We propose in this paper an extended analysis of this practice, which effects were previously studied in restricted cases.
  arXiv  Detail & Related papers  (2021-01-05T21:29:31Z)
• AOT: Appearance Optimal Transport Based Identity Swapping for Forgery Detection [76.7063732501752]
  We provide a new identity swapping algorithm with large differences in appearance for face forgery detection. The appearance gaps mainly arise from the large discrepancies in illuminations and skin colors. A discriminator is introduced to distinguish the fake parts from a mix of real and fake image patches.
  arXiv  Detail & Related papers  (2020-11-05T06:17:04Z)

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.