Sphere-packings, lattices, and groups
Sphere-packings, lattices, and groups
Fundamentals of statistical signal processing: estimation theory
Fundamentals of statistical signal processing: estimation theory
Geometry of the Cramer-Rao bound
Signal Processing
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
The Structure Function and Distinguishable Models of Data
The Computer Journal
The Minimum Description Length Principle (Adaptive Computation and Machine Learning)
The Minimum Description Length Principle (Adaptive Computation and Machine Learning)
Information and Complexity in Statistical Modeling
Information and Complexity in Statistical Modeling
Some notes on Rissanen's stochastic complexity
IEEE Transactions on Information Theory
The minimum description length principle in coding and modeling
IEEE Transactions on Information Theory
Hi-index | 35.68 |
The newest approach to composite hypothesis testing proposed by Rissanen relies on the concept of optimally distinguishable distributions (ODD). The method is promising, but so far it has only been applied to a few simple examples.We derive the ODD detector for the classical linear model. In this framework, we provide answers to the following problems that have not been previously investigated in the literature: i) the relationship betweenODDand the widely used Generalized Likelihood Ratio Test (GLRT); ii) the connection between ODD and the information theoretic criteria applied in model selection. We point out the strengths and the weaknesses of the ODD method in detecting subspace signals in broadband noise. Effects of the subspace interference are also evaluated.