Quadratic assignment problems arise in a wide variety of domains, spanning operations
research, graph theory, computer vision, and neuroscience, to name a few. The graph …

Over the past three decades, a number of face recognition methods have been proposed in
computer vision, and most of them use holistic face images for person identification. In many …

In this paper, we propose a novel framework of computing the Quantum-based Entropic
Representations (QBER) for un-attributed graphs, through the Continuous-time Quantum …

Biological network alignment aims to discover important similarities and differences and thus
find a map** between topological and/or functional components of different biological …

In this work, we propose two novel quantum walk kernels, namely the Hierarchical Aligned
Quantum Jensen-Shannon Kernels (HAQJSK), between un-attributed graph structures …

An automatic pigmented skin lesions tracking system, which is important for early skin
cancer detection, is proposed in this work. The input to the system is a pair of skin back …

Pattern recognition methods often deal with samples consisting of thousands of features.
Therefore, the reduction of their dimensionality becomes crucial to make the data sets …

The estimation of mutual information between graphs has been an elusive problem until the
formulation of graph matching in terms of manifold alignment. Then, graphs are mapped to …

We consider the problem of graph matchability in non-identically distributed networks. In a
general class of edge-independent networks, we demonstrate that graph matchability can …

Graph matching (GM)—the process of finding an optimal permutation of the vertices of one
graph to minimize adjacency disagreements with the vertices of another—is rapidly …