Back to Search
Start Over
Improving Re-Identification by Estimating and Utilizing Diverse Uncertainty Types for Embeddings.
- Source :
-
Algorithms . Oct2024, Vol. 17 Issue 10, p430. 40p. - Publication Year :
- 2024
-
Abstract
- In most re-identification approaches, embedding vectors are compared to identify the best match for a given query. However, this comparison does not take into account whether the encoded information in the embedding vectors was extracted reliably from the input images. We propose the first attempt that illustrates how all three types of uncertainty, namely model uncertainty (also known as epistemic uncertainty), data uncertainty (also known as aleatoric uncertainty), and distributional uncertainty, can be estimated for embedding vectors. We provide evidence that we do indeed estimate these types of uncertainty, and that each type has its own value for improving re-identification performance. In particular, while the few state-of-the-art approaches that employ uncertainty for re-identification during inference utilize only data uncertainty to improve single-shot re-identification performance, we demonstrate that the estimated model uncertainty vector can be utilized to modify the feature vector. We explore the best method for utilizing the estimated model uncertainty based on the Market-1501 dataset and demonstrate that we are able to further enhance the performance above the already strong baseline UAL. Additionally, we show that the estimated distributional uncertainty resembles the degree to which the current sample is out-of-distribution. To illustrate this, we divide the distractor set of the Market-1501 dataset into four classes, each representing a different degree of out-of-distribution. By computing a score based on the estimated distributional uncertainty vector, we are able to correctly order the four distractor classes and to differentiate them from an in-distribution set to a significant extent. [ABSTRACT FROM AUTHOR]
- Subjects :
- *EPISTEMIC uncertainty
Subjects
Details
- Language :
- English
- ISSN :
- 19994893
- Volume :
- 17
- Issue :
- 10
- Database :
- Academic Search Index
- Journal :
- Algorithms
- Publication Type :
- Academic Journal
- Accession number :
- 180486566
- Full Text :
- https://doi.org/10.3390/a17100430