A QSPR study of six sets of partition coefficients of a class of halogenated organic compounds has been performed with the aim to describe the six sets of partition coefficients with a common molecular connectivity descriptor, whose basic parameters can be derived by the aid of the three graph concepts: graph, pseudograph and complete graph. A simple odd complete graph conjecture gives rise to ...

The problem of filter design for descriptor systems system has been intensively studied by a number of researchers for the past three decades; see Ref.[1]-[6]. This is due not only to theoretical interest but also to the relevance of this topic in control engineering applications. Descriptor systems or so called singularly perturbed systems are dynamical systems with multiple time-scales. Descr...

In this work, we describe in detail the new MPEG-7 Perceptual 3D Shape Descriptor and provide a set of tests with different 3D objects databases, mainly with the Princeton Shape Benchmark. With this purpose we created a function library called Retrieval-3D and fixed some bugs of the MPEG-7 eXperimentation Model (XM). We explain how to match the Attributed Relational Graph (ARG) of every 3D mode...

Tensor scale is a morphometric parameter that unifies the representation of local structure thickness, orientation, and anisotropy, which can be used in several computer vision and image processing tasks. In this article, we exploit this concept for binary images and propose a shape salience detector and a shape descriptor – Tensor Scale Descriptor with Influence Zones. It also introduces a rob...

The problem of filter design for descriptor systems system has been intensively studied by a number of researchers for the past three decades; see Ref.[1]-[6]. This is due not only to theoretical interest but also to the relevance of this topic in control engineering applications. Descriptor systems or so called singularly perturbed systems are dynamical systems with multiple time-scales. Descr...

In this paper, we investigate several theoretical and computational aspects of fundamental subspaces for linear, time-invariant (LTI) descriptor systems, which appear in the solution of many control and estimation problems. Different types of reachability and controllability for descriptor systems are described and discussed. The Rosenbrock system matrix pencil is employed for the computation o...

Feature matching in omnidirectional vision systems is a challenging problem, mainly because complicated optical systems make the theoretical modelling of invariance and construction of invariant feature descriptors hard or even impossible. In this paper, we propose learning invariant descriptors using a training set of similar and dissimilar descriptor pairs. We use the similarity-preserving ha...

We present an algorithm to compute molecular graph descriptors considering the stereochemistry of the molecular structure based on our previously introduced signature molecular descriptor. The algorithm can generate two types of descriptors, one which is compliant with the Cahn-Ingold-Prelog priority rules, including complex stereochemistry structures such as fullerenes, and a computationally e...