scholarly journals A Coarse-to-Fine Registration Strategy for Multi-Sensor Images with Large Resolution Differences

2019 ◽  
Vol 11 (4) ◽  
pp. 470 ◽  
Author(s):  
Kai Li ◽  
Yongsheng Zhang ◽  
Zhenchao Zhang ◽  
Guangling Lai
Keyword(s):  
Reference Image ◽  
Registration Accuracy ◽  
Registration Method ◽  
Normalized Mutual Information ◽  
Sensing Applications ◽  
Validation Experiment ◽  
Image Pairs ◽  
Coarse To Fine ◽  
Fine Registration ◽  
Three Phases

Automatic image registration for multi-sensors has always been an important task for remote sensing applications. However, registration for images with large resolution differences has not been fully considered. A coarse-to-fine registration strategy for images with large differences in resolution is presented. The strategy consists of three phases. First, the feature-base registration method is applied on the resampled sensed image and the reference image. Edge point features acquired from the edge strength map (ESM) of the images are used to pre-register two images quickly and robustly. Second, normalized mutual information-based registration is applied on the two images for more accurate transformation parameters. Third, the final transform parameters are acquired through direct registration between the original high- and low-resolution images. Ant colony optimization (ACO) for continuous domain is adopted to optimize the similarity metrics throughout the three phases. The proposed method has been tested on image pairs with different resolution ratios from different sensors, including satellite and aerial sensors. Control points (CPs) extracted from the images are used to calculate the registration accuracy of the proposed method and other state-of-the-art methods. The feature-based preregistration validation experiment shows that the proposed method effectively narrows the value range of registration parameters. The registration results indicate that the proposed method performs the best and achieves sub-pixel registration accuracy of images with resolution differences from 1 to 50 times.

scholarly journals SPPD: A Novel Reassembly Method for 3D Terracotta Warrior Fragments Based on Fracture Surface Information

2021 ◽  
Vol 10 (8) ◽  
pp. 525
Author(s):  
Wenmin Yao ◽  
Tong Chu ◽  
Wenlong Tang ◽  
Jingyu Wang ◽  
Xin Cao ◽  
...  
Keyword(s):  
Fracture Surface ◽  
Principal Component ◽  
Point Clouds ◽  
Three Dimension ◽  
Registration Method ◽  
Series Of Experiments ◽  
Coarse To Fine ◽  
Fine Registration ◽  
Common Situation ◽  
Better Than

As one of China′s most precious cultural relics, the excavation and protection of the Terracotta Warriors pose significant challenges to archaeologists. A fairly common situation in the excavation is that the Terracotta Warriors are mostly found in the form of fragments, and manual reassembly among numerous fragments is laborious and time-consuming. This work presents a fracture-surface-based reassembling method, which is composed of SiamesePointNet, principal component analysis (PCA), and deep closest point (DCP), and is named SPPD. Firstly, SiamesePointNet is proposed to determine whether a pair of point clouds of 3D Terracotta Warrior fragments can be reassembled. Then, a coarse-to-fine registration method based on PCA and DCP is proposed to register the two fragments into a reassembled one. The above two steps iterate until the termination condition is met. A series of experiments on real-world examples are conducted, and the results demonstrate that the proposed method performs better than the conventional reassembling methods. We hope this work can provide a valuable tool for the virtual restoration of three-dimension cultural heritage artifacts.

scholarly journals A Novel Coarse-to-Fine Scheme for Remote Sensing Image Registration Based on SIFT and Phase Correlation

2019 ◽  
Vol 11 (15) ◽  
pp. 1833 ◽  
Author(s):  
Han Yang ◽  
Xiaorun Li ◽  
Liaoying Zhao ◽  
Shuhan Chen
Keyword(s):  
Remote Sensing ◽  
Image Registration ◽  
Phase Correlation ◽  
Mean Square ◽  
Extended Phase ◽  
Registration Method ◽  
Coarse Registration ◽  
Feature Based ◽  
Coarse To Fine ◽  
Fine Registration

Automatic image registration has been wildly used in remote sensing applications. However, the feature-based registration method is sometimes inaccurate and unstable for images with large scale difference, grayscale and texture differences. In this manuscript, a coarse-to-fine registration scheme is proposed, which combines the advantage of feature-based registration and phase correlation-based registration. The scheme consists of four steps. First, feature-based registration method is adopted for coarse registration. A geometrical outlier removal method is applied to improve the accuracy of coarse registration, which uses geometric similarities of inliers. Then, the sensed image is modified through the coarse registration result under affine deformation model. After that, the modified sensed image is registered to the reference image by extended phase correlation. Lastly, the final registration results are calculated by the fusion of the coarse registration and the fine registration. High universality of feature-based registration and high accuracy of extended phase correlation-based registration are both preserved in the proposed method. Experimental results of several different remote sensing images, which come from several published image registration papers, demonstrate the high robustness and accuracy of the proposed method. The evaluation contains root mean square error (RMSE), Laplace mean square error (LMSE) and red–green image registration results.

scholarly journals Improving Co-Registration for Sentinel-1 SAR and Sentinel-2 Optical Images

2021 ◽  
Vol 13 (5) ◽  
pp. 928
Author(s):  
Yuanxin Ye ◽  
Chao Yang ◽  
Bai Zhu ◽  
Liang Zhou ◽  
Youquan He ◽  
...  
Keyword(s):  
European Space Agency ◽  
Phase Correlation ◽  
Optical Data ◽  
Geometric Transformation ◽  
Interest Points ◽  
Registration Accuracy ◽  
Registration Method ◽  
Sensing Applications ◽  
Optical Images ◽  
Sentinel 2

Co-registering the Sentinel-1 Synthetic Aperture Radar (SAR) and Sentinel-2 optical data of the European Space Agency (ESA) is of great importance for many remote sensing applications. However, we find that there are evident misregistration shifts between the Sentinel-1 SAR and Sentinel-2 optical images that are directly downloaded from the official website. To address that, this paper presents a fast and effective registration method for the two types of images. In the proposed method, a block-based scheme is first designed to extract evenly distributed interest points. Then, the correspondences are detected by using the similarity of structural features between the SAR and optical images, where the three-dimensional (3D) phase correlation (PC) is used as the similarity measure for accelerating image matching. Lastly, the obtained correspondences are employed to measure the misregistration shifts between the images. Moreover, to eliminate the misregistration, we use some representative geometric transformation models such as polynomial models, projective models, and rational function models for the co-registration of the two types of images, and we compare and analyze their registration accuracy under different numbers of control points and different terrains. Six pairs of the Sentinel-1 SAR L1 and Sentinel-2 optical L1C images covering three different terrains are tested in our experiments. Experimental results show that the proposed method can achieve precise correspondences between the images, and the third-order polynomial achieves the most satisfactory registration results. Its registration accuracy of the flat areas is less than 1.0 10 m pixel, that of the hilly areas is about 1.5 10 m pixels, and that of the mountainous areas is between 1.7 and 2.3 10 m pixels, which significantly improves the co-registration accuracy of the Sentinel-1 SAR and Sentinel-2 optical images.

A coarse-to-fine registration method for three-dimensional MR images

2021 ◽  
Vol 59 (2) ◽  
pp. 457-469
Author(s):  
Cuixia Li ◽  
Yuanyuan Zhou ◽  
Yinghao Li ◽  
Shanshan Yang
Keyword(s):  
Three Dimensional ◽  
Mr Images ◽  
Registration Method ◽  
Coarse To Fine ◽  
Fine Registration

scholarly journals An Infrared-Visible Image Registration Method Based on the Constrained Point Feature

Sensors ◽  
2021 ◽  
Vol 21 (4) ◽  
pp. 1188
Author(s):  
Qingqing Li ◽  
Guangliang Han ◽  
Peixun Liu ◽  
Hang Yang ◽  
Huiyuan Luo ◽  
...  
Keyword(s):  
Image Registration ◽  
Evaluation Method ◽  
Detection Algorithm ◽  
Feature Descriptor ◽  
Registration Accuracy ◽  
Visible Image ◽  
Registration Method ◽  
Visible Images ◽  
Image Pairs ◽  
Point Feature

It is difficult to find correct correspondences for infrared and visible image registration because of different imaging principles. Traditional registration methods based on the point feature require designing the complicated feature descriptor and eliminate mismatched points, which results in unsatisfactory precision and much calculation time. To tackle these problems, this paper presents an artful method based on constrained point features to align infrared and visible images. The proposed method principally contains three steps. First, constrained point features are extracted by employing an object detection algorithm, which avoids constructing the complex feature descriptor and introduces the senior semantic information to improve the registration accuracy. Then, the left value rule (LV-rule) is designed to match constrained points strictly without the deletion of mismatched and redundant points. Finally, the affine transformation matrix is calculated according to matched point pairs. Moreover, this paper presents an evaluation method to automatically estimate registration accuracy. The proposed method is tested on a public dataset. Among all tested infrared-visible image pairs, registration results demonstrate that the proposed framework outperforms five state-of-the-art registration algorithms in terms of accuracy, speed, and robustness.

scholarly journals REGISTRATION OF MMS LiDAR POINTS AND PANORAMIC IMAGE SEQUENCE USING RELATIVE ORIENTATION MODEL

2020 ◽  
Vol XLIII-B1-2020 ◽  
pp. 291-298
Author(s):  
N. Zhu ◽  
B. Yang ◽  
Y. Jia
Keyword(s):  
Image Sequence ◽  
Relative Orientation ◽  
Panoramic Image ◽  
Feature Points ◽  
Registration Accuracy ◽  
Registration Method ◽  
Orientation Model ◽  
Panoramic Images ◽  
Image Pairs ◽  
Ransac Algorithm

Abstract. We propose using the relative orientation model (ROM) of panoramic to register the MMS LiDAR points and panoramic image sequence, which has the wide applicability. The feature points, extracted and matched from panoramic image pairs, are used to solve the relative position and attitude parameters in the ROM, then, combining the absolute position and attitude parameters of the initial panoramic image, the MMS LiDAR points and panoramic image sequence are registered. First, we propose the position/attitude ROM (PA-ROM) and attitude ROM (A-ROM) of panoramic images respectively, which are apply to the position/attitude parameters both unknown and only the attitude parameters unknown. Second, we automatically extract and match feature points from panoramic image pairs using the SURF algorithm, as these mismatching points will affect the registration accuracy, the RANSAC algorithm and ROM were used to choose the best matching points automatically. Finally, we select the feature points manually from MMS LiDAR points and panoramic image sequence as the checkpoints, and then compare the registration accuracy of continuous/discontinuous panoramic image pairs. The results show that MMS LiDAR points and panoramic image sequence are registered accurately based on ROM (7.36 and 3.75 pixels in dataset I and II), what's more, our registration method just tackle the image pairs (uninvolved LiDAR points), so it is suitable for more road scenes.

A Coarse-to-Fine Registration on 3D Multi-Phase Abdominal CT Images

2020 ◽  
Vol 12 (7) ◽  
pp. 909-914
Author(s):  
Shao-Di Yang ◽  
Fan Zhang ◽  
Zhen Yang ◽  
Xiao-Yu Yang ◽  
Shu-Zhou Li
Keyword(s):  
Three Dimensional ◽  
Ct Images ◽  
Abdominal Ct ◽  
Registration Method ◽  
Coarse Registration ◽  
Multi Phase ◽  
Coarse To Fine ◽  
Aided Diagnosis ◽  
Fine Registration ◽  
Spatial Regularization

Registration is a technical support for the integration of nanomaterial imaging-aided diagnosis and treatment. In this paper, a coarse-to-fine three-dimensional (3D) multi-phase abdominal CT images registration method is proposed. Firstly, a linear model is used to coarsely register the paired multiphase images. Secondly, an intensity-based registration framework is proposed, which contains the data and spatial regularization terms and performs fine registration on the paired images obtained in the coarse registration step. The results illustrate that the proposed method is superior to some existing methods with the average MSE, PSNR, and SSIM values of 0.0082, 21.2695, and 0.8956, respectively. Therefore, the proposed method provides an efficient and robust framework for 3D multi-phase abdominal CT images registration.

scholarly journals Robust Coarse-to-Fine Registration Scheme for Mobile Laser Scanner Point Clouds Using Multiscale Eigenvalue Statistic-Based Descriptor

Sensors ◽  
2021 ◽  
Vol 21 (7) ◽  
pp. 2431
Author(s):  
Yongjian Fu ◽  
Zongchun Li ◽  
Wenqi Wang ◽  
Hua He ◽  
Feng Xiong ◽  
...  
Keyword(s):  
Laser Scanner ◽  
Point Clouds ◽  
Target Point ◽  
Registration Method ◽  
Geometric Consistency ◽  
Coarse Registration ◽  
Eigenvalue Statistic ◽  
Pairwise Registration ◽  
Coarse To Fine ◽  
Fine Registration

To overcome the drawbacks of pairwise registration for mobile laser scanner (MLS) point clouds, such as difficulty in searching the corresponding points and inaccuracy registration matrix, a robust coarse-to-fine registration method is proposed to align different frames of MLS point clouds into a common coordinate system. The method identifies the correct corresponding point pairs from the source and target point clouds, and then calculates the transform matrix. First, the performance of a multiscale eigenvalue statistic-based descriptor with different combinations of parameters is evaluated to identify the optimal combination. Second, based on the geometric distribution of points in the neighborhood of the keypoint, a weighted covariance matrix is constructed, by which the multiscale eigenvalues are calculated as the feature description language. Third, the corresponding points between the source and target point clouds are estimated in the feature space, and the incorrect ones are eliminated via a geometric consistency constraint. Finally, the estimated corresponding point pairs are used for coarse registration. The value of coarse registration is regarded as the initial value for the iterative closest point algorithm. Subsequently, the final fine registration result is obtained. The results of the registration experiments with Autonomous Systems Lab (ASL) Datasets show that the proposed method can accurately align MLS point clouds in different frames and outperform the comparative methods.

scholarly journals A Coarse-to-Fine Registration Approach for Point Cloud Data with Bipartite Graph Structure

Electronics ◽  
2022 ◽  
Vol 11 (2) ◽  
pp. 263
Author(s):  
Munan Yuan ◽  
Xiru Li ◽  
Longle Cheng ◽  
Xiaofeng Li ◽  
Haibo Tan
Keyword(s):  
Bipartite Graph ◽  
Point Cloud ◽  
Graph Matching ◽  
Data Sets ◽  
Graph Structure ◽  
Point Cloud Data ◽  
Cloud Data ◽  
Alignment Process ◽  
Coarse To Fine ◽  
Fine Registration

Alignment is a critical aspect of point cloud data (PCD) processing, and we propose a coarse-to-fine registration method based on bipartite graph matching in this paper. After data pre-processing, the registration progress can be detailed as follows: Firstly, a top-tail (TT) strategy is designed to normalize and estimate the scale factor of two given PCD sets, which can combine with the coarse alignment process flexibly. Secondly, we utilize the 3D scale-invariant feature transform (3D SIFT) method to extract point features and adopt fast point feature histograms (FPFH) to describe corresponding feature points simultaneously. Thirdly, we construct a similarity weight matrix of the source and target point data sets with bipartite graph structure. Moreover, the similarity weight threshold is used to reject some bipartite graph matching error-point pairs, which determines the dependencies of two data sets and completes the coarse alignment process. Finally, we introduce the trimmed iterative closest point (TrICP) algorithm to perform fine registration. A series of extensive experiments have been conducted to validate that, compared with other algorithms based on ICP and several representative coarse-to-fine alignment methods, the registration accuracy and efficiency of our method are more stable and robust in various scenes and are especially more applicable with scale factors.

Sign in / Sign up

Export Citation Format

Share Document