Estimates of Error Probability for Complex Gaussian Channels with Generalized Likelihood Ratio Detection

Authors:
Michael D. DeVore
Affiliations:
IEEE
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
2005

Citing 7
Cited 1

Small Sample Size Effects in Statistical Pattern Recognition: Recommendations for Practitioners

IEEE Transactions on Pattern Analysis and Machine Intelligence
Feature Selection: Evaluation, Application, and Small Sample Performance

IEEE Transactions on Pattern Analysis and Machine Intelligence
Detection, Estimation, and Modulation Theory: Radar-Sonar Signal Processing and Gaussian Signals in Noise

Detection, Estimation, and Modulation Theory: Radar-Sonar Signal Processing and Gaussian Signals in Noise
Target-Centered Models and Information-Theoretic Segmentation for Automatic Target Recognition

Multidimensional Systems and Signal Processing
Multidimensional probability density function approximations fordetection, classification, and model order selection

IEEE Transactions on Signal Processing
Thresholding method for dimensionality reduction in recognition systems

IEEE Transactions on Information Theory
Quantitative statistical assessment of conditional models for synthetic aperture radar

IEEE Transactions on Image Processing

Toward a tight upper bound for the error probability of the binary Gaussian classification problem

Pattern Recognition

Quantified Score

Hi-index	0.15

Visualization

Abstract

We derive approximate expressions for the probability of error in a two-class hypothesis testing problem in which the two hypotheses are characterized by zero-mean complex Gaussian distributions. These error expressions are given in terms of the moments of the test statistic employed and we derive these moments for both the likelihood ratio test, appropriate when class densities are known, and the generalized likelihood ratio test, appropriate when class densities must be estimated from training data. These moments are functions of class distribution parameters which are generally unknown so we develop unbiased moment estimators in terms of the training data. With these, accurate estimates of probability of error can be calculated quickly for both the optimal and plug-in rules from available training data. We present a detailed example of the behavior of these estimators and demonstrate their application to common pattern recognition problems, which include quantifying the incremental value of larger training data collections, evaluating relative geometry in data fusion from multiple sensors, and selecting a good subset of available features.