Kevin J. Sangston

dblp:55/274 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1994
—ORCID · none

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

Theory of computation · 2

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.

Theoretical computer science
2 papers
Information theory · 81% Coding theory · 19%

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

TopicWeightPapersLastEvidence papers
Information theory › hypothesis testing
false alarm probability
0.011994
A sharp false alarm upper-bound for a matched filter bank detector · IEEE Trans. Inf. Theory 1994
Coding theory
upper bounds
0.011994
A sharp false alarm upper-bound for a matched filter bank detector · IEEE Trans. Inf. Theory 1994
Information theory › hypothesis testing › signal detection › weak signal detection
locally optimum detection
0.011993
Robust locally optimum detection of signals in dependent noise · IEEE Trans. Inf. Theory 1993
Information theory › hypothesis testing
robust detection
0.011993
Robust locally optimum detection of signals in dependent noise · IEEE Trans. Inf. Theory 1993
Information theory › hypothesis testing
signal detection
0.011993
Robust locally optimum detection of signals in dependent noise · IEEE Trans. Inf. Theory 1993
Information theory › probability theory
covariance matrix
0.011994
A sharp false alarm upper-bound for a matched filter bank detector · IEEE Trans. Inf. Theory 1994
Information theory › statistical inference › statistical decision theory
bayes risk
0.011993
Robust locally optimum detection of signals in dependent noise · IEEE Trans. Inf. Theory 1993

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

probability bound derivation · 0.0likelihood ratio · 0.0in-contamination model · 0.0
YearPublicationVenuePosition
1994 A sharp false alarm upper-bound for a matched filter bank detector
abstract
A sharp upper bound on the probability of false alarm, P/sub F/, of a matched filter bank detector over the class of input variates that are zero mean and have a specified covariance matrix, R/sub xx/, is derived. This bound is a function of the detector threshold, T, and R/sub xx/. It is shown that the bound is inversely proportional to T/sup 2/. Hence there may be a wide variation of P/sub F/ over the class since the P/sub F/ for Gaussian inputs varies as exp(-T/sup 2/).>
Karl Gerlach, Kevin J. Sangston
IEEE Trans. Inf. Theory2
1993 Robust locally optimum detection of signals in dependent noise
abstract
A robust locally optimum detector of a signal embedded in additive dependent nonGaussian noise is presented. The performance criterion is Bayes risk, the sample size is finite, and the uncertainty class of multivariate inputs is the in -contamination model. The locally optimum detector is shown to be a censored version of the nominal likelihood ratio.>
Karl Gerlach, Kevin J. Sangston
IEEE Trans. Inf. Theory2