Sparse Representation-based Open Set Recognition

May 06, 2017 · Entered Twilight · 🏛 IEEE Transactions on Pattern Analysis and Machine Intelligence

"Last commit was 9.0 years ago (≥5 year threshold)"

Evidence collected by the PWNC Scanner

Repo contents: README.md, evttt, object_src_evt.m, object_src_fmeas.m, readme.txt, spgl1-1.9, tools, train_src_separate.m, train_together.m

Authors He Zhang, Vishal M. Patel arXiv ID 1705.02431 Category cs.CV: Computer Vision Citations 195 Venue IEEE Transactions on Pattern Analysis and Machine Intelligence Repository https://github.com/hezhangsprinter/SROSR ⭐ 23 Last Checked 1 month ago

Abstract

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