An Entropy Based Outlier Score and its Application to Novelty Detection
for Road Infrastructure Images
- URL: http://arxiv.org/abs/2005.13288v2
- Date: Wed, 5 May 2021 08:40:47 GMT
- Title: An Entropy Based Outlier Score and its Application to Novelty Detection
for Road Infrastructure Images
- Authors: Jonas Wurst, Alberto Flores Fern\'andez, Michael Botsch and Wolfgang
Utschick
- Abstract summary: The outlier score is realized through a weighted normalized entropy of the similarities.
The aim is to identify newly observed infrastructures given a pre-collected base dataset.
To validate the generalization capabilities of the outlier score, it is additionally applied to various real world datasets.
- Score: 8.746176113214727
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: A novel unsupervised outlier score, which can be embedded into graph based
dimensionality reduction techniques, is presented in this work. The score uses
the directed nearest neighbor graphs of those techniques. Hence, the same
measure of similarity that is used to project the data into lower dimensions,
is also utilized to determine the outlier score. The outlier score is realized
through a weighted normalized entropy of the similarities. This score is
applied to road infrastructure images. The aim is to identify newly observed
infrastructures given a pre-collected base dataset. Detecting unknown scenarios
is a key for accelerated validation of autonomous vehicles. The results show
the high potential of the proposed technique. To validate the generalization
capabilities of the outlier score, it is additionally applied to various real
world datasets. The overall average performance in identifying outliers using
the proposed methods is higher compared to state-of-the-art methods. In order
to generate the infrastructure images, an openDRIVE parsing and plotting tool
for Matlab is developed as part of this work. This tool and the implementation
of the entropy based outlier score in combination with Uniform Manifold
Approximation and Projection are made publicly available.
Related papers
- Beyond the Known: Adversarial Autoencoders in Novelty Detection [2.7486022583843233]
In novelty detection, the goal is to decide if a new data point should be categorized as an inlier or an outlier.
We use a similar framework but with a lightweight deep network, and we adopt a probabilistic score with reconstruction error.
Our results indicate that our approach is effective at learning the target class, and it outperforms recent state-of-the-art methods on several benchmark datasets.
arXiv Detail & Related papers (2024-04-06T00:04:19Z) - Piecewise-Linear Manifolds for Deep Metric Learning [8.670873561640903]
Unsupervised deep metric learning focuses on learning a semantic representation space using only unlabeled data.
We propose to model the high-dimensional data manifold using a piecewise-linear approximation, with each low-dimensional linear piece approximating the data manifold in a small neighborhood of a point.
We empirically show that this similarity estimate correlates better with the ground truth than the similarity estimates of current state-of-the-art techniques.
arXiv Detail & Related papers (2024-03-22T06:22:20Z) - Improving Online Lane Graph Extraction by Object-Lane Clustering [106.71926896061686]
We propose an architecture and loss formulation to improve the accuracy of local lane graph estimates.
The proposed method learns to assign the objects to centerlines by considering the centerlines as cluster centers.
We show that our method can achieve significant performance improvements by using the outputs of existing 3D object detection methods.
arXiv Detail & Related papers (2023-07-20T15:21:28Z) - Bures-Wasserstein Means of Graphs [60.42414991820453]
We propose a novel framework for defining a graph mean via embeddings in the space of smooth graph signal distributions.
By finding a mean in this embedding space, we can recover a mean graph that preserves structural information.
We establish the existence and uniqueness of the novel graph mean, and provide an iterative algorithm for computing it.
arXiv Detail & Related papers (2023-05-31T11:04:53Z) - Far Away in the Deep Space: Dense Nearest-Neighbor-Based
Out-of-Distribution Detection [33.78080060234557]
Nearest-Neighbors approaches have been shown to work well in object-centric data domains.
We show that nearest-neighbor approaches also yield state-of-the-art results on dense novelty detection in complex driving scenes.
arXiv Detail & Related papers (2022-11-12T13:32:19Z) - Concrete Score Matching: Generalized Score Matching for Discrete Data [109.12439278055213]
"Concrete score" is a generalization of the (Stein) score for discrete settings.
"Concrete Score Matching" is a framework to learn such scores from samples.
arXiv Detail & Related papers (2022-11-02T00:41:37Z) - Benchmarking Node Outlier Detection on Graphs [90.29966986023403]
Graph outlier detection is an emerging but crucial machine learning task with numerous applications.
We present the first comprehensive unsupervised node outlier detection benchmark for graphs called UNOD.
arXiv Detail & Related papers (2022-06-21T01:46:38Z) - FV-UPatches: Enhancing Universality in Finger Vein Recognition [0.6299766708197883]
We propose a universal learning-based framework, which achieves generalization while training with limited data.
The proposed framework shows application potential in other vein-based biometric recognition as well.
arXiv Detail & Related papers (2022-06-02T14:20:22Z) - Estimating leverage scores via rank revealing methods and randomization [50.591267188664666]
We study algorithms for estimating the statistical leverage scores of rectangular dense or sparse matrices of arbitrary rank.
Our approach is based on combining rank revealing methods with compositions of dense and sparse randomized dimensionality reduction transforms.
arXiv Detail & Related papers (2021-05-23T19:21:55Z) - Making Affine Correspondences Work in Camera Geometry Computation [62.7633180470428]
Local features provide region-to-region rather than point-to-point correspondences.
We propose guidelines for effective use of region-to-region matches in the course of a full model estimation pipeline.
Experiments show that affine solvers can achieve accuracy comparable to point-based solvers at faster run-times.
arXiv Detail & Related papers (2020-07-20T12:07:48Z)
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.