For most tasks in image sequence analysis, the estimation of optical flow is the primary step towards the final solution. Block matching, which is adopted by many current coding standards, is the most popular method among other approaches. Research in this area mainly focuses on three aspects: matching criteria, searching criteria and the determination of block size. In this paper, we propose a...

typographical data entry errors and incomplete documents, produce imperfect records in real world databases. these errors generate distinct records which belong to the same entity. the aim of approximate record matching is to find multiple records which belong to an entity. in this paper, an algorithm for approximate record matching is proposed that can be adapted automatically with input error...

Jigsaw puzzles [9] and edge-matching puzzles [5] are two ancient types of puzzle, going back to the 1760s and 1890s, respectively. Jigsaw puzzles involve fitting together a given set of pieces (usually via translation and rotation) into a desired shape (usually a rectangle), often revealing a known image or pattern. The pieces are typically squares with a pocket cut out of or a tab attached to ...

An edge cut W of a connected graph G is a k-restricted edge cut if G−W is disconnected, and every component of G −W has at least k vertices. The k-restricted edge connectivity is defined as the minimum cardinality over all k-restricted edge cuts. A permutation graph is obtained by taking two disjoint copies of a graph and adding a perfect matching between the two copies. The k-restricted edge c...

potential fields are due to complex distribution of sources related to susceptibility and mass density variations for magnetic and gravity field respectively. in researching the lateral heterogeneous of different geological bodies, in particular their edge location potential field has some advantages. we mainly refer to linear features such as fault, folding axis, dyke, trend and border of the ...

Edge-matching problems, also called edge matching puzzles, are abstractions of placement problems with neighborhood conditions. Pieces with colored edges have to be placed on a board such that adjacent edges have the same color. The problem has gained interest recently with the (now terminated) Eternity II puzzle, and new complexity results. In this paper we consider a number of settings which ...

Feature inconsistency and low contract and noise in the infrared image background consist of the principle difficulty in the IR/Visible battle field image registration. Feature-based approaches are more powerful and versatile to process poor quality IR images. Multi-scale hierarchical edge detection and edge focusing and salience measure are used in the feature horizon extraction. The common fe...

This paper diacusses the problem of extracting curves, such as lines, circlea and ellipses, from 2D edge data. Our praposed extraction algorithm operates by taking random Barnples of minima! sitbsets, and thcn matching the curvc through each minimal s u b ~ e t against the edge data. We perform the time-critical curve matching step using a new approach based on incremental curve generation dgar...

Consider a directed graph G in which every edge has an associated real-valued distance and a real-valued weight. The weight of an undirected circuit of G is the sum of the weights of the edges, whereas the distance of an undirected circuit is the sum of the distances of the forward edges of the circuit minus the sum of the distances of the backward edges. A trivial circuit is a two-edge circuit...

Robot vision tasks often use stereo methods to obtain 3-d information on the environment. This paper shows how color information can be utilized to improve the results of dense stereo matching as well as the results of edge-based stereo matching. A hierarchical chromatic Block Matching technique to obtain dense stereo correspondence is presented. The results have been compared to the results of...