1 January 2018 in Computer Optics
SUSamara National Research University
Samara National Research University
IRIpsi Ras – Branch Of The Fsrc “Crystallography And Photonics” Ras
Ipsi Ras – Branch Of The Fsrc “Crystallography And Photonics” Ras
Diabetic retinopathy is one of the most frequent complications of diabetes, which leads to severe consequences, including rapid and irreversible vision loss. The laser coagulation procedure to treat diabetic retinopathy consists in applying a series of microburns to the fundus to deal with macular edema. The existing hardware/software packages are primarily based on the use of a predetermined pattern for coagulate arrangement. However, due to the complex form of edema and vascular system, this approach leads to an uneven arrangement. To solve the problem, we propose a new approach based on the application of sphere packing algorithms (circle packing in two-dimensional images) in the specified area of interest. Since one of the main requirements for the laser coagulation procedure is that it should have the minimum duration, a problem of the computational complexity of the developed algorithms arises. This requirement is completely ignored by the existing approaches, therefore the development of new high-performance coagulate arrangement algorithms is highly relevant. In the paper, we propose seven new algorithms for coagulate arrangement and provide a detailed analysis of key characteristics of the algorithms. The characteristics considered have made it possible to extract information relating to the algorithm properties. Regularity is determined by the median, asymmetry and the kurtosis; determinism is determined by the variance and the mean.
1 January 2018 in Computer Optics
SUSamara National Research University
Samara National Research University
IRIpsi Ras – Branch Of The Fsrc “Crystallography And Photonics” Ras
Ipsi Ras – Branch Of The Fsrc “Crystallography And Photonics” Ras
The article deals with one of the key problems of the social network analysis – the problem of classifying accounts based on media content uploaded by users. The main difficulties are the content heterogeneity (both in format and subject) and the large volumes of data, which leads to excessive computational complexity of its processing and often to the complete inefficiency of traditional analysis methods. In the article, we discuss an approach to the clustering of media content from social networks based on textual annotation using BigData technology – a modern and efficient tool that allows to solve the problem of large data volume processing. To carry out computational experiments, a large sample of heterogeneous images (photographs, paintings, postcards, etc.) was collected from real Twitter accounts. The results confirmed the high quality of media content clustering, the average error was around 5 %.
1 July 2015 in Pattern Recognition and Image Analysis
The problem of crystal lattice identification is considered. Two matching methods were developed to solve this problem: the method based on estimation of the main Bravais cell parameters and the method based on estimation of the Wigner-Seitz cell volume. Both methods include the normalized similarity measures: edge similarity measure and angle similarity measure for Bravais cells and volume similarity measure for Wigner-Seitz cells. The experiments for crystal lattice identification were carried out using these methods and the analysis of derived results is given. The results demonstrate that the best way to identify lattice system type is simultaneous application of all introduced similarity measures.
1 April 2019 in Computer Optics
IRIpsi Ras – Branch Of The Fsrc “Crystallography And Photonics” Ras
Ipsi Ras – Branch Of The Fsrc “Crystallography And Photonics” Ras
SUSamara National Research University
Samara National Research University
The article deals with a problem of three-dimensional crystal lattice reconstruction, which is an important stage in the X-ray structural analysis. The accuracy of parametric and structural identification of crystals directly depends on the quality of crystal lattice reconstruction. The proposed algorithm of reconstruction of a three-dimensional crystal lattice is based on minimizing the distances from each node to a line projected onto a specified plane. Three sets of two-dimensional node coordinates, obtained from three two-dimensional projections, are used as input data. We performed an analytical calculation of the reconstruction error, allowing the total reconstruction accuracy to be estimated. The results of computational experiments confirmed the high quality of the proposed reconstruction algorithms and its stability against the distortion of node coordinates. In addition, we revealed a problem of lattice system separability, with the identification accuracy for monoclinic, rhombic and tetragonal systems found to be 34%, 53% and 10%, respectively.