Kernel Null Space Methods for Novelty Detection
The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
Detecting samples from previously unknown classes is a crucial task in object recognition, especially when dealing with real-world applications where the closed-world assumption does not hold. We present how to apply a null space method for novelty detection, which maps all training samples of one class to a single point. Beside the possibility of modeling a single class, we are able to treat multiple known classes jointly and to detect novelties for a set of classes with a single model. In contrast to modeling the support of each known class individually, our approach makes use of a projection in a joint subspace where training samples of all known classes have zero intra-class variance. This subspace is called the null space of the training data. To decide about novelty of a test sample, our null space approach allows for solely relying on a distance measure instead of performing density estimation directly. Therefore, we derive a simple yet powerful method for multi-class novelty detection, an important problem not studied sufficiently so far. Our novelty detection approach is assessed in comprehensive multi-class experiments using the publicly available datasets Caltech-256 and Image Net. The analysis reveals that our null space approach is perfectly suited for multi-class novelty detection since it outperforms all other methods.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
ImageNet: A large-scale hierarchical image database
Deng, J., Dong, W., Socher, R., Li, L.-J., Li, K., & Fei-Fei, L. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206848 · Cited by 65,333
Distinctive Image Features from Scale-Invariant Keypoints
Lowe, D. G. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000029664.99615.94 · Cited by 55,589
Gaussian Processes for Machine Learning
Rasmussen, C. E., & Williams, C. K. I. (2005) · doi:10.7551/mitpress/3206.001.0001 · Cited by 11,705
Estimating the Support of a High-Dimensional Distribution
Schölkopf, B., Platt, J. C., Shawe-Taylor, J., Smola, A. J., & Williamson, R. C. (2001) · Neural Computation · doi:10.1162/089976601750264965 · Cited by 6,168 · cited 6×
“Note that one-class SVM (1SVM), which separates the samples of a single class from the origin with maximum margin, achieves results equivalent to SVDD when using a kernel that leads to constant self-similarities κ(x,x) [20].”
BackgroundMethodInfluentialLearning to detect unseen object classes by between-class attribute transfer
Lampert, C. H., Nickisch, H., & Harmeling, S. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206594 · Cited by 1,849 · cited 1×
“In visual object recognition, novelty detection should not be confused with the detection of unseen classes in zero shot learning [9], where knowledge about new objects is used explicitly, e.”
BackgroundMetric Learning for Large Scale Image Classification: Generalizing to New Classes at Near-Zero Cost
Mensink, T., Verbeek, J., Perronnin, F., & Csurka, G. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33709-3_35 · Cited by 281 · cited 2×
“Additionally, incorporating metric learning approaches related to null space methods such as [5, 17] is of special interest.”
Background
Cited by
Recent Advances in Open Set Recognition: A Survey
Geng, C., Huang, S.-J., & Chen, S. (2021) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2020.2981604 · Cited by 1,006
Generalized Out-of-Distribution Detection: A Survey
Yang, J., Zhou, K., Li, Y., & Liu, Z. (2024) · International Journal of Computer Vision · doi:10.1007/s11263-024-02117-4 · Cited by 884
Learning a Discriminative Null Space for Person Re-identification
Zhang, L., Xiang, T., & Gong, S. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.139 · Cited by 621
Multi-class Open Set Recognition Using Probability of Inclusion
Jain, L. P., Scheirer, W. J., & Boult, T. E. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-10578-9_26 · Cited by 340
Learning Deep Features for One-Class Classification
Perera, P., & Patel, V. M. (2019) · IEEE Transactions on Image Processing · doi:10.1109/tip.2019.2917862 · Cited by 399
Generative Probabilistic Novelty Detection with Adversarial Autoencoders
Pidhorskyi, S., Almohsen, R., Adjeroh, D. A., & Doretto, G. (2018) · arXiv · doi:10.48550/arxiv.1807.02588 · Cited by 255
“More recently, [23] introduced the Kernel Null Foley-Sammon Transform (KNFST) for multi-class novelty detection, where training samples of each known category are projected onto a single point in the null space and then distances between the projection of a test sample and the class representatives…”
BackgroundBlind spot detection for safe sim-to-real transfer
Ramakrishnan, R., Kamar, E., Dey, D., Horvitz, E., & Shah, J. (2020) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.11436 · Cited by 21
Metadata
- Authors
- Bodesheim, P., Freytag, A., Rodner, E., Kemmler, M., & Denzler, J.
- Venue
- 2013 IEEE Conference on Computer Vision and Pattern Recognition
- Publisher
- IEEE
- Published
- 2013-06
- Pages
- 3374-3381
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2081604642
- Cited by
- 119
- References
- 6
- FWCI
- 6.29
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.