?
Выбор параметров алгоритма распознавания изображений на основе коллектива решающих правил и принципа максимума апостериорной вероятности
Компьютерная оптика. 2012. Т. 36. № 1. С. 117–124.
The problem of the choice of algorithms parameters in automatic image recognition is put and solved by ensemble classifiers construction using the maximum posterior probability principle. The new criterion of parameters choice is strictly synthesized for Kullback-Leibler information discrimination and modern SIFT (Scale-Invariant Feature Transform) method of object recognition. The program and results of experimental research in a problem of face recognition with widely used databases (Yale, AT&T) are presented. It is shown that the proposed criterion allows to achieve recognition accuracy equal to the algorithm with the best parameters set, and not only for Kullback-Leibler information discrimination, but also for other popular distances (Euclidean metric, Kullback information divergence).
Language:
Russian
Keywords: автоматическое распознавание изображенийколлективы решающих правилинформационное рассогласование Кульбака-Лейблерапринцип максимума апостериорной вероятностиautomatic image recognitionensemble classifiersKullback-Leibler minimum discrimination information principlemaximum posterior probability principle
Loubenets E. R., / Series arxiv.org "quant-ph". 2026. No. 2607.18050.
In many quantum applications it is important to know whether or not a Bell nonlocal two-qudit state exhibits its nonlocality under correlation scenarios with some given numbers S1,S2≥1 of generalized quantum measurements at two sites. In the present article, we find analytically a new general locality condition sufficient for a nonseparable Werner state with a ...
Added: July 21, 2026
Bolbachan V., / Series math "arxiv.org". 2024.
Chow polylogarithms are some special functions arising in explicit description of the Beilinson regulator map. The most interesting functional equation for this function reflects its vanishing on the boundary in the Bloch's cycle complex. We show that this functional equation formally follows from more simple ones, namely skew-symmetry, functoriality and multiplicativity.
To prove this, we study ...
Added: July 16, 2026
Bolbachan V., / Series math "arxiv.org". 2024.
Let K be a field of characteristic zero. We prove that its motivic cohomology in degree m−1 and weight m is rationally isomorphic to the cohomology of the polylogarithmic complex. This gives a partial extension of A. Suslin theorem describing the indecomposable K3 of a field. ...
Added: July 16, 2026
Panov V., Ryabchenko A., / Series arXiv "stat.ME". 2026. No. 2607.05048.
This paper investigates the problem of statistical inference for a mixture distribution consisting of a discrete and a continuous component, with a particular focus on the class of rational-infinitely divisible distributions. We consider non-parametric estimation of both components of the mixture as well as the quasi-L{é}vy measure, assuming that the mixture belongs to the class ...
Added: July 9, 2026
Piontkovski D., / Series arXiv "math". 2026.
A noncommutative projective variety is defined, following Artin and Zhang, by a graded coherent algebra 𝐴. The category of coherent sheaves is then the quotient qgr(𝐴) of the category of finitely presented graded modules by the subcategory of torsion modules. We consider the categorical and polynomial entropies of the Serre twist, that is, of the ...
Added: June 23, 2026
Piontkovski D., / Series arXiv "math". 2025.
If a symmetric multilinear algebra is weakly nil, then it is Engel. This result may be regarded as an infinite-dimensional analogue of the well-known Jacobian theorem, which states that if a polynomial mapping has a polynomial inverse, then its Jacobian matrix is invertible. This refines a theorem of Gerstenhaber and partially answers a question posed ...
Added: June 23, 2026
Konakov V., Kucher D., Mammen E., / Series arXiv "math". 2026. No. 2606.11142v1.
In this paper, we construct strong approximations for discrete-time Markov chains weakly converging to continuous diffusion processes, as well as for their perturbed counterparts. Under the assumption of bounded coefficients, we construct closely coupled versions of these processes on a shared probability space. In particular, for both non-degenerate and degenerate cases, we maximize the probability ...
Added: June 11, 2026
Shipilov F., Barnyakov A., Ivanov A. et al., / Series Physics "arxiv.org". 2026.
A fast simulation of the detector response is a vital task in high-energy physics (HEP). Traditional Monte-Carlo methods form the backbone of modern particle physics simulation software but are computationally expensive. We present a machine-learning-based approach to fast simulation of the Focusing Aerogel Ring Imaging Cherenkov (FARICH) detector response. Given a particle track and momentum, ...
Added: May 19, 2026
Гущина В. А., / Series chemrxiv-2023-vpzhz-v2 "ChemRxiv". 2023.
All-inorganic perovskite CsPbBr3 and Cs4PbBr6 nanoparticles are being intensively studied due to their unique properties and wide range of applications; however, however, the nature of their optical properties is not yet fully understood due to the difficulty of synthesis of singlephase nanoparticles. In this article we describe the features of the synthesis of single-phase particles ...
Added: May 14, 2026
Dorovskiy A., / Series arXiv "math". 2026.
In this paper the structural stability of generic families of vector fields of the PC-HC class on the two-dimensional sphere is proved. A classification of these families up to moderate equivalence in neighborhoods of their large bifurcation supports is presented, based on such invariants as the configuration and the characteristic set. The realization lemma is proved. ...
Added: May 14, 2026
Taletskii D., / Series arXiv "math". 2026.
A vertex subset of a graph is called a \textit{distance-$k$ independent set} if the distance between any two of its distinct vertices is at least $k + 1$. For all $n,k \geq 1$, we determine the minimum possible number of inclusion-wise maximal distance-$k$ independent sets among all $n$-vertex trees. It equals~$n$ if $n \leq k ...
Added: May 1, 2026
Ovcharenko M., / Series arXiv "math". 2026.
We introduce an explicit class of tempered Laurent polynomials in the sense of Villegas and Doran--Kerr in n⩽4 variables including all Landau--Ginzburg models for smooth Fano threefolds with very ample anticanonical class. We check that it contains Landau--Ginzburg models for various Fano fourfolds which are complete intersections in smooth toric varieties and Grassmannians of planes, ...
Added: April 30, 2026
Derkacheva A., Sakirkina M., Kraev G. et al., /. 2026.
Comprehensive data on natural hazards and their consequences are crucial for effective for risk assessment, adaptation planning, and emergency response. However, many countries face challenges with fragmented, inconsistent, and inaccessible data, particularly regarding local-scale events. To address this data gap in Russia, we developed an end-to-end processing pipeline that scrapes news from various online sources, ...
Added: April 28, 2026
Penskaja E., Khachaturyan L., Филологические науки. Научные доклады высшей школы 2023 № 5 С. 160–165
The article examines the current trends in workingwith digital forms of handwritten heritage on the history of Russian literature of the second half of the 19 — mid-20 century. The process of forming virtual archives is analyzed as a gradual accumulation of the “big date” of scientific research — an unrecognized information array of raster ...
Added: October 30, 2023
Savchenko A., Miasnikov E., , in: Advances in Intelligent Data Analysis XVIII (IDA 2020)Vol. 12080.: Cham: Springer, 2020. Ch. 33 P. 418–430.
In this paper, we consider the problem of event recognition on single images. In contrast to conventional fine-tuning of convolutional neural networks (CNN), we proposed to use image captioning, i.e., a generative model that converts images to textual descriptions. The motivation here is the possibility to combine conventional CNNs with a completely different approach in ...
Added: May 17, 2020
Savchenko L., Информационные технологии 2019 Т. 25 № 5 С. 313–318
We consider a problem of computer assisted language and pronunciation learning based on the deep learning methods and the information theory of speech perception. In order to improve the efficiency of testing of pronunciation quality, we propose to train a convolutional neural network using the best reference utterances from the user. The experimental results proved ...
Added: May 29, 2019
ESANN, 2018.
2018 proceedings of European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning (ESANN 2018),Bruges (Belgium), 25-27 April 2018 discusses the problems of deep learning and image processing, regression and recommendation systems, Extreme Minimal Learning Machine, Neural networks, Facial emotion recognition. ...
Added: January 21, 2019
Savchenko A., , in: International Joint Conference on Rough Sets, Springer, Cham.: Springer, 2017. P. 264–277.
In this paper it is proposed to improve performance of the automatic speech recognition by using sequential three-way decisions. At first, the largest piecewise quasi-stationary segments are detected in the speech signal. Every segment is classified using the maximum a-posteriori (MAP) method implemented with the Kullback-Leibler minimum information discrimination principle. The three-way decisions are taken ...
Added: October 26, 2018
Savchenko L., Телекоммуникации 2017 № 5 С. 42–48
The paper is devoted to the automatic assessment of phoneme pronunciation quality for computer assisted language learning systems. The novel pronunciation training algorithm is proposed. In this algorithm, at first, a student has to achieve a stable pronunciation of all sounds by using the phonetic database from ideal speaker. The second, novel, stage of our ...
Added: October 24, 2018
Zelenkov Y., Fedorova E., Chekrizov D., Expert Systems with Applications 2017 Vol. 88 P. 393–401
By present, many models of bankruptcy forecasting have been developed, but this area remains a field of research activity; little is known about the practical application of existing models. In our opinion, this is because the use of existing models is limited by the conditions in which they are developed. Another question concerns the factors ...
Added: October 30, 2017
Kharchevnikova A., Savchenko A., В кн.: Материалы XXIII международной научно-технической конференции «Информационные системы и технологии-2017».: [б.и.], 2017. С. 864–869.
Рассматривается задача построения интеллектуальных систем контекстной рекламы с автоматической настройкой на потенциальные предпочтения пользователя. Выполнен аналитический обзор современных публикаций, посвященных распознаванию пола и возраста по видеоизображению лица, в том числе на основе глубоких сверточных нейронных сетей. Проведен сравнительный анализ способов агрегации решений, полученных при распознавании каждого видеокадра. Приведены результаты экспериментального исследования их точности и быстродействия. ...
Added: October 24, 2017
Savchenko A., Belova N. S., / Series "Working papers by Cornell University". 2017.
The paper deals with the still-to-video face recognition for the small sample size problem based on computation of distances between high-dimensional deep bottleneck features. We present the novel statistical recognition method, in which the still-to-video recognition task is casted into Maximum A Posteriori estimation. In this method we maximize the joint probabilistic density of the ...
Added: August 29, 2017
Savchenko A., Автоматика и телемеханика 2016 № 3 С. 99–108
Исследуется задача распознавания составных объектов на основе вероятностной модели кусочно-однородного объекта при наличии тысяч альтернативных классов. Используя асимптотические свойства модели, разработан новый метод максимально правдоподобного перебора, который является оптимальными (в смысле выбора для проверки на каждом этапе максимально правдоподобного эталона) среди класса “жадных” алгоритмов приближенного поиска ближайшего соседа. Приведены результаты эксперимента в задаче распознавания лиц ...
Added: March 25, 2016
Karpov A. V., Качество. Инновации. Образование 2015 № 9 С. 29–33
This paper presents a method for increasing the energy efficiency of wireless camera sensor network with independent power sources - adaptive functioning of a sensor network. We describe the problem of efficient use of energy resources, deal with methods to improve energy efficiency of the camera sensor network, define factors affecting the image recognition on ...
Added: October 31, 2015