Out-of-distribution detection algorithms for robust insect
classification
- URL: http://arxiv.org/abs/2305.01823v1
- Date: Tue, 2 May 2023 23:19:16 GMT
- Title: Out-of-distribution detection algorithms for robust insect
classification
- Authors: Mojdeh Saadati, Aditya Balu, Shivani Chiranjeevi, Talukder Zaki
Jubery, Asheesh K Singh, Soumik Sarkar, Arti Singh, Baskar
Ganapathysubramanian
- Abstract summary: Out-of-distribution (OOD) detection algorithms provide an exciting avenue to overcome these challenge.
We generate and evaluate the performance of state-of-the-art OOD algorithms on insect detection classifiers.
- Score: 9.411531046381723
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Deep learning-based approaches have produced models with good insect
classification accuracy; Most of these models are conducive for application in
controlled environmental conditions. One of the primary emphasis of researchers
is to implement identification and classification models in the real
agriculture fields, which is challenging because input images that are wildly
out of the distribution (e.g., images like vehicles, animals, humans, or a
blurred image of an insect or insect class that is not yet trained on) can
produce an incorrect insect classification. Out-of-distribution (OOD) detection
algorithms provide an exciting avenue to overcome these challenge as it ensures
that a model abstains from making incorrect classification prediction of
non-insect and/or untrained insect class images. We generate and evaluate the
performance of state-of-the-art OOD algorithms on insect detection classifiers.
These algorithms represent a diversity of methods for addressing an OOD
problem. Specifically, we focus on extrusive algorithms, i.e., algorithms that
wrap around a well-trained classifier without the need for additional
co-training. We compared three OOD detection algorithms: (i) Maximum Softmax
Probability, which uses the softmax value as a confidence score, (ii)
Mahalanobis distance-based algorithm, which uses a generative classification
approach; and (iii) Energy-Based algorithm that maps the input data to a scalar
value, called energy. We performed an extensive series of evaluations of these
OOD algorithms across three performance axes: (a) \textit{Base model accuracy}:
How does the accuracy of the classifier impact OOD performance? (b) How does
the \textit{level of dissimilarity to the domain} impact OOD performance? and
(c) \textit{Data imbalance}: How sensitive is OOD performance to the imbalance
in per-class sample size?
Related papers
- A noisy elephant in the room: Is your out-of-distribution detector robust to label noise? [49.88894124047644]
We take a closer look at 20 state-of-the-art OOD detection methods.
We show that poor separation between incorrectly classified ID samples vs. OOD samples is an overlooked yet important limitation of existing methods.
arXiv Detail & Related papers (2024-04-02T09:40:22Z) - Machine Learning-Assisted Pattern Recognition Algorithms for Estimating
Ultimate Tensile Strength in Fused Deposition Modeled Polylactic Acid
Specimens [0.0]
We investigate the application of supervised machine learning algorithms for estimating the Ultimate Tensile Strength (UTS) of Polylactic Acid (PLA) specimens fabricated using the Fused Deposition Modeling (FDM) process.
The primary objective was to assess the accuracy and effectiveness of four distinct supervised classification algorithms, namely Logistic Classification, Gradient Boosting Classification, Decision Tree, and K-Nearest Neighbor.
The results revealed that while the Decision Tree and K-Nearest Neighbor algorithms both achieved an F1 score of 0.71, the KNN algorithm exhibited a higher Area Under the Curve (AUC) score of 0.79, outperforming the other algorithms
arXiv Detail & Related papers (2023-07-13T11:10:22Z) - Fine-grain Inference on Out-of-Distribution Data with Hierarchical
Classification [37.05947324355846]
We propose a new model for OOD detection that makes predictions at varying levels of granularity as the inputs become more ambiguous.
We demonstrate the effectiveness of hierarchical classifiers for both fine- and coarse-grained OOD tasks.
arXiv Detail & Related papers (2022-09-09T18:52:36Z) - Towards Diverse Evaluation of Class Incremental Learning: A Representation Learning Perspective [67.45111837188685]
Class incremental learning (CIL) algorithms aim to continually learn new object classes from incrementally arriving data.
We experimentally analyze neural network models trained by CIL algorithms using various evaluation protocols in representation learning.
arXiv Detail & Related papers (2022-06-16T11:44:11Z) - Metric Learning and Adaptive Boundary for Out-of-Domain Detection [0.9236074230806579]
We have designed an OOD detection algorithm independent of OOD data.
Our algorithm is based on a simple but efficient approach of combining metric learning with adaptive decision boundary.
Compared to other algorithms, we have found that our proposed algorithm has significantly improved OOD performance in a scenario with a lower number of classes.
arXiv Detail & Related papers (2022-04-22T17:54:55Z) - Evaluating State-of-the-Art Classification Models Against Bayes
Optimality [106.50867011164584]
We show that we can compute the exact Bayes error of generative models learned using normalizing flows.
We use our approach to conduct a thorough investigation of state-of-the-art classification models.
arXiv Detail & Related papers (2021-06-07T06:21:20Z) - Investigating the Robustness of Artificial Intelligent Algorithms with
Mixture Experiments [1.877815076482061]
robustness of AI algorithms is of great interest as inaccurate prediction could result in safety concerns and limit the adoption of AI systems.
A robust classification algorithm is expected to have high accuracy and low variability under different application scenarios.
We conduct a comprehensive set of mixture experiments to collect prediction performance results.
Then statistical analyses are conducted to understand how various factors affect the robustness of AI classification algorithms.
arXiv Detail & Related papers (2020-10-10T15:38:53Z) - An Algorithm for Out-Of-Distribution Attack to Neural Network Encoder [1.7305469511995404]
Out-Of-Distribution (OOD) samples do not follow the distribution of training set, and therefore the predicted class labels on OOD samples become meaningless.
We show that this type of method has no theoretical guarantee and is practically breakable by our OOD Attack algorithm.
We also show that Glow likelihood-based OOD detection is breakable as well.
arXiv Detail & Related papers (2020-09-17T02:10:36Z) - Bayesian Optimization with Machine Learning Algorithms Towards Anomaly
Detection [66.05992706105224]
In this paper, an effective anomaly detection framework is proposed utilizing Bayesian Optimization technique.
The performance of the considered algorithms is evaluated using the ISCX 2012 dataset.
Experimental results show the effectiveness of the proposed framework in term of accuracy rate, precision, low-false alarm rate, and recall.
arXiv Detail & Related papers (2020-08-05T19:29:35Z) - Rectified Meta-Learning from Noisy Labels for Robust Image-based Plant
Disease Diagnosis [64.82680813427054]
Plant diseases serve as one of main threats to food security and crop production.
One popular approach is to transform this problem as a leaf image classification task, which can be addressed by the powerful convolutional neural networks (CNNs)
We propose a novel framework that incorporates rectified meta-learning module into common CNN paradigm to train a noise-robust deep network without using extra supervision information.
arXiv Detail & Related papers (2020-03-17T09:51:30Z) - Learning with Out-of-Distribution Data for Audio Classification [60.48251022280506]
We show that detecting and relabelling certain OOD instances, rather than discarding them, can have a positive effect on learning.
The proposed method is shown to improve the performance of convolutional neural networks by a significant margin.
arXiv Detail & Related papers (2020-02-11T21:08:06Z)
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.