Geodesic
On one recognition problem of vector alphabet generating a~sequence with a~quasi-periodical structure
Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 12 (2009) no. 3, pp. 275-287.

Voir la notice de l'article provenant de la source Math-Net.Ru

In this paper, we analyze one version of the off-line recognition problem of the vector alphabet in the case when this alphabet is a generator of sequences having quasi-periodical vector-fragments, these fragments coinciding with alphabet vectors. It is shown that the solution of this problem is reduced to that of a special optimization problem. We have proven that this problem is solvable in a polynomial time. An algorithm for an exact solution to this problem is justified. This algorithm ensures the maximum-likelihood recognition of the vector alphabet under condition when the noise is additive and is a Gaussian sequence of independent random values having an identical distribution. 
@article{SJVM_2009_12_3_a3,
     author = {A. V. Kel'manov and S. A. Khamidullin},
     title = {On one recognition problem of vector alphabet generating a~sequence with a~quasi-periodical structure},
     journal = {Sibirskij \v{z}urnal vy\v{c}islitelʹnoj matematiki},
     pages = {275--287},
     publisher = {mathdoc},
     volume = {12},
     number = {3},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/SJVM_2009_12_3_a3/}
}
TY  - JOUR
AU  - A. V. Kel'manov
AU  - S. A. Khamidullin
TI  - On one recognition problem of vector alphabet generating a~sequence with a~quasi-periodical structure
JO  - Sibirskij žurnal vyčislitelʹnoj matematiki
PY  - 2009
SP  - 275
EP  - 287
VL  - 12
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SJVM_2009_12_3_a3/
LA  - ru
ID  - SJVM_2009_12_3_a3
ER  - 
%0 Journal Article
%A A. V. Kel'manov
%A S. A. Khamidullin
%T On one recognition problem of vector alphabet generating a~sequence with a~quasi-periodical structure
%J Sibirskij žurnal vyčislitelʹnoj matematiki
%D 2009
%P 275-287
%V 12
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SJVM_2009_12_3_a3/
%G ru
%F SJVM_2009_12_3_a3
A. V. Kel'manov; S. A. Khamidullin. On one recognition problem of vector alphabet generating a~sequence with a~quasi-periodical structure. Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 12 (2009) no. 3, pp. 275-287. http://geodesic.mathdoc.fr/item/SJVM_2009_12_3_a3/

[1] Kel'manov A. V., Jeon B., “A Posteriori joint detection and discrimination of pulses in a quasiperiodic pulse train”, IEEE Transactions on Signal Processing, 52:3 (2004), 1–12 | DOI | MR

[2] Wald A., Sequential Analysis, John Wiley, New York, 1947 | MR

[3] Kligene N., Telksnis L., “Metody obnaruzheniya momentov izmeneniya svoistv sluchainykh protsessov”, Avtomatika i telemekhanika, 10 (1983), 5–56 | MR | Zbl

[4] Torgovitskii I. Sh., “Metody opredeleniya momenta izmeneniya veroyatnostnykh kharakteristik sluchainykh velichin”, Zarubezhnaya radioelektronika, 1 (1976), 3–52

[5] Nikiforov I. V., Posledovatelnoe obnaruzhenie izmeneniya svoistv vremennykh ryadov, Nauka, M., 1983 | MR | Zbl

[6] Zhiglyavskii A. A., Kraskovskii A. E., Obnaruzhenie razladki sluchainykh protsessov v zadachakh radiotekhniki, LGU, L., 1988

[7] M. Bassvil, A. Vilski, A. Banvenist i dr. (eds.), Obnaruzhenie izmeneniya svoistv signalov i dinamicheskikh sistem, Mir, M., 1989

[8] Van Trees H. L., Detection, Estimation, and Modulation Theory, Part I, John Wiley Sons Inc., New York, 1968 | Zbl

[9] Helstrom C. W., Elements of Signal Detection and Estimation, Prentice-Hall, Englewood Cli.s, NJ, 1979

[10] Anderson B. D., Moore J. D., Optimal Filtering, Prentice-Hall, Englewood Cli.s, NJ, 1995

[11] Duda R. O., Hart P. E., Pattern Classification and Scene Analysis, John Wiley Sons Inc., New York, 1973 | Zbl

[12] Fukunaga K., Introduction to Statistical Pattern Recognition, 2nd ed., Academic Press, New York, 1990 | MR | Zbl

[13] Kelmanov A. V., Khamidullin S. A., “Aposteriornoe obnaruzhenie zadannogo chisla odinakovykh podposledovatelnostei v kvaziperiodicheskoi posledovatelnosti”, Zhurn. vychisl. matematiki i mat. fiziki, 41:5 (2001), 807–820 | MR

[14] Kelmanov A. V., Khamidullin S. A., “Raspoznavanie kvaziperiodicheskoi posledovatelnosti, obrazovannoi iz zadannogo chisla odinakovykh podposledovatelnostei”, Sib. zhurn. industr. matematiki, 2:1 (1999), 53–74 | MR

[15] Kel'manov A. V., Khamidullin S. A., “A Posteriori joint detection and discrimination of a given number of subsequences in a quasiperiodic sequence”, Pattern Recognition and Image Analysis, 10:3 (2000), 379–388 | MR

[16] Kelmanov A. V., Mikhailova L. V., “Sovmestnoe obnaruzhenie v kvaziperiodicheskoi posledovatelnosti zadannogo chisla fragmentov iz etalonnogo nabora i ee razbienie na uchastki, vklyuchayuschie serii odinakovykh fragmentov”, Zhurn. vychisl. matematiki i mat. fiziki, 46:1 (2006), 172–189 | MR

[17] Kelmanov A. V., “O nekotorykh polinomialno razreshimykh i NP-trudnykh zadachakh analiza i raspoznavaniya posledovatelnostei s kvaziperiodicheskoi strukturoi”, 13-ya Vseross. konf. “Matematicheskie metody raspoznavaniya obrazov”, Sbornik dokladov (Leningradskaya obl., g. Zelenogorsk, 30 sentyabrya–6 oktyabrya 2007 g.), MAKS Press, M., 2007, 261–264

[18] Kelmanov A. V., “Polinomialno razreshimye i NP-trudnye varianty zadachi optimalnogo obnaruzheniya v chislovoi posledovatelnosti povtoryayuschegosya fragmenta”, Materialy Rossiiskoi konf. “Diskretnaya optimizatsiya i issledovanie operatsii” (Vladivostok, 7–14 sentyabrya 2007), Izd-vo Instituta matematiki SO RAN, Novosibirsk, 2007; http://math.nsc.ru/conference/door07/DOOR-abstracts.pdf

[19] Kel'manov A. V., “Discrete optimization problem in a connection with the off-line noiseproof detection of a repeating fragment in a numerical sequence”, 9-th Intern. Conf. “Pattern Recognition and Image Analysis: New Information Technologies”, Conference Proceedings. Vol. 1, Nizhni Novgorod, 2008, 273–275

[20] Kel'manov A. V., Mikhailova L. V., and Khamidullin S. A., “QPSLab system for analysis and recognition of signals with a quasiperiodic structure”, 9-th Intern. Conf. “Pattern Recognition and Image Analysis: New Information Technologies”, Conference Proceedings. Vol. 1, Nizhni Novgorod, 2008, 412–418