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

Timothy M. Stough

dblp:39/5339 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2007
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 2 · 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.

Computer graphics and multimedia
2 papers
Image and video processing · 72% Multimedia analysis and retrieval · 28%
Databases, data mining, and information retrieval
1 paper
Machine learning and data management · 100%
Artificial intelligence
2 papers
Image recognition and object detection · 100%

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

TopicWeightPapersLastEvidence papers
Image and video processing
image segmentation
0.012001
Focusing attention on objects of interest using multiple matched filters · IEEE Trans. Image Process. 2001
Image and video processing › image filtering
matched filtering
0.012001
Focusing attention on objects of interest using multiple matched filters · IEEE Trans. Image Process. 2001
Multimedia analysis and retrieval
object detection
0.012001
Focusing attention on objects of interest using multiple matched filters · IEEE Trans. Image Process. 2001
Computer vision › Image recognition and object detection › hyperspectral image analysis
hyperspectral image classification
0.012007
On-board analysis of uncalibrated data for a spacecraft at mars · KDD 2007
Computer vision › Image recognition and object detection
saliency prediction
0.011997
Image Feature Reduction through Spoiling: Its Application to Multiple Matched Filters for Focus of Attention · KDD 1997
Image and video processing
feature reduction
0.011997
Image Feature Reduction through Spoiling: Its Application to Multiple Matched Filters for Focus of Attention · KDD 1997

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

thresholding · 0.1reduced-set SVM · 0.1spoiling · 0.0matched filter · 0.0k-means clustering · 0.0dimensionality reduction · 0.0
YearPublicationVenuePosition
2007 On-board analysis of uncalibrated data for a spacecraft at mars
abstract
Analyzing data on-board a spacecraft as it is collected enables several advanced spacecraft capabilities, such as prioritizing observations to make the best use of limited bandwidth and reacting to dynamic events as they happen. In this paper, we describe how we addressed the unique challenges associated with on-board mining of data as it is collected: uncalibrated data, noisy observations, and severe limitations on computational and memory resources. The goal of this effort, which falls into the emerging application area of spacecraft-based data mining, was to study three specific science phenomena on Mars. Following previous work that used a linear support vector machine (SVM) on-board the Earth Observing 1 (EO-1)spacecraft, we developed three data mining techniques for use on-board the Mars Odyssey spacecraft. These methods range from simple thresholding to state-of-the-art reduced-set SVM technology. We tested these algorithms on archived data in a flight software testbed. We also describe a significant, serendipitous science discovery of this data mining effort: the confirmation of a water ice annulus around the north polar cap of Mars. We conclude with a discussion on lessons learned in developing algorithms for use on-board a spacecraft.
Rebecca Castaño, Kiri Wagstaff, Steve A. Chien, Timothy M. Stough, Benyang Tang
KDD4
2001 Focusing attention on objects of interest using multiple matched filters
abstract
In order to be of use to scientists, large image databases need to be analyzed to create a catalog of the objects of interest. One approach is to apply a multiple tiered search algorithm that uses reduction techniques of increasing computational complexity to select the desired objects from the database. The first tier of this type of algorithm, often called a focus of attention (FOA) algorithm, selects candidate regions from the image data and passes them to the next tier of the algorithm. In this paper we present a new approach to FOA that employs multiple matched filters (MMF), one for each object prototype, to detect the regions of interest. The MMFs are formed using k-means clustering on a set of image patches identified by domain experts as positive examples of objects of interest. An innovation of the approach is to radically reduce the dimensionality of the feature space, used by the k-means algorithm, by taking block averages (spoiling) the sample image patches. The process of spoiling is analyzed and its applicability to other domains is discussed. The combination of the output of the MMFs is achieved through the projection of the detections back into an empty image and then thresholding. This research was motivated by the need to detect small volcanos in the Magellan probe data from Venus. An empirical evaluation of the approach illustrates that a combination of the MMF plus the average filter results in a higher likelihood of 100% detection of the objects of interest at a lower false positive rate than a single matched filter alone.
Timothy M. Stough, Carla E. Brodley
IEEE Trans. Image Process.1
1997 Image Feature Reduction through Spoiling: Its Application to Multiple Matched Filters for Focus of Attention
Timothy M. Stough, Carla E. Brodley
KDD1