{"title":"Elaboration of New Viewing Modes in CATIA CAD for Lighting Simulation Purpose","authors":"Elissey Birukov, A. Voloboy, E. Denisov","doi":"10.51130/graphicon-2020-2-4-1","DOIUrl":"https://doi.org/10.51130/graphicon-2020-2-4-1","url":null,"abstract":"During integration of lighting simulation systems into CATIA CAD often are needed additional view modes initially absent in this CAD. This article describes adding such view modes directly in CATIA workspace window using CATIA’s native CAA RADE programming environment. Adding these new view modes can significantly simplify user’s preparation of data for lighting simulation. Here the following additional view modes are mentioned: geometry tessellation to triangular meshes (in the wireframe mode), heat map dis-play of the optical values distribution over the scene, and spherical panorama preview. In the paper the problems which may occur while trying to redraw the additional data in real time are described and possible ways of solving or by-passing them are proposed. Using the new display modes provides a possibility of tuning some scene parameters and viewing preliminary results immediately while rendering of such scenes may take several hours. Such additional functionality can significantly increase the modeling process.","PeriodicalId":344054,"journal":{"name":"Proceedings of the 30th International Conference on Computer Graphics and Machine Vision (GraphiCon 2020). Part 2","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125641354","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}
{"title":"Geoportals as Sources of Information About the Territory","authors":"G. Lobanov, Olga A. Moskalenko","doi":"10.51130/graphicon-2020-2-4-22","DOIUrl":"https://doi.org/10.51130/graphicon-2020-2-4-22","url":null,"abstract":"The object of the article are popular geoportals (Yandex Maps, Google maps, 2GIS) as terrain models. The definition of geoportals and their structure and functions are described. It is noted that due to the high rate of development of the structure and content of geoportals, their functional capabilities and properties as an information resource do not have a sufficient scientific and methodological description. The content, functionality, and semiotics of geoportals are described. Special features of transmitting positional and attribute characteristics of natural and economic objects are noted; the significance of the main methods of automatic collection of information about the territory is revealed; five systems of conventional signs used in geoportals to create an image of the territory are identified and described. Similarities and differences of geoportals with traditional spatial models-topographic plans, geographic and thematic maps and plans are considered. The role of users in shaping the content, structure, and functional capabilities of geoportals is shown. Possible directions of development of geoportals sources as sources of terrain data are discussed.","PeriodicalId":344054,"journal":{"name":"Proceedings of the 30th International Conference on Computer Graphics and Machine Vision (GraphiCon 2020). Part 2","volume":"194 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121845386","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}
{"title":"The Two-Level Semi-Synchronous Parallelization Method for the Caustic and Indirect Luminance Calculation in Realistic Rendering","authors":"A. Zhdanov, D. Zhdanov","doi":"10.51130/graphicon-2020-2-3-7","DOIUrl":"https://doi.org/10.51130/graphicon-2020-2-3-7","url":null,"abstract":"The paper considers an original approach to the semi-synchronous calculation of the luminance of caustic and indirect illumination for the group of methods based on the bidirectional stochastic ray tracing with backward pho-ton maps. The designed parallelization method uses the two-level threads hierarchy. The low level of this thread hierarchy is synchronous calculations of the part of the whole image defined by a randomly generated pixel mask which is applied to the whole image. The top level is semi-synchronous parallelization level that consists groups of the low level threads which of them calculate own part of the whole image in a way similar to asynchronous calculations. As the top level is semi-synchronous it means that when calculating the luminance of the caustic and indirect illumination, the threads of the low level have access to the data accumulated in the backward photon maps of the other parallel threads of the semi-synchronous level. A special algorithm for organizing an access to data of the upper-level threads avoids de-lays associated with data synchronization. The comparison of the developed solution with purely synchronous and asynchronous parallelization methods is presented.","PeriodicalId":344054,"journal":{"name":"Proceedings of the 30th International Conference on Computer Graphics and Machine Vision (GraphiCon 2020). Part 2","volume":"259 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115880902","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}
{"title":"Application of Heuristic Modeling in the Development of an Algorithm for Generating a Binary Tree of an Object According to a Technical Drawing","authors":"V. Tyurina, M. Lagunova, M. Smychek","doi":"10.51130/graphicon-2020-2-4-32","DOIUrl":"https://doi.org/10.51130/graphicon-2020-2-4-32","url":null,"abstract":"This article presents the problem of developing an algorithm for automated reading of a drawing of an object, consisting of three types with the necessary cuts. According to the drawing, a partition of the object into nonderivative figures should be obtained and boolean operations should be identified, with the help of which the final composite figure will be constructed from non-derivative figures. Thus, in the process of solving this problem, a socalled binary tree of the modeled composite figure will be generated. Moreover, it is necessary to take into account the multiplicativity of the solution to this problem and the possibility of choosing optimal solutions. This paper poses a specific problem, in which non-derivative figures can be got using four formbuilding operations available in the arsenal of tools for getting three-dimensional elements in the Compass 3D geometric modeling system, namely, such operations as \"extrusion\", \"rotation\", \"along the trajectory\" and \"cross-sections\".","PeriodicalId":344054,"journal":{"name":"Proceedings of the 30th International Conference on Computer Graphics and Machine Vision (GraphiCon 2020). Part 2","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123300223","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}
{"title":"Plane Tangent to Quasi-Rotation Surface","authors":"I. Beglov, K. Panchuk","doi":"10.51130/graphicon-2020-2-3-59","DOIUrl":"https://doi.org/10.51130/graphicon-2020-2-3-59","url":null,"abstract":"The analysis of a surface generated by quasi-rotation of a straight line around a circle is provided in the present paper. The considered case features a straight generatrix belonging to the plane of a circular axis of quasi-rotation and intersecting it in two points. A geometric method of determination of a point belonging to a surface given its projection on the axis plane is demonstrated. Geometric construction of the curves of intersection between the considered surface and a conic surface is presented. A method of determination of points belonging to the considered surface as points belonging to the curve of intersection of two conic surfaces is acquired. Step-by-step constructions illustrating the solution of the problem of determination of a plane tangent to the considered surface in a given point are provided. The problem is solved through the methods of descriptive geometry. Every construction is performed according to an analytic algorithm, not involving approximate methods of determination of the sought points. The construction is carried out in a CAD system through the use of tools “straight line by two points” and “circle by center and point”. The presented solution to the defined problem is connected to the solution to the problem of determination of the rays reflected from the considered surface. The results of the paper expose the geometric properties of surfaces of quasi-rotation. The provided constructions can serve as the basis for the research of optical properties of the considered surfaces.","PeriodicalId":344054,"journal":{"name":"Proceedings of the 30th International Conference on Computer Graphics and Machine Vision (GraphiCon 2020). Part 2","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125141007","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}
{"title":"Pairwise Ranking Distillation for Deep Face Recognition","authors":"Mikhail Nikitin, V. Konushin, A. Konushin","doi":"10.51130/graphicon-2020-2-3-30","DOIUrl":"https://doi.org/10.51130/graphicon-2020-2-3-30","url":null,"abstract":"This work addresses the problem of knowledge distillation for deep face recognition task. Knowledge distillation technique is known to be an effective way of model compression, which implies transferring of the knowledge from high-capacity teacher to a lightweight student. The knowledge and the way how it is distilled can be defined in different ways depending on the problem where the technique is applied. Considering the fact that face recognition is a typical metric learning task, we propose to perform knowledge distillation on a score-level. Specifically, for any pair of matching scores computed by teacher, our method forces student to have the same order for the corresponding matching scores. We evaluate proposed pairwise ranking distillation (PWR) approach using several face recognition benchmarks for both face verification and face identification scenarios. Experimental results show that PWR not only can improve over the baseline method by a large margin, but also outperforms other score-level distillation approaches.","PeriodicalId":344054,"journal":{"name":"Proceedings of the 30th International Conference on Computer Graphics and Machine Vision (GraphiCon 2020). Part 2","volume":"178 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125182825","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}
{"title":"Pen Trace Reconstruction with Skeleton Representation of a Handwritten Text Image","authors":"Svetlana Kryzhanovskaya, S. Arseev, L. Mestetskiy","doi":"10.51130/graphicon-2020-2-3-27","DOIUrl":"https://doi.org/10.51130/graphicon-2020-2-3-27","url":null,"abstract":"This paper presents a new approach for the pen trace reconstruction task in handwritten text images. The proposed approach is based on the skeleton representation of a binary image which provides sufficient information about the pen movement trajectory during the writing. As such, the initial problem can be viewed as a problem of constructing a specific walk in the skeleton graph covering all its edges. The proposed approach consists of splitting the graph into structural elements and estimating the pen movement direction in each of them with the resulting trace being composed of the traces of these elements.","PeriodicalId":344054,"journal":{"name":"Proceedings of the 30th International Conference on Computer Graphics and Machine Vision (GraphiCon 2020). Part 2","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121611268","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}
{"title":"Methods for Construction and Research Stereometric Visual Images of Multi-criteria Alternatives","authors":"A. Zakharova, D. Korostelyov","doi":"10.51130/graphicon-2020-2-3-23","DOIUrl":"https://doi.org/10.51130/graphicon-2020-2-3-23","url":null,"abstract":"The article discusses methods for constructing and research stereometric visual images of multi-criteria alternatives. The difficulty of applying traditional decision-making methods when choosing the best alternative in the case of decision-making tasks with a large dimension is noted. Methods are proposed for reducing the dimension of a decision-making problem by constructing stereometric visual images that describe choice set and criteria set. The tasks of visual analytics are highlighted in the course of reducing the dimension of the decisionmaking task: grouping and ranking criteria, pairwise comparison and filtering of alternatives. A description of the methods for constructing stereometric visual images of multi-criteria alternatives based on histograms of alternatives and criteria is given. Also describes a method for constructing surface of the criteria's correlation. Using the developed method of alternatives visualization as a single image enables their visual filtering. The application method of the criteria visualization as a single image in combination with the construction and analysis of surface of the criteria's correlation allows for the grouping and ranking of criteria. The experiment is described on the application of the proposed methods for constructing and studying stereometric visual images of multi-criteria alternatives using the example of the problem of choosing the best OpenFoam solver, with the help of which estimates of the accuracy of calculating the inviscid flow around the cone were obtained. It is shown how, due to the above visualization methods, it is possible to reduce the count of criteria by several times.","PeriodicalId":344054,"journal":{"name":"Proceedings of the 30th International Conference on Computer Graphics and Machine Vision (GraphiCon 2020). Part 2","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122378899","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}
{"title":"Spatial Spline Construction through the Monge Model","authors":"K. Panchuk, T. Myasoedova, Yu A. Rogoza","doi":"10.51130/graphicon-2020-2-3-60","DOIUrl":"https://doi.org/10.51130/graphicon-2020-2-3-60","url":null,"abstract":"The solution to the problem of spatial spline construction by its orthogonal projections on the Monge model is considered in the present paper. Constructively, spatial interpolation of a discrete set of points given on projection planes pi1 and pi2 is performed through planar interpolation of its projections. The initial boundary conditions for spatial spline construction are given in the form of initial derivative vector projections in the initial and the terminal points of the discrete set. The possibility of the solution to the problem of spatial spline construction by planar projections, i.e. reduction of a spatial solution to a planar one, is determined by the projectional properties of the Monge model. An algorithm of construction of a spatial polynomial segment by projectionally defined initial conditions – projections of two points and projections of the initial derivatives in these points – is considered. A solution to a more complex problem – formation of a spatial spline consisting of a number of segments connected under a certain order of smoothness – is proposed on the basis of this algorithm. The validity of the proposed projectional algorithm of spline formation is confirmed on numerical example. The algorithm can be applied in solution to a more general and relevant problem of synthesis of 3D geometric models by their projectional 2D images that is currently lacking complete solution.","PeriodicalId":344054,"journal":{"name":"Proceedings of the 30th International Conference on Computer Graphics and Machine Vision (GraphiCon 2020). Part 2","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127446607","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}
{"title":"The Backward Photon Mapping for the Realistic Image Rendering","authors":"D. Zhdanov, A. Zhdanov","doi":"10.51130/graphicon-2020-2-3-8","DOIUrl":"https://doi.org/10.51130/graphicon-2020-2-3-8","url":null,"abstract":"The current paper is devoted to the methods of the realistic rendering methods based on the bidirectional stochastic ray tracing with photon maps. The research of the backward photon mapping method to account for both caustics and indirect illumination is presented. By using the backward photon maps authors reduced the amount of data that should be stored in the photon maps that allowed to speed up the process of the indirect luminance calculation. Methods used for constructing a tree of backward photon maps and methods of efficient parallelization used in algorithms of accumulation and forming the backward photon maps along with tracing forward and back-ward rays in the rendering process are considered. Methods to estimate the attained luminance error both for single image pixels and for the entire image with the designed rendering method are presented. The rendering results obtained with the use of the developed methods and algorithms are presented.","PeriodicalId":344054,"journal":{"name":"Proceedings of the 30th International Conference on Computer Graphics and Machine Vision (GraphiCon 2020). Part 2","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129085247","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}