Evaluation of Novelty Detection Methods in On-Body Smartphone Localization Problem

Author(s):  
Mitsuaki Saito ◽  
Kaori Fujinami
Sensors ◽  
2021 ◽  
Vol 21 (10) ◽  
pp. 3536
Author(s):  
Jakub Górski ◽  
Adam Jabłoński ◽  
Mateusz Heesch ◽  
Michał Dziendzikowski ◽  
Ziemowit Dworakowski

Condition monitoring is an indispensable element related to the operation of rotating machinery. In this article, the monitoring system for the parallel gearbox was proposed. The novelty detection approach is used to develop the condition assessment support system, which requires data collection for a healthy structure. The measured signals were processed to extract quantitative indicators sensitive to the type of damage occurring in this type of structure. The indicator’s values were used for the development of four different novelty detection algorithms. Presented novelty detection models operate on three principles: feature space distance, probability distribution, and input reconstruction. One of the distance-based models is adaptive, adjusting to new data flowing in the form of a stream. The authors test the developed algorithms on experimental and simulation data with a similar distribution, using the training set consisting mainly of samples generated by the simulator. Presented in the article results demonstrate the effectiveness of the trained models on both data sets.


1992 ◽  
Vol 4 (6) ◽  
pp. 863-879 ◽  
Author(s):  
Jürgen Schmidhuber

I propose a novel general principle for unsupervised learning of distributed nonredundant internal representations of input patterns. The principle is based on two opposing forces. For each representational unit there is an adaptive predictor, which tries to predict the unit from the remaining units. In turn, each unit tries to react to the environment such that it minimizes its predictability. This encourages each unit to filter "abstract concepts" out of the environmental input such that these concepts are statistically independent of those on which the other units focus. I discuss various simple yet potentially powerful implementations of the principle that aim at finding binary factorial codes (Barlow et al. 1989), i.e., codes where the probability of the occurrence of a particular input is simply the product of the probabilities of the corresponding code symbols. Such codes are potentially relevant for (1) segmentation tasks, (2) speeding up supervised learning, and (3) novelty detection. Methods for finding factorial codes automatically implement Occam's razor for finding codes using a minimal number of units. Unlike previous methods the novel principle has a potential for removing not only linear but also nonlinear output redundancy. Illustrative experiments show that algorithms based on the principle of predictability minimization are practically feasible. The final part of this paper describes an entirely local algorithm that has a potential for learning unique representations of extended input sequences.


Author(s):  
Masahide Sugiyama ◽  
Konstantin Markov ◽  
Andrey Ronzhin ◽  
Victor Budkov ◽  
Alexey Karpov ◽  
...  

2014 ◽  
Vol 135 ◽  
pp. 313-327 ◽  
Author(s):  
Xuemei Ding ◽  
Yuhua Li ◽  
Ammar Belatreche ◽  
Liam P. Maguire

Author(s):  
Chengwei Chen ◽  
Yuan Xie ◽  
Shaohui Lin ◽  
Ruizhi Qiao ◽  
Jian Zhou ◽  
...  

Novelty detection is the process of determining whether a query example differs from the learned training distribution. Previous generative adversarial networks based methods and self-supervised approaches suffer from instability training, mode dropping, and low discriminative ability. We overcome such problems by introducing a novel decoder-encoder framework. Firstly, a generative network (decoder) learns the representation by mapping the initialized latent vector to an image. In particular, this vector is initialized by considering the entire distribution of training data to avoid the problem of mode-dropping. Secondly, a contrastive network (encoder) aims to ``learn to compare'' through mutual information estimation, which directly helps the generative network to obtain a more discriminative representation by using a negative data augmentation strategy. Extensive experiments show that our model has significant superiority over cutting-edge novelty detectors and achieves new state-of-the-art results on various novelty detection benchmarks, e.g. CIFAR10 and DCASE. Moreover, our model is more stable for training in a non-adversarial manner, compared to other adversarial based novelty detection methods.


10.5772/67531 ◽  
2017 ◽  
Author(s):  
Miguel Delgado Prieto ◽  
Jesús A. Cariño Corrales ◽  
Daniel Zurita Millán ◽  
Marta Millán Gonzalvez ◽  
Juan A. Ortega Redondo ◽  
...  

Author(s):  
Paul Hayton ◽  
Simukai Utete ◽  
Dennis King ◽  
Steve King ◽  
Paul Anuzis ◽  
...  

Novelty detection requires models of normality to be learnt from training data known to be normal. The first model considered in this paper is a static model trained to detect novel events associated with changes in the vibration spectra recorded from a jet engine. We describe how the distribution of energy across the harmonics of a rotating shaft can be learnt by a support vector machine model of normality. The second model is a dynamic model partially learnt from data using an expectation–maximization-based method. This model uses a Kalman filter to fuse performance data in order to characterize normal engine behaviour. Deviations from normal operation are detected using the normalized innovations squared from the Kalman filter.


2013 ◽  
Vol 27 (7) ◽  
pp. 1933-1942 ◽  
Author(s):  
Lei Hu ◽  
Niaoqing Hu ◽  
Xinpeng Zhang ◽  
Fengshou Gu ◽  
Ming Gao

Sign in / Sign up

Export Citation Format

Share Document