Weave analysis of paintings on canvas from radiographs
Signal Processing
Multiple objects: error exponents in hypotheses testing and identification
Information Theory, Combinatorics, and Search Theory
The Journal of Machine Learning Research
Hi-index | 754.84 |
The decision problem of testing M hypotheses when the source is Kth-order Markov and there are M (or fewer) training sequences of length N and a single test sequence of length n is considered. K, M, n, N are all given. It is shown what the requirements are on M , n, N to achieve vanishing (exponential) error probabilities and how to determine or bound the exponent. A likelihood ratio test that is allowed to produce a no-match decision is shown to provide asymptotically optimal error probabilities and minimum no-match decisions. As an important serial case, the binary hypotheses problem without rejection is discussed. It is shown that, for this configuration, only one training sequence is needed to achieve an asymptotically optimal test