There have been many matching pursuit algorithms (MPAs) which handle the sparse signal recovery problem a.k.a. compressed sensing (CS). In the MPAs, the correlation computation step has a dominant computational complexity. In this letter, we propose a new fast correlation computation method when we use some classes of partial unitary matrices as the sensing matrix. Those partial unitary matrice...

It is a longstanding open problem whether there exists a polynomial size description of the perfect matching polytope. We give a partial answer to this question by proving the following result. The polyhedron defined by the constraints of the perfect matching polytope which are active at a given perfect matching can be obtained as the projection of a compact polyhedron. Thus there exists a comp...

We propose a weighted common subgraph (WCS) matching algorithm to find the most similar subgraphs in two labeled weighted graphs. WCS matching, as a natural generalization of the equal-sized graph matching or subgraph matching, finds wide applications in many computer vision and machine learning tasks. In this paper, the WCS matching is first formulated as a combinatorial optimization problem o...

Matching is the process of comparing two or more structures to discover their likenesses or differences. It is a common operation performed in symbolic classification, pattern recognition, data mining and expert systems. The definition of a matching operator for Boolean symbolic objects is important for the development of symbolic data analysis techniques. In this paper we give the definition o...

We propose a couple of oracle construction methods for quantum pattern matching. in turn show that one the construct can be used with Grover's search algorithm exact and partial matching, deterministically. The other also points to matched indices, but primarily provides means generate Hamming distance between searched all possible sub strings input string, probabilistic way.

Although fingerprint matching based on minutia features is a well researched problem in the field of automatic fingerprint recognition, it is still an unsolved problem presenting many research challenges. Many algorithms have been proposed to match a pair of minutia templates of fingerprints. Most of these algorithms assume that the two templates are approximately of the same size. This assumpt...

ARSTRACT This paper proposes a matching algorithm for two In the process of visually matching two mutually-distorted waveforms, each having partial mutuallyaistorted waveforms, we first try to detect major differences in the hierarchical structure of its scale-space. corresponding points between them by observing their 'I'his algorithm is applied to matching of two-dimensional roc,gh outlines, ...

An important step in automatic reassembly of 2D fragments is to find candidate matching pairs for adjacent fragments. In this paper, we propose a new partial curve matching method to find the candidate matches. In this method, the fragment contours are represented by their turning functions. The matching segments between two fragment contours are found by analyzing the difference curve between ...

This study introduces a new fast motion estimation (ME) based on both an adaptive search range adjustment and a matching point decimation. In particular, the authors present a maximum matching error constraint in the matching phase that can eliminate an impossible candidate block much earlier than a conventional partial distortion elimination (PDE) scheme. The constraint is computed during the ...

This paper shows the existence of independent randommatching of a large (continuum) population in both static and dynamic systems, which has been popular in the economics and genetics literatures. We construct a joint agent-probability space, and randomized mutation, partial matching, and match-induced type-changing functions that satisfy appropriate independence conditions. The proofs are achi...