The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Removing noise, called denoising, is an essential factor for achieving the intuitive and accurate results in boundary image matching. This paper deals with a partial denoising problem that tries to allow a limited amount of noise embedded in boundary images. To solve this problem, we first define partial denoising time-series that can be generated from an original image time-series by removing a variety...
In this paper we suggest a novel approach for detection of a unique reference point and computation of a unique reference orientation of fingerprints for feature extraction in polar coordinates. After finding orientation field of the fingerprint the curvature measurement is done on the result. By using this information it is possible to determine the exact location of the singular points. Based on...
Image stitching is one of important technologies in image processing field. It implements a seamless connection with two or more images which have overlapping part to get higher resolution or wider viewing angle image. As the amount of tedious calculation, a new image stitching method based on feature pixels is proposed in this paper. We extracted the edge feature pixels of images based on Canny operator...
Template matching is used for many applications in image processing. Cross correlation is the basic statistical approach to image registration. It is used for template matching or pattern recognition. Template can be considered a sub-image from the reference image, and the image can be considered as a sensed image. The objective is to establish the correspondence between the reference image and sensed...
In this paper, a improved algorithm based on convex hull vertices is proposed. After extracting feature points by Harris corner detector, for searching the same regions of reference images, correlation method is used to match these points firstly, which gains two initial pairing sets. Then convex hull vertices of the pairing sets are used to establish the transformation parameters that can match most...
Success of automatic fingerprint identification systems (AFISs) strongly depends on the accurate detection of a reference point on the fingerprints. In this paper we suggest a novel approach for detecting a reference point. First approximate location of singular point(s) is determined by using orientation field and edge detection algorithms. Then to find accurate location of these points, a new secondary...
SIFT (scale invariant feature transform) used in fruits recognition presents a characteristics matching algorithm according to fruits images. The algorithm uses SIFT characteristics as matching feature, then introduces Euclidean distance as the similarity metrics of image matching, and uses a method of setting a threshold value to delete the false matching points. The experimental results prove that...
Hand-based identification have developed very recently. This paper proposes a recognizing method for defocused palmprint images using 2DPCA. In order to achieve the purpose of intercepting region of interest (ROI) of palmprint under contactlass mode, we used profile information of palm and root of fingers situations to locate characteristic points of contour. Next, the palmprint features were extracted...
Based on the researches of LSB (least significant bit, i.e. the last bit of a binary pixel value) matching steganographic method and the steganalytic method which aims at histograms of cover images, this paper proposes a new LSB matching steganographic method. A steganographic information table is defined to record the changes which are introduced by the embedded secrete bits. According to the table,...
The problem of finding a match for an image (`template') within a larger image is known as template matching. It is key to a variety of computer vision applications. Currently known template matching algorithms run in fixed time, or are guaranteed to find the best match. We present a novel algorithm which in many cases can guarantee that the best match is found. In other cases it finds a good approximation...
An important problem in computer vision is to determine the orientation of a rigid body in an image. This can be accomplished by matching points or line segments that naturally appear on the object. Several elegant and computationally fast algorithms based on the singular value decomposition and quaternions have been introduced to solve this problem. In this article, the authors first examine the...
In this paper, a new image denoise method is presented. The main contribution of our approach is to apply an auto-adapted empirical mode decomposition algorithm (AAEMD) to remove the noise. By means of AAEMD, the image can be decomposed into a number of intrinsic mode function (IMF), and the histogram of IMF observes the normal distribution, whether the original image has noise or not. Here, histogram...
We consider the estimation of the variance of an additive white Gaussian noise corrupting an image. In the proposed approach, we exploit the nonlocal self-similarity of images to achieve an improved separation of noise and signal. In particular, we utilize the same adaptive 3-D transform decomposition used in the BM3D (block-matching and 3-D filtering) denoising algorithm, where mutually similar blocks...
We present a novel method to compute the normalized cross-correlation (NCC) of spherical signals such as omnidirectional images for the purpose of image alignment, i.e. orientation estimation, or template tracking. Expanding the reference image and the search template in the spherical harmonics basis, we use the Fourier representation of SO(3) as introduced by Kostelec and Rockmore. We show that the...
The reference-point played important roles in most algorithms of fingerprint recognition. It is widely used in fingerprint classification, and fingerprint matching. There are many methods proposed for reference point detection as Poincare index technique, geometry of region technique, direction curvature technique and orientation-consistency-based technique. However, the experimental results show...
The Cram-Rao inequality states that the reciprocal of the Fisher information is a lower bound on the variance of any unbiased estimator, which is used to the analysis of the object matching in the paper. Based on the Fisher information analysis, the lower variance bounds of the object matching transformation parameters are inversely proportional to the total gradient energy. So the pixel point gradient...
Hausdorff distance (HD) and its modifications provides one of the best approaches for matching of binary images. This paper proposes a formalism generalizing almost all of these HD based methods. Numerical experiments for searching words in binary text images are carried out with old Bulgarian typewritten text, printed Bulgarian Chrestomathy from 1884 and Slavonic manuscript from 1574.
Mutual information based matching-suitable features are studied in this paper, for the selection of good matching areas with high success probability in SAR matching aided navigation system. Based on the analysis of SAR imaging and multi-source matching, four feature constructing guide lines are proposed first. Then ten candidate features are designed under mutual information measurement. Effectiveness...
Traffic accident scene processing is a significant content to traffic supervisory work. The development and application of photographic survey and the digital picture processing technology provide the powerful tool for solved this difficult problem. This article proposed applies binocular ranging to the traffic accident processes. We have priority introduced the technology of survey principle, image...
To improve the correctness and real-time performance in the process of image matching, this paper proposed a fast matching algorithm based on image K-gray-degree clustering. Given a template with irregular shape, this algorithm divides the image into certain size blocks called R_block, and calculates their mean gray value, then clusters original templates to K-degree templates according to gray distribution...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.