High Registration Accuracy Research Articles

A fast and high accuracy registration method for multi-source images

Aiming at the problem of low registration accuracy and poor real-time performance which are caused by traditional SIFT and SURF algorithm in multi-source image registration, a fast and high accuracy registration method is proposed. It makes full use of the flexibility of NSCT for image decomposition and the accuracy of SURF for feature location, as well as the quickness of SURF for feature extraction. Firstly, two images are decomposed by NSCT and SURF features are extracted in low frequency images. Secondly, feature points are matched bilaterally by using the ratio of the closest neighbor and second closest neighbor to avoid one-to-many matching. Then RANSAC is applied to refine the matching. Finally, image registration is realized quickly and accurately. Experimental results show that the proposed method is better than traditional SIFT and SURF in registration accuracy and computation time. It has the validity.

Systematic Error Compensation Based on a Rational Function Model for Ziyuan1-02C

A rational function model (RFM) can be used directly to convert the relationships between image coordinates and object space coordinates without using any physical imaging parameters (such as satellite position and attitude). Thus, RFMs facilitate versatility and high security during geometric processing of optical satellite imagery. Increasingly, RFMs are offered to users as the basic geolocation model for further geometric processing by imagery vendors. However, imagery vendors might perform inadequate in-orbit geometric calibrations, or the calibrated geometric parameters might not be updated in a timely manner. Thus, the RFMs may suffer from high distortion due mainly to interior errors (such as lens distortion). Using the radiometric correction products of Ziyuan1-02C panchromatic and multispectral sensor as examples, the present study addresses the compensation of systematic errors in RFMs. An undistorted RFM can be generated after calibrating the interior error compensation model once, before high-accuracy registration between the panchromatic imagery and multispectral imagery can be achieved using the undistorted RFM. Experimental evaluations based on the positioning accuracy using a few ground control points (GCPs) with an undistorted RFM matched the accuracy of the GCPs. In addition, our approach greatly improves the accuracy of registration (which surpasses 0.7 panchromatic pixels) between panchromatic and multispectral imagery.

An ASIFT-Based Local Registration Method for Satellite Imagery

Imagery registration is a fundamental step, which greatly affects later processes in image mosaic, multi-spectral image fusion, digital surface modelling, etc., where the final solution needs blending of pixel information from more than one images. It is highly desired to find a way to identify registration regions among input stereo image pairs with high accuracy, particularly in remote sensing applications in which ground control points (GCPs) are not always available, such as in selecting a landing zone on an outer space planet. In this paper, a framework for localization in image registration is developed. It strengthened the local registration accuracy from two aspects: less reprojection error and better feature point distribution. Affine scale-invariant feature transform (ASIFT) was used for acquiring feature points and correspondences on the input images. Then, a homography matrix was estimated as the transformation model by an improved random sample consensus (IM-RANSAC) algorithm. In order to identify a registration region with a better spatial distribution of feature points, the Euclidean distance between the feature points is applied (named the S criterion). Finally, the parameters of the homography matrix were optimized by the Levenberg–Marquardt (LM) algorithm with selective feature points from the chosen registration region. In the experiment section, the Chang’E-2 satellite remote sensing imagery was used for evaluating the performance of the proposed method. The experiment result demonstrates that the proposed method can automatically locate a specific region with high registration accuracy between input images by achieving lower root mean square error (RMSE) and better distribution of feature points.

Efficient and accurate set-based registration of time-separated aerial images

This paper addresses the task of time-separated aerial image registration. The ability to solve this problem accurately and reliably is important for a variety of subsequent image understanding applications. The principal challenge lies in the extent and nature of transient appearance variation that a land area can undergo, such as that caused by the change under illumination conditions, seasonal variations, or the occlusion by non-persistent objects (people, cars). Our work introduces several major novelties (i) unlike previous work on aerial image registration, we approach the problem using a set-based paradigm; (ii) we show how image space local, pair-wise constraints can be used to enforce a globally good registration using a constraints graph structure; (iii) we show how a simple holistic representation derived from raw aerial images can be used as a basic building block of the constraints graph in a manner which achieves both high registration accuracy and speed; (iv) lastly, we introduce a new and, to the best of our knowledge, the only data corpus suitable for the evaluation of set-based aerial image registration algorithms. Using this data set, we demonstrate (i) that the proposed method outperforms the state-of-the-art for pair-wise registration already, achieving greater accuracy and reliability, while at the same time reducing the computational cost of the task and (ii) that the increase in the number of available images in a set consistently reduces the average registration error, with a major difference already for a single additional image.

A hybrid method to improve target registration accuracy in surgical navigation

Background: The accuracy of surgical navigation depends greatly on that of registration between the patient and the medical image. Point-based registration has been the most common and reliable method, which typically uses skin markers. Unfortunately, high registration accuracy around the markers is not sustained at targets deeply seated within the body. To address such increase in target registration error (TRE), we proposed a hybrid point-based registration method that incorporates anatomical landmarks near the target. Material and methods: Ultrasound calibration is performed with an optical tracker for coordinate frame conversion of image coordinates into the real world. With the calibrated ultrasound probe, we could non-invasively obtain landmark positions near the target, being used together with skin markers for registration. Results: In the experiment, we examined registration accuracies achieved with and without use of an anatomical landmark. We confirmed that using an additional anatomical landmark in registration resulted in an increase in fiducial regsitration error (FRE), but a significant decrease in TRE (p < 0.001). Conclusion: We proposed and demonstrated the effectiveness of a hybrid method that uses both artificial and anatomical landmarks for patient-to-image registration. The experimental results confirmed that an improvement in TRE was evident by the proposed method, suggesting its feasibility in various spinal surgeries.

Ultrasound Guidance for Beating Heart Mitral Valve Repair Augmented by Synthetic Dynamic CT

Minimally invasive valvular intervention commonly requires intra-procedural navigation to provide spatial and temporal information of relevant cardiac structures and device components. Recently intra-procedural trans-esophageal echocardiography (TEE) has been exploited for this purpose due to its accessibility, low cost, ease of use, and real-time imaging capacity. However, the position and orientation of tissue targets relative to surgical tools can be challenging to perceive, particularly using 2D imaging planes. In this paper, we propose the use of CT images to provide a high-quality 3D context to enhance ultrasound images through image registration, providing an augmented guidance system with minimal impact on standard clinical workflow. We also describe an approach to generate synthetic 4D CT images through non-rigid registration of available ultrasound. This can be employed to avoid a requirement for higher radiation. Synthetic CT images were validated through direct comparison of synthetic and real multi-phase CT images. Validation of CT and ultrasound image registration was performed for both dynamic and synthetic CT image datasets. Our results demonstrated that the synthetically generated dynamic CT images provide similar anatomical representation for relevant cardiac anatomy relative to real dynamic CT images, and similar high registration accuracy that can be achieved for intra-procedural TEE to this versus real dynamic CT images.

Registration algorithm of point clouds based on multiscale normal features

The point cloud registration technology for obtaining a three-dimensional digital model is widely applied in many areas. To improve the accuracy and speed of point cloud registration, a registration method based on multiscale normal vectors is proposed. The proposed registration method mainly includes three parts: the selection of key points, the calculation of feature descriptors, and the determining and optimization of correspondences. First, key points are selected from the point cloud based on the changes of magnitude of multiscale curvatures obtained by using principal components analysis. Then the feature descriptor of each key point is proposed, which consists of 21 elements based on multiscale normal vectors and curvatures. The correspondences in a pair of two point clouds are determined according to the descriptor’s similarity of key points in the source point cloud and target point cloud. Correspondences are optimized by using a random sampling consistency algorithm and clustering technology. Finally, singular value decomposition is applied to optimized correspondences so that the rigid transformation matrix between two point clouds is obtained. Experimental results show that the proposed point cloud registration algorithm has a faster calculation speed, higher registration accuracy, and better antinoise performance.

Shiftable Leading Point Method for High Accuracy Registration of Airborne and Terrestrial LiDAR Data

A new automated approach to the high-accuracy registration of airborne and terrestrial LiDAR data is proposed, which has three primary steps. Firstly, airborne and terrestrial LiDAR data are used to extract building corners, known as airborne corners and terrestrial corners, respectively. Secondly, an initial matching relationship between the terrestrial corners and airborne corners is automatically derived using a matching technique based on maximum matching corner pairs with minimum errors (MTMM). Finally, a set of leading points are generated from matched airborne corners, and a shiftable leading point method is proposed. The key feature of this approach is the implementation of the concept of shiftable leading points in the final step. Since the geometric accuracy of terrestrial LiDAR data is much better than that of airborne LiDAR data, leading points corresponding to anomalous airborne corners could be modified for the improvement of the geometric accuracy of registration. The experiment demonstrates that the proposed approach can advance the geometric accuracy of two-platform LiDAR data registration effectively.

Position tracking of moving liver lesion based on real-time registration between 2D ultrasound and 3D preoperative images.

Registration between 2D ultrasound (US) and 3D preoperative magnetic resonance (MR) (or computed tomography, CT) images has been studied recently for US-guided intervention. However, the existing techniques have some limits, either in the registration speed or the performance. The purpose of this work is to develop a real-time and fully automatic registration system between two intermodal images of the liver, and subsequently an indirect lesion positioning/tracking algorithm based on the registration result, for image-guided interventions. The proposed position tracking system consists of three stages. In the preoperative stage, the authors acquire several 3D preoperative MR (or CT) images at different respiratory phases. Based on the transformations obtained from nonrigid registration of the acquired 3D images, they then generate a 4D preoperative image along the respiratory phase. In the intraoperative preparatory stage, they properly attach a 3D US transducer to the patient's body and fix its pose using a holding mechanism. They then acquire a couple of respiratory-controlled 3D US images. Via the rigid registration of these US images to the 3D preoperative images in the 4D image, the pose information of the fixed-pose 3D US transducer is determined with respect to the preoperative image coordinates. As feature(s) to use for the rigid registration, they may choose either internal liver vessels or the inferior vena cava. Since the latter is especially useful in patients with a diffuse liver disease, the authors newly propose using it. In the intraoperative real-time stage, they acquire 2D US images in real-time from the fixed-pose transducer. For each US image, they select candidates for its corresponding 2D preoperative slice from the 4D preoperative MR (or CT) image, based on the predetermined pose information of the transducer. The correct corresponding image is then found among those candidates via real-time 2D registration based on a gradient-based similarity measure. Finally, if needed, they obtain the position information of the liver lesion using the 3D preoperative image to which the registered 2D preoperative slice belongs. The proposed method was applied to 23 clinical datasets and quantitative evaluations were conducted. With the exception of one clinical dataset that included US images of extremely low quality, 22 datasets of various liver status were successfully applied in the evaluation. Experimental results showed that the registration error between the anatomical features of US and preoperative MR images is less than 3 mm on average. The lesion tracking error was also found to be less than 5 mm at maximum. A new system has been proposed for real-time registration between 2D US and successive multiple 3D preoperative MR/CT images of the liver and was applied for indirect lesion tracking for image-guided intervention. The system is fully automatic and robust even with images that had low quality due to patient status. Through visual examinations and quantitative evaluations, it was verified that the proposed system can provide high lesion tracking accuracy as well as high registration accuracy, at performance levels which were acceptable for various clinical applications.

A WTLS-Based Method for Remote Sensing Imagery Registration

This paper introduces a weighted total least squares (WTLS)-based estimator into image registration to deal with the coordinates of control points (CPs) that are of unequal accuracy. The performance of the estimator is investigated by means of simulation experiments using different coordinate errors. Comparisons with ordinary least squares (LS), total LS (TLS), scaled TLS, and weighted LS estimators are made. A novel adaptive weight determination scheme is applied to experiments with remotely sensed images. These illustrate the practicability and effectiveness of the proposed registration method by collecting CPs with different-sized errors from multiple reference images with different spatial resolutions. This paper concludes that the WTLS-based iteratively reweighted TLS method achieves a more robust estimation of model parameters and higher registration accuracy if heteroscedastic errors occur in both the coordinates of reference CPs and target CPs.

Combining coarse and fine registration for video frame super-resolution reconstruction

Video-frame registration is a critical step in the video super-resolution process. However, many existing registration methods can handle only small local neighborhood movements or overall affine transformations. This limits the reconstruction of fast moving or significantly deforming objects. We propose a super-resolution registration method for video reconstruction. Considerable effort has been directed toward single-video and multivideo super-resolution methods. We aim to obtain a higher registration accuracy that maximally employs video frames to reconstruct the current frame, particularly for moving or deforming objects. To this end, we provide a content-based registration algorithm based on a propagation matching algorithm and the Lucas–Kanade method. The super-resolution step is implemented using robust iterative minimization. We compare our algorithm to others and demonstrate that our algorithm achieves high registration accuracy and more effectively reconstructs fast moving and significantly deforming objects.

An improved two-stage image registration algorithm for super-resolution

This paper presents an improved two-stage image registration algorithm for super-resolution. The algorithm is based on the rotation–translation (RT) model and the coarse-to-fine strategy. It first uses the phase correlation algorithm to estimate large-scale displacements with pixel-level accuracy after image motion compensation, and then uses the Keren algorithm to obtain high-accuracy sub-pixel estimation. Moreover, from the non-commutative property between rotation and translation in the RT model, synthesis formulae are derived and used to combine the two results together, which could further improve the accuracy without extra computational costs. The algorithm can achieve high-accuracy sub-pixel registration for large-scale displacements, which also has the advantage of good computational efficiency. To illustrate the effectiveness of the algorithm, both simulations and practical super-resolution reconstruction experiments are performed. © 2014 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.

SU‐C‐18A‐04: 3D Markerless Registration of Lung Based On Coherent Point Drift: Application in Image Guided Radiotherapy

Purpose:This study evaluated a new probabilistic non‐rigid registration method called coherent point drift for real time 3D markerless registration of the lung motion during radiotherapy.Method:4DCT image datasets Dir‐lab (www.dir‐lab.com) have been used for creating 3D boundary element model of the lungs. For the first step, the 3D surface of the lungs in respiration phases T0 and T50 were segmented and divided into a finite number of linear triangular elements. Each triangle is a two dimensional object which has three vertices (each vertex has three degree of freedom). One of the main features of the lungs motion is velocity coherence so the vertices that creating the mesh of the lungs should also have features and degree of freedom of lung structure. This means that the vertices close to each other tend to move coherently. In the next step, we implemented a probabilistic non‐rigid registration method called coherent point drift to calculate nonlinear displacement of vertices between different expiratory phases.Results:The method has been applied to images of 10‐patients in Dir‐lab dataset. The normal distribution of vertices to the origin for each expiratory stage were calculated. The results shows that the maximum error of registration between different expiratory phases is less than 0.4 mm (0.38 SI, 0.33 mm AP, 0.29 mm RL direction). This method is a reliable method for calculating the vector of displacement, and the degrees of freedom (DOFs) of lung structure in radiotherapy.Conclusions:We evaluated a new 3D registration method for distribution set of vertices inside lungs mesh. In this technique, lungs motion considering velocity coherence are inserted as a penalty in regularization function. The results indicate that high registration accuracy is achievable with CPD. This method is helpful for calculating of displacement vector and analyzing possible physiological and anatomical changes during treatment.

Image registration algorithm using Mexican hat function-based operator and grouped feature matching strategy.

Feature detection and matching are crucial for robust and reliable image registration. Although many methods have been developed, they commonly focus on only one class of image features. The methods that combine two or more classes of features are still novel and significant. In this work, methods for feature detection and matching are proposed. A Mexican hat function-based operator is used for image feature detection, including the local area detection and the feature point detection. For the local area detection, we use the Mexican hat operator for image filtering, and then the zero-crossing points are extracted and merged into the area borders. For the feature point detection, the Mexican hat operator is performed in scale space to get the key points. After the feature detection, an image registration is achieved by using the two classes of image features. The feature points are grouped according to a standardized region that contains correspondence to the local area, precise registration is achieved eventually by the grouped points. An image transformation matrix is estimated by the feature points in a region and then the best one is chosen through competition of a set of the transformation matrices. This strategy has been named the Grouped Sample Consensus (GCS). The GCS has also ability for removing the outliers effectively. The experimental results show that the proposed algorithm has high registration accuracy and small computational volume.

Cooperative Moving Object Segmentation using Two Cameras based on Background Subtraction and Image Registration

Moving camera, such as PTZ (pan-tilt-zoom) camera, has been widely applied in visual surveillance system. However, it's difficult to extract moving objects because of the dynamic background caused by the camera motion. In this paper, a novel framework for moving object segmentation exploiting two cameras collaboration is presented by combining background subtraction and image registration method. The proposed method uses one static camera to capture large-view images at low resolution, and one moving camera (i.e. PTZ camera) to capture local-view images at high resolution. Different with methods using a single moving camera, the moving objects can be effectively segmented in the static camera image by background subtraction method. Then image registration method can be applied to extract moving region in the moving camera image. To deal with the resolution and intensity discrepancy between two synchronized images, we design a practical three-step image registration method, which has higher registration accuracy than traditional feature based method. Experimental results on outdoor scene demonstrate the effectiveness and robustness of proposed approach.

A Methodology of Three-Dimensional Medical Image Registration Based on Conformal Geometric Invariant

A three-dimensional multimodality medical image registration method using geometric invariant based on conformal geometric algebra (CGA) theory is put forward for responding to challenges resulting from many free degrees and computational burdens with 3D medical image registration problems. The mathematical model and calculation method of dual-vector projection invariant are established using the distribution characteristics of point cloud data and the point-to-plane distance-based measurement in CGA space. The translation operator and geometric rotation operator during registration operation are built in Clifford algebra (CA) space. The conformal geometrical algebra is used to realize the registration of 3D CT/MR-PD medical image data based on the dual vector geometric invariant. The registration experiment results indicate that the methodology proposed in this paper is of stronger commonality, less computation burden, shorter time consumption, and intuitive geometric meaning. Both subjective evaluation and objective indicators show that the methodology proposed here is of high registration accuracy and suitable for 3D medical image registration.

Validation of an Improved ‘Diffeomorphic Demons’ Algorithm for Deformable Image Registration in Image-Guided Radiation Therapy

Deformable image registration (DIR) was widely used in radiation therapy, such as in automatic contour generation, dose accumulation, tumor growth or regression analysis. To achieve higher registration accuracy and faster convergence, an improved 'diffeomorphic demons' registration algorithm was proposed and validated. Based on Brox et al.'s gradient constancy assumption and Malis's efficient second-order minimization (ESM) algorithm, a grey value gradient similarity term and a transformation error term were added into the demons energy function, and a formula was derived to calculate the update of transformation field. The limited Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) algorithm was used to optimize the energy function so that the iteration number could be determined automatically. The proposed algorithm was validated using mathematically deformed images and physically deformed phantom images. Compared with the original 'diffeomorphic demons' algorithm, the registration method proposed achieve a higher precision and a faster convergence speed. Due to the influence of different scanning conditions in fractionated radiation, the density range of the treatment image and the planning image may be different. In such a case, the improved demons algorithm can achieve faster and more accurate radiotherapy.

Automatic Registration Method for Fusion of ZY-1-02C Satellite Images

Automatic image registration (AIR) has been widely studied in the fields of medical imaging, computer vision, and remote sensing. In various cases, such as image fusion, high registration accuracy should be achieved to meet application requirements. For satellite images, the large image size and unstable positioning accuracy resulting from the limited manufacturing technology of charge-coupled device, focal plane distortion, and unrecorded spacecraft jitter lead to difficulty in obtaining agreeable corresponding points for registration using only area-based matching or feature-based matching. In this situation, a coarse-to-fine matching strategy integrating two types of algorithms is proven feasible and effective. In this paper, an AIR method for application to the fusion of ZY-1-02C satellite imagery is proposed. First, the images are geometrically corrected. Coarse matching, based on scale invariant feature transform, is performed for the subsampled corrected images, and a rough global estimation is made with the matching results. Harris feature points are then extracted, and the coordinates of the corresponding points are calculated according to the global estimation results. Precise matching is conducted, based on normalized cross correlation and least squares matching. As complex image distortion cannot be precisely estimated, a local estimation using the structure of triangulated irregular network is applied to eliminate the false matches. Finally, image resampling is conducted, based on local affine transformation, to achieve high-precision registration. Experiments with ZY-1-02C datasets demonstrate that the accuracy of the proposed method meets the requirements of fusion application, and its efficiency is also suitable for the commercial operation of the automatic satellite data process system.

Image Stitching based on Particle Swarm and Maximum Mutual Information Algorithm

As a key link in image stitching, image registration based on maximum mutual information does not need any preprocess and has a high degree of automation and high registration accuracy, which thus attracted widespread attention. Optimization search in image registration process is easy to fall into local minima leading to the wrong registration parameters. This paper presents a method to build image pyramid based on wavelet transformation and uses swarm intelligence classical particle swarm optimization method to adjust its parameters with the mutual information and multi-resolution series. Experiments show that this method can effectively avoid local minima and can find the optimal registration transformation by finite optimization iterations. Performance of this proposed algorithm is better than the traditional multi-resolution method and its computational efficiency is higher than that of simulated annealing optimization method.

Multi-view ladar data registration in obscure environment

Multi-view laser radar (ladar) data registration in obscure environments is an important research field of obscured target detection from air to ground. There are few overlap regions of the observational data in different views because of the occluder, so the multi-view data registration is rather difficult. Through in-depth analyses of the typical methods and problems, it is obtained that the sequence registration is more appropriate, but needs to improve the registration accuracy. On this basis, a multi-view data registration algorithm based on aggregating the adjacent frames, which are already registered, is proposed. It increases the overlap region between the pending registration frames by aggregation and further improves the registration accuracy. The experiment results show that the proposed algorithm can effectively register the multi-view ladar data in the obscure environment, and it also has a greater robustness and a higher registration accuracy compared with the sequence registration under the condition of equivalent operating efficiency.