NCC Based Correspondence Problem for First- and Second-Order Graph Matching

On the second order first zagreb index

Inspired by the chemical applications of higher-order connectivity index (or Randic index), we consider here the higher-order first Zagreb index of a molecular graph. In this paper, we study the linear regression analysis of the second order first Zagreb index with the entropy and acentric factor of an octane isomers. The linear model, based on the second order first Zag...

Constructing second-order data dependent probability matching priors from first-order probability matching priors

A Pure First Order Representation for Undamped Second Order Descriptor Systems

The aim of this paper is to analyze the undamped second order descriptor systems to show the possibility of transform an undamped second order descriptor system to a pure first order descriptor system ,on different ways, while stating some of its benefits. Meanwhile we will introduce pure first order systems and undamped second order systems and indicate that under some assumptions every undamp...

Fast and scalable approximate spectral graph matching for correspondence problems

Establishing consistent correspondences between two sets of features is a fundamental problem in computer vision. This problem can be well formulated as graph matching in which nodes and edges represent feature points and pairwise relationships between feature points, respectively. Spectral matching [19] is the state-of-the-art eigenvector-based method for graph matching. The spectral matching ...

Eecient Second-order Matching ?

The standard second-order matching algorithm by Huet may be expansive in matching a exible-rigid pair. On one hand, many fresh free variables may need to be introduced; on the other hand, attempts are made to match the heading free variable on the exible side with every \top layer" on the rigid side and every argument of the heading free variable with every subterm covered by the \top layer". W...