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

Damian Eads

dblp:24/6221 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2009
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 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
2 papers
Segmentation and scene understanding · 25% Efficient and distributed learning · 25% Representation and self-supervised learning · 25%

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

TopicWeightPapersLastEvidence papers
Computer vision › Segmentation and scene understanding
edge detection
0.112005
Online feature selection for pixel classification · ICML 2005
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
feature selection
0.112005
Online feature selection for pixel classification · ICML 2005
Machine learning › Efficient and distributed learning › data reduction
online feature selection
0.112005
Online feature selection for pixel classification · ICML 2005
Machine learning › Learning theory
classification
0.012003
Weighted Order Statistic Classifiers with Large Rank-Order Margin · ICML 2003
Machine learning › Learning theory › classification
margin-based classification
0.012003
Weighted Order Statistic Classifiers with Large Rank-Order Margin · ICML 2003

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

hill climbing · 0.1grafting · 0.1best-first search · 0.1
YearPublicationVenuePosition
2009 Learning Object Location Predictors with Boosting and Grammar-Guided Feature Extraction
abstract
The authors present BEAMER: a new spatially exploitative approach to learning object detectors which shows excellent results when applied to the task of detecting objects in greyscale aerial imagery in the presence of ambiguous and noisy data. There are four main contributions used to produce these results. First, they introduce a grammar-guided feature extraction system, enabling the exploration of a richer feature space while constraining the features to a useful subset. This is specified with a rule-based generative grammer crafted by a human expert. Second, they learn a classifier on this data using a newly proposed variant of AdaBoost which takes into account the spatially correlated nature of the data. Third, they perform another round of training to optimize the method of converting the pixel classifications generated by boosting into a high quality set of (x,y) locations. lastly, they carefully define three common problems in object detection and define two evaluation criteria that are tightly matched to these problems. Major strengths of this approach are: (1) a way of randomly searching a broad feature space, (2) its performance when evaluated on well-matched evaluation criteria, and (3) its use of the location prediction domain to learn object detectors as well as to generate detections that perform well on several tasks: object counting, tracking, and target detection. They demonstrate the efficacy of BEAMER with a comprehensive experimental evaluation on a challenging data set.
Damian Eads, Edward Rosten, David P. Helmbold
BMVC1
2005 Online feature selection for pixel classification
abstract
Online feature selection (OFS) provides an efficient way to sort through a large space of features, particularly in a scenario where the feature space is large and features take a significant amount of memory to store. Image processing operators, and especially combinations of image processing operators, provide a rich space of potential features for use in machine learning for image processing tasks but they are expensive to generate and store. In this paper we apply OFS to the problem of edge detection in grayscale imagery. We use a standard data set and compare our results to those obtained with traditional edge detectors, as well as with results obtained more recently using "statistical edge detection." We compare several different OFS approaches, including hill climbing, best first search, and grafting.
Karen A. Glocer, Damian Eads, James Theiler
ICML2
2003 Weighted Order Statistic Classifiers with Large Rank-Order Margin
Reid B. Porter, Damian Eads, Don R. Hush, James Theiler
ICML2