Abstract This paper studies the problem of unsupervised detection geometrically similar fragments (segments) in curves, context boundary matching. The goal is to determine all pairs sub-curves that are similar, under local scale invariance. In particular, we aim locate existence a section (independent length and/or orientation) second curve, first as indicated by user. proposed approach based o...

The classic paper of Shapley and Shubik (1971) characterized the core assignment game using ideas from matching theory LP-duality their highly non-trivial interplay. Whereas this is always non-empty, that general graph can be empty. This salvages situation by giving an imputation in 2/3-approximate for latter; moreover computed polynomial time. bound best possible, since it integrality gap natu...

‎The subject of this paper is the solution of the Fredholm integral equation with Toeplitz, Hankel and the Toeplitz plus Hankel kernel. The mean value theorem for integrals is applied and then extended for solving high dimensional problems and finally, some example and graph of error function are presented to show the ability and simplicity of the ‎method.

Large Scale Graph Matching (LSGM) is one of the fundamental problems in Graph theory and it has applications in many areas such as Computer Vision, Machine Learning, Pattern Recognition and Big Data Analytics (Data Science). Matching belongs to the combinatorial class of problems which refers to finding correspondence between the nodes of a graph or among set of graphs (subgraphs) either precis...

The matching preclusion number of a graph is the minimum number of neither edges whose deletion in a graph has a neither perfect matching nor an almost perfect matching. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. Recently the conditional matching preclusion number of a graph was introduced to look for sets beyond those induced by a single...

Aharoni and Berger conjectured that every bipartite graph which is the union of n matchings of size n + 1 contains a rainbow matching of size n. This conjecture is a generalization of several old conjectures of Ryser, Brualdi, and Stein about transversals in Latin squares. When the matchings are all edge-disjoint and perfect, an approximate version of this conjecture follows from a theorem of H...

We show that for any class of bipartite graphs which is closed under edge deletion and where the number of perfect matchings can be counted in NC, there is a deterministic NC algorithm for finding a perfect matching. In particular, a perfect matching can be found in NC for planar bipartite graphs and K3,3-free bipartite graphs via this approach. A crucial ingredient is part of an interior-point...

Graph matching is a fundamental problem in Computer Vision and Machine Learning. We present two contributions. First, we give a new spectral relaxation technique for approximate solutions to matching problems, that naturally incorporates one-to-one or one-to-many constraints within the relaxation scheme. The second is a normalization procedure for existing graph matching scoring functions that ...

Motion trajectories provide a key and informative clue in motion characterization of humans, robots and moving objects. In this paper, we propose some new integral invariants for space motion trajectories, which benefit effective motion trajectory matching and recognition. Integral invariants are defined as the line integrals of a class of kernel functions along a motion trajectory. A robust es...