Sparse Representation-based Open Set Recognition
원문 초록
We propose a generalized Sparse Representation- based Classification (SRC) algorithm for open set recognition where not all classes presented during testing are known during training. The SRC algorithm uses class reconstruction errors for classification. As most of the discriminative information for open set recognition is hidden in the tail part of the matched and sum of non-matched reconstruction error distributions, we model the tail of those two error distributions using the statistical Extreme Value Theory (EVT). Then we simplify the open set recognition problem into a set of hypothesis testing problems. The confidence scores corresponding to the tail distributions of a novel test sample are then fused to determine its identity. The effectiveness of the proposed method is demonstrated using four publicly available image and object classification datasets and it is shown that this method can perform significantly better than many competitive open set recognition algorithms. Code is public available: https://github.com/hezhangsprinter/SROSR
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Disentangled representations of microscopy images
Generative Adversarial Minority Oversampling for Spectral-Spatial Hyperspectral Image Classification
Attention-Based Adaptive Spectral-Spatial Kernel ResNet for Hyperspectral Image Classification
Image and Text fusion for UPMC Food-101 \\using BERT and CNNs
Kidney Level Lupus Nephritis Classification using Uncertainty Guided Bayesian Convolutional Neural Networks
Beyond the Attention: Distinguish the Discriminative and Confusable Features For Fine-grained Image Classification
토론
이 논문과 연결된 포럼 글이 아직 없습니다.