The Dual - Bootstrap Iterative Closest Point Algorithm
نویسندگان
چکیده
منابع مشابه
Comparison of image registration methods for composing spectral retinal images
Spectral retinal images have signi cant potential for improving the early detection and visualization of subtle changes due to eye diseases and many systemic diseases. High resolution in both the spatial and the spectral domain can be achieved by capturing a set of narrowband channel images from which the spectral images are composed. With imaging techniques where the eye movement between the a...
متن کاملOn the Formulation of Closest-Point Projection Algorithms in Elastoplasticity. Part II: Globally Convergent Schemes
This paper presents the formulation of numerical algorithms for the solution of the closest-point projection equations that appear in typical implementations of return mapping algorithms in elastoplasticity. The main motivation behind this work is to avoid the poor global convergence properties of a straight application of a Newton scheme in the solution of these equations, the socalled Newton–...
متن کاملA bounded iterative closest point method for minimally invasive registration of the femur.
This article describes a novel method for image-based, minimally invasive registration of the femur, for application to computer-assisted unicompartmental knee arthroplasty. The method is adapted from the well-known iterative closest point algorithm. By utilising an estimate of the hip centre on both the preoperative model and intraoperative patient anatomy, the proposed 'bounded' iterative clo...
متن کاملRegistration of retinal images by a MAS-ICP approach – a preliminary study
Diabetic retinopathy has been revealed as the most common cause of blindness among people of working age. For monitoring the pathology image registration algorithms applied to retinal images is very useful. In this work, a novel vessel-based retinal image registration approach is proposed. The segmentation of the vasculature is performed by a multi-agent system model. All these information is t...
متن کاملAn approximate EM Homographical Iterative Closest Point algorithm
This paper describes an approximately expectationmaximization (EM) formulation of a homographical iterative closest point registration approach (henceforth HICP). We show that such an EM approach allows the algorithm to converge faster, and more robustly in the presence of noise. Although this algorithm can register points transformed by a more general set of linear transformations than the ori...
متن کامل