the three-dimensional search area In this paper, we propose an efficient technique for tracking three-dimensional palm motion, which is captured by two cameras. If we perform template matching independently for each image, two points in two images do not always correspond to each other. Thus we propose to set the search area in the three-dimensional space, not in image planes, so that we can fi...

The traditional NCC algorithm has considerable computational burden, but is with high rate of matching accuracy when people use it in image matching. The PCA algorithm has high matching speed and can be anti-interference when it is used in image matching. Based on experiment, we propose one improved algorithm which can greatly reduce the matching time as well as get high rate of matching accuracy.

The task of determining the mapping between a pair of images is called image matching and is fundamental in image processing. Prior information is essential to the inference of the mapping because the image features on which matching is based are sparsely distributed and, consequently, underconstrain the problem. In this paper, we describe the Bayesian approach to image matching and introduce s...

A robust image matching algorithm using a set of selected SIFT descriptors is investigated in this work. We first utilize the colorbased segmentation method and the watershed algorithm to separate foreground and background regions in images and then search the corresponding SIFT descriptors along foreground contours. These selected SIFT descriptors can offer more robust and stable image matchin...

Often, stereo matching is treated as two quite independent subprocesses: segmentation, followed by matching. In this paper, we treat these processes as naturally related, with partial matching results feeding back into the segmentation and both proceeding simultaneously in a cooperative fashion. We consider regions as the primitives to be matched, and our implementation is based upon maintainin...

Fast and accurate 3D object reconstruction and partial 3D component retrieval from 2D image slices represent a difficult and challenging problem. To group related objects on different layers in an image stack, image segmentation and sequential matching of adjacent 2D objects have to be preformed. Object matching involves heavy computing and is time consuming. In this paper, we propose a new app...

Deep Matching (DM) is a popular high-quality method for quasi-dense image matching. Despite its name, however, the original DM formulation does not yield a deep neural network that can be trained end-to-end via backpropagation. In this paper, we remove this limitation by rewriting the complete DM algorithm as a convolutional neural network. This results in a novel deep architecture for image ma...

High-dimensional feature matching based on nearest neighbors search is a core part of many image-matching based problems in computer vision which are solved by local invariant features. In this paper, we propose a new indexing structure for the high-dimensional feature matching, which is based on the distance of the sub-vectors. In addition, we employ an effective image-similarity measure of tw...

Obtaining an accurate vehicle position is important for intelligent vehicles in supporting driver safety and comfort. This paper proposes an accurate ego-localization method by matching in-vehicle camera images to an aerial image. There are two major problems in performing an accurate matching: (1) image difference between the aerial image and the in-vehicle camera image due to view-point and i...

PURPOSE Liver image guided radiation therapy (IGRT) based on bone matching risks generating serious target positioning errors for reasons of lack of reproducibility of expiration breath hold. We therefore investigated the feasibility of 3D image matching between planning CT images and pretreatment cone-beam computed tomography (CBCT) images based on diaphragm surface matching. METHOD 27 liver...