Pub Date : 2019-01-01DOI: 10.18287/1613-0073-2019-2391-211-215
A. Pyataev, A. Redkin, A. Pyataeva
Tree state category identification allows forecasting forest development in the surveyed area. Tree state category determination process based on global features is subjective and uses concepts such as the degree of density of the crown, the degree of drying of branches, the fall of the bark, the color of the needles, etc. For global features estimation, fuzzy logic is used. To formalize these subjective concepts, linguistic variables and their terms were extracted. The characteristic functions describing the terms were piecewise linear and in this work were approximated by Gaussian functions. Such an approach in conjunction with image processing algorithms that allows to search objects on images or correct images obtained for example from unmanned aerial vehicles could be the basis of a system for automatically determining the forest plantations health state and improve the inspection quality. The study was conducted for coniferous species of the boreal zone. The mathematical model built in this work allows reducing the cost of automation of calculations related to the processing of the data obtained by forest pathological surveys, despite the fact that the accuracy value of fuzzy classification after the approximation of the membership functions remained at the same level.
{"title":"Tree state category identification for boreal area conifers using global features estimation by fuzzy logic approach","authors":"A. Pyataev, A. Redkin, A. Pyataeva","doi":"10.18287/1613-0073-2019-2391-211-215","DOIUrl":"https://doi.org/10.18287/1613-0073-2019-2391-211-215","url":null,"abstract":"Tree state category identification allows forecasting forest development in the surveyed area. Tree state category determination process based on global features is subjective and uses concepts such as the degree of density of the crown, the degree of drying of branches, the fall of the bark, the color of the needles, etc. For global features estimation, fuzzy logic is used. To formalize these subjective concepts, linguistic variables and their terms were extracted. The characteristic functions describing the terms were piecewise linear and in this work were approximated by Gaussian functions. Such an approach in conjunction with image processing algorithms that allows to search objects on images or correct images obtained for example from unmanned aerial vehicles could be the basis of a system for automatically determining the forest plantations health state and improve the inspection quality. The study was conducted for coniferous species of the boreal zone. The mathematical model built in this work allows reducing the cost of automation of calculations related to the processing of the data obtained by forest pathological surveys, despite the fact that the accuracy value of fuzzy classification after the approximation of the membership functions remained at the same level.","PeriodicalId":10486,"journal":{"name":"Collection of selected papers of the III International Conference on Information Technology and Nanotechnology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81987328","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-01DOI: 10.18287/1613-0073-2019-2391-206-210
D. Andrianov, S. Eremeev, Y. Kovalev
The article describes the algorithm for creating three-dimensional Barcodes to represent nD features. The algorithm is based on computer topology methods using the 3D sweep hull algorithm for computing convex hulls and Delaunay triangulation. The result of the algorithm are 3D Barcodes of features. 3D Barcode graphs were built that reflect their time differences. The algorithm for constructing 3D Barcodes will allow analyzing spatial nD objects at different time intervals.
{"title":"Algorithm for constructing three-dimensional Barcodes to represent nD spatial objects in GIS","authors":"D. Andrianov, S. Eremeev, Y. Kovalev","doi":"10.18287/1613-0073-2019-2391-206-210","DOIUrl":"https://doi.org/10.18287/1613-0073-2019-2391-206-210","url":null,"abstract":"The article describes the algorithm for creating three-dimensional Barcodes to represent nD features. The algorithm is based on computer topology methods using the 3D sweep hull algorithm for computing convex hulls and Delaunay triangulation. The result of the algorithm are 3D Barcodes of features. 3D Barcode graphs were built that reflect their time differences. The algorithm for constructing 3D Barcodes will allow analyzing spatial nD objects at different time intervals.","PeriodicalId":10486,"journal":{"name":"Collection of selected papers of the III International Conference on Information Technology and Nanotechnology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89190647","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-01DOI: 10.18287/1613-0073-2019-2416-549-552
D. Zherdev, V. Prokudin
In the work there is a modernization of the parallel algorithm for the radar images formation of 3D models with the synthesis of the antenna aperture. In the formation of the scene description, the various structures are used in which it is possible to use more efficient and derived calculations. In addition, it is the topical task to recognize objects on radar images. Thus, on the basis of the implemented parallel program for modelling, the high performance required for simulating multiple radar images can be achieved.
{"title":"High performance radar images modelling and recognition of real objects","authors":"D. Zherdev, V. Prokudin","doi":"10.18287/1613-0073-2019-2416-549-552","DOIUrl":"https://doi.org/10.18287/1613-0073-2019-2416-549-552","url":null,"abstract":"In the work there is a modernization of the parallel algorithm for the radar images formation of 3D models with the synthesis of the antenna aperture. In the formation of the scene description, the various structures are used in which it is possible to use more efficient and derived calculations. In addition, it is the topical task to recognize objects on radar images. Thus, on the basis of the implemented parallel program for modelling, the high performance required for simulating multiple radar images can be achieved.","PeriodicalId":10486,"journal":{"name":"Collection of selected papers of the III International Conference on Information Technology and Nanotechnology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73221106","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-01DOI: 10.18287/1613-0073-2019-2416-227-232
X. Pogorelskih, L. V. Loganova
In this paper, we research and compare different implementations of cyclic reduction and sweep algorithms on a graphics processing unit (GPU) using different types of device memory. As a result of the work, it was found that the algorithm of the run should be used to solve the set of the tridiagonal linear system. However, the best results are shown by a parallel version of the cyclic reduction algorithm with partial use of shared memory, when solving a single linear system on the GPU.
{"title":"Research of parallel algorithms for solving three-diagonal systems of linear algebraic equations on a graphical computing device using various types of memory","authors":"X. Pogorelskih, L. V. Loganova","doi":"10.18287/1613-0073-2019-2416-227-232","DOIUrl":"https://doi.org/10.18287/1613-0073-2019-2416-227-232","url":null,"abstract":"In this paper, we research and compare different implementations of cyclic reduction and sweep algorithms on a graphics processing unit (GPU) using different types of device memory. As a result of the work, it was found that the algorithm of the run should be used to solve the set of the tridiagonal linear system. However, the best results are shown by a parallel version of the cyclic reduction algorithm with partial use of shared memory, when solving a single linear system on the GPU.","PeriodicalId":10486,"journal":{"name":"Collection of selected papers of the III International Conference on Information Technology and Nanotechnology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79116335","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-01DOI: 10.18287/1613-0073-2019-2391-169-174
A. Ruchay, Konstantin Dorofeev, V. Kalschikov
In this paper, we first analyze the accuracy of 3D object reconstruction using point cloud filtering applied on data from a RGB-D sensor. Point cloud filtering algorithms carry out upsampling for defective point cloud. Various methods of point cloud filtering are tested and compared with respect to the reconstruction accuracy using real data. In order to improve the accuracy of 3D object reconstruction, an efficient method of point cloud filtering is designed. The presented results show an improvement in the accuracy of 3D object reconstruction using the proposed point cloud filtering algorithm.
{"title":"Accuracy analysis of 3D object reconstruction using point cloud filtering algorithms","authors":"A. Ruchay, Konstantin Dorofeev, V. Kalschikov","doi":"10.18287/1613-0073-2019-2391-169-174","DOIUrl":"https://doi.org/10.18287/1613-0073-2019-2391-169-174","url":null,"abstract":"In this paper, we first analyze the accuracy of 3D object reconstruction using point cloud filtering applied on data from a RGB-D sensor. Point cloud filtering algorithms carry out upsampling for defective point cloud. Various methods of point cloud filtering are tested and compared with respect to the reconstruction accuracy using real data. In order to improve the accuracy of 3D object reconstruction, an efficient method of point cloud filtering is designed. The presented results show an improvement in the accuracy of 3D object reconstruction using the proposed point cloud filtering algorithm.","PeriodicalId":10486,"journal":{"name":"Collection of selected papers of the III International Conference on Information Technology and Nanotechnology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79123207","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-01DOI: 10.18287/1613-0073-2019-2391-264-268
E. A. Dmitriev, A. Borodinov, A. Maksimov, S. Rychazhkov
This article presents binary segmentation algorithms for buildings automatic detection on aerial images. There were conducted experiments among deep neural networks to find the most effective model in sense of segmentation accuracy and training time. All experiments were conducted on Moscow region images that were got from open database. As the result the optimal model was found for buildings automatic detection.
{"title":"Automatic detection of constructions using binary image segmentation algorithms","authors":"E. A. Dmitriev, A. Borodinov, A. Maksimov, S. Rychazhkov","doi":"10.18287/1613-0073-2019-2391-264-268","DOIUrl":"https://doi.org/10.18287/1613-0073-2019-2391-264-268","url":null,"abstract":"This article presents binary segmentation algorithms for buildings automatic detection on aerial images. There were conducted experiments among deep neural networks to find the most effective model in sense of segmentation accuracy and training time. All experiments were conducted on Moscow region images that were got from open database. As the result the optimal model was found for buildings automatic detection.","PeriodicalId":10486,"journal":{"name":"Collection of selected papers of the III International Conference on Information Technology and Nanotechnology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79364903","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-01DOI: 10.18287/1613-0073-2019-2416-376-386
I. Khaimovich, V. M. Ramzaev, V. G. Chumak
The developed methodology provides a solution to two essential tasks, thereby revealing the gnoseological potential of Big Data technology: social forecasting in the three most significant areas of the information society based on a model which identifies conditions for social resonance; successful implementation of the social dampening procedure based on the use of appropriate management options using multimodal clusterization of social networks based on Big Data technology. The article suggests the tool that helps to increase work efficiency in the sphere of social dampening in the region. The proposed method of regulation may be efficient when it comes to the control of the regional social dampening processes which have variety of forms and broad range of elements and factors, as well as growth dynamics and active transformation of life activities. At the same time using modern products make it possible to evaluate and show changes on a real-time basis which can be useful for local government authorities.
{"title":"Multimodel clustering of social networks in social dampening applying BIG DATA (acquiring knowledge from data)","authors":"I. Khaimovich, V. M. Ramzaev, V. G. Chumak","doi":"10.18287/1613-0073-2019-2416-376-386","DOIUrl":"https://doi.org/10.18287/1613-0073-2019-2416-376-386","url":null,"abstract":"The developed methodology provides a solution to two essential tasks, thereby revealing the gnoseological potential of Big Data technology: social forecasting in the three most significant areas of the information society based on a model which identifies conditions for social resonance; successful implementation of the social dampening procedure based on the use of appropriate management options using multimodal clusterization of social networks based on Big Data technology. The article suggests the tool that helps to increase work efficiency in the sphere of social dampening in the region. The proposed method of regulation may be efficient when it comes to the control of the regional social dampening processes which have variety of forms and broad range of elements and factors, as well as growth dynamics and active transformation of life activities. At the same time using modern products make it possible to evaluate and show changes on a real-time basis which can be useful for local government authorities.","PeriodicalId":10486,"journal":{"name":"Collection of selected papers of the III International Conference on Information Technology and Nanotechnology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75972411","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-01DOI: 10.18287/1613-0073-2019-2416-26-33
V. Fursov, Y. Goshin, K. Pugachev
This paper presents an adaptive algorithm of conforming image matching based on the principle of conformity. The algorithm consists of several main stages. At the first stage, we find the corresponding points using a minimum value of conformity as the measure of points’ similarity. We define a conformity function as the sum of all possible combinations of squared differences of pixel intensity values on the fragments that are matched. Then, we perform an adaptive procedure of errors correction considering an intensity gradient distribution. An important feature of the algorithm is the finding of error points using a criterion of maximum value of samples’ conformity for every fragment of the disparity map. The results of experiments on the "Teddy" test images are shown.
{"title":"Adaptive algorithm of conforming image matching","authors":"V. Fursov, Y. Goshin, K. Pugachev","doi":"10.18287/1613-0073-2019-2416-26-33","DOIUrl":"https://doi.org/10.18287/1613-0073-2019-2416-26-33","url":null,"abstract":"This paper presents an adaptive algorithm of conforming image matching based on the principle of conformity. The algorithm consists of several main stages. At the first stage, we find the corresponding points using a minimum value of conformity as the measure of points’ similarity. We define a conformity function as the sum of all possible combinations of squared differences of pixel intensity values on the fragments that are matched. Then, we perform an adaptive procedure of errors correction considering an intensity gradient distribution. An important feature of the algorithm is the finding of error points using a criterion of maximum value of samples’ conformity for every fragment of the disparity map. The results of experiments on the \"Teddy\" test images are shown.","PeriodicalId":10486,"journal":{"name":"Collection of selected papers of the III International Conference on Information Technology and Nanotechnology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77431672","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-01DOI: 10.18287/1613-0073-2019-2416-134-140
S. R. Bryatov, A. Borodinov
Pharmaceutical companies that manufacture, ship and supply products face difficulties in tracking their products, allowing counterfeiters to inject counterfeit drugs into the system. This situation is observed, in particular, in the Russian market of turnover of pharmaceutical products, although the problem has long been global. The ability of blockchain systems to pinpoint the origin of data makes them particularly suitable for pharmaceutical supply chain applications. The data stored in the blockchain distributed register on the identification of drugs produced by the plant, as well as records of their movements throughout the supply chain, can accurately determine the authenticity of pharmaceutical products lying on the shelves of pharmacies. The development and implementation of such a system can be a big step towards winning the exhausting fight against the easy availability of counterfeit drugs and medical products. In the first part of this work, the main characteristics and features of the functioning of blockchain systems will be studied. In the second and final part, the designed concept of the pharmaceutical turnover control system based on the blockchain technology Hyperledger Fabric using the Hyperledger Composer development environment will be investigated.
{"title":"Blockchain technology in the pharmaceutical supply chain: researching a business model based on Hyperledger Fabric","authors":"S. R. Bryatov, A. Borodinov","doi":"10.18287/1613-0073-2019-2416-134-140","DOIUrl":"https://doi.org/10.18287/1613-0073-2019-2416-134-140","url":null,"abstract":"Pharmaceutical companies that manufacture, ship and supply products face difficulties in tracking their products, allowing counterfeiters to inject counterfeit drugs into the system. This situation is observed, in particular, in the Russian market of turnover of pharmaceutical products, although the problem has long been global. The ability of blockchain systems to pinpoint the origin of data makes them particularly suitable for pharmaceutical supply chain applications. The data stored in the blockchain distributed register on the identification of drugs produced by the plant, as well as records of their movements throughout the supply chain, can accurately determine the authenticity of pharmaceutical products lying on the shelves of pharmacies. The development and implementation of such a system can be a big step towards winning the exhausting fight against the easy availability of counterfeit drugs and medical products. In the first part of this work, the main characteristics and features of the functioning of blockchain systems will be studied. In the second and final part, the designed concept of the pharmaceutical turnover control system based on the blockchain technology Hyperledger Fabric using the Hyperledger Composer development environment will be investigated.","PeriodicalId":10486,"journal":{"name":"Collection of selected papers of the III International Conference on Information Technology and Nanotechnology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74190414","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-01DOI: 10.18287/1613-0073-2019-2391-358-365
D. Vasin, V. Gromov, S. Rotkov
In this paper, we analyze graphic documents with a weakly formalized description of objects (WFGD) and reveal their main features that influence the choice of models, methods and algorithms for processing such documents. In the framework of the development of the combinatorial-geometric approach, a geometric model for describing WFGDs with a pronounced orientation of linear objects is proposed. We also propose a technology for vectorization of raster images of WFGDs in the presence of noise in the source data. The effectiveness of an extended class of vector models (linear and segment-node models) used for describing WFGDs with a distinctive linear orientation of objects is shown, which was revealed during practical experiments on real WFGDs.
{"title":"Geometric modeling of raster images of documents with weakly formalized description of objects","authors":"D. Vasin, V. Gromov, S. Rotkov","doi":"10.18287/1613-0073-2019-2391-358-365","DOIUrl":"https://doi.org/10.18287/1613-0073-2019-2391-358-365","url":null,"abstract":"In this paper, we analyze graphic documents with a weakly formalized description of objects (WFGD) and reveal their main features that influence the choice of models, methods and algorithms for processing such documents. In the framework of the development of the combinatorial-geometric approach, a geometric model for describing WFGDs with a pronounced orientation of linear objects is proposed. We also propose a technology for vectorization of raster images of WFGDs in the presence of noise in the source data. The effectiveness of an extended class of vector models (linear and segment-node models) used for describing WFGDs with a distinctive linear orientation of objects is shown, which was revealed during practical experiments on real WFGDs.","PeriodicalId":10486,"journal":{"name":"Collection of selected papers of the III International Conference on Information Technology and Nanotechnology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86830926","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：