Dynamic textures (DTs) are pseudo periodic data on a space × time support, that can represent many natural phenomena captured from video footages. Their modeling and recognition useful in applications of computer vision. This paper presents an approach for DT analysis combining graph-based description the Complex Network framework, learned representation Randomized Neural (RNN) model. First, di...

The title compound, C(8)H(10)O, crystallizes with three mol-ecules in the asymmetric unit. O-H⋯O hydrogen bonds form cooperative chains connecting the mol-ecules along [100]. On the unitary graph level, this pattern is assigned a DDD descriptor. The ternary descriptor is C(3) (3)(6).

if we think of the graph as modeling a network, the vulnerability measure the resistance of the network to disruption of operation after the failure of certain stations or communication links. many graph theoretical parameters have been used to describe the vulnerability of communication networks, including connectivity, integrity, toughness, binding number and tenacity.in this paper we discuss...

This paper presents a novel approach to represent spatiotemporal visual information. We introduce a surface-based shape model whose structure is invariant to surface variations over time to describe 3D dynamic surfaces (e.g., obtained from multiview video capture). The descriptor is defined as a graph lying on object surfaces and anchored to invariant local features (e.g., extremal points). Geo...

Petroglyphs can be found on rock panels all over the world. The possibilities of digital photography and more recently various 3D scanning methods opened a new stage for the documentation and analysis of petroglyphs. The existing work on petroglyph shape similarity has largely avoided the questions of articulation, merged petroglyphs and potentially missing parts of petroglyphs. We aim at contr...

In this paper we introduce the idea of descriptor combination by Particle Swarm Optimization and its applications for classification purposes using a recently pattern recognition technique called Optimum-Path Forest (OPF), which interprets the samples of the dataset as the nodes of a given graph, and each arc is weighted by the distance between the corresponding nodes. The method combines diffe...

let g be a fixed element of a finite group g. we introduce the g-noncommuting graph of g whose vertex set is whole elements of the group g and two vertices x,y are adjacent whenever [x,y] g  and  [y,x] g. we denote this graph by . in this paper, we present some graph theoretical properties of g-noncommuting graph. specially, we investigate about its planarity and regularity, its clique number a...

The current work introduces an algorithm for constructing Reeb graph for CAD models and their inner cavities. The nodes of the graph represent areas of the manifold of the model where topological changes occur. Edges of the graph encode information about connections between such areas. The outline for the topological graph matching is given for detection of graph (sub)isomorphism. The proposed ...

The current work introduces an algorithm for constructing Reeb graph for CAD models and their inner cavities. The nodes of the graph represent areas of the manifold of the model where topological changes occur. Edges of the graph encode information about connections between such areas. The outline for the topological graph matching is given for detection of graph (sub)isomorphism. The proposed ...

In order to explore atomic asymmetry and molecular chirality in 2D space, benzenoids composed of 3 to 11 hexagons in 2D space were enumerated in our laboratory. These benzenoids are regarded as planar connected polyhexes and have no internal holes; that is, their internal regions are filled with hexagons. The produced dataset was composed of 357,968 benzenoids, including more than 14 million at...