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

Oscar M. Danielsson

dblp:06/5697 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2011
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-authorHuman-computer interaction and ubiquitous computing · 1

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
2 papers
Image recognition and object detection · 61% Kernel, tree and ensemble methods · 22% 3D vision · 17%

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

TopicWeightPapersLastEvidence papers
Computer vision › Image recognition and object detection
object detection
0.222011
Gated classifiers: Boosting under high intra-class variation · CVPR 2011
Automatic learning and extraction of multi-local features · ICCV 2009
Machine learning › Kernel, tree and ensemble methods › ensemble learning
boosting
0.112011
Gated classifiers: Boosting under high intra-class variation · CVPR 2011
Computer vision › Image recognition and object detection › object detection
cascade classifier
0.112011
Gated classifiers: Boosting under high intra-class variation · CVPR 2011
Computer vision › 3D vision
3d shape representation
0.112009
Automatic learning and extraction of multi-local features · ICCV 2009

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

weak classifiers · 0.1gated classifiers · 0.1adaboost · 0.1voting scheme · 0.1ensemble learning · 0.1
YearPublicationVenuePosition
2011 Gated classifiers: Boosting under high intra-class variation
abstract
In this paper we address the problem of using boosting (e.g. AdaBoost [7]) to classify a target class with significant intra-class variation against a large background class. This situation occurs for example when we want to recognize a visual object class against all other image patches. The boosting algorithm produces a strong classifier, which is a linear combination of weak classifiers. We observe that we often have sets of weak classifiers that individually fire on many examples of the target class but never fire together on those examples (i.e. their outputs are anti-correlated on the target class). Motivated by this observation we suggest a family of derived weak classifiers, termed gated classifiers, that suppress such combinations of weak classifiers. Gated classifiers can be used on top of any original weak learner. We run experiments on two popular datasets, showing that our method reduces the required number of weak classifiers by almost an order of magnitude, which in turn yields faster detectors. We experiment on synthetic data showing that gated classifiers enables more complex distributions to be represented. We hope that gated classifiers will extend the usefulness of boosted classifier cascades [29].
Oscar M. Danielsson, Babak Rasolzadeh, Stefan Carlsson
CVPR1
2010 Generic Object Class Detection Using Boosted Configurations of Oriented Edges
Oscar M. Danielsson, Stefan Carlsson
ACCV (2)1
2009 Automatic learning and extraction of multi-local features
abstract
In this paper we introduce a new kind of feature - the multi-local feature, so named as each one is a collection of local features, such as oriented edgels, in a very specific spatial arrangement. A multi-local feature has the ability to capture underlying constant shape properties of exemplars from an object class. Thus it is particularly suited to representing and detecting visual classes that lack distinctive local structures and are mainly defined by their global shape. We present algorithms to automatically learn an ensemble of these features to represent an object class from weakly labelled training images of that class, as well as procedures to detect these features efficiently in novel images. The power of multi-local features is demonstrated by using the ensemble in a simple voting scheme to perform object category detection on a standard database. Despite its simplicity, this scheme yields detection rates matching state-of-the-art object detection systems.
Oscar M. Danielsson, Stefan Carlsson, Josephine Sullivan
ICCV1
2006 WebInSight: : making web images accessible
abstract
Images without alternative text are a barrier to equal web access for blind users. To illustrate the problem, we conducted a series of studies that conclusively show that a large fraction of significant images have no alternative text. To ameliorate this problem, we introduce WebInSight, a system that automatically creates and inserts alternative text into web pages on-the-fly. To formulate alternative text for images, we present three labeling modules based on web context analysis, enhanced optical character recognition (OCR) and human labeling. The system caches alternative text in a local database and can add new labels seamlessly after a web page is downloaded, resulting in minimal impact to the browsing experience.
Jeffrey P. Bigham, Ryan S. Kaminsky, Richard E. Ladner, Oscar M. Danielsson, Gordon L. Hempton
ASSETS4