Brownian Feature Trajectories with Geometric Decision Boundaries for Edge Anomaly Detection

Embedded sensor systems deployed in heterogeneous and evolving environments face strong constraints in power, supervision, and connectivity, which limit the applicability of classical anomaly detection methods. This paper introduces a lightweight framework for unsupervised anomaly detection based on Brownian feature trajectories. Each sensor event is modeled as a stochastic trajectory whose drift and covariance parameters summarize the nominal temporal evolution of features. To overcome the limitations of purely parametric models, the framework integrates a geometric decision layer that combines kernel density estimation with convex envelopes, enabling robust detection of trajectories that traverse low-density or out-ofbound regions. The selection of the kernel bandwidth and decision thresholds is guided by data-driven statistical rules to ensure interpretability and consistent sensitivity across devices. A statistical consistency test, based on Gaussianity and covariance conformity of increments, provides additional validation of deviations from the Brownian hypothesis. The proposed approach achieves interpretable, adaptive, and computationally efficient anomaly detection suitable for real-time edge deployment in isolated infrastructure monitoring and surveillance scenarios, where data remain specific to each use case.

Authors

Institutions

Publication Details

Published
2025-12-14
DOI
https://doi.org/10.1109/icm66518.2025.11322472
Primary Topic
Anomaly Detection Techniques and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Brownian Feature Trajectories with Geometric Decision Boundaries for Edge Anomaly Detection

Hichem Snoussi, Ahmad Bitar, Redwane Ait-Ouammi, Alain Staron
Anomaly Detection Techniques and Applications
article

Brownian Feature Trajectories with Geometric Decision Boundaries for Edge Anomaly Detection

Hichem Snoussi, Ahmad Bitar, Redwane Ait-Ouammi, Alain Staron
article en

Abstract

Embedded sensor systems deployed in heterogeneous and evolving environments face strong constraints in power, supervision, and connectivity, which limit the applicability of classical anomaly detection methods. This paper introduces a lightweight framework for unsupervised anomaly detection based on Brownian feature trajectories. Each sensor event is modeled as a stochastic trajectory whose drift and covariance parameters summarize the nominal temporal evolution of features. To overcome the limitations of purely parametric models, the framework integrates a geometric decision layer that combines kernel density estimation with convex envelopes, enabling robust detection of trajectories that traverse low-density or out-ofbound regions. The selection of the kernel bandwidth and decision thresholds is guided by data-driven statistical rules to ensure interpretability and consistent sensitivity across devices. A statistical consistency test, based on Gaussianity and covariance conformity of increments, provides additional validation of deviations from the Brownian hypothesis. The proposed approach achieves interpretable, adaptive, and computationally efficient anomaly detection suitable for real-time edge deployment in isolated infrastructure monitoring and surveillance scenarios, where data remain specific to each use case.

European Union (BE), Université de Technologie de Troyes (FR), Artelia (France) (FR), Arttic (France) (FR)
Openalex Percentile: Top 83%
Anomaly Detection Techniques and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.