Full-Search-Equivalent Pattern Matching with Incremental Dissimilarity Approximations

Quick Full Search Equivalent Algorithms for Nearest Neighbour Pattern Matching

We consider the problem of finding the closest match for a given target vector in a codebook of codeword vectors. We present an approach which makes it possible to obtain quick full-search equivalent methods for finding the closest match with respect to some distortion measure. Our algorithms assume that the distortion measure obeys the triangle inequality of metric spaces. Results indicate tha...

Adaptive Low Resolution Pruning for fast Full Search-equivalent pattern matching

In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: a b s t r a c t Several recent proposals have shown the feasibility of significantly speeding-up pattern matching by means o...

A Matching Pursuit Full Search Algorithm for Image Approximations

There is a growing interest on adapted signal expansions for efficient sparse approximations. For this purpose, signal expansions on over-complete bases are of high interest. Several strategies exist in order to get sparse approximations of a signal as a superposition of functions from a redundant dictionary. One of these strategies is the well known Matching Pursuit (MP). MP is an algorithm wh...

Incremental Graph Pattern Matching

A Incremental Graph Pattern Matching

Graph pattern matching is commonly used in a variety of emerging applications such as social network analysis. These applications highlight the need for studying the following two issues. First, graph pattern matching is traditionally defined in terms of subgraph isomorphism or graph simulation. These notions, however, often impose too strong a topological constraint on graphs to identify meani...