Optimal surface segmentation is a state-of-the-art method used for segmentation of multiple globally optimal surfaces in volumetric datasets. The method is widely used in numerous medical image segmentation applications. However, nodes in the graph based optimal surface segmentation method typically encode uniformly distributed orthogonal voxels of the volume. Thus the segmentation cannot attai...

The Topological Graph of Frontiers is in our opinion a good graph structure representing the topology of segmented images. In this paper we deal with topological operators which achieve directly on the graph current operations performed on segmented images. Well known graph structures such as the Region Adjacency Graph [Pav77] [Ros74] do not (and cannot) keep track of the topology and so cannot...

Graph transformation is concerned with the manipulation of graphs by means of rules. Graph grammars have been traditionally studied using techniques from category theory. In previous works, we introduced Matrix Graph Grammars (MGG) as a purely algebraic approach for the study of graph dynamics, based on the representation of simple graphs by means of their adjacency matrices. The observation th...

Coherence evaluation of texts falls into a category natural language processing tasks. The texts’ coherence implies the estimation their semantic and logical integrity; such feature text can be utilized during solving multidisciplinary tasks (SEO analysis, medicine area, detection fake texts, etc.). In this paper, different state-of-the-art methods based on machine learning models have been ana...

The chromatic number of a graph G, denoted by χ(G), is the minimum number of colors such that G can be colored with these colors in such a way that no two adjacent vertices have the same color. A clique in a graph is a set of mutually adjacent vertices. The maximum size of a clique in a graph G is called the clique number of G. The Turán graph Tn(k) is a complete k-partite graph whose partition...

In this article, the consensus-related performances of triplex multi-agent systems with star-related structures, which can be measured by algebraic connectivity and network coherence, have been studied characterization Laplacian spectra. Some notions graph operations are introduced to construct several networks star substructures. The methods spectra applied derive some asymptotic behaviors ind...

the dispersibility of graphene is modeled as a mathematical function of the molecular structure of solvent represented by simplified molecular input-line entry systems (smiles) together with the graph of atomic orbitals (gao). the gao is molecular graph where atomic orbitals e.g. 1s1, 2p4, 3d7 etc., are vertexes of the graph instead of the chemical elements used as the graph vertexes in the tra...

Introduction: Graph theoretical analysis of functional Magnetic Resonance Imaging (fMRI) data has provided new measures of mapping human brain in vivo. Of all methods to measure the functional connectivity between regions, Linear Correlation (LC) calculation of activity time series of the brain regions as a linear measure is considered the most ubiquitous one. The strength of the dependence obl...