Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Elad Osherov

dblp:211/7224 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Trustworthy machine learning · 61% Deep learning architectures and training · 30% Image recognition and object detection · 9%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
convolutional neural network
0.312017
Increasing CNN Robustness to Occlusions by Reducing Filter Support · ICCV 2017
Machine learning › Trustworthy machine learning › robustness › corruption robustness
occlusion robustness
0.312017
Increasing CNN Robustness to Occlusions by Reducing Filter Support · ICCV 2017
Machine learning › Trustworthy machine learning
robustness
0.312017
Increasing CNN Robustness to Occlusions by Reducing Filter Support · ICCV 2017
Computer vision › Image recognition and object detection › image classification
object classification
0.112017
Increasing CNN Robustness to Occlusions by Reducing Filter Support · ICCV 2017

Methods — techniques the papers use, named apart from their topics

second central moments · 0.3reweighted l1 · 0.3regularization · 0.3group sparsity · 0.3
YearPublicationVenuePosition
2017 Increasing CNN Robustness to Occlusions by Reducing Filter Support
abstract
Convolutional neural networks (CNNs) provide the current state of the art in visual object classification, but they are far less accurate when classifying partially occluded objects. A straightforward way to improve classification under occlusion conditions is to train the classifier using partially occluded object examples. However, training the network on many combinations of object instances and occlusions may be computationally expensive. This work proposes an alternative approach to increasing the robustness of CNNs to occlusion. We start by studying the effect of partial occlusions on the trained CNN and show, empirically, that training on partially occluded examples reduces the spatial support of the filters. Building upon this finding, we argue that smaller filter support is beneficial for occlusion robustness. We propose a training process that uses a special regularization term that acts to shrink the spatial support of the filters. We consider three possible regularization terms that are based on second central moments, group sparsity, and mutually reweighted L1, respectively. When trained on normal (unoccluded) examples, the resulting classifier is highly robust to occlusions. For large training sets and limited training time, the proposed classifier is even more accurate than standard classifiers trained on occluded object examples.
Elad Osherov, Michael Lindenbaum
ICCV1