Feature-Based Image Registration

Image registration is the fundamental task used to match two or more partially overlapping images taken, for example, at different times, from different sensors, or from different viewpoints and stitch these images into one panoramic image comprising the whole scene. It is a fundamental image processing technique and is very useful in integrating information from different sensors, finding changes in images taken at different times, inferring three-dimensional information from stereo images, and recognizing model-based objects. Some techniques are proposed to find a geometrical transformation that relates the points of an image to their corresponding points of another image. To register two images, the coordinate transformation between a pair of images must be found. In this thesis, a feature-based method is developed to efficiently estimate an eight-parametric projective transformation model between pairs of images. The proposed approach applies wavelet transform to extract a number of feature points as the basis for registration. Each selected feature point is an edge point whose edge response is the maximum within a neighborhood. During the real matching process, we check each candidate pair in advance to see if it can possibly become a correct matching pair. Due to this checking, many unnecessary calculations involving cross-correlations can be screened in advance. Therefore, the search time for obtaining correct matching pairs is reduced significantly. Finally, based on the set of correctly matched feature point pairs, the transformation between two partially overlapping images can be decided

Efficient feature-based image registration by mapping sparsified surfaces

With the advancement in the digital camera technology, the use of high resolution images and videos has been widespread in the modern society. In particular, image and video frame registration is frequently applied in computer graphics and film production. However, conventional registration approaches usually require long computational time for high resolution images and video frames. This hinders the application of the registration approaches in the modern industries. In this work, we first propose a new image representation method to accelerate the registration process by triangulating the images effectively. For each high resolution image or video frame, we compute an optimal coarse triangulation which captures the important features of the image. Then, we apply a surface registration algorithm to obtain a registration map which is used to compute the registration of the high resolution image. Experimental results suggest that our overall algorithm is efficient and capable to achieve a high compression rate while the accuracy of the registration is well retained when compared with the conventional grid-based approach. Also, the computational time of the registration is significantly reduced using our triangulation-based approach

Cramer-Rao Lower Bound for Point Based Image Registration with Heteroscedastic Error Model for Application in Single Molecule Microscopy

The Cramer-Rao lower bound for the estimation of the affine transformation parameters in a multivariate heteroscedastic errors-in-variables model is derived. The model is suitable for feature-based image registration in which both sets of control points are localized with errors whose covariance matrices vary from point to point. With focus given to the registration of fluorescence microscopy images, the Cramer-Rao lower bound for the estimation of a feature's position (e.g. of a single molecule) in a registered image is also derived. In the particular case where all covariance matrices for the localization errors are scalar multiples of a common positive definite matrix (e.g. the identity matrix), as can be assumed in fluorescence microscopy, then simplified expressions for the Cramer-Rao lower bound are given. Under certain simplifying assumptions these expressions are shown to match asymptotic distributions for a previously presented set of estimators. Theoretical results are verified with simulations and experimental data

Enhanced phase congruency feature-based image registration for multimodal remote sensing imagery

Multimodal image registration is an essential image processing task in remote sensing. Basically, multimodal image registration searches for optimal alignment between images captured by different sensors for the same scene to provide better visualization and more informative images. Manual image registration is a tedious task and requires more effort, hence developing an automated image registration is very crucial to provide a faster and reliable solution. However, image registration faces many challenges from the nature of remote sensing image, the environment, and the technical shortcoming of the current methods that cause three issues, namely intensive processing power, local intensity variation, and rotational distortion. Since not all image details are significant, relying on the salient features will be more efficient in terms of processing power. Thus, the feature-based registration method was adopted as an efficient method to avoid intensive processing. The proposed method resolves rotation distortion issue using Oriented FAST and Rotated BRIEF (ORB) to produce invariant rotation features. However, since it is not intensity invariant, it cannot support multimodal data. To overcome the intensity variations issue, Phase Congruence (PC) was integrated with ORB to introduce ORB-PC feature extraction to generate feature invariance to rotation distortion and local intensity variation. However, the solution is not complete since the ORB-PC matching rate is below the expectation. Enhanced ORB-PC was proposed to solve the matching issue by modifying the feature descriptor. While better feature matches were achieved, a high number of outliers from multimodal data makes the common outlier removal methods unsuccessful. Therefore, the Normalized Barycentric Coordinate System (NBCS) outlier removal was utilized to find precise matches even with a high number of outliers. The experiments were conducted to verify the registration qualitatively and quantitatively. The qualitative experiment shows the proposed method has a broader and better features distribution, while the quantitative evaluation indicates improved performance in terms of registration accuracy by 18% compared to the related works

Registration of polarimetric images for in vivo skin diagnostics

SIGNIFICANCE: Mueller matrix (MM) polarimetry is a promising tool for the detection of skin cancer. Polarimetric in vivo measurements often suffer from misalignment of the polarimetric images due to motion, which can lead to false results. AIM: We aim to provide an easy-to-implement polarimetric image data registration method to ensure proper image alignment. APPROACH: A feature-based image registration is implemented for an MM polarimeter for phantom and in vivo human skin measurements. RESULTS: We show that the keypoint-based registration of polarimetric images is necessary for in vivo skin polarimetry to ensure reliable results. Further, we deliver an efficient semiautomated method for the registration of polarimetric images. CONCLUSIONS: Image registration for in vivo polarimetry of human skin is required for improved diagnostics and can be efficiently enhanced with a keypoint-based approach

Quantitative evaluation of image registration techniques in the case of retinal images

International audienceIn human retina observation (with non mydriatic optical microscopes), an image registration process is often employed to enlarge the field of view. Analyzing all the images takes a lot of time. Numerous techniques have been proposed to perform the registration process. Its good evaluation is a difficult question that is then raising. This article presents the use of two quantitative criterions to evaluate and compare some classical feature-based image registration techniques. The images are first segmented and the resulting binary images are then registered. The good quality of the registration process is evaluated with a normalized criterion based on the ϵ dissimilarity criterion, and the figure of merit criterion (fom), for 25 pairs of images with a manual selection of control points. These criterions are normalized by the results of the affine method (considered as the most simple method). Then, for each pair, the influence of the number of points used to perform the registration is evaluated

Accurate and automatic NOAA-AVHRR image navigation using a global contour matching approach

The problem of precise and automatic AVHRR image navigation is tractable in theory, but has proved to be somewhat difficult in practice. The authors' work has been motivated by the need for a fully automatic and operational navigation system capable of geo-referencing NOAA-AVHRR images with high accuracy and without operator supervision. The proposed method is based on the simultaneous use of an orbital model and a contour matching approach. This last process, relying on an affine transformation model, is used to correct the errors caused by inaccuracies in orbit modeling, nonzero value for the spacecraft's roll, pitch and yaw, errors due to inaccuracies in the satellite positioning and failures in the satellite internal clock. The automatic global contour matching process is summarized as follows: i) Estimation of the gradient energy map (edges) in the sensed image and detection of the cloudless (reliable) areas in this map. ii) Initialization of the affine model parameters by minimizing the Euclidean distance between the reference and sensed images objects. iii) Simultaneous optimization of all reference image contours on the sensed image by energy minimization in the domain of the global transformation parameters. The process is iterated in a hierarchical way, reducing the parameter searching space at each iteration. The proposed image navigation algorithm has proved to be capable of geo-referencing a satellite image within 1 pixel.Peer ReviewedPostprint (published version