Current Location:home > Detailed Browse

Article Detail

Fast least trimmed squares (Fast-LTS); Image registration; Parameter estimation; Random sample consensus (RANSAC); Weak affine transformation

Abstracts

A novel image registration scheme is devised in view of the weak affine transformation, which is a kind of similarity transformation with anisotropic scales or affine transformation without shearing. Two robust algorithms are proposed to retrieve the registration parameters from the error-prone initial correspondences based on the fast least trimmed squares (Fast-LTS) and the random sample consensus (RANSAC). In terms of several criteria, the algorithms are evaluated on three carefully selected datasets from different sensors and the experimental results demonstrate that the proposed scheme and algorithms perform robustly and accurately. Our findings also indicate that the Fast-LTS-based algorithm is more stable and appropriate for image registration than the RANSAC-based algorithm although the speed is slower. ?2012 Elsevier B.V. All rights reserved.
Download Comment Hits:1682 Downloads:854
Journal:Pattern Recognition Letters
Recommended references: Li, Dong,Zhang, Yunhua.(2017).Fast least trimmed squares (Fast-LTS); Image registration; Parameter estimation; Random sample consensus (RANSAC); Weak affine transformation.Pattern Recognition Letters.[ChinaXiv:201701.00027] (Click&Copy)
Version History
[V1] 2017-01-04 09:23:17 chinaXiv:201701.00027V1 Download
Related Paper

Download

Current Browse

Change Subject Browse

Cross Subject Browse

  • - NO