Cybernetics and programming
Journal Menu
> Issues > Rubrics > About journal > Authors > About the Journal > Requirements for publication > Council of Editors > List of peer reviewers > Review procedure > Policy of publication. Aims & Scope. > Article retraction > Ethics > Legal information
Journals in science databases
About the Journal

MAIN PAGE > Journal "Cybernetics and programming" > Contents of Issue № 03/2018
This issue is currently being formed. All articles presented on this page have already been included in this issue, are considered published, and will remain unchanged in the final version of the issue along with other metadata of the articles.
Учредитель: Даниленко Василий Иванович, w.danilenko@nbpublish.com
Главный редактор: Сидоркина Ирина Геннадьевна, доктор технических наук, igs592000@mail.ru
Contents of Issue № 03/2018
Question at hand
Tymchuk A.I. - On the choice of gray levels in the problem of texture segmentation of images based on the luminance dependence matrices pp. 1-9


Abstract: The object of research is the method of textural image segmentation based on the construction and use of luminance dependence matrices. The subject of the study is the influence of the number of reference gray levels used for computations on the speed and quality of image segmentation. Particular attention is paid to the process of constructing brightness dependency matrices, as well as texture attributes, which are calculated on their basis. In the article the author conclude that the choice of the size of the brightness dependence matrix (the number of gray levels) is certainly an important aspect in solving the image segmentation problem, since it directly affects the segmentation quality and program speed. The research methodology is based on the analysis of the method of textural image segmentation based on luminance dependence matrices, testing the segmentation algorithm based on this approach for various input parameters and analysis of results. The main conclusion of the study is the conclusion about the selection of the best number of gray levels in solving the segmentation problem in terms of productivity and segmentation quality. This conclusion is made on the basis of analysis of the results of the program, which implements the algorithm of image segmentation. The analysis was carried out with respect to the time spent on constructing the matrices and calculating the texture attributes, and also with respect to the value of each texture feature separately. The novelty of the study is to determine the number of reference levels relative to the speed and quality of segmentation.
Automated systems of engineering process administration
Demichev M.S., Gaipov K.E., Korolev E.M., Demicheva A.A., Narozhnyi A.I. - Formation of the required number of spanning trees pp. 10-24


Abstract: The subject of the study is to obtain spanning trees for propagating traffic over broadcast channels using the known network topology and known routes. To solve this problem, a mathematical model is constructed in which the network topology is regarded as an undirected graph, but the described solution is also suitable for an oriented graph, where a separate direction is represented by a separate edge. The proposed solution does not require flexible scalability of the network, therefore, when changing the initial input parameters, it is necessary to repeatedly execute the sequence of algorithms described in the article. The development of the algorithm was carried out by an experimental-theoretical method using the mathematical model of a graph constructed from the known topology of the network and the compilation of spanning trees on its basis. The result of the presented work is in determining the necessary number of spanning trees for the optimal solution of the network routing problem. The novelty of this research is the possibility of applying the developed solution in the link-layer networks according to the OSI reference model, exclusively for broadcasting traffic of a given network topology.
Other our sites:
Official Website of NOTA BENE / Aurora Group s.r.o.
"History Illustrated" Website