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

Karl Gerlach

dblp:74/2476 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
0since 2021 · last 2004
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 4 · 2 first-authorTheory of computation · 2 · 2 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.

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
2004 Robust adaptive signal processing methods for heterogeneous radar clutter scenarios
Muralidhar Rangaswamy, Freeman C. Lin, Karl Gerlach
Signal Process.3
2002 Adaptive cancellation of stationary interference in the presence of structured nonstationary interference
Michael R. Frey, Karl Gerlach
Signal Process.2
2000 Matrix algebraic selection of ARMA model order
abstract
A matrix algebraic method of order selection is proposed for ARMA time series modeling for situations in which both inputs and outputs are observed in additive noise with known variances. Such situations include observational studies in which all observations-those of both inputs and outputs-are erred and controlled experiments in which outputs are observed with error while inputs are observed without error. The proposed method is based on the eigenvalue structure of the covariance matrices associated with the observed data and performs well for short data records at moderate SNRs.
Karl Gerlach, Michael R. Frey
ICASSP1
1997 Detection of a spatially distributed target in white noise
abstract
A detector of a spatially distributed target in white Gaussian noise is developed. A reasonable distribution for the a priori target scatterer density is assumed, and a detector that incorporates this a priori knowledge is given. A simple detector form results, whose detection performance is robust over different scattering densities.
Karl Gerlach, Michael J. Steiner, Freeman C. Lin
IEEE Signal Process. Lett.1
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. Theory1
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. Theory1