Many tasks in computer vision are formulated as graph matching problems. Despite the NP-
hard nature of the problem, fast and accurate approximations have led to significant …

The estimation of correspondences between two images resp. point sets is a core problem
in computer vision. One way to formulate the problem is graph matching leading to the …

Feature matching problem that incorporates pairwise constraints is usually formulated as a
quadratic assignment problem (QAP). Since it is NP-hard, relaxation models are required. In …

We use abstract algebra to derive new algorithms for fast cross-validation, online learning,
and parallel learning. To use these algorithms on a classification model, we must show that …

SnFFT is an easy to use software library written in the Julia language to facilitate Fourier
analysis on the symmetric group (set of permutations) of degree n, denoted Sn and make it …

The availability of secret keys is a precondition for the use of many security solutions and
protocols. However, securely assigning such keys to nodes is a challenging task in the …

This is a collection of works that I have done during my Ph. D. research at the University of
Minnesota. There are three parts dedicated to different topics, of which abstracts are …

In this paper, we propose an optimization method for estimating the parameters that typically
appear in graph-theoretical formulations of the matching problem for object detection …

Graph matching is an important problem in the field of computer vision. Graph matching
problem can be represented as quadratic assignment problem. Because the problem is …

Sei S n die symmetrische Gruppe auf {1,..., n} und S nk die Untergruppe von S n, die die
Elemente j> nk stabilisiert. Komplexwertige Funktionen auf dem homogenen Raum S n/S nk …