Search for identical regions in images using invariant moments

One of the ways to describe objects on images is to identify some of their characteristic points or points of attention. Areas of neighborhoods of attention points are described by descriptors (lots of signs) in such way that they can be identified and compared. These signs are used to search for identical points in other images. The article investigates and establishes the possibility of searching for arbitrary local image regions by descriptors constructed with using invariant moments. A feature of the proposed method is that the calculation of the invariant moments of local areas is carried out with using the integral representation of the geometric moments of the image. Integral representation is a matrix with the same size as the image. The elements of the matrix is the sums of the geometric moments of individual pixels, which are located above and to the left with respect to the coordinates of this element. The number of matrices depends on the order of the geometric moments. For moments up to the second order (inclusively), there will be six such matrices. Calculation of one of six geometric moments of an arbitrary rectangular area of the image comes down up to 3 operations such as summation or subtraction of elements of the corresponding matrix located in the corners of this area. The invariant moments are calculated on base of six geometric moments. The search is performed by scanning the image coordinate grid with a window of a given size. In this case, the invariant moments and additional parameters are calculated and compared with similar parameters of the neighborhoods of the reference point of different size (taking into account the possible change in the image scale). The best option is selected according to a given condition. Almost all mass operations of the procedures for calculating the parameters of standards and searching of identical points make it possible explicitly perform parallel computations in the SIMD mode. As a result, the integral representation of geometric moments and the possibility of using parallel computations at all stages will significantly speed up the calculations and allow you to get good indicators of the search efficiency for identical points and the speed of work

DATA STORAGE FOR PARALLEL COMPUTING IN INDIVIDUAL SOFTWARE ENVIRONMENTS WHEN SOLVING MATERIALS SCIENCE PROBLEMS

The paper discusses methods of data storage when performing parallel computations in a multicomputer high-performance computing complex in virtual software environments. Approaches to building a data storage system using software systems designed to solve problems of materials science are proposed.

OPTIMIZATION OF MESH PARTITIONING FOR PARALLEL COMPUTATIONS IN THE SIBCIOM MODEL

Numerical models develop with development of computational technique, and this development can include either creation of new models, or modification, improvement of existing ones. Modifications can concern both mathematical part, for example, change of numerical schemes, parameterization of various physical processes, and technical part, for example, adaptation of algorithms for use on other computer systems or parallelization of algorithms. The paper considers the issue of optimization of parallel computations for the ice and ocean model SibCIOM. Optimization consists in constructing a mesh partitioning for which the nodes are evenly distributed across the computational cores and the time spent on exchanges is minimal. The METIS package is used to implement such a mesh partitioning. A conceptual description of the implementation of exchange processes for such partitioning is presented.

A novel framework for synthesizing nested queries in SQL from business requirements language

Different methods and systems were proposed in the past for translating Natural Language (NL) statements in to Structured Query Language (SQL) queries. Translating statements resultingin‘nested’queries havealways been a challenge and was not effectively handled. This work proposes a framework for translating requirement statementsresulting inthe construction of nested Queries. While translating nested scenarios; often thereis a need to create sub-queriesthat execute inpipeline orin parallel or both operating together.Lambda Calculus is found to be effective in representing the intermediate expressions and helps in performing the transformations that are needed in translating specific predicates into SQL, but its inflexibility in combining parallel computations is a constraint. To represent clauses that are in parallel or arein pipeline,and to perform the required transformationson theintermediate expressions involving these,more advancedprogramming constructs are needed.This work recommends the use of advanced language constructs and adoptsfunctional programming techniques for performing the required transformation at the intermediate language level.