An algorithm for recognition of a vector alphabet generating a sequence with a quasi-periodic structure

Authors:
A. V. Kel'Manov;S. A. Khamidullin
Affiliations:
Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk, Russia 630090;Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk, Russia 630090
Venue:
Pattern Recognition and Image Analysis
Year:
2010

Citing 2
Cited 0

Introduction to statistical pattern recognition (2nd ed.)

Introduction to statistical pattern recognition (2nd ed.)
A posteriori joint detection and discrimination of pulses in a quasiperiodic pulse train

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of noise-proof a posteriori (off-line) recognition is considered for a vector alphabet generating sequences that include quasi-periodically alternating vector-fragments coinciding with elements of this alphabet. One variant of this problem is reduced to the discrete optimization problem under investigation. The exact polynomial solving the algorithm for the reduced problem is proved. This algorithm guarantees the maximum likelihood problem-solving in the case when the noise is additive and it is a Gaussian sequence of independent random values having identical distribution, whereas the number of alternating vector-fragments is unknown. The algorithm suggested has essentially smaller computational complexity in comparison with known one.