✦ LIBER ✦

Medical image registration using modified iterative closest points

✍ Scribed by Mei-sen Pan; Jing-tian Tang; Qiu-sheng Rong; Fen Zhang

Publisher: Wiley (John Wiley & Sons)
Year: 2010
Tongue: English
Weight: 406 KB
Volume: 27
Category: Article
ISSN: 2040-7939
DOI: 10.1002/cnm.1421

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Affine iterative closest point algorithm

Affine iterative closest point algorithm for point set registration

✍ Shaoyi Du; Nanning Zheng; Shihui Ying; Jianyi Liu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 799 KB

The traditional iterative closest point (ICP) algorithm is accurate and fast for rigid point set registration but it is unable to handle affine case. This paper instead introduces a novel generalized ICP algorithm based on lie group for affine registration of m-D point sets. First, with singular val

An iterative image registration techniqu

An iterative image registration technique using local affine transformation

✍ Toru Wakahara 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 821 KB

## Abstract For registration between images, algorithms of point correspondence searching type and deformation field analyzing type have been proposed in the past. The former had a problem of increasing processing quantity and the latter had a problem of assuming small displacement or deformation.

Registration of 3D multi-modality medica

Registration of 3D multi-modality medical images using surfaces and point landmarks

✍ André Collignon; Dirk Vandermeulen; Paul Suetens; Guy Marchal 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 520 KB

Compression of Dynamic 3D Geometry Data

Compression of Dynamic 3D Geometry Data Using Iterative Closest Point Algorithm

✍ Sumit Gupta; Kuntal Sengupta; Ashraf A. Kassim 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 299 KB

In this paper, we propose a new framework to perform motion compression for time-dependent 3D geometric data. Temporal coherence in dynamic geometric models can be used to achieve significant compression, thereby leading to efficient storage and transmission of large volumes of 3D data. The displace

Robust matching of 3D contours using ite

Robust matching of 3D contours using iterative closest point algorithm improved by M-estimation

✍ Shun'ichi Kaneko; Tomonori Kondo; Atsushi Miyamoto 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 333 KB

An extension of the iterative closest point matching by M-estimation is proposed for realization of robustness to non-overlapping data or outlying data in two sets of contour data or depth images for rigid bodies. An objective function which includes independent residual components for each of x, y

The convergence of an interior-point met

The convergence of an interior-point method using modified search directions in final iterations

✍ Weichung Wang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 765 KB

provide an asymptotic analysis of a primal-dual algorithm for linear programming that uses modified search directions in the final iterations. The algorithm determines the search directions by solving the normal equations using the preconditioned conjugate gradient algorithm. Small dual slack variab