John Jacobson

dblp:62/8063 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 3Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 67% GPUs and heterogeneous computing · 33%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › parallel computing › parallel program analysis
concurrency bug detection
0.812024
HiRace: Accurate and Fast Data Race Checking for GPU Programs · SC 2024
Parallel and multicore computing › parallel computing › parallel program debugging
data race detection
0.812024
HiRace: Accurate and Fast Data Race Checking for GPU Programs · SC 2024
GPUs and heterogeneous computing
GPU programming
0.812024
HiRace: Accurate and Fast Data Race Checking for GPU Programs · SC 2024

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

state machine · 0.8dynamic analysis · 0.8
YearPublicationVenuePosition
2024 HiRace: Accurate and Fast Data Race Checking for GPU Programs
abstract
Data races are egregious concurrency bugs that are especially problematic in performance-oriented GPU codes where large thread counts and multiple shared memory regions tend to exacerbate them. In this work, we present a new dynamic data-race checker called HiRace, whose key novelty is an innovative state machine designed to capitalize on the bulk-synchronous hierarchical GPU programming model. This state machine condenses an arbitrarily long access history into a constant-size state. We evaluate HiRace on a large, calibrated data-race benchmark suite. In over 3,500 studied executions of 580 CUDA kernels, 346 of which contain data races, we found HiRace to detect races missed by other tools without raising false alarms and to be more than 10 times faster on average than the current state of the art with half the memory overhead.
John Jacobson, Martin Burtscher, Ganesh Gopalakrishnan
SC1
2015 New insights and practical considerations in hyperspectral change detection
abstract
There are a multitude of civilian and military applications for the detection of anomalous changes in hyperspectral images. Anomalous changes occur when the material within a pixel is replaced. Environmental factors that change over time, such as illumination, will affect the radiance of all the pixels in a scene, despite the materials within remaining constant. The goal of an anomalous change detection algorithm is to suppress changes caused by the environment, and detect pixels where the materials within have changed. Anomalous change detection is a two step process. Two co-registered images of a scene are first transformed to maximize the overall correlation between the images, then an anomalous change detector (ACD) is applied to the transformed images. The transforms maximize the correlation between the two images to attenuate the environmental differences that distract from the anomalous changes of importance. Several categories of transforms with different optimization parameters are discussed and compared. One of two types of ACDs are then applied to the transformed images. The first ACD uses the difference of the two transformed images. The second concatenates the spectra of two images and uses an aggregated ACD. A comparison of the two ACD methods and their effectiveness with the different transforms is done for the first time.
Michael L. Pieper, Dimitris Manolakis 0001, Thomas W. Cooley, Michael Brueggeman, Andrew Weisner, John Jacobson
IGARSS6
2007 Robust Matched Filters for Target Detection in Hyperspectral Imaging Data
abstract
Most detection algorithms for hyperspectral imaging applications assume a target with a perfectly known spectral signature. In practice, the target signature is either imperfectly measured (target mismatch) and/or it exhibits spectral variability. The objective of this paper is to introduce a robust matched filter that takes the uncertainty and/or variability of target signatures into account. It is shown that, if we describe this uncertainty with an ellipsoid in the spectral space, we can design a matched filter that provides a response of the same magnitude for all spectra within this ellipsoid. Thus, by changing the size of this ellipsoid, we can control the "spectral selectivity" of the matched filter. The ability of the robust matched filter to deal effectively with target mismatch and spectral variability is demonstrated with hyperspectral imaging data from the HYDICE sensor.
Dimitris Manolakis 0001, Ronald B. Lockwood, Thomas W. Cooley, John Jacobson
ICASSP (1)4
2006 Robust Matched Filters for Hyperspectral Target Detection
abstract
The objective of this paper is to introduce a robust matched filter that takes the uncertainty or variability of target signatures into account. It is shown that, if we describe this uncertainty with an ellipsoid in the spectral space, we can design a matched filter that provides a response of the same magnitude for all spectra within this ellipsoid. Thus, by changing the size of this ellipsoid, we can control the "spectral selectivity" of the matched filter. Finally, we demonstrate the operation of the robust matched filter with real hyperspectral imaging data.
Dimitris Manolakis 0001, Ronald B. Lockwood, Thomas W. Cooley, John Jacobson
IGARSS4
2006 Statistical Characterization of Natural Hyperspectral Backgrounds
abstract
The objective of this paper is the statistical characterization of natural hyperspectral backgrounds using multivariate probability distribution models. We consider models based on elliptically contoured t-distributions and threshold models based on extreme value theory. Both models provide a level of accuracy for the "heavy-tails" of hyperspectral backgrounds, which is necessary for the implementation of constant false alarm rate detectors and their performance evaluation. The performance of these models is illustrated using data from the AVIRIS sensor.
Dimitris Manolakis 0001, M. Rossacci, John Cipar, Ronald B. Lockwood, Thomas W. Cooley, John Jacobson
IGARSS6