Several techniques for document image matching developed at the Ricoh California Research Center are presented. These methods are given a document image as input and locate visually similar or identical copies of the same image in a large database.

We propose a non-transform image compression scheme based on approximate pattern matching, that we name Pattern Matching Image Compression (PMIC). The main idea behind it is a lossy extension of the Lempel-Ziv data compression scheme in which one searches for the longest prefix of an uncompressed image that approzimately occurs in the already processed image. We consider both the Hamming distan...

ÐImage matching applications such as tracking and stereo commonly use the sum-of-squared-difference (SSD) measure to determine the best match. However, this measure is sensitive to outliers and is not robust to template variations. Alternative measures have also been proposed that are more robust to these issues. We improve upon these using a probabilistic formulation for image matching in term...

We build a dataset including four kinds of multispectral images with labeled key point correspondence. The dataset includes 7 RGB/NIR image pairs, 4 RGB/Depth image pairs, 3 Flash/no-flash image pairs and 4 different exposure image pairs. In each pair, we uniformly select corner points and label their correspondences. The resolution of the RGB/Depth image pairs is 640 × 480 and all the other im...

We present the problem of Oblivious Image Matching, where two parties want to determine whether they have images of the same object or scene, without revealing any additional information. While image matching has attracted a great deal of attention in the computer vision community, it was never treated in a cryptographic sense. In this paper we study the private version of the problem, obliviou...

Matching remotely sensed multimodal images is a crucial process that poses significant challenges due to nonlinear radiometric differences and substantial image noise. To overcome these difficulties, this study presents novel practical template-matching algorithm specifically designed for purpose. Unlike traditional approaches rely on intensity, the proposed focuses matching based their geometr...

When applying PDE algorithm according to the complexity of the image, the problem is how to get complexity of the image. J.N. Kim and et al. proposed one method, which results in significant reduced computation with the same predicted image quality of the conventional FS [1]. But by localizing the image well, we can get more the reduction of unnecessary computation. In general, image complexity...

In image matching research, how to ensure that best match’s accuracy of the premise and a significant reduction in the amount of computing is the focus of concern by researchers. Search strategy to find the best match location of the image matching process to determine the amount of computing of image matching, in the existing image matching method are used to traverse search strategy, it is di...

This paper presents a content-based image retrieval technique based on interest points matching and geometric hashing. We estimate points with significant luminance variations as interest points. A small region around the interest point is located as an image patch. Low-level features are extracted to describe each image patch. To provide geometric invariant image matching, we index the image p...