Valery Starovoitov

Valery Starovoitov

Auto-generated profile, based on publicly available information

Valery Starovoitov

The United Institute of Informatics Problems of the National Academy of Sciences of Belarus

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 March 2021 in IEEE Access
Verified
Journal Article
Open access
DCDavide Chicco
Davide Chicco
VSValery Starovoitov
Valery Starovoitov
Giuseppe JurmanGiuseppe Jurman
Giuseppe Jurman
To assess the quality of a binary classification, researchers often take advantage of a four-entry contingency table called confusion matrix , containing true positives, true negatives, false positives, and false negatives. To recap the four values of a confusion matrix in a unique score, researchers and statisticians have developed several rates and metrics. In the past, several scientific studies already showed why the Matthews correlation coefficient (MCC) is more informative and trustworthy than confusion-entropy error, accuracy, F 1 score, bookmaker informedness, markedness, and balanced accuracy. In this study, we compare the MCC with the diagnostic odds ratio (DOR), a statistical rate employed sometimes in biomedical sciences. After examining the properties of the MCC and of the DOR, we describe the relationships between them, by also taking advantage of an innovative geometrical plot called confusion tetrahedron , presented here for the first time. We then report some use cases where the MCC and the DOR produce discordant outcomes, and explain why the Matthews correlation coefficient is more informative and reliable between the two. Our results can have a strong impact in computer science and statistics, because they clearly explain why the trustworthiness of the information provided by the Matthews correlation coefficient is higher than the one generated by the diagnostic odds ratio.

21 July 2021 in International Journal of Optics
Verified
Journal Article
Open access
PDF file
TNTahira Nazir
Tahira Nazir
AIAun Irtaza
Aun Irtaza
VSValery Starovoitov
Valery Starovoitov
Glaucoma is a fatal eye disease that harms the optic disc (OD) and optic cup (OC) and results into blindness in progressed phases. Because of slow progress, the disease exhibits a small number of symptoms in the initial stages, therefore causing the disease identification to be a complicated task. So, a fully automatic framework is mandatory, which can support the screening process and increase the chances of disease detection in the early stages. In this paper, we deal with the localization and segmentation of the OD and OC for glaucoma detection from blur retinal images. We have presented a novel method that is Densenet-77-based Mask-RCNN to overcome the challenges of the glaucoma detection. Initially, we have performed the data augmentation step together with adding blurriness in samples to increase the diversity of data. Then, we have generated the annotations from ground-truth (GT) images. After that, the Densenet-77 framework is employed at the feature extraction level of Mask-RCNN to compute the deep key points. Finally, the calculated features are used to localize and segment the OD and OC by the custom Mask-RCNN model. For performance evaluation, we have used the ORIGA dataset that is publicly available. Furthermore, we have performed cross-dataset validation on the HRF database to show the robustness of the presented framework. The presented framework has achieved an average precision, recall, F-measure, and IOU as 0.965, 0.963, 0.97, and 0.972, respectively. The proposed method achieved remarkable performance in terms of both efficiency and effectiveness as compared to the latest techniques under the presence of blurring, noise, and light variations.

1 June 2022 in Pattern Recognition and Image Analysis
Verified
Journal Article
Closed access
PDF file
VSV. V. Starovoitov
V. V. Starovoitov
YGYu. I. Golub
Yu. I. Golub
MLM. M. Lukashevich
M. M. Lukashevich
Diabetic retinopathy (DR) frequently appears in diabetic patients. It is initially asymptomatic, but can progress to blindness. Screening studies for its diagnosis are performed in many countries by means of photographing the eye retina with special fundus-cameras. These studies are aimed at revealing the presence of microaneurysms (MAs) on the retina, which are the primary signs of DR. The wide variety of cameras, peculiarities of retina illumination, FOV angles, and sizes of digital images has complicated the development of a reliable and universal approach to analyzing retina images by machine-learning methods. In this paper, we consider the problem of choosing the size and shape of a unified template for representing the data of an arbitrary retinal image for subsequent automated DR screening. It is experimentally proved that it is possible to extract a square inscribed in the FOV region from each retinal image and compress it to the size of 512 × 512 pixels. This is the minimum allowable size of the template. It preserves the required number of MAs for DR screening by machine-learning methods.

22 August 2022 in Informatics
Verified
Journal Article
Open access
PDF file
VSV. V. Starovoitov
V. V. Starovoitov
UAU. Yu. Akhundjanov
U. Yu. Akhundjanov
УАУ. Ю. Ахунджанов
У. Ю. Ахунджанов
Objectives. The problem of describing the invariant features of a digital image of handwritten signature that describes the distribution of its local features is considered. The formation of fundamentally new approach to the calculation of such features is described.Methods. Digital image processing methods are used. First an image is converted into a binary representation, then its morphological and median filtering is performed. Then using the method of principal components, the image is rotated to give the signature a horizontal orientation. A rectangle describing the signature is cut out, then it is scaled to the template of a certain size. In the article the template of 300×150 pixels was used. Then the border of the signature is formed. Local binary patterns are calculated from its binary contour, i.e. each pixel is assigned a number from 0 to 255, which describes the location of the edge pixels in 3×3 neighborhood of each pixel. A histogram of calculated patterns for 256 intervals is formed. The first and last intervals are discarded because they correspond to all black and white pixels in the neighborhood and are not informative. The remaining 254 numbers of the array form new local features of the signature.Results. The studies were performed on the bases of digitized signatures TUIT and CEDAR containing true and fake signatures of 80 persons. The accuracy of correct verification of signatures on these bases was about 78 % and 70 %.Conclusion. The possibility of using the proposed possibilities for solving the problems of verifying the authenticity of handwritten signatures has been experimentally confirmed.

1 June 2024 in Pattern Recognition and Image Analysis
Verified
Journal Article
Closed access
PDF file
VSV. V. Starovoitov
V. V. Starovoitov
UAU. Yu. Akhundjanov
U. Yu. Akhundjanov
A new solution to the problem of offline signature verification is presented. Digital images of signatures are processed and converted into a binary representation of a certain size. Then their contours are traced, and from them, two original features are calculated for describing the local structural features of the signature in the form of vectors of normalized frequency distributions of local binary pattern codes and values of local curvature of the signature contours. A new feature space is formed in which the pattern describes the proximity of pairs of signatures, and its coordinates are the rank correlation coefficients between the feature vectors of these signatures. In real practice, the expert has M (from 5 to 15) genuine signatures of a person; there are no forged signatures at all. On these M available genuine signatures of a single person, we train a one-class support vector machine model and obtain a single-writer-dependent classifier. A verifiable signature is considered forged if the classifier model considers it to be an outlier. The accuracy of our approach in verifying the genuineness of all 2640 signatures from the CEDAR database was 99.77%. All forged signatures in this database were correctly recognized.

1 July 2020 in Pattern Recognition and Image Analysis
Verified
Journal Article
Closed access
PDF file
VSV. V. Starovoitov
V. V. Starovoitov
YGYu. I. Golub
Yu. I. Golub
In this paper, we propose a new function for estimating the quality of classification into N classes. This function is invariant to the imbalance of classes to be processed. It is constructed by computing the sine of an angle formed by the errors of each class in an N-dimensional space. A geometrical substantiation of its construction is provided and its properties are investigated. It is shown that this function is an improved version of the balanced accuracy function. In contrast to other functions, the proposed function considers class distribution of errors. Examples of analyzing the confusion matrices in the classification of synthetic and real-world data are provided.