Practical algorithms for algebraic and logical correction in precedent-based recognition problems
Sergey AblameykoBelarussian State University, pr. Nezavisimosti 4, Minsk, 220030, BelarusA. S. BiryukovDorodnicyn Computing Center, Russian Academy of Sciences, ul. Vavilova 40, Moscow, 119333, RussiaA. A. DokukinDorodnicyn Computing Center, Russian Academy of Sciences, ul. Vavilova 40, Moscow, 119333, RussiaA. G. D’yakonovFaculty of Computational Mathematics and Cybernetics, Moscow State University, Moscow, 119991, RussiaYu. I. ZhuravlevDorodnicyn Computing Center, Russian Academy of Sciences, ul. Vavilova 40, Moscow, 119333, RussiaВ. В. КраснопрошинBelarussian State University, pr. Nezavisimosti 4, Minsk, 220030, BelarusВ. А. ОбразцовBelarussian State University, pr. Nezavisimosti 4, Minsk, 220030, BelarusM. Yu. RomanovDorodnicyn Computing Center, Russian Academy of Sciences, ul. Vavilova 40, Moscow, 119333, RussiaV. V. RyazanovDorodnicyn Computing Center, Russian Academy of Sciences, ul. Vavilova 40, Moscow, 119333, Russia
2014en
ABI
Annotatsiya
Practical precedent-based recognition algorithms relying on logical or algebraic correction of various heuristic recognition algorithms are described. The recognition problem is solved in two stages. First, an arbitrary object is recognized independently by algorithms from a group. Then a final collective solution is produced by a suitable corrector. The general concepts of the algebraic approach are presented, practical algorithms for logical and algebraic correction are described, and results of their comparison are given.
Hali tarjima qilinmagan
Identifikatorlar
Iqtiboslar va manbalar
5 ta iqtibos0 ta foydalanilgan manba