ÐThis paper describes a new, promising technique of gray-scale character recognition that offers both noise tolerance and affine-invariance. The key ideas are twofold. First is the use of normalized cross-correlation as a matching measure to realize noise tolerance. Second is the application of global affine transformation (GAT) to the input image so as to achieve affine-invariant correlation w...

Most of the existing fingerprint retrieval systems are based on the overall characteristics and detailed features of fingerprints, and their performance is poor in the cases of low-quality fingerprint images, such as incomplete fingerprint images. In order to improve the recognition speed, accuracy, and robustness of automated fingerprint recognition systems based on large-scale fingerprint dat...

In this paper we address the problem of matching two images with two different resolutions: a high-resolution image and a low-resolution one. On the premise that changes in resolution act as a smoothing equivalent to changes in scale, a scale-space representation of the high-resolution image is produced. Hence the one-to-one classical image matching paradigm becomes one-to-many because the lowr...

The resummed differential thrust rate in e+e− annihilation is calculated using SoftCollinear Effective Theory (SCET). The resulting distribution in the two-jet region (T ∼ 1) is found to agree with the corresponding expression derived by the standard approach. A matching procedure to account for finite corrections at T < 1 is then described. There are two important advantages of the SCET approa...

Traditional iris recognition method has low speed and searching rate in large-scale unstructured database. Three different quantum algorithms are proposed in iris recognition. Quantum filtering algorithm can get a better filtering result than classical algorithm in iris filtering process. Quantum Fourier transforms exhibits an exponential speed-up compared with discrete Fourier transform in fea...

Though dynamic programming matching can carry out approximate string matching when there may be deletions or insertions in a document, its effectiveness and efficiency are usually too poor to use it for large-scale information retrieval. In this paper, we propose a method of dynamic programming matching for information retrieval. This method is as effective as a conventional information retriev...

the purpose of the matching interdiction problem in a weighted graph is to findtwo vertices such that the weight of the maximum matching in the graph withoutthese vertices is minimized. an approximate solution for this problem has beenpresented. in this paper, we consider dendrimers as graphs such that the weightsof edges are the bond lengths. we obtain the maximum matching in some types ofdend...

With the development and the use of a large variety of DB schemas and ontologies, in many domains (e.g. semantic web, digital libraries, life science, etc), matching techniques are called to overcome the challenge of aligning and reconciling these different interrelated representations. Matching field is becoming a very attractive research topic. In this chapter, the authors are interested in s...

When observing a dynamic world, the size of image structures may vary over time. This article emphasizes the need for including explicit mechanisms for automatic scale selection in feature tracking algorithms in order to: (i) adapt the local scale of processing to the local image structure, and (ii) adapt to the size variations that may occur over time. The problems of corner detection and blob...