High performance deformable image registration algorithms for manycore processors

CERN Document Server

Shackleford, James; Sharp, Gregory

2013-01-01

High Performance Deformable Image Registration Algorithms for Manycore Processors develops highly data-parallel image registration algorithms suitable for use on modern multi-core architectures, including graphics processing units (GPUs). Focusing on deformable registration, we show how to develop data-parallel versions of the registration algorithm suitable for execution on the GPU. Image registration is the process of aligning two or more images into a common coordinate frame and is a fundamental step to be able to compare or fuse data obtained from different sensor measurements. E

A novel Gravity-FREAK feature extraction and Gravity-KLT tracking registration algorithm based on iPhone MEMS mobile sensor in mobile environment.

Science.gov (United States)

Hong, Zhiling; Lin, Fan; Xiao, Bin

2017-01-01

Based on the traditional Fast Retina Keypoint (FREAK) feature description algorithm, this paper proposed a Gravity-FREAK feature description algorithm based on Micro-electromechanical Systems (MEMS) sensor to overcome the limited computing performance and memory resources of mobile devices and further improve the reality interaction experience of clients through digital information added to the real world by augmented reality technology. The algorithm takes the gravity projection vector corresponding to the feature point as its feature orientation, which saved the time of calculating the neighborhood gray gradient of each feature point, reduced the cost of calculation and improved the accuracy of feature extraction. In the case of registration method of matching and tracking natural features, the adaptive and generic corner detection based on the Gravity-FREAK matching purification algorithm was used to eliminate abnormal matches, and Gravity Kaneda-Lucas Tracking (KLT) algorithm based on MEMS sensor can be used for the tracking registration of the targets and robustness improvement of tracking registration algorithm under mobile environment.

A multicore based parallel image registration method.

Science.gov (United States)

Yang, Lin; Gong, Leiguang; Zhang, Hong; Nosher, John L; Foran, David J

2009-01-01

Image registration is a crucial step for many image-assisted clinical applications such as surgery planning and treatment evaluation. In this paper we proposed a landmark based nonlinear image registration algorithm for matching 2D image pairs. The algorithm was shown to be effective and robust under conditions of large deformations. In landmark based registration, the most important step is establishing the correspondence among the selected landmark points. This usually requires an extensive search which is often computationally expensive. We introduced a nonregular data partition algorithm using the K-means clustering algorithm to group the landmarks based on the number of available processing cores. The step optimizes the memory usage and data transfer. We have tested our method using IBM Cell Broadband Engine (Cell/B.E.) platform.

A Joint Land Cover Mapping and Image Registration Algorithm Based on a Markov Random Field Model

Directory of Open Access Journals (Sweden)

Apisit Eiumnoh

2013-10-01

Full Text Available Traditionally, image registration of multi-modal and multi-temporal images is performed satisfactorily before land cover mapping. However, since multi-modal and multi-temporal images are likely to be obtained from different satellite platforms and/or acquired at different times, perfect alignment is very difficult to achieve. As a result, a proper land cover mapping algorithm must be able to correct registration errors as well as perform an accurate classification. In this paper, we propose a joint classification and registration technique based on a Markov random field (MRF model to simultaneously align two or more images and obtain a land cover map (LCM of the scene. The expectation maximization (EM algorithm is employed to solve the joint image classification and registration problem by iteratively estimating the map parameters and approximate posterior probabilities. Then, the maximum a posteriori (MAP criterion is used to produce an optimum land cover map. We conducted experiments on a set of four simulated images and one pair of remotely sensed images to investigate the effectiveness and robustness of the proposed algorithm. Our results show that, with proper selection of a critical MRF parameter, the resulting LCMs derived from an unregistered image pair can achieve an accuracy that is as high as when images are perfectly aligned. Furthermore, the registration error can be greatly reduced.

Control over structure-specific flexibility improves anatomical accuracy for point-based deformable registration in bladder cancer radiotherapy.

Science.gov (United States)

Wognum, S; Bondar, L; Zolnay, A G; Chai, X; Hulshof, M C C M; Hoogeman, M S; Bel, A

2013-02-01

Future developments in image guided adaptive radiotherapy (IGART) for bladder cancer require accurate deformable image registration techniques for the precise assessment of tumor and bladder motion and deformation that occur as a result of large bladder volume changes during the course of radiotherapy treatment. The aim was to employ an extended version of a point-based deformable registration algorithm that allows control over tissue-specific flexibility in combination with the authors' unique patient dataset, in order to overcome two major challenges of bladder cancer registration, i.e., the difficulty in accounting for the difference in flexibility between the bladder wall and tumor and the lack of visible anatomical landmarks for validation. The registration algorithm used in the current study is an extension of the symmetric-thin plate splines-robust point matching (S-TPS-RPM) algorithm, a symmetric feature-based registration method. The S-TPS-RPM algorithm has been previously extended to allow control over the degree of flexibility of different structures via a weight parameter. The extended weighted S-TPS-RPM algorithm was tested and validated on CT data (planning- and four to five repeat-CTs) of five urinary bladder cancer patients who received lipiodol injections before radiotherapy. The performance of the weighted S-TPS-RPM method, applied to bladder and tumor structures simultaneously, was compared with a previous version of the S-TPS-RPM algorithm applied to bladder wall structure alone and with a simultaneous nonweighted S-TPS-RPM registration of the bladder and tumor structures. Performance was assessed in terms of anatomical and geometric accuracy. The anatomical accuracy was calculated as the residual distance error (RDE) of the lipiodol markers and the geometric accuracy was determined by the surface distance, surface coverage, and inverse consistency errors. Optimal parameter values for the flexibility and bladder weight parameters were determined

Control over structure-specific flexibility improves anatomical accuracy for point-based deformable registration in bladder cancer radiotherapy

International Nuclear Information System (INIS)

Wognum, S.; Chai, X.; Hulshof, M. C. C. M.; Bel, A.; Bondar, L.; Zolnay, A. G.; Hoogeman, M. S.

2013-01-01

Purpose: Future developments in image guided adaptive radiotherapy (IGART) for bladder cancer require accurate deformable image registration techniques for the precise assessment of tumor and bladder motion and deformation that occur as a result of large bladder volume changes during the course of radiotherapy treatment. The aim was to employ an extended version of a point-based deformable registration algorithm that allows control over tissue-specific flexibility in combination with the authors’ unique patient dataset, in order to overcome two major challenges of bladder cancer registration, i.e., the difficulty in accounting for the difference in flexibility between the bladder wall and tumor and the lack of visible anatomical landmarks for validation. Methods: The registration algorithm used in the current study is an extension of the symmetric-thin plate splines-robust point matching (S-TPS-RPM) algorithm, a symmetric feature-based registration method. The S-TPS-RPM algorithm has been previously extended to allow control over the degree of flexibility of different structures via a weight parameter. The extended weighted S-TPS-RPM algorithm was tested and validated on CT data (planning- and four to five repeat-CTs) of five urinary bladder cancer patients who received lipiodol injections before radiotherapy. The performance of the weighted S-TPS-RPM method, applied to bladder and tumor structures simultaneously, was compared with a previous version of the S-TPS-RPM algorithm applied to bladder wall structure alone and with a simultaneous nonweighted S-TPS-RPM registration of the bladder and tumor structures. Performance was assessed in terms of anatomical and geometric accuracy. The anatomical accuracy was calculated as the residual distance error (RDE) of the lipiodol markers and the geometric accuracy was determined by the surface distance, surface coverage, and inverse consistency errors. Optimal parameter values for the flexibility and bladder weight

Control over structure-specific flexibility improves anatomical accuracy for point-based deformable registration in bladder cancer radiotherapy

Energy Technology Data Exchange (ETDEWEB)

Wognum, S.; Chai, X.; Hulshof, M. C. C. M.; Bel, A. [Department of Radiotherapy, Academic Medical Center, Meiberdreef 9, 1105 AZ Amsterdam (Netherlands); Bondar, L.; Zolnay, A. G.; Hoogeman, M. S. [Department of Radiation Oncology, Daniel den Hoed Cancer Center, Erasmus Medical Center, Groene Hilledijk 301, 3075 EA Rotterdam (Netherlands)

2013-02-15

Purpose: Future developments in image guided adaptive radiotherapy (IGART) for bladder cancer require accurate deformable image registration techniques for the precise assessment of tumor and bladder motion and deformation that occur as a result of large bladder volume changes during the course of radiotherapy treatment. The aim was to employ an extended version of a point-based deformable registration algorithm that allows control over tissue-specific flexibility in combination with the authors' unique patient dataset, in order to overcome two major challenges of bladder cancer registration, i.e., the difficulty in accounting for the difference in flexibility between the bladder wall and tumor and the lack of visible anatomical landmarks for validation. Methods: The registration algorithm used in the current study is an extension of the symmetric-thin plate splines-robust point matching (S-TPS-RPM) algorithm, a symmetric feature-based registration method. The S-TPS-RPM algorithm has been previously extended to allow control over the degree of flexibility of different structures via a weight parameter. The extended weighted S-TPS-RPM algorithm was tested and validated on CT data (planning- and four to five repeat-CTs) of five urinary bladder cancer patients who received lipiodol injections before radiotherapy. The performance of the weighted S-TPS-RPM method, applied to bladder and tumor structures simultaneously, was compared with a previous version of the S-TPS-RPM algorithm applied to bladder wall structure alone and with a simultaneous nonweighted S-TPS-RPM registration of the bladder and tumor structures. Performance was assessed in terms of anatomical and geometric accuracy. The anatomical accuracy was calculated as the residual distance error (RDE) of the lipiodol markers and the geometric accuracy was determined by the surface distance, surface coverage, and inverse consistency errors. Optimal parameter values for the flexibility and bladder weight

A block matching-based registration algorithm for localization of locally advanced lung tumors

Energy Technology Data Exchange (ETDEWEB)

Robertson, Scott P.; Weiss, Elisabeth; Hugo, Geoffrey D., E-mail: gdhugo@vcu.edu [Department of Radiation Oncology, Virginia Commonwealth University, Richmond, Virginia, 23298 (United States)

2014-04-15

Purpose: To implement and evaluate a block matching-based registration (BMR) algorithm for locally advanced lung tumor localization during image-guided radiotherapy. Methods: Small (1 cm{sup 3}), nonoverlapping image subvolumes (“blocks”) were automatically identified on the planning image to cover the tumor surface using a measure of the local intensity gradient. Blocks were independently and automatically registered to the on-treatment image using a rigid transform. To improve speed and robustness, registrations were performed iteratively from coarse to fine image resolution. At each resolution, all block displacements having a near-maximum similarity score were stored. From this list, a single displacement vector for each block was iteratively selected which maximized the consistency of displacement vectors across immediately neighboring blocks. These selected displacements were regularized using a median filter before proceeding to registrations at finer image resolutions. After evaluating all image resolutions, the global rigid transform of the on-treatment image was computed using a Procrustes analysis, providing the couch shift for patient setup correction. This algorithm was evaluated for 18 locally advanced lung cancer patients, each with 4–7 weekly on-treatment computed tomography scans having physician-delineated gross tumor volumes. Volume overlap (VO) and border displacement errors (BDE) were calculated relative to the nominal physician-identified targets to establish residual error after registration. Results: Implementation of multiresolution registration improved block matching accuracy by 39% compared to registration using only the full resolution images. By also considering multiple potential displacements per block, initial errors were reduced by 65%. Using the final implementation of the BMR algorithm, VO was significantly improved from 77% ± 21% (range: 0%–100%) in the initial bony alignment to 91% ± 8% (range: 56%–100%;p < 0

A block matching-based registration algorithm for localization of locally advanced lung tumors

International Nuclear Information System (INIS)

Robertson, Scott P.; Weiss, Elisabeth; Hugo, Geoffrey D.

2014-01-01

Purpose: To implement and evaluate a block matching-based registration (BMR) algorithm for locally advanced lung tumor localization during image-guided radiotherapy. Methods: Small (1 cm 3 ), nonoverlapping image subvolumes (“blocks”) were automatically identified on the planning image to cover the tumor surface using a measure of the local intensity gradient. Blocks were independently and automatically registered to the on-treatment image using a rigid transform. To improve speed and robustness, registrations were performed iteratively from coarse to fine image resolution. At each resolution, all block displacements having a near-maximum similarity score were stored. From this list, a single displacement vector for each block was iteratively selected which maximized the consistency of displacement vectors across immediately neighboring blocks. These selected displacements were regularized using a median filter before proceeding to registrations at finer image resolutions. After evaluating all image resolutions, the global rigid transform of the on-treatment image was computed using a Procrustes analysis, providing the couch shift for patient setup correction. This algorithm was evaluated for 18 locally advanced lung cancer patients, each with 4–7 weekly on-treatment computed tomography scans having physician-delineated gross tumor volumes. Volume overlap (VO) and border displacement errors (BDE) were calculated relative to the nominal physician-identified targets to establish residual error after registration. Results: Implementation of multiresolution registration improved block matching accuracy by 39% compared to registration using only the full resolution images. By also considering multiple potential displacements per block, initial errors were reduced by 65%. Using the final implementation of the BMR algorithm, VO was significantly improved from 77% ± 21% (range: 0%–100%) in the initial bony alignment to 91% ± 8% (range: 56%–100%;p < 0.001). Left

TPS-HAMMER: improving HAMMER registration algorithm by soft correspondence matching and thin-plate splines based deformation interpolation.

Science.gov (United States)

Wu, Guorong; Yap, Pew-Thian; Kim, Minjeong; Shen, Dinggang

2010-02-01

We present an improved MR brain image registration algorithm, called TPS-HAMMER, which is based on the concepts of attribute vectors and hierarchical landmark selection scheme proposed in the highly successful HAMMER registration algorithm. We demonstrate that TPS-HAMMER algorithm yields better registration accuracy, robustness, and speed over HAMMER owing to (1) the employment of soft correspondence matching and (2) the utilization of thin-plate splines (TPS) for sparse-to-dense deformation field generation. These two aspects can be integrated into a unified framework to refine the registration iteratively by alternating between soft correspondence matching and dense deformation field estimation. Compared with HAMMER, TPS-HAMMER affords several advantages: (1) unlike the Gaussian propagation mechanism employed in HAMMER, which can be slow and often leaves unreached blotches in the deformation field, the deformation interpolation in the non-landmark points can be obtained immediately with TPS in our algorithm; (2) the smoothness of deformation field is preserved due to the nice properties of TPS; (3) possible misalignments can be alleviated by allowing the matching of the landmarks with a number of possible candidate points and enforcing more exact matches in the final stages of the registration. Extensive experiments have been conducted, using the original HAMMER as a comparison baseline, to validate the merits of TPS-HAMMER. The results show that TPS-HAMMER yields significant improvement in both accuracy and speed, indicating high applicability for the clinical scenario. Copyright (c) 2009 Elsevier Inc. All rights reserved.

A novel Gravity-FREAK feature extraction and Gravity-KLT tracking registration algorithm based on iPhone MEMS mobile sensor in mobile environment.

Directory of Open Access Journals (Sweden)

Zhiling Hong

Full Text Available Based on the traditional Fast Retina Keypoint (FREAK feature description algorithm, this paper proposed a Gravity-FREAK feature description algorithm based on Micro-electromechanical Systems (MEMS sensor to overcome the limited computing performance and memory resources of mobile devices and further improve the reality interaction experience of clients through digital information added to the real world by augmented reality technology. The algorithm takes the gravity projection vector corresponding to the feature point as its feature orientation, which saved the time of calculating the neighborhood gray gradient of each feature point, reduced the cost of calculation and improved the accuracy of feature extraction. In the case of registration method of matching and tracking natural features, the adaptive and generic corner detection based on the Gravity-FREAK matching purification algorithm was used to eliminate abnormal matches, and Gravity Kaneda-Lucas Tracking (KLT algorithm based on MEMS sensor can be used for the tracking registration of the targets and robustness improvement of tracking registration algorithm under mobile environment.

Fiducial-based registration with a touchable region model.

Science.gov (United States)

Kim, Sungmin; Kazanzides, Peter

2017-02-01

Image-guided surgery requires registration between an image coordinate system and an intraoperative coordinate system that is typically referenced to a tracking device. In fiducial-based registration methods, this is achieved by localizing points (fiducials) in each coordinate system. Often, both localizations are performed manually, first by picking a fiducial point in the image and then by using a hand-held tracked pointer to physically touch the corresponding fiducial on the patient. These manual procedures introduce localization error that is user-dependent and can significantly decrease registration accuracy. Thus, there is a need for a registration method that is tolerant of imprecise fiducial localization in the preoperative and intraoperative phases. We propose the iterative closest touchable point (ICTP) registration framework, which uses model-based localization and a touchable region model. This method consists of three stages: (1) fiducial marker localization in image space, using a fiducial marker model, (2) initial registration with paired-point registration, and (3) fine registration based on the iterative closest point method. We perform phantom experiments with a fiducial marker design that is commonly used in neurosurgery. The results demonstrate that ICTP can provide accuracy improvements compared to the standard paired-point registration method that is widely used for surgical navigation and surgical robot systems, especially in cases where the surgeon introduces large localization errors. The results demonstrate that the proposed method can reduce the effect of the surgeon's localization performance on the accuracy of registration, thereby producing more consistent and less user-dependent registration outcomes.

Canny edge-based deformable image registration.

Science.gov (United States)

Kearney, Vasant; Huang, Yihui; Mao, Weihua; Yuan, Baohong; Tang, Liping

2017-02-07

This work focuses on developing a 2D Canny edge-based deformable image registration (Canny DIR) algorithm to register in vivo white light images taken at various time points. This method uses a sparse interpolation deformation algorithm to sparsely register regions of the image with strong edge information. A stability criterion is enforced which removes regions of edges that do not deform in a smooth uniform manner. Using a synthetic mouse surface ground truth model, the accuracy of the Canny DIR algorithm was evaluated under axial rotation in the presence of deformation. The accuracy was also tested using fluorescent dye injections, which were then used for gamma analysis to establish a second ground truth. The results indicate that the Canny DIR algorithm performs better than rigid registration, intensity corrected Demons, and distinctive features for all evaluation matrices and ground truth scenarios. In conclusion Canny DIR performs well in the presence of the unique lighting and shading variations associated with white-light-based image registration.

Study on Low Illumination Simultaneous Polarization Image Registration Based on Improved SURF Algorithm

Science.gov (United States)

Zhang, Wanjun; Yang, Xu

2017-12-01

Registration of simultaneous polarization images is the premise of subsequent image fusion operations. However, in the process of shooting all-weather, the polarized camera exposure time need to be kept unchanged, sometimes polarization images under low illumination conditions due to too dark result in SURF algorithm can not extract feature points, thus unable to complete the registration, therefore this paper proposes an improved SURF algorithm. Firstly, the luminance operator is used to improve overall brightness of low illumination image, and then create integral image, using Hession matrix to extract the points of interest to get the main direction of characteristic points, calculate Haar wavelet response in X and Y directions to get the SURF descriptor information, then use the RANSAC function to make precise matching, the function can eliminate wrong matching points and improve accuracy rate. And finally resume the brightness of the polarized image after registration, the effect of the polarized image is not affected. Results show that the improved SURF algorithm can be applied well under low illumination conditions.

On combining algorithms for deformable image registration

NARCIS (Netherlands)

Muenzing, S.E.A.; Ginneken, van B.; Pluim, J.P.W.; Dawant, B.M.

2012-01-01

We propose a meta-algorithm for registration improvement by combining deformable image registrations (MetaReg). It is inspired by a well-established method from machine learning, the combination of classifiers. MetaReg consists of two main components: (1) A strategy for composing an improved

Comparison of carina-based versus bony anatomy-based registration for setup verification in esophageal cancer radiotherapy.

Science.gov (United States)

Machiels, Mélanie; Jin, Peng; van Gurp, Christianne H; van Hooft, Jeanin E; Alderliesten, Tanja; Hulshof, Maarten C C M

2018-03-21

To investigate the feasibility and geometric accuracy of carina-based registration for CBCT-guided setup verification in esophageal cancer IGRT, compared with current practice bony anatomy-based registration. Included were 24 esophageal cancer patients with 65 implanted fiducial markers, visible on planning CTs and follow-up CBCTs. All available CBCT scans (n = 236) were rigidly registered to the planning CT with respect to the bony anatomy and the carina. Target coverage was visually inspected and marker position variation was quantified relative to both registration approaches; the variation of systematic (Σ) and random errors (σ) was estimated. Automatic carina-based registration was feasible in 94.9% of the CBCT scans, with an adequate target coverage in 91.1% compared to 100% after bony anatomy-based registration. Overall, Σ (σ) in the LR/CC/AP direction was 2.9(2.4)/4.1(2.4)/2.2(1.8) mm using the bony anatomy registration compared to 3.3(3.0)/3.6(2.6)/3.9(3.1) mm for the carina. Mid-thoracic placed markers showed a non-significant but smaller Σ in CC and AP direction when using the carina-based registration. Compared with a bony anatomy-based registration, carina-based registration for esophageal cancer IGRT results in inadequate target coverage in 8.9% of cases. Furthermore, large Σ and σ, requiring larger anisotropic margins, were seen after carina-based registration. Only for tumors entirely confined to the mid-thoracic region the carina-based registration might be slightly favorable.

MREG V1.1 : a multi-scale image registration algorithm for SAR applications.

Energy Technology Data Exchange (ETDEWEB)

Eichel, Paul H.

2013-08-01

MREG V1.1 is the sixth generation SAR image registration algorithm developed by the Signal Processing&Technology Department for Synthetic Aperture Radar applications. Like its predecessor algorithm REGI, it employs a powerful iterative multi-scale paradigm to achieve the competing goals of sub-pixel registration accuracy and the ability to handle large initial offsets. Since it is not model based, it allows for high fidelity tracking of spatially varying terrain-induced misregistration. Since it does not rely on image domain phase, it is equally adept at coherent and noncoherent image registration. This document provides a brief history of the registration processors developed by Dept. 5962 leading up to MREG V1.1, a full description of the signal processing steps involved in the algorithm, and a user's manual with application specific recommendations for CCD, TwoColor MultiView, and SAR stereoscopy.

Registration and display of brain SPECT and MRI using external markers

International Nuclear Information System (INIS)

Pohjonen, H.; Nikkinen, P.; Sipilae, O.; Launes, J.; Salli, E.; Salonen, O.; Karp, P.; Ylae-Jaeaeski, J.; Katila, T.; Liewendahl, K.

1996-01-01

Accurate anatomical localisation of abnormalities observed in brain perfusion single-photon emission computed tomography (SPECT) is difficult, but can be improved by correlating data from SPECT and other tomographic imaging modalities. For this purpose we have developed software to register, analyse and display 99m Tc-hexamethylpropyleneamine oxime SPECT and 1.0 T MRI of the brain. For registration of SPECT and MRI data external skin markers containing 99m Tc (220 kBq) in 50 μl of coconut butter were used. The software is coded in the C programming language, and the X Window system and the OSF/Motif standards are used for graphics and definition of the user interface. The registration algorithm follows a noniterative least-squares method using singular value decomposition of a 3 x 3 covariance matrix. After registration, the image slices of both data sets are shown at identical tomographic levels. The registration error in phantom studies was on average 4 mm. In the two-dimensional display mode the orthogonal cross-sections of the data sets are displayed side by side. In the three-dimensional mode MRI data are displayed as a surface-shaded 3 D reconstruction and SPECT data as cut planes. The usefulness of this method is demonstrated in patients with cerebral infarcts, brain tumour, herpes simplex encephalitis and epilepsy. (orig.). With 9 figs

The ANACONDA algorithm for deformable image registration in radiotherapy

International Nuclear Information System (INIS)

Weistrand, Ola; Svensson, Stina

2015-01-01

Purpose: The purpose of this work was to describe a versatile algorithm for deformable image registration with applications in radiotherapy and to validate it on thoracic 4DCT data as well as CT/cone beam CT (CBCT) data. Methods: ANAtomically CONstrained Deformation Algorithm (ANACONDA) combines image information (i.e., intensities) with anatomical information as provided by contoured image sets. The registration problem is formulated as a nonlinear optimization problem and solved with an in-house developed solver, tailored to this problem. The objective function, which is minimized during optimization, is a linear combination of four nonlinear terms: 1. image similarity term; 2. grid regularization term, which aims at keeping the deformed image grid smooth and invertible; 3. a shape based regularization term which works to keep the deformation anatomically reasonable when regions of interest are present in the reference image; and 4. a penalty term which is added to the optimization problem when controlling structures are used, aimed at deforming the selected structure in the reference image to the corresponding structure in the target image. Results: To validate ANACONDA, the authors have used 16 publically available thoracic 4DCT data sets for which target registration errors from several algorithms have been reported in the literature. On average for the 16 data sets, the target registration error is 1.17 ± 0.87 mm, Dice similarity coefficient is 0.98 for the two lungs, and image similarity, measured by the correlation coefficient, is 0.95. The authors have also validated ANACONDA using two pelvic cases and one head and neck case with planning CT and daily acquired CBCT. Each image has been contoured by a physician (radiation oncologist) or experienced radiation therapist. The results are an improvement with respect to rigid registration. However, for the head and neck case, the sample set is too small to show statistical significance. Conclusions: ANACONDA

A Matlab user interface for the statistically assisted fluid registration algorithm and tensor-based morphometry

Science.gov (United States)

Yepes-Calderon, Fernando; Brun, Caroline; Sant, Nishita; Thompson, Paul; Lepore, Natasha

2015-01-01

Tensor-Based Morphometry (TBM) is an increasingly popular method for group analysis of brain MRI data. The main steps in the analysis consist of a nonlinear registration to align each individual scan to a common space, and a subsequent statistical analysis to determine morphometric differences, or difference in fiber structure between groups. Recently, we implemented the Statistically-Assisted Fluid Registration Algorithm or SAFIRA,1 which is designed for tracking morphometric differences among populations. To this end, SAFIRA allows the inclusion of statistical priors extracted from the populations being studied as regularizers in the registration. This flexibility and degree of sophistication limit the tool to expert use, even more so considering that SAFIRA was initially implemented in command line mode. Here, we introduce a new, intuitive, easy to use, Matlab-based graphical user interface for SAFIRA's multivariate TBM. The interface also generates different choices for the TBM statistics, including both the traditional univariate statistics on the Jacobian matrix, and comparison of the full deformation tensors.2 This software will be freely disseminated to the neuroimaging research community.

An efficient and robust algorithm for parallel groupwise registration of bone surfaces

NARCIS (Netherlands)

van de Giessen, Martijn; Vos, Frans M.; Grimbergen, Cornelis A.; van Vliet, Lucas J.; Streekstra, Geert J.

2012-01-01

In this paper a novel groupwise registration algorithm is proposed for the unbiased registration of a large number of densely sampled point clouds. The method fits an evolving mean shape to each of the example point clouds thereby minimizing the total deformation. The registration algorithm

Simulating Deformations of MR Brain Images for Validation of Atlas-based Segmentation and Registration Algorithms

OpenAIRE

Xue, Zhong; Shen, Dinggang; Karacali, Bilge; Stern, Joshua; Rottenberg, David; Davatzikos, Christos

2006-01-01

Simulated deformations and images can act as the gold standard for evaluating various template-based image segmentation and registration algorithms. Traditional deformable simulation methods, such as the use of analytic deformation fields or the displacement of landmarks followed by some form of interpolation, are often unable to construct rich (complex) and/or realistic deformations of anatomical organs. This paper presents new methods aiming to automatically simulate realistic inter- and in...

Robust surface registration using salient anatomical features for image-guided liver surgery: Algorithm and validation

OpenAIRE

Clements, Logan W.; Chapman, William C.; Dawant, Benoit M.; Galloway, Robert L.; Miga, Michael I.

2008-01-01

A successful surface-based image-to-physical space registration in image-guided liver surgery (IGLS) is critical to provide reliable guidance information to surgeons and pertinent surface displacement data for use in deformation correction algorithms. The current protocol used to perform the image-to-physical space registration involves an initial pose estimation provided by a point based registration of anatomical landmarks identifiable in both the preoperative tomograms and the intraoperati...

Constrained non-rigid registration for whole body image registration: method and validation

Science.gov (United States)

Li, Xia; Yankeelov, Thomas E.; Peterson, Todd E.; Gore, John C.; Dawant, Benoit M.

2007-03-01

3D intra- and inter-subject registration of image volumes is important for tasks that include measurements and quantification of temporal/longitudinal changes, atlas-based segmentation, deriving population averages, or voxel and tensor-based morphometry. A number of methods have been proposed to tackle this problem but few of them have focused on the problem of registering whole body image volumes acquired either from humans or small animals. These image volumes typically contain a large number of articulated structures, which makes registration more difficult than the registration of head images, to which the vast majority of registration algorithms have been applied. To solve this problem, we have previously proposed an approach, which initializes an intensity-based non-rigid registration algorithm with a point based registration technique [1, 2]. In this paper, we introduce new constraints into our non-rigid registration algorithm to prevent the bones from being deformed inaccurately. Results we have obtained show that the new constrained algorithm leads to better registration results than the previous one.

Accuracy of deformable image registration on magnetic resonance images in digital and physical phantoms.

Science.gov (United States)

Ger, Rachel B; Yang, Jinzhong; Ding, Yao; Jacobsen, Megan C; Fuller, Clifton D; Howell, Rebecca M; Li, Heng; Jason Stafford, R; Zhou, Shouhao; Court, Laurence E

2017-10-01

Accurate deformable image registration is necessary for longitudinal studies. The error associated with commercial systems has been evaluated using computed tomography (CT). Several in-house algorithms have been evaluated for use with magnetic resonance imaging (MRI), but there is still relatively little information about MRI deformable image registration. This work presents an evaluation of two deformable image registration systems, one commercial (Velocity) and one in-house (demons-based algorithm), with MRI using two different metrics to quantify the registration error. The registration error was analyzed with synthetic MR images. These images were generated from interpatient and intrapatient variation models trained on 28 patients. Four synthetic post-treatment images were generated for each of four synthetic pretreatment images, resulting in 16 image registrations for both the T1- and T2-weighted images. The synthetic post-treatment images were registered to their corresponding synthetic pretreatment image. The registration error was calculated between the known deformation vector field and the generated deformation vector field from the image registration system. The registration error was also analyzed using a porcine phantom with ten implanted 0.35-mm diameter gold markers. The markers were visible on CT but not MRI. CT, T1-weighted MR, and T2-weighted MR images were taken in four different positions. The markers were contoured on the CT images and rigidly registered to their corresponding MR images. The MR images were deformably registered and the distance between the projected marker location and true marker location was measured as the registration error. The synthetic images were evaluated only on Velocity. Root mean square errors (RMSEs) of 0.76 mm in the left-right (LR) direction, 0.76 mm in the anteroposterior (AP) direction, and 0.69 mm in the superior-inferior (SI) direction were observed for the T1-weighted MR images. RMSEs of 1.1 mm in the LR

Medical image registration algorithms assesment Bronze Standard application enactment on grids using the MOTEUR workflow engine

CERN Document Server

Glatard, T; Pennec, X

2006-01-01

Medical image registration is pre-processing needed for many medical image analysis procedures. A very large number of registration algorithms are available today, but their performance is often not known and very difficult to assess due to the lack of gold standard. The Bronze Standard algorithm is a very data and compute intensive statistical approach for quantifying registration algorithms accuracy. In this paper, we describe the Bronze Standard application and we discuss the need for grids to tackle such computations on medical image databases. We demonstrate MOTEUR, a service-based workflow engine optimized for dealing with data intensive applications. MOTEUR eases the enactment of the Bronze Standard and similar applications on the EGEE production grid infrastructure. It is a generic workflow engine, based on current standards and freely available, that can be used to instrument legacy application code at low cost.

An Orthogonal Learning Differential Evolution Algorithm for Remote Sensing Image Registration

Directory of Open Access Journals (Sweden)

Wenping Ma

2014-01-01

Full Text Available We introduce an area-based method for remote sensing image registration. We use orthogonal learning differential evolution algorithm to optimize the similarity metric between the reference image and the target image. Many local and global methods have been used to achieve the optimal similarity metric in the last few years. Because remote sensing images are usually influenced by large distortions and high noise, local methods will fail in some cases. For this reason, global methods are often required. The orthogonal learning (OL strategy is efficient when searching in complex problem spaces. In addition, it can discover more useful information via orthogonal experimental design (OED. Differential evolution (DE is a heuristic algorithm. It has shown to be efficient in solving the remote sensing image registration problem. So orthogonal learning differential evolution algorithm (OLDE is efficient for many optimization problems. The OLDE method uses the OL strategy to guide the DE algorithm to discover more useful information. Experiments show that the OLDE method is more robust and efficient for registering remote sensing images.

Improving oncoplastic breast tumor bed localization for radiotherapy planning using image registration algorithms

Science.gov (United States)

Wodzinski, Marek; Skalski, Andrzej; Ciepiela, Izabela; Kuszewski, Tomasz; Kedzierawski, Piotr; Gajda, Janusz

2018-02-01

Knowledge about tumor bed localization and its shape analysis is a crucial factor for preventing irradiation of healthy tissues during supportive radiotherapy and as a result, cancer recurrence. The localization process is especially hard for tumors placed nearby soft tissues, which undergo complex, nonrigid deformations. Among them, breast cancer can be considered as the most representative example. A natural approach to improving tumor bed localization is the use of image registration algorithms. However, this involves two unusual aspects which are not common in typical medical image registration: the real deformation field is discontinuous, and there is no direct correspondence between the cancer and its bed in the source and the target 3D images respectively. The tumor no longer exists during radiotherapy planning. Therefore, a traditional evaluation approach based on known, smooth deformations and target registration error are not directly applicable. In this work, we propose alternative artificial deformations which model the tumor bed creation process. We perform a comprehensive evaluation of the most commonly used deformable registration algorithms: B-Splines free form deformations (B-Splines FFD), different variants of the Demons and TV-L1 optical flow. The evaluation procedure includes quantitative assessment of the dedicated artificial deformations, target registration error calculation, 3D contour propagation and medical experts visual judgment. The results demonstrate that the currently, practically applied image registration (rigid registration and B-Splines FFD) are not able to correctly reconstruct discontinuous deformation fields. We show that the symmetric Demons provide the most accurate soft tissues alignment in terms of the ability to reconstruct the deformation field, target registration error and relative tumor volume change, while B-Splines FFD and TV-L1 optical flow are not an appropriate choice for the breast tumor bed localization problem

Inverse consistent non-rigid image registration based on robust point set matching

Science.gov (United States)

2014-01-01

Background Robust point matching (RPM) has been extensively used in non-rigid registration of images to robustly register two sets of image points. However, except for the location at control points, RPM cannot estimate the consistent correspondence between two images because RPM is a unidirectional image matching approach. Therefore, it is an important issue to make an improvement in image registration based on RPM. Methods In our work, a consistent image registration approach based on the point sets matching is proposed to incorporate the property of inverse consistency and improve registration accuracy. Instead of only estimating the forward transformation between the source point sets and the target point sets in state-of-the-art RPM algorithms, the forward and backward transformations between two point sets are estimated concurrently in our algorithm. The inverse consistency constraints are introduced to the cost function of RPM and the fuzzy correspondences between two point sets are estimated based on both the forward and backward transformations simultaneously. A modified consistent landmark thin-plate spline registration is discussed in detail to find the forward and backward transformations during the optimization of RPM. The similarity of image content is also incorporated into point matching in order to improve image matching. Results Synthetic data sets, medical images are employed to demonstrate and validate the performance of our approach. The inverse consistent errors of our algorithm are smaller than RPM. Especially, the topology of transformations is preserved well for our algorithm for the large deformation between point sets. Moreover, the distance errors of our algorithm are similar to that of RPM, and they maintain a downward trend as whole, which demonstrates the convergence of our algorithm. The registration errors for image registrations are evaluated also. Again, our algorithm achieves the lower registration errors in same iteration number

An enhanced block matching algorithm for fast elastic registration in adaptive radiotherapy

International Nuclear Information System (INIS)

Malsch, U; Thieke, C; Huber, P E; Bendl, R

2006-01-01

Image registration has many medical applications in diagnosis, therapy planning and therapy. Especially for time-adaptive radiotherapy, an efficient and accurate elastic registration of images acquired for treatment planning, and at the time of the actual treatment, is highly desirable. Therefore, we developed a fully automatic and fast block matching algorithm which identifies a set of anatomical landmarks in a 3D CT dataset and relocates them in another CT dataset by maximization of local correlation coefficients in the frequency domain. To transform the complete dataset, a smooth interpolation between the landmarks is calculated by modified thin-plate splines with local impact. The concept of the algorithm allows separate processing of image discontinuities like temporally changing air cavities in the intestinal track or rectum. The result is a fully transformed 3D planning dataset (planning CT as well as delineations of tumour and organs at risk) to a verification CT, allowing evaluation and, if necessary, changes of the treatment plan based on the current patient anatomy without time-consuming manual re-contouring. Typically the total calculation time is less than 5 min, which allows the use of the registration tool between acquiring the verification images and delivering the dose fraction for online corrections. We present verifications of the algorithm for five different patient datasets with different tumour locations (prostate, paraspinal and head-and-neck) by comparing the results with manually selected landmarks, visual assessment and consistency testing. It turns out that the mean error of the registration is better than the voxel resolution (2 x 2 x 3 mm 3 ). In conclusion, we present an algorithm for fully automatic elastic image registration that is precise and fast enough for online corrections in an adaptive fractionated radiation treatment course

Accelerated gradient-based free form deformable registration for online adaptive radiotherapy

International Nuclear Information System (INIS)

Yu, Gang; Yang, Guanyu; Shu, Huazhong; Li, Baosheng; Liang, Yueqiang; Yin, Yong; Li, Dengwang

2015-01-01

The registration of planning fan-beam computed tomography (FBCT) and daily cone-beam CT (CBCT) is a crucial step in adaptive radiation therapy. The current intensity-based registration algorithms, such as Demons, may fail when they are used to register FBCT and CBCT, because the CT numbers in CBCT cannot exactly correspond to the electron densities. In this paper, we investigated the effects of CBCT intensity inaccuracy on the registration accuracy and developed an accurate gradient-based free form deformation algorithm (GFFD). GFFD distinguishes itself from other free form deformable registration algorithms by (a) measuring the similarity using the 3D gradient vector fields to avoid the effect of inconsistent intensities between the two modalities; (b) accommodating image sampling anisotropy using the local polynomial approximation-intersection of confidence intervals (LPA-ICI) algorithm to ensure a smooth and continuous displacement field; and (c) introducing a ‘bi-directional’ force along with an adaptive force strength adjustment to accelerate the convergence process. It is expected that such a strategy can decrease the effect of the inconsistent intensities between the two modalities, thus improving the registration accuracy and robustness. Moreover, for clinical application, the algorithm was implemented by graphics processing units (GPU) through OpenCL framework. The registration time of the GFFD algorithm for each set of CT data ranges from 8 to 13 s. The applications of on-line adaptive image-guided radiation therapy, including auto-propagation of contours, aperture-optimization and dose volume histogram (DVH) in the course of radiation therapy were also studied by in-house-developed software. (paper)

Duality based optical flow algorithms with applications

DEFF Research Database (Denmark)

Rakêt, Lars Lau

We consider the popular TV-L1 optical flow formulation, and the so-called duality based algorithm for minimizing the TV-L1 energy. The original formulation is extended to allow for vector valued images, and minimization results are given. In addition we consider different definitions of total...... variation regularization, and related formulations of the optical flow problem that may be used with a duality based algorithm. We present a highly optimized algorithmic setup to estimate optical flows, and give five novel applications. The first application is registration of medical images, where X......-ray images of different hands, taken using different imaging devices are registered using a TV-L1 optical flow algorithm. We propose to regularize the input images, using sparsity enhancing regularization of the image gradient to improve registration results. The second application is registration of 2D...

A hybrid biomechanical intensity based deformable image registration of lung 4DCT

International Nuclear Information System (INIS)

Samavati, Navid; Velec, Michael; Brock, Kristy

2015-01-01

Deformable image registration (DIR) has been extensively studied over the past two decades due to its essential role in many image-guided interventions (IGI). IGI demands a highly accurate registration that maintains its accuracy across the entire region of interest. This work evaluates the improvement in accuracy and consistency by refining the results of Morfeus, a biomechanical model-based DIR algorithm.A hybrid DIR algorithm is proposed based on, a biomechanical model–based DIR algorithm and a refinement step based on a B-spline intensity-based algorithm. Inhale and exhale reconstructions of four-dimensional computed tomography (4DCT) lung images from 31 patients were initially registered using the biomechanical DIR by modeling contact surface between the lungs and the chest cavity. The resulting deformations were then refined using the intensity-based algorithm to reduce any residual uncertainties. Important parameters in the intensity-based algorithm, including grid spacing, number of pyramids, and regularization coefficient, were optimized on 10 randomly-chosen patients (out of 31). Target registration error (TRE) was calculated by measuring the Euclidean distance of common anatomical points on both images after registration. For each patient a minimum of 30 points/lung were used.Grid spacing of 8 mm, 5 levels of grid pyramids, and regularization coefficient of 3.0 were found to provide optimal results on 10 randomly chosen patients. Overall the entire patient population (n = 31), the hybrid method resulted in mean ± SD (90th%) TRE of 1.5 ± 1.4 (2.9) mm compared to 3.1 ± 1.9 (5.6) using biomechanical DIR and 2.6 ± 2.5 (6.1) using intensity-based DIR alone.The proposed hybrid biomechanical modeling intensity based algorithm is a promising DIR technique which could be used in various IGI procedures. The current investigation shows the efficacy of this approach for the registration of 4DCT images of the lungs with average accuracy of 1.5�

Object-constrained meshless deformable algorithm for high speed 3D nonrigid registration between CT and CBCT

International Nuclear Information System (INIS)

Chen Ting; Kim, Sung; Goyal, Sharad; Jabbour, Salma; Zhou Jinghao; Rajagopal, Gunaretnum; Haffty, Bruce; Yue Ning

2010-01-01

Purpose: High-speed nonrigid registration between the planning CT and the treatment CBCT data is critical for real time image guided radiotherapy (IGRT) to improve the dose distribution and to reduce the toxicity to adjacent organs. The authors propose a new fully automatic 3D registration framework that integrates object-based global and seed constraints with the grayscale-based ''demons'' algorithm. Methods: Clinical objects were segmented on the planning CT images and were utilized as meshless deformable models during the nonrigid registration process. The meshless models reinforced a global constraint in addition to the grayscale difference between CT and CBCT in order to maintain the shape and the volume of geometrically complex 3D objects during the registration. To expedite the registration process, the framework was stratified into hierarchies, and the authors used a frequency domain formulation to diffuse the displacement between the reference and the target in each hierarchy. Also during the registration of pelvis images, they replaced the air region inside the rectum with estimated pixel values from the surrounding rectal wall and introduced an additional seed constraint to robustly track and match the seeds implanted into the prostate. The proposed registration framework and algorithm were evaluated on 15 real prostate cancer patients. For each patient, prostate gland, seminal vesicle, bladder, and rectum were first segmented by a radiation oncologist on planning CT images for radiotherapy planning purpose. The same radiation oncologist also manually delineated the tumor volumes and critical anatomical structures in the corresponding CBCT images acquired at treatment. These delineated structures on the CBCT were only used as the ground truth for the quantitative validation, while structures on the planning CT were used both as the input to the registration method and the ground truth in validation. By registering the planning CT to the CBCT, a

A new robust markerless method for automatic image-to-patient registration in image-guided neurosurgery system.

Science.gov (United States)

Liu, Yinlong; Song, Zhijian; Wang, Manning

2017-12-01

Compared with the traditional point-based registration in the image-guided neurosurgery system, surface-based registration is preferable because it does not use fiducial markers before image scanning and does not require image acquisition dedicated for navigation purposes. However, most existing surface-based registration methods must include a manual step for coarse registration, which increases the registration time and elicits some inconvenience and uncertainty. A new automatic surface-based registration method is proposed, which applies 3D surface feature description and matching algorithm to obtain point correspondences for coarse registration and uses the iterative closest point (ICP) algorithm in the last step to obtain an image-to-patient registration. Both phantom and clinical data were used to execute automatic registrations and target registration error (TRE) calculated to verify the practicality and robustness of the proposed method. In phantom experiments, the registration accuracy was stable across different downsampling resolutions (18-26 mm) and different support radii (2-6 mm). In clinical experiments, the mean TREs of two patients by registering full head surfaces were 1.30 mm and 1.85 mm. This study introduced a new robust automatic surface-based registration method based on 3D feature matching. The method achieved sufficient registration accuracy with different real-world surface regions in phantom and clinical experiments.

Assessment of fiducial markers to enable the co-registration of photographs and MRI data.

Science.gov (United States)

Webb, Bridgette A; Petrovic, Andreas; Urschler, Martin; Scheurer, Eva

2015-03-01

To investigate the visualisation of novel external fiducial skin markers in photography and MRI. To co-register photographs and MR images, and additionally assess the spatial accuracy of these co-registrations with the view of future application in the investigation of forensically relevant soft tissue lesions. Strand-shaped fiducial markers were secured externally over hematomas on the thigh of 10 volunteers. The region of interest was photographed and examined using MRI at 3T in oblique and transversal orientations and the visibility of the markers assessed. Markers provided 'control points' in both sets of images, enabling the computation of an affine transform to register oblique MR images to photographs. The fiducial registration error was evaluated by calculating the root-mean-square error of nine corresponding evaluation points visible in both modalities. Fiducial markers were clearly visualised in both photography and MRI. The co-registration of photographs and oblique MR images was achieved for all participants. The overall root-mean-square error for registrations was 1.18mm (TIRM) and 1.46mm (TSE2D with SPAIR fat-suppression). The proposed approach led to the successful visualisation of non-invasive fiducial markers using photography and MRI (TIRM and TSE2D (SPAIR) sequences). This visualisation, combined with an affine transformation process provided a simple, cost-effective way to accurately co-register photographs and MR images of subcutaneous hematomas located on the thigh. Further investigation of the novel markers and the proposed co-visualisation approach holds potential to improve not only the forensic documentation of soft tissue lesions, but to also improve certain clinical applications, including the area of dermatology. Copyright © 2015 Elsevier Ireland Ltd. All rights reserved.

The Pose Estimation of Mobile Robot Based on Improved Point Cloud Registration

Directory of Open Access Journals (Sweden)

Yanzi Miao

2016-03-01

Full Text Available Due to GPS restrictions, an inertial sensor is usually used to estimate the location of indoor mobile robots. However, it is difficult to achieve high-accuracy localization and control by inertial sensors alone. In this paper, a new method is proposed to estimate an indoor mobile robot pose with six degrees of freedom based on an improved 3D-Normal Distributions Transform algorithm (3D-NDT. First, point cloud data are captured by a Kinect sensor and segmented according to the distance to the robot. After the segmentation, the input point cloud data are processed by the Approximate Voxel Grid Filter algorithm in different sized voxel grids. Second, the initial registration and precise registration are performed respectively according to the distance to the sensor. The most distant point cloud data use the 3D-Normal Distributions Transform algorithm (3D-NDT with large-sized voxel grids for initial registration, based on the transformation matrix from the odometry method. The closest point cloud data use the 3D-NDT algorithm with small-sized voxel grids for precise registration. After the registrations above, a final transformation matrix is obtained and coordinated. Based on this transformation matrix, the pose estimation problem of the indoor mobile robot is solved. Test results show that this method can obtain accurate robot pose estimation and has better robustness.

Improving alignment in Tract-based spatial statistics: evaluation and optimization of image registration.

Science.gov (United States)

de Groot, Marius; Vernooij, Meike W; Klein, Stefan; Ikram, M Arfan; Vos, Frans M; Smith, Stephen M; Niessen, Wiro J; Andersson, Jesper L R

2013-08-01

Anatomical alignment in neuroimaging studies is of such importance that considerable effort is put into improving the registration used to establish spatial correspondence. Tract-based spatial statistics (TBSS) is a popular method for comparing diffusion characteristics across subjects. TBSS establishes spatial correspondence using a combination of nonlinear registration and a "skeleton projection" that may break topological consistency of the transformed brain images. We therefore investigated feasibility of replacing the two-stage registration-projection procedure in TBSS with a single, regularized, high-dimensional registration. To optimize registration parameters and to evaluate registration performance in diffusion MRI, we designed an evaluation framework that uses native space probabilistic tractography for 23 white matter tracts, and quantifies tract similarity across subjects in standard space. We optimized parameters for two registration algorithms on two diffusion datasets of different quality. We investigated reproducibility of the evaluation framework, and of the optimized registration algorithms. Next, we compared registration performance of the regularized registration methods and TBSS. Finally, feasibility and effect of incorporating the improved registration in TBSS were evaluated in an example study. The evaluation framework was highly reproducible for both algorithms (R(2) 0.993; 0.931). The optimal registration parameters depended on the quality of the dataset in a graded and predictable manner. At optimal parameters, both algorithms outperformed the registration of TBSS, showing feasibility of adopting such approaches in TBSS. This was further confirmed in the example experiment. Copyright © 2013 Elsevier Inc. All rights reserved.

Population based ranking of frameless CT-MRI registration methods

Energy Technology Data Exchange (ETDEWEB)

Opposits, Gabor; Kis, Sandor A.; Tron, Lajos; Emri, Miklos [Debrecen Univ. (Hungary). Dept. of Nuclear Medicine; Berenyi, Ervin [Debrecen Univ. (Hungary). Dept. of Biomedical Laboratory and Imaging Science; Takacs, Endre [Rotating Gamma Ltd., Debrecen (Hungary); Dobai, Jozsef G.; Bognar, Laszlo [Debrecen Univ., Medical Center (Hungary). Dept. of Neurosurgery; Szuecs, Bernadett [ScanoMed Ltd., Debrecen (Hungary)

2015-07-01

Clinical practice often requires simultaneous information obtained by two different imaging modalities. Registration algorithms are commonly used for this purpose. Automated procedures are very helpful in cases when the same kind of registration has to be performed on images of a high number of subjects. Radiotherapists would prefer to use the best automated method to assist therapy planning, however there are not accepted procedures for ranking the different registration algorithms. We were interested in developing a method to measure the population level performance of CT-MRI registration algorithms by a parameter of values in the [0,1] interval. Pairs of CT and MRI images were collected from 1051 subjects. Results of an automated registration were corrected manually until a radiologist and a neurosurgeon expert both accepted the result as good. This way 1051 registered MRI images were produced by the same pair of experts to be used as gold standards for the evaluation of the performance of other registration algorithms. Pearson correlation coefficient, mutual information, normalized mutual information, Kullback-Leibler divergence, L{sub 1} norm and square L{sub 2} norm (dis)similarity measures were tested for sensitivity to indicate the extent of (dis)similarity of a pair of individual mismatched images. The square Hellinger distance proved suitable to grade the performance of registration algorithms at population level providing the developers with a valuable tool to rank algorithms. The developed procedure provides an objective method to find the registration algorithm performing the best on the population level out of newly constructed or available preselected ones.

Medical image registration by combining global and local information: a chain-type diffeomorphic demons algorithm

International Nuclear Information System (INIS)

Liu, Xiaozheng; Yuan, Zhenming; Zhu, Junming; Xu, Dongrong

2013-01-01

The demons algorithm is a popular algorithm for non-rigid image registration because of its computational efficiency and simple implementation. The deformation forces of the classic demons algorithm were derived from image gradients by considering the deformation to decrease the intensity dissimilarity between images. However, the methods using the difference of image intensity for medical image registration are easily affected by image artifacts, such as image noise, non-uniform imaging and partial volume effects. The gradient magnitude image is constructed from the local information of an image, so the difference in a gradient magnitude image can be regarded as more reliable and robust for these artifacts. Then, registering medical images by considering the differences in both image intensity and gradient magnitude is a straightforward selection. In this paper, based on a diffeomorphic demons algorithm, we propose a chain-type diffeomorphic demons algorithm by combining the differences in both image intensity and gradient magnitude for medical image registration. Previous work had shown that the classic demons algorithm can be considered as an approximation of a second order gradient descent on the sum of the squared intensity differences. By optimizing the new dissimilarity criteria, we also present a set of new demons forces which were derived from the gradients of the image and gradient magnitude image. We show that, in controlled experiments, this advantage is confirmed, and yields a fast convergence. (paper)

A Robust and Accurate Two-Step Auto-Labeling Conditional Iterative Closest Points (TACICP Algorithm for Three-Dimensional Multi-Modal Carotid Image Registration.

Directory of Open Access Journals (Sweden)

Hengkai Guo

Full Text Available Atherosclerosis is among the leading causes of death and disability. Combining information from multi-modal vascular images is an effective and efficient way to diagnose and monitor atherosclerosis, in which image registration is a key technique. In this paper a feature-based registration algorithm, Two-step Auto-labeling Conditional Iterative Closed Points (TACICP algorithm, is proposed to align three-dimensional carotid image datasets from ultrasound (US and magnetic resonance (MR. Based on 2D segmented contours, a coarse-to-fine strategy is employed with two steps: rigid initialization step and non-rigid refinement step. Conditional Iterative Closest Points (CICP algorithm is given in rigid initialization step to obtain the robust rigid transformation and label configurations. Then the labels and CICP algorithm with non-rigid thin-plate-spline (TPS transformation model is introduced to solve non-rigid carotid deformation between different body positions. The results demonstrate that proposed TACICP algorithm has achieved an average registration error of less than 0.2mm with no failure case, which is superior to the state-of-the-art feature-based methods.

Minimally invasive registration for computer-assisted orthopedic surgery: combining tracked ultrasound and bone surface points via the P-IMLOP algorithm.

Science.gov (United States)

Billings, Seth; Kang, Hyun Jae; Cheng, Alexis; Boctor, Emad; Kazanzides, Peter; Taylor, Russell

2015-06-01

We present a registration method for computer-assisted total hip replacement (THR) surgery, which we demonstrate to improve the state of the art by both reducing the invasiveness of current methods and increasing registration accuracy. A critical element of computer-guided procedures is the determination of the spatial correspondence between the patient and a computational model of patient anatomy. The current method for establishing this correspondence in robot-assisted THR is to register points intraoperatively sampled by a tracked pointer from the exposed proximal femur and, via auxiliary incisions, from the distal femur. In this paper, we demonstrate a noninvasive technique for sampling points on the distal femur using tracked B-mode ultrasound imaging and present a new algorithm for registering these data called Projected Iterative Most-Likely Oriented Point (P-IMLOP). Points and normal orientations of the distal bone surface are segmented from ultrasound images and registered to the patient model along with points sampled from the exposed proximal femur via a tracked pointer. The proposed approach is evaluated using a bone- and tissue-mimicking leg phantom constructed to enable accurate assessment of experimental registration accuracy with respect to a CT-image-based model of the phantom. These experiments demonstrate that localization of the femur shaft is greatly improved by tracked ultrasound. The experiments further demonstrate that, for ultrasound-based data, the P-IMLOP algorithm significantly improves registration accuracy compared to the standard ICP algorithm. Registration via tracked ultrasound and the P-IMLOP algorithm has high potential to reduce the invasiveness and improve the registration accuracy of computer-assisted orthopedic procedures.

Use of the CT component of PET-CT to improve PET-MR registration: demonstration in soft-tissue sarcoma

International Nuclear Information System (INIS)

Somer, Edward J; Benatar, Nigel A; O'Doherty, Michael J; Smith, Mike A; Marsden, Paul K

2007-01-01

We have investigated improvements to PET-MR image registration offered by PET-CT scanning. Ten subjects with suspected soft-tissue sarcomas were scanned with an in-line PET-CT and a clinical MR scanner. PET to CT, CT to MR and PET to MR image registrations were performed using a rigid-body external marker technique and rigid and non-rigid voxel-similarity algorithms. PET-MR registration was also performed using transformations derived from the registration of CT to MR. The external marker technique gave fiducial registration errors of 2.1 mm, 5.1 mm and 5.3 mm for PET-CT, PET-MR and CT-MR registration. Target registration errors were 3.9 mm, 9.0 mm and 9.3 mm, respectively. Voxel-based algorithms were evaluated by measuring the distance between corresponding fiducials after registration. Registration errors of 6.4 mm, 14.5 mm and 9.5 mm, respectively, for PET-CT, PET-MR and CT-MR were observed for rigid-body registration while non-rigid registration gave errors of 6.8 mm, 16.3 mm and 7.6 mm for the same modality combinations. The application of rigid and non-rigid CT to MR transformations to accompanying PET data gives significantly reduced PET-MR errors of 10.0 mm and 8.5 mm, respectively. Visual comparison by two independent observers confirmed the improvement over direct PET-MR registration. We conclude that PET-MR registration can be more accurately and reliably achieved using the hybrid technique described than through direct rigid-body registration of PET to MR

An Optimized Spline-Based Registration of a 3D CT to a Set of C-Arm Images

Directory of Open Access Journals (Sweden)

2006-01-01

Full Text Available We have developed an algorithm for the rigid-body registration of a CT volume to a set of C-arm images. The algorithm uses a gradient-based iterative minimization of a least-squares measure of dissimilarity between the C-arm images and projections of the CT volume. To compute projections, we use a novel method for fast integration of the volume along rays. To improve robustness and speed, we take advantage of a coarse-to-fine processing of the volume/image pyramids. To compute the projections of the volume, the gradient of the dissimilarity measure, and the multiresolution data pyramids, we use a continuous image/volume model based on cubic B-splines, which ensures a high interpolation accuracy and a gradient of the dissimilarity measure that is well defined everywhere. We show the performance of our algorithm on a human spine phantom, where the true alignment is determined using a set of fiducial markers.

Fast Rotation-Free Feature-Based Image Registration Using Improved N-SIFT and GMM-Based Parallel Optimization.

Science.gov (United States)

Yu, Dongdong; Yang, Feng; Yang, Caiyun; Leng, Chengcai; Cao, Jian; Wang, Yining; Tian, Jie

2016-08-01

Image registration is a key problem in a variety of applications, such as computer vision, medical image processing, pattern recognition, etc., while the application of registration is limited by time consumption and the accuracy in the case of large pose differences. Aimed at these two kinds of problems, we propose a fast rotation-free feature-based rigid registration method based on our proposed accelerated-NSIFT and GMM registration-based parallel optimization (PO-GMMREG). Our method is accelerated by using the GPU/CUDA programming and preserving only the location information without constructing the descriptor of each interest point, while its robustness to missing correspondences and outliers is improved by converting the interest point matching to Gaussian mixture model alignment. The accuracy in the case of large pose differences is settled by our proposed PO-GMMREG algorithm by constructing a set of initial transformations. Experimental results demonstrate that our proposed algorithm can fast rigidly register 3-D medical images and is reliable for aligning 3-D scans even when they exhibit a poor initialization.

A high-accuracy image registration algorithm using phase-only correlation for dental radiographs

International Nuclear Information System (INIS)

Ito, Koichi; Nikaido, Akira; Aoki, Takafumi; Kosuge, Eiko; Kawamata, Ryota; Kashima, Isamu

2008-01-01

Dental radiographs have been used for the accurate assessment and treatment of dental diseases. The nonlinear deformation between two dental radiographs may be observed, even if they are taken from the same oral regions of the subject. For an accurate diagnosis, the complete geometric registration between radiographs is required. This paper presents an efficient dental radiograph registration algorithm using Phase-Only Correlation (POC) function. The use of phase components in 2D (two-dimensional) discrete Fourier transforms of dental radiograph images makes possible to achieve highly robust image registration and recognition. Experimental evaluation using a dental radiograph database indicates that the proposed algorithm exhibits efficient recognition performance even for distorted radiographs. (author)

GPU-based streaming architectures for fast cone-beam CT image reconstruction and demons deformable registration

International Nuclear Information System (INIS)

Sharp, G C; Kandasamy, N; Singh, H; Folkert, M

2007-01-01

This paper shows how to significantly accelerate cone-beam CT reconstruction and 3D deformable image registration using the stream-processing model. We describe data-parallel designs for the Feldkamp, Davis and Kress (FDK) reconstruction algorithm, and the demons deformable registration algorithm, suitable for use on a commodity graphics processing unit. The streaming versions of these algorithms are implemented using the Brook programming environment and executed on an NVidia 8800 GPU. Performance results using CT data of a preserved swine lung indicate that the GPU-based implementations of the FDK and demons algorithms achieve a substantial speedup-up to 80 times for FDK and 70 times for demons when compared to an optimized reference implementation on a 2.8 GHz Intel processor. In addition, the accuracy of the GPU-based implementations was found to be excellent. Compared with CPU-based implementations, the RMS differences were less than 0.1 Hounsfield unit for reconstruction and less than 0.1 mm for deformable registration

Mapping of the prostate in endorectal coil-based MRI/MRSI and CT: A deformable registration and validation study

International Nuclear Information System (INIS)

Lian, J.; Xing, L.; Hunjan, S.; Dumoulin, C.; Levin, J.; Lo, A.; Watkins, R.; Rohling, K.; Giaquinto, R.; Kim, D.; Spielman, D.; Daniel, B.

2004-01-01

The endorectal coil is being increasingly used in magnetic resonance imaging (MRI) and MR spectroscopic imaging (MRSI) to obtain anatomic and metabolic images of the prostate with high signal-to-noise ratio (SNR). In practice, however, the use of endorectal probe inevitably distorts the prostate and other soft tissue organs, making the analysis and the use of the acquired image data in treatment planning difficult. The purpose of this work is to develop a deformable image registration algorithm to map the MRI/MRSI information obtained using an endorectal probe onto CT images and to verify the accuracy of the registration by phantom and patient studies. A mapping procedure involved using a thin plate spline (TPS) transformation was implemented to establish voxel-to-voxel correspondence between a reference image and a floating image with deformation. An elastic phantom with a number of implanted fiducial markers was designed for the validation of the quality of the registration. Radiographic images of the phantom were obtained before and after a series of intentionally introduced distortions. After mapping the distorted phantom to the original one, the displacements of the implanted markers were measured with respect to their ideal positions and the mean error was calculated. In patient studies, CT images of three prostate patients were acquired, followed by 3 Tesla (3 T) MR images with a rigid endorectal coil. Registration quality was estimated by the centroid position displacement and image coincidence index (CI). Phantom and patient studies show that TPS-based registration has achieved significantly higher accuracy than the previously reported method based on a rigid-body transformation and scaling. The technique should be useful to map the MR spectroscopic dataset acquired with ER probe onto the treatment planning CT dataset to guide radiotherapy planning

An automatic MRI/SPECT registration algorithm using image intensity and anatomical feature as matching characters: application on the evaluation of Parkinson's disease

International Nuclear Information System (INIS)

Lee, J.-D.; Huang, C.-H.; Weng, Y.-H.; Lin, K.-J.; Chen, C.-T.

2007-01-01

Single-photon emission computed tomography (SPECT) of dopamine transporters with 99m Tc-TRODAT-1 has recently been proposed to offer valuable information in assessing the functionality of dopaminergic systems. Magnetic resonance imaging (MRI) and SPECT imaging are important in the noninvasive examination of dopamine concentration in vivo. Therefore, this investigation presents an automated MRI/SPECT image registration algorithm based on a new similarity metric. This similarity metric combines anatomical features that are characterized by specific binding, the mean count per voxel in putamens and caudate nuclei, and the distribution of image intensity that is characterized by normalized mutual information (NMI). A preprocess, a novel two-cluster SPECT normalization algorithm, is also presented for MRI/SPECT registration. Clinical MRI/SPECT data from 18 healthy subjects and 13 Parkinson's disease (PD) patients are involved to validate the performance of the proposed algorithms. An appropriate color map, such as 'rainbow,' for image display enables the two-cluster SPECT normalization algorithm to provide clinically meaningful visual contrast. The proposed registration scheme reduces target registration error from >7 mm for conventional registration algorithm based on NMI to approximately 4 mm. The error in the specific/nonspecific 99m Tc-TRODAT-1 binding ratio, which is employed as a quantitative measure of TRODAT receptor binding, is also reduced from 0.45±0.22 to 0.08±0.06 among healthy subjects and from 0.28±0.18 to 0.12±0.09 among PD patients

Feature-based US to CT registration of the aortic root

Science.gov (United States)

Lang, Pencilla; Chen, Elvis C. S.; Guiraudon, Gerard M.; Jones, Doug L.; Bainbridge, Daniel; Chu, Michael W.; Drangova, Maria; Hata, Noby; Jain, Ameet; Peters, Terry M.

2011-03-01

A feature-based registration was developed to align biplane and tracked ultrasound images of the aortic root with a preoperative CT volume. In transcatheter aortic valve replacement, a prosthetic valve is inserted into the aortic annulus via a catheter. Poor anatomical visualization of the aortic root region can result in incorrect positioning, leading to significant morbidity and mortality. Registration of pre-operative CT to transesophageal ultrasound and fluoroscopy images is a major step towards providing augmented image guidance for this procedure. The proposed registration approach uses an iterative closest point algorithm to register a surface mesh generated from CT to 3D US points reconstructed from a single biplane US acquisition, or multiple tracked US images. The use of a single simultaneous acquisition biplane image eliminates reconstruction error introduced by cardiac gating and TEE probe tracking, creating potential for real-time intra-operative registration. A simple initialization procedure is used to minimize changes to operating room workflow. The algorithm is tested on images acquired from excised porcine hearts. Results demonstrate a clinically acceptable accuracy of 2.6mm and 5mm for tracked US to CT and biplane US to CT registration respectively.

Algorithms for selecting informative marker panels for population assignment.

Science.gov (United States)

Rosenberg, Noah A

2005-11-01

Given a set of potential source populations, genotypes of an individual of unknown origin at a collection of markers can be used to predict the correct source population of the individual. For improved efficiency, informative markers can be chosen from a larger set of markers to maximize the accuracy of this prediction. However, selecting the loci that are individually most informative does not necessarily produce the optimal panel. Here, using genotypes from eight species--carp, cat, chicken, dog, fly, grayling, human, and maize--this univariate accumulation procedure is compared to new multivariate "greedy" and "maximin" algorithms for choosing marker panels. The procedures generally suggest similar panels, although the greedy method often recommends inclusion of loci that are not chosen by the other algorithms. In seven of the eight species, when applied to five or more markers, all methods achieve at least 94% assignment accuracy on simulated individuals, with one species--dog--producing this level of accuracy with only three markers, and the eighth species--human--requiring approximately 13-16 markers. The new algorithms produce substantial improvements over use of randomly selected markers; where differences among the methods are noticeable, the greedy algorithm leads to slightly higher probabilities of correct assignment. Although none of the approaches necessarily chooses the panel with optimal performance, the algorithms all likely select panels with performance near enough to the maximum that they all are suitable for practical use.

Deformable Image Registration with Inclusion of Autodetected Homologous Tissue Features

Directory of Open Access Journals (Sweden)

Qingsong Zhu

2012-01-01

Full Text Available A novel deformable registration algorithm is proposed in the application of radiation therapy. The algorithm starts with autodetection of a number of points with distinct tissue features. The feature points are then matched by using the scale invariance features transform (SIFT method. The associated feature point pairs are served as landmarks for the subsequent thin plate spline (TPS interpolation. Several registration experiments using both digital phantom and clinical data demonstrate the accuracy and efficiency of the method. For the 3D phantom case, markers with error less than 2 mm are over 85% of total test markers, and it takes only 2-3 minutes for 3D feature points association. The proposed method provides a clinically practical solution and should be valuable for various image-guided radiation therapy (IGRT applications.

Image registration algorithm for high-voltage electric power live line working robot based on binocular vision

Science.gov (United States)

Li, Chengqi; Ren, Zhigang; Yang, Bo; An, Qinghao; Yu, Xiangru; Li, Jinping

2017-12-01

In the process of dismounting and assembling the drop switch for the high-voltage electric power live line working (EPL2W) robot, one of the key problems is the precision of positioning for manipulators, gripper and the bolts used to fix drop switch. To solve it, we study the binocular vision system theory of the robot and the characteristic of dismounting and assembling drop switch. We propose a coarse-to-fine image registration algorithm based on image correlation, which can improve the positioning precision of manipulators and bolt significantly. The algorithm performs the following three steps: firstly, the target points are marked respectively in the right and left visions, and then the system judges whether the target point in right vision can satisfy the lowest registration accuracy by using the similarity of target points' backgrounds in right and left visions, this is a typical coarse-to-fine strategy; secondly, the system calculates the epipolar line, and then the regional sequence existing matching points is generated according to neighborhood of epipolar line, the optimal matching image is confirmed by calculating the similarity between template image in left vision and the region in regional sequence according to correlation matching; finally, the precise coordinates of target points in right and left visions are calculated according to the optimal matching image. The experiment results indicate that the positioning accuracy of image coordinate is within 2 pixels, the positioning accuracy in the world coordinate system is within 3 mm, the positioning accuracy of binocular vision satisfies the requirement dismounting and assembling the drop switch.

Fast time-of-flight camera based surface registration for radiotherapy patient positioning.

Science.gov (United States)

Placht, Simon; Stancanello, Joseph; Schaller, Christian; Balda, Michael; Angelopoulou, Elli

2012-01-01

This work introduces a rigid registration framework for patient positioning in radiotherapy, based on real-time surface acquisition by a time-of-flight (ToF) camera. Dynamic properties of the system are also investigated for future gating/tracking strategies. A novel preregistration algorithm, based on translation and rotation-invariant features representing surface structures, was developed. Using these features, corresponding three-dimensional points were computed in order to determine initial registration parameters. These parameters became a robust input to an accelerated version of the iterative closest point (ICP) algorithm for the fine-tuning of the registration result. Distance calibration and Kalman filtering were used to compensate for ToF-camera dependent noise. Additionally, the advantage of using the feature based preregistration over an "ICP only" strategy was evaluated, as well as the robustness of the rigid-transformation-based method to deformation. The proposed surface registration method was validated using phantom data. A mean target registration error (TRE) for translations and rotations of 1.62 ± 1.08 mm and 0.07° ± 0.05°, respectively, was achieved. There was a temporal delay of about 65 ms in the registration output, which can be seen as negligible considering the dynamics of biological systems. Feature based preregistration allowed for accurate and robust registrations even at very large initial displacements. Deformations affected the accuracy of the results, necessitating particular care in cases of deformed surfaces. The proposed solution is able to solve surface registration problems with an accuracy suitable for radiotherapy cases where external surfaces offer primary or complementary information to patient positioning. The system shows promising dynamic properties for its use in gating/tracking applications. The overall system is competitive with commonly-used surface registration technologies. Its main benefit is the

Fast time-of-flight camera based surface registration for radiotherapy patient positioning

International Nuclear Information System (INIS)

Placht, Simon; Stancanello, Joseph; Schaller, Christian; Balda, Michael; Angelopoulou, Elli

2012-01-01

Purpose: This work introduces a rigid registration framework for patient positioning in radiotherapy, based on real-time surface acquisition by a time-of-flight (ToF) camera. Dynamic properties of the system are also investigated for future gating/tracking strategies. Methods: A novel preregistration algorithm, based on translation and rotation-invariant features representing surface structures, was developed. Using these features, corresponding three-dimensional points were computed in order to determine initial registration parameters. These parameters became a robust input to an accelerated version of the iterative closest point (ICP) algorithm for the fine-tuning of the registration result. Distance calibration and Kalman filtering were used to compensate for ToF-camera dependent noise. Additionally, the advantage of using the feature based preregistration over an ''ICP only'' strategy was evaluated, as well as the robustness of the rigid-transformation-based method to deformation. Results: The proposed surface registration method was validated using phantom data. A mean target registration error (TRE) for translations and rotations of 1.62 ± 1.08 mm and 0.07 deg. ± 0.05 deg., respectively, was achieved. There was a temporal delay of about 65 ms in the registration output, which can be seen as negligible considering the dynamics of biological systems. Feature based preregistration allowed for accurate and robust registrations even at very large initial displacements. Deformations affected the accuracy of the results, necessitating particular care in cases of deformed surfaces. Conclusions: The proposed solution is able to solve surface registration problems with an accuracy suitable for radiotherapy cases where external surfaces offer primary or complementary information to patient positioning. The system shows promising dynamic properties for its use in gating/tracking applications. The overall system is competitive with commonly-used surface registration

FEM-based evaluation of deformable image registration for radiation therapy

International Nuclear Information System (INIS)

Zhong Hualiang; Peters, Terry; Siebers, Jeffrey V

2007-01-01

This paper presents a new concept to automatically detect the neighborhood in an image where deformable registration is mis-performing. Specifically, the displacement vector field (DVF) from a deformable image registration is substituted into a finite-element-based elastic framework to calculate unbalanced energy in each element. The value of the derived energy indicates the quality of the DVF in its neighborhood. The new voxel-based evaluation approach is compared with three other validation criteria: landmark measurement, a finite element approach and visual comparison, for deformable registrations performed with the optical-flow-based 'demons' algorithm as well as thin-plate spline interpolation. This analysis was performed on three pairs of prostate CT images. The results of the analysis show that the four criteria give mutually comparable quantitative assessments on the six registration instances. As an objective concept, the unbalanced energy presents no requirement on boundary constraints in its calculation, different from traditional mechanical modeling. This method is automatic, and at voxel level suitable to evaluate deformable registration in a clinical setting

elastix: a toolbox for intensity-based medical image registration.

Science.gov (United States)

Klein, Stefan; Staring, Marius; Murphy, Keelin; Viergever, Max A; Pluim, Josien P W

2010-01-01

Medical image registration is an important task in medical image processing. It refers to the process of aligning data sets, possibly from different modalities (e.g., magnetic resonance and computed tomography), different time points (e.g., follow-up scans), and/or different subjects (in case of population studies). A large number of methods for image registration are described in the literature. Unfortunately, there is not one method that works for all applications. We have therefore developed elastix, a publicly available computer program for intensity-based medical image registration. The software consists of a collection of algorithms that are commonly used to solve medical image registration problems. The modular design of elastix allows the user to quickly configure, test, and compare different registration methods for a specific application. The command-line interface enables automated processing of large numbers of data sets, by means of scripting. The usage of elastix for comparing different registration methods is illustrated with three example experiments, in which individual components of the registration method are varied.

Development and experimental evaluation of an automatic marker registration system for tracking of augmented reality

International Nuclear Information System (INIS)

Yan, Wei-da; Yang Shou-feng; Ishii, Hirotake; Shimoda, Hiroshi; Izumi, Masanori

2010-01-01

In order to apply augmented reality in plant maintenance activities it is necessary to use real-time high accuracy tracking technology. One of the most efficient tracking methods is using paper-based markers and computing the relative position and orientation between a vision sensor (camera) and the markers through image processing and geometry calculations. In this method, the 3D-position of each marker is needed before tracking, but it is inefficient to measure all the markers manually. In this study, an automatic marker registration system was developed so as to measure the 3D-position of each marker automatically. The system is composed of a camera, a laser rangefinder and a motion base, which is used to control the pose of the laser rangefinder. A computer, connected to them, is used for controlling the system and for data transport. The results of the experimental evaluations show that the measurement takes about 21 seconds per marker and that the Root Mean Square Error (RMSE) of the position measurements is 3.5 mm. The feasibility evaluation of the system was conducted in Fugen nuclear plant. The results show that the system can largely reduce the preparatory workload of an AR application in a Nuclear Power Plant (NPP). (author)

Parallel Processing and Bio-inspired Computing for Biomedical Image Registration

Directory of Open Access Journals (Sweden)

Silviu Ioan Bejinariu

2014-07-01

Full Text Available Image Registration (IR is an optimization problem computing optimal parameters of a geometric transform used to overlay one or more source images to a given model by maximizing a similarity measure. In this paper the use of bio-inspired optimization algorithms in image registration is analyzed. Results obtained by means of three different algorithms are compared: Bacterial Foraging Optimization Algorithm (BFOA, Genetic Algorithm (GA and Clonal Selection Algorithm (CSA. Depending on the images type, the registration may be: area based, which is slow but more precise, and features based, which is faster. In this paper a feature based approach based on the Scale Invariant Feature Transform (SIFT is proposed. Finally, results obtained using sequential and parallel implementations on multi-core systems for area based and features based image registration are compared.

An algorithm for longitudinal registration of PET/CT images acquired during neoadjuvant chemotherapy in breast cancer: preliminary results.

Science.gov (United States)

Li, Xia; Abramson, Richard G; Arlinghaus, Lori R; Chakravarthy, Anuradha Bapsi; Abramson, Vandana; Mayer, Ingrid; Farley, Jaime; Delbeke, Dominique; Yankeelov, Thomas E

2012-11-16

By providing estimates of tumor glucose metabolism, 18F-fluorodeoxyglucose positron emission tomography (FDG-PET) can potentially characterize the response of breast tumors to treatment. To assess therapy response, serial measurements of FDG-PET parameters (derived from static and/or dynamic images) can be obtained at different time points during the course of treatment. However, most studies track the changes in average parameter values obtained from the whole tumor, thereby discarding all spatial information manifested in tumor heterogeneity. Here, we propose a method whereby serially acquired FDG-PET breast data sets can be spatially co-registered to enable the spatial comparison of parameter maps at the voxel level. The goal is to optimally register normal tissues while simultaneously preventing tumor distortion. In order to accomplish this, we constructed a PET support device to enable PET/CT imaging of the breasts of ten patients in the prone position and applied a mutual information-based rigid body registration followed by a non-rigid registration. The non-rigid registration algorithm extended the adaptive bases algorithm (ABA) by incorporating a tumor volume-preserving constraint, which computed the Jacobian determinant over the tumor regions as outlined on the PET/CT images, into the cost function. We tested this approach on ten breast cancer patients undergoing neoadjuvant chemotherapy. By both qualitative and quantitative evaluation, our constrained algorithm yielded significantly less tumor distortion than the unconstrained algorithm: considering the tumor volume determined from standard uptake value maps, the post-registration median tumor volume changes, and the 25th and 75th quantiles were 3.42% (0%, 13.39%) and 16.93% (9.21%, 49.93%) for the constrained and unconstrained algorithms, respectively (p = 0.002), while the bending energy (a measure of the smoothness of the deformation) was 0.0015 (0.0005, 0.012) and 0.017 (0.005, 0

A novel scheme for automatic nonrigid image registration using deformation invariant feature and geometric constraint

Science.gov (United States)

Deng, Zhipeng; Lei, Lin; Zhou, Shilin

2015-10-01

Automatic image registration is a vital yet challenging task, particularly for non-rigid deformation images which are more complicated and common in remote sensing images, such as distorted UAV (unmanned aerial vehicle) images or scanning imaging images caused by flutter. Traditional non-rigid image registration methods are based on the correctly matched corresponding landmarks, which usually needs artificial markers. It is a rather challenging task to locate the accurate position of the points and get accurate homonymy point sets. In this paper, we proposed an automatic non-rigid image registration algorithm which mainly consists of three steps: To begin with, we introduce an automatic feature point extraction method based on non-linear scale space and uniform distribution strategy to extract the points which are uniform distributed along the edge of the image. Next, we propose a hybrid point matching algorithm using DaLI (Deformation and Light Invariant) descriptor and local affine invariant geometric constraint based on triangulation which is constructed by K-nearest neighbor algorithm. Based on the accurate homonymy point sets, the two images are registrated by the model of TPS (Thin Plate Spline). Our method is demonstrated by three deliberately designed experiments. The first two experiments are designed to evaluate the distribution of point set and the correctly matching rate on synthetic data and real data respectively. The last experiment is designed on the non-rigid deformation remote sensing images and the three experimental results demonstrate the accuracy, robustness, and efficiency of the proposed algorithm compared with other traditional methods.

FPFH-based graph matching for 3D point cloud registration

Science.gov (United States)

Zhao, Jiapeng; Li, Chen; Tian, Lihua; Zhu, Jihua

2018-04-01

Correspondence detection is a vital step in point cloud registration and it can help getting a reliable initial alignment. In this paper, we put forward an advanced point feature-based graph matching algorithm to solve the initial alignment problem of rigid 3D point cloud registration with partial overlap. Specifically, Fast Point Feature Histograms are used to determine the initial possible correspondences firstly. Next, a new objective function is provided to make the graph matching more suitable for partially overlapping point cloud. The objective function is optimized by the simulated annealing algorithm for final group of correct correspondences. Finally, we present a novel set partitioning method which can transform the NP-hard optimization problem into a O(n3)-solvable one. Experiments on the Stanford and UWA public data sets indicates that our method can obtain better result in terms of both accuracy and time cost compared with other point cloud registration methods.

[Accurate 3D free-form registration between fan-beam CT and cone-beam CT].

Science.gov (United States)

Liang, Yueqiang; Xu, Hongbing; Li, Baosheng; Li, Hongsheng; Yang, Fujun

2012-06-01

Because the X-ray scatters, the CT numbers in cone-beam CT cannot exactly correspond to the electron densities. This, therefore, results in registration error when the intensity-based registration algorithm is used to register planning fan-beam CT and cone-beam CT. In order to reduce the registration error, we have developed an accurate gradient-based registration algorithm. The gradient-based deformable registration problem is described as a minimization of energy functional. Through the calculus of variations and Gauss-Seidel finite difference method, we derived the iterative formula of the deformable registration. The algorithm was implemented by GPU through OpenCL framework, with which the registration time was greatly reduced. Our experimental results showed that the proposed gradient-based registration algorithm could register more accurately the clinical cone-beam CT and fan-beam CT images compared with the intensity-based algorithm. The GPU-accelerated algorithm meets the real-time requirement in the online adaptive radiotherapy.

Increasing the automation of a 2D-3D registration system.

Science.gov (United States)

Varnavas, Andreas; Carrell, Tom; Penney, Graeme

2013-02-01

Routine clinical use of 2D-3D registration algorithms for Image Guided Surgery remains limited. A key aspect for routine clinical use of this technology is its degree of automation, i.e., the amount of necessary knowledgeable interaction between the clinicians and the registration system. Current image-based registration approaches usually require knowledgeable manual interaction during two stages: for initial pose estimation and for verification of produced results. We propose four novel techniques, particularly suited to vertebra-based registration systems, which can significantly automate both of the above stages. Two of these techniques are based upon the intraoperative "insertion" of a virtual fiducial marker into the preoperative data. The remaining two techniques use the final registration similarity value between multiple CT vertebrae and a single fluoroscopy vertebra. The proposed methods were evaluated with data from 31 operations (31 CT scans, 419 fluoroscopy images). Results show these methods can remove the need for manual vertebra identification during initial pose estimation, and were also very effective for result verification, producing a combined true positive rate of 100% and false positive rate equal to zero. This large decrease in required knowledgeable interaction is an important contribution aiming to enable more widespread use of 2D-3D registration technology.

Spherical Demons: Fast Surface Registration

Science.gov (United States)

Yeo, B.T. Thomas; Sabuncu, Mert; Vercauteren, Tom; Ayache, Nicholas; Fischl, Bruce; Golland, Polina

2009-01-01

We present the fast Spherical Demons algorithm for registering two spherical images. By exploiting spherical vector spline interpolation theory, we show that a large class of regularizers for the modified demons objective function can be efficiently implemented on the sphere using convolution. Based on the one parameter subgroups of diffeomorphisms, the resulting registration is diffeomorphic and fast – registration of two cortical mesh models with more than 100k nodes takes less than 5 minutes, comparable to the fastest surface registration algorithms. Moreover, the accuracy of our method compares favorably to the popular FreeSurfer registration algorithm. We validate the technique in two different settings: (1) parcellation in a set of in-vivo cortical surfaces and (2) Brodmann area localization in ex-vivo cortical surfaces. PMID:18979813

Improving Intensity-Based Lung CT Registration Accuracy Utilizing Vascular Information

Directory of Open Access Journals (Sweden)

Kunlin Cao

2012-01-01

Full Text Available Accurate pulmonary image registration is a challenging problem when the lungs have a deformation with large distance. In this work, we present a nonrigid volumetric registration algorithm to track lung motion between a pair of intrasubject CT images acquired at different inflation levels and introduce a new vesselness similarity cost that improves intensity-only registration. Volumetric CT datasets from six human subjects were used in this study. The performance of four intensity-only registration algorithms was compared with and without adding the vesselness similarity cost function. Matching accuracy was evaluated using landmarks, vessel tree, and fissure planes. The Jacobian determinant of the transformation was used to reveal the deformation pattern of local parenchymal tissue. The average matching error for intensity-only registration methods was on the order of 1 mm at landmarks and 1.5 mm on fissure planes. After adding the vesselness preserving cost function, the landmark and fissure positioning errors decreased approximately by 25% and 30%, respectively. The vesselness cost function effectively helped improve the registration accuracy in regions near thoracic cage and near the diaphragm for all the intensity-only registration algorithms tested and also helped produce more consistent and more reliable patterns of regional tissue deformation.

PET-MR image fusion in soft tissue sarcoma: accuracy, reliability and practicality of interactive point-based and automated mutual information techniques

International Nuclear Information System (INIS)

Somer, Edward J.R.; Marsden, Paul K.; Benatar, Nigel A.; O'Doherty, Michael J.; Goodey, Joanne; Smith, Michael A.

2003-01-01

The fusion of functional positron emission tomography (PET) data with anatomical magnetic resonance (MR) or computed tomography images, using a variety of interactive and automated techniques, is becoming commonplace, with the technique of choice dependent on the specific application. The case of PET-MR image fusion in soft tissue is complicated by a lack of conspicuous anatomical features and deviation from the rigid-body model. Here we compare a point-based external marker technique with an automated mutual information algorithm and discuss the practicality, reliability and accuracy of each when applied to the study of soft tissue sarcoma. Ten subjects with suspected sarcoma in the knee, thigh, groin, flank or back underwent MR and PET scanning after the attachment of nine external fiducial markers. In the assessment of the point-based technique, three error measures were considered: fiducial localisation error (FLE), fiducial registration error (FRE) and target registration error (TRE). FLE, which represents the accuracy with which the fiducial points can be located, is related to the FRE minimised by the registration algorithm. The registration accuracy is best characterised by the TRE, which is the distance between corresponding points in each image space after registration. In the absence of salient features within the target volume, the TRE can be measured at fiducials excluded from the registration process. To assess the mutual information technique, PET data, acquired after physically removing the markers, were reconstructed in a variety of ways and registered with MR. Having applied the transform suggested by the algorithm to the PET scan acquired before the markers were removed, the residual distance between PET and MR marker-pairs could be measured. The manual point-based technique yielded the best results (RMS TRE =8.3 mm, max =22.4 mm, min =1.7 mm), performing better than the automated algorithm (RMS TRE =20.0 mm, max =30.5 mm, min =7.7 mm) when

A GLOBAL REGISTRATION ALGORITHM OF THE SINGLE-CLOSED RING MULTI-STATIONS POINT CLOUD

Directory of Open Access Journals (Sweden)

R. Yang

2018-04-01

Full Text Available Aimed at the global registration problem of the single-closed ring multi-stations point cloud, a formula in order to calculate the error of rotation matrix was constructed according to the definition of error. The global registration algorithm of multi-station point cloud was derived to minimize the error of rotation matrix. And fast-computing formulas of transformation matrix with whose implementation steps and simulation experiment scheme was given. Compared three different processing schemes of multi-station point cloud, the experimental results showed that the effectiveness of the new global registration method was verified, and it could effectively complete the global registration of point cloud.

A comparative study of surface- and volume-based techniques for the automatic registration between CT and SPECT brain images

International Nuclear Information System (INIS)

Kagadis, George C.; Delibasis, Konstantinos K.; Matsopoulos, George K.; Mouravliansky, Nikolaos A.; Asvestas, Pantelis A.; Nikiforidis, George C.

2002-01-01

Image registration of multimodality images is an essential task in numerous applications in three-dimensional medical image processing. Medical diagnosis can benefit from the complementary information in different modality images. Surface-based registration techniques, while still widely used, were succeeded by volume-based registration algorithms that appear to be theoretically advantageous in terms of reliability and accuracy. Several applications of such algorithms for the registration of CT-MRI, CT-PET, MRI-PET, and SPECT-MRI images have emerged in the literature, using local optimization techniques for the matching of images. Our purpose in this work is the development of automatic techniques for the registration of real CT and SPECT images, based on either surface- or volume-based algorithms. Optimization is achieved using genetic algorithms that are known for their robustness. The two techniques are compared against a well-established method, the Iterative Closest Point--ICP. The correlation coefficient was employed as an independent measure of spatial match, to produce unbiased results. The repeated measures ANOVA indicates the significant impact of the choice of registration method on the magnitude of the correlation (F=4.968, p=0.0396). The volume-based method achieves an average correlation coefficient value of 0.454 with a standard deviation of 0.0395, as opposed to an average of 0.380 with a standard deviation of 0.0603 achieved by the surface-based method and an average of 0.396 with a standard deviation equal to 0.0353 achieved by ICP. The volume-based technique performs significantly better compared to both ICP (p<0.05, Neuman Keuls test) and the surface-based technique (p<0.05, Neuman-Keuls test). Surface-based registration and ICP do not differ significantly in performance

Fast fluid registration of medical images

DEFF Research Database (Denmark)

Bro-Nielsen, Morten; Gramkow, Claus

1996-01-01

This paper offers a new fast algorithm for non-rigid viscous fluid registration of medical images that is at least an order of magnitude faster than the previous method by (Christensen et al., 1994). The core algorithm in the fluid registration method is based on a linear elastic deformation...

Image-based RSA: Roentgen stereophotogrammetric analysis based on 2D-3D image registration.

Science.gov (United States)

de Bruin, P W; Kaptein, B L; Stoel, B C; Reiber, J H C; Rozing, P M; Valstar, E R

2008-01-01

Image-based Roentgen stereophotogrammetric analysis (IBRSA) integrates 2D-3D image registration and conventional RSA. Instead of radiopaque RSA bone markers, IBRSA uses 3D CT data, from which digitally reconstructed radiographs (DRRs) are generated. Using 2D-3D image registration, the 3D pose of the CT is iteratively adjusted such that the generated DRRs resemble the 2D RSA images as closely as possible, according to an image matching metric. Effectively, by registering all 2D follow-up moments to the same 3D CT, the CT volume functions as common ground. In two experiments, using RSA and using a micromanipulator as gold standard, IBRSA has been validated on cadaveric and sawbone scapula radiographs, and good matching results have been achieved. The accuracy was: |mu |RSA but higher than in vivo standard RSA. Because IBRSA does not require radiopaque markers, it adds functionality to the RSA method by opening new directions and possibilities for research, such as dynamic analyses using fluoroscopy on subjects without markers and computer navigation applications.

Evaluation of algorithms used to order markers on genetic maps.

Science.gov (United States)

Mollinari, M; Margarido, G R A; Vencovsky, R; Garcia, A A F

2009-12-01

When building genetic maps, it is necessary to choose from several marker ordering algorithms and criteria, and the choice is not always simple. In this study, we evaluate the efficiency of algorithms try (TRY), seriation (SER), rapid chain delineation (RCD), recombination counting and ordering (RECORD) and unidirectional growth (UG), as well as the criteria PARF (product of adjacent recombination fractions), SARF (sum of adjacent recombination fractions), SALOD (sum of adjacent LOD scores) and LHMC (likelihood through hidden Markov chains), used with the RIPPLE algorithm for error verification, in the construction of genetic linkage maps. A linkage map of a hypothetical diploid and monoecious plant species was simulated containing one linkage group and 21 markers with fixed distance of 3 cM between them. In all, 700 F(2) populations were randomly simulated with 100 and 400 individuals with different combinations of dominant and co-dominant markers, as well as 10 and 20% of missing data. The simulations showed that, in the presence of co-dominant markers only, any combination of algorithm and criteria may be used, even for a reduced population size. In the case of a smaller proportion of dominant markers, any of the algorithms and criteria (except SALOD) investigated may be used. In the presence of high proportions of dominant markers and smaller samples (around 100), the probability of repulsion linkage increases between them and, in this case, use of the algorithms TRY and SER associated to RIPPLE with criterion LHMC would provide better results.

Spline-based image-to-volume registration for three-dimensional electron microscopy

International Nuclear Information System (INIS)

Jonic, S.; Sorzano, C.O.S.; Thevenaz, P.; El-Bez, C.; De Carlo, S.; Unser, M.

2005-01-01

This paper presents an algorithm based on a continuous framework for a posteriori angular and translational assignment in three-dimensional electron microscopy (3DEM) of single particles. Our algorithm can be used advantageously to refine the assignment of standard quantized-parameter methods by registering the images to a reference 3D particle model. We achieve the registration by employing a gradient-based iterative minimization of a least-squares measure of dissimilarity between an image and a projection of the volume in the Fourier transform (FT) domain. We compute the FT of the projection using the central-slice theorem (CST). To compute the gradient accurately, we take advantage of a cubic B-spline model of the data in the frequency domain. To improve the robustness of the algorithm, we weight the cost function in the FT domain and apply a 'mixed' strategy for the assignment based on the minimum value of the cost function at registration for several different initializations. We validate our algorithm in a fully controlled simulation environment. We show that the mixed strategy improves the assignment accuracy; on our data, the quality of the angular and translational assignment was better than 2 voxel (i.e., 6.54 A). We also test the performance of our algorithm on real EM data. We conclude that our algorithm outperforms a standard projection-matching refinement in terms of both consistency of 3D reconstructions and speed

Fiducial registration error as a statistical process control metric in image-guided radiotherapy with prostatic markers

International Nuclear Information System (INIS)

Ung, M.N.; Wee, Leonard

2010-01-01

Full text: Portal imaging of implanted fiducial markers has been in use for image-guided radiotherapy (TORT) of prostate cancer, with ample attention to localization accuracy and organ motion. The geometric uncertainties in point-based rigid-body (PBRB) image registration during localization of prostate fiducial markers can be quantified in terms of a fiducial registration error (FRE). Statistical process control charts for individual patients can be designed to identify potentially significant deviation of FRE from expected behaviour. In this study, the aim was to retrospectively apply statistical process control methods to FREs in 34 individuals to identify parameters that may impact on the process stability in image-based localization. A robust procedure for estimating control parameters, control lim its and fixed tolerance levels from a small number of initial observations has been proposed and discussed. Four distinct types of qualitative control chart behavior have been observed. Probable clinical factors leading to IORT process instability are discussed in light of the control chart behaviour. Control charts have been shown to be a useful decision-making tool for detecting potentially out-of control processes on an individual basis. It can sensitively identify potential problems that warrant more detailed investigation in the 10RT of prostate cancer.

Transmission imaging for registration of ictal and interictal single-photon emission tomography, magnetic resonance imaging and electroencephalography

Energy Technology Data Exchange (ETDEWEB)

Sipilae, O. [Epilepsy Unit, Neurology, Hospital for Children and Adolescents, Helsinki University Central Hospital (Finland); Laboratory of Biomedical Engineering, Helsinki University of Technology, P.O. Box 2200, FIN-02015 HUT (Finland); Nikkinen, P.; Liewendahl, K. [Division of Nuclear Medicine, Laboratory Department, Helsinki University Central Hospital (Finland); Savolainen, S. [Division of Nuclear Medicine, Laboratory Department, Helsinki University Central Hospital (Finland); Department of Radiology, Helsinki University Central Hospital (Finland); Granstroem, M.-L.; Gaily, E. [Epilepsy Unit, Neurology, Hospital for Children and Adolescents, Helsinki University Central Hospital (Finland); Poutanen, V.-P. [Department of Radiology, Helsinki University Central Hospital (Finland); Pohjonen, H. [Technology Development Centre, P.O. Box 69, 00101 Helsinki (Finland)

2000-02-01

A method developed for registration of ictal and interictal single-photon emission tomography (SPET), magnetic resonance imaging (MRI) and electroencephalography (EEG) is described. For SPET studies, technetium-99m ethyl cysteinate dimer (ECD) was injected intravenously while the patient was monitored on video-EEG to document the ictal or interictal state. Imaging was performed using a triple-head gamma camera equipped with a transmission imaging device using a gadolinium-153 source. The images (128 x 128 pixels, voxel size 3.7 x 3.7 x 3.6 mm{sup 3}) were reconstructed using an iterative algorithm and postfiltered with a Wiener filter. The gold-plated silver electrodes on the patient's scalp were utilized as markers for registration of the ictal and interictal SPET images, as these metallic markers were clearly seen on the transmission images. Fitting of the marker sets was based on a non-iterative least squares method. The interictal SPET image was subtracted from the ictal image after scaling. The T1-weighted MPRAGE MR images with voxel size of 1.0 x 1.0 x 1.0 mm{sup 3} were obtained with a 1.5-T scanner. For registration of MR and subtraction SPET images, the external marker set of the ictal SPET study was fitted to the surface of the head segmented from MR images. The SPET registration was tested with a phantom experiment. Registration of ictal and interictal SPET in five patient studies resulted in a 2-mm RMS residual of the marker sets. The estimated RMS error of registration in the final result combining locations of the electrodes, subtraction SPET and MR images was 3-5 mm. In conclusion, transmission imaging can be utilized for an accurate and easily implemented registration procedure for ictal and interictal SPET, MRI and EEG. (orig.)

Registration of TLS and MLS Point Cloud Combining Genetic Algorithm with ICP

Directory of Open Access Journals (Sweden)

YAN Li

2018-04-01

Full Text Available Large scene point cloud can be quickly acquired by mobile laser scanning (MLS technology,which needs to be supplemented by terrestrial laser scanning (TLS point cloud because of limited field of view and occlusion.MLS and TLS point cloud are located in geodetic coordinate system and local coordinate system respectively.This paper proposes an automatic registration method combined genetic algorithm (GA and iterative closed point ICP to achieve a uniform coordinate reference frame.The local optimizer is utilized in ICP.The efficiency of ICP is higher than that of GA registration,but it depends on a initial solution.GA is a global optimizer,but it's inefficient.The combining strategy is that ICP is enabled to complete the registration when the GA tends to local search.The rough position measured by a built-in GPS of a terrestrial laser scanner is used in the GA registration to limit its optimizing search space.To improve the GA registration accuracy,a maximum registration model called normalized sum of matching scores (NSMS is presented.The results for measured data show that the NSMS model is effective,the root mean square error (RMSE of GA registration is 1~5 cm and the registration efficiency can be improved by about 50% combining GA with ICP.

Prognostic significance of immunohistochemistry-based markers and algorithms in immunochemotherapy-treated diffuse large B cell lymphoma patients.

Science.gov (United States)

Culpin, Rachel E; Sieniawski, Michal; Angus, Brian; Menon, Geetha K; Proctor, Stephen J; Milne, Paul; McCabe, Kate; Mainou-Fowler, Tryfonia

2013-12-01

To reassess the prognostic validity of immunohistochemical markers and algorithms identified in the CHOP era in immunochemotherapy-treated diffuse large B cell lymphoma patients. The prognostic significance of immunohistochemical markers (CD10, Bcl-6, Bcl-2, MUM1, Ki-67, CD5, GCET1, FoxP1, LMO2) and algorithms (Hans, Hans*, Muris, Choi, Choi*, Nyman, Visco-Young, Tally) was assessed using clinical diagnostic blocks taken from an unselected, population-based cohort of 190 patients treated with R-CHOP. Dichotomizing expression, low CD10 (<10%), low LMO2 (<70%) or high Bcl-2 (≥80%) predicted shorter overall survival (OS; P = 0.033, P = 0.010 and P = 0.008, respectively). High Bcl-2 (≥80%), low Bcl-6 (<60%), low GCET1 (<20%) or low LMO2 (<70%) predicted shorter progression-free survival (PFS; P = 0.001, P = 0.048, P = 0.045 and P = 0.002, respectively). The Hans, Hans* and Muris classifiers predicted OS (P = 0.022, P = 0.037 and P = 0.011) and PFS (P = 0.021, P = 0.020 and P = 0.004). The Choi, Choi* and Tally were associated with PFS (P = 0.049, P = 0.009 and P = 0.023). In multivariate analysis, the International Prognostic Index (IPI) was the only independent predictor of outcome (OS; HR: 2.60, P < 0.001 and PFS; HR: 2.91, P < 0.001). Results highlight the controversy surrounding immunohistochemistry-based algorithms in the R-CHOP era. The need for more robust markers, applicable to the clinic, for incorporation into improved prognostic systems is emphasized. © 2013 John Wiley & Sons Ltd.

Entropy-Based Block Processing for Satellite Image Registration

Directory of Open Access Journals (Sweden)

Ikhyun Lee

2012-11-01

Full Text Available Image registration is an important task in many computer vision applications such as fusion systems, 3D shape recovery and earth observation. Particularly, registering satellite images is challenging and time-consuming due to limited resources and large image size. In such scenario, state-of-the-art image registration methods such as scale-invariant feature transform (SIFT may not be suitable due to high processing time. In this paper, we propose an algorithm based on block processing via entropy to register satellite images. The performance of the proposed method is evaluated using different real images. The comparative analysis shows that it not only reduces the processing time but also enhances the accuracy.

Robustness and precision of an automatic marker detection algorithm for online prostate daily targeting using a standard V-EPID.

Science.gov (United States)

Aubin, S; Beaulieu, L; Pouliot, S; Pouliot, J; Roy, R; Girouard, L M; Martel-Brisson, N; Vigneault, E; Laverdière, J

2003-07-01

An algorithm for the daily localization of the prostate using implanted markers and a standard video-based electronic portal imaging device (V-EPID) has been tested. Prior to planning, three gold markers were implanted in the prostate of seven patients. The clinical images were acquired with a BeamViewPlus 2.1 V-EPID for each field during the normal course radiotherapy treatment and are used off-line to determine the ability of the automatic marker detection algorithm to adequately and consistently detect the markers. Clinical images were obtained with various dose levels from ranging 2.5 to 75 MU. The algorithm is based on marker attenuation characterization in the portal image and spatial distribution. A total of 1182 clinical images were taken. The results show an average efficiency of 93% for the markers detected individually and 85% for the group of markers. This algorithm accomplishes the detection and validation in 0.20-0.40 s. When the center of mass of the group of implanted markers is used, then all displacements can be corrected to within 1.0 mm in 84% of the cases and within 1.5 mm in 97% of cases. The standard video-based EPID tested provides excellent marker detection capability even with low dose levels. The V-EPID can be used successfully with radiopaque markers and the automatic detection algorithm to track and correct the daily setup deviations due to organ motions.

Inter-slice bidirectional registration-based segmentation of the prostate gland in MR and CT image sequences

Energy Technology Data Exchange (ETDEWEB)

Khalvati, Farzad, E-mail: farzad.khalvati@uwaterloo.ca; Tizhoosh, Hamid R. [Department of Systems Design Engineering, University of Waterloo, Waterloo, Ontario N2L 3G1 (Canada); Salmanpour, Aryan; Rahnamayan, Shahryar [Department of Engineering and Applied Science, University of Ontario Institute of Technology, Oshawa, Ontario L1H 7K4 (Canada); Rodrigues, George [Department of Radiation Oncology, London Regional Cancer Program, London, Ontario N6C 2R6, Canada and Department of Epidemiology/Biostatistics, University of Western Ontario, London, Ontario N6A 3K7 (Canada)

2013-12-15

Purpose: Accurate segmentation and volume estimation of the prostate gland in magnetic resonance (MR) and computed tomography (CT) images are necessary steps in diagnosis, treatment, and monitoring of prostate cancer. This paper presents an algorithm for the prostate gland volume estimation based on the semiautomated segmentation of individual slices in T2-weighted MR and CT image sequences. Methods: The proposedInter-Slice Bidirectional Registration-based Segmentation (iBRS) algorithm relies on interslice image registration of volume data to segment the prostate gland without the use of an anatomical atlas. It requires the user to mark only three slices in a given volume dataset, i.e., the first, middle, and last slices. Next, the proposed algorithm uses a registration algorithm to autosegment the remaining slices. We conducted comprehensive experiments to measure the performance of the proposed algorithm using three registration methods (i.e., rigid, affine, and nonrigid techniques). Results: The results with the proposed technique were compared with manual marking using prostate MR and CT images from 117 patients. Manual marking was performed by an expert user for all 117 patients. The median accuracies for individual slices measured using the Dice similarity coefficient (DSC) were 92% and 91% for MR and CT images, respectively. The iBRS algorithm was also evaluated regarding user variability, which confirmed that the algorithm was robust to interuser variability when marking the prostate gland. Conclusions: The proposed algorithm exploits the interslice data redundancy of the images in a volume dataset of MR and CT images and eliminates the need for an atlas, minimizing the computational cost while producing highly accurate results which are robust to interuser variability.

Inter-slice bidirectional registration-based segmentation of the prostate gland in MR and CT image sequences

International Nuclear Information System (INIS)

Khalvati, Farzad; Tizhoosh, Hamid R.; Salmanpour, Aryan; Rahnamayan, Shahryar; Rodrigues, George

2013-01-01

Purpose: Accurate segmentation and volume estimation of the prostate gland in magnetic resonance (MR) and computed tomography (CT) images are necessary steps in diagnosis, treatment, and monitoring of prostate cancer. This paper presents an algorithm for the prostate gland volume estimation based on the semiautomated segmentation of individual slices in T2-weighted MR and CT image sequences. Methods: The proposedInter-Slice Bidirectional Registration-based Segmentation (iBRS) algorithm relies on interslice image registration of volume data to segment the prostate gland without the use of an anatomical atlas. It requires the user to mark only three slices in a given volume dataset, i.e., the first, middle, and last slices. Next, the proposed algorithm uses a registration algorithm to autosegment the remaining slices. We conducted comprehensive experiments to measure the performance of the proposed algorithm using three registration methods (i.e., rigid, affine, and nonrigid techniques). Results: The results with the proposed technique were compared with manual marking using prostate MR and CT images from 117 patients. Manual marking was performed by an expert user for all 117 patients. The median accuracies for individual slices measured using the Dice similarity coefficient (DSC) were 92% and 91% for MR and CT images, respectively. The iBRS algorithm was also evaluated regarding user variability, which confirmed that the algorithm was robust to interuser variability when marking the prostate gland. Conclusions: The proposed algorithm exploits the interslice data redundancy of the images in a volume dataset of MR and CT images and eliminates the need for an atlas, minimizing the computational cost while producing highly accurate results which are robust to interuser variability

Wavelet based Image Registration Technique for Matching Dental x-rays

OpenAIRE

P. Ramprasad; H. C. Nagaraj; M. K. Parasuram

2008-01-01

Image registration plays an important role in the diagnosis of dental pathologies such as dental caries, alveolar bone loss and periapical lesions etc. This paper presents a new wavelet based algorithm for registering noisy and poor contrast dental x-rays. Proposed algorithm has two stages. First stage is a preprocessing stage, removes the noise from the x-ray images. Gaussian filter has been used. Second stage is a geometric transformation stage. Proposed work uses two l...

SU-F-J-88: Comparison of Two Deformable Image Registration Algorithms for CT-To-CT Contour Propagation

Energy Technology Data Exchange (ETDEWEB)

Gopal, A; Xu, H; Chen, S [University of Maryland School of Medicine, Columbia, MD (United States)

2016-06-15

Purpose: To compare the contour propagation accuracy of two deformable image registration (DIR) algorithms in the Raystation treatment planning system – the “Hybrid” algorithm based on image intensities and anatomical information; and the “Biomechanical” algorithm based on linear anatomical elasticity and finite element modeling. Methods: Both DIR algorithms were used for CT-to-CT deformation for 20 lung radiation therapy patients that underwent treatment plan revisions. Deformation accuracy was evaluated using landmark tracking to measure the target registration error (TRE) and inverse consistency error (ICE). The deformed contours were also evaluated against physician drawn contours using Dice similarity coefficients (DSC). Contour propagation was qualitatively assessed using a visual quality score assigned by physicians, and a refinement quality score (0based on the extent of manual refinement needed for acceptable quality. Results: Both algorithms showed similar ICE (< 1.5 mm), but the hybrid DIR (TRE = 3.2 mm) performed better than the biomechanical DIR (TRE = 4.3 mm) with landmark tracking. Both algorithms had comparable DSC (DSC > 0.9 for lungs, > 0.85 for heart, > 0.8 for liver) and similar qualitative assessments (VQS < 0.35, RQS > 0.75 for lungs). When anatomical structures were used to control the deformation, the DSC improved more significantly for the biomechanical DIR compared to the hybrid DIR, while the VQS and RQS improved only for the controlling structures. However, while the inclusion of controlling structures improved the TRE for the hybrid DIR, it increased the TRE for the biomechanical DIR. Conclusion: The hybrid DIR was found to perform slightly better than the biomechanical DIR based on lower TRE while the DSC, VQS, and RQS studies yielded comparable results for both. The use of controlling structures showed considerable improvement in the hybrid DIR results and is recommended for clinical use in

Ultrasound to video registration using a bi-plane transrectal probe with photoacoustic markers

Science.gov (United States)

Cheng, Alexis; Kang, Hyun Jae; Zhang, Haichong K.; Taylor, Russell H.; Boctor, Emad M.

2016-03-01

Modern surgical scenarios typically provide surgeons with additional information through fusion of video and other imaging modalities. To provide this information, the tools and devices used in surgery must be registered together with interventional guidance equipment and surgical navigation systems. In this work, we focus explicitly on registering ultrasound with a stereo camera system using photoacoustic markers. Previous work has shown that photoacoustic markers can be used in this registration task to achieve target registration errors lower than the current available systems. Photoacoustic markers are defined as a set of non-collinear laser spots projected onto some surface. They can be simultaneously visualized by a stereo camera system and an ultrasound transducer because of the photoacoustic effect. In more recent work, the three-dimensional ultrasound volume was replaced by images from a single ultrasound image pose from a convex array transducer. The feasibility of this approach was demonstrated, but the accuracy was lacking due to the physical limitations of the convex array transducer. In this work, we propose the use of a bi-plane transrectal ultrasound transducer. The main advantage of using this type of transducer is that the ultrasound elements are no longer restricted to a single plane. While this development would be limited to prostate applications, liver and kidney applications are also feasible if a suitable transducer is built. This work is demonstrated in two experiments, one without photoacoustic sources and one with. The resulting target registration error for these experiments were 1.07mm±0.35mm and 1.27mm+/-0.47mm respectively, both of which are better than current available navigation systems.

Improved image registration by sparse patch-based deformation estimation.

Science.gov (United States)

Kim, Minjeong; Wu, Guorong; Wang, Qian; Lee, Seong-Whan; Shen, Dinggang

2015-01-15

Despite intensive efforts for decades, deformable image registration is still a challenging problem due to the potential large anatomical differences across individual images, which limits the registration performance. Fortunately, this issue could be alleviated if a good initial deformation can be provided for the two images under registration, which are often termed as the moving subject and the fixed template, respectively. In this work, we present a novel patch-based initial deformation prediction framework for improving the performance of existing registration algorithms. Our main idea is to estimate the initial deformation between subject and template in a patch-wise fashion by using the sparse representation technique. We argue that two image patches should follow the same deformation toward the template image if their patch-wise appearance patterns are similar. To this end, our framework consists of two stages, i.e., the training stage and the application stage. In the training stage, we register all training images to the pre-selected template, such that the deformation of each training image with respect to the template is known. In the application stage, we apply the following four steps to efficiently calculate the initial deformation field for the new test subject: (1) We pick a small number of key points in the distinctive regions of the test subject; (2) for each key point, we extract a local patch and form a coupled appearance-deformation dictionary from training images where each dictionary atom consists of the image intensity patch as well as their respective local deformations; (3) a small set of training image patches in the coupled dictionary are selected to represent the image patch of each subject key point by sparse representation. Then, we can predict the initial deformation for each subject key point by propagating the pre-estimated deformations on the selected training patches with the same sparse representation coefficients; and (4) we

Genetic evolutionary taboo search for optimal marker placement in infrared patient setup

International Nuclear Information System (INIS)

Riboldi, M; Baroni, G; Spadea, M F; Tagaste, B; Garibaldi, C; Cambria, R; Orecchia, R; Pedotti, A

2007-01-01

In infrared patient setup adequate selection of the external fiducial configuration is required for compensating inner target displacements (target registration error, TRE). Genetic algorithms (GA) and taboo search (TS) were applied in a newly designed approach to optimal marker placement: the genetic evolutionary taboo search (GETS) algorithm. In the GETS paradigm, multiple solutions are simultaneously tested in a stochastic evolutionary scheme, where taboo-based decision making and adaptive memory guide the optimization process. The GETS algorithm was tested on a group of ten prostate patients, to be compared to standard optimization and to randomly selected configurations. The changes in the optimal marker configuration, when TRE is minimized for OARs, were specifically examined. Optimal GETS configurations ensured a 26.5% mean decrease in the TRE value, versus 19.4% for conventional quasi-Newton optimization. Common features in GETS marker configurations were highlighted in the dataset of ten patients, even when multiple runs of the stochastic algorithm were performed. Including OARs in TRE minimization did not considerably affect the spatial distribution of GETS marker configurations. In conclusion, the GETS algorithm proved to be highly effective in solving the optimal marker placement problem. Further work is needed to embed site-specific deformation models in the optimization process

Automatic selective feature retention in patient specific elastic surface registration

CSIR Research Space (South Africa)

Jansen van Rensburg, GJ

2011-01-01

Full Text Available The accuracy with which a recent elastic surface registration algorithm deforms the complex geometry of a skull is examined. This algorithm is then coupled to a line based algorithm as is frequently used in patient specific feature registration...

[Affine transformation-based automatic registration for peripheral digital subtraction angiography (DSA)].

Science.gov (United States)

Kong, Gang; Dai, Dao-Qing; Zou, Lu-Min

2008-07-01

In order to remove the artifacts of peripheral digital subtraction angiography (DSA), an affine transformation-based automatic image registration algorithm is introduced here. The whole process is described as follows: First, rectangle feature templates are constructed with their centers of the extracted Harris corners in the mask, and motion vectors of the central feature points are estimated using template matching technology with the similarity measure of maximum histogram energy. And then the optimal parameters of the affine transformation are calculated with the matrix singular value decomposition (SVD) method. Finally, bilinear intensity interpolation is taken to the mask according to the specific affine transformation. More than 30 peripheral DSA registrations are performed with the presented algorithm, and as the result, moving artifacts of the images are removed with sub-pixel precision, and the time consumption is less enough to satisfy the clinical requirements. Experimental results show the efficiency and robustness of the algorithm.

Hierarchical patch-based co-registration of differently stained histopathology slides

Science.gov (United States)

Yigitsoy, Mehmet; Schmidt, Günter

2017-03-01

Over the past decades, digital pathology has emerged as an alternative way of looking at the tissue at subcellular level. It enables multiplexed analysis of different cell types at micron level. Information about cell types can be extracted by staining sections of a tissue block using different markers. However, robust fusion of structural and functional information from different stains is necessary for reproducible multiplexed analysis. Such a fusion can be obtained via image co-registration by establishing spatial correspondences between tissue sections. Spatial correspondences can then be used to transfer various statistics about cell types between sections. However, the multi-modal nature of images and sparse distribution of interesting cell types pose several challenges for the registration of differently stained tissue sections. In this work, we propose a co-registration framework that efficiently addresses such challenges. We present a hierarchical patch-based registration of intensity normalized tissue sections. Preliminary experiments demonstrate the potential of the proposed technique for the fusion of multi-modal information from differently stained digital histopathology sections.

Evaluation of GMI and PMI diffeomorphic-based demons algorithms for aligning PET and CT Images.

Science.gov (United States)

Yang, Juan; Wang, Hongjun; Zhang, You; Yin, Yong

2015-07-08

Fusion of anatomic information in computed tomography (CT) and functional information in 18F-FDG positron emission tomography (PET) is crucial for accurate differentiation of tumor from benign masses, designing radiotherapy treatment plan and staging of cancer. Although current PET and CT images can be acquired from combined 18F-FDG PET/CT scanner, the two acquisitions are scanned separately and take a long time, which may induce potential positional errors in global and local caused by respiratory motion or organ peristalsis. So registration (alignment) of whole-body PET and CT images is a prerequisite for their meaningful fusion. The purpose of this study was to assess the performance of two multimodal registration algorithms for aligning PET and CT images. The proposed gradient of mutual information (GMI)-based demons algorithm, which incorporated the GMI between two images as an external force to facilitate the alignment, was compared with the point-wise mutual information (PMI) diffeomorphic-based demons algorithm whose external force was modified by replacing the image intensity difference in diffeomorphic demons algorithm with the PMI to make it appropriate for multimodal image registration. Eight patients with esophageal cancer(s) were enrolled in this IRB-approved study. Whole-body PET and CT images were acquired from a combined 18F-FDG PET/CT scanner for each patient. The modified Hausdorff distance (d(MH)) was used to evaluate the registration accuracy of the two algorithms. Of all patients, the mean values and standard deviations (SDs) of d(MH) were 6.65 (± 1.90) voxels and 6.01 (± 1.90) after the GMI-based demons and the PMI diffeomorphic-based demons registration algorithms respectively. Preliminary results on oncological patients showed that the respiratory motion and organ peristalsis in PET/CT esophageal images could not be neglected, although a combined 18F-FDG PET/CT scanner was used for image acquisition. The PMI diffeomorphic-based demons

SU-E-J-42: Customized Deformable Image Registration Using Open-Source Software SlicerRT

Energy Technology Data Exchange (ETDEWEB)

Gaitan, J Cifuentes; Chin, L; Pignol, J [Sunnybrook Health Sciences Centre, Toronto, Ontario (Canada); Kirby, N; Pouliot, J [UC San Francisco, San Francisco, CA (United States); Lasso, A; Pinter, C; Fichtinger, G [Queen' s University, Kingston, Ontario (Canada)

2014-06-01

Purpose: SlicerRT is a flexible platform that allows the user to incorporate the necessary images registration and processing tools to improve clinical workflow. This work validates the accuracy and the versatility of the deformable image registration algorithm of the free open-source software SlicerRT using a deformable physical pelvic phantom versus available commercial image fusion algorithms. Methods: Optical camera images of nonradiopaque markers implanted in an anatomical pelvic phantom were used to measure the ground-truth deformation and evaluate the theoretical deformations for several DIR algorithms. To perform the registration, full and empty bladder computed tomography (CT) images of the phantom were obtained and used as fixed and moving images, respectively. The DIR module, found in SlicerRT, used a B-spline deformable image registration with multiple optimization parameters that allowed customization of the registration including a regularization term that controlled the amount of local voxel displacement. The virtual deformation field at the center of the phantom was obtained and compared to the experimental ground-truth values. The parameters of SlicerRT were then varied to improve spatial accuracy. To quantify image similarity, the mean absolute difference (MAD) parameter using Hounsfield units was calculated. In addition, the Dice coefficient of the contoured rectum was evaluated to validate the strength of the algorithm to transfer anatomical contours. Results: Overall, SlicerRT achieved one of the lowest MAD values across the algorithm spectrum, but slightly smaller mean spatial errors in comparison to MIM software (MIM). On the other hand, SlicerRT created higher mean spatial errors than Velocity Medical Solutions (VEL), although obtaining an improvement on the DICE to 0.91. The large spatial errors were attributed to the poor contrast in the prostate bladder interface of the phantom. Conclusion: Based phantom validation, SlicerRT is capable of

Ghost marker detection and elimination in marker-based optical tracking systems for real-time tracking in stereotactic body radiotherapy

International Nuclear Information System (INIS)

Yan, Guanghua; Li, Jonathan; Huang, Yin; Mittauer, Kathryn; Lu, Bo; Liu, Chihray

2014-01-01

Purpose: To propose a simple model to explain the origin of ghost markers in marker-based optical tracking systems (OTS) and to develop retrospective strategies to detect and eliminate ghost markers. Methods: In marker-based OTS, ghost markers are virtual markers created due to the cross-talk between the two camera sensors, which can lead to system execution failure or inaccuracy in patient tracking. As a result, the users have to limit the number of markers and avoid certain marker configurations to reduce the chances of ghost markers. In this work, the authors propose retrospective strategies to detect and eliminate ghost markers. The two camera sensors were treated as mathematical points in space. The authors identified the coplanar within limit (CWL) condition as the necessary condition for ghost marker occurrence. A simple ghost marker detection method was proposed based on the model. Ghost marker elimination was achieved through pattern matching: a ghost marker-free reference set was matched with the optical marker set observed by the OTS; unmatched optical markers were eliminated as either ghost markers or misplaced markers. The pattern matching problem was formulated as a constraint satisfaction problem (using pairwise distances as constraints) and solved with an iterative backtracking algorithm. Wildcard markers were introduced to address missing or misplaced markers. An experiment was designed to measure the sensor positions and the limit for the CWL condition. The ghost marker detection and elimination algorithms were verified with samples collected from a five-marker jig and a nine-marker anthropomorphic phantom, rotated with the treatment couch from −60° to +60°. The accuracy of the pattern matching algorithm was further validated with marker patterns from 40 patients who underwent stereotactic body radiotherapy (SBRT). For this purpose, a synthetic optical marker pattern was created for each patient by introducing ghost markers, marker position

Ghost marker detection and elimination in marker-based optical tracking systems for real-time tracking in stereotactic body radiotherapy

Energy Technology Data Exchange (ETDEWEB)

Yan, Guanghua, E-mail: yan@ufl.edu; Li, Jonathan; Huang, Yin; Mittauer, Kathryn; Lu, Bo; Liu, Chihray [Department of Radiation Oncology, University of Florida, Gainesville, Florida 32610 (United States)

2014-10-15

Purpose: To propose a simple model to explain the origin of ghost markers in marker-based optical tracking systems (OTS) and to develop retrospective strategies to detect and eliminate ghost markers. Methods: In marker-based OTS, ghost markers are virtual markers created due to the cross-talk between the two camera sensors, which can lead to system execution failure or inaccuracy in patient tracking. As a result, the users have to limit the number of markers and avoid certain marker configurations to reduce the chances of ghost markers. In this work, the authors propose retrospective strategies to detect and eliminate ghost markers. The two camera sensors were treated as mathematical points in space. The authors identified the coplanar within limit (CWL) condition as the necessary condition for ghost marker occurrence. A simple ghost marker detection method was proposed based on the model. Ghost marker elimination was achieved through pattern matching: a ghost marker-free reference set was matched with the optical marker set observed by the OTS; unmatched optical markers were eliminated as either ghost markers or misplaced markers. The pattern matching problem was formulated as a constraint satisfaction problem (using pairwise distances as constraints) and solved with an iterative backtracking algorithm. Wildcard markers were introduced to address missing or misplaced markers. An experiment was designed to measure the sensor positions and the limit for the CWL condition. The ghost marker detection and elimination algorithms were verified with samples collected from a five-marker jig and a nine-marker anthropomorphic phantom, rotated with the treatment couch from −60° to +60°. The accuracy of the pattern matching algorithm was further validated with marker patterns from 40 patients who underwent stereotactic body radiotherapy (SBRT). For this purpose, a synthetic optical marker pattern was created for each patient by introducing ghost markers, marker position

Validation for 2D/3D registration II: The comparison of intensity- and gradient-based merit functions using a new gold standard data set

International Nuclear Information System (INIS)

Gendrin, Christelle; Markelj, Primoz; Pawiro, Supriyanto Ardjo; Spoerk, Jakob; Bloch, Christoph; Weber, Christoph; Figl, Michael; Bergmann, Helmar; Birkfellner, Wolfgang; Likar, Bostjan; Pernus, Franjo

2011-01-01

Purpose: A new gold standard data set for validation of 2D/3D registration based on a porcine cadaver head with attached fiducial markers was presented in the first part of this article. The advantage of this new phantom is the large amount of soft tissue, which simulates realistic conditions for registration. This article tests the performance of intensity- and gradient-based algorithms for 2D/3D registration using the new phantom data set. Methods: Intensity-based methods with four merit functions, namely, cross correlation, rank correlation, correlation ratio, and mutual information (MI), and two gradient-based algorithms, the backprojection gradient-based (BGB) registration method and the reconstruction gradient-based (RGB) registration method, were compared. Four volumes consisting of CBCT with two fields of view, 64 slice multidetector CT, and magnetic resonance-T1 weighted images were registered to a pair of kV x-ray images and a pair of MV images. A standardized evaluation methodology was employed. Targets were evenly spread over the volumes and 250 starting positions of the 3D volumes with initial displacements of up to 25 mm from the gold standard position were calculated. After the registration, the displacement from the gold standard was retrieved and the root mean square (RMS), mean, and standard deviation mean target registration errors (mTREs) over 250 registrations were derived. Additionally, the following merit properties were computed: Accuracy, capture range, number of minima, risk of nonconvergence, and distinctiveness of optimum for better comparison of the robustness of each merit. Results: Among the merit functions used for the intensity-based method, MI reached the best accuracy with an RMS mTRE down to 1.30 mm. Furthermore, it was the only merit function that could accurately register the CT to the kV x rays with the presence of tissue deformation. As for the gradient-based methods, BGB and RGB methods achieved subvoxel accuracy (RMS m

Solid Mesh Registration for Radiotherapy Treatment Planning

DEFF Research Database (Denmark)

Noe, Karsten Østergaard; Sørensen, Thomas Sangild

2010-01-01

We present an algorithm for solid organ registration of pre-segmented data represented as tetrahedral meshes. Registration of the organ surface is driven by force terms based on a distance field representation of the source and reference shapes. Registration of internal morphology is achieved usi...

SU-F-J-88: Comparison of Two Deformable Image Registration Algorithms for CT-To-CT Contour Propagation

International Nuclear Information System (INIS)

Gopal, A; Xu, H; Chen, S

2016-01-01

Purpose: To compare the contour propagation accuracy of two deformable image registration (DIR) algorithms in the Raystation treatment planning system – the “Hybrid” algorithm based on image intensities and anatomical information; and the “Biomechanical” algorithm based on linear anatomical elasticity and finite element modeling. Methods: Both DIR algorithms were used for CT-to-CT deformation for 20 lung radiation therapy patients that underwent treatment plan revisions. Deformation accuracy was evaluated using landmark tracking to measure the target registration error (TRE) and inverse consistency error (ICE). The deformed contours were also evaluated against physician drawn contours using Dice similarity coefficients (DSC). Contour propagation was qualitatively assessed using a visual quality score assigned by physicians, and a refinement quality score (0 0.9 for lungs, > 0.85 for heart, > 0.8 for liver) and similar qualitative assessments (VQS 0.75 for lungs). When anatomical structures were used to control the deformation, the DSC improved more significantly for the biomechanical DIR compared to the hybrid DIR, while the VQS and RQS improved only for the controlling structures. However, while the inclusion of controlling structures improved the TRE for the hybrid DIR, it increased the TRE for the biomechanical DIR. Conclusion: The hybrid DIR was found to perform slightly better than the biomechanical DIR based on lower TRE while the DSC, VQS, and RQS studies yielded comparable results for both. The use of controlling structures showed considerable improvement in the hybrid DIR results and is recommended for clinical use in contour propagation.

Neural network-based feature point descriptors for registration of optical and SAR images

Science.gov (United States)

Abulkhanov, Dmitry; Konovalenko, Ivan; Nikolaev, Dmitry; Savchik, Alexey; Shvets, Evgeny; Sidorchuk, Dmitry

2018-04-01

Registration of images of different nature is an important technique used in image fusion, change detection, efficient information representation and other problems of computer vision. Solving this task using feature-based approaches is usually more complex than registration of several optical images because traditional feature descriptors (SIFT, SURF, etc.) perform poorly when images have different nature. In this paper we consider the problem of registration of SAR and optical images. We train neural network to build feature point descriptors and use RANSAC algorithm to align found matches. Experimental results are presented that confirm the method's effectiveness.

Inter-patient image registration algorithms to disentangle regional dose bioeffects.

Science.gov (United States)

Monti, Serena; Pacelli, Roberto; Cella, Laura; Palma, Giuseppe

2018-03-20

Radiation therapy (RT) technological advances call for a comprehensive reconsideration of the definition of dose features leading to radiation induced morbidity (RIM). In this context, the voxel-based approach (VBA) to dose distribution analysis in RT offers a radically new philosophy to evaluate local dose response patterns, as an alternative to dose-volume-histograms for identifying dose sensitive regions of normal tissue. The VBA relies on mapping patient dose distributions into a single reference case anatomy which serves as anchor for local dosimetric evaluations. The inter-patient elastic image registrations (EIRs) of the planning CTs provide the deformation fields necessary for the actual warp of dose distributions. In this study we assessed the impact of EIR on the VBA results in thoracic patients by identifying two state-of-the-art EIR algorithms (Demons and B-Spline). Our analysis demonstrated that both the EIR algorithms may be successfully used to highlight subregions with dose differences associated with RIM that substantially overlap. Furthermore, the inclusion for the first time of covariates within a dosimetric statistical model that faces the multiple comparison problem expands the potential of VBA, thus paving the way to a reliable voxel-based analysis of RIM in datasets with strong correlation of the outcome with non-dosimetric variables.

Normalized mutual information based PET-MR registration using K-Means clustering and shading correction

NARCIS (Netherlands)

Knops, Z.F.; Maintz, J.B.A.; Viergever, M.A.; Pluim, J.P.W.; Gee, J.C.; Maintz, J.B.A.; Vannier, M.W.

2003-01-01

A method for the efficient re-binning and shading based correction of intensity distributions of the images prior to normalized mutual information based registration is presented. Our intensity distribution re-binning method is based on the K-means clustering algorithm as opposed to the generally

Fast image matching algorithm based on projection characteristics

Science.gov (United States)

Zhou, Lijuan; Yue, Xiaobo; Zhou, Lijun

2011-06-01

Based on analyzing the traditional template matching algorithm, this paper identified the key factors restricting the speed of matching and put forward a brand new fast matching algorithm based on projection. Projecting the grayscale image, this algorithm converts the two-dimensional information of the image into one-dimensional one, and then matches and identifies through one-dimensional correlation, meanwhile, because of normalization has been done, when the image brightness or signal amplitude increasing in proportion, it could also perform correct matching. Experimental results show that the projection characteristics based image registration method proposed in this article could greatly improve the matching speed, which ensuring the matching accuracy as well.

A SAR IMAGE REGISTRATION METHOD BASED ON SIFT ALGORITHM

Directory of Open Access Journals (Sweden)

W. Lu

2017-09-01

Full Text Available In order to improve the stability and rapidity of synthetic aperture radar (SAR images matching, an effective method was presented. Firstly, the adaptive smoothing filtering was employed for image denoising in image processing based on Wallis filtering to avoid the follow-up noise is amplified. Secondly, feature points were extracted by a simplified SIFT algorithm. Finally, the exact matching of the images was achieved with these points. Compared with the existing methods, it not only maintains the richness of features, but a-lso reduces the noise of the image. The simulation results show that the proposed algorithm can achieve better matching effect.

Scan-based volume animation driven by locally adaptive articulated registrations.

Science.gov (United States)

Rhee, Taehyun; Lewis, J P; Neumann, Ulrich; Nayak, Krishna S

2011-03-01

This paper describes a complete system to create anatomically accurate example-based volume deformation and animation of articulated body regions, starting from multiple in vivo volume scans of a specific individual. In order to solve the correspondence problem across volume scans, a template volume is registered to each sample. The wide range of pose variations is first approximated by volume blend deformation (VBD), providing proper initialization of the articulated subject in different poses. A novel registration method is presented to efficiently reduce the computation cost while avoiding strong local minima inherent in complex articulated body volume registration. The algorithm highly constrains the degrees of freedom and search space involved in the nonlinear optimization, using hierarchical volume structures and locally constrained deformation based on the biharmonic clamped spline. Our registration step establishes a correspondence across scans, allowing a data-driven deformation approach in the volume domain. The results provide an occlusion-free person-specific 3D human body model, asymptotically accurate inner tissue deformations, and realistic volume animation of articulated movements driven by standard joint control estimated from the actual skeleton. Our approach also addresses the practical issues arising in using scans from living subjects. The robustness of our algorithms is tested by their applications on the hand, probably the most complex articulated region in the body, and the knee, a frequent subject area for medical imaging due to injuries. © 2011 IEEE

Real-time estimation of FLE for point-based registration

Science.gov (United States)

Wiles, Andrew D.; Peters, Terry M.

2009-02-01

In image-guide surgery, optimizing the accuracy in localizing the surgical tools within the virtual reality environment or 3D image is vitally important, significant effort has been spent reducing the measurement errors at the point of interest or target. This target registration error (TRE) is often defined by a root-mean-square statistic which reduces the vector data to a single term that can be minimized. However, lost in the data reduction is the directionality of the error which, can be modelled using a 3D covariance matrix. Recently, we developed a set of expressions that modeled the TRE statistics for point-based registrations as a function of the fiducial marker geometry, target location and the fiducial localizer error (FLE). Unfortunately, these expressions are only as good as the definition of the FLE. In order to close the gap, we have subsequently developed a closed form expression that estimates the FLE as a function of the estimated fiducial registration error (FRE, the error between the measured fiducials and the best fit locations of those fiducials). The FRE covariance matrix is estimated using a sliding window technique and used as input into the closed form expression to estimate the FLE. The estimated FLE can then used to estimate the TRE which, can be given to the surgeon to permit the procedure to be designed such that the errors associated with the point-based registrations are minimized.

Co-registration of the BNCT treatment planning images for clinical practice

International Nuclear Information System (INIS)

Salli, Eero; Seppaelae, Tiina; Kankaanranta, Leena; Asikainen, Sami; Savolainen, Sauli; Koivunoro, Hanna

2006-01-01

We have co-registered MRI, CT and FBPA-PET images for BNCT in clinical practice. Co-registration improves the spatial accuracy of the treatment planning by enabling use of information from all the co-registered modalities. The multimodal co-registration has been implemented as a service product provided by the Imaging Center of Helsinki University Central Hospital to other departments. To increase the accuracy of co-registration and patient positioning in the head area BNCT, a patient-specific fixation mask suitable for PET, MRI and CT was developed. The goal of the fixation mask is to normalize the orientation of the patient's head and neck. Co-registration is performed at the image processing unit by using a rigid body model, mutual-information based algorithms and partly in-house developed software tools. The accuracy of co-registration is verified by comparing the locations of the external skin markers and anatomical landmarks in different modalities. After co-registration, the images are transformed and covered into a format required by the BNCT dose-planning software and set to the dose-planning unit of the hospital. So far co-registration has been done for 22 patients. The co-registration protocol has proved to be reliable and efficient. Some registration errors are seen on some patients in the neck area because the rigid-body model used in co-registration is not fully valid for the brain-neck entity. The registration accuracy in this area could likely be improved by implementing a co-registration procedure utilizing a partly non-rigid body model. (author)

Automatic Tracking Of Remote Sensing Precipitation Data Using Genetic Algorithm Image Registration Based Automatic Morphing: September 1999 Storm Floyd Case Study

Science.gov (United States)

Chiu, L.; Vongsaard, J.; El-Ghazawi, T.; Weinman, J.; Yang, R.; Kafatos, M.

U Due to the poor temporal sampling by satellites, data gaps exist in satellite derived time series of precipitation. This poses a challenge for assimilating rain- fall data into forecast models. To yield a continuous time series, the classic image processing technique of digital image morphing has been used. However, the digital morphing technique was applied manually and that is time consuming. In order to avoid human intervention in the process, an automatic procedure for image morphing is needed for real-time operations. For this purpose, Genetic Algorithm Based Image Registration Automatic Morphing (GRAM) model was developed and tested in this paper. Specifically, automatic morphing technique was integrated with Genetic Algo- rithm and Feature Based Image Metamorphosis technique to fill in data gaps between satellite coverage. The technique was tested using NOWRAD data which are gener- ated from the network of NEXRAD radars. Time series of NOWRAD data from storm Floyd that occurred at the US eastern region on September 16, 1999 for 00:00, 01:00, 02:00,03:00, and 04:00am were used. The GRAM technique was applied to data col- lected at 00:00 and 04:00am. These images were also manually morphed. Images at 01:00, 02:00 and 03:00am were interpolated from the GRAM and manual morphing and compared with the original NOWRAD rainrates. The results show that the GRAM technique outperforms manual morphing. The correlation coefficients between the im- ages generated using manual morphing are 0.905, 0.900, and 0.905 for the images at 01:00, 02:00,and 03:00 am, while the corresponding correlation coefficients are 0.946, 0.911, and 0.913, respectively, based on the GRAM technique. Index terms ­ Remote Sensing, Image Registration, Hydrology, Genetic Algorithm, Morphing, NEXRAD

Evaluation of GMI and PMI diffeomorphic‐based demons algorithms for aligning PET and CT Images

Science.gov (United States)

Yang, Juan; Zhang, You; Yin, Yong

2015-01-01

Fusion of anatomic information in computed tomography (CT) and functional information in F18‐FDG positron emission tomography (PET) is crucial for accurate differentiation of tumor from benign masses, designing radiotherapy treatment plan and staging of cancer. Although current PET and CT images can be acquired from combined F18‐FDG PET/CT scanner, the two acquisitions are scanned separately and take a long time, which may induce potential positional errors in global and local caused by respiratory motion or organ peristalsis. So registration (alignment) of whole‐body PET and CT images is a prerequisite for their meaningful fusion. The purpose of this study was to assess the performance of two multimodal registration algorithms for aligning PET and CT images. The proposed gradient of mutual information (GMI)‐based demons algorithm, which incorporated the GMI between two images as an external force to facilitate the alignment, was compared with the point‐wise mutual information (PMI) diffeomorphic‐based demons algorithm whose external force was modified by replacing the image intensity difference in diffeomorphic demons algorithm with the PMI to make it appropriate for multimodal image registration. Eight patients with esophageal cancer(s) were enrolled in this IRB‐approved study. Whole‐body PET and CT images were acquired from a combined F18‐FDG PET/CT scanner for each patient. The modified Hausdorff distance (dMH) was used to evaluate the registration accuracy of the two algorithms. Of all patients, the mean values and standard deviations (SDs) of dMH were 6.65 (± 1.90) voxels and 6.01 (± 1.90) after the GMI‐based demons and the PMI diffeomorphic‐based demons registration algorithms respectively. Preliminary results on oncological patients showed that the respiratory motion and organ peristalsis in PET/CT esophageal images could not be neglected, although a combined F18‐FDG PET/CT scanner was used for image acquisition. The PMI

Intensity-based hierarchical elastic registration using approximating splines.

Science.gov (United States)

Serifovic-Trbalic, Amira; Demirovic, Damir; Cattin, Philippe C

2014-01-01

We introduce a new hierarchical approach for elastic medical image registration using approximating splines. In order to obtain the dense deformation field, we employ Gaussian elastic body splines (GEBS) that incorporate anisotropic landmark errors and rotation information. Since the GEBS approach is based on a physical model in form of analytical solutions of the Navier equation, it can very well cope with the local as well as global deformations present in the images by varying the standard deviation of the Gaussian forces. The proposed GEBS approximating model is integrated into the elastic hierarchical image registration framework, which decomposes a nonrigid registration problem into numerous local rigid transformations. The approximating GEBS registration scheme incorporates anisotropic landmark errors as well as rotation information. The anisotropic landmark localization uncertainties can be estimated directly from the image data, and in this case, they represent the minimal stochastic localization error, i.e., the Cramér-Rao bound. The rotation information of each landmark obtained from the hierarchical procedure is transposed in an additional angular landmark, doubling the number of landmarks in the GEBS model. The modified hierarchical registration using the approximating GEBS model is applied to register 161 image pairs from a digital mammogram database. The obtained results are very encouraging, and the proposed approach significantly improved all registrations comparing the mean-square error in relation to approximating TPS with the rotation information. On artificially deformed breast images, the newly proposed method performed better than the state-of-the-art registration algorithm introduced by Rueckert et al. (IEEE Trans Med Imaging 18:712-721, 1999). The average error per breast tissue pixel was less than 2.23 pixels compared to 2.46 pixels for Rueckert's method. The proposed hierarchical elastic image registration approach incorporates the GEBS

Improving case-based reasoning systems by combining k-nearest neighbour algorithm with logistic regression in the prediction of patients' registration on the renal transplant waiting list.

Directory of Open Access Journals (Sweden)

Boris Campillo-Gimenez

Full Text Available Case-based reasoning (CBR is an emerging decision making paradigm in medical research where new cases are solved relying on previously solved similar cases. Usually, a database of solved cases is provided, and every case is described through a set of attributes (inputs and a label (output. Extracting useful information from this database can help the CBR system providing more reliable results on the yet to be solved cases.We suggest a general framework where a CBR system, viz. K-Nearest Neighbour (K-NN algorithm, is combined with various information obtained from a Logistic Regression (LR model, in order to improve prediction of access to the transplant waiting list.LR is applied, on the case database, to assign weights to the attributes as well as the solved cases. Thus, five possible decision making systems based on K-NN and/or LR were identified: a standalone K-NN, a standalone LR and three soft K-NN algorithms that rely on the weights based on the results of the LR. The evaluation was performed under two conditions, either using predictive factors known to be related to registration, or using a combination of factors related and not related to registration.The results show that our suggested approach, where the K-NN algorithm relies on both weighted attributes and cases, can efficiently deal with non relevant attributes, whereas the four other approaches suffer from this kind of noisy setups. The robustness of this approach suggests interesting perspectives for medical problem solving tools using CBR methodology.

Fast and accurate registration of cranial CT images with A-mode ultrasound.

Science.gov (United States)

Fieten, Lorenz; Schmieder, Kirsten; Engelhardt, Martin; Pasalic, Lamija; Radermacher, Klaus; Heger, Stefan

2009-05-01

Within the CRANIO project, a navigation module based on preoperative computed tomography (CT) data was developed for Computer and Robot Assisted Neurosurgery. The approach followed for non-invasive user-interactive registration of cranial CT images with the physical operating space consists of surface-based registration following pre-registration based on anatomical landmarks. Surface-based registration relies on bone surface points digitized transcutaneously by means of an optically tracked A-mode ultrasound (US) probe. As probe alignment and thus bone surface point digitization may be time-consuming, we investigated how to obtain high registration accuracy despite inaccurate pre-registration and a limited number of digitized bone surface points. Furthermore, we aimed at efficient man-machine-interaction during the probe alignment process. Finally, we addressed the problem of registration plausibility estimation in our approach. We modified the Iterative Closest Point (ICP) algorithm, presented by Besl and McKay and frequently used for surface-based registration, such that it can escape from local minima of the cost function to be iteratively minimized. The random-based ICP (R-ICP) we developed is less influenced by the quality of the pre-registration as it can escape from local minima close to the starting point for iterative optimization in the 6D domain of rigid transformations. The R-ICP is also better suited to approximate the global minimum as it can escape from local minima in the vicinity of the global minimum, too. Furthermore, we developed both CT-less and CT-based probe alignment tools along with appropriate man-machine strategies for a more time-efficient palpation process. To improve registration reliability, we developed a simple plausibility test based on data readily available after registration. In a cadaver study, where we evaluated the R-ICP algorithm, the probe alignment tools, and the plausibility test, the R-ICP algorithm consistently

Contour Propagation Using Feature-Based Deformable Registration for Lung Cancer

Directory of Open Access Journals (Sweden)

Yuhan Yang

2013-01-01

Full Text Available Accurate target delineation of CT image is a critical step in radiotherapy treatment planning. This paper describes a novel strategy for automatic contour propagation, based on deformable registration, for CT images of lung cancer. The proposed strategy starts with a manual-delineated contour in one slice of a 3D CT image. By means of feature-based deformable registration, the initial contour in other slices of the image can be propagated automatically, and then refined by active contour approach. Three algorithms are employed in the strategy: the Speeded-Up Robust Features (SURF, Thin-Plate Spline (TPS, and an adapted active contour (Snake, used to refine and modify the initial contours. Five pulmonary cancer cases with about 400 slices and 1000 contours have been used to verify the proposed strategy. Experiments demonstrate that the proposed strategy can improve the segmentation performance in the pulmonary CT images. Jaccard similarity (JS mean is about 0.88 and the maximum of Hausdorff distance (HD is about 90%. In addition, delineation time has been considerably reduced. The proposed feature-based deformable registration method in the automatic contour propagation improves the delineation efficiency significantly.

Automatic bone detection and soft tissue aware ultrasound-CT registration for computer-aided orthopedic surgery.

Science.gov (United States)

Wein, Wolfgang; Karamalis, Athanasios; Baumgartner, Adrian; Navab, Nassir

2015-06-01

The transfer of preoperative CT data into the tracking system coordinates within an operating room is of high interest for computer-aided orthopedic surgery. In this work, we introduce a solution for intra-operative ultrasound-CT registration of bones. We have developed methods for fully automatic real-time bone detection in ultrasound images and global automatic registration to CT. The bone detection algorithm uses a novel bone-specific feature descriptor and was thoroughly evaluated on both in-vivo and ex-vivo data. A global optimization strategy aligns the bone surface, followed by a soft tissue aware intensity-based registration to provide higher local registration accuracy. We evaluated the system on femur, tibia and fibula anatomy in a cadaver study with human legs, where magnetically tracked bone markers were implanted to yield ground truth information. An overall median system error of 3.7 mm was achieved on 11 datasets. Global and fully automatic registration of bones aquired with ultrasound to CT is feasible, with bone detection and tracking operating in real time for immediate feedback to the surgeon.

Comparison of manual vs. automated multimodality (CT-MRI) image registration for brain tumors

International Nuclear Information System (INIS)

Sarkar, Abhirup; Santiago, Roberto J.; Smith, Ryan; Kassaee, Alireza

2005-01-01

Computed tomgoraphy-magnetic resonance imaging (CT-MRI) registrations are routinely used for target-volume delineation of brain tumors. We clinically use 2 software packages based on manual operation and 1 automated package with 2 different algorithms: chamfer matching using bony structures, and mutual information using intensity patterns. In all registration algorithms, a minimum of 3 pairs of identical anatomical and preferably noncoplanar landmarks is used on each of the 2 image sets. In manual registration, the program registers these points and links the image sets using a 3-dimensional (3D) transformation. In automated registration, the 3 landmarks are used as an initial starting point and further processing is done to complete the registration. Using our registration packages, registration of CT and MRI was performed on 10 patients. We scored the results of each registration set based on the amount of time spent, the accuracy reported by the software, and a final evaluation. We evaluated each software program by measuring the residual error between 'matched' points on the right and left globes and the posterior fossa for fused image slices. In general, manual registration showed higher misalignment between corresponding points compared to automated registration using intensity matching. This error had no directional dependence and was, most of the time, larger for a larger structure in both registration techniques. Automated algorithm based on intensity matching also gave the best results in terms of registration accuracy, irrespective of whether or not the initial landmarks were chosen carefully, when compared to that done using bone matching algorithm. Intensity-matching algorithm required the least amount of user-time and provided better accuracy

Deformable image registration for cone-beam CT guided transoral robotic base-of-tongue surgery

International Nuclear Information System (INIS)

Reaungamornrat, S; Liu, W P; Otake, Y; Uneri, A; Siewerdsen, J H; Taylor, R H; Wang, A S; Nithiananthan, S; Schafer, S; Tryggestad, E; Richmon, J; Sorger, J M

2013-01-01

Transoral robotic surgery (TORS) offers a minimally invasive approach to resection of base-of-tongue tumors. However, precise localization of the surgical target and adjacent critical structures can be challenged by the highly deformed intraoperative setup. We propose a deformable registration method using intraoperative cone-beam computed tomography (CBCT) to accurately align preoperative CT or MR images with the intraoperative scene. The registration method combines a Gaussian mixture (GM) model followed by a variation of the Demons algorithm. First, following segmentation of the volume of interest (i.e. volume of the tongue extending to the hyoid), a GM model is applied to surface point clouds for rigid initialization (GM rigid) followed by nonrigid deformation (GM nonrigid). Second, the registration is refined using the Demons algorithm applied to distance map transforms of the (GM-registered) preoperative image and intraoperative CBCT. Performance was evaluated in repeat cadaver studies (25 image pairs) in terms of target registration error (TRE), entropy correlation coefficient (ECC) and normalized pointwise mutual information (NPMI). Retraction of the tongue in the TORS operative setup induced gross deformation >30 mm. The mean TRE following the GM rigid, GM nonrigid and Demons steps was 4.6, 2.1 and 1.7 mm, respectively. The respective ECC was 0.57, 0.70 and 0.73, and NPMI was 0.46, 0.57 and 0.60. Registration accuracy was best across the superior aspect of the tongue and in proximity to the hyoid (by virtue of GM registration of surface points on these structures). The Demons step refined registration primarily in deeper portions of the tongue further from the surface and hyoid bone. Since the method does not use image intensities directly, it is suitable to multi-modality registration of preoperative CT or MR with intraoperative CBCT. Extending the 3D image registration to the fusion of image and planning data in stereo-endoscopic video is anticipated to

Registration accuracy and possible migration of internal fiducial gold marker implanted in prostate and liver treated with real-time tumor-tracking radiation therapy (RTRT)

International Nuclear Information System (INIS)

Kitamura, Kei; Shirato, Hiroki; Shimizu, Shinichi; Shinohara, Nobuo; Harabayashi, Toru; Shimizu, Tadashi; Kodama, Yoshihisa; Endo, Hideho; Onimaru, Rikiya; Nishioka, Seiko; Aoyama, Hidefumi; Tsuchiya, Kazuhiko; Miyasaka, Kazuo

2002-01-01

Background and purpose: We have developed a linear accelerator synchronized with a fluoroscopic real-time tumor-tracking system to reduce errors due to setup and organ motion. In the real-time tumor-tracking radiation therapy (RTRT) system, the accuracy of tumor tracking depends on the registration of the marker's coordinates. The registration accuracy and possible migration of the internal fiducial gold marker implanted into prostate and liver was investigated. Materials and methods: Internal fiducial gold markers were implanted in 14 patients with prostate cancer and four patients with liver tumors. Computed tomography (CT) was carried out as a part of treatment planning in the 18 patients. A total of 72 follow-up CT scans were taken. We calculated the relative relationship between the coordinates of the center of mass (CM) of the organs and those of the marker. The discrepancy in the CM coordinates during a follow-up CT compared to those recorded during the planning CT was used to study possible marker migration. Results: The standard deviation (SD) of interobserver variations in the CM coordinates was within 2.0 and 0.4 mm for the organ and the marker, respectively, in seven observers. Assuming that organs do not shrink, grow, or rotate, the maximum SD of migration error in each direction was estimated to be less than 2.5 and 2.0 mm for liver and prostate, respectively. There was no correlation between the marker position and the time after implantation. Conclusion: The degree of possible migration of the internal fiducial marker was within the limits of accuracy of the CT measurement. Most of the marker movement can be attributed to the measurement uncertainty, which also influences registration in actual treatment planning. Thus, even with the gold marker and RTRT system, a planning target volume margin should be used to account for registration uncertainty

Quantitative validation of a new coregistration algorithm

International Nuclear Information System (INIS)

Pickar, R.D.; Esser, P.D.; Pozniakoff, T.A.; Van Heertum, R.L.; Stoddart, H.A. Jr.

1995-01-01

A new coregistration software package, Neuro9OO Image Coregistration software, has been developed specifically for nuclear medicine. With this algorithm, the correlation coefficient is maximized between volumes generated from sets of transaxial slices. No localization markers or segmented surfaces are needed. The coregistration program was evaluated for translational and rotational registration accuracy. A Tc-99m HM-PAO split-dose study (0.53 mCi low dose, L, and 1.01 mCi high dose, H) was simulated with a Hoffman Brain Phantom with five fiducial markers. Translation error was determined by a shift in image centroid, and rotation error was determined by a simplified two-axis approach. Changes in registration accuracy were measured with respect to: (1) slice spacing, using the four different combinations LL, LH, HL, HH, (2) translational and rotational misalignment before coregistration, (3) changes in the step size of the iterative parameters. In all the cases the algorithm converged with only small difference in translation offset, 0 and 0. At 6 nun slice spacing, translational efforts ranged from 0.9 to 2.8 mm (system resolution at 100 mm, 6.8 mm). The converged parameters showed little sensitivity to count density. In addition the correlation coefficient increased with decreasing iterative step size, as expected. From these experiments, the authors found that this algorithm based on the maximization of the correlation coefficient between studies was an accurate way to coregister SPECT brain images

Automatic markerless registration of point clouds with semantic-keypoint-based 4-points congruent sets

Science.gov (United States)

Ge, Xuming

2017-08-01

The coarse registration of point clouds from urban building scenes has become a key topic in applications of terrestrial laser scanning technology. Sampling-based algorithms in the random sample consensus (RANSAC) model have emerged as mainstream solutions to address coarse registration problems. In this paper, we propose a novel combined solution to automatically align two markerless point clouds from building scenes. Firstly, the method segments non-ground points from ground points. Secondly, the proposed method detects feature points from each cross section and then obtains semantic keypoints by connecting feature points with specific rules. Finally, the detected semantic keypoints from two point clouds act as inputs to a modified 4PCS algorithm. Examples are presented and the results compared with those of K-4PCS to demonstrate the main contributions of the proposed method, which are the extension of the original 4PCS to handle heavy datasets and the use of semantic keypoints to improve K-4PCS in relation to registration accuracy and computational efficiency.

A Novel Technique for Prealignment in Multimodality Medical Image Registration

Directory of Open Access Journals (Sweden)

Wu Zhou

2014-01-01

Full Text Available Image pair is often aligned initially based on a rigid or affine transformation before a deformable registration method is applied in medical image registration. Inappropriate initial registration may compromise the registration speed or impede the convergence of the optimization algorithm. In this work, a novel technique was proposed for prealignment in both monomodality and multimodality image registration based on statistical correlation of gradient information. A simple and robust algorithm was proposed to determine the rotational differences between two images based on orientation histogram matching accumulated from local orientation of each pixel without any feature extraction. Experimental results showed that it was effective to acquire the orientation angle between two unregistered images with advantages over the existed method based on edge-map in multimodalities. Applying the orientation detection into the registration of CT/MR, T1/T2 MRI, and monomadality images with respect to rigid and nonrigid deformation improved the chances of finding the global optimization of the registration and reduced the search space of optimization.

A Piecewise Monotone Subgradient Algorithm for Accurate L1 -TV Based Registration of Physical Slices With Discontinuities in Microscopy

Czech Academy of Sciences Publication Activity Database

Michálek, Jan; Čapek, Martin

2013-01-01

Roč. 32, č. 5 (2013), s. 901-918 ISSN 0278-0062 R&D Projects: GA MŠk(CZ) LH13028; GA ČR(CZ) GAP501/10/0340; GA ČR(CZ) GAP108/11/0794; GA TA ČR(CZ) TA02011193 Institutional support: RVO:67985823 Keywords : convex optimization * image registration * subgradient algorithm * total variation Subject RIV: EA - Cell Biology Impact factor: 3.799, year: 2013

Accurate and robust brain image alignment using boundary-based registration.

Science.gov (United States)

Greve, Douglas N; Fischl, Bruce

2009-10-15

The fine spatial scales of the structures in the human brain represent an enormous challenge to the successful integration of information from different images for both within- and between-subject analysis. While many algorithms to register image pairs from the same subject exist, visual inspection shows that their accuracy and robustness to be suspect, particularly when there are strong intensity gradients and/or only part of the brain is imaged. This paper introduces a new algorithm called Boundary-Based Registration, or BBR. The novelty of BBR is that it treats the two images very differently. The reference image must be of sufficient resolution and quality to extract surfaces that separate tissue types. The input image is then aligned to the reference by maximizing the intensity gradient across tissue boundaries. Several lower quality images can be aligned through their alignment with the reference. Visual inspection and fMRI results show that BBR is more accurate than correlation ratio or normalized mutual information and is considerably more robust to even strong intensity inhomogeneities. BBR also excels at aligning partial-brain images to whole-brain images, a domain in which existing registration algorithms frequently fail. Even in the limit of registering a single slice, we show the BBR results to be robust and accurate.

CT image registration in sinogram space.

Science.gov (United States)

Mao, Weihua; Li, Tianfang; Wink, Nicole; Xing, Lei

2007-09-01

Object displacement in a CT scan is generally reflected in CT projection data or sinogram. In this work, the direct relationship between object motion and the change of CT projection data (sinogram) is investigated and this knowledge is applied to create a novel algorithm for sinogram registration. Calculated and experimental results demonstrate that the registration technique works well for registering rigid 2D or 3D motion in parallel and fan beam samplings. Problem and solution for 3D sinogram-based registration of metallic fiducials are also addressed. Since the motion is registered before image reconstruction, the presented algorithm is particularly useful when registering images with metal or truncation artifacts. In addition, this algorithm is valuable for dealing with situations where only limited projection data are available, making it appealing for various applications in image guided radiation therapy.

CT image registration in sinogram space

International Nuclear Information System (INIS)

Mao Weihua; Li Tianfang; Wink, Nicole; Xing Lei

2007-01-01

Object displacement in a CT scan is generally reflected in CT projection data or sinogram. In this work, the direct relationship between object motion and the change of CT projection data (sinogram) is investigated and this knowledge is applied to create a novel algorithm for sinogram registration. Calculated and experimental results demonstrate that the registration technique works well for registering rigid 2D or 3D motion in parallel and fan beam samplings. Problem and solution for 3D sinogram-based registration of metallic fiducials are also addressed. Since the motion is registered before image reconstruction, the presented algorithm is particularly useful when registering images with metal or truncation artifacts. In addition, this algorithm is valuable for dealing with situations where only limited projection data are available, making it appealing for various applications in image guided radiation therapy

Design of an Image Motion Compenstaion (IMC Algorithm for Image Registration of the Communication, Ocean, Meteorolotical Satellite (COMS-1

Directory of Open Access Journals (Sweden)

Taek Seo Jung

2006-03-01

Full Text Available This paper presents an Image Motion Compensation (IMC algorithm for the Korea's Communication, Ocean, and Meteorological Satellite (COMS-1. An IMC algorithm is a priority component of image registration in Image Navigation and Registration (INR system to locate and register radiometric image data. Due to various perturbations, a satellite has orbit and attitude errors with respect to a reference motion. These errors cause depointing of the imager aiming direction, and in consequence cause image distortions. To correct the depointing of the imager aiming direction, a compensation algorithm is designed by adapting different equations from those used for the GOES satellites. The capability of the algorithm is compared with that of existing algorithm applied to the GOES's INR system. The algorithm developed in this paper improves pointing accuracy by 40%, and efficiently compensates the depointings of the imager aiming direction.

Towards adaptive radiotherapy for head and neck patients: validation of an in-house deformable registration algorithm

Science.gov (United States)

Veiga, C.; McClelland, J.; Moinuddin, S.; Ricketts, K.; Modat, M.; Ourselin, S.; D'Souza, D.; Royle, G.

2014-03-01

The purpose of this work is to validate an in-house deformable image registration (DIR) algorithm for adaptive radiotherapy for head and neck patients. We aim to use the registrations to estimate the "dose of the day" and assess the need to replan. NiftyReg is an open-source implementation of the B-splines deformable registration algorithm, developed in our institution. We registered a planning CT to a CBCT acquired midway through treatment for 5 HN patients that required replanning. We investigated 16 different parameter settings that previously showed promising results. To assess the registrations, structures delineated in the CT were warped and compared with contours manually drawn by the same clinical expert on the CBCT. This structure set contained vertebral bodies and soft tissue. Dice similarity coefficient (DSC), overlap index (OI), centroid position and distance between structures' surfaces were calculated for every registration, and a set of parameters that produces good results for all datasets was found. We achieve a median value of 0.845 in DSC, 0.889 in OI, error smaller than 2 mm in centroid position and over 90% of the warped surface pixels are distanced less than 2 mm of the manually drawn ones. By using appropriate DIR parameters, we are able to register the planning geometry (pCT) to the daily geometry (CBCT).

A Comparison of FFD-based Nonrigid Registration and AAMs Applied to Myocardial Perfusion MRI

DEFF Research Database (Denmark)

Ólafsdóttir, Hildur; Stegmann, Mikkel Bille; Ersbøll, Bjarne Kjær

2006-01-01

-form deformations (FFDs). AAMs are known to be much faster than nonrigid registration algorithms. On the other hand nonrigid registration algorithms are independent of a training set as required to build an AAM. To obtain a further comparison of the two methods, they are both applied to automatically register multi...

Robust linear registration of CT images using random regression forests

Science.gov (United States)

Konukoglu, Ender; Criminisi, Antonio; Pathak, Sayan; Robertson, Duncan; White, Steve; Haynor, David; Siddiqui, Khan

2011-03-01

Global linear registration is a necessary first step for many different tasks in medical image analysis. Comparing longitudinal studies1, cross-modality fusion2, and many other applications depend heavily on the success of the automatic registration. The robustness and efficiency of this step is crucial as it affects all subsequent operations. Most common techniques cast the linear registration problem as the minimization of a global energy function based on the image intensities. Although these algorithms have proved useful, their robustness in fully automated scenarios is still an open question. In fact, the optimization step often gets caught in local minima yielding unsatisfactory results. Recent algorithms constrain the space of registration parameters by exploiting implicit or explicit organ segmentations, thus increasing robustness4,5. In this work we propose a novel robust algorithm for automatic global linear image registration. Our method uses random regression forests to estimate posterior probability distributions for the locations of anatomical structures - represented as axis aligned bounding boxes6. These posterior distributions are later integrated in a global linear registration algorithm. The biggest advantage of our algorithm is that it does not require pre-defined segmentations or regions. Yet it yields robust registration results. We compare the robustness of our algorithm with that of the state of the art Elastix toolbox7. Validation is performed via 1464 pair-wise registrations in a database of very diverse 3D CT images. We show that our method decreases the "failure" rate of the global linear registration from 12.5% (Elastix) to only 1.9%.

Medical Image Registration and Surgery Simulation

DEFF Research Database (Denmark)

Bro-Nielsen, Morten

1996-01-01

This thesis explores the application of physical models in medical image registration and surgery simulation. The continuum models of elasticity and viscous fluids are described in detail, and this knowledge is used as a basis for most of the methods described here. Real-time deformable models......, and the use of selective matrix vector multiplication. Fluid medical image registration A new and faster algorithm for non-rigid registration using viscous fluid models is presented. This algorithm replaces the core part of the original algorithm with multi-resolution convolution using a new filter, which...... growth is also presented. Using medical knowledge about the growth processes of the mandibular bone, a registration algorithm for time sequence images of the mandible is developed. Since this registration algorithm models the actual development of the mandible, it is possible to simulate the development...

Registration of FA and T1-weighted MRI data of healthy human brain based on template matching and normalized cross-correlation.

Science.gov (United States)

Malinsky, Milos; Peter, Roman; Hodneland, Erlend; Lundervold, Astri J; Lundervold, Arvid; Jan, Jiri

2013-08-01

In this work, we propose a new approach for three-dimensional registration of MR fractional anisotropy images with T1-weighted anatomy images of human brain. From the clinical point of view, this accurate coregistration allows precise detection of nerve fibers that is essential in neuroscience. A template matching algorithm combined with normalized cross-correlation was used for this registration task. To show the suitability of the proposed method, it was compared with the normalized mutual information-based B-spline registration provided by the Elastix software library, considered a reference method. We also propose a general framework for the evaluation of robustness and reliability of both registration methods. Both registration methods were tested by four evaluation criteria on a dataset consisting of 74 healthy subjects. The template matching algorithm has shown more reliable results than the reference method in registration of the MR fractional anisotropy and T1 anatomy image data. Significant differences were observed in the regions splenium of corpus callosum and genu of corpus callosum, considered very important areas of brain connectivity. We demonstrate that, in this registration task, the currently used mutual information-based parametric registration can be replaced by more accurate local template matching utilizing the normalized cross-correlation similarity measure.

Effects of deformable registration algorithms on the creation of statistical maps for preoperative targeting in deep brain stimulation procedures

Science.gov (United States)

Liu, Yuan; D'Haese, Pierre-Francois; Dawant, Benoit M.

2014-03-01

Deep brain stimulation, which is used to treat various neurological disorders, involves implanting a permanent electrode into precise targets deep in the brain. Accurate pre-operative localization of the targets on pre-operative MRI sequence is challenging as these are typically located in homogenous regions with poor contrast. Population-based statistical atlases can assist with this process. Such atlases are created by acquiring the location of efficacious regions from numerous subjects and projecting them onto a common reference image volume using some normalization method. In previous work, we presented results concluding that non-rigid registration provided the best result for such normalization. However, this process could be biased by the choice of the reference image and/or registration approach. In this paper, we have qualitatively and quantitatively compared the performance of six recognized deformable registration methods at normalizing such data in poor contrasted regions onto three different reference volumes using a unique set of data from 100 patients. We study various metrics designed to measure the centroid, spread, and shape of the normalized data. This study leads to a total of 1800 deformable registrations and results show that statistical atlases constructed using different deformable registration methods share comparable centroids and spreads with marginal differences in their shape. Among the six methods being studied, Diffeomorphic Demons produces the largest spreads and centroids that are the furthest apart from the others in general. Among the three atlases, one atlas consistently outperforms the other two with smaller spreads for each algorithm. However, none of the differences in the spreads were found to be statistically significant, across different algorithms or across different atlases.

Line-Enhanced Deformable Registration of Pulmonary Computed Tomography Images Before and After Radiation Therapy With Radiation-Induced Fibrosis

Science.gov (United States)

Sensakovic, William F.; Maxim, Peter; Diehn, Maximilian; Loo, Billy W.; Xing, Lei

2018-01-01

Purpose: The deformable registration of pulmonary computed tomography images before and after radiation therapy is challenging due to anatomic changes from radiation fibrosis. We hypothesize that a line-enhanced registration algorithm can reduce landmark error over the entire lung, including the irradiated regions, when compared to an intensity-based deformable registration algorithm. Materials: Two intensity-based B-spline deformable registration algorithms of pre-radiation therapy and post-radiation therapy images were compared. The first was a control intensity–based algorithm that utilized computed tomography images without modification. The second was a line enhancement algorithm that incorporated a Hessian-based line enhancement filter prior to deformable image registration. Registrations were evaluated based on the landmark error between user-identified landmark pairs and the overlap ratio. Results: Twenty-one patients with pre-radiation therapy and post-radiation therapy scans were included. The median time interval between scans was 1.2 years (range: 0.3-3.3 years). Median landmark errors for the line enhancement algorithm were significantly lower than those for the control algorithm over the entire lung (1.67 vs 1.83 mm; P 5 Gy (2.25 vs 3.31; P 5 Gy dose interval demonstrated a significant inverse relationship with post-radiation therapy fibrosis enhancement after line enhancement filtration (Pearson correlation coefficient = −0.48; P = .03). Conclusion: The line enhancement registration algorithm is a promising method for registering images before and after radiation therapy. PMID:29343206

Mass preserving image registration

DEFF Research Database (Denmark)

Gorbunova, Vladlena; Sporring, Jon; Lo, Pechin Chien Pau

2010-01-01

The paper presents results the mass preserving image registration method in the Evaluation of Methods for Pulmonary Image Registration 2010 (EMPIRE10) Challenge. The mass preserving image registration algorithm was applied to the 20 image pairs. Registration was evaluated using four different...

SU-E-J-95: Towards Optimum Boundary Conditions for Biomechanical Model Based Deformable Registration Using Intensity Based Image Matching for Prostate Correlative Pathology.

Science.gov (United States)

Samavati, N; McGrath, D M; Lee, J; van der Kwast, T; Jewett, M; Mã Nard, C; Pluim, J P W; Brock, K K

2012-06-01

Deformable registration of histology to MRI is an essential tool to validate in vivo prostate cancer imaging. However, direct registration of histology to in vivo MR is prone to error due to geometric differences between the tissue sections and the in vivo imaging planes. To increase the accuracy of registration, an ex vivo high resolution MRI is acquired to compensate for the direct registration difficulties. A novel intensity-based deformable registration algorithm based on local variation in image intensities is proposed to register the histology to ex vivo MRI of prostatectomy specimens. Four sets of ex vivo MR and whole mount pathology images from four patients were used to investigate and validate the technique. In addition, 9 synthetically deformed ex vivo MR images were used. The standard deviation in local windows within the images was calculated to generate intermediate images based on both MR and histology. The intermediate images were registered using the Drop package (Munich, Germany). To further increase the accuracy, a final refinement of the registration was performed using Drop with a finer B-spline rid. The registration parameters were tuned to achieve a visually acceptable registration. Magnitude of Differences (MOD) and Angular Error (AE) were used to validate the synthetic data, and the Target Registration Error (TRE) of manually indicated landmarks was used for the clinical data. MOD of 0.6mm and AE of 8.3 degrees showed the efficacy of using intermediate images, compared to 0.8mm and 10.0 degrees achieved with Drop without the intermediate images. The average mean±std TRE among the four patients was 1.0±0.6 mm using the proposed method compared to 1.6±1.1 mm using Elastix (Utrecht, The Netherlands). An intensity-based deformable registration algorithm which uses intermediate images was evaluated on prostatectomy specimens and synthetically deformed clinical data, indicating improvement in overall accuracy and robustness. OICR, Terry Fox

Evaluation of whole-body MR to CT deformable image registration

NARCIS (Netherlands)

Akbarzadeh, A.; Gutierrez, D.; Baskin, A.; Ay, M. R.; Ahmadian, A.; Alam, N. Riahi; Loevblad, K. O.; Zaidi, H.

2013-01-01

Multimodality image registration plays a crucial role in various clinical and research applications. The aim of this study is to present an optimized MR to CT whole-body deformable image registration algorithm and its validation using clinical studies. A 3D intermodality registration technique based

Optimum location of external markers using feature selection algorithms for real-time tumor tracking in external-beam radiotherapy: a virtual phantom study.

Science.gov (United States)

Nankali, Saber; Torshabi, Ahmad Esmaili; Miandoab, Payam Samadi; Baghizadeh, Amin

2016-01-08

In external-beam radiotherapy, using external markers is one of the most reliable tools to predict tumor position, in clinical applications. The main challenge in this approach is tumor motion tracking with highest accuracy that depends heavily on external markers location, and this issue is the objective of this study. Four commercially available feature selection algorithms entitled 1) Correlation-based Feature Selection, 2) Classifier, 3) Principal Components, and 4) Relief were proposed to find optimum location of external markers in combination with two "Genetic" and "Ranker" searching procedures. The performance of these algorithms has been evaluated using four-dimensional extended cardiac-torso anthropomorphic phantom. Six tumors in lung, three tumors in liver, and 49 points on the thorax surface were taken into account to simulate internal and external motions, respectively. The root mean square error of an adaptive neuro-fuzzy inference system (ANFIS) as prediction model was considered as metric for quantitatively evaluating the performance of proposed feature selection algorithms. To do this, the thorax surface region was divided into nine smaller segments and predefined tumors motion was predicted by ANFIS using external motion data of given markers at each small segment, separately. Our comparative results showed that all feature selection algorithms can reasonably select specific external markers from those segments where the root mean square error of the ANFIS model is minimum. Moreover, the performance accuracy of proposed feature selection algorithms was compared, separately. For this, each tumor motion was predicted using motion data of those external markers selected by each feature selection algorithm. Duncan statistical test, followed by F-test, on final results reflected that all proposed feature selection algorithms have the same performance accuracy for lung tumors. But for liver tumors, a correlation-based feature selection algorithm, in

Consistency of parametric registration in serial MRI studies of brain tumor progression

International Nuclear Information System (INIS)

Mang, Andreas; Buzug, Thorsten M.; Schnabel, Julia A.; Crum, William R.; Modat, Marc; Ourselin, Sebastien; Hawkes, David J.; Camara-Rey, Oscar; Palm, Christoph; Caseiras, Gisele Brasil; Jaeger, H.R.

2008-01-01

The consistency of parametric registration in multi-temporal magnetic resonance (MR) imaging studies was evaluated. Serial MRI scans of adult patients with a brain tumor (glioma) were aligned by parametric registration. The performance of low-order spatial alignment (6/9/12 degrees of freedom) of different 3D serial MR-weighted images is evaluated. A registration protocol for the alignment of all images to one reference coordinate system at baseline is presented. Registration results were evaluated for both, multimodal intra-timepoint and mono-modal multi-temporal registration. The latter case might present a challenge to automatic intensity-based registration algorithms due to ill-defined correspondences. The performance of our algorithm was assessed by testing the inverse registration consistency. Four different similarity measures were evaluated to assess consistency. Careful visual inspection suggests that images are well aligned, but their consistency may be imperfect. Sub-voxel inconsistency within the brain was found for allsimilarity measures used for parametric multi-temporal registration. T1-weighted images were most reliable for establishing spatial correspondence between different timepoints. The parametric registration algorithm is feasible for use in this application. The sub-voxel resolution mean displacement error of registration transformations demonstrates that the algorithm converges to an almost identical solution for forward and reverse registration. (orig.)

Surface-based prostate registration with biomechanical regularization

Science.gov (United States)

van de Ven, Wendy J. M.; Hu, Yipeng; Barentsz, Jelle O.; Karssemeijer, Nico; Barratt, Dean; Huisman, Henkjan J.

2013-03-01

Adding MR-derived information to standard transrectal ultrasound (TRUS) images for guiding prostate biopsy is of substantial clinical interest. A tumor visible on MR images can be projected on ultrasound by using MRUS registration. A common approach is to use surface-based registration. We hypothesize that biomechanical modeling will better control deformation inside the prostate than a regular surface-based registration method. We developed a novel method by extending a surface-based registration with finite element (FE) simulation to better predict internal deformation of the prostate. For each of six patients, a tetrahedral mesh was constructed from the manual prostate segmentation. Next, the internal prostate deformation was simulated using the derived radial surface displacement as boundary condition. The deformation field within the gland was calculated using the predicted FE node displacements and thin-plate spline interpolation. We tested our method on MR guided MR biopsy imaging data, as landmarks can easily be identified on MR images. For evaluation of the registration accuracy we used 45 anatomical landmarks located in all regions of the prostate. Our results show that the median target registration error of a surface-based registration with biomechanical regularization is 1.88 mm, which is significantly different from 2.61 mm without biomechanical regularization. We can conclude that biomechanical FE modeling has the potential to improve the accuracy of multimodal prostate registration when comparing it to regular surface-based registration.

Locally orderless registration

DEFF Research Database (Denmark)

Darkner, Sune; Sporring, Jon

2013-01-01

This paper presents a unifying approach for calculating a wide range of popular, but seemingly very different, similarity measures. Our domain is the registration of n-dimensional images sampled on a regular grid, and our approach is well suited for gradient-based optimization algorithms. Our app...

SU-E-J-112: Intensity-Based Pulmonary Image Registration: An Evaluation Study

Energy Technology Data Exchange (ETDEWEB)

Yang, F; Meyer, J; Sandison, G [Department of Radiation Oncology, University of Washington Medical Center, Seattle, WA (United States)

2015-06-15

Purpose: Accurate alignment of thoracic CT images is essential for dose tracking and to safely implement adaptive radiotherapy in lung cancers. At the same time it is challenging given the highly elastic nature of lung tissue deformations. The objective of this study was to assess the performances of three state-of-art intensity-based algorithms in terms of their ability to register thoracic CT images subject to affine, barrel, and sinusoid transformation. Methods: Intensity similarity measures of the evaluated algorithms contained sum-of-squared difference (SSD), local mutual information (LMI), and residual complexity (RC). Five thoracic CT scans obtained from the EMPIRE10 challenge database were included and served as reference images. Each CT dataset was distorted by realistic affine, barrel, and sinusoid transformations. Registration performances of the three algorithms were evaluated for each distortion type in terms of intensity root mean square error (IRMSE) between the reference and registered images in the lung regions. Results: For affine distortions, the three algorithms differed significantly in registration of thoracic images both visually and nominally in terms of IRMSE with a mean of 0.011 for SSD, 0.039 for RC, and 0.026 for LMI (p<0.01; Kruskal-Wallis test). For barrel distortion, the three algorithms showed nominally no significant difference in terms of IRMSE with a mean of 0.026 for SSD, 0.086 for RC, and 0.054 for LMI (p=0.16) . A significant difference was seen for sinusoid distorted thoracic CT data with mean lung IRMSE of 0.039 for SSD, 0.092 for RC, and 0.035 for LMI (p=0.02). Conclusion: Pulmonary deformations might vary to a large extent in nature in a daily clinical setting due to factors ranging from anatomy variations to respiratory motion to image quality. It can be appreciated from the results of the present study that the suitability of application of a particular algorithm for pulmonary image registration is deformation-dependent.

One registration multi-atlas-based pseudo-CT generation for attenuation correction in PET/MRI

DEFF Research Database (Denmark)

Arabi, H.; Zaidi, H.

2016-01-01

Purpose: The outcome of a detailed assessment of various strategies for atlas-based whole-body bone segmentation from magnetic resonance imaging (MRI) was exploited to select the optimal parameters and setting, with the aim of proposing a novel one-registration multi-atlas (ORMA) pseudo-CT genera......Purpose: The outcome of a detailed assessment of various strategies for atlas-based whole-body bone segmentation from magnetic resonance imaging (MRI) was exploited to select the optimal parameters and setting, with the aim of proposing a novel one-registration multi-atlas (ORMA) pseudo...... regarding the accuracy of extracted bone using the different techniques demonstrated the superiority of the VWW atlas fusion algorithm achieving a Dice similarity measure of 0.82 ± 0.04 compared to arithmetic averaging atlas fusion (0.60 ± 0.02), which uses conventional direct registration. Application...

3-D brain image registration using optimal morphological processing

International Nuclear Information System (INIS)

Loncaric, S.; Dhawan, A.P.

1994-01-01

The three-dimensional (3-D) registration of Magnetic Resonance (MR) and Positron Emission Tomographic (PET) images of the brain is important for analysis of the human brain and its diseases. A procedure for optimization of (3-D) morphological structuring elements, based on a genetic algorithm, is presented in the paper. The registration of the MR and PET images is done by means of a registration procedure in two major phases. In the first phase, the Iterative Principal Axis Transform (IPAR) is used for initial registration. In the second phase, the optimal shape description method based on the Morphological Signature Transform (MST) is used for final registration. The morphological processing is used to improve the accuracy of the basic IPAR method. The brain ventricle is used as a landmark for MST registration. A near-optimal structuring element obtained by means of a genetic algorithm is used in MST to describe the shape of the ventricle. The method has been tested on the set of brain images demonstrating the feasibility of approach. (author). 11 refs., 3 figs

Registration performance on EUV masks using high-resolution registration metrology

Science.gov (United States)

Steinert, Steffen; Solowan, Hans-Michael; Park, Jinback; Han, Hakseung; Beyer, Dirk; Scherübl, Thomas

2016-10-01

Next-generation lithography based on EUV continues to move forward to high-volume manufacturing. Given the technical challenges and the throughput concerns a hybrid approach with 193 nm immersion lithography is expected, at least in the initial state. Due to the increasing complexity at smaller nodes a multitude of different masks, both DUV (193 nm) and EUV (13.5 nm) reticles, will then be required in the lithography process-flow. The individual registration of each mask and the resulting overlay error are of crucial importance in order to ensure proper functionality of the chips. While registration and overlay metrology on DUV masks has been the standard for decades, this has yet to be demonstrated on EUV masks. Past generations of mask registration tools were not necessarily limited in their tool stability, but in their resolution capabilities. The scope of this work is an image placement investigation of high-end EUV masks together with a registration and resolution performance qualification. For this we employ a new generation registration metrology system embedded in a production environment for full-spec EUV masks. This paper presents excellent registration performance not only on standard overlay markers but also on more sophisticated e-beam calibration patterns.

Accuracy of radiotherapy dose calculations based on cone-beam CT: comparison of deformable registration and image correction based methods

Science.gov (United States)

Marchant, T. E.; Joshi, K. D.; Moore, C. J.

2018-03-01

Radiotherapy dose calculations based on cone-beam CT (CBCT) images can be inaccurate due to unreliable Hounsfield units (HU) in the CBCT. Deformable image registration of planning CT images to CBCT, and direct correction of CBCT image values are two methods proposed to allow heterogeneity corrected dose calculations based on CBCT. In this paper we compare the accuracy and robustness of these two approaches. CBCT images for 44 patients were used including pelvis, lung and head & neck sites. CBCT HU were corrected using a ‘shading correction’ algorithm and via deformable registration of planning CT to CBCT using either Elastix or Niftyreg. Radiotherapy dose distributions were re-calculated with heterogeneity correction based on the corrected CBCT and several relevant dose metrics for target and OAR volumes were calculated. Accuracy of CBCT based dose metrics was determined using an ‘override ratio’ method where the ratio of the dose metric to that calculated on a bulk-density assigned version of the same image is assumed to be constant for each patient, allowing comparison to the patient’s planning CT as a gold standard. Similar performance is achieved by shading corrected CBCT and both deformable registration algorithms, with mean and standard deviation of dose metric error less than 1% for all sites studied. For lung images, use of deformed CT leads to slightly larger standard deviation of dose metric error than shading corrected CBCT with more dose metric errors greater than 2% observed (7% versus 1%).

Development and application of pulmonary structure-function registration methods: towards pulmonary image-guidance tools for improved airway targeted therapies and outcomes

Science.gov (United States)

Guo, Fumin; Pike, Damien; Svenningsen, Sarah; Coxson, Harvey O.; Drozd, John J.; Yuan, Jing; Fenster, Aaron; Parraga, Grace

2014-03-01

Objectives: We aimed to develop a way to rapidly generate multi-modality (MRI-CT) pulmonary imaging structurefunction maps using novel non-rigid image registration methods. This objective is part of our overarching goal to provide an image processing pipeline to generate pulmonary structure-function maps and guide airway-targeted therapies. Methods: Anatomical 1H and functional 3He MRI were acquired in 5 healthy asymptomatic ex-smokers and 7 ex-smokers with chronic obstructive pulmonary disease (COPD) at inspiration breath-hold. Thoracic CT was performed within ten minutes of MRI using the same breath-hold volume. Landmark-based affine registration methods previously validated for imaging of COPD, was based on corresponding fiducial markers located in both CT and 1H MRI coronal slices and compared with shape-based CT-MRI non-rigid registration. Shape-based CT-MRI registration was developed by first identifying the shapes of the lung cavities manually, and then registering the two shapes using affine and thin-plate spline algorithms. We compared registration accuracy using the fiducial localization error (FLE) and target registration error (TRE). Results: For landmark-based registration, the TRE was 8.4±5.3 mm for whole lung and 7.8±4.6 mm for the R and L lungs registered independently (p=0.4). For shape-based registration, the TRE was 8.0±4.6 mm for whole lung as compared to 6.9±4.4 mm for the R and L lung registered independently and this difference was significant (p=0.01). The difference for shape-based (6.9±4.4 mm) and landmark-based R and L lung registration (7.8±4.6 mm) was also significant (p=.04) Conclusion: Shape-based registration TRE was significantly improved compared to landmark-based registration when considering L and R lungs independently.

An Efficiency Analysis of Augmented Reality Marker Recognition Algorithm

Directory of Open Access Journals (Sweden)

Kurpytė Dovilė

2014-05-01

Full Text Available The article reports on the investigation of augmented reality system which is designed for identification and augmentation of 100 different square markers. Marker recognition efficiency was investigated by rotating markers along x and y axis directions in range from −90° to 90°. Virtual simulations of four environments were developed: a an intense source of light, b an intense source of light falling from the left side, c the non-intensive light source falling from the left side, d equally falling shadows. The graphics were created using the OpenGL graphics computer hardware interface; image processing was programmed in C++ language using OpenCV, while augmented reality was developed in Java programming language using NyARToolKit. The obtained results demonstrate that augmented reality marker recognition algorithm is accurate and reliable in the case of changing lighting conditions and rotational angles - only 4 % markers were unidentified. Assessment of marker recognition efficiency let to propose marker classification strategy in order to use it for grouping various markers into distinct markers’ groups possessing similar recognition properties.

Marker-Based Multi-Sensor Fusion Indoor Localization System for Micro Air Vehicles.

Science.gov (United States)

Xing, Boyang; Zhu, Quanmin; Pan, Feng; Feng, Xiaoxue

2018-05-25

A novel multi-sensor fusion indoor localization algorithm based on ArUco marker is designed in this paper. The proposed ArUco mapping algorithm can build and correct the map of markers online with Grubbs criterion and K-mean clustering, which avoids the map distortion due to lack of correction. Based on the conception of multi-sensor information fusion, the federated Kalman filter is utilized to synthesize the multi-source information from markers, optical flow, ultrasonic and the inertial sensor, which can obtain a continuous localization result and effectively reduce the position drift due to the long-term loss of markers in pure marker localization. The proposed algorithm can be easily implemented in a hardware of one Raspberry Pi Zero and two STM32 micro controllers produced by STMicroelectronics (Geneva, Switzerland). Thus, a small-size and low-cost marker-based localization system is presented. The experimental results show that the speed estimation result of the proposed system is better than Px4flow, and it has the centimeter accuracy of mapping and positioning. The presented system not only gives satisfying localization precision, but also has the potential to expand other sensors (such as visual odometry, ultra wideband (UWB) beacon and lidar) to further improve the localization performance. The proposed system can be reliably employed in Micro Aerial Vehicle (MAV) visual localization and robotics control.

Marker-Based Multi-Sensor Fusion Indoor Localization System for Micro Air Vehicles

Directory of Open Access Journals (Sweden)

Boyang Xing

2018-05-01

Full Text Available A novel multi-sensor fusion indoor localization algorithm based on ArUco marker is designed in this paper. The proposed ArUco mapping algorithm can build and correct the map of markers online with Grubbs criterion and K-mean clustering, which avoids the map distortion due to lack of correction. Based on the conception of multi-sensor information fusion, the federated Kalman filter is utilized to synthesize the multi-source information from markers, optical flow, ultrasonic and the inertial sensor, which can obtain a continuous localization result and effectively reduce the position drift due to the long-term loss of markers in pure marker localization. The proposed algorithm can be easily implemented in a hardware of one Raspberry Pi Zero and two STM32 micro controllers produced by STMicroelectronics (Geneva, Switzerland. Thus, a small-size and low-cost marker-based localization system is presented. The experimental results show that the speed estimation result of the proposed system is better than Px4flow, and it has the centimeter accuracy of mapping and positioning. The presented system not only gives satisfying localization precision, but also has the potential to expand other sensors (such as visual odometry, ultra wideband (UWB beacon and lidar to further improve the localization performance. The proposed system can be reliably employed in Micro Aerial Vehicle (MAV visual localization and robotics control.

A bronchoscopic navigation system using bronchoscope center calibration for accurate registration of electromagnetic tracker and CT volume without markers

Energy Technology Data Exchange (ETDEWEB)

Luo, Xiongbiao, E-mail: xiongbiao.luo@gmail.com [Robarts Research Institute, Western University, London, Ontario N6A 5K8 (Canada)

2014-06-15

Purpose: Various bronchoscopic navigation systems are developed for diagnosis, staging, and treatment of lung and bronchus cancers. To construct electromagnetically navigated bronchoscopy systems, registration of preoperative images and an electromagnetic tracker must be performed. This paper proposes a new marker-free registration method, which uses the centerlines of the bronchial tree and the center of a bronchoscope tip where an electromagnetic sensor is attached, to align preoperative images and electromagnetic tracker systems. Methods: The chest computed tomography (CT) volume (preoperative images) was segmented to extract the bronchial centerlines. An electromagnetic sensor was fixed at the bronchoscope tip surface. A model was designed and printed using a 3D printer to calibrate the relationship between the fixed sensor and the bronchoscope tip center. For each sensor measurement that includes sensor position and orientation information, its corresponding bronchoscope tip center position was calculated. By minimizing the distance between each bronchoscope tip center position and the bronchial centerlines, the spatial alignment of the electromagnetic tracker system and the CT volume was determined. After obtaining the spatial alignment, an electromagnetic navigation bronchoscopy system was established to real-timely track or locate a bronchoscope inside the bronchial tree during bronchoscopic examinations. Results: The electromagnetic navigation bronchoscopy system was validated on a dynamic bronchial phantom that can simulate respiratory motion with a breath rate range of 0–10 min{sup −1}. The fiducial and target registration errors of this navigation system were evaluated. The average fiducial registration error was reduced from 8.7 to 6.6 mm. The average target registration error, which indicates all tracked or navigated bronchoscope position accuracy, was much reduced from 6.8 to 4.5 mm compared to previous registration methods. Conclusions: An

A bronchoscopic navigation system using bronchoscope center calibration for accurate registration of electromagnetic tracker and CT volume without markers

International Nuclear Information System (INIS)

Luo, Xiongbiao

2014-01-01

Purpose: Various bronchoscopic navigation systems are developed for diagnosis, staging, and treatment of lung and bronchus cancers. To construct electromagnetically navigated bronchoscopy systems, registration of preoperative images and an electromagnetic tracker must be performed. This paper proposes a new marker-free registration method, which uses the centerlines of the bronchial tree and the center of a bronchoscope tip where an electromagnetic sensor is attached, to align preoperative images and electromagnetic tracker systems. Methods: The chest computed tomography (CT) volume (preoperative images) was segmented to extract the bronchial centerlines. An electromagnetic sensor was fixed at the bronchoscope tip surface. A model was designed and printed using a 3D printer to calibrate the relationship between the fixed sensor and the bronchoscope tip center. For each sensor measurement that includes sensor position and orientation information, its corresponding bronchoscope tip center position was calculated. By minimizing the distance between each bronchoscope tip center position and the bronchial centerlines, the spatial alignment of the electromagnetic tracker system and the CT volume was determined. After obtaining the spatial alignment, an electromagnetic navigation bronchoscopy system was established to real-timely track or locate a bronchoscope inside the bronchial tree during bronchoscopic examinations. Results: The electromagnetic navigation bronchoscopy system was validated on a dynamic bronchial phantom that can simulate respiratory motion with a breath rate range of 0–10 min −1 . The fiducial and target registration errors of this navigation system were evaluated. The average fiducial registration error was reduced from 8.7 to 6.6 mm. The average target registration error, which indicates all tracked or navigated bronchoscope position accuracy, was much reduced from 6.8 to 4.5 mm compared to previous registration methods. Conclusions: An

Optimum location of external markers using feature selection algorithms for real‐time tumor tracking in external‐beam radiotherapy: a virtual phantom study

Science.gov (United States)

Nankali, Saber; Miandoab, Payam Samadi; Baghizadeh, Amin

2016-01-01

In external‐beam radiotherapy, using external markers is one of the most reliable tools to predict tumor position, in clinical applications. The main challenge in this approach is tumor motion tracking with highest accuracy that depends heavily on external markers location, and this issue is the objective of this study. Four commercially available feature selection algorithms entitled 1) Correlation‐based Feature Selection, 2) Classifier, 3) Principal Components, and 4) Relief were proposed to find optimum location of external markers in combination with two “Genetic” and “Ranker” searching procedures. The performance of these algorithms has been evaluated using four‐dimensional extended cardiac‐torso anthropomorphic phantom. Six tumors in lung, three tumors in liver, and 49 points on the thorax surface were taken into account to simulate internal and external motions, respectively. The root mean square error of an adaptive neuro‐fuzzy inference system (ANFIS) as prediction model was considered as metric for quantitatively evaluating the performance of proposed feature selection algorithms. To do this, the thorax surface region was divided into nine smaller segments and predefined tumors motion was predicted by ANFIS using external motion data of given markers at each small segment, separately. Our comparative results showed that all feature selection algorithms can reasonably select specific external markers from those segments where the root mean square error of the ANFIS model is minimum. Moreover, the performance accuracy of proposed feature selection algorithms was compared, separately. For this, each tumor motion was predicted using motion data of those external markers selected by each feature selection algorithm. Duncan statistical test, followed by F‐test, on final results reflected that all proposed feature selection algorithms have the same performance accuracy for lung tumors. But for liver tumors, a correlation‐based feature

Image Registration Using Redundant Wavelet Transforms

National Research Council Canada - National Science Library

Brown, Richard

2001-01-01

.... In our research, we present a fundamentally new wavelet-based registration algorithm utilizing redundant transforms and a masking process to suppress the adverse effects of noise and improve processing efficiency...

Slice-to-Volume Nonrigid Registration of Histological Sections to MR Images of the Human Brain

Science.gov (United States)

Osechinskiy, Sergey; Kruggel, Frithjof

2011-01-01

Registration of histological images to three-dimensional imaging modalities is an important step in quantitative analysis of brain structure, in architectonic mapping of the brain, and in investigation of the pathology of a brain disease. Reconstruction of histology volume from serial sections is a well-established procedure, but it does not address registration of individual slices from sparse sections, which is the aim of the slice-to-volume approach. This study presents a flexible framework for intensity-based slice-to-volume nonrigid registration algorithms with a geometric transformation deformation field parametrized by various classes of spline functions: thin-plate splines (TPS), Gaussian elastic body splines (GEBS), or cubic B-splines. Algorithms are applied to cross-modality registration of histological and magnetic resonance images of the human brain. Registration performance is evaluated across a range of optimization algorithms and intensity-based cost functions. For a particular case of histological data, best results are obtained with a TPS three-dimensional (3D) warp, a new unconstrained optimization algorithm (NEWUOA), and a correlation-coefficient-based cost function. PMID:22567290

Slice-to-Volume Nonrigid Registration of Histological Sections to MR Images of the Human Brain

Directory of Open Access Journals (Sweden)

Sergey Osechinskiy

2011-01-01

Full Text Available Registration of histological images to three-dimensional imaging modalities is an important step in quantitative analysis of brain structure, in architectonic mapping of the brain, and in investigation of the pathology of a brain disease. Reconstruction of histology volume from serial sections is a well-established procedure, but it does not address registration of individual slices from sparse sections, which is the aim of the slice-to-volume approach. This study presents a flexible framework for intensity-based slice-to-volume nonrigid registration algorithms with a geometric transformation deformation field parametrized by various classes of spline functions: thin-plate splines (TPS, Gaussian elastic body splines (GEBS, or cubic B-splines. Algorithms are applied to cross-modality registration of histological and magnetic resonance images of the human brain. Registration performance is evaluated across a range of optimization algorithms and intensity-based cost functions. For a particular case of histological data, best results are obtained with a TPS three-dimensional (3D warp, a new unconstrained optimization algorithm (NEWUOA, and a correlation-coefficient-based cost function.

SU-F-J-180: A Reference Data Set for Testing Two Dimension Registration Algorithms

International Nuclear Information System (INIS)

Dankwa, A; Castillo, E; Guerrero, T

2016-01-01

Purpose: To create and characterize a reference data set for testing image registration algorithms that transform portal image (PI) to digitally reconstructed radiograph (DRR). Methods: Anterior-posterior (AP) and Lateral (LAT) projection and DRR image pairs from nine cases representing four different anatomical sites (head and neck, thoracic, abdominal, and pelvis) were selected for this study. Five experts will perform manual registration by placing landmarks points (LMPs) on the DRR and finding their corresponding points on the PI using computer assisted manual point selection tool (CAMPST), a custom-made MATLAB software tool developed in house. The landmark selection process will be repeated on both the PI and the DRR in order to characterize inter- and -intra observer variations associated with the point selection process. Inter and an intra observer variation in LMPs was done using Bland-Altman (B&A) analysis and one-way analysis of variance. We set our limit such that the absolute value of the mean difference between the readings should not exceed 3mm. Later on in this project we will test different two dimension (2D) image registration algorithms and quantify the uncertainty associated with their registration. Results: Using one-way analysis of variance (ANOVA) there was no variations within the readers. When Bland-Altman analysis was used the variation within the readers was acceptable. The variation was higher in the PI compared to the DRR.ConclusionThe variation seen for the PI is because although the PI has a much better spatial resolution the poor resolution on the DRR makes it difficult to locate the actual corresponding anatomical feature on the PI. We hope this becomes more evident when all the readers complete the point selection. The reason for quantifying inter- and -intra observer variation tells us to what degree of accuracy a manual registration can be done. Research supported by William Beaumont Hospital Research Start Up Fund.

SU-F-J-180: A Reference Data Set for Testing Two Dimension Registration Algorithms

Energy Technology Data Exchange (ETDEWEB)

Dankwa, A; Castillo, E; Guerrero, T [William Beaumont Hospital, Rochester Hills, MI (United States)

2016-06-15

Purpose: To create and characterize a reference data set for testing image registration algorithms that transform portal image (PI) to digitally reconstructed radiograph (DRR). Methods: Anterior-posterior (AP) and Lateral (LAT) projection and DRR image pairs from nine cases representing four different anatomical sites (head and neck, thoracic, abdominal, and pelvis) were selected for this study. Five experts will perform manual registration by placing landmarks points (LMPs) on the DRR and finding their corresponding points on the PI using computer assisted manual point selection tool (CAMPST), a custom-made MATLAB software tool developed in house. The landmark selection process will be repeated on both the PI and the DRR in order to characterize inter- and -intra observer variations associated with the point selection process. Inter and an intra observer variation in LMPs was done using Bland-Altman (B&A) analysis and one-way analysis of variance. We set our limit such that the absolute value of the mean difference between the readings should not exceed 3mm. Later on in this project we will test different two dimension (2D) image registration algorithms and quantify the uncertainty associated with their registration. Results: Using one-way analysis of variance (ANOVA) there was no variations within the readers. When Bland-Altman analysis was used the variation within the readers was acceptable. The variation was higher in the PI compared to the DRR.ConclusionThe variation seen for the PI is because although the PI has a much better spatial resolution the poor resolution on the DRR makes it difficult to locate the actual corresponding anatomical feature on the PI. We hope this becomes more evident when all the readers complete the point selection. The reason for quantifying inter- and -intra observer variation tells us to what degree of accuracy a manual registration can be done. Research supported by William Beaumont Hospital Research Start Up Fund.

S-HAMMER: hierarchical attribute-guided, symmetric diffeomorphic registration for MR brain images.

Science.gov (United States)

Wu, Guorong; Kim, Minjeong; Wang, Qian; Shen, Dinggang

2014-03-01

Deformable registration has been widely used in neuroscience studies for spatial normalization of brain images onto the standard space. Because of possible large anatomical differences across different individual brains, registration performance could be limited when trying to estimate a single directed deformation pathway, i.e., either from template to subject or from subject to template. Symmetric image registration, however, offers an effective way to simultaneously deform template and subject images toward each other until they meet at the middle point. Although some intensity-based registration algorithms have nicely incorporated this concept of symmetric deformation, the pointwise intensity matching between two images may not necessarily imply the matching of correct anatomical correspondences. Based on HAMMER registration algorithm (Shen and Davatzikos, [2002]: IEEE Trans Med Imaging 21:1421-1439), we integrate the strategies of hierarchical attribute matching and symmetric diffeomorphic deformation to build a new symmetric-diffeomorphic HAMMER registration algorithm, called as S-HAMMER. The performance of S-HAMMER has been extensively compared with 14 state-of-the-art nonrigid registration algorithms evaluated in (Klein et al., [2009]: NeuroImage 46:786-802) by using real brain images in LPBA40, IBSR18, CUMC12, and MGH10 datasets. In addition, the registration performance of S-HAMMER, by comparison with other methods, is also demonstrated on both elderly MR brain images (>70 years old) and the simulated brain images with ground-truth deformation fields. In all experiments, our proposed method achieves the best registration performance over all other registration methods, indicating the high applicability of our method in future neuroscience and clinical applications. Copyright © 2013 Wiley Periodicals, Inc.

Quantification of the 3D relative movement of external marker sets vs. bones based on magnetic resonance imaging.

Science.gov (United States)

Sangeux, M; Marin, F; Charleux, F; Dürselen, L; Ho Ba Tho, M C

2006-11-01

Most in vivo knee kinematic analyses are based on external markers attached to the shank and the thigh. Literature data show that markers positioning and soft tissues artifacts affect the kinematic parameters of the bones true movement. Most of the techniques of quantification used were invasive. The aim of the present study was to develop and apply a non-invasive methodology to compute the relative movement between the bones and the markers. Magnetic resonance imaging acquisitions were performed on the right knee of eleven volunteers without knee injury. The subjects were equipped with external magnetic resonance imaging-compatible marker sets. A foot drive device allowed the subjects to perform an actively loaded knee extension. The whole volume of the subject's knee was processed for four sequentially held knee flexion positions during the knee movement. The bones and external marker sets geometry were reconstructed from magnetic resonance imaging images. Then a registration algorithm was applied to the bones and the relative movement of the thigh and shank marker sets with respect to their underlying bones was computed. The protocol resulted in a good geometrical accuracy and reproducibility. Marker sets movement differ from that of the bones with a maximum of 22 mm in translation and 15 degrees in rotation and it affects the knee kinematics. Marker sets relative movement modify the knee movement finite helical axes direction (range 10-35 degrees ) and localization (range 0-40 mm). The methodology developed can evaluate external marker set system to be used for kinematic analysis in a clinical environment.

Registration accuracy and quality of real-life images.

Directory of Open Access Journals (Sweden)

Wei-Yen Hsu

Full Text Available BACKGROUND: A common registration problem for the application of consumer device is to align all the acquired image sequences into a complete scene. Image alignment requires a registration algorithm that will compensate as much as possible for geometric variability among images. However, images captured views from a real scene usually produce different distortions. Some are derived from the optic characteristics of image sensors, and others are caused by the specific scenes and objects. METHODOLOGY/PRINCIPAL FINDINGS: An image registration algorithm considering the perspective projection is proposed for the application of consumer devices in this study. It exploits a multiresolution wavelet-based method to extract significant features. An analytic differential approach is then proposed to achieve fast convergence of point matching. Finally, the registration accuracy is further refined to obtain subpixel precision by a feature-based modified Levenberg-Marquardt method. Due to its feature-based and nonlinear characteristic, it converges considerably faster than most other methods. In addition, vignette compensation and color difference adjustment are also performed to further improve the quality of registration results. CONCLUSIONS/SIGNIFICANCE: The performance of the proposed method is evaluated by testing the synthetic and real images acquired by a hand-held digital still camera and in comparison with two registration techniques in terms of the squared sum of intensity differences (SSD and correlation coefficient (CC. The results indicate that the proposed method is promising in registration accuracy and quality, which are statistically significantly better than other two approaches.

Vision Algorithm for the Solar Aspect System of the HEROES Mission

Science.gov (United States)

Cramer, Alexander; Christe, Steven; Shih, Albert

2014-01-01

This work covers the design and test of a machine vision algorithm for generating high-accuracy pitch and yaw pointing solutions relative to the sun for the High Energy Replicated Optics to Explore the Sun (HEROES) mission. It describes how images were constructed by focusing an image of the sun onto a plate printed with a pattern of small fiducial markers. Images of this plate were processed in real time to determine relative position of the balloon payload to the sun. The algorithm is broken into four problems: circle detection, fiducial detection, fiducial identification, and image registration. Circle detection is handled by an Average Intersection method, fiducial detection by a matched filter approach, identification with an ad-hoc method based on the spacing between fiducials, and image registration with a simple least squares fit. Performance is verified on a combination of artificially generated images, test data recorded on the ground, and images from the 2013 flight.

Using surface markers for MRI guided breast conserving surgery: a feasibility survey

Science.gov (United States)

Ebrahimi, Mehran; Siegler, Peter; Modhafar, Amen; Holloway, Claire M. B.; Plewes, Donald B.; Martel, Anne L.

2014-04-01

Breast MRI is frequently performed prior to breast conserving surgery in order to assess the location and extent of the lesion. Ideally, the surgeon should also be able to use the image information during surgery to guide the excision and this requires that the MR image is co-registered to conform to the patient’s position on the operating table. Recent progress in MR imaging techniques has made it possible to obtain high quality images of the patient in the supine position which significantly reduces the complexity of the registration task. Surface markers placed on the breast during imaging can be located during surgery using an external tracking device and this information can be used to co-register the images to the patient. There remains the problem that in most clinical MR scanners the arm of the patient has to be placed parallel to the body whereas the arm is placed perpendicular to the patient during surgery. The aim of this study is to determine the accuracy of co-registration based on a surface marker approach and, in particular, to determine what effect the difference in a patient’s arm position makes on the accuracy of tumour localization. Obtaining a second MRI of the patient where the patient’s arm is perpendicular to body axes (operating room position) is not possible. Instead we obtain a secondary MRI scan where the patient’s arm is above the patient’s head to validate the registration. Five patients with enhancing lesions ranging from 1.5 to 80 cm3 in size were imaged using contrast enhanced MRI with their arms in two positions. A thin-plate spline registration scheme was used to match these two configurations. The registration algorithm uses the surface markers only and does not employ the image intensities. Tumour outlines were segmented and centre of mass (COM) displacement and Dice measures of lesion overlap were calculated. The relationship between the number of markers used and the COM-displacement was also studied. The lesion COM

Using surface markers for MRI guided breast conserving surgery: a feasibility survey

International Nuclear Information System (INIS)

Ebrahimi, Mehran; Siegler, Peter; Modhafar, Amen; Martel, Anne L; Holloway, Claire M B; Plewes, Donald B

2014-01-01

Breast MRI is frequently performed prior to breast conserving surgery in order to assess the location and extent of the lesion. Ideally, the surgeon should also be able to use the image information during surgery to guide the excision and this requires that the MR image is co-registered to conform to the patient’s position on the operating table. Recent progress in MR imaging techniques has made it possible to obtain high quality images of the patient in the supine position which significantly reduces the complexity of the registration task. Surface markers placed on the breast during imaging can be located during surgery using an external tracking device and this information can be used to co-register the images to the patient. There remains the problem that in most clinical MR scanners the arm of the patient has to be placed parallel to the body whereas the arm is placed perpendicular to the patient during surgery. The aim of this study is to determine the accuracy of co-registration based on a surface marker approach and, in particular, to determine what effect the difference in a patient’s arm position makes on the accuracy of tumour localization. Obtaining a second MRI of the patient where the patient’s arm is perpendicular to body axes (operating room position) is not possible. Instead we obtain a secondary MRI scan where the patient’s arm is above the patient’s head to validate the registration. Five patients with enhancing lesions ranging from 1.5 to 80 cm 3 in size were imaged using contrast enhanced MRI with their arms in two positions. A thin-plate spline registration scheme was used to match these two configurations. The registration algorithm uses the surface markers only and does not employ the image intensities. Tumour outlines were segmented and centre of mass (COM) displacement and Dice measures of lesion overlap were calculated. The relationship between the number of markers used and the COM-displacement was also studied. The lesion

Subspace-Based Holistic Registration for Low-Resolution Facial Images

Directory of Open Access Journals (Sweden)

Boom BJ

2010-01-01

Full Text Available Subspace-based holistic registration is introduced as an alternative to landmark-based face registration, which has a poor performance on low-resolution images, as obtained in camera surveillance applications. The proposed registration method finds the alignment by maximizing the similarity score between a probe and a gallery image. We use a novel probabilistic framework for both user-independent as well as user-specific face registration. The similarity is calculated using the probability that the face image is correctly aligned in a face subspace, but additionally we take the probability into account that the face is misaligned based on the residual error in the dimensions perpendicular to the face subspace. We perform extensive experiments on the FRGCv2 database to evaluate the impact that the face registration methods have on face recognition. Subspace-based holistic registration on low-resolution images can improve face recognition in comparison with landmark-based registration on high-resolution images. The performance of the tested face recognition methods after subspace-based holistic registration on a low-resolution version of the FRGC database is similar to that after manual registration.

Voxel-based morphometric analysis in hypothyroidism using diffeomorphic anatomic registration via an exponentiated lie algebra algorithm approach.

Science.gov (United States)

Singh, S; Modi, S; Bagga, D; Kaur, P; Shankar, L R; Khushu, S

2013-03-01

The present study aimed to investigate whether brain morphological differences exist between adult hypothyroid subjects and age-matched controls using voxel-based morphometry (VBM) with diffeomorphic anatomic registration via an exponentiated lie algebra algorithm (DARTEL) approach. High-resolution structural magnetic resonance images were taken in ten healthy controls and ten hypothyroid subjects. The analysis was conducted using statistical parametric mapping. The VBM study revealed a reduction in grey matter volume in the left postcentral gyrus and cerebellum of hypothyroid subjects compared to controls. A significant reduction in white matter volume was also found in the cerebellum, right inferior and middle frontal gyrus, right precentral gyrus, right inferior occipital gyrus and right temporal gyrus of hypothyroid patients compared to healthy controls. Moreover, no meaningful cluster for greater grey or white matter volume was obtained in hypothyroid subjects compared to controls. Our study is the first VBM study of hypothyroidism in an adult population and suggests that, compared to controls, this disorder is associated with differences in brain morphology in areas corresponding to known functional deficits in attention, language, motor speed, visuospatial processing and memory in hypothyroidism. © 2012 British Society for Neuroendocrinology.

Time-Of-Flight Camera, Optical Tracker and Computed Tomography in Pairwise Data Registration.

Directory of Open Access Journals (Sweden)

Bartlomiej Pycinski

Full Text Available A growing number of medical applications, including minimal invasive surgery, depends on multi-modal or multi-sensors data processing. Fast and accurate 3D scene analysis, comprising data registration, seems to be crucial for the development of computer aided diagnosis and therapy. The advancement of surface tracking system based on optical trackers already plays an important role in surgical procedures planning. However, new modalities, like the time-of-flight (ToF sensors, widely explored in non-medical fields are powerful and have the potential to become a part of computer aided surgery set-up. Connection of different acquisition systems promises to provide a valuable support for operating room procedures. Therefore, the detailed analysis of the accuracy of such multi-sensors positioning systems is needed.We present the system combining pre-operative CT series with intra-operative ToF-sensor and optical tracker point clouds. The methodology contains: optical sensor set-up and the ToF-camera calibration procedures, data pre-processing algorithms, and registration technique. The data pre-processing yields a surface, in case of CT, and point clouds for ToF-sensor and marker-driven optical tracker representation of an object of interest. An applied registration technique is based on Iterative Closest Point algorithm.The experiments validate the registration of each pair of modalities/sensors involving phantoms of four various human organs in terms of Hausdorff distance and mean absolute distance metrics. The best surface alignment was obtained for CT and optical tracker combination, whereas the worst for experiments involving ToF-camera.The obtained accuracies encourage to further develop the multi-sensors systems. The presented substantive discussion concerning the system limitations and possible improvements mainly related to the depth information produced by the ToF-sensor is useful for computer aided surgery developers.

Spectral embedding-based registration (SERg) for multimodal fusion of prostate histology and MRI

Science.gov (United States)

Hwuang, Eileen; Rusu, Mirabela; Karthigeyan, Sudha; Agner, Shannon C.; Sparks, Rachel; Shih, Natalie; Tomaszewski, John E.; Rosen, Mark; Feldman, Michael; Madabhushi, Anant

2014-03-01

Multi-modal image registration is needed to align medical images collected from different protocols or imaging sources, thereby allowing the mapping of complementary information between images. One challenge of multimodal image registration is that typical similarity measures rely on statistical correlations between image intensities to determine anatomical alignment. The use of alternate image representations could allow for mapping of intensities into a space or representation such that the multimodal images appear more similar, thus facilitating their co-registration. In this work, we present a spectral embedding based registration (SERg) method that uses non-linearly embedded representations obtained from independent components of statistical texture maps of the original images to facilitate multimodal image registration. Our methodology comprises the following main steps: 1) image-derived textural representation of the original images, 2) dimensionality reduction using independent component analysis (ICA), 3) spectral embedding to generate the alternate representations, and 4) image registration. The rationale behind our approach is that SERg yields embedded representations that can allow for very different looking images to appear more similar, thereby facilitating improved co-registration. Statistical texture features are derived from the image intensities and then reduced to a smaller set by using independent component analysis to remove redundant information. Spectral embedding generates a new representation by eigendecomposition from which only the most important eigenvectors are selected. This helps to accentuate areas of salience based on modality-invariant structural information and therefore better identifies corresponding regions in both the template and target images. The spirit behind SERg is that image registration driven by these areas of salience and correspondence should improve alignment accuracy. In this work, SERg is implemented using Demons

Mesh-to-raster region-of-interest-based nonrigid registration of multimodal images.

Science.gov (United States)

Tatano, Rosalia; Berkels, Benjamin; Deserno, Thomas M

2017-10-01

Region of interest (RoI) alignment in medical images plays a crucial role in diagnostics, procedure planning, treatment, and follow-up. Frequently, a model is represented as triangulated mesh while the patient data is provided from computed axial tomography scanners as pixel or voxel data. Previously, we presented a 2-D method for curve-to-pixel registration. This paper contributes (i) a general mesh-to-raster framework to register RoIs in multimodal images; (ii) a 3-D surface-to-voxel application, and (iii) a comprehensive quantitative evaluation in 2-D using ground truth (GT) provided by the simultaneous truth and performance level estimation (STAPLE) method. The registration is formulated as a minimization problem, where the objective consists of a data term, which involves the signed distance function of the RoI from the reference image and a higher order elastic regularizer for the deformation. The evaluation is based on quantitative light-induced fluoroscopy (QLF) and digital photography (DP) of decalcified teeth. STAPLE is computed on 150 image pairs from 32 subjects, each showing one corresponding tooth in both modalities. The RoI in each image is manually marked by three experts (900 curves in total). In the QLF-DP setting, our approach significantly outperforms the mutual information-based registration algorithm implemented with the Insight Segmentation and Registration Toolkit and Elastix.

Smart markers for watershed-based cell segmentation.

Directory of Open Access Journals (Sweden)

Can Fahrettin Koyuncu

Full Text Available Automated cell imaging systems facilitate fast and reliable analysis of biological events at the cellular level. In these systems, the first step is usually cell segmentation that greatly affects the success of the subsequent system steps. On the other hand, similar to other image segmentation problems, cell segmentation is an ill-posed problem that typically necessitates the use of domain-specific knowledge to obtain successful segmentations even by human subjects. The approaches that can incorporate this knowledge into their segmentation algorithms have potential to greatly improve segmentation results. In this work, we propose a new approach for the effective segmentation of live cells from phase contrast microscopy. This approach introduces a new set of "smart markers" for a marker-controlled watershed algorithm, for which the identification of its markers is critical. The proposed approach relies on using domain-specific knowledge, in the form of visual characteristics of the cells, to define the markers. We evaluate our approach on a total of 1,954 cells. The experimental results demonstrate that this approach, which uses the proposed definition of smart markers, is quite effective in identifying better markers compared to its counterparts. This will, in turn, be effective in improving the segmentation performance of a marker-controlled watershed algorithm.

Smart markers for watershed-based cell segmentation.

Science.gov (United States)

Koyuncu, Can Fahrettin; Arslan, Salim; Durmaz, Irem; Cetin-Atalay, Rengul; Gunduz-Demir, Cigdem

2012-01-01

Automated cell imaging systems facilitate fast and reliable analysis of biological events at the cellular level. In these systems, the first step is usually cell segmentation that greatly affects the success of the subsequent system steps. On the other hand, similar to other image segmentation problems, cell segmentation is an ill-posed problem that typically necessitates the use of domain-specific knowledge to obtain successful segmentations even by human subjects. The approaches that can incorporate this knowledge into their segmentation algorithms have potential to greatly improve segmentation results. In this work, we propose a new approach for the effective segmentation of live cells from phase contrast microscopy. This approach introduces a new set of "smart markers" for a marker-controlled watershed algorithm, for which the identification of its markers is critical. The proposed approach relies on using domain-specific knowledge, in the form of visual characteristics of the cells, to define the markers. We evaluate our approach on a total of 1,954 cells. The experimental results demonstrate that this approach, which uses the proposed definition of smart markers, is quite effective in identifying better markers compared to its counterparts. This will, in turn, be effective in improving the segmentation performance of a marker-controlled watershed algorithm.

Wavelet based free-form deformations for nonrigid registration

Science.gov (United States)

Sun, Wei; Niessen, Wiro J.; Klein, Stefan

2014-03-01

In nonrigid registration, deformations may take place on the coarse and fine scales. For the conventional B-splines based free-form deformation (FFD) registration, these coarse- and fine-scale deformations are all represented by basis functions of a single scale. Meanwhile, wavelets have been proposed as a signal representation suitable for multi-scale problems. Wavelet analysis leads to a unique decomposition of a signal into its coarse- and fine-scale components. Potentially, this could therefore be useful for image registration. In this work, we investigate whether a wavelet-based FFD model has advantages for nonrigid image registration. We use a B-splines based wavelet, as defined by Cai and Wang.1 This wavelet is expressed as a linear combination of B-spline basis functions. Derived from the original B-spline function, this wavelet is smooth, differentiable, and compactly supported. The basis functions of this wavelet are orthogonal across scales in Sobolev space. This wavelet was previously used for registration in computer vision, in 2D optical flow problems,2 but it was not compared with the conventional B-spline FFD in medical image registration problems. An advantage of choosing this B-splines based wavelet model is that the space of allowable deformation is exactly equivalent to that of the traditional B-spline. The wavelet transformation is essentially a (linear) reparameterization of the B-spline transformation model. Experiments on 10 CT lung and 18 T1-weighted MRI brain datasets show that wavelet based registration leads to smoother deformation fields than traditional B-splines based registration, while achieving better accuracy.

A robust cloud registration method based on redundant data reduction using backpropagation neural network and shift window

Science.gov (United States)

Xin, Meiting; Li, Bing; Yan, Xiao; Chen, Lei; Wei, Xiang

2018-02-01

A robust coarse-to-fine registration method based on the backpropagation (BP) neural network and shift window technology is proposed in this study. Specifically, there are three steps: coarse alignment between the model data and measured data, data simplification based on the BP neural network and point reservation in the contour region of point clouds, and fine registration with the reweighted iterative closest point algorithm. In the process of rough alignment, the initial rotation matrix and the translation vector between the two datasets are obtained. After performing subsequent simplification operations, the number of points can be reduced greatly. Therefore, the time and space complexity of the accurate registration can be significantly reduced. The experimental results show that the proposed method improves the computational efficiency without loss of accuracy.

FPGA Accelerator for Wavelet-Based Automated Global Image Registration

Directory of Open Access Journals (Sweden)

Baofeng Li

2009-01-01

Full Text Available Wavelet-based automated global image registration (WAGIR is fundamental for most remote sensing image processing algorithms and extremely computation-intensive. With more and more algorithms migrating from ground computing to onboard computing, an efficient dedicated architecture of WAGIR is desired. In this paper, a BWAGIR architecture is proposed based on a block resampling scheme. BWAGIR achieves a significant performance by pipelining computational logics, parallelizing the resampling process and the calculation of correlation coefficient and parallel memory access. A proof-of-concept implementation with 1 BWAGIR processing unit of the architecture performs at least 7.4X faster than the CL cluster system with 1 node, and at least 3.4X than the MPM massively parallel machine with 1 node. Further speedup can be achieved by parallelizing multiple BWAGIR units. The architecture with 5 units achieves a speedup of about 3X against the CL with 16 nodes and a comparative speed with the MPM with 30 nodes. More importantly, the BWAGIR architecture can be deployed onboard economically.

FPGA Accelerator for Wavelet-Based Automated Global Image Registration

Directory of Open Access Journals (Sweden)

Li Baofeng

2009-01-01

Full Text Available Abstract Wavelet-based automated global image registration (WAGIR is fundamental for most remote sensing image processing algorithms and extremely computation-intensive. With more and more algorithms migrating from ground computing to onboard computing, an efficient dedicated architecture of WAGIR is desired. In this paper, a BWAGIR architecture is proposed based on a block resampling scheme. BWAGIR achieves a significant performance by pipelining computational logics, parallelizing the resampling process and the calculation of correlation coefficient and parallel memory access. A proof-of-concept implementation with 1 BWAGIR processing unit of the architecture performs at least 7.4X faster than the CL cluster system with 1 node, and at least 3.4X than the MPM massively parallel machine with 1 node. Further speedup can be achieved by parallelizing multiple BWAGIR units. The architecture with 5 units achieves a speedup of about 3X against the CL with 16 nodes and a comparative speed with the MPM with 30 nodes. More importantly, the BWAGIR architecture can be deployed onboard economically.

A street rubbish detection algorithm based on Sift and RCNN

Science.gov (United States)

Yu, XiPeng; Chen, Zhong; Zhang, Shuo; Zhang, Ting

2018-02-01

This paper presents a street rubbish detection algorithm based on image registration with Sift feature and RCNN. Firstly, obtain the rubbish region proposal on the real-time street image and set up the CNN convolution neural network trained by the rubbish samples set consists of rubbish and non-rubbish images; Secondly, for every clean street image, obtain the Sift feature and do image registration with the real-time street image to obtain the differential image, the differential image filters a lot of background information, obtain the rubbish region proposal rect where the rubbish may appear on the differential image by the selective search algorithm. Then, the CNN model is used to detect the image pixel data in each of the region proposal on the real-time street image. According to the output vector of the CNN, it is judged whether the rubbish is in the region proposal or not. If it is rubbish, the region proposal on the real-time street image is marked. This algorithm avoids the large number of false detection caused by the detection on the whole image because the CNN is used to identify the image only in the region proposal on the real-time street image that may appear rubbish. Different from the traditional object detection algorithm based on the region proposal, the region proposal is obtained on the differential image not whole real-time street image, and the number of the invalid region proposal is greatly reduced. The algorithm has the high mean average precision (mAP).

Survey of Non-Rigid Registration Tools in Medicine.

Science.gov (United States)

Keszei, András P; Berkels, Benjamin; Deserno, Thomas M

2017-02-01

We catalogue available software solutions for non-rigid image registration to support scientists in selecting suitable tools for specific medical registration purposes. Registration tools were identified using non-systematic search in Pubmed, Web of Science, IEEE Xplore® Digital Library, Google Scholar, and through references in identified sources (n = 22). Exclusions are due to unavailability or inappropriateness. The remaining (n = 18) tools were classified by (i) access and technology, (ii) interfaces and application, (iii) living community, (iv) supported file formats, and (v) types of registration methodologies emphasizing the similarity measures implemented. Out of the 18 tools, (i) 12 are open source, 8 are released under a permissive free license, which imposes the least restrictions on the use and further development of the tool, 8 provide graphical processing unit (GPU) support; (ii) 7 are built on software platforms, 5 were developed for brain image registration; (iii) 6 are under active development but only 3 have had their last update in 2015 or 2016; (iv) 16 support the Analyze format, while 7 file formats can be read with only one of the tools; and (v) 6 provide multiple registration methods and 6 provide landmark-based registration methods. Based on open source, licensing, GPU support, active community, several file formats, algorithms, and similarity measures, the tools Elastics and Plastimatch are chosen for the platform ITK and without platform requirements, respectively. Researchers in medical image analysis already have a large choice of registration tools freely available. However, the most recently published algorithms may not be included in the tools, yet.

Robust non-rigid point set registration using student's-t mixture model.

Directory of Open Access Journals (Sweden)

Zhiyong Zhou

Full Text Available The Student's-t mixture model, which is heavily tailed and more robust than the Gaussian mixture model, has recently received great attention on image processing. In this paper, we propose a robust non-rigid point set registration algorithm using the Student's-t mixture model. Specifically, first, we consider the alignment of two point sets as a probability density estimation problem and treat one point set as Student's-t mixture model centroids. Then, we fit the Student's-t mixture model centroids to the other point set which is treated as data. Finally, we get the closed-form solutions of registration parameters, leading to a computationally efficient registration algorithm. The proposed algorithm is especially effective for addressing the non-rigid point set registration problem when significant amounts of noise and outliers are present. Moreover, less registration parameters have to be set manually for our algorithm compared to the popular coherent points drift (CPD algorithm. We have compared our algorithm with other state-of-the-art registration algorithms on both 2D and 3D data with noise and outliers, where our non-rigid registration algorithm showed accurate results and outperformed the other algorithms.

Automatic intra-modality brain image registration method

International Nuclear Information System (INIS)

Whitaker, J.M.; Ardekani, B.A.; Braun, M.

1996-01-01

Full text: Registration of 3D images of brain of the same or different subjects has potential importance in clinical diagnosis, treatment planning and neurological research. The broad aim of our work is to produce an automatic and robust intra-modality, brain image registration algorithm for intra-subject and inter-subject studies. Our algorithm is composed of two stages. Initial alignment is achieved by finding the values of nine transformation parameters (representing translation, rotation and scale) that minimise the nonoverlapping regions of the head. This is achieved by minimisation of the sum of the exclusive OR of two binary head images, produced using the head extraction procedure described by Ardekani et al. (J Comput Assist Tomogr, 19:613-623, 1995). The initial alignment successfully determines the scale parameters and gross translation and rotation parameters. Fine alignment uses an objective function described for inter-modality registration in Ardekani et al. (ibid.). The algorithm segments one of the images to be aligned into a set of connected components using K-means clustering. Registration is achieved by minimising the K-means variance of the segmentation induced in the other image. Similarity of images of the same modality makes the method attractive for intra-modality registration. A 3D MR image, with voxel dimensions, 2x2x6 mm, was misaligned. The registered image shows visually accurate registration. The average displacement of a pixel from its correct location was measured to be 3.3 mm. The algorithm was tested on intra-subject MR images and was found to produce good qualitative results. Using the data available, the algorithm produced promising qualitative results in intra-subject registration. Further work is necessary in its application to intersubject registration, due to large variability in brain structure between subjects. Clinical evaluation of the algorithm for selected applications is required

Automated robust registration of grossly misregistered whole-slide images with varying stains

Science.gov (United States)

Litjens, G.; Safferling, K.; Grabe, N.

2016-03-01

Cancer diagnosis and pharmaceutical research increasingly depend on the accurate quantification of cancer biomarkers. Identification of biomarkers is usually performed through immunohistochemical staining of cancer sections on glass slides. However, combination of multiple biomarkers from a wide variety of immunohistochemically stained slides is a tedious process in traditional histopathology due to the switching of glass slides and re-identification of regions of interest by pathologists. Digital pathology now allows us to apply image registration algorithms to digitized whole-slides to align the differing immunohistochemical stains automatically. However, registration algorithms need to be robust to changes in color due to differing stains and severe changes in tissue content between slides. In this work we developed a robust registration methodology to allow for fast coarse alignment of multiple immunohistochemical stains to the base hematyoxylin and eosin stained image. We applied HSD color model conversion to obtain a less stain color dependent representation of the whole-slide images. Subsequently, optical density thresholding and connected component analysis were used to identify the relevant regions for registration. Template matching using normalized mutual information was applied to provide initial translation and rotation parameters, after which a cost function-driven affine registration was performed. The algorithm was validated using 40 slides from 10 prostate cancer patients, with landmark registration error as a metric. Median landmark registration error was around 180 microns, which indicates performance is adequate for practical application. None of the registrations failed, indicating the robustness of the algorithm.

A 3D global-to-local deformable mesh model based registration and anatomy-constrained segmentation method for image guided prostate radiotherapy

International Nuclear Information System (INIS)

Zhou Jinghao; Kim, Sung; Jabbour, Salma; Goyal, Sharad; Haffty, Bruce; Chen, Ting; Levinson, Lydia; Metaxas, Dimitris; Yue, Ning J.

2010-01-01

Purpose: In the external beam radiation treatment of prostate cancers, successful implementation of adaptive radiotherapy and conformal radiation dose delivery is highly dependent on precise and expeditious segmentation and registration of the prostate volume between the simulation and the treatment images. The purpose of this study is to develop a novel, fast, and accurate segmentation and registration method to increase the computational efficiency to meet the restricted clinical treatment time requirement in image guided radiotherapy. Methods: The method developed in this study used soft tissues to capture the transformation between the 3D planning CT (pCT) images and 3D cone-beam CT (CBCT) treatment images. The method incorporated a global-to-local deformable mesh model based registration framework as well as an automatic anatomy-constrained robust active shape model (ACRASM) based segmentation algorithm in the 3D CBCT images. The global registration was based on the mutual information method, and the local registration was to minimize the Euclidian distance of the corresponding nodal points from the global transformation of deformable mesh models, which implicitly used the information of the segmented target volume. The method was applied on six data sets of prostate cancer patients. Target volumes delineated by the same radiation oncologist on the pCT and CBCT were chosen as the benchmarks and were compared to the segmented and registered results. The distance-based and the volume-based estimators were used to quantitatively evaluate the results of segmentation and registration. Results: The ACRASM segmentation algorithm was compared to the original active shape model (ASM) algorithm by evaluating the values of the distance-based estimators. With respect to the corresponding benchmarks, the mean distance ranged from -0.85 to 0.84 mm for ACRASM and from -1.44 to 1.17 mm for ASM. The mean absolute distance ranged from 1.77 to 3.07 mm for ACRASM and from 2.45 to

Image registration with auto-mapped control volumes

International Nuclear Information System (INIS)

Schreibmann, Eduard; Xing Lei

2006-01-01

Many image registration algorithms rely on the use of homologous control points on the two input image sets to be registered. In reality, the interactive identification of the control points on both images is tedious, difficult, and often a source of error. We propose a two-step algorithm to automatically identify homologous regions that are used as a priori information during the image registration procedure. First, a number of small control volumes having distinct anatomical features are identified on the model image in a somewhat arbitrary fashion. Instead of attempting to find their correspondences in the reference image through user interaction, in the proposed method, each of the control regions is mapped to the corresponding part of the reference image by using an automated image registration algorithm. A normalized cross-correlation (NCC) function or mutual information was used as the auto-mapping metric and a limited memory Broyden-Fletcher-Goldfarb-Shanno algorithm (L-BFGS) was employed to optimize the function to find the optimal mapping. For rigid registration, the transformation parameters of the system are obtained by averaging that derived from the individual control volumes. In our deformable calculation, the mapped control volumes are treated as the nodes or control points with known positions on the two images. If the number of control volumes is not enough to cover the whole image to be registered, additional nodes are placed on the model image and then located on the reference image in a manner similar to the conventional BSpline deformable calculation. For deformable registration, the established correspondence by the auto-mapped control volumes provides valuable guidance for the registration calculation and greatly reduces the dimensionality of the problem. The performance of the two-step registrations was applied to three rigid registration cases (two PET-CT registrations and a brain MRI-CT registration) and one deformable registration of

Surface registration technique for close-range mapping applications

Science.gov (United States)

Habib, Ayman F.; Cheng, Rita W. T.

2006-08-01

Close-range mapping applications such as cultural heritage restoration, virtual reality modeling for the entertainment industry, and anatomical feature recognition for medical activities require 3D data that is usually acquired by high resolution close-range laser scanners. Since these datasets are typically captured from different viewpoints and/or at different times, accurate registration is a crucial procedure for 3D modeling of mapped objects. Several registration techniques are available that work directly with the raw laser points or with extracted features from the point cloud. Some examples include the commonly known Iterative Closest Point (ICP) algorithm and a recently proposed technique based on matching spin-images. This research focuses on developing a surface matching algorithm that is based on the Modified Iterated Hough Transform (MIHT) and ICP to register 3D data. The proposed algorithm works directly with the raw 3D laser points and does not assume point-to-point correspondence between two laser scans. The algorithm can simultaneously establish correspondence between two surfaces and estimates the transformation parameters relating them. Experiment with two partially overlapping laser scans of a small object is performed with the proposed algorithm and shows successful registration. A high quality of fit between the two scans is achieved and improvement is found when compared to the results obtained using the spin-image technique. The results demonstrate the feasibility of the proposed algorithm for registering 3D laser scanning data in close-range mapping applications to help with the generation of complete 3D models.

Medical image registration for analysis

International Nuclear Information System (INIS)

Petrovic, V.

2006-01-01

Full text: Image registration techniques represent a rich family of image processing and analysis tools that aim to provide spatial correspondences across sets of medical images of similar and disparate anatomies and modalities. Image registration is a fundamental and usually the first step in medical image analysis and this paper presents a number of advanced techniques as well as demonstrates some of the advanced medical image analysis techniques they make possible. A number of both rigid and non-rigid medical image alignment algorithms of equivalent and merely consistent anatomical structures respectively are presented. The algorithms are compared in terms of their practical aims, inputs, computational complexity and level of operator (e.g. diagnostician) interaction. In particular, the focus of the methods discussion is placed on the applications and practical benefits of medical image registration. Results of medical image registration on a number of different imaging modalities and anatomies are presented demonstrating the accuracy and robustness of their application. Medical image registration is quickly becoming ubiquitous in medical imaging departments with the results of such algorithms increasingly used in complex medical image analysis and diagnostics. This paper aims to demonstrate at least part of the reason why

Keypoint-based 4-Points Congruent Sets - Automated marker-less registration of laser scans

Science.gov (United States)

Theiler, Pascal Willy; Wegner, Jan Dirk; Schindler, Konrad

2014-10-01

We propose a method to automatically register two point clouds acquired with a terrestrial laser scanner without placing any markers in the scene. What makes this task challenging are the strongly varying point densities caused by the line-of-sight measurement principle, and the huge amount of data. The first property leads to low point densities in potential overlap areas with scans taken from different viewpoints while the latter calls for highly efficient methods in terms of runtime and memory requirements. A crucial yet largely unsolved step is the initial coarse alignment of two scans without any simplifying assumptions, that is, point clouds are given in arbitrary local coordinates and no knowledge about their relative orientation is available. Once coarse alignment has been solved, scans can easily be fine-registered with standard methods like least-squares surface or Iterative Closest Point matching. In order to drastically thin out the original point clouds while retaining characteristic features, we resort to extracting 3D keypoints. Such clouds of keypoints, which can be viewed as a sparse but nevertheless discriminative representation of the original scans, are then used as input to a very efficient matching method originally developed in computer graphics, called 4-Points Congruent Sets (4PCS) algorithm. We adapt the 4PCS matching approach to better suit the characteristics of laser scans. The resulting Keypoint-based 4-Points Congruent Sets (K-4PCS) method is extensively evaluated on challenging indoor and outdoor scans. Beyond the evaluation on real terrestrial laser scans, we also perform experiments with simulated indoor scenes, paying particular attention to the sensitivity of the approach with respect to highly symmetric scenes.

TU-AB-BRA-03: Atlas-Based Algorithms with Local Registration-Goodness Weighting for MRI-Driven Electron Density Mapping

International Nuclear Information System (INIS)

Farjam, R; Tyagi, N; Veeraraghavan, H; Apte, A; Zakian, K; Deasy, J; Hunt, M

2016-01-01

Purpose: To develop image-analysis algorithms to synthesize CT with accurate electron densities for MR-only radiotherapy of head & neck (H&N) and pelvis anatomies. Methods: CT and 3T-MRI (Philips, mDixon sequence) scans were randomly selected from a pool of H&N (n=11) and pelvis (n=12) anatomies to form an atlas. All MRIs were pre-processed to eliminate scanner and patient-induced intensity inhomogeneities and standardize their intensity histograms. CT and MRI for each patient were then co-registered to construct CT-MRI atlases. For more accurate CT-MR fusion, bone intensities in CT were suppressed to improve the similarity between CT and MRI. For a new patient, all CT-MRI atlases are deformed onto the new patients’ MRI initially. A newly-developed generalized registration error (GRE) metric was then calculated as a measure of local registration accuracy. The synthetic CT value at each point is a 1/GRE-weighted average of CTs from all CT-MR atlases. For evaluation, the mean absolute error (MAE) between the original and synthetic CT (generated in a leave-one-out scheme) was computed. The planning dose from the original and synthetic CT was also compared. Results: For H&N patients, MAE was 67±9, 114±22, and 116±9 HU over the entire-CT, air and bone regions, respectively. For pelvis anatomy, MAE was 47±5 and 146±14 for the entire and bone regions. In comparison with MIRADA medical, an FDA-approved registration tool, we found that our proposed registration strategy reduces MAE by ∼30% and ∼50% over the entire and bone regions, respectively. GRE-weighted strategy further lowers MAE by ∼15% to ∼40%. Our primary dose calculation also showed highly consistent results between the original and synthetic CT. Conclusion: We’ve developed a novel image-analysis technique to synthesize CT for H&N and pelvis anatomies. Our proposed image fusion strategy and GRE metric help generate more accurate synthetic CT using locally more similar atlases (Support: Philips

TU-AB-BRA-03: Atlas-Based Algorithms with Local Registration-Goodness Weighting for MRI-Driven Electron Density Mapping

Energy Technology Data Exchange (ETDEWEB)

Farjam, R; Tyagi, N [Memorial Sloan-Kettering Cancer Center, New York, NY (United States); Veeraraghavan, H; Apte, A; Zakian, K; Deasy, J [Memorial Sloan Kettering Cancer Center, New York, NY (United States); Hunt, M [Mem Sloan-Kettering Cancer Center, New York, NY (United States)

2016-06-15

Purpose: To develop image-analysis algorithms to synthesize CT with accurate electron densities for MR-only radiotherapy of head & neck (H&N) and pelvis anatomies. Methods: CT and 3T-MRI (Philips, mDixon sequence) scans were randomly selected from a pool of H&N (n=11) and pelvis (n=12) anatomies to form an atlas. All MRIs were pre-processed to eliminate scanner and patient-induced intensity inhomogeneities and standardize their intensity histograms. CT and MRI for each patient were then co-registered to construct CT-MRI atlases. For more accurate CT-MR fusion, bone intensities in CT were suppressed to improve the similarity between CT and MRI. For a new patient, all CT-MRI atlases are deformed onto the new patients’ MRI initially. A newly-developed generalized registration error (GRE) metric was then calculated as a measure of local registration accuracy. The synthetic CT value at each point is a 1/GRE-weighted average of CTs from all CT-MR atlases. For evaluation, the mean absolute error (MAE) between the original and synthetic CT (generated in a leave-one-out scheme) was computed. The planning dose from the original and synthetic CT was also compared. Results: For H&N patients, MAE was 67±9, 114±22, and 116±9 HU over the entire-CT, air and bone regions, respectively. For pelvis anatomy, MAE was 47±5 and 146±14 for the entire and bone regions. In comparison with MIRADA medical, an FDA-approved registration tool, we found that our proposed registration strategy reduces MAE by ∼30% and ∼50% over the entire and bone regions, respectively. GRE-weighted strategy further lowers MAE by ∼15% to ∼40%. Our primary dose calculation also showed highly consistent results between the original and synthetic CT. Conclusion: We’ve developed a novel image-analysis technique to synthesize CT for H&N and pelvis anatomies. Our proposed image fusion strategy and GRE metric help generate more accurate synthetic CT using locally more similar atlases (Support: Philips

Validation of an algorithm for the nonrigid registration of longitudinal breast MR images using realistic phantoms

Science.gov (United States)

Li, Xia; Dawant, Benoit M.; Welch, E. Brian; Chakravarthy, A. Bapsi; Xu, Lei; Mayer, Ingrid; Kelley, Mark; Meszoely, Ingrid; Means-Powell, Julie; Gore, John C.; Yankeelov, Thomas E.

2010-01-01

Purpose: The authors present a method to validate coregistration of breast magnetic resonance images obtained at multiple time points during the course of treatment. In performing sequential registration of breast images, the effects of patient repositioning, as well as possible changes in tumor shape and volume, must be considered. The authors accomplish this by extending the adaptive bases algorithm (ABA) to include a tumor-volume preserving constraint in the cost function. In this study, the authors evaluate this approach using a novel validation method that simulates not only the bulk deformation associated with breast MR images obtained at different time points, but also the reduction in tumor volume typically observed as a response to neoadjuvant chemotherapy. Methods: For each of the six patients, high-resolution 3D contrast enhanced T1-weighted images were obtained before treatment, after one cycle of chemotherapy and at the conclusion of chemotherapy. To evaluate the effects of decreasing tumor size during the course of therapy, simulations were run in which the tumor in the original images was contracted by 25%, 50%, 75%, and 95%, respectively. The contracted area was then filled using texture from local healthy appearing tissue. Next, to simulate the post-treatment data, the simulated (i.e., contracted tumor) images were coregistered to the experimentally measured post-treatment images using a surface registration. By comparing the deformations generated by the constrained and unconstrained version of ABA, the authors assessed the accuracy of the registration algorithms. The authors also applied the two algorithms on experimental data to study the tumor volume changes, the value of the constraint, and the smoothness of transformations. Results: For the six patient data sets, the average voxel shift error (mean±standard deviation) for the ABA with constraint was 0.45±0.37, 0.97±0.83, 1.43±0.96, and 1.80±1.17 mm for the 25%, 50%, 75%, and 95

The role of image registration in brain mapping

Science.gov (United States)

Toga, A.W.; Thompson, P.M.

2008-01-01

Image registration is a key step in a great variety of biomedical imaging applications. It provides the ability to geometrically align one dataset with another, and is a prerequisite for all imaging applications that compare datasets across subjects, imaging modalities, or across time. Registration algorithms also enable the pooling and comparison of experimental findings across laboratories, the construction of population-based brain atlases, and the creation of systems to detect group patterns in structural and functional imaging data. We review the major types of registration approaches used in brain imaging today. We focus on their conceptual basis, the underlying mathematics, and their strengths and weaknesses in different contexts. We describe the major goals of registration, including data fusion, quantification of change, automated image segmentation and labeling, shape measurement, and pathology detection. We indicate that registration algorithms have great potential when used in conjunction with a digital brain atlas, which acts as a reference system in which brain images can be compared for statistical analysis. The resulting armory of registration approaches is fundamental to medical image analysis, and in a brain mapping context provides a means to elucidate clinical, demographic, or functional trends in the anatomy or physiology of the brain. PMID:19890483

Mosaicing of single plane illumination microscopy images using groupwise registration and fast content-based image fusion

Science.gov (United States)

Preibisch, Stephan; Rohlfing, Torsten; Hasak, Michael P.; Tomancak, Pavel

2008-03-01

Single Plane Illumination Microscopy (SPIM; Huisken et al., Nature 305(5686):1007-1009, 2004) is an emerging microscopic technique that enables live imaging of large biological specimens in their entirety. By imaging the living biological sample from multiple angles SPIM has the potential to achieve isotropic resolution throughout even relatively large biological specimens. For every angle, however, only a relatively shallow section of the specimen is imaged with high resolution, whereas deeper regions appear increasingly blurred. In order to produce a single, uniformly high resolution image, we propose here an image mosaicing algorithm that combines state of the art groupwise image registration for alignment with content-based image fusion to prevent degrading of the fused image due to regional blurring of the input images. For the registration stage, we introduce an application-specific groupwise transformation model that incorporates per-image as well as groupwise transformation parameters. We also propose a new fusion algorithm based on Gaussian filters, which is substantially faster than fusion based on local image entropy. We demonstrate the performance of our mosaicing method on data acquired from living embryos of the fruit fly, Drosophila, using four and eight angle acquisitions.

Assessment of rigid multi-modality image registration consistency using the multiple sub-volume registration (MSR) method

International Nuclear Information System (INIS)

Ceylan, C; Heide, U A van der; Bol, G H; Lagendijk, J J W; Kotte, A N T J

2005-01-01

Registration of different imaging modalities such as CT, MRI, functional MRI (fMRI), positron (PET) and single photon (SPECT) emission tomography is used in many clinical applications. Determining the quality of any automatic registration procedure has been a challenging part because no gold standard is available to evaluate the registration. In this note we present a method, called the 'multiple sub-volume registration' (MSR) method, for assessing the consistency of a rigid registration. This is done by registering sub-images of one data set on the other data set, performing a crude non-rigid registration. By analysing the deviations (local deformations) of the sub-volume registrations from the full registration we get a measure of the consistency of the rigid registration. Registration of 15 data sets which include CT, MR and PET images for brain, head and neck, cervix, prostate and lung was performed utilizing a rigid body registration with normalized mutual information as the similarity measure. The resulting registrations were classified as good or bad by visual inspection. The resulting registrations were also classified using our MSR method. The results of our MSR method agree with the classification obtained from visual inspection for all cases (p < 0.02 based on ANOVA of the good and bad groups). The proposed method is independent of the registration algorithm and similarity measure. It can be used for multi-modality image data sets and different anatomic sites of the patient. (note)

Coarse Point Cloud Registration by Egi Matching of Voxel Clusters

Science.gov (United States)

Wang, Jinhu; Lindenbergh, Roderik; Shen, Yueqian; Menenti, Massimo

2016-06-01

Laser scanning samples the surface geometry of objects efficiently and records versatile information as point clouds. However, often more scans are required to fully cover a scene. Therefore, a registration step is required that transforms the different scans into a common coordinate system. The registration of point clouds is usually conducted in two steps, i.e. coarse registration followed by fine registration. In this study an automatic marker-free coarse registration method for pair-wise scans is presented. First the two input point clouds are re-sampled as voxels and dimensionality features of the voxels are determined by principal component analysis (PCA). Then voxel cells with the same dimensionality are clustered. Next, the Extended Gaussian Image (EGI) descriptor of those voxel clusters are constructed using significant eigenvectors of each voxel in the cluster. Correspondences between clusters in source and target data are obtained according to the similarity between their EGI descriptors. The random sampling consensus (RANSAC) algorithm is employed to remove outlying correspondences until a coarse alignment is obtained. If necessary, a fine registration is performed in a final step. This new method is illustrated on scan data sampling two indoor scenarios. The results of the tests are evaluated by computing the point to point distance between the two input point clouds. The presented two tests resulted in mean distances of 7.6 mm and 9.5 mm respectively, which are adequate for fine registration.

Testing non-rigid registration of nuclear medicine data using synthetic derived SPECT images

International Nuclear Information System (INIS)

Todd-Pokropek, A.

2002-01-01

Aim: Non-rigid registration is needed to build atlas data to make statistical tests of significance of uptake in nuclear medicine (NM). Non-rigid registration is much more difficult than rigid registration to validate since some kind of matching function must be defined throughout the volume being registered, and no suitable gold standards exist. The aim here has been to assess non-rigid methods of registration and deformation for NM to NM and NM to MRI data. An additional aim has been to derive good synthetic SPECT images from other NM and MRI data to be used after as reference standards. Material and Methods: Phantom and patient test images have been acquired for both NM and MRI, which are then used to generate projections, where the characteristics of the images are modified to change both signal and noise properties. These derived images are different in character but perfectly registered with the original data, and can then be deformed in a known manner. The registration algorithm is then run backwards to re-register the modified deformed data with the original images. A technique has been developed to assess the vector fields of the original deformation to the reverse non-rigid registration field. Results: The main purpose of this paper is to describe a methodology for optimising algorithms, not to develop the algorithms themselves. Two different algorithms based on optic flow and thin plate spline interpolation have been intercompared and in particular the constraints imposed tested. Considerable differences in matching can be observed in different regions for example edge and centre of brain. Conclusions: Quadratic distance between known makers is a bad estimate to use to assess non-rigid registration. A robust statistic has been developed which can be used to optimise non-rigid algorithms based on the use of synthetic SPECT reference datasets. While the task being tested is simpler than the real clinical task, it is the first essential step in the

Markerless laser registration in image-guided oral and maxillofacial surgery.

Science.gov (United States)

Marmulla, Rüdiger; Lüth, Tim; Mühling, Joachim; Hassfeld, Stefan

2004-07-01

The use of registration markers in computer-assisted surgery is combined with high logistic costs and efforts. Markerless patient registration using laser scan surface registration techniques is a new challenging method. The present study was performed to evaluate the clinical accuracy in finding defined target points within the surgical site after markerless patient registration in image-guided oral and maxillofacial surgery. Twenty consecutive patients with different cranial diseases were scheduled for computer-assisted surgery. Data set alignment between the surgical site and the computed tomography (CT) data set was performed by markerless laser scan surface registration of the patient's face. Intraoral rigidly attached registration markers were used as target points, which had to be detected by an infrared pointer. The Surgical Segment Navigator SSN++ has been used for all procedures. SSN++ is an investigative product based on the SSN system that had previously been developed by the presenting authors with the support of Carl Zeiss (Oberkochen, Germany). SSN++ is connected to a Polaris infrared camera (Northern Digital, Waterloo, Ontario, Canada) and to a Minolta VI 900 3D digitizer (Tokyo, Japan) for high-resolution laser scanning. Minimal differences in shape between the laser scan surface and the surface generated from the CT data set could be detected. Nevertheless, high-resolution laser scan of the skin surface allows for a precise patient registration (mean deviation 1.1 mm, maximum deviation 1.8 mm). Radiation load, logistic costs, and efforts arising from the planning of computer-assisted surgery of the head can be reduced because native (markerless) CT data sets can be used for laser scan-based surface registration.

ViCAR: An Adaptive and Landmark-Free Registration of Time Lapse Image Data from Microfluidics Experiments

Directory of Open Access Journals (Sweden)

Georges Hattab

2017-05-01

Full Text Available In order to understand gene function in bacterial life cycles, time lapse bioimaging is applied in combination with different marker protocols in so called microfluidics chambers (i.e., a multi-well plate. In one experiment, a series of T images is recorded for one visual field, with a pixel resolution of 60 nm/px. Any (semi-automatic analysis of the data is hampered by a strong image noise, low contrast and, last but not least, considerable irregular shifts during the acquisition. Image registration corrects such shifts enabling next steps of the analysis (e.g., feature extraction or tracking. Image alignment faces two obstacles in this microscopic context: (a highly dynamic structural changes in the sample (i.e., colony growth and (b an individual data set-specific sample environment which makes the application of landmarks-based alignments almost impossible. We present a computational image registration solution, we refer to as ViCAR: (Visual (Cues based (Adaptive (Registration, for such microfluidics experiments, consisting of (1 the detection of particular polygons (outlined and segmented ones, referred to as visual cues, (2 the adaptive retrieval of three coordinates throughout different sets of frames, and finally (3 an image registration based on the relation of these points correcting both rotation and translation. We tested ViCAR with different data sets and have found that it provides an effective spatial alignment thereby paving the way to extract temporal features pertinent to each resulting bacterial colony. By using ViCAR, we achieved an image registration with 99.9% of image closeness, based on the average rmsd of 4.10−2 pixels, and superior results compared to a state of the art algorithm.

Global Registration of 3D LiDAR Point Clouds Based on Scene Features: Application to Structured Environments

Directory of Open Access Journals (Sweden)

Julia Sanchez

2017-09-01

Full Text Available Acquiring 3D data with LiDAR systems involves scanning multiple scenes from different points of view. In actual systems, the ICP algorithm (Iterative Closest Point is commonly used to register the acquired point clouds together to form a unique one. However, this method faces local minima issues and often needs a coarse initial alignment to converge to the optimum. This paper develops a new method for registration adapted to indoor environments and based on structure priors of such scenes. Our method works without odometric data or physical targets. The rotation and translation of the rigid transformation are computed separately, using, respectively, the Gaussian image of the point clouds and a correlation of histograms. To evaluate our algorithm on challenging registration cases, two datasets were acquired and are available for comparison with other methods online. The evaluation of our algorithm on four datasets against six existing methods shows that the proposed method is more robust against sampling and scene complexity. Moreover, the time performances enable a real-time implementation.

LSAH: a fast and efficient local surface feature for point cloud registration

Science.gov (United States)

Lu, Rongrong; Zhu, Feng; Wu, Qingxiao; Kong, Yanzi

2018-04-01

Point cloud registration is a fundamental task in high level three dimensional applications. Noise, uneven point density and varying point cloud resolutions are the three main challenges for point cloud registration. In this paper, we design a robust and compact local surface descriptor called Local Surface Angles Histogram (LSAH) and propose an effectively coarse to fine algorithm for point cloud registration. The LSAH descriptor is formed by concatenating five normalized sub-histograms into one histogram. The five sub-histograms are created by accumulating a different type of angle from a local surface patch respectively. The experimental results show that our LSAH is more robust to uneven point density and point cloud resolutions than four state-of-the-art local descriptors in terms of feature matching. Moreover, we tested our LSAH based coarse to fine algorithm for point cloud registration. The experimental results demonstrate that our algorithm is robust and efficient as well.

Robust methods for automatic image-to-world registration in cone-beam CT interventional guidance

International Nuclear Information System (INIS)

Dang, H.; Otake, Y.; Schafer, S.; Stayman, J. W.; Kleinszig, G.; Siewerdsen, J. H.

2012-01-01

Purpose: Real-time surgical navigation relies on accurate image-to-world registration to align the coordinate systems of the image and patient. Conventional manual registration can present a workflow bottleneck and is prone to manual error and intraoperator variability. This work reports alternative means of automatic image-to-world registration, each method involving an automatic registration marker (ARM) used in conjunction with C-arm cone-beam CT (CBCT). The first involves a Known-Model registration method in which the ARM is a predefined tool, and the second is a Free-Form method in which the ARM is freely configurable. Methods: Studies were performed using a prototype C-arm for CBCT and a surgical tracking system. A simple ARM was designed with markers comprising a tungsten sphere within infrared reflectors to permit detection of markers in both x-ray projections and by an infrared tracker. The Known-Model method exercised a predefined specification of the ARM in combination with 3D-2D registration to estimate the transformation that yields the optimal match between forward projection of the ARM and the measured projection images. The Free-Form method localizes markers individually in projection data by a robust Hough transform approach extended from previous work, backprojected to 3D image coordinates based on C-arm geometric calibration. Image-domain point sets were transformed to world coordinates by rigid-body point-based registration. The robustness and registration accuracy of each method was tested in comparison to manual registration across a range of body sites (head, thorax, and abdomen) of interest in CBCT-guided surgery, including cases with interventional tools in the radiographic scene. Results: The automatic methods exhibited similar target registration error (TRE) and were comparable or superior to manual registration for placement of the ARM within ∼200 mm of C-arm isocenter. Marker localization in projection data was robust across all

Evaluation of whole-body MR to CT deformable image registration.

Science.gov (United States)

Akbarzadeh, A; Gutierrez, D; Baskin, A; Ay, M R; Ahmadian, A; Riahi Alam, N; Lövblad, K O; Zaidi, H

2013-07-08

Multimodality image registration plays a crucial role in various clinical and research applications. The aim of this study is to present an optimized MR to CT whole-body deformable image registration algorithm and its validation using clinical studies. A 3D intermodality registration technique based on B-spline transformation was performed using optimized parameters of the elastix package based on the Insight Toolkit (ITK) framework. Twenty-eight (17 male and 11 female) clinical studies were used in this work. The registration was evaluated using anatomical landmarks and segmented organs. In addition to 16 anatomical landmarks, three key organs (brain, lungs, and kidneys) and the entire body volume were segmented for evaluation. Several parameters--such as the Euclidean distance between anatomical landmarks, target overlap, Dice and Jaccard coefficients, false positives and false negatives, volume similarity, distance error, and Hausdorff distance--were calculated to quantify the quality of the registration algorithm. Dice coefficients for the majority of patients (> 75%) were in the 0.8-1 range for the whole body, brain, and lungs, which satisfies the criteria to achieve excellent alignment. On the other hand, for kidneys, Dice coefficients for volumes of 25% of the patients meet excellent volume agreement requirement, while the majority of patients satisfy good agreement criteria (> 0.6). For all patients, the distance error was in 0-10 mm range for all segmented organs. In summary, we optimized and evaluated the accuracy of an MR to CT deformable registration algorithm. The registered images constitute a useful 3D whole-body MR-CT atlas suitable for the development and evaluation of novel MR-guided attenuation correction procedures on hybrid PET-MR systems.

On marker-based parentage verification via non-linear optimization.

Science.gov (United States)

Boerner, Vinzent

2017-06-15

Parentage verification by molecular markers is mainly based on short tandem repeat markers. Single nucleotide polymorphisms (SNPs) as bi-allelic markers have become the markers of choice for genotyping projects. Thus, the subsequent step is to use SNP genotypes for parentage verification as well. Recent developments of algorithms such as evaluating opposing homozygous SNP genotypes have drawbacks, for example the inability of rejecting all animals of a sample of potential parents. This paper describes an algorithm for parentage verification by constrained regression which overcomes the latter limitation and proves to be very fast and accurate even when the number of SNPs is as low as 50. The algorithm was tested on a sample of 14,816 animals with 50, 100 and 500 SNP genotypes randomly selected from 40k genotypes. The samples of putative parents of these animals contained either five random animals, or four random animals and the true sire. Parentage assignment was performed by ranking of regression coefficients, or by setting a minimum threshold for regression coefficients. The assignment quality was evaluated by the power of assignment (P[Formula: see text]) and the power of exclusion (P[Formula: see text]). If the sample of putative parents contained the true sire and parentage was assigned by coefficient ranking, P[Formula: see text] and P[Formula: see text] were both higher than 0.99 for the 500 and 100 SNP genotypes, and higher than 0.98 for the 50 SNP genotypes. When parentage was assigned by a coefficient threshold, P[Formula: see text] was higher than 0.99 regardless of the number of SNPs, but P[Formula: see text] decreased from 0.99 (500 SNPs) to 0.97 (100 SNPs) and 0.92 (50 SNPs). If the sample of putative parents did not contain the true sire and parentage was rejected using a coefficient threshold, the algorithm achieved a P[Formula: see text] of 1 (500 SNPs), 0.99 (100 SNPs) and 0.97 (50 SNPs). The algorithm described here is easy to implement

REGISTRATION OF OVERLAPPING 3D POINT CLO UDS USING EXTRACTED LINE SEGMENTS

Directory of Open Access Journals (Sweden)

Poręba Martyna

2014-12-01

Full Text Available The registration of 3D point clouds collected from different scanner positions is necessary in order to avoid occlusions, ensure a full coverage of areas, and collect useful data for analyzing an d documenting the surrounding environment. This procedure involves three main stages: 1 choosing appropriate features, which can be reliably extracted; 2 matching conjugate primitives; 3 estimating the transformation parameters. Currently, points and spheres are most frequently chosen as the registration features. However, due to limited point cloud resolution, proper identification and precise measurement of a common point within the overlapping laser data is almost impossible. One possible solution to this problem may be a registration process based on the Iterative Closest Point (ICP algorithm or its variation. Alternatively, planar and linear feature - based registration techniques can also be applied. In this paper, we propose the use of line segments obtained from intersecting planes modelled within individual scans. Such primitives can be easily extracted even from low - density point clouds. Working with synthetic data, several existing line - based registration methods are evaluated according to their robustness to noise and the precision of the estimated transformation parameters. For the purpose of quantitative assessment, an accuracy criterion based on a modified Hausdorff distance is defined. Since a n automated matching of segments is a challenging task that influences the correctness of the transformation parameters, a correspondence - finding algorithm is developed. The tests show that our matching algorithm provides a correct pairing with an accuracy of 99 % at least, and about 8% of omitted line pairs.

Increasing feasibility of the field-programmable gate array implementation of an iterative image registration using a kernel-warping algorithm

Science.gov (United States)

Nguyen, An Hung; Guillemette, Thomas; Lambert, Andrew J.; Pickering, Mark R.; Garratt, Matthew A.

2017-09-01

Image registration is a fundamental image processing technique. It is used to spatially align two or more images that have been captured at different times, from different sensors, or from different viewpoints. There have been many algorithms proposed for this task. The most common of these being the well-known Lucas-Kanade (LK) and Horn-Schunck approaches. However, the main limitation of these approaches is the computational complexity required to implement the large number of iterations necessary for successful alignment of the images. Previously, a multi-pass image interpolation algorithm (MP-I2A) was developed to considerably reduce the number of iterations required for successful registration compared with the LK algorithm. This paper develops a kernel-warping algorithm (KWA), a modified version of the MP-I2A, which requires fewer iterations to successfully register two images and less memory space for the field-programmable gate array (FPGA) implementation than the MP-I2A. These reductions increase feasibility of the implementation of the proposed algorithm on FPGAs with very limited memory space and other hardware resources. A two-FPGA system rather than single FPGA system is successfully developed to implement the KWA in order to compensate insufficiency of hardware resources supported by one FPGA, and increase parallel processing ability and scalability of the system.

Accelerating Neuroimage Registration through Parallel Computation of Similarity Metric.

Directory of Open Access Journals (Sweden)

Yun-Gang Luo

Full Text Available Neuroimage registration is crucial for brain morphometric analysis and treatment efficacy evaluation. However, existing advanced registration algorithms such as FLIRT and ANTs are not efficient enough for clinical use. In this paper, a GPU implementation of FLIRT with the correlation ratio (CR as the similarity metric and a GPU accelerated correlation coefficient (CC calculation for the symmetric diffeomorphic registration of ANTs have been developed. The comparison with their corresponding original tools shows that our accelerated algorithms can greatly outperform the original algorithm in terms of computational efficiency. This paper demonstrates the great potential of applying these registration tools in clinical applications.

Simple shape space for 3D face registration

Science.gov (United States)

Košir, Andrej; Perkon, Igor; Bracun, Drago; Tasic, Jurij; Mozina, Janez

2009-09-01

Three dimensional (3D) face recognition is a topic getting increasing interest in biometric applications. In our research framework we developed a laser scanner that provides 3D cloud information and texture data. In a user scenario with cooperative subjects with indoor light conditions, we address three problems of 3D face biometrics: the face registration, the formulation of a shape space together with a special designed gradient algorithm and the impact of initial approximation to the convergence of a registration algorithm. By defining the face registration as a problem of aligning a 3D data cloud with a predefined reference template, we solve the registration problem with a second order gradient algorithm working on a shape space designed for reducing the computational complexity of the method.

Automatic registration of remote sensing images based on SIFT and fuzzy block matching for change detection

Directory of Open Access Journals (Sweden)

Cai Guo-Rong

2011-10-01

Full Text Available This paper presents an automated image registration approach to detecting changes in multi-temporal remote sensing images. The proposed algorithm is based on the scale invariant feature transform (SIFT and has two phases. The first phase focuses on SIFT feature extraction and on estimation of image transformation. In the second phase, Structured Local Binary Haar Pattern (SLBHP combined with a fuzzy similarity measure is then used to build a new and effective block similarity measure for change detection. Experimental results obtained on multi-temporal data sets show that compared with three mainstream block matching algorithms, the proposed algorithm is more effective in dealing with scale, rotation and illumination changes.

Validation of co-registration of clinical lung ventilation and perfusion SPECT

International Nuclear Information System (INIS)

Marsh, S.H.; O'Keeffe, D.S.; Barnden, L.R.

2010-01-01

Full text: This talk will present results from a recent validation study of coregistration of computed tomography ventilation and perfusion (SPECT V/Q) images. The coregistration algorithm was incorporated in Qonsub, a program to coregister, normalise and subtract the SPECT (V/Q) images. Ventilation and perfusion image data were acquired from 23 patients undergoing a routine clinical SPECT V/Q study. The only change to normal patient management was the placement of three Tc 9 9 m filled fiducial markers adhered to the skin on the patient's torso. To quantify coregistration accuracy, image data were modified (within software) to remove the markers and Qonsub determined a parameter set of six values fully describing the six degree rigid transformation. The accuracy with which the six parameters coregister the images was then quantified by applying the same transformation parameters to the ventilation markers and determining how well they locate to the perfusion marker positions. Results show that for 65% of patients surveyed co-registration accuracy was to within I pixel, 30% were co-registered with an accuracy between 1 and 2 pixels and 5% were co-registered with an accuracy of between 2 and 3 pixels. Because patient placement between scans resulted in a misregistration of at most five pixels, a more rigorous test of the algorithm was required. Ethics approval had not been sought to intentionally misregister patient images, so the algorithm had to be further tested by synthetically misregistering the images. For these images Qonsub generally co-registered with the same accuracy as the original image. (author)

SU-C-18A-02: Image-Based Camera Tracking: Towards Registration of Endoscopic Video to CT

International Nuclear Information System (INIS)

Ingram, S; Rao, A; Wendt, R; Castillo, R; Court, L; Yang, J; Beadle, B

2014-01-01

Purpose: Endoscopic examinations are routinely performed on head and neck and esophageal cancer patients. However, these images are underutilized for radiation therapy because there is currently no way to register them to a CT of the patient. The purpose of this work is to develop a method to track the motion of an endoscope within a structure using images from standard clinical equipment. This method will be incorporated into a broader endoscopy/CT registration framework. Methods: We developed a software algorithm to track the motion of an endoscope within an arbitrary structure. We computed frame-to-frame rotation and translation of the camera by tracking surface points across the video sequence and utilizing two-camera epipolar geometry. The resulting 3D camera path was used to recover the surrounding structure via triangulation methods. We tested this algorithm on a rigid cylindrical phantom with a pattern spray-painted on the inside. We did not constrain the motion of the endoscope while recording, and we did not constrain our measurements using the known structure of the phantom. Results: Our software algorithm can successfully track the general motion of the endoscope as it moves through the phantom. However, our preliminary data do not show a high degree of accuracy in the triangulation of 3D point locations. More rigorous data will be presented at the annual meeting. Conclusion: Image-based camera tracking is a promising method for endoscopy/CT image registration, and it requires only standard clinical equipment. It is one of two major components needed to achieve endoscopy/CT registration, the second of which is tying the camera path to absolute patient geometry. In addition to this second component, future work will focus on validating our camera tracking algorithm in the presence of clinical imaging features such as patient motion, erratic camera motion, and dynamic scene illumination

A fast inverse consistent deformable image registration method based on symmetric optical flow computation

International Nuclear Information System (INIS)

Yang Deshan; Li Hua; Low, Daniel A; Deasy, Joseph O; Naqa, Issam El

2008-01-01

Deformable image registration is widely used in various radiation therapy applications including daily treatment planning adaptation to map planned tissue or dose to changing anatomy. In this work, a simple and efficient inverse consistency deformable registration method is proposed with aims of higher registration accuracy and faster convergence speed. Instead of registering image I to a second image J, the two images are symmetrically deformed toward one another in multiple passes, until both deformed images are matched and correct registration is therefore achieved. In each pass, a delta motion field is computed by minimizing a symmetric optical flow system cost function using modified optical flow algorithms. The images are then further deformed with the delta motion field in the positive and negative directions respectively, and then used for the next pass. The magnitude of the delta motion field is forced to be less than 0.4 voxel for every pass in order to guarantee smoothness and invertibility for the two overall motion fields that are accumulating the delta motion fields in both positive and negative directions, respectively. The final motion fields to register the original images I and J, in either direction, are calculated by inverting one overall motion field and combining the inversion result with the other overall motion field. The final motion fields are inversely consistent and this is ensured by the symmetric way that registration is carried out. The proposed method is demonstrated with phantom images, artificially deformed patient images and 4D-CT images. Our results suggest that the proposed method is able to improve the overall accuracy (reducing registration error by 30% or more, compared to the original and inversely inconsistent optical flow algorithms), reduce the inverse consistency error (by 95% or more) and increase the convergence rate (by 100% or more). The overall computation speed may slightly decrease, or increase in most cases

Shape-based diffeomorphic registration on hippocampal surfaces using Beltrami holomorphic flow.

Science.gov (United States)

Lui, Lok Ming; Wong, Tsz Wai; Thompson, Paul; Chan, Tony; Gu, Xianfeng; Yau, Shing-Tung

2010-01-01

We develop a new algorithm to automatically register hippocampal (HP) surfaces with complete geometric matching, avoiding the need to manually label landmark features. A good registration depends on a reasonable choice of shape energy that measures the dissimilarity between surfaces. In our work, we first propose a complete shape index using the Beltrami coefficient and curvatures, which measures subtle local differences. The proposed shape energy is zero if and only if two shapes are identical up to a rigid motion. We then seek the best surface registration by minimizing the shape energy. We propose a simple representation of surface diffeomorphisms using Beltrami coefficients, which simplifies the optimization process. We then iteratively minimize the shape energy using the proposed Beltrami Holomorphic flow (BHF) method. Experimental results on 212 HP of normal and diseased (Alzheimer's disease) subjects show our proposed algorithm is effective in registering HP surfaces with complete geometric matching. The proposed shape energy can also capture local shape differences between HP for disease analysis.

Nonrigid Registration of Prostate Diffusion-Weighted MRI

Directory of Open Access Journals (Sweden)

Lei Hao

2017-01-01

Full Text Available Motion and deformation are common in prostate diffusion-weighted magnetic resonance imaging (DWI during acquisition. These misalignments lead to errors in estimating an apparent diffusion coefficient (ADC map fitted with DWI. To address this problem, we propose an image registration algorithm to align the prostate DWI and improve ADC map. First, we apply affine transformation to DWI to correct intraslice motions. Then, nonrigid registration based on free-form deformation (FFD is used to compensate for intraimage deformations. To evaluate the influence of the proposed algorithm on ADC values, we perform statistical experiments in three schemes: no processing of the DWI, with the affine transform approach, and with FFD. The experimental results show that our proposed algorithm can correct the misalignment of prostate DWI and decrease the artifacts of ROI in the ADC maps. These ADC maps thus obtain sharper contours of lesions, which are helpful for improving the diagnosis and clinical staging of prostate cancer.

One registration multi-atlas-based pseudo-CT generation for attenuation correction in PET/MRI

International Nuclear Information System (INIS)

Arabi, Hossein; Zaidi, Habib

2016-01-01

The outcome of a detailed assessment of various strategies for atlas-based whole-body bone segmentation from magnetic resonance imaging (MRI) was exploited to select the optimal parameters and setting, with the aim of proposing a novel one-registration multi-atlas (ORMA) pseudo-CT generation approach. The proposed approach consists of only one online registration between the target and reference images, regardless of the number of atlas images (N), while for the remaining atlas images, the pre-computed transformation matrices to the reference image are used to align them to the target image. The performance characteristics of the proposed method were evaluated and compared with conventional atlas-based attenuation map generation strategies (direct registration of the entire atlas images followed by voxel-wise weighting (VWW) and arithmetic averaging atlas fusion). To this end, four different positron emission tomography (PET) attenuation maps were generated via arithmetic averaging and VWW scheme using both direct registration and ORMA approaches as well as the 3-class attenuation map obtained from the Philips Ingenuity TF PET/MRI scanner commonly used in the clinical setting. The evaluation was performed based on the accuracy of extracted whole-body bones by the different attenuation maps and by quantitative analysis of resulting PET images compared to CT-based attenuation-corrected PET images serving as reference. The comparison of validation metrics regarding the accuracy of extracted bone using the different techniques demonstrated the superiority of the VWW atlas fusion algorithm achieving a Dice similarity measure of 0.82 ± 0.04 compared to arithmetic averaging atlas fusion (0.60 ± 0.02), which uses conventional direct registration. Application of the ORMA approach modestly compromised the accuracy, yielding a Dice similarity measure of 0.76 ± 0.05 for ORMA-VWW and 0.55 ± 0.03 for ORMA-averaging. The results of quantitative PET analysis followed the same

One registration multi-atlas-based pseudo-CT generation for attenuation correction in PET/MRI

Energy Technology Data Exchange (ETDEWEB)

Arabi, Hossein [Geneva University Hospital, Division of Nuclear Medicine and Molecular Imaging, Geneva 4 (Switzerland); Zaidi, Habib [Geneva University Hospital, Division of Nuclear Medicine and Molecular Imaging, Geneva 4 (Switzerland); Geneva University, Geneva Neuroscience Center, Geneva (Switzerland); University of Groningen, University Medical Center Groningen, Department of Nuclear Medicine and Molecular Imaging, Groningen (Netherlands); University of Southern Denmark, Department of Nuclear Medicine, Odense (Denmark)

2016-10-15

The outcome of a detailed assessment of various strategies for atlas-based whole-body bone segmentation from magnetic resonance imaging (MRI) was exploited to select the optimal parameters and setting, with the aim of proposing a novel one-registration multi-atlas (ORMA) pseudo-CT generation approach. The proposed approach consists of only one online registration between the target and reference images, regardless of the number of atlas images (N), while for the remaining atlas images, the pre-computed transformation matrices to the reference image are used to align them to the target image. The performance characteristics of the proposed method were evaluated and compared with conventional atlas-based attenuation map generation strategies (direct registration of the entire atlas images followed by voxel-wise weighting (VWW) and arithmetic averaging atlas fusion). To this end, four different positron emission tomography (PET) attenuation maps were generated via arithmetic averaging and VWW scheme using both direct registration and ORMA approaches as well as the 3-class attenuation map obtained from the Philips Ingenuity TF PET/MRI scanner commonly used in the clinical setting. The evaluation was performed based on the accuracy of extracted whole-body bones by the different attenuation maps and by quantitative analysis of resulting PET images compared to CT-based attenuation-corrected PET images serving as reference. The comparison of validation metrics regarding the accuracy of extracted bone using the different techniques demonstrated the superiority of the VWW atlas fusion algorithm achieving a Dice similarity measure of 0.82 ± 0.04 compared to arithmetic averaging atlas fusion (0.60 ± 0.02), which uses conventional direct registration. Application of the ORMA approach modestly compromised the accuracy, yielding a Dice similarity measure of 0.76 ± 0.05 for ORMA-VWW and 0.55 ± 0.03 for ORMA-averaging. The results of quantitative PET analysis followed the same

Band co-registration modeling of LAPAN-A3/IPB multispectral imager based on satellite attitude

Science.gov (United States)

Hakim, P. R.; Syafrudin, A. H.; Utama, S.; Jayani, A. P. S.

2018-05-01

One of significant geometric distortion on images of LAPAN-A3/IPB multispectral imager is co-registration error between each color channel detector. Band co-registration distortion usually can be corrected by using several approaches, which are manual method, image matching algorithm, or sensor modeling and calibration approach. This paper develops another approach to minimize band co-registration distortion on LAPAN-A3/IPB multispectral image by using supervised modeling of image matching with respect to satellite attitude. Modeling results show that band co-registration error in across-track axis is strongly influenced by yaw angle, while error in along-track axis is fairly influenced by both pitch and roll angle. Accuracy of the models obtained is pretty good, which lies between 1-3 pixels error for each axis of each pair of band co-registration. This mean that the model can be used to correct the distorted images without the need of slower image matching algorithm, nor the laborious effort needed in manual approach and sensor calibration. Since the calculation can be executed in order of seconds, this approach can be used in real time quick-look image processing in ground station or even in satellite on-board image processing.

Image registration based on virtual frame sequence analysis

Energy Technology Data Exchange (ETDEWEB)

Chen, H.; Ng, W.S. [Nanyang Technological University, Computer Integrated Medical Intervention Laboratory, School of Mechanical and Aerospace Engineering, Singapore (Singapore); Shi, D. (Nanyang Technological University, School of Computer Engineering, Singapore, Singpore); Wee, S.B. [Tan Tock Seng Hospital, Department of General Surgery, Singapore (Singapore)

2007-08-15

This paper is to propose a new framework for medical image registration with large nonrigid deformations, which still remains one of the biggest challenges for image fusion and further analysis in many medical applications. Registration problem is formulated as to recover a deformation process with the known initial state and final state. To deal with large nonlinear deformations, virtual frames are proposed to be inserted to model the deformation process. A time parameter is introduced and the deformation between consecutive frames is described with a linear affine transformation. Experiments are conducted with simple geometric deformation as well as complex deformations presented in MRI and ultrasound images. All the deformations are characterized with nonlinearity. The positive results demonstrated the effectiveness of this algorithm. The framework proposed in this paper is feasible to register medical images with large nonlinear deformations and is especially useful for sequential images. (orig.)

Evaluation of whole‐body MR to CT deformable image registration

Science.gov (United States)

Akbarzadeh, A.; Gutierrez, D.; Baskin, A.; Ay, M.R.; Ahmadian, A.; Alam, N. Riahi; Lövblad, KO

2013-01-01

Multimodality image registration plays a crucial role in various clinical and research applications. The aim of this study is to present an optimized MR to CT whole‐body deformable image registration algorithm and its validation using clinical studies. A 3D intermodality registration technique based on B‐spline transformation was performed using optimized parameters of the elastix package based on the Insight Toolkit (ITK) framework. Twenty‐eight (17 male and 11 female) clinical studies were used in this work. The registration was evaluated using anatomical landmarks and segmented organs. In addition to 16 anatomical landmarks, three key organs (brain, lungs, and kidneys) and the entire body volume were segmented for evaluation. Several parameters — such as the Euclidean distance between anatomical landmarks, target overlap, Dice and Jaccard coefficients, false positives and false negatives, volume similarity, distance error, and Hausdorff distance — were calculated to quantify the quality of the registration algorithm. Dice coefficients for the majority of patients (>75%) were in the 0.8–1 range for the whole body, brain, and lungs, which satisfies the criteria to achieve excellent alignment. On the other hand, for kidneys, Dice coefficients for volumes of 25% of the patients meet excellent volume agreement requirement, while the majority of patients satisfy good agreement criteria (>0.6). For all patients, the distance error was in 0–10 mm range for all segmented organs. In summary, we optimized and evaluated the accuracy of an MR to CT deformable registration algorithm. The registered images constitute a useful 3D whole‐body MR‐CT atlas suitable for the development and evaluation of novel MR‐guided attenuation correction procedures on hybrid PET‐MR systems. PACS number: 07.05.Pj PMID:23835382

Learning-based meta-algorithm for MRI brain extraction.

Science.gov (United States)

Shi, Feng; Wang, Li; Gilmore, John H; Lin, Weili; Shen, Dinggang

2011-01-01

Multiple-segmentation-and-fusion method has been widely used for brain extraction, tissue segmentation, and region of interest (ROI) localization. However, such studies are hindered in practice by their computational complexity, mainly coming from the steps of template selection and template-to-subject nonlinear registration. In this study, we address these two issues and propose a novel learning-based meta-algorithm for MRI brain extraction. Specifically, we first use exemplars to represent the entire template library, and assign the most similar exemplar to the test subject. Second, a meta-algorithm combining two existing brain extraction algorithms (BET and BSE) is proposed to conduct multiple extractions directly on test subject. Effective parameter settings for the meta-algorithm are learned from the training data and propagated to subject through exemplars. We further develop a level-set based fusion method to combine multiple candidate extractions together with a closed smooth surface, for obtaining the final result. Experimental results show that, with only a small portion of subjects for training, the proposed method is able to produce more accurate and robust brain extraction results, at Jaccard Index of 0.956 +/- 0.010 on total 340 subjects under 6-fold cross validation, compared to those by the BET and BSE even using their best parameter combinations.

Non-rigid registration of tomographic images with Fourier transforms

International Nuclear Information System (INIS)

Osorio, Ar; Isoardi, Ra; Mato, G

2007-01-01

Spatial image registration of deformable body parts such as thorax and abdomen has important medical applications, but at the same time, it represents an important computational challenge. In this work we propose an automatic algorithm to perform non-rigid registration of tomographic images using a non-rigid model based on Fourier transforms. As a measure of similarity, we use the correlation coefficient, finding that the optimal order of the transformation is n = 3 (36 parameters). We apply this method to a digital phantom and to 7 pairs of patient images corresponding to clinical CT scans. The preliminary results indicate a fairly good agreement according to medical experts, with an average registration error of 2 mm for the case of clinical images. For 2D images (dimensions 512x512), the average running time for the algorithm is 15 seconds using a standard personal computer. Summarizing, we find that intra-modality registration of the abdomen can be achieved with acceptable accuracy for slight deformations and can be extended to 3D with a reasonable execution time

Invisible marker based augmented reality system

Science.gov (United States)

Park, Hanhoon; Park, Jong-Il

2005-07-01

Augmented reality (AR) has recently gained significant attention. The previous AR techniques usually need a fiducial marker with known geometry or objects of which the structure can be easily estimated such as cube. Placing a marker in the workspace of the user can be intrusive. To overcome this limitation, we present an AR system using invisible markers which are created/drawn with an infrared (IR) fluorescent pen. Two cameras are used: an IR camera and a visible camera, which are positioned in each side of a cold mirror so that their optical centers coincide with each other. We track the invisible markers using IR camera and visualize AR in the view of visible camera. Additional algorithms are employed for the system to have a reliable performance in the cluttered background. Experimental results are given to demonstrate the viability of the proposed system. As an application of the proposed system, the invisible marker can act as a Vision-Based Identity and Geometry (VBIG) tag, which can significantly extend the functionality of RFID. The invisible tag is the same as RFID in that it is not perceivable while more powerful in that the tag information can be presented to the user by direct projection using a mobile projector or by visualizing AR on the screen of mobile PDA.

Overlay improvement by exposure map based mask registration optimization

Science.gov (United States)

Shi, Irene; Guo, Eric; Chen, Ming; Lu, Max; Li, Gordon; Li, Rivan; Tian, Eric

2015-03-01

Along with the increased miniaturization of semiconductor electronic devices, the design rules of advanced semiconductor devices shrink dramatically. [1] One of the main challenges of lithography step is the layer-to-layer overlay control. Furthermore, DPT (Double Patterning Technology) has been adapted for the advanced technology node like 28nm and 14nm, corresponding overlay budget becomes even tighter. [2][3] After the in-die mask registration (pattern placement) measurement is introduced, with the model analysis of a KLA SOV (sources of variation) tool, it's observed that registration difference between masks is a significant error source of wafer layer-to-layer overlay at 28nm process. [4][5] Mask registration optimization would highly improve wafer overlay performance accordingly. It was reported that a laser based registration control (RegC) process could be applied after the pattern generation or after pellicle mounting and allowed fine tuning of the mask registration. [6] In this paper we propose a novel method of mask registration correction, which can be applied before mask writing based on mask exposure map, considering the factors of mask chip layout, writing sequence, and pattern density distribution. Our experiment data show if pattern density on the mask keeps at a low level, in-die mask registration residue error in 3sigma could be always under 5nm whatever blank type and related writer POSCOR (position correction) file was applied; it proves random error induced by material or equipment would occupy relatively fixed error budget as an error source of mask registration. On the real production, comparing the mask registration difference through critical production layers, it could be revealed that registration residue error of line space layers with higher pattern density is always much larger than the one of contact hole layers with lower pattern density. Additionally, the mask registration difference between layers with similar pattern density

Successive approximation algorithm for cancellation of artifacts in DSA images

International Nuclear Information System (INIS)

Funakami, Raiko; Hiroshima, Kyoichi; Nishino, Junji

2000-01-01

In this paper, we propose an algorithm for cancellation of artifacts in DSA images. We have already proposed an automatic registration method based on the detection of local movements. When motion of the object is large, it is difficult to estimate the exact movement, and the cancellation of artifacts may therefore fail. The algorithm we propose here is based on a simple rigid model. We present the results of applying the proposed method to a series of experimental X-ray images, as well as the results of applying the algorithm as preprocessing for a registration method based on local movement. (author)

Cortical surface registration using spherical thin-plate spline with sulcal lines and mean curvature as features.

Science.gov (United States)

Park, Hyunjin; Park, Jun-Sung; Seong, Joon-Kyung; Na, Duk L; Lee, Jong-Min

2012-04-30

Analysis of cortical patterns requires accurate cortical surface registration. Many researchers map the cortical surface onto a unit sphere and perform registration of two images defined on the unit sphere. Here we have developed a novel registration framework for the cortical surface based on spherical thin-plate splines. Small-scale composition of spherical thin-plate splines was used as the geometric interpolant to avoid folding in the geometric transform. Using an automatic algorithm based on anisotropic skeletons, we extracted seven sulcal lines, which we then incorporated as landmark information. Mean curvature was chosen as an additional feature for matching between spherical maps. We employed a two-term cost function to encourage matching of both sulcal lines and the mean curvature between the spherical maps. Application of our registration framework to fifty pairwise registrations of T1-weighted MRI scans resulted in improved registration accuracy, which was computed from sulcal lines. Our registration approach was tested as an additional procedure to improve an existing surface registration algorithm. Our registration framework maintained an accurate registration over the sulcal lines while significantly increasing the cross-correlation of mean curvature between the spherical maps being registered. Copyright © 2012 Elsevier B.V. All rights reserved.

SU-F-J-166: Volumetric Spatial Distortions Comparison for 1.5 Tesla Versus 3 Tesla MRI for Gamma Knife Radiosurgery Scans Using Frame Marker Fusion and Co-Registration Modes

International Nuclear Information System (INIS)

Neyman, G

2016-01-01

Purpose: To compare typical volumetric spatial distortions for 1.5 Tesla versus 3 Tesla MRI Gamma Knife radiosurgery scans in the frame marker fusion and co-registration frame-less modes. Methods: Quasar phantom by Modus Medical Devices Inc. with GRID image distortion software was used for measurements of volumetric distortions. 3D volumetric T1 weighted scans of the phantom were produced on 1.5 T Avanto and 3 T Skyra MRI Siemens scanners. The analysis was done two ways: for scans with localizer markers from the Leksell frame and relatively to the phantom only (simulated co-registration technique). The phantom grid contained a total of 2002 vertices or control points that were used in the assessment of volumetric geometric distortion for all scans. Results: Volumetric mean absolute spatial deviations relatively to the frame localizer markers for 1.5 and 3 Tesla machine were: 1.39 ± 0.15 and 1.63 ± 0.28 mm with max errors of 1.86 and 2.65 mm correspondingly. Mean 2D errors from the Gamma Plan were 0.3 and 1.0 mm. For simulated co-registration technique the volumetric mean absolute spatial deviations relatively to the phantom for 1.5 and 3 Tesla machine were: 0.36 ± 0.08 and 0.62 ± 0.13 mm with max errors of 0.57 and 1.22 mm correspondingly. Conclusion: Volumetric spatial distortions are lower for 1.5 Tesla versus 3 Tesla MRI machines localized with markers on frames and significantly lower for co-registration techniques with no frame localization. The results show the advantage of using co-registration technique for minimizing MRI volumetric spatial distortions which can be especially important for steep dose gradient fields typically used in Gamma Knife radiosurgery. Consultant for Elekta AB

SU-F-J-166: Volumetric Spatial Distortions Comparison for 1.5 Tesla Versus 3 Tesla MRI for Gamma Knife Radiosurgery Scans Using Frame Marker Fusion and Co-Registration Modes

Energy Technology Data Exchange (ETDEWEB)

Neyman, G [The Cleveland Clinic Foundation, Cleveland, OH (United States)

2016-06-15

Purpose: To compare typical volumetric spatial distortions for 1.5 Tesla versus 3 Tesla MRI Gamma Knife radiosurgery scans in the frame marker fusion and co-registration frame-less modes. Methods: Quasar phantom by Modus Medical Devices Inc. with GRID image distortion software was used for measurements of volumetric distortions. 3D volumetric T1 weighted scans of the phantom were produced on 1.5 T Avanto and 3 T Skyra MRI Siemens scanners. The analysis was done two ways: for scans with localizer markers from the Leksell frame and relatively to the phantom only (simulated co-registration technique). The phantom grid contained a total of 2002 vertices or control points that were used in the assessment of volumetric geometric distortion for all scans. Results: Volumetric mean absolute spatial deviations relatively to the frame localizer markers for 1.5 and 3 Tesla machine were: 1.39 ± 0.15 and 1.63 ± 0.28 mm with max errors of 1.86 and 2.65 mm correspondingly. Mean 2D errors from the Gamma Plan were 0.3 and 1.0 mm. For simulated co-registration technique the volumetric mean absolute spatial deviations relatively to the phantom for 1.5 and 3 Tesla machine were: 0.36 ± 0.08 and 0.62 ± 0.13 mm with max errors of 0.57 and 1.22 mm correspondingly. Conclusion: Volumetric spatial distortions are lower for 1.5 Tesla versus 3 Tesla MRI machines localized with markers on frames and significantly lower for co-registration techniques with no frame localization. The results show the advantage of using co-registration technique for minimizing MRI volumetric spatial distortions which can be especially important for steep dose gradient fields typically used in Gamma Knife radiosurgery. Consultant for Elekta AB.

3D registration of surfaces for change detection in medical images

Science.gov (United States)

Fisher, Elizabeth; van der Stelt, Paul F.; Dunn, Stanley M.

1997-04-01

Spatial registration of data sets is essential for quantifying changes that take place over time in cases where the position of a patient with respect to the sensor has been altered. Changes within the region of interest can be problematic for automatic methods of registration. This research addresses the problem of automatic 3D registration of surfaces derived from serial, single-modality images for the purpose of quantifying changes over time. The registration algorithm utilizes motion-invariant, curvature- based geometric properties to derive an approximation to an initial rigid transformation to align two image sets. Following the initial registration, changed portions of the surface are detected and excluded before refining the transformation parameters. The performance of the algorithm was tested using simulation experiments. To quantitatively assess the registration, random noise at various levels, known rigid motion transformations, and analytically-defined volume changes were applied to the initial surface data acquired from models of teeth. These simulation experiments demonstrated that the calculated transformation parameters were accurate to within 1.2 percent of the total applied rotation and 2.9 percent of the total applied translation, even at the highest applied noise levels and simulated wear values.

Non-rigid CT/CBCT to CBCT registration for online external beam radiotherapy guidance

Science.gov (United States)

Zachiu, Cornel; de Senneville, Baudouin Denis; Tijssen, Rob H. N.; Kotte, Alexis N. T. J.; Houweling, Antonetta C.; Kerkmeijer, Linda G. W.; Lagendijk, Jan J. W.; Moonen, Chrit T. W.; Ries, Mario

2018-01-01

Image-guided external beam radiotherapy (EBRT) allows radiation dose deposition with a high degree of accuracy and precision. Guidance is usually achieved by estimating the displacements, via image registration, between cone beam computed tomography (CBCT) and computed tomography (CT) images acquired at different stages of the therapy. The resulting displacements are then used to reposition the patient such that the location of the tumor at the time of treatment matches its position during planning. Moreover, ongoing research aims to use CBCT-CT image registration for online plan adaptation. However, CBCT images are usually acquired using a small number of x-ray projections and/or low beam intensities. This often leads to the images being subject to low contrast, low signal-to-noise ratio and artifacts, which ends-up hampering the image registration process. Previous studies addressed this by integrating additional image processing steps into the registration procedure. However, these steps are usually designed for particular image acquisition schemes, therefore limiting their use on a case-by-case basis. In the current study we address CT to CBCT and CBCT to CBCT registration by the means of the recently proposed EVolution registration algorithm. Contrary to previous approaches, EVolution does not require the integration of additional image processing steps in the registration scheme. Moreover, the algorithm requires a low number of input parameters, is easily parallelizable and provides an elastic deformation on a point-by-point basis. Results have shown that relative to a pure CT-based registration, the intrinsic artifacts present in typical CBCT images only have a sub-millimeter impact on the accuracy and precision of the estimated deformation. In addition, the algorithm has low computational requirements, which are compatible with online image-based guidance of EBRT treatments.

Augmented reality during robot-assisted laparoscopic partial nephrectomy: toward real-time 3D-CT to stereoscopic video registration.

Science.gov (United States)

Su, Li-Ming; Vagvolgyi, Balazs P; Agarwal, Rahul; Reiley, Carol E; Taylor, Russell H; Hager, Gregory D

2009-04-01

To investigate a markerless tracking system for real-time stereo-endoscopic visualization of preoperative computed tomographic imaging as an augmented display during robot-assisted laparoscopic partial nephrectomy. Stereoscopic video segments of a patient undergoing robot-assisted laparoscopic partial nephrectomy for tumor and another for a partial staghorn renal calculus were processed to evaluate the performance of a three-dimensional (3D)-to-3D registration algorithm. After both cases, we registered a segment of the video recording to the corresponding preoperative 3D-computed tomography image. After calibrating the camera and overlay, 3D-to-3D registration was created between the model and the surgical recording using a modified iterative closest point technique. Image-based tracking technology tracked selected fixed points on the kidney surface to augment the image-to-model registration. Our investigation has demonstrated that we can identify and track the kidney surface in real time when applied to intraoperative video recordings and overlay the 3D models of the kidney, tumor (or stone), and collecting system semitransparently. Using a basic computer research platform, we achieved an update rate of 10 Hz and an overlay latency of 4 frames. The accuracy of the 3D registration was 1 mm. Augmented reality overlay of reconstructed 3D-computed tomography images onto real-time stereo video footage is possible using iterative closest point and image-based surface tracking technology that does not use external navigation tracking systems or preplaced surface markers. Additional studies are needed to assess the precision and to achieve fully automated registration and display for intraoperative use.

Development of a hardware-based registration system for the multimodal medical images by USB cameras

International Nuclear Information System (INIS)

Iwata, Michiaki; Minato, Kotaro; Watabe, Hiroshi; Koshino, Kazuhiro; Yamamoto, Akihide; Iida, Hidehiro

2009-01-01

There are several medical imaging scanners and each modality has different aspect for visualizing inside of human body. By combining these images, diagnostic accuracy could be improved, and therefore, several attempts for multimodal image registration have been implemented. One popular approach is to use hybrid image scanners such as positron emission tomography (PET)/CT and single photon emission computed tomography (SPECT)/CT. However, these hybrid scanners are expensive and not fully available. We developed multimodal image registration system with universal serial bus (USB) cameras, which is inexpensive and applicable to any combinations of existed conventional imaging scanners. The multiple USB cameras will determine the three dimensional positions of a patient while scanning. Using information of these positions and rigid body transformation, the acquired image is registered to the common coordinate which is shared with another scanner. For each scanner, reference marker is attached on gantry of the scanner. For observing the reference marker's position by the USB cameras, the location of the USB cameras can be arbitrary. In order to validate the system, we scanned a cardiac phantom with different positions by PET and MRI scanners. Using this system, images from PET and MRI were visually aligned, and good correlations between PET and MRI images were obtained after the registration. The results suggest this system can be inexpensively used for multimodal image registrations. (author)

Registration methods for pulmonary image analysis integration of morphological and physiological knowledge

CERN Document Server

Schmidt-Richberg, Alexander

2014-01-01

Various applications in the field of pulmonary image analysis require a registration of CT images of the lung. For example, a registration-based estimation of the breathing motion is employed to increase the accuracy of dose distribution in radiotherapy. Alexander Schmidt-Richberg develops methods to explicitly model morphological and physiological knowledge about respiration in algorithms for the registration of thoracic CT images. The author focusses on two lung-specific issues: on the one hand, the alignment of the interlobular fissures and on the other hand, the estimation of sliding motion at the lung boundaries. He shows that by explicitly considering these aspects based on a segmentation of the respective structure, registration accuracy can be significantly improved.

Comprehensive evaluation of ten deformable image registration algorithms for contour propagation between CT and cone-beam CT images in adaptive head & neck radiotherapy.

Science.gov (United States)

Li, Xin; Zhang, Yuyu; Shi, Yinghua; Wu, Shuyu; Xiao, Yang; Gu, Xuejun; Zhen, Xin; Zhou, Linghong

2017-01-01

Deformable image registration (DIR) is a critical technic in adaptive radiotherapy (ART) for propagating contours between planning computerized tomography (CT) images and treatment CT/cone-beam CT (CBCT) images to account for organ deformation for treatment re-planning. To validate the ability and accuracy of DIR algorithms in organ at risk (OAR) contour mapping, ten intensity-based DIR strategies, which were classified into four categories-optical flow-based, demons-based, level-set-based and spline-based-were tested on planning CT and fractional CBCT images acquired from twenty-one head & neck (H&N) cancer patients who underwent 6~7-week intensity-modulated radiation therapy (IMRT). Three similarity metrics, i.e., the Dice similarity coefficient (DSC), the percentage error (PE) and the Hausdorff distance (HD), were employed to measure the agreement between the propagated contours and the physician-delineated ground truths of four OARs, including the vertebra (VTB), the vertebral foramen (VF), the parotid gland (PG) and the submandibular gland (SMG). It was found that the evaluated DIRs in this work did not necessarily outperform rigid registration. DIR performed better for bony structures than soft-tissue organs, and the DIR performance tended to vary for different ROIs with different degrees of deformation as the treatment proceeded. Generally, the optical flow-based DIR performed best, while the demons-based DIR usually ranked last except for a modified demons-based DISC used for CT-CBCT DIR. These experimental results suggest that the choice of a specific DIR algorithm depends on the image modality, anatomic site, magnitude of deformation and application. Therefore, careful examinations and modifications are required before accepting the auto-propagated contours, especially for automatic re-planning ART systems.

Evaluation of registration methods on thoracic CT

DEFF Research Database (Denmark)

Murphy, K.; van Ginneken, B.; Reinhardt, J.

2011-01-01

method and the evaluation is independent, using the same criteria for all participants. All results are published on the EMPIRE10 website (http://empire10.isi.uu.nl). The challenge remains ongoing and open to new participants. Full results from 24 algorithms have been published at the time of writing......EMPIRE10 (Evaluation of Methods for Pulmonary Image REgistration 2010) is a public platform for fair and meaningful comparison of registration algorithms which are applied to a database of intra-patient thoracic CT image pairs. Evaluation of non-rigid registration techniques is a non trivial task....... This article details the organisation of the challenge, the data and evaluation methods and the outcome of the initial launch with 20 algorithms. The gain in knowledge and future work are discussed....

Non-rigid image registration using bone growth model

DEFF Research Database (Denmark)

Bro-Nielsen, Morten; Gramkow, Claus; Kreiborg, Sven

1997-01-01

Non-rigid registration has traditionally used physical models like elasticity and fluids. These models are very seldom valid models of the difference between the registered images. This paper presents a non-rigid registration algorithm, which uses a model of bone growth as a model of the change...... between time sequence images of the human mandible. By being able to register the images, this paper at the same time contributes to the validation of the growth model, which is based on the currently available medical theories and knowledge...

Mixed Marker-Based/Marker-Less Visual Odometry System for Mobile Robots

Directory of Open Access Journals (Sweden)

Fabrizio Lamberti

2013-05-01

Full Text Available Abstract When moving in generic indoor environments, robotic platforms generally rely solely on information provided by onboard sensors to determine their position and orientation. However, the lack of absolute references often leads to the introduction of severe drifts in estimates computed, making autonomous operations really hard to accomplish. This paper proposes a solution to alleviate the impact of the above issues by combining two vision-based pose estimation techniques working on relative and absolute coordinate systems, respectively. In particular, the unknown ground features in the images that are captured by the vertical camera of a mobile platform are processed by a vision-based odometry algorithm, which is capable of estimating the relative frame-to-frame movements. Then, errors accumulated in the above step are corrected using artificial markers displaced at known positions in the environment. The markers are framed from time to time, which allows the robot to maintain the drifts bounded by additionally providing it with the navigation commands needed for autonomous flight. Accuracy and robustness of the designed technique are demonstrated using an off-the-shelf quadrotor via extensive experimental tests.

Visibility of fiducial markers used for image-guided radiation therapy on optical coherence tomography for registration with CT: An esophageal phantom study.

Science.gov (United States)

Jelvehgaran, Pouya; Alderliesten, Tanja; Weda, Jelmer J A; de Bruin, Martijn; Faber, Dirk J; Hulshof, Maarten C C M; van Leeuwen, Ton G; van Herk, Marcel; de Boer, Johannes F

2017-12-01

Optical coherence tomography (OCT) is of interest to visualize microscopic esophageal tumor extensions to improve tumor delineation for radiation therapy (RT) planning. Fiducial marker placement is a common method to ensure target localization during planning and treatment. Visualization of these fiducial markers on OCT permits integrating OCT and computed tomography (CT) images used for RT planning via image registration. We studied the visibility of 13 (eight types) commercially available solid and liquid fiducial markers in OCT images at different depths using dedicated esophageal phantoms and evaluated marker placement depth in clinical practice. We designed and fabricated dedicated esophageal phantoms, in which three layers mimic the anatomical wall structures of a healthy human esophagus. We successfully implanted 13 commercially available fiducial markers that varied in diameter and material property at depths between 0.5 and 3.0 mm. The resulting esophageal phantoms were imaged with OCT, and marker visibility was assessed qualitatively and quantitatively using the contrast-to-background-noise ratio (CNR). The CNR was defined as the difference between the mean intensity of the fiducial markers and the mean intensity of the background divided by the standard deviation of the background intensity. To determine whether, in current clinical practice, the implanted fiducial markers are within the OCT visualization range (up to 3.0 mm depth), we retrospectively measured the distance of 19 fiducial markers to the esophageal lumen on CT scans of 16 esophageal cancer patients. In the esophageal phantoms, all the included fiducial markers were visible on OCT at all investigated depths. Solid fiducial markers were better visible on OCT than liquid fiducial markers with a 1.74-fold higher CNR. Although fiducial marker identification per type and size was slightly easier for superficially implanted fiducial markers, we observed no difference in the ability of OCT to

A NEW IMAGE REGISTRATION METHOD FOR GREY IMAGES

Institute of Scientific and Technical Information of China (English)

Nie Xuan; Zhao Rongchun; Jiang Zetao

2004-01-01

The proposed algorithm relies on a group of new formulas for calculating tangent slope so as to address angle feature of edge curves of image. It can utilize tangent angle features to estimate automatically and fully the rotation parameters of geometric transform and enable rough matching of images with huge rotation difference. After angle compensation, it can search for matching point sets by correlation criterion, then calculate parameters of affine transform, enable higher-precision emendation of rotation and transferring. Finally, it fulfills precise matching for images with relax-tense iteration method. Compared with the registration approach based on wavelet direction-angle features, the matching algorithm with tangent feature of image edge is more robust and realizes precise registration of various images. Furthermore, it is also helpful in graphics matching.

Historical Image Registration and Land-Use Land-Cover Change Analysis

Directory of Open Access Journals (Sweden)

Fang-Ju Jao

2014-12-01

Full Text Available Historical aerial images are important to retain past ground surface information. The land-use land-cover change in the past can be identified using historical aerial images. Automatic historical image registration and stitching is essential because the historical image pose information was usually lost. In this study, the Scale Invariant Feature Transform (SIFT algorithm was used for feature extraction. Subsequently, the present study used the automatic affine transformation algorithm for historical image registration, based on SIFT features and control points. This study automatically determined image affine parameters and simultaneously transformed from an image coordinate system to a ground coordinate system. After historical aerial image registration, the land-use land-cover change was analyzed between two different years (1947 and 1975 at the Tseng Wen River estuary. Results show that sandbars and water zones were transformed into a large number of fish ponds between 1947 and 1975.

Automated landmark-guided deformable image registration.

Science.gov (United States)

Kearney, Vasant; Chen, Susie; Gu, Xuejun; Chiu, Tsuicheng; Liu, Honghuan; Jiang, Lan; Wang, Jing; Yordy, John; Nedzi, Lucien; Mao, Weihua

2015-01-07

The purpose of this work is to develop an automated landmark-guided deformable image registration (LDIR) algorithm between the planning CT and daily cone-beam CT (CBCT) with low image quality. This method uses an automated landmark generation algorithm in conjunction with a local small volume gradient matching search engine to map corresponding landmarks between the CBCT and the planning CT. The landmarks act as stabilizing control points in the following Demons deformable image registration. LDIR is implemented on graphics processing units (GPUs) for parallel computation to achieve ultra fast calculation. The accuracy of the LDIR algorithm has been evaluated on a synthetic case in the presence of different noise levels and data of six head and neck cancer patients. The results indicate that LDIR performed better than rigid registration, Demons, and intensity corrected Demons for all similarity metrics used. In conclusion, LDIR achieves high accuracy in the presence of multimodality intensity mismatch and CBCT noise contamination, while simultaneously preserving high computational efficiency.

Automated landmark-guided deformable image registration

International Nuclear Information System (INIS)

Kearney, Vasant; Chen, Susie; Gu, Xuejun; Chiu, Tsuicheng; Liu, Honghuan; Jiang, Lan; Wang, Jing; Yordy, John; Nedzi, Lucien; Mao, Weihua

2015-01-01

The purpose of this work is to develop an automated landmark-guided deformable image registration (LDIR) algorithm between the planning CT and daily cone-beam CT (CBCT) with low image quality. This method uses an automated landmark generation algorithm in conjunction with a local small volume gradient matching search engine to map corresponding landmarks between the CBCT and the planning CT. The landmarks act as stabilizing control points in the following Demons deformable image registration. LDIR is implemented on graphics processing units (GPUs) for parallel computation to achieve ultra fast calculation. The accuracy of the LDIR algorithm has been evaluated on a synthetic case in the presence of different noise levels and data of six head and neck cancer patients. The results indicate that LDIR performed better than rigid registration, Demons, and intensity corrected Demons for all similarity metrics used. In conclusion, LDIR achieves high accuracy in the presence of multimodality intensity mismatch and CBCT noise contamination, while simultaneously preserving high computational efficiency. (paper)

A Remote Registration Based on MIDAS

Science.gov (United States)

JIN, Xin

2017-04-01

We often need for software registration to protect the interests of the software developers. This article narrated one kind of software long-distance registration technology. The registration method is: place the registration information in a database table, after the procedure starts in check table registration information, if it has registered then the procedure may the normal operation; Otherwise, the customer must input the sequence number and registers through the network on the long-distance server. If it registers successfully, then records the registration information in the database table. This remote registration method can protect the rights of software developers.

Bladder dose accumulation based on a biomechanical deformable image registration algorithm in volumetric modulated arc therapy for prostate cancer

DEFF Research Database (Denmark)

Andersen, E S; Muren, L P; Sørensen, T S

2012-01-01

Variations in bladder position, shape and volume cause uncertainties in the doses delivered to this organ during a course of radiotherapy for pelvic tumors. The purpose of this study was to evaluate the potential of dose accumulation based on repeat imaging and deformable image registration (DIR)...

MO-C-17A-05: A Three-Dimensional Head-And-Neck Phantom for Validation of Kilovoltage- and Megavoltage-Based Deformable Image Registration

International Nuclear Information System (INIS)

Kirby, N; Singhrao, K; Pouliot, J

2014-01-01

Purpose: To develop a three-dimensional (3D) deformable head-and-neck (H and N) phantom with realistic tissue contrast for both kilovoltage and megavoltage computed tomography and use it to objectively evaluate deformable image registration (DIR) algorithms. Methods: The phantom represents H and N patient anatomy. It is constructed from thermoplastic, which becomes pliable in boiling water, and hardened epoxy resin. Using a system of additives, the Hounsfield unit (HU) values of these materials were tuned to mimic anatomy for both kilovoltage (kV) and megavoltage (MV) imaging. The phantom opened along a sagittal midsection to reveal nonradiopaque markers, which were used to characterize the phantom deformation. The deformed and undeformed phantom was scanned with kV and MV computed tomography. Additionally, a calibration curve was created to change the HUs of the MV scans to be similar to kV HUs, (MC). The extracted ground-truth deformation was then compared to the results of two commercially available DIR algorithms, from Velocity Medical Solutions and MIM Software. Results: The phantom produced a 3D deformation, representing neck flexion, with a magnitude of up to 8 mm and was able represent tissue HUs for both kV and MV imaging modalities. The two tested deformation algorithms yielded vastly different results. For kV-kV registration, MIM made the lowest mean error, and Velocity made the lowest maximum error. For MV-MV, kV-MV, and kV-MC Velocity produced both the lowest mean and lowest maximum errors. Conclusion: The application of DIR across different imaging modalities is particularly difficult, due to differences in tissue HUs and the presence of imaging artifacts. For this reason, DIR algorithms must be validated specifically for this purpose. The developed H and N phantom is an effective tool for this purpose

Comparison of manual and automatic MR-CT registration for radiotherapy of prostate cancer.

Science.gov (United States)

Korsager, Anne Sofie; Carl, Jesper; Riis Østergaard, Lasse

2016-05-08

In image-guided radiotherapy (IGRT) of prostate cancer, delineation of the clini-cal target volume (CTV) often relies on magnetic resonance (MR) because of its good soft-tissue visualization. Registration of MR and computed tomography (CT) is required in order to add this accurate delineation to the dose planning CT. An automatic approach for local MR-CT registration of the prostate has previously been developed using a voxel property-based registration as an alternative to a manual landmark-based registration. The aim of this study is to compare the two registration approaches and to investigate the clinical potential for replacing the manual registration with the automatic registration. Registrations and analysis were performed for 30 prostate cancer patients treated with IGRT using a Ni-Ti prostate stent as a fiducial marker. The comparison included computing translational and rotational differences between the approaches, visual inspection, and computing the overlap of the CTV. The computed mean translational difference was 1.65, 1.60, and 1.80mm and the computed mean rotational difference was 1.51°, 3.93°, and 2.09° in the superior/inferior, anterior/posterior, and medial/lateral direction, respectively. The sensitivity of overlap was 87%. The results demonstrate that the automatic registration approach performs registrations comparable to the manual registration.

Method of automatic image registration of three-dimensional range of archaeological restoration

International Nuclear Information System (INIS)

Garcia, O.; Perez, M.; Morales, N.

2012-01-01

We propose an automatic registration system for reconstruction of various positions of a large object based on a static structured light pattern. The system combines the technology of stereo vision, structured light pattern, the positioning system of the vision sensor and an algorithm that simplifies the process of finding correspondence for the modeling of large objects. A new structured light pattern based on Kautz sequence is proposed, using this pattern as static implement a proposed new registration method. (Author)

[Multimodal medical image registration using cubic spline interpolation method].

Science.gov (United States)

He, Yuanlie; Tian, Lianfang; Chen, Ping; Wang, Lifei; Ye, Guangchun; Mao, Zongyuan

2007-12-01

Based on the characteristic of the PET-CT multimodal image series, a novel image registration and fusion method is proposed, in which the cubic spline interpolation method is applied to realize the interpolation of PET-CT image series, then registration is carried out by using mutual information algorithm and finally the improved principal component analysis method is used for the fusion of PET-CT multimodal images to enhance the visual effect of PET image, thus satisfied registration and fusion results are obtained. The cubic spline interpolation method is used for reconstruction to restore the missed information between image slices, which can compensate for the shortage of previous registration methods, improve the accuracy of the registration, and make the fused multimodal images more similar to the real image. Finally, the cubic spline interpolation method has been successfully applied in developing 3D-CRT (3D Conformal Radiation Therapy) system.

Edge-based correlation image registration for multispectral imaging

Science.gov (United States)

Nandy, Prabal [Albuquerque, NM

2009-11-17

Registration information for images of a common target obtained from a plurality of different spectral bands can be obtained by combining edge detection and phase correlation. The images are edge-filtered, and pairs of the edge-filtered images are then phase correlated to produce phase correlation images. The registration information can be determined based on these phase correlation images.

Comprehensive evaluation of ten deformable image registration algorithms for contour propagation between CT and cone-beam CT images in adaptive head & neck radiotherapy.

Directory of Open Access Journals (Sweden)

Xin Li

Full Text Available Deformable image registration (DIR is a critical technic in adaptive radiotherapy (ART for propagating contours between planning computerized tomography (CT images and treatment CT/cone-beam CT (CBCT images to account for organ deformation for treatment re-planning. To validate the ability and accuracy of DIR algorithms in organ at risk (OAR contour mapping, ten intensity-based DIR strategies, which were classified into four categories-optical flow-based, demons-based, level-set-based and spline-based-were tested on planning CT and fractional CBCT images acquired from twenty-one head & neck (H&N cancer patients who underwent 6~7-week intensity-modulated radiation therapy (IMRT. Three similarity metrics, i.e., the Dice similarity coefficient (DSC, the percentage error (PE and the Hausdorff distance (HD, were employed to measure the agreement between the propagated contours and the physician-delineated ground truths of four OARs, including the vertebra (VTB, the vertebral foramen (VF, the parotid gland (PG and the submandibular gland (SMG. It was found that the evaluated DIRs in this work did not necessarily outperform rigid registration. DIR performed better for bony structures than soft-tissue organs, and the DIR performance tended to vary for different ROIs with different degrees of deformation as the treatment proceeded. Generally, the optical flow-based DIR performed best, while the demons-based DIR usually ranked last except for a modified demons-based DISC used for CT-CBCT DIR. These experimental results suggest that the choice of a specific DIR algorithm depends on the image modality, anatomic site, magnitude of deformation and application. Therefore, careful examinations and modifications are required before accepting the auto-propagated contours, especially for automatic re-planning ART systems.

Toward adaptive radiotherapy for head and neck patients: Uncertainties in dose warping due to the choice of deformable registration algorithm

Energy Technology Data Exchange (ETDEWEB)

Veiga, Catarina, E-mail: catarina.veiga.11@ucl.ac.uk; Royle, Gary [Radiation Physics Group, Department of Medical Physics and Biomedical Engineering, University College London, London WC1E 6BT (United Kingdom); Lourenço, Ana Mónica [Radiation Physics Group, Department of Medical Physics and Biomedical Engineering, University College London, London WC1E 6BT, United Kingdom and Acoustics and Ionizing Radiation Team, National Physical Laboratory, Teddington TW11 0LW (United Kingdom); Mouinuddin, Syed [Department of Radiotherapy, University College London Hospital, London NW1 2BU (United Kingdom); Herk, Marcel van [Department of Radiation Oncology, The Netherlands Cancer Institute, Amsterdam 1066 CX (Netherlands); Modat, Marc; Ourselin, Sébastien; McClelland, Jamie R. [Centre for Medical Image Computing, Department of Medical Physics and Biomedical Engineering, University College London, London WC1E 6BT (United Kingdom)

2015-02-15

Purpose: The aims of this work were to evaluate the performance of several deformable image registration (DIR) algorithms implemented in our in-house software (NiftyReg) and the uncertainties inherent to using different algorithms for dose warping. Methods: The authors describe a DIR based adaptive radiotherapy workflow, using CT and cone-beam CT (CBCT) imaging. The transformations that mapped the anatomy between the two time points were obtained using four different DIR approaches available in NiftyReg. These included a standard unidirectional algorithm and more sophisticated bidirectional ones that encourage or ensure inverse consistency. The forward (CT-to-CBCT) deformation vector fields (DVFs) were used to propagate the CT Hounsfield units and structures to the daily geometry for “dose of the day” calculations, while the backward (CBCT-to-CT) DVFs were used to remap the dose of the day onto the planning CT (pCT). Data from five head and neck patients were used to evaluate the performance of each implementation based on geometrical matching, physical properties of the DVFs, and similarity between warped dose distributions. Geometrical matching was verified in terms of dice similarity coefficient (DSC), distance transform, false positives, and false negatives. The physical properties of the DVFs were assessed calculating the harmonic energy, determinant of the Jacobian, and inverse consistency error of the transformations. Dose distributions were displayed on the pCT dose space and compared using dose difference (DD), distance to dose difference, and dose volume histograms. Results: All the DIR algorithms gave similar results in terms of geometrical matching, with an average DSC of 0.85 ± 0.08, but the underlying properties of the DVFs varied in terms of smoothness and inverse consistency. When comparing the doses warped by different algorithms, we found a root mean square DD of 1.9% ± 0.8% of the prescribed dose (pD) and that an average of 9% ± 4% of

An atlas-based multimodal registration method for 2D images with discrepancy structures.

Science.gov (United States)

Lv, Wenchao; Chen, Houjin; Peng, Yahui; Li, Yanfeng; Li, Jupeng

2018-06-04

An atlas-based multimodal registration method for 2-dimension images with discrepancy structures was proposed in this paper. Atlas was utilized for complementing the discrepancy structure information in multimodal medical images. The scheme includes three steps: floating image to atlas registration, atlas to reference image registration, and field-based deformation. To evaluate the performance, a frame model, a brain model, and clinical images were employed in registration experiments. We measured the registration performance by the squared sum of intensity differences. Results indicate that this method is robust and performs better than the direct registration for multimodal images with discrepancy structures. We conclude that the proposed method is suitable for multimodal images with discrepancy structures. Graphical Abstract An Atlas-based multimodal registration method schematic diagram.

PCANet-Based Structural Representation for Nonrigid Multimodal Medical Image Registration

Directory of Open Access Journals (Sweden)

Xingxing Zhu

2018-05-01

Full Text Available Nonrigid multimodal image registration remains a challenging task in medical image processing and analysis. The structural representation (SR-based registration methods have attracted much attention recently. However, the existing SR methods cannot provide satisfactory registration accuracy due to the utilization of hand-designed features for structural representation. To address this problem, the structural representation method based on the improved version of the simple deep learning network named PCANet is proposed for medical image registration. In the proposed method, PCANet is firstly trained on numerous medical images to learn convolution kernels for this network. Then, a pair of input medical images to be registered is processed by the learned PCANet. The features extracted by various layers in the PCANet are fused to produce multilevel features. The structural representation images are constructed for two input images based on nonlinear transformation of these multilevel features. The Euclidean distance between structural representation images is calculated and used as the similarity metrics. The objective function defined by the similarity metrics is optimized by L-BFGS method to obtain parameters of the free-form deformation (FFD model. Extensive experiments on simulated and real multimodal image datasets show that compared with the state-of-the-art registration methods, such as modality-independent neighborhood descriptor (MIND, normalized mutual information (NMI, Weber local descriptor (WLD, and the sum of squared differences on entropy images (ESSD, the proposed method provides better registration performance in terms of target registration error (TRE and subjective human vision.

Development and validation of a CT-3D rotational angiography registration method for AVM radiosurgery

International Nuclear Information System (INIS)

Stancanello, Joseph; Cavedon, Carlo; Francescon, Paolo; Cerveri, Pietro; Ferrigno, Giancarlo; Colombo, Federico; Perini, Stefano

2004-01-01

In this paper a novel technique is proposed and validated for radiosurgery treatment planning of arteriovenous malformations (AVMs). The technique was developed for frameless radiosurgery by means of the CyberKnife, a nonisocentric, linac-based system which allows highly conformed isodose surfaces to be obtained, while also being valid for other treatment strategies. The technique is based on registration between computed tomography (CT) and three-dimensional rotational angiography (3DRA). Tests were initially performed on the effectiveness of the correction method for distortion offered by the angiographic system. These results determined the registration technique that was ultimately chosen. For CT-3DRA registration, a twelve-parameter affine transformation was selected, based on a mutual information maximization algorithm. The robustness of the algorithm was tested by attempting to register data sets increasingly distant from each other, both in translation and rotation. Registration accuracy was estimated by means of the 'full circle consistency test'. A registration quality index (expressed in millimeters) based on these results was also defined. A hybrid subtraction between CT and 3DRA is proposed in order to improve 3D reconstruction. Preprocessing improved the ability of the algorithm to find an acceptable solution to the registration process. The robustness tests showed that data sets must be manually prealigned within approximately 15 mm and 20 deg. with respect to all three directions simultaneously. Results of the consistency test showed agreement between the quality index and registration accuracy stated by visual inspection in 20 good and 10 artificially worsened registration processes. The quality index showed values smaller than the maximum voxel size (mean 0.8 mm compared to 2 mm) for all successful registrations, while it resulted in much greater values (mean 20 mm) for unsuccessful registrations. Once registered, the two data sets can be used for

A fast alignment method for breast MRI follow-up studies using automated breast segmentation and current-prior registration

Science.gov (United States)

Wang, Lei; Strehlow, Jan; Rühaak, Jan; Weiler, Florian; Diez, Yago; Gubern-Merida, Albert; Diekmann, Susanne; Laue, Hendrik; Hahn, Horst K.

2015-03-01

In breast cancer screening for high-risk women, follow-up magnetic resonance images (MRI) are acquired with a time interval ranging from several months up to a few years. Prior MRI studies may provide additional clinical value when examining the current one and thus have the potential to increase sensitivity and specificity of screening. To build a spatial correlation between suspicious findings in both current and prior studies, a reliable alignment method between follow-up studies is desirable. However, long time interval, different scanners and imaging protocols, and varying breast compression can result in a large deformation, which challenges the registration process. In this work, we present a fast and robust spatial alignment framework, which combines automated breast segmentation and current-prior registration techniques in a multi-level fashion. First, fully automatic breast segmentation is applied to extract the breast masks that are used to obtain an initial affine transform. Then, a non-rigid registration algorithm using normalized gradient fields as similarity measure together with curvature regularization is applied. A total of 29 subjects and 58 breast MR images were collected for performance assessment. To evaluate the global registration accuracy, the volume overlap and boundary surface distance metrics are calculated, resulting in an average Dice Similarity Coefficient (DSC) of 0.96 and root mean square distance (RMSD) of 1.64 mm. In addition, to measure local registration accuracy, for each subject a radiologist annotated 10 pairs of markers in the current and prior studies representing corresponding anatomical locations. The average distance error of marker pairs dropped from 67.37 mm to 10.86 mm after applying registration.

Free-Form Deformation Approach for Registration of Visible and Infrared Facial Images in Fever Screening

Directory of Open Access Journals (Sweden)

Yedukondala Narendra Dwith Chenna

2018-01-01

Full Text Available Fever screening based on infrared (IR thermographs (IRTs is an approach that has been implemented during infectious disease pandemics, such as Ebola and Severe Acute Respiratory Syndrome. A recently published international standard indicates that regions medially adjacent to the inner canthi provide accurate estimates of core body temperature and are preferred sites for fever screening. Therefore, rapid, automated identification of the canthi regions within facial IR images may greatly facilitate rapid fever screening of asymptomatic travelers. However, it is more difficult to accurately identify the canthi regions from IR images than from visible images that are rich with exploitable features. In this study, we developed and evaluated techniques for multi-modality image registration (MMIR of simultaneously captured visible and IR facial images for fever screening. We used free form deformation (FFD models based on edge maps to improve registration accuracy after an affine transformation. Two widely used FFD models in medical image registration based on the Demons and cubic B-spline algorithms were qualitatively compared. The results showed that the Demons algorithm outperformed the cubic B-spline algorithm, likely due to overfitting of outliers by the latter method. The quantitative measure of registration accuracy, obtained through selected control point correspondence, was within 2.8 ± 1.2 mm, which enables accurate and automatic localization of canthi regions in the IR images for temperature measurement.

Optimization strategies for ultrasound volume registration

International Nuclear Information System (INIS)

Ijaz, Umer Zeeshan; Prager, Richard W; Gee, Andrew H; Treece, Graham M

2010-01-01

This paper considers registration of 3D ultrasound volumes acquired in multiple views for display in a single image volume. One way to acquire 3D data is to use a mechanically swept 3D probe. However, the usefulness of these probes is restricted by their limited field of view. This problem can be overcome by attaching a six-degree-of-freedom (DOF) position sensor to the probe, and displaying the information from multiple sweeps in their proper positions. However, an external six-DOF position sensor can be an inconvenience in a clinical setting. The objective of this paper is to propose a hybrid strategy that replaces the sensor with a combination of three-DOF image registration and an unobtrusive inertial sensor for measuring orientation. We examine a range of optimization algorithms and similarity measures for registration and compare them in in vitro and in vivo experiments. We register based on multiple reslice images rather than a whole voxel array. In this paper, we use a large number of reslices for improved reliability at the expense of computational speed. We have found that the Levenberg–Marquardt method is very fast but is not guaranteed to give the correct solution all the time. We conclude that normalized mutual information used in the Nelder–Mead simplex algorithm is potentially suitable for the registration task with an average execution time of around 5 min, in the majority of cases, with two restarts in a C++ implementation on a 3.0 GHz Intel Core 2 Duo CPU machine

Significantly reducing registration time in IGRT using graphics processing units

DEFF Research Database (Denmark)

Noe, Karsten Østergaard; Denis de Senneville, Baudouin; Tanderup, Kari

2008-01-01

respiration phases in a free breathing volunteer and 41 anatomical landmark points in each image series. The registration method used is a multi-resolution GPU implementation of the 3D Horn and Schunck algorithm. It is based on the CUDA framework from Nvidia. Results On an Intel Core 2 CPU at 2.4GHz each...... registration took 30 minutes. On an Nvidia Geforce 8800GTX GPU in the same machine this registration took 37 seconds, making the GPU version 48.7 times faster. The nine image series of different respiration phases were registered to the same reference image (full inhale). Accuracy was evaluated on landmark...

PARALLEL AND ADAPTIVE UNIFORM-DISTRIBUTED REGISTRATION METHOD FOR CHANG’E-1 LUNAR REMOTE SENSED IMAGERY

Directory of Open Access Journals (Sweden)

X. Ning

2012-08-01

To resolve the above-mentioned registration difficulties, a parallel and adaptive uniform-distributed registration method for CE-1 lunar remote sensed imagery is proposed in this paper. Based on 6 pairs of randomly selected images, both the standard SIFT algorithm and the parallel and adaptive uniform-distributed registration method were executed, the versatility and effectiveness were assessed. The experimental results indicate that: by applying the parallel and adaptive uniform-distributed registration method, the efficiency of CE-1 lunar remote sensed imagery registration were increased dramatically. Therefore, the proposed method in the paper could acquire uniform-distributed registration results more effectively, the registration difficulties including difficult to obtain results, time-consuming, non-uniform distribution could be successfully solved.

Assessment of Cultivar Distinctness in Alfalfa: A Comparison of Genotyping-by-Sequencing, Simple-Sequence Repeat Marker, and Morphophysiological Observations

Directory of Open Access Journals (Sweden)

Paolo Annicchiarico

2016-07-01

Full Text Available Cultivar registration agencies typically require morphophysiological trait-based distinctness of candidate cultivars. This requirement is difficult to achieve for cultivars of major perennial forages because of their genetic structure and ever-increasing number of registered material, leading to possible rejection of agronomically valuable cultivars. This study aimed to explore the value of molecular markers applied to replicated bulked plants (three bulks of 100 independent plants each per cultivar to assess alfalfa ( L. subsp. cultivar distinctness. We compared genotyping-by-sequencing information based on 2902 polymorphic single-nucleotide polymorphism (SNP markers (>30 reads per DNA sample with morphophysiological information based on 11 traits and with simple-sequence repeat (SSR marker information from 41 polymorphic markers for their ability to distinguish 11 alfalfa landraces representative of the germplasm from northern Italy. Three molecular criteria, one based on cultivar differences for individual SSR bands and two based on overall SNP marker variation assessed either by statistically significant cultivar differences on principal component axes or discriminant analysis, distinctly outperformed the morphophysiological criterion. Combining the morphophysiological criterion with either molecular marker method increased discrimination among cultivars, since morphophysiological diversity was unrelated to SSR marker-based diversity ( = 0.04 and poorly related to SNP marker-based diversity ( = 0.23, < 0.15. The criterion based on statistically significant SNP allele frequency differences was less discriminating than morphophysiological variation. Marker-based distinctness, which can be assessed at low cost and without interactions with testing conditions, could validly substitute for (or complement morphophysiological distinctness in alfalfa cultivar registration schemes. It also has interest in sui generis registration systems aimed at

Use of articulated registration for response assessment of individual metastatic bone lesions

International Nuclear Information System (INIS)

Yip, Stephen; Jeraj, Robert

2014-01-01

Accurate skeleton registration is necessary to match corresponding metastatic bone lesions for response assessment over multiple scans. In articulated registration (ART), whole-body skeletons are registered by auto-segmenting individual bones, then rigidly aligning them. Performance and robustness of the ART in lesion matching were evaluated and compared to other commonly used registration techniques. Sixteen prostate cancer patients were treated either with molecular targeted therapy or chemotherapy. Ten out of the 16 patients underwent the double baseline whole-body [F-18]NaF PET/CT scans for test-retest (TRT) evaluation. Twelve of the 16 patients underwent pre- and mid-treatment [F-18]NaF PET/CT scans. Skeletons at different time points were registered using ART, rigid, and deformable (DR) registration algorithms. The corresponding lesions were contoured and identified on successive PET images based on including the voxels with the standardized uptake value over 15. Each algorithm was evaluated for its ability to accurately align corresponding lesions via skeleton registration. A lesion matching score (MS) was measured for each lesion, which quantified the per cent overlap between the lesion's two corresponding contours. Three separate sensitivity studies were conducted to investigate the robustness of ART in matching: sensitivity of lesion matching to various contouring threshold levels, effects of imperfections in the bone auto-segmentation and sensitivity of mis-registration. The performance of ART (MS = 82% for both datasets, p ≪ 0.001) in lesion matching was significantly better than rigid (MS TRT  = 53%, MS Response  = 46%) and DR (MS TRT  = 46%, MS Response  = 45%) algorithms. Neither varying threshold levels for lesion contouring nor imperfect bone segmentation had significant (p∼0.10) impact on the ART matching performance as the MS remained unchanged. Despite the mis-registration reduced MS for ART, as low as 67% (p ≪ 0.001), the

Deformable Image Registration of Liver With Consideration of Lung Sliding Motion

International Nuclear Information System (INIS)

Xie, Yaoqin; Chao, Ming; Xiong, Guanglei

2011-01-01

Purpose: A feature based deformable registration model with sliding transformation was developed in the upper abdominal region for liver cancer. Methods: A two-step thin-plate spline (bi-TPS) algorithm was implemented to deformably register the liver organ. The first TPS registration was performed to exclusively quantify the sliding displacement component. A manual segmentation of the thoracic and abdominal cavity was performed as a priori knowledge. Tissue feature points were automatically identified inside the segmented contour on the images. The scale invariant feature transform method was utilized to match feature points that served as landmarks for the subsequent TPS registration to derive the sliding displacement vector field. To a good approximation, only motion along superior/inferior (SI) direction of voxels on each slice was averaged to obtain the sliding displacement for each slice. A second TPS transformation, as the last step, was carried out to obtain the local deformation field. Manual identification of bifurcation on liver, together with the manual segmentation of liver organ, was employed as a ''ground truth'' for assessing the algorithm's performance. Results: The proposed two-step TPS was assessed with six liver patients. The average error of liver bifurcation between manual identification and calculation for these patients was less than 1.8 mm. The residual errors between manual contour and propagated contour of liver organ using the algorithm fell in the range between 2.1 and 2.8 mm. An index of Dice similarity coefficient (DSC) between manual contour and calculated contour for liver tumor was 93.6% compared with 71.2% from the conventional TPS calculation. Conclusions: A high accuracy (∼2 mm) of the two-step feature based TPS registration algorithm was achievable for registering the liver organ. The discontinuous motion in the upper abdominal region was properly taken into consideration. Clinical implementation of the algorithm will find

Automatic vertebral identification using surface-based registration

Science.gov (United States)

Herring, Jeannette L.; Dawant, Benoit M.

2000-06-01

This work introduces an enhancement to currently existing methods of intra-operative vertebral registration by allowing the portion of the spinal column surface that correctly matches a set of physical vertebral points to be automatically selected from several possible choices. Automatic selection is made possible by the shape variations that exist among lumbar vertebrae. In our experiments, we register vertebral points representing physical space to spinal column surfaces extracted from computed tomography images. The vertebral points are taken from the posterior elements of a single vertebra to represent the region of surgical interest. The surface is extracted using an improved version of the fully automatic marching cubes algorithm, which results in a triangulated surface that contains multiple vertebrae. We find the correct portion of the surface by registering the set of physical points to multiple surface areas, including all vertebral surfaces that potentially match the physical point set. We then compute the standard deviation of the surface error for the set of points registered to each vertebral surface that is a possible match, and the registration that corresponds to the lowest standard deviation designates the correct match. We have performed our current experiments on two plastic spine phantoms and one patient.

Accuracy evaluation of initialization-free registration for intraoperative 3D-navigation

International Nuclear Information System (INIS)

Diakov, Georgi; Freysinger, Wolfgang

2007-01-01

Purpose An initialization-free approach for perioperative registration in functional endoscopic sinus surgery (FESS) is sought. The quality of surgical navigation relies on registration accuracy of preoperative images to the patient. Although landmark-based registration is fast, it is prone to human operator errors. This study evaluates the accuracy of two well-known methods for segmentation of the occipital bone from CT-images for use in surgical 3D-navigation. Method The occipital bone was segmented for registration without pre-defined correspondences, with the iterative closest point algorithm (ICP). The thresholding plus marching cubes segmentation (TMCS), and the deformable model segmentation (DMS) were compared quantitatively by overlaying the areas of the segmentations in cross-sectional slices, and visually by displaying the pointwise distances between the segmentations in a three-dimensional distance map relative to an expert manual segmentation, taken as a ''ground truth''. Results Excellent correspondence between the two methods was achieved; the results showed, however, that the TMCS is closer to the ''ground truth''. This is due to the sub-voxel accuracy of the marching cubes algorithm by definition, and the sensitivity of the DMS method to the choice of parameters. The DMS approach, as a gradient-based method, is insensitive to the thresholding initialization. For noisy images and soft tissue delineation a gradient-based method, like the deformable model, performs better. Both methods correspond within minute differences less than 4%. Conclusion These results will allow further minimization of human interaction in the planning phase for intraoperative 3D-navigation, by allowing to automatically create surface patches for registration purposes, ultimately allowing to build an initialization-free, fully automatic registration procedure for navigated Ear-, Nose-, Throat- (ENT) surgery. (orig.)

Fast multi-core based multimodal registration of 2D cross-sections and 3D datasets.

Science.gov (United States)

Scharfe, Michael; Pielot, Rainer; Schreiber, Falk

2010-01-11

Solving bioinformatics tasks often requires extensive computational power. Recent trends in processor architecture combine multiple cores into a single chip to improve overall performance. The Cell Broadband Engine (CBE), a heterogeneous multi-core processor, provides power-efficient and cost-effective high-performance computing. One application area is image analysis and visualisation, in particular registration of 2D cross-sections into 3D image datasets. Such techniques can be used to put different image modalities into spatial correspondence, for example, 2D images of histological cuts into morphological 3D frameworks. We evaluate the CBE-driven PlayStation 3 as a high performance, cost-effective computing platform by adapting a multimodal alignment procedure to several characteristic hardware properties. The optimisations are based on partitioning, vectorisation, branch reducing and loop unrolling techniques with special attention to 32-bit multiplies and limited local storage on the computing units. We show how a typical image analysis and visualisation problem, the multimodal registration of 2D cross-sections and 3D datasets, benefits from the multi-core based implementation of the alignment algorithm. We discuss several CBE-based optimisation methods and compare our results to standard solutions. More information and the source code are available from http://cbe.ipk-gatersleben.de. The results demonstrate that the CBE processor in a PlayStation 3 accelerates computational intensive multimodal registration, which is of great importance in biological/medical image processing. The PlayStation 3 as a low cost CBE-based platform offers an efficient option to conventional hardware to solve computational problems in image processing and bioinformatics.

Comparison of manual and automatic MR‐CT registration for radiotherapy of prostate cancer

Science.gov (United States)

Carl, Jesper; Østergaard, Lasse Riis

2016-01-01

In image‐guided radiotherapy (IGRT) of prostate cancer, delineation of the clinical target volume (CTV) often relies on magnetic resonance (MR) because of its good soft‐tissue visualization. Registration of MR and computed tomography (CT) is required in order to add this accurate delineation to the dose planning CT. An automatic approach for local MR‐CT registration of the prostate has previously been developed using a voxel property‐based registration as an alternative to a manual landmark‐based registration. The aim of this study is to compare the two registration approaches and to investigate the clinical potential for replacing the manual registration with the automatic registration. Registrations and analysis were performed for 30 prostate cancer patients treated with IGRT using a Ni‐Ti prostate stent as a fiducial marker. The comparison included computing translational and rotational differences between the approaches, visual inspection, and computing the overlap of the CTV. The computed mean translational difference was 1.65, 1.60, and 1.80 mm and the computed mean rotational difference was 1.51°, 3.93°, and 2.09° in the superior/inferior, anterior/posterior, and medial/lateral direction, respectively. The sensitivity of overlap was 87%. The results demonstrate that the automatic registration approach performs registrations comparable to the manual registration. PACS number(s): 87.57.nj, 87.61.‐c, 87.57.Q‐, 87.56.J‐ PMID:27167285

Monitoring tumor motion by real time 2D/3D registration during radiotherapy.

Science.gov (United States)

Gendrin, Christelle; Furtado, Hugo; Weber, Christoph; Bloch, Christoph; Figl, Michael; Pawiro, Supriyanto Ardjo; Bergmann, Helmar; Stock, Markus; Fichtinger, Gabor; Georg, Dietmar; Birkfellner, Wolfgang

2012-02-01

In this paper, we investigate the possibility to use X-ray based real time 2D/3D registration for non-invasive tumor motion monitoring during radiotherapy. The 2D/3D registration scheme is implemented using general purpose computation on graphics hardware (GPGPU) programming techniques and several algorithmic refinements in the registration process. Validation is conducted off-line using a phantom and five clinical patient data sets. The registration is performed on a region of interest (ROI) centered around the planned target volume (PTV). The phantom motion is measured with an rms error of 2.56 mm. For the patient data sets, a sinusoidal movement that clearly correlates to the breathing cycle is shown. Videos show a good match between X-ray and digitally reconstructed radiographs (DRR) displacement. Mean registration time is 0.5 s. We have demonstrated that real-time organ motion monitoring using image based markerless registration is feasible. Copyright © 2011 Elsevier Ireland Ltd. All rights reserved.

A framework for automatic creation of gold-standard rigid 3D-2D registration datasets.

Science.gov (United States)

Madan, Hennadii; Pernuš, Franjo; Likar, Boštjan; Špiclin, Žiga

2017-02-01

Advanced image-guided medical procedures incorporate 2D intra-interventional information into pre-interventional 3D image and plan of the procedure through 3D/2D image registration (32R). To enter clinical use, and even for publication purposes, novel and existing 32R methods have to be rigorously validated. The performance of a 32R method can be estimated by comparing it to an accurate reference or gold standard method (usually based on fiducial markers) on the same set of images (gold standard dataset). Objective validation and comparison of methods are possible only if evaluation methodology is standardized, and the gold standard  dataset is made publicly available. Currently, very few such datasets exist and only one contains images of multiple patients acquired during a procedure. To encourage the creation of gold standard 32R datasets, we propose an automatic framework. The framework is based on rigid registration of fiducial markers. The main novelty is spatial grouping of fiducial markers on the carrier device, which enables automatic marker localization and identification across the 3D and 2D images. The proposed framework was demonstrated on clinical angiograms of 20 patients. Rigid 32R computed by the framework was more accurate than that obtained manually, with the respective target registration error below 0.027 mm compared to 0.040 mm. The framework is applicable for gold standard setup on any rigid anatomy, provided that the acquired images contain spatially grouped fiducial markers. The gold standard datasets and software will be made publicly available.

An efficient strategy based on an individualized selection of registration methods. Application to the coregistration of MR and SPECT images in neuro-oncology

International Nuclear Information System (INIS)

Tacchella, Jean-Marc; Lefort, Muriel; Habert, Marie-Odile; Yeni, Nathanaëlle; Kas, Aurélie; Frouin, Frédérique; Roullot, Elodie; Cohen, Mike-Ely; Guillevin, Rémy; Petrirena, Grégorio; Delattre, Jean-Yves

2014-01-01

An efficient registration strategy is described that aims to help solve delicate medical imaging registration problems. It consists of running several registration methods for each dataset and selecting the best one for each specific dataset, according to an evaluation criterion. Finally, the quality of the registration results, obtained with the best method, is visually scored by an expert as excellent, correct or poor. The strategy was applied to coregister Technetium-99m Sestamibi SPECT and MRI data in the framework of a follow-up protocol in patients with high grade gliomas receiving antiangiogenic therapy. To adapt the strategy to this clinical context, a robust semi-automatic evaluation criterion based on the physiological uptake of the Sestamibi tracer was defined. A panel of eighteen multimodal registration algorithms issued from BrainVisa, SPM or AIR software environments was systematically applied to the clinical database composed of sixty-two datasets. According to the expert visual validation, this new strategy provides 85% excellent registrations, 12% correct ones and only 3% poor ones. These results compare favorably to the ones obtained by the globally most efficient registration method over the whole database, for which only 61% of excellent registration results have been reported. Thus the registration strategy in its current implementation proves to be suitable for clinical application. (paper)

Segmentation and registration duality from echographic images by use of physiological and morphological knowledge

International Nuclear Information System (INIS)

Ionescu, G.

1998-01-01

Echographic imaging could potentially play a major role in the field of Computer Assisted Surgery (CAS). For doctors and surgeons to make full use of tool in planning and executing surgical operations, they also need user-friendly automatic software based on fast, precise and reliable algorithms. The main goal of this thesis is to take advantage of the segmentation/registration duality to extract the relevant information from echo graphical images. This information will allow the precise and automatic registration both of anatomical structures contained in the pre-operative model and of per-operative data contained in echographic images. The result of registration will be further to guide a computer-assisted tool. In the first part we propose different methods for filtering, segmentation and calibration of echographic images. The development of fast, precise and reliable algorithms is emphasized. The second part concerns the segmentation-registration duality and the corrections of elastic deformations of soft tissues. High-level segmentation algorithms for echographic images were developed. They are based on results of low -level segmentation, a priori anatomical knowledge as well as on information provided by the pre-operative model. The third part deals with detailed descriptions of applications and interpretation of results. The cases studied include: screwing inside the vertebral pedicles, ilio-sacral screwing, prostatic radiotherapy and puncture of pericardial effusion. Future developments for this approach are discussed. (author)

Accelerated Deformable Registration of Repetitive MRI during Radiotherapy in Cervical Cancer

DEFF Research Database (Denmark)

Noe, Karsten Østergaard; Tanderup, Kari; Kiritsis, Christian

2006-01-01

Tumour regression and organ deformations during radiotherapy (RT) of cervical cancer represent major challenges regarding accurate conformation and calculation of dose when using image-guided adaptive radiotherapy. Deformable registration algorithms are able to handle organ deformations, which can...... be useful with advanced tools such as auto segmentation of organs and dynamic adaptation of radiotherapy. The aim of this study was to accelerate and validate deformable registration in MRI-based image-guided radiotherapy of cervical cancer.    ...

Skull registration for prone patient position using tracked ultrasound

Science.gov (United States)

Underwood, Grace; Ungi, Tamas; Baum, Zachary; Lasso, Andras; Kronreif, Gernot; Fichtinger, Gabor

2017-03-01

PURPOSE: Tracked navigation has become prevalent in neurosurgery. Problems with registration of a patient and a preoperative image arise when the patient is in a prone position. Surfaces accessible to optical tracking on the back of the head are unreliable for registration. We investigated the accuracy of surface-based registration using points accessible through tracked ultrasound. Using ultrasound allows access to bone surfaces that are not available through optical tracking. Tracked ultrasound could eliminate the need to work (i) under the table for registration and (ii) adjust the tracker between surgery and registration. In addition, tracked ultrasound could provide a non-invasive method in comparison to an alternative method of registration involving screw implantation. METHODS: A phantom study was performed to test the feasibility of tracked ultrasound for registration. An initial registration was performed to partially align the pre-operative computer tomography data and skull phantom. The initial registration was performed by an anatomical landmark registration. Surface points accessible by tracked ultrasound were collected and used to perform an Iterative Closest Point Algorithm. RESULTS: When the surface registration was compared to a ground truth landmark registration, the average TRE was found to be 1.6+/-0.1mm and the average distance of points off the skull surface was 0.6+/-0.1mm. CONCLUSION: The use of tracked ultrasound is feasible for registration of patients in prone position and eliminates the need to perform registration under the table. The translational component of error found was minimal. Therefore, the amount of TRE in registration is due to a rotational component of error.

Localization Based on Magnetic Markers for an All-Wheel Steering Vehicle

Directory of Open Access Journals (Sweden)

Yeun Sub Byun

2016-11-01

Full Text Available Real-time continuous localization is a key technology in the development of intelligent transportation systems. In these systems, it is very important to have accurate information about the position and heading angle of the vehicle at all times. The most widely implemented methods for positioning are the global positioning system (GPS, vision-based system, and magnetic marker system. Among these methods, the magnetic marker system is less vulnerable to indoor and outdoor environment conditions; moreover, it requires minimal maintenance expenses. In this paper, we present a position estimation scheme based on magnetic markers and odometry sensors for an all-wheel-steering vehicle. The heading angle of the vehicle is determined by using the position coordinates of the last two detected magnetic markers and odometer data. The instant position and heading angle of the vehicle are integrated with an extended Kalman filter to estimate the continuous position. GPS data with the real-time kinematics mode was obtained to evaluate the performance of the proposed position estimation system. The test results show that the performance of the proposed localization algorithm is accurate (mean error: 3 cm; max error: 9 cm and reliable under unexpected missing markers or incorrect markers.

A spatiotemporal-based scheme for efficient registration-based segmentation of thoracic 4-D MRI.

Science.gov (United States)

Yang, Y; Van Reeth, E; Poh, C L; Tan, C H; Tham, I W K

2014-05-01

Dynamic three-dimensional (3-D) (four-dimensional, 4-D) magnetic resonance (MR) imaging is gaining importance in the study of pulmonary motion for respiratory diseases and pulmonary tumor motion for radiotherapy. To perform quantitative analysis using 4-D MR images, segmentation of anatomical structures such as the lung and pulmonary tumor is required. Manual segmentation of entire thoracic 4-D MRI data that typically contains many 3-D volumes acquired over several breathing cycles is extremely tedious, time consuming, and suffers high user variability. This requires the development of new automated segmentation schemes for 4-D MRI data segmentation. Registration-based segmentation technique that uses automatic registration methods for segmentation has been shown to be an accurate method to segment structures for 4-D data series. However, directly applying registration-based segmentation to segment 4-D MRI series lacks efficiency. Here we propose an automated 4-D registration-based segmentation scheme that is based on spatiotemporal information for the segmentation of thoracic 4-D MR lung images. The proposed scheme saved up to 95% of computation amount while achieving comparable accurate segmentations compared to directly applying registration-based segmentation to 4-D dataset. The scheme facilitates rapid 3-D/4-D visualization of the lung and tumor motion and potentially the tracking of tumor during radiation delivery.

Active illumination based 3D surface reconstruction and registration for image guided medialization laryngoplasty

Science.gov (United States)

Jin, Ge; Lee, Sang-Joon; Hahn, James K.; Bielamowicz, Steven; Mittal, Rajat; Walsh, Raymond

2007-03-01

The medialization laryngoplasty is a surgical procedure to improve the voice function of the patient with vocal fold paresis and paralysis. An image guided system for the medialization laryngoplasty will help the surgeons to accurately place the implant and thus reduce the failure rates of the surgery. One of the fundamental challenges in image guided system is to accurately register the preoperative radiological data to the intraoperative anatomical structure of the patient. In this paper, we present a combined surface and fiducial based registration method to register the preoperative 3D CT data to the intraoperative surface of larynx. To accurately model the exposed surface area, a structured light based stereo vision technique is used for the surface reconstruction. We combined the gray code pattern and multi-line shifting to generate the intraoperative surface of the larynx. To register the point clouds from the intraoperative stage to the preoperative 3D CT data, a shape priori based ICP method is proposed to quickly register the two surfaces. The proposed approach is capable of tracking the fiducial markers and reconstructing the surface of larynx with no damage to the anatomical structure. We used off-the-shelf digital cameras, LCD projector and rapid 3D prototyper to develop our experimental system. The final RMS error in the registration is less than 1mm.

AN EVOLUTIONARY ALGORITHM FOR FAST INTENSITY BASED IMAGE MATCHING BETWEEN OPTICAL AND SAR SATELLITE IMAGERY

Directory of Open Access Journals (Sweden)

P. Fischer

2018-04-01

Full Text Available This paper presents a hybrid evolutionary algorithm for fast intensity based matching between satellite imagery from SAR and very high-resolution (VHR optical sensor systems. The precise and accurate co-registration of image time series and images of different sensors is a key task in multi-sensor image processing scenarios. The necessary preprocessing step of image matching and tie-point detection is divided into a search problem and a similarity measurement. Within this paper we evaluate the use of an evolutionary search strategy for establishing the spatial correspondence between satellite imagery of optical and radar sensors. The aim of the proposed algorithm is to decrease the computational costs during the search process by formulating the search as an optimization problem. Based upon the canonical evolutionary algorithm, the proposed algorithm is adapted for SAR/optical imagery intensity based matching. Extensions are drawn using techniques like hybridization (e.g. local search and others to lower the number of objective function calls and refine the result. The algorithm significantely decreases the computational costs whilst finding the optimal solution in a reliable way.

Interactive initialization of 2D/3D rigid registration

Energy Technology Data Exchange (ETDEWEB)

Gong, Ren Hui; Güler, Özgür [The Sheikh Zayed Institute for Pediatric Surgical Innovation, Children' s National Medical Center, Washington, DC 20010 (United States); Kürklüoglu, Mustafa [Department of Cardiac Surgery, Children' s National Medical Center, Washington, DC 20010 (United States); Lovejoy, John [Department of Orthopaedic Surgery and Sports Medicine, Children' s National Medical Center, Washington, DC 20010 (United States); Yaniv, Ziv, E-mail: ZYaniv@childrensnational.org [The Sheikh Zayed Institute for Pediatric Surgical Innovation, Children' s National Medical Center, Washington, DC 20010 and Departments of Pediatrics and Radiology, George Washington University, Washington, DC 20037 (United States)

2013-12-15

Purpose: Registration is one of the key technical components in an image-guided navigation system. A large number of 2D/3D registration algorithms have been previously proposed, but have not been able to transition into clinical practice. The authors identify the primary reason for the lack of adoption with the prerequisite for a sufficiently accurate initial transformation, mean target registration error of about 10 mm or less. In this paper, the authors present two interactive initialization approaches that provide the desired accuracy for x-ray/MR and x-ray/CT registration in the operating room setting. Methods: The authors have developed two interactive registration methods based on visual alignment of a preoperative image, MR, or CT to intraoperative x-rays. In the first approach, the operator uses a gesture based interface to align a volume rendering of the preoperative image to multiple x-rays. The second approach uses a tracked tool available as part of a navigation system. Preoperatively, a virtual replica of the tool is positioned next to the anatomical structures visible in the volumetric data. Intraoperatively, the physical tool is positioned in a similar manner and subsequently used to align a volume rendering to the x-ray images using an augmented reality (AR) approach. Both methods were assessed using three publicly available reference data sets for 2D/3D registration evaluation. Results: In the authors' experiments, the authors show that for x-ray/MR registration, the gesture based method resulted in a mean target registration error (mTRE) of 9.3 ± 5.0 mm with an average interaction time of 146.3 ± 73.0 s, and the AR-based method had mTREs of 7.2 ± 3.2 mm with interaction times of 44 ± 32 s. For x-ray/CT registration, the gesture based method resulted in a mTRE of 7.4 ± 5.0 mm with an average interaction time of 132.1 ± 66.4 s, and the AR-based method had mTREs of 8.3 ± 5.0 mm with interaction times of 58 ± 52 s. Conclusions: Based on

Interactive initialization of 2D/3D rigid registration

International Nuclear Information System (INIS)

Gong, Ren Hui; Güler, Özgür; Kürklüoglu, Mustafa; Lovejoy, John; Yaniv, Ziv

2013-01-01

Purpose: Registration is one of the key technical components in an image-guided navigation system. A large number of 2D/3D registration algorithms have been previously proposed, but have not been able to transition into clinical practice. The authors identify the primary reason for the lack of adoption with the prerequisite for a sufficiently accurate initial transformation, mean target registration error of about 10 mm or less. In this paper, the authors present two interactive initialization approaches that provide the desired accuracy for x-ray/MR and x-ray/CT registration in the operating room setting. Methods: The authors have developed two interactive registration methods based on visual alignment of a preoperative image, MR, or CT to intraoperative x-rays. In the first approach, the operator uses a gesture based interface to align a volume rendering of the preoperative image to multiple x-rays. The second approach uses a tracked tool available as part of a navigation system. Preoperatively, a virtual replica of the tool is positioned next to the anatomical structures visible in the volumetric data. Intraoperatively, the physical tool is positioned in a similar manner and subsequently used to align a volume rendering to the x-ray images using an augmented reality (AR) approach. Both methods were assessed using three publicly available reference data sets for 2D/3D registration evaluation. Results: In the authors' experiments, the authors show that for x-ray/MR registration, the gesture based method resulted in a mean target registration error (mTRE) of 9.3 ± 5.0 mm with an average interaction time of 146.3 ± 73.0 s, and the AR-based method had mTREs of 7.2 ± 3.2 mm with interaction times of 44 ± 32 s. For x-ray/CT registration, the gesture based method resulted in a mTRE of 7.4 ± 5.0 mm with an average interaction time of 132.1 ± 66.4 s, and the AR-based method had mTREs of 8.3 ± 5.0 mm with interaction times of 58 ± 52 s. Conclusions: Based on the

Unified voxel- and tensor-based morphometry (UVTBM) using registration confidence.

Science.gov (United States)

Khan, Ali R; Wang, Lei; Beg, Mirza Faisal

2015-01-01

Voxel-based morphometry (VBM) and tensor-based morphometry (TBM) both rely on spatial normalization to a template and yet have different requirements for the level of registration accuracy. VBM requires only global alignment of brain structures, with limited degrees of freedom in transformation, whereas TBM performs best when the registration is highly deformable and can achieve higher registration accuracy. In addition, the registration accuracy varies over the whole brain, with higher accuracy typically observed in subcortical areas and lower accuracy seen in cortical areas. Hence, even the determinant of Jacobian of registration maps is spatially varying in their accuracy, and combining these with VBM by direct multiplication introduces errors in VBM maps where the registration is inaccurate. We propose a unified approach to combining these 2 morphometry methods that is motivated by these differing requirements for registration and our interest in harnessing the advantages of both. Our novel method uses local estimates of registration confidence to determine how to weight the influence of VBM- and TBM-like approaches. Results are shown on healthy and mild Alzheimer's subjects (N = 150) investigating age and group differences, and potential of differential diagnosis is shown on a set of Alzheimer's disease (N = 34) and frontotemporal dementia (N = 30) patients compared against controls (N = 14). These show that the group differences detected by our proposed approach are more descriptive than those detected from VBM, Jacobian-modulated VBM, and TBM separately, hence leveraging the advantages of both approaches in a unified framework. Copyright © 2015 Elsevier Inc. All rights reserved.

Enhanced ICP for the Registration of Large-Scale 3D Environment Models: An Experimental Study

Directory of Open Access Journals (Sweden)

Jianda Han

2016-02-01

Full Text Available One of the main applications of mobile robots is the large-scale perception of the outdoor environment. One of the main challenges of this application is fusing environmental data obtained by multiple robots, especially heterogeneous robots. This paper proposes an enhanced iterative closest point (ICP method for the fast and accurate registration of 3D environmental models. First, a hierarchical searching scheme is combined with the octree-based ICP algorithm. Second, an early-warning mechanism is used to perceive the local minimum problem. Third, a heuristic escape scheme based on sampled potential transformation vectors is used to avoid local minima and achieve optimal registration. Experiments involving one unmanned aerial vehicle and one unmanned surface vehicle were conducted to verify the proposed technique. The experimental results were compared with those of normal ICP registration algorithms to demonstrate the superior performance of the proposed method.

A Review of Point-Wise Motion Tracking Algorithms for Fetal Magnetic Resonance Imaging.

Science.gov (United States)

Chikop, Shivaprasad; Koulagi, Girish; Kumbara, Ankita; Geethanath, Sairam

2016-01-01

We review recent feature-based tracking algorithms as applied to fetal magnetic resonance imaging (MRI). Motion in fetal MRI is an active and challenging area of research, but the challenge can be mitigated by strategies related to patient setup, acquisition, reconstruction, and image processing. We focus on fetal motion correction through methods based on tracking algorithms for registration of slices with similar anatomy in multiple volumes. We describe five motion detection algorithms based on corner detection and region-based methods through pseudocodes, illustrating the results of their application to fetal MRI. We compare the performance of these methods on the basis of error in registration and minimum number of feature points required for registration. Harris, a corner detection method, provides similar error when compared to the other methods and has the lowest number of feature points required at that error level. We do not discuss group-wise methods here. Finally, we attempt to communicate the application of available feature extraction methods to fetal MRI.

A ROBUST REGISTRATION ALGORITHM FOR POINT CLOUDS FROM UAV IMAGES FOR CHANGE DETECTION

Directory of Open Access Journals (Sweden)

A. Al-Rawabdeh

2016-06-01

Full Text Available Landslides are among the major threats to urban landscape and manmade infrastructure. They often cause economic losses, property damages, and loss of lives. Temporal monitoring data of landslides from different epochs empowers the evaluation of landslide progression. Alignment of overlapping surfaces from two or more epochs is crucial for the proper analysis of landslide dynamics. The traditional methods for point-cloud-based landslide monitoring rely on using a variation of the Iterative Closest Point (ICP registration procedure to align any reconstructed surfaces from different epochs to a common reference frame. However, sometimes the ICP-based registration can fail or may not provide sufficient accuracy. For example, point clouds from different epochs might fit to local minima due to lack of geometrical variability within the data. Also, manual interaction is required to exclude any non-stable areas from the registration process. In this paper, a robust image-based registration method is introduced for the simultaneous evaluation of all registration parameters. This includes the Interior Orientation Parameters (IOPs of the camera and the Exterior Orientation Parameters (EOPs of the involved images from all available observation epochs via a bundle block adjustment with self-calibration. Next, a semi-global dense matching technique is implemented to generate dense 3D point clouds for each epoch using the images captured in a particular epoch separately. The normal distances between any two consecutive point clouds can then be readily computed, because the point clouds are already effectively co-registered. A low-cost DJI Phantom II Unmanned Aerial Vehicle (UAV was customised and used in this research for temporal data collection over an active soil creep area in Lethbridge, Alberta, Canada. The customisation included adding a GPS logger and a Large-Field-Of-View (LFOV action camera which facilitated capturing high-resolution geo-tagged images

a Robust Registration Algorithm for Point Clouds from Uav Images for Change Detection

Science.gov (United States)

Al-Rawabdeh, A.; Al-Gurrani, H.; Al-Durgham, K.; Detchev, I.; He, F.; El-Sheimy, N.; Habib, A.

2016-06-01

Landslides are among the major threats to urban landscape and manmade infrastructure. They often cause economic losses, property damages, and loss of lives. Temporal monitoring data of landslides from different epochs empowers the evaluation of landslide progression. Alignment of overlapping surfaces from two or more epochs is crucial for the proper analysis of landslide dynamics. The traditional methods for point-cloud-based landslide monitoring rely on using a variation of the Iterative Closest Point (ICP) registration procedure to align any reconstructed surfaces from different epochs to a common reference frame. However, sometimes the ICP-based registration can fail or may not provide sufficient accuracy. For example, point clouds from different epochs might fit to local minima due to lack of geometrical variability within the data. Also, manual interaction is required to exclude any non-stable areas from the registration process. In this paper, a robust image-based registration method is introduced for the simultaneous evaluation of all registration parameters. This includes the Interior Orientation Parameters (IOPs) of the camera and the Exterior Orientation Parameters (EOPs) of the involved images from all available observation epochs via a bundle block adjustment with self-calibration. Next, a semi-global dense matching technique is implemented to generate dense 3D point clouds for each epoch using the images captured in a particular epoch separately. The normal distances between any two consecutive point clouds can then be readily computed, because the point clouds are already effectively co-registered. A low-cost DJI Phantom II Unmanned Aerial Vehicle (UAV) was customised and used in this research for temporal data collection over an active soil creep area in Lethbridge, Alberta, Canada. The customisation included adding a GPS logger and a Large-Field-Of-View (LFOV) action camera which facilitated capturing high-resolution geo-tagged images in two epochs

GPU-based stochastic-gradient optimization for non-rigid medical image registration in time-critical applications

NARCIS (Netherlands)

Staring, M.; Al-Ars, Z.; Berendsen, Floris; Angelini, Elsa D.; Landman, Bennett A.

2018-01-01

Currently, non-rigid image registration algorithms are too computationally intensive to use in time-critical applications. Existing implementations that focus on speed typically address this by either parallelization on GPU-hardware, or by introducing methodically novel techniques into

Influence of the number of elongated fiducial markers on the localization accuracy of the prostate

Science.gov (United States)

de Boer, Johan; de Bois, Josien; van Herk, Marcel; Sonke, Jan-Jakob

2012-10-01

Implanting fiducial markers for localization purposes has become an accepted practice in radiotherapy for prostate cancer. While many correction strategies correct for translations only, advanced correction protocols also require knowledge of the rotation of the prostate. For this purpose, typically, three or more markers are implanted. Elongated fiducial markers provide more information about their orientation than traditional round or cylindrical markers. Potentially, fewer markers are required. In this study, we evaluate the effect of the number of elongated markers on the localization accuracy of the prostate. To quantify the localization error, we developed a model that estimates, at arbitrary locations in the prostate, the registration error caused by translational and rotational uncertainties of the marker registration. Every combination of one, two and three markers was analysed for a group of 24 patients. The average registration errors at the prostate surface were 0.3-0.8 mm and 0.4-1 mm for registrations on, respectively, three markers and two markers located on different sides of the prostate. Substantial registration errors (2.0-2.2 mm) occurred at the prostate surface contralateral to the markers when two markers were implanted on the same side of the prostate or only one marker was used. In conclusion, there is no benefit in using three elongated markers: two markers accurately localize the prostate if they are implanted at some distance from each other.

Dosimetric implications of inter- and intrafractional prostate positioning errors during tomotherapy : Comparison of gold marker-based registrations with native MVCT.

Science.gov (United States)

Wust, Peter; Joswig, Marc; Graf, Reinhold; Böhmer, Dirk; Beck, Marcus; Barelkowski, Thomasz; Budach, Volker; Ghadjar, Pirus

2017-09-01

For high-dose radiation therapy (RT) of prostate cancer, image-guided (IGRT) and intensity-modulated RT (IMRT) approaches are standard. Less is known regarding comparisons of different IGRT techniques and the resulting residual errors, as well as regarding their influences on dose distributions. A total of 58 patients who received tomotherapy-based RT up to 84 Gy for high-risk prostate cancer underwent IGRT based either on daily megavoltage CT (MVCT) alone (n = 43) or the additional use of gold markers (n = 15) under routine conditions. Planned Adaptive (Accuray Inc., Madison, WI, USA) software was used for elaborated offline analysis to quantify residual interfractional prostate positioning errors, along with systematic and random errors and the resulting safety margins after both IGRT approaches. Dosimetric parameters for clinical target volume (CTV) coverage and exposition of organs at risk (OAR) were also analyzed and compared. Interfractional as well as intrafractional displacements were determined. Particularly in the vertical direction, residual interfractional positioning errors were reduced using the gold marker-based approach, but dosimetric differences were moderate and the clinical relevance relatively small. Intrafractional prostate motion proved to be quite high, with displacements of 1-3 mm; however, these did not result in additional dosimetric impairments. Residual interfractional positioning errors were reduced using gold marker-based IGRT; however, this resulted in only slightly different final dose distributions. Therefore, daily MVCT-based IGRT without markers might be a valid alternative.

Tailoring four-dimensional cone-beam CT acquisition settings for fiducial marker-based image guidance in radiation therapy.

Science.gov (United States)

Jin, Peng; van Wieringen, Niek; Hulshof, Maarten C C M; Bel, Arjan; Alderliesten, Tanja

2018-04-01

Use of four-dimensional cone-beam CT (4D-CBCT) and fiducial markers for image guidance during radiation therapy (RT) of mobile tumors is challenging due to the trade-off among image quality, imaging dose, and scanning time. This study aimed to investigate different 4D-CBCT acquisition settings for good visibility of fiducial markers in 4D-CBCT. Using these 4D-CBCTs, the feasibility of marker-based 4D registration for RT setup verification and manual respiration-induced motion quantification was investigated. For this, we applied a dynamic phantom with three different breathing motion amplitudes and included two patients with implanted markers. Irrespective of the motion amplitude, for a medium field of view (FOV), marker visibility was improved by reducing the imaging dose per projection and increasing the number of projection images; however, the scanning time was 4 to 8 min. For a small FOV, the total imaging dose and the scanning time were reduced (62.5% of the dose using a medium FOV, 2.5 min) without losing marker visibility. However, the body contour could be missing for a small FOV, which is not preferred in RT. The marker-based 4D setup verification was feasible for both the phantom and patient data. Moreover, manual marker motion quantification can achieve a high accuracy with a mean error of [Formula: see text].

An Advanced Rotation Invariant Descriptor for SAR Image Registration

Directory of Open Access Journals (Sweden)

Yuming Xiang

2017-07-01

Full Text Available The Scale-Invariant Feature Transform (SIFT algorithm and its many variants have been widely used in Synthetic Aperture Radar (SAR image registration. The SIFT-like algorithms maintain rotation invariance by assigning a dominant orientation for each keypoint, while the calculation of dominant orientation is not robust due to the effect of speckle noise in SAR imagery. In this paper, we propose an advanced local descriptor for SAR image registration to achieve rotation invariance without assigning a dominant orientation. Based on the improved intensity orders, we first divide a circular neighborhood into several sub-regions. Second, rotation-invariant ratio orientation histograms of each sub-region are proposed by accumulating the ratio values of different directions in a rotation-invariant coordinate system. The proposed descriptor is composed of the concatenation of the histograms of each sub-region. In order to increase the distinctiveness of the proposed descriptor, multiple image neighborhoods are aggregated. Experimental results on several satellite SAR images have shown an improvement in the matching performance over other state-of-the-art algorithms.

Registration of pencil beam proton radiography data with X-ray CT.

Science.gov (United States)

Deffet, Sylvain; Macq, Benoît; Righetto, Roberto; Vander Stappen, François; Farace, Paolo

2017-10-01

Proton radiography seems to be a promising tool for assessing the quality of the stopping power computation in proton therapy. However, range error maps obtained on the basis of proton radiographs are very sensitive to small misalignment between the planning CT and the proton radiography acquisitions. In order to be able to mitigate misalignment in postprocessing, the authors implemented a fast method for registration between pencil proton radiography data obtained with a multilayer ionization chamber (MLIC) and an X-ray CT acquired on a head phantom. The registration was performed by optimizing a cost function which performs a comparison between the acquired data and simulated integral depth-dose curves. Two methodologies were considered, one based on dual orthogonal projections and the other one on a single projection. For each methodology, the robustness of the registration algorithm with respect to three confounding factors (measurement noise, CT calibration errors, and spot spacing) was investigated by testing the accuracy of the method through simulations based on a CT scan of a head phantom. The present registration method showed robust convergence towards the optimal solution. For the level of measurement noise and the uncertainty in the stopping power computation expected in proton radiography using a MLIC, the accuracy appeared to be better than 0.3° for angles and 0.3 mm for translations by use of the appropriate cost function. The spot spacing analysis showed that a spacing larger than the 5 mm used by other authors for the investigation of a MLIC for proton radiography led to results with absolute accuracy better than 0.3° for angles and 1 mm for translations when orthogonal proton radiographs were fed into the algorithm. In the case of a single projection, 6 mm was the largest spot spacing presenting an acceptable registration accuracy. For registration of proton radiography data with X-ray CT, the use of a direct ray-tracing algorithm to compute

Implementation of Fiducial-Based Image Registration in the Cyberknife Robotic System

International Nuclear Information System (INIS)

Saw, Cheng B.; Chen Hungcheng; Wagner, Henry

2008-01-01

Fiducial-based image registration methodology as implemented in the Cyberknife system is explored. The Cyberknife is a radiosurgery system that uses image guidance technology and computer-controlled robotics to determine target positions and adjust beam directions accordingly during the dose delivery. The image guidance system consists of 2 x-ray sources mounted on the ceiling and a detection system mounted on both sides of the treatment couch. Two orthogonal live radiographs are taken prior to and during patient treatment. Fiducial markers are identified on these radiographs and compared to a library of digital reconstructed radiographs (DRRs) using the fiducial extraction software. The fiducial extraction software initially sets an intensity threshold on the live radiographs to generate white areas on black images referred to as 'blobs.' Different threshold values are being used and blobs at the same location are assumed to originate from the same object. The number of blobs is then reduced by examining each blob against a predefined set of properties such as shape and exposure levels. The remaining blobs are further reduced by examining the location of the blobs in the inferior-superior patient axis. Those blobs that have the corresponding positions are assumed to originate from the same object. The remaining blobs are used to create fiducial configurations and are compared to the reference configuration from the computed tomography (CT) image dataset for treatment planning. The best-fit configuration is considered to have the appropriate fiducial markers. The patient position is determined based on these fiducial markers. During the treatment, the radiation beam is turned off when the Cyberknife changes nodes. This allows a time window to acquire live radiographs for the determination of the patient target position and to update the robotic manipulator to change beam orientations accordingly

Iterative h-minima-based marker-controlled watershed for cell nucleus segmentation.

Science.gov (United States)

Koyuncu, Can Fahrettin; Akhan, Ece; Ersahin, Tulin; Cetin-Atalay, Rengul; Gunduz-Demir, Cigdem

2016-04-01

Automated microscopy imaging systems facilitate high-throughput screening in molecular cellular biology research. The first step of these systems is cell nucleus segmentation, which has a great impact on the success of the overall system. The marker-controlled watershed is a technique commonly used by the previous studies for nucleus segmentation. These studies define their markers finding regional minima on the intensity/gradient and/or distance transform maps. They typically use the h-minima transform beforehand to suppress noise on these maps. The selection of the h value is critical; unnecessarily small values do not sufficiently suppress the noise, resulting in false and oversegmented markers, and unnecessarily large ones suppress too many pixels, causing missing and undersegmented markers. Because cell nuclei show different characteristics within an image, the same h value may not work to define correct markers for all the nuclei. To address this issue, in this work, we propose a new watershed algorithm that iteratively identifies its markers, considering a set of different h values. In each iteration, the proposed algorithm defines a set of candidates using a particular h value and selects the markers from those candidates provided that they fulfill the size requirement. Working with widefield fluorescence microscopy images, our experiments reveal that the use of multiple h values in our iterative algorithm leads to better segmentation results, compared to its counterparts. © 2016 International Society for Advancement of Cytometry. © 2016 International Society for Advancement of Cytometry.

Deformable image registration for image guided prostate radiotherapy

International Nuclear Information System (INIS)

Cassetta, Roberto; Riboldi, Marco; Baroni, Guido; Leandro, Kleber; Novaes, Paulo Eduardo; Goncalves, Vinicius; Sakuraba, Roberto; Fattori, Giovanni

2016-01-01

In this study, we present a CT to CBCT deformable registration method based on the ITK library. An algorithm was developed in order to explore the soft tissue information of the CT-CBCT images to perform deformable image registration (DIR), making efforts to overcome the poor signal-to-noise ratio and HU calibration issues that limits CBCT use for treatment planning purposes. Warped CT images and contours were generated and their impact in adaptive radiotherapy was evaluated by DVH analysis for photon and proton treatments. Considerable discrepancies, related to the treatment planning dose distribution, might be found due to changes in patient’s anatomy. (author)

Multi-band Image Registration Method Based on Fourier Transform

Institute of Scientific and Technical Information of China (English)

庹红娅; 刘允才

2004-01-01

This paper presented a registration method based on Fourier transform for multi-band images which is involved in translation and small rotation. Although different band images differ a lot in the intensity and features,they contain certain common information which we can exploit. A model was given that the multi-band images have linear correlations under the least-square sense. It is proved that the coefficients have no effect on the registration progress if two images have linear correlations. Finally, the steps of the registration method were proposed. The experiments show that the model is reasonable and the results are satisfying.

Algorithm for personal identification in distance learning system based on registration of keyboard rhythm

Science.gov (United States)

Nikitin, P. V.; Savinov, A. N.; Bazhenov, R. I.; Sivandaev, S. V.

2018-05-01

The article describes the method of identifying a person in distance learning systems based on a keyboard rhythm. An algorithm for the organization of access control is proposed, which implements authentication, identification and verification of a person using the keyboard rhythm. Authentication methods based on biometric personal parameters, including those based on the keyboard rhythm, due to the inexistence of biometric characteristics without a particular person, are able to provide an advanced accuracy and inability to refuse authorship and convenience for operators of automated systems, in comparison with other methods of conformity checking. Methods of permanent hidden keyboard monitoring allow detecting the substitution of a student and blocking the key system.

Fast multi-core based multimodal registration of 2D cross-sections and 3D datasets

Directory of Open Access Journals (Sweden)

Pielot Rainer

2010-01-01

Full Text Available Abstract Background Solving bioinformatics tasks often requires extensive computational power. Recent trends in processor architecture combine multiple cores into a single chip to improve overall performance. The Cell Broadband Engine (CBE, a heterogeneous multi-core processor, provides power-efficient and cost-effective high-performance computing. One application area is image analysis and visualisation, in particular registration of 2D cross-sections into 3D image datasets. Such techniques can be used to put different image modalities into spatial correspondence, for example, 2D images of histological cuts into morphological 3D frameworks. Results We evaluate the CBE-driven PlayStation 3 as a high performance, cost-effective computing platform by adapting a multimodal alignment procedure to several characteristic hardware properties. The optimisations are based on partitioning, vectorisation, branch reducing and loop unrolling techniques with special attention to 32-bit multiplies and limited local storage on the computing units. We show how a typical image analysis and visualisation problem, the multimodal registration of 2D cross-sections and 3D datasets, benefits from the multi-core based implementation of the alignment algorithm. We discuss several CBE-based optimisation methods and compare our results to standard solutions. More information and the source code are available from http://cbe.ipk-gatersleben.de. Conclusions The results demonstrate that the CBE processor in a PlayStation 3 accelerates computational intensive multimodal registration, which is of great importance in biological/medical image processing. The PlayStation 3 as a low cost CBE-based platform offers an efficient option to conventional hardware to solve computational problems in image processing and bioinformatics.

WE-H-202-04: Advanced Medical Image Registration Techniques

International Nuclear Information System (INIS)

Christensen, G.

2016-01-01

Deformable image registration has now been commercially available for several years, with solid performance in a number of sites and for several applications including contour and dose mapping. However, more complex applications have arisen, such as assessing response to radiation therapy over time, registering images pre- and post-surgery, and auto-segmentation from atlases. These applications require innovative registration algorithms to achieve accurate alignment. The goal of this session is to highlight emerging registration technology and these new applications. The state of the art in image registration will be presented from an engineering perspective. Translational clinical applications will also be discussed to tie these new registration approaches together with imaging and radiation therapy applications in specific diseases such as cervical and lung cancers. Learning Objectives: To understand developing techniques and algorithms in deformable image registration that are likely to translate into clinical tools in the near future. To understand emerging imaging and radiation therapy clinical applications that require such new registration algorithms. Research supported in part by the National Institutes of Health under award numbers P01CA059827, R01CA166119, and R01CA166703. Disclosures: Phillips Medical systems (Hugo), Roger Koch (Christensen) support, Varian Medical Systems (Brock), licensing agreements from Raysearch (Brock) and Varian (Hugo).; K. Brock, Licensing Agreement - RaySearch Laboratories. Research Funding - Varian Medical Systems; G. Hugo, Research grant from National Institutes of Health, award number R01CA166119.; G. Christensen, Research support from NIH grants CA166119 and CA166703 and a gift from Roger Koch. There are no conflicts of interest.

WE-H-202-04: Advanced Medical Image Registration Techniques

Energy Technology Data Exchange (ETDEWEB)

Christensen, G. [University of Iowa (United States)

2016-06-15

Deformable image registration has now been commercially available for several years, with solid performance in a number of sites and for several applications including contour and dose mapping. However, more complex applications have arisen, such as assessing response to radiation therapy over time, registering images pre- and post-surgery, and auto-segmentation from atlases. These applications require innovative registration algorithms to achieve accurate alignment. The goal of this session is to highlight emerging registration technology and these new applications. The state of the art in image registration will be presented from an engineering perspective. Translational clinical applications will also be discussed to tie these new registration approaches together with imaging and radiation therapy applications in specific diseases such as cervical and lung cancers. Learning Objectives: To understand developing techniques and algorithms in deformable image registration that are likely to translate into clinical tools in the near future. To understand emerging imaging and radiation therapy clinical applications that require such new registration algorithms. Research supported in part by the National Institutes of Health under award numbers P01CA059827, R01CA166119, and R01CA166703. Disclosures: Phillips Medical systems (Hugo), Roger Koch (Christensen) support, Varian Medical Systems (Brock), licensing agreements from Raysearch (Brock) and Varian (Hugo).; K. Brock, Licensing Agreement - RaySearch Laboratories. Research Funding - Varian Medical Systems; G. Hugo, Research grant from National Institutes of Health, award number R01CA166119.; G. Christensen, Research support from NIH grants CA166119 and CA166703 and a gift from Roger Koch. There are no conflicts of interest.

2D-3D rigid registration to compensate for prostate motion during 3D TRUS-guided biopsy.

Science.gov (United States)

De Silva, Tharindu; Fenster, Aaron; Cool, Derek W; Gardi, Lori; Romagnoli, Cesare; Samarabandu, Jagath; Ward, Aaron D

2013-02-01

Three-dimensional (3D) transrectal ultrasound (TRUS)-guided systems have been developed to improve targeting accuracy during prostate biopsy. However, prostate motion during the procedure is a potential source of error that can cause target misalignments. The authors present an image-based registration technique to compensate for prostate motion by registering the live two-dimensional (2D) TRUS images acquired during the biopsy procedure to a preacquired 3D TRUS image. The registration must be performed both accurately and quickly in order to be useful during the clinical procedure. The authors implemented an intensity-based 2D-3D rigid registration algorithm optimizing the normalized cross-correlation (NCC) metric using Powell's method. The 2D TRUS images acquired during the procedure prior to biopsy gun firing were registered to the baseline 3D TRUS image acquired at the beginning of the procedure. The accuracy was measured by calculating the target registration error (TRE) using manually identified fiducials within the prostate; these fiducials were used for validation only and were not provided as inputs to the registration algorithm. They also evaluated the accuracy when the registrations were performed continuously throughout the biopsy by acquiring and registering live 2D TRUS images every second. This measured the improvement in accuracy resulting from performing the registration, continuously compensating for motion during the procedure. To further validate the method using a more challenging data set, registrations were performed using 3D TRUS images acquired by intentionally exerting different levels of ultrasound probe pressures in order to measure the performance of our algorithm when the prostate tissue was intentionally deformed. In this data set, biopsy scenarios were simulated by extracting 2D frames from the 3D TRUS images and registering them to the baseline 3D image. A graphics processing unit (GPU)-based implementation was used to improve the

SU-E-J-109: Evaluation of Deformable Accumulated Parotid Doses Using Different Registration Algorithms in Adaptive Head and Neck Radiotherapy

Energy Technology Data Exchange (ETDEWEB)

Xu, S [Key Laboratory of Particle & Radiation Imaging (Tsinghua University), Ministry of Education, Beijing, 100084 China (China); Chinese PLA General Hospital, Beijing, 100853 China (China); Liu, B [Image processing center, Beihang University, Beijing, 100191 China (China)

2015-06-15

Purpose: Three deformable image registration (DIR) algorithms are utilized to perform deformable dose accumulation for head and neck tomotherapy treatment, and the differences of the accumulated doses are evaluated. Methods: Daily MVCT data for 10 patients with pathologically proven nasopharyngeal cancers were analyzed. The data were acquired using tomotherapy (TomoTherapy, Accuray) at the PLA General Hospital. The prescription dose to the primary target was 70Gy in 33 fractions.Three DIR methods (B-spline, Diffeomorphic Demons and MIMvista) were used to propagate parotid structures from planning CTs to the daily CTs and accumulate fractionated dose on the planning CTs. The mean accumulated doses of parotids were quantitatively compared and the uncertainties of the propagated parotid contours were evaluated using Dice similarity index (DSI). Results: The planned mean dose of the ipsilateral parotids (32.42±3.13Gy) was slightly higher than those of the contralateral parotids (31.38±3.19Gy)in 10 patients. The difference between the accumulated mean doses of the ipsilateral parotids in the B-spline, Demons and MIMvista deformation algorithms (36.40±5.78Gy, 34.08±6.72Gy and 33.72±2.63Gy ) were statistically significant (B-spline vs Demons, P<0.0001, B-spline vs MIMvista, p =0.002). And The difference between those of the contralateral parotids in the B-spline, Demons and MIMvista deformation algorithms (34.08±4.82Gy, 32.42±4.80Gy and 33.92±4.65Gy ) were also significant (B-spline vs Demons, p =0.009, B-spline vs MIMvista, p =0.074). For the DSI analysis, the scores of B-spline, Demons and MIMvista DIRs were 0.90, 0.89 and 0.76. Conclusion: Shrinkage of parotid volumes results in the dose increase to the parotid glands in adaptive head and neck radiotherapy. The accumulated doses of parotids show significant difference using the different DIR algorithms between kVCT and MVCT. Therefore, the volume-based criterion (i.e. DSI) as a quantitative evaluation of

A dental implant-based registration method for measuring mandibular kinematics using cone beam computed tomography-based fluoroscopy.

Science.gov (United States)

Lin, Cheng-Chung; Chen, Chien-Chih; Chen, Yunn-Jy; Lu, Tung-Wu; Hong, Shih-Wun

2014-01-01

This study aimed to develop and evaluate experimentally an implant-based registration method for measuring three-dimensional (3D) kinematics of the mandible and dental implants in the mandible based on dental cone beam computed tomography (CBCT), modified to include fluoroscopic function. The proposed implant-based registration method was based on the registration of CBCT data of implants/bones with single-plane fluoroscopy images. Seven registration conditions that included one to three implants were evaluated experimentally for their performance in a cadaveric porcine headmodel. The implant-based registration method was shown to have measurement errors (SD) of less than -0.2 (0.3) mm, 1.1 (2.2) mm, and 0.7 degrees (1.3 degrees) for the in-plane translation, out-of-plane translation, and all angular components, respectively, regardless of the number of implants used. The corresponding errors were reduced to less than -0.1 (0.1) mm, -0.3 (1.7) mm, and 0.5 degree (0.4 degree) when three implants were used. An implant-based registration method was developed to measure the 3D kinematics of the mandible/implants. With its high accuracy and reliability, the new method will be useful for measuring the 3D motion of the bones/implants for relevant applications.

Feasibility of Multimodal Deformable Registration for Head and Neck Tumor Treatment Planning

Energy Technology Data Exchange (ETDEWEB)

Fortunati, Valerio, E-mail: v.fortunati@erasmusmc.nl [Biomedical Imaging Group Rotterdam, Department of Medical Informatics and Radiology, Erasmus MC University Medical Center, Rotterdam (Netherlands); Verhaart, René F. [Hyperthermia Unit, Department of Radiation Oncology, Erasmus MC University Medical Center Cancer Institute, Rotterdam (Netherlands); Angeloni, Francesco [Istituto di Ricovero e Cura a Carattere Scientifico Foundation SDN for Research and High Education in Nuclear Diagnostics, Naples (Italy); Lugt, Aad van der [Department of Radiology, Erasmus MC University Medical Center, Rotterdam (Netherlands); Niessen, Wiro J. [Biomedical Imaging Group Rotterdam, Department of Medical Informatics and Radiology, Erasmus MC University Medical Center, Rotterdam (Netherlands); Faculty of Applied Sciences, Delft University of Technology, Delft (Netherlands); Veenland, Jifke F. [Biomedical Imaging Group Rotterdam, Department of Medical Informatics and Radiology, Erasmus MC University Medical Center, Rotterdam (Netherlands); Paulides, Margarethus M. [Hyperthermia Unit, Department of Radiation Oncology, Erasmus MC University Medical Center Cancer Institute, Rotterdam (Netherlands); Walsum, Theo van [Biomedical Imaging Group Rotterdam, Department of Medical Informatics and Radiology, Erasmus MC University Medical Center, Rotterdam (Netherlands)

2014-09-01

Purpose: To investigate the feasibility of using deformable registration in clinical practice to fuse MR and CT images of the head and neck for treatment planning. Method and Materials: A state-of-the-art deformable registration algorithm was optimized, evaluated, and compared with rigid registration. The evaluation was based on manually annotated anatomic landmarks and regions of interest in both modalities. We also developed a multiparametric registration approach, which simultaneously aligns T1- and T2-weighted MR sequences to CT. This was evaluated and compared with single-parametric approaches. Results: Our results show that deformable registration yielded a better accuracy than rigid registration, without introducing unrealistic deformations. For deformable registration, an average landmark alignment of approximatively 1.7 mm was obtained. For all the regions of interest excluding the cerebellum and the parotids, deformable registration provided a median modified Hausdorff distance of approximatively 1 mm. Similar accuracies were obtained for the single-parameter and multiparameter approaches. Conclusions: This study demonstrates that deformable registration of head-and-neck CT and MR images is feasible, with overall a significanlty higher accuracy than for rigid registration.

Feasibility of Multimodal Deformable Registration for Head and Neck Tumor Treatment Planning

International Nuclear Information System (INIS)

Fortunati, Valerio; Verhaart, René F.; Angeloni, Francesco; Lugt, Aad van der; Niessen, Wiro J.; Veenland, Jifke F.; Paulides, Margarethus M.; Walsum, Theo van

2014-01-01

Purpose: To investigate the feasibility of using deformable registration in clinical practice to fuse MR and CT images of the head and neck for treatment planning. Method and Materials: A state-of-the-art deformable registration algorithm was optimized, evaluated, and compared with rigid registration. The evaluation was based on manually annotated anatomic landmarks and regions of interest in both modalities. We also developed a multiparametric registration approach, which simultaneously aligns T1- and T2-weighted MR sequences to CT. This was evaluated and compared with single-parametric approaches. Results: Our results show that deformable registration yielded a better accuracy than rigid registration, without introducing unrealistic deformations. For deformable registration, an average landmark alignment of approximatively 1.7 mm was obtained. For all the regions of interest excluding the cerebellum and the parotids, deformable registration provided a median modified Hausdorff distance of approximatively 1 mm. Similar accuracies were obtained for the single-parameter and multiparameter approaches. Conclusions: This study demonstrates that deformable registration of head-and-neck CT and MR images is feasible, with overall a significanlty higher accuracy than for rigid registration

Influence of the number of elongated fiducial markers on the localization accuracy of the prostate

International Nuclear Information System (INIS)

De Boer, Johan; De Bois, Josien; Van Herk, Marcel; Sonke, Jan-Jakob

2012-01-01

Implanting fiducial markers for localization purposes has become an accepted practice in radiotherapy for prostate cancer. While many correction strategies correct for translations only, advanced correction protocols also require knowledge of the rotation of the prostate. For this purpose, typically, three or more markers are implanted. Elongated fiducial markers provide more information about their orientation than traditional round or cylindrical markers. Potentially, fewer markers are required. In this study, we evaluate the effect of the number of elongated markers on the localization accuracy of the prostate. To quantify the localization error, we developed a model that estimates, at arbitrary locations in the prostate, the registration error caused by translational and rotational uncertainties of the marker registration. Every combination of one, two and three markers was analysed for a group of 24 patients. The average registration errors at the prostate surface were 0.3–0.8 mm and 0.4–1 mm for registrations on, respectively, three markers and two markers located on different sides of the prostate. Substantial registration errors (2.0–2.2 mm) occurred at the prostate surface contralateral to the markers when two markers were implanted on the same side of the prostate or only one marker was used. In conclusion, there is no benefit in using three elongated markers: two markers accurately localize the prostate if they are implanted at some distance from each other. (paper)

Evaluation of elastix-based propagated align algorithm for VOI- and voxel-based analysis of longitudinal F-18-FDG PET/CT data from patients with non-small cell lung cancer (NSCLC)

OpenAIRE

Kerner, Gerald S. M. A.; Fischer, Alexander; Koole, Michel J. B.; Pruim, Jan; Groen, Harry J. M.

2015-01-01

Background: Deformable image registration allows volume of interest (VOI)- and voxel-based analysis of longitudinal changes in fluorodeoxyglucose (FDG) tumor uptake in patients with non-small cell lung cancer (NSCLC). This study evaluates the performance of the elastix toolbox deformable image registration algorithm for VOI and voxel-wise assessment of longitudinal variations in FDG tumor uptake in NSCLC patients. Methods: Evaluation of the elastix toolbox was performed using F-18-FDG PET/CT ...

Study of three-dimensional PET and MR image registration based on higher-order mutual information

International Nuclear Information System (INIS)

Ren Haiping; Chen Shengzu; Wu Wenkai; Yang Hu

2002-01-01

Mutual information has currently been one of the most intensively researched measures. It has been proven to be accurate and effective registration measure. Despite the general promising results, mutual information sometimes might lead to misregistration because of neglecting spatial information and treating intensity variations with undue sensitivity. An extension of mutual information framework was proposed in which higher-order spatial information regarding image structures was incorporated into the registration processing of PET and MR. The second-order estimate of mutual information algorithm was applied to the registration of seven patients. Evaluation from Vanderbilt University and authors' visual inspection showed that sub-voxel accuracy and robust results were achieved in all cases with second-order mutual information as the similarity measure and with Powell's multidimensional direction set method as optimization strategy

Authentications of Myanmar National Registration Card

Directory of Open Access Journals (Sweden)

Myint Myint Sein

2013-04-01

Full Text Available The automatic identification system of Myanmar national registration card (NRC holder is presented in this paper. The proposed system can be handled the identification by the extracted low quality face image and fingerprint image from Myanmar NRC. Both of the facial recognition and fingerprint recognition system are developed for Myanmar citizenship confirmation. Age invariant face recognition algorithm is performed based on combination of DiaPCA (Diagonal principal Component Analysis and KNN (Kth nearest neighbor classifier approaches. An algorithm of the fingerprint recognition is proposed for recognition of the poor quality fingerprint image with fabric background.  Several experiments have been done for confirming the effectiveness of the proposed approach.

A Real-Time Marker-Based Visual Sensor Based on a FPGA and a Soft Core Processor.

Science.gov (United States)

Tayara, Hilal; Ham, Woonchul; Chong, Kil To

2016-12-15

This paper introduces a real-time marker-based visual sensor architecture for mobile robot localization and navigation. A hardware acceleration architecture for post video processing system was implemented on a field-programmable gate array (FPGA). The pose calculation algorithm was implemented in a System on Chip (SoC) with an Altera Nios II soft-core processor. For every frame, single pass image segmentation and Feature Accelerated Segment Test (FAST) corner detection were used for extracting the predefined markers with known geometries in FPGA. Coplanar PosIT algorithm was implemented on the Nios II soft-core processor supplied with floating point hardware for accelerating floating point operations. Trigonometric functions have been approximated using Taylor series and cubic approximation using Lagrange polynomials. Inverse square root method has been implemented for approximating square root computations. Real time results have been achieved and pixel streams have been processed on the fly without any need to buffer the input frame for further implementation.

Evaluation of registration methods on thoracic CT : the EMPIRE10 challenge

NARCIS (Netherlands)

Murphy, K.; Ginneken, van B.; Reinhardt, J.M.; Kabus, S.; Ding, K.; Deng, Xiang; Cao, K.; Du, K.; Christensen, G.E.; Garcia, V.; Vercauteren, T.; Ayache, N.; Commowick, O.; Malandain, G.; Glocker, B.; Paragios, N.; Navab, N.; Gorbunova, V.; Sporring, J.; Bruijne, de M.; Han, Xiao; Heinrich, M.P.; Schnabel, J.A.; Jenkinson, M.; Lorenz, C.; Modat, M.; McClelland, J.R.; Ourselin, S.; Muenzing, S.E.A.; Viergever, M.A.; Nigris, De D.; Collins, D.L.; Arbel, T.; Peroni, M.; Li, R.; Sharp, G.; Schmidt-Richberg, A.; Ehrhardt, J.; Werner, R.; Smeets, D.; Loeckx, D.; Song, G.; Tustison, N.; Avants, B.; Gee, J.C.; Staring, M.; Klein, S.; Stoel, B.C.; Urschler, M.; Werlberger, M.; Vandemeulebroucke, J.; Rit, S.; Sarrut, D.; Pluim, J.P.W.

2011-01-01

EMPIRE10 (Evaluation of Methods for Pulmonary Image REgistration 2010) is a public platform for fair and meaningful comparison of registration algorithms which are applied to a database of intrapatient thoracic CT image pairs. Evaluation of nonrigid registration techniques is a nontrivial task. This

Automated Coarse Registration of Point Clouds in 3d Urban Scenes Using Voxel Based Plane Constraint

Science.gov (United States)

Xu, Y.; Boerner, R.; Yao, W.; Hoegner, L.; Stilla, U.

2017-09-01

For obtaining a full coverage of 3D scans in a large-scale urban area, the registration between point clouds acquired via terrestrial laser scanning (TLS) is normally mandatory. However, due to the complex urban environment, the automatic registration of different scans is still a challenging problem. In this work, we propose an automatic marker free method for fast and coarse registration between point clouds using the geometric constrains of planar patches under a voxel structure. Our proposed method consists of four major steps: the voxelization of the point cloud, the approximation of planar patches, the matching of corresponding patches, and the estimation of transformation parameters. In the voxelization step, the point cloud of each scan is organized with a 3D voxel structure, by which the entire point cloud is partitioned into small individual patches. In the following step, we represent points of each voxel with the approximated plane function, and select those patches resembling planar surfaces. Afterwards, for matching the corresponding patches, a RANSAC-based strategy is applied. Among all the planar patches of a scan, we randomly select a planar patches set of three planar surfaces, in order to build a coordinate frame via their normal vectors and their intersection points. The transformation parameters between scans are calculated from these two coordinate frames. The planar patches set with its transformation parameters owning the largest number of coplanar patches are identified as the optimal candidate set for estimating the correct transformation parameters. The experimental results using TLS datasets of different scenes reveal that our proposed method can be both effective and efficient for the coarse registration task. Especially, for the fast orientation between scans, our proposed method can achieve a registration error of less than around 2 degrees using the testing datasets, and much more efficient than the classical baseline methods.

Registration and planning of radiotherapy and proton therapy treatment

International Nuclear Information System (INIS)

Bausse, Jerome

2010-01-01

Within the frame of an update and renewal project, the Orsay Proton Therapy Centre of the Curie Institute (IPCO) renews its software used for the treatment of patients by proton therapy, a radiotherapy technique which uses proton beams. High energies used in these treatments and the precision provided by proton particle characteristics require a more precise patient positioning than conventional radiotherapy: proton therapy requires a precision of about a millimetre. Thus, markers are placed on the skull which are generally well accepted by patients, but are a problem in the case of paediatric treatment, notably for the youngest children whose skull is still growing. The first objective of this research is thus to use only intrinsic information from X-ray images used when positioning the patient. A second objective is to make the new software (TPS Isogray) perfectly compatible with IPCO requirements by maintaining the strengths of the previous TPS (Treatment Planning System) and being prepared to the implementation of a new installation. After a presentation of the context and state of the art in radiotherapy and patient positioning, the author proposes an overview of 2D registration methods, presents a new method for 2x2D registration, and addresses the problem of 3D registration. Then, after a presentation of proton therapy, the author addresses different specific issues and aspects: the compensator (simulation, calculation, and tests), dose calculation, the 'Pencil-Beam' algorithm, tests, and introduced improvements [fr

Novel image registration quality evaluator (RQE) with an implementation for automated patient positioning in cranial radiation therapy

International Nuclear Information System (INIS)

Wu Jian; Samant, Sanjiv S.

2007-01-01

In external beam radiation therapy, digitally reconstructed radiographs (DRRs) and portal images are used to verify patient setup based either on a visual comparison or, less frequently, with automated registration algorithms. A registration algorithm can be trapped in local optima due to irregularity of patient anatomy, image noise and artifacts, and/ or out-of-plane shifts, resulting in an incorrect solution. Thus, human observation, which is subjective, is still required to check the registration result. We propose to use a novel image registration quality evaluator (RQE) to automatically identify misregistrations as part of an algorithm-based decision-making process for verification of patient positioning. A RQE, based on an adaptive pattern classifier, is generated from a pair of reference and target images to determine the acceptability of a registration solution given an optimization process. Here we applied our RQE to patient positioning for cranial radiation therapy. We constructed two RQEs--one for the evaluation of intramodal registrations (i.e., portal-portal); the other for intermodal registrations (i.e., portal-DRR). Mutual information, because of its high discriminatory ability compared with other measures (i.e., correlation coefficient and partitioned intensity uniformity), was chosen as the test function for both RQEs. We adopted 1 mm translation and 1 deg. rotation as the maximal acceptable registration errors, reflecting desirable clinical setup tolerances for cranial radiation therapy. Receiver operating characteristic analysis was used to evaluate the performance of the RQE, including computations of sensitivity and specificity. The RQEs showed very good performance for both intramodal and intermodal registrations using simulated and phantom data. The sensitivity and the specificity were 0.973 and 0.936, respectively, for the intramodal RQE using phantom data. Whereas the sensitivity and the specificity were 0.961 and 0.758, respectively, for

Anisotropic multi-scale fluid registration: evaluation in magnetic resonance breast imaging

International Nuclear Information System (INIS)

Crum, W R; Tanner, C; Hawkes, D J

2005-01-01

Registration using models of compressible viscous fluids has not found the general application of some other techniques (e.g., free-form-deformation (FFD)) despite its ability to model large diffeomorphic deformations. We report on a multi-resolution fluid registration algorithm which improves on previous work by (a) directly solving the Navier-Stokes equation at the resolution of the images (b) accommodating image sampling anisotropy using semi-coarsening and implicit smoothing in a full multi-grid (FMG) solver and (c) exploiting the inherent multi-resolution nature of FMG to implement a multi-scale approach. Evaluation is on five magnetic resonance (MR) breast images subject to six biomechanical deformation fields over 11 multi-resolution schemes. Quantitative assessment is by tissue overlaps and target registration errors and by registering using the known correspondences rather than image features to validate the fluid model. Context is given by comparison with a validated FFD algorithm and by application to images of volunteers subjected to large applied deformation. The results show that fluid registration of 3D breast MR images to sub-voxel accuracy is possible in minutes on a 1.6 GHz Linux-based Athlon processor with coarse solutions obtainable in a few tens of seconds. Accuracy and computation time are comparable to FFD techniques validated for this application

Performance of 12 DIR algorithms in low-contrast regions for mass and density conserving deformation

International Nuclear Information System (INIS)

Yeo, U. J.; Supple, J. R.; Franich, R. D.; Taylor, M. L.; Smith, R.; Kron, T.

2013-01-01

Purpose: Deformable image registration (DIR) has become a key tool for adaptive radiotherapy to account for inter- and intrafraction organ deformation. Of contemporary interest, the application to deformable dose accumulation requires accurate deformation even in low contrast regions where dose gradients may exist within near-uniform tissues. One expects high-contrast features to generally be deformed more accurately by DIR algorithms. The authors systematically assess the accuracy of 12 DIR algorithms and quantitatively examine, in particular, low-contrast regions, where accuracy has not previously been established.Methods: This work investigates DIR algorithms in three dimensions using deformable gel (DEFGEL) [U. J. Yeo, M. L. Taylor, L. Dunn, R. L. Smith, T. Kron, and R. D. Franich, “A novel methodology for 3D deformable dosimetry,” Med. Phys. 39, 2203–2213 (2012)], for application to mass- and density-conserving deformations. CT images of DEFGEL phantoms with 16 fiducial markers (FMs) implanted were acquired in deformed and undeformed states for three different representative deformation geometries. Nonrigid image registration was performed using 12 common algorithms in the public domain. The optimum parameter setup was identified for each algorithm and each was tested for deformation accuracy in three scenarios: (I) original images of the DEFGEL with 16 FMs; (II) images with eight of the FMs mathematically erased; and (III) images with all FMs mathematically erased. The deformation vector fields obtained for scenarios II and III were then applied to the original images containing all 16 FMs. The locations of the FMs estimated by the algorithms were compared to actual locations determined by CT imaging. The accuracy of the algorithms was assessed by evaluation of three-dimensional vectors between true marker locations and predicted marker locations.Results: The mean magnitude of 16 error vectors per sample ranged from 0.3 to 3.7, 1.0 to 6.3, and 1.3 to 7

High-performance GPU-based rendering for real-time, rigid 2D/3D-image registration and motion prediction in radiation oncology.

Science.gov (United States)

Spoerk, Jakob; Gendrin, Christelle; Weber, Christoph; Figl, Michael; Pawiro, Supriyanto Ardjo; Furtado, Hugo; Fabri, Daniella; Bloch, Christoph; Bergmann, Helmar; Gröller, Eduard; Birkfellner, Wolfgang

2012-02-01

A common problem in image-guided radiation therapy (IGRT) of lung cancer as well as other malignant diseases is the compensation of periodic and aperiodic motion during dose delivery. Modern systems for image-guided radiation oncology allow for the acquisition of cone-beam computed tomography data in the treatment room as well as the acquisition of planar radiographs during the treatment. A mid-term research goal is the compensation of tumor target volume motion by 2D/3D Registration. In 2D/3D registration, spatial information on organ location is derived by an iterative comparison of perspective volume renderings, so-called digitally rendered radiographs (DRR) from computed tomography volume data, and planar reference x-rays. Currently, this rendering process is very time consuming, and real-time registration, which should at least provide data on organ position in less than a second, has not come into existence. We present two GPU-based rendering algorithms which generate a DRR of 512×512 pixels size from a CT dataset of 53 MB size at a pace of almost 100 Hz. This rendering rate is feasible by applying a number of algorithmic simplifications which range from alternative volume-driven rendering approaches - namely so-called wobbled splatting - to sub-sampling of the DRR-image by means of specialized raycasting techniques. Furthermore, general purpose graphics processing unit (GPGPU) programming paradigms were consequently utilized. Rendering quality and performance as well as the influence on the quality and performance of the overall registration process were measured and analyzed in detail. The results show that both methods are competitive and pave the way for fast motion compensation by rigid and possibly even non-rigid 2D/3D registration and, beyond that, adaptive filtering of motion models in IGRT. Copyright © 2011. Published by Elsevier GmbH.

High-performance GPU-based rendering for real-time, rigid 2D/3D-image registration and motion prediction in radiation oncology

Energy Technology Data Exchange (ETDEWEB)

Spoerk, Jakob; Gendrin, Christelle; Weber, Christoph [Medical University of Vienna (Austria). Center of Medical Physics and Biomedical Engineering] [and others

2012-07-01

A common problem in image-guided radiation therapy (IGRT) of lung cancer as well as other malignant diseases is the compensation of periodic and aperiodic motion during dose delivery. Modern systems for image-guided radiation oncology allow for the acquisition of cone-beam computed tomography data in the treatment room as well as the acquisition of planar radiographs during the treatment. A mid-term research goal is the compensation of tumor target volume motion by 2D/3D Registration. In 2D/3D registration, spatial information on organ location is derived by an iterative comparison of perspective volume renderings, so-called digitally rendered radiographs (DRR) from computed tomography volume data, and planar reference X-rays. Currently, this rendering process is very time consuming, and real-time registration, which should at least provide data on organ position in less than a second, has not come into existence. We present two GPU-based rendering algorithms which generate a DRR of 512 x 512 pixels size from a CT dataset of 53 MB size at a pace of almost 100 Hz. This rendering rate is feasible by applying a number of algorithmic simplifications which range from alternative volume-driven rendering approaches - namely so-called wobbled splatting - to sub-sampling of the DRR-image by means of specialized raycasting techniques. Furthermore, general purpose graphics processing unit (GPGPU) programming paradigms were consequently utilized. Rendering quality and performance as well as the influence on the quality and performance of the overall registration process were measured and analyzed in detail. The results show that both methods are competitive and pave the way for fast motion compensation by rigid and possibly even non-rigid 2D/3D registration and, beyond that, adaptive filtering of motion models in IGRT. (orig.)

Correction of rotational distortion for catheter-based en face OCT and OCT angiography

Science.gov (United States)

Ahsen, Osman O.; Lee, Hsiang-Chieh; Giacomelli, Michael G.; Wang, Zhao; Liang, Kaicheng; Tsai, Tsung-Han; Potsaid, Benjamin; Mashimo, Hiroshi; Fujimoto, James G.

2015-01-01

We demonstrate a computationally efficient method for correcting the nonuniform rotational distortion (NURD) in catheter-based imaging systems to improve endoscopic en face optical coherence tomography (OCT) and OCT angiography. The method performs nonrigid registration using fiducial markers on the catheter to correct rotational speed variations. Algorithm performance is investigated with an ultrahigh-speed endoscopic OCT system and micromotor catheter. Scan nonuniformity is quantitatively characterized, and artifacts from rotational speed variations are significantly reduced. Furthermore, we present endoscopic en face OCT and OCT angiography images of human gastrointestinal tract in vivo to demonstrate the image quality improvement using the correction algorithm. PMID:25361133

Automatic registration method for multisensor datasets adopted for dimensional measurements on cutting tools

International Nuclear Information System (INIS)

Shaw, L; Mehari, F; Weckenmann, A; Ettl, S; Häusler, G

2013-01-01

Multisensor systems with optical 3D sensors are frequently employed to capture complete surface information by measuring workpieces from different views. During coarse and fine registration the resulting datasets are afterward transformed into one common coordinate system. Automatic fine registration methods are well established in dimensional metrology, whereas there is a deficit in automatic coarse registration methods. The advantage of a fully automatic registration procedure is twofold: it enables a fast and contact-free alignment and further a flexible application to datasets of any kind of optical 3D sensor. In this paper, an algorithm adapted for a robust automatic coarse registration is presented. The method was originally developed for the field of object reconstruction or localization. It is based on a segmentation of planes in the datasets to calculate the transformation parameters. The rotation is defined by the normals of three corresponding segmented planes of two overlapping datasets, while the translation is calculated via the intersection point of the segmented planes. First results have shown that the translation is strongly shape dependent: 3D data of objects with non-orthogonal planar flanks cannot be registered with the current method. In the novel supplement for the algorithm, the translation is additionally calculated via the distance between centroids of corresponding segmented planes, which results in more than one option for the transformation. A newly introduced measure considering the distance between the datasets after coarse registration evaluates the best possible transformation. Results of the robust automatic registration method are presented on the example of datasets taken from a cutting tool with a fringe-projection system and a focus-variation system. The successful application in dimensional metrology is proven with evaluations of shape parameters based on the registered datasets of a calibrated workpiece. (paper)

Registration of eye reflection and scene images using an aspherical eye model.

Science.gov (United States)

Nakazawa, Atsushi; Nitschke, Christian; Nishida, Toyoaki

2016-11-01

This paper introduces an image registration algorithm between an eye reflection and a scene image. Although there are currently a large number of image registration algorithms, this task remains difficult due to nonlinear distortions at the eye surface and large amounts of noise, such as iris texture, eyelids, eyelashes, and their shadows. To overcome this issue, we developed an image registration method combining an aspherical eye model that simulates nonlinear distortions considering eye geometry and a two-step iterative registration strategy that obtains dense correspondence of the feature points to achieve accurate image registrations for the entire image region. We obtained a database of eye reflection and scene images featuring four subjects in indoor and outdoor scenes and compared the registration performance with different asphericity conditions. Results showed that the proposed approach can perform accurate registration with an average accuracy of 1.05 deg by using the aspherical cornea model. This work is relevant for eye image analysis in general, enabling novel applications and scenarios.

Automated analysis of small animal PET studies through deformable registration to an atlas

International Nuclear Information System (INIS)

Gutierrez, Daniel F.; Zaidi, Habib

2012-01-01

This work aims to develop a methodology for automated atlas-guided analysis of small animal positron emission tomography (PET) data through deformable registration to an anatomical mouse model. A non-rigid registration technique is used to put into correspondence relevant anatomical regions of rodent CT images from combined PET/CT studies to corresponding CT images of the Digimouse anatomical mouse model. The latter provides a pre-segmented atlas consisting of 21 anatomical regions suitable for automated quantitative analysis. Image registration is performed using a package based on the Insight Toolkit allowing the implementation of various image registration algorithms. The optimal parameters obtained for deformable registration were applied to simulated and experimental mouse PET/CT studies. The accuracy of the image registration procedure was assessed by segmenting mouse CT images into seven regions: brain, lungs, heart, kidneys, bladder, skeleton and the rest of the body. This was accomplished prior to image registration using a semi-automated algorithm. Each mouse segmentation was transformed using the parameters obtained during CT to CT image registration. The resulting segmentation was compared with the original Digimouse atlas to quantify image registration accuracy using established metrics such as the Dice coefficient and Hausdorff distance. PET images were then transformed using the same technique and automated quantitative analysis of tracer uptake performed. The Dice coefficient and Hausdorff distance show fair to excellent agreement and a mean registration mismatch distance of about 6 mm. The results demonstrate good quantification accuracy in most of the regions, especially the brain, but not in the bladder, as expected. Normalized mean activity estimates were preserved between the reference and automated quantification techniques with relative errors below 10 % in most of the organs considered. The proposed automated quantification technique is

Symmetrized local co-registration optimization for anomalous change detection

Energy Technology Data Exchange (ETDEWEB)

Wohlberg, Brendt E [Los Alamos National Laboratory; Theiler, James P [Los Alamos National Laboratory

2009-01-01

The goal of anomalous change detection (ACD) is to identify what unusual changes have occurred in a scene, based on two images of the scene taken at different times and under different conditions. The actual anomalous changes need to be distinguished from the incidental differences that occur throughout the imagery, and one of the most common and confounding of these incidental differences is due to the misregistration of the images, due to limitations of the registration pre-processing applied to the image pair. We propose a general method to compensate for residual misregistration in any ACD algorithm which constructs an estimate of the degree of 'anomalousness' for every pixel in the image pair. The method computes a modified misregistration-insensitive anomalousness by making local re-registration adjustments to minimize the local anomalousness. In this paper we describe a symmetrized version of our initial algorithm, and find significant performance improvements in the anomalous change detection ROC curves for a number of real and synthetic data sets.

The algorithm of fast image stitching based on multi-feature extraction

Science.gov (United States)

Yang, Chunde; Wu, Ge; Shi, Jing

2018-05-01

This paper proposed an improved image registration method combining Hu-based invariant moment contour information and feature points detection, aiming to solve the problems in traditional image stitching algorithm, such as time-consuming feature points extraction process, redundant invalid information overload and inefficiency. First, use the neighborhood of pixels to extract the contour information, employing the Hu invariant moment as similarity measure to extract SIFT feature points in those similar regions. Then replace the Euclidean distance with Hellinger kernel function to improve the initial matching efficiency and get less mismatching points, further, estimate affine transformation matrix between the images. Finally, local color mapping method is adopted to solve uneven exposure, using the improved multiresolution fusion algorithm to fuse the mosaic images and realize seamless stitching. Experimental results confirm high accuracy and efficiency of method proposed in this paper.

Robust inverse-consistent affine CT-MR registration in MRI-assisted and MRI-alone prostate radiation therapy.

Science.gov (United States)

Rivest-Hénault, David; Dowson, Nicholas; Greer, Peter B; Fripp, Jurgen; Dowling, Jason A

2015-07-01

CT-MR registration is a critical component of many radiation oncology protocols. In prostate external beam radiation therapy, it allows the propagation of MR-derived contours to reference CT images at the planning stage, and it enables dose mapping during dosimetry studies. The use of carefully registered CT-MR atlases allows the estimation of patient specific electron density maps from MRI scans, enabling MRI-alone radiation therapy planning and treatment adaptation. In all cases, the precision and accuracy achieved by registration influences the quality of the entire process. Most current registration algorithms do not robustly generalize and lack inverse-consistency, increasing the risk of human error and acting as a source of bias in studies where information is propagated in a particular direction, e.g. CT to MR or vice versa. In MRI-based treatment planning where both CT and MR scans serve as spatial references, inverse-consistency is critical, if under-acknowledged. A robust, inverse-consistent, rigid/affine registration algorithm that is well suited to CT-MR alignment in prostate radiation therapy is presented. The presented method is based on a robust block-matching optimization process that utilises a half-way space definition to maintain inverse-consistency. Inverse-consistency substantially reduces the influence of the order of input images, simplifying analysis, and increasing robustness. An open source implementation is available online at http://aehrc.github.io/Mirorr/. Experimental results on a challenging 35 CT-MR pelvis dataset demonstrate that the proposed method is more accurate than other popular registration packages and is at least as accurate as the state of the art, while being more robust and having an order of magnitude higher inverse-consistency than competing approaches. The presented results demonstrate that the proposed registration algorithm is readily applicable to prostate radiation therapy planning. Copyright © 2015. Published by

Registration of prone and supine CT colonography scans using correlation optimized warping and canonical correlation analysis

International Nuclear Information System (INIS)

Wang Shijun; Yao Jianhua; Liu Jiamin; Petrick, Nicholas; Van Uitert, Robert L.; Periaswamy, Senthil; Summers, Ronald M.

2009-01-01

Purpose: In computed tomographic colonography (CTC), a patient will be scanned twice--Once supine and once prone--to improve the sensitivity for polyp detection. To assist radiologists in CTC reading, in this paper we propose an automated method for colon registration from supine and prone CTC scans. Methods: We propose a new colon centerline registration method for prone and supine CTC scans using correlation optimized warping (COW) and canonical correlation analysis (CCA) based on the anatomical structure of the colon. Four anatomical salient points on the colon are first automatically distinguished. Then correlation optimized warping is applied to the segments defined by the anatomical landmarks to improve the global registration based on local correlation of segments. The COW method was modified by embedding canonical correlation analysis to allow multiple features along the colon centerline to be used in our implementation. Results: We tested the COW algorithm on a CTC data set of 39 patients with 39 polyps (19 training and 20 test cases) to verify the effectiveness of the proposed COW registration method. Experimental results on the test set show that the COW method significantly reduces the average estimation error in a polyp location between supine and prone scans by 67.6%, from 46.27±52.97 to 14.98 mm±11.41 mm, compared to the normalized distance along the colon centerline algorithm (p<0.01). Conclusions: The proposed COW algorithm is more accurate for the colon centerline registration compared to the normalized distance along the colon centerline method and the dynamic time warping method. Comparison results showed that the feature combination of z-coordinate and curvature achieved lowest registration error compared to the other feature combinations used by COW. The proposed method is tolerant to centerline errors because anatomical landmarks help prevent the propagation of errors across the entire colon centerline.

Alternative face models for 3D face registration

Science.gov (United States)

Salah, Albert Ali; Alyüz, Neşe; Akarun, Lale

2007-01-01

3D has become an important modality for face biometrics. The accuracy of a 3D face recognition system depends on a correct registration that aligns the facial surfaces and makes a comparison possible. The best results obtained so far use a one-to-all registration approach, which means each new facial surface is registered to all faces in the gallery, at a great computational cost. We explore the approach of registering the new facial surface to an average face model (AFM), which automatically establishes correspondence to the pre-registered gallery faces. Going one step further, we propose that using a couple of well-selected AFMs can trade-off computation time with accuracy. Drawing on cognitive justifications, we propose to employ category-specific alternative average face models for registration, which is shown to increase the accuracy of the subsequent recognition. We inspect thin-plate spline (TPS) and iterative closest point (ICP) based registration schemes under realistic assumptions on manual or automatic landmark detection prior to registration. We evaluate several approaches for the coarse initialization of ICP. We propose a new algorithm for constructing an AFM, and show that it works better than a recent approach. Finally, we perform simulations with multiple AFMs that correspond to different clusters in the face shape space and compare these with gender and morphology based groupings. We report our results on the FRGC 3D face database.

Registration of partially overlapping surfaces for range image based augmented reality on mobile devices

Science.gov (United States)

Kilgus, T.; Franz, A. M.; Seitel, A.; Marz, K.; Bartha, L.; Fangerau, M.; Mersmann, S.; Groch, A.; Meinzer, H.-P.; Maier-Hein, L.

2012-02-01

Visualization of anatomical data for disease diagnosis, surgical planning, or orientation during interventional therapy is an integral part of modern health care. However, as anatomical information is typically shown on monitors provided by a radiological work station, the physician has to mentally transfer internal structures shown on the screen to the patient. To address this issue, we recently presented a new approach to on-patient visualization of 3D medical images, which combines the concept of augmented reality (AR) with an intuitive interaction scheme. Our method requires mounting a range imaging device, such as a Time-of-Flight (ToF) camera, to a portable display (e.g. a tablet PC). During the visualization process, the pose of the camera and thus the viewing direction of the user is continuously determined with a surface matching algorithm. By moving the device along the body of the patient, the physician is given the impression of looking directly into the human body. In this paper, we present and evaluate a new method for camera pose estimation based on an anisotropic trimmed variant of the well-known iterative closest point (ICP) algorithm. According to in-silico and in-vivo experiments performed with computed tomography (CT) and ToF data of human faces, knees and abdomens, our new method is better suited for surface registration with ToF data than the established trimmed variant of the ICP, reducing the target registration error (TRE) by more than 60%. The TRE obtained (approx. 4-5 mm) is promising for AR visualization, but clinical applications require maximization of robustness and run-time.

A two-dimensional deformable phantom for quantitatively verifying deformation algorithms

Energy Technology Data Exchange (ETDEWEB)

Kirby, Neil; Chuang, Cynthia; Pouliot, Jean [Department of Radiation Oncology, University of California San Francisco, San Francisco, California 94143-1708 (United States)

2011-08-15

Purpose: The incorporation of deformable image registration into the treatment planning process is rapidly advancing. For this reason, the methods used to verify the underlying deformation algorithms must evolve equally fast. This manuscript proposes a two-dimensional deformable phantom, which can objectively verify the accuracy of deformation algorithms, as the next step for improving these techniques. Methods: The phantom represents a single plane of the anatomy for a head and neck patient. Inflation of a balloon catheter inside the phantom simulates tumor growth. CT and camera images of the phantom are acquired before and after its deformation. Nonradiopaque markers reside on the surface of the deformable anatomy and are visible through an acrylic plate, which enables an optical camera to measure their positions; thus, establishing the ground-truth deformation. This measured deformation is directly compared to the predictions of deformation algorithms, using several similarity metrics. The ratio of the number of points with more than a 3 mm deformation error over the number that are deformed by more than 3 mm is used for an error metric to evaluate algorithm accuracy. Results: An optical method of characterizing deformation has been successfully demonstrated. For the tests of this method, the balloon catheter deforms 32 out of the 54 surface markers by more than 3 mm. Different deformation errors result from the different similarity metrics. The most accurate deformation predictions had an error of 75%. Conclusions: The results presented here demonstrate the utility of the phantom for objectively verifying deformation algorithms and determining which is the most accurate. They also indicate that the phantom would benefit from more electron density heterogeneity. The reduction of the deformable anatomy to a two-dimensional system allows for the use of nonradiopaque markers, which do not influence deformation algorithms. This is the fundamental advantage of this

2D-3D registration for cranial radiation therapy using a 3D kV CBCT and a single limited field-of-view 2D kV radiograph.

Science.gov (United States)

Munbodh, Reshma; Knisely, Jonathan Ps; Jaffray, David A; Moseley, Douglas J

2018-05-01

We present and evaluate a fully automated 2D-3D intensity-based registration framework using a single limited field-of-view (FOV) 2D kV radiograph and a 3D kV CBCT for 3D estimation of patient setup errors during brain radiotherapy. We evaluated two similarity measures, the Pearson correlation coefficient on image intensity values (ICC) and maximum likelihood measure with Gaussian noise (MLG), derived from the statistics of transmission images. Pose determination experiments were conducted on 2D kV radiographs in the anterior-posterior (AP) and left lateral (LL) views and 3D kV CBCTs of an anthropomorphic head phantom. In order to minimize radiation exposure and exclude nonrigid structures from the registration, limited FOV 2D kV radiographs were employed. A spatial frequency band useful for the 2D-3D registration was identified from the bone-to-no-bone spectral ratio (BNBSR) of digitally reconstructed radiographs (DRRs) computed from the 3D kV planning CT of the phantom. The images being registered were filtered accordingly prior to computation of the similarity measures. We evaluated the registration accuracy achievable with a single 2D kV radiograph and with the registration results from the AP and LL views combined. We also compared the performance of the 2D-3D registration solutions proposed to that of a commercial 3D-3D registration algorithm, which used the entire skull for the registration. The ground truth was determined from markers affixed to the phantom and visible in the CBCT images. The accuracy of the 2D-3D registration solutions, as quantified by the root mean squared value of the target registration error (TRE) calculated over a radius of 3 cm for all poses tested, was ICC AP : 0.56 mm, MLG AP : 0.74 mm, ICC LL : 0.57 mm, MLG LL : 0.54 mm, ICC (AP and LL combined): 0.19 mm, and MLG (AP and LL combined): 0.21 mm. The accuracy of the 3D-3D registration algorithm was 0.27 mm. There was no significant difference in mean TRE for the 2D-3D registration

Real-time registration of 3D to 2D ultrasound images for image-guided prostate biopsy.

Science.gov (United States)

Gillies, Derek J; Gardi, Lori; De Silva, Tharindu; Zhao, Shuang-Ren; Fenster, Aaron

2017-09-01

During image-guided prostate biopsy, needles are targeted at tissues that are suspicious of cancer to obtain specimen for histological examination. Unfortunately, patient motion causes targeting errors when using an MR-transrectal ultrasound (TRUS) fusion approach to augment the conventional biopsy procedure. This study aims to develop an automatic motion correction algorithm approaching the frame rate of an ultrasound system to be used in fusion-based prostate biopsy systems. Two modes of operation have been investigated for the clinical implementation of the algorithm: motion compensation using a single user initiated correction performed prior to biopsy, and real-time continuous motion compensation performed automatically as a background process. Retrospective 2D and 3D TRUS patient images acquired prior to biopsy gun firing were registered using an intensity-based algorithm utilizing normalized cross-correlation and Powell's method for optimization. 2D and 3D images were downsampled and cropped to estimate the optimal amount of image information that would perform registrations quickly and accurately. The optimal search order during optimization was also analyzed to avoid local optima in the search space. Error in the algorithm was computed using target registration errors (TREs) from manually identified homologous fiducials in a clinical patient dataset. The algorithm was evaluated for real-time performance using the two different modes of clinical implementations by way of user initiated and continuous motion compensation methods on a tissue mimicking prostate phantom. After implementation in a TRUS-guided system with an image downsampling factor of 4, the proposed approach resulted in a mean ± std TRE and computation time of 1.6 ± 0.6 mm and 57 ± 20 ms respectively. The user initiated mode performed registrations with in-plane, out-of-plane, and roll motions computation times of 108 ± 38 ms, 60 ± 23 ms, and 89 ± 27 ms, respectively, and corresponding

A Variational Approach to Video Registration with Subspace Constraints.

Science.gov (United States)

Garg, Ravi; Roussos, Anastasios; Agapito, Lourdes

2013-01-01

This paper addresses the problem of non-rigid video registration, or the computation of optical flow from a reference frame to each of the subsequent images in a sequence, when the camera views deformable objects. We exploit the high correlation between 2D trajectories of different points on the same non-rigid surface by assuming that the displacement of any point throughout the sequence can be expressed in a compact way as a linear combination of a low-rank motion basis. This subspace constraint effectively acts as a trajectory regularization term leading to temporally consistent optical flow. We formulate it as a robust soft constraint within a variational framework by penalizing flow fields that lie outside the low-rank manifold. The resulting energy functional can be decoupled into the optimization of the brightness constancy and spatial regularization terms, leading to an efficient optimization scheme. Additionally, we propose a novel optimization scheme for the case of vector valued images, based on the dualization of the data term. This allows us to extend our approach to deal with colour images which results in significant improvements on the registration results. Finally, we provide a new benchmark dataset, based on motion capture data of a flag waving in the wind, with dense ground truth optical flow for evaluation of multi-frame optical flow algorithms for non-rigid surfaces. Our experiments show that our proposed approach outperforms state of the art optical flow and dense non-rigid registration algorithms.

Depth-resolved registration of transesophageal echo to x-ray fluoroscopy using an inverse geometry fluoroscopy system

Energy Technology Data Exchange (ETDEWEB)

Hatt, Charles R. [Department of Biomedical Engineering, University of Wisconsin-Madison, Madison, Wisconsin 53705 (United States); Tomkowiak, Michael T.; Dunkerley, David A. P.; Slagowski, Jordan M. [Department of Medical Physics, University of Wisconsin-Madison, Madison, Wisconsin 53705 (United States); Funk, Tobias [Triple Ring Technologies, Inc., Newark, California 94560 (United States); Raval, Amish N. [Department of Medicine, University of Wisconsin-Madison, Madison, Wisconsin 53792 (United States); Speidel, Michael A., E-mail: speidel@wisc.edu [Departments of Medical Physics and Medicine, University of Wisconsin-Madison, Madison, Wisconsin 53705 (United States)

2015-12-15

Purpose: Image registration between standard x-ray fluoroscopy and transesophageal echocardiography (TEE) has recently been proposed. Scanning-beam digital x-ray (SBDX) is an inverse geometry fluoroscopy system designed for cardiac procedures. This study presents a method for 3D registration of SBDX and TEE images based on the tomosynthesis and 3D tracking capabilities of SBDX. Methods: The registration algorithm utilizes the stack of tomosynthetic planes produced by the SBDX system to estimate the physical 3D coordinates of salient key-points on the TEE probe. The key-points are used to arrive at an initial estimate of the probe pose, which is then refined using a 2D/3D registration method adapted for inverse geometry fluoroscopy. A phantom study was conducted to evaluate probe pose estimation accuracy relative to the ground truth, as defined by a set of coregistered fiducial markers. This experiment was conducted with varying probe poses and levels of signal difference-to-noise ratio (SDNR). Additional phantom and in vivo studies were performed to evaluate the correspondence of catheter tip positions in TEE and x-ray images following registration of the two modalities. Results: Target registration error (TRE) was used to characterize both pose estimation and registration accuracy. In the study of pose estimation accuracy, successful pose estimates (3D TRE < 5.0 mm) were obtained in 97% of cases when the SDNR was 5.9 or higher in seven out of eight poses. Under these conditions, 3D TRE was 2.32 ± 1.88 mm, and 2D (projection) TRE was 1.61 ± 1.36 mm. Probe localization error along the source-detector axis was 0.87 ± 1.31 mm. For the in vivo experiments, mean 3D TRE ranged from 2.6 to 4.6 mm and mean 2D TRE ranged from 1.1 to 1.6 mm. Anatomy extracted from the echo images appeared well aligned when projected onto the SBDX images. Conclusions: Full 6 DOF image registration between SBDX and TEE is feasible and accurate to within 5 mm. Future studies will focus on

Depth-resolved registration of transesophageal echo to x-ray fluoroscopy using an inverse geometry fluoroscopy system

International Nuclear Information System (INIS)

Hatt, Charles R.; Tomkowiak, Michael T.; Dunkerley, David A. P.; Slagowski, Jordan M.; Funk, Tobias; Raval, Amish N.; Speidel, Michael A.

2015-01-01

Purpose: Image registration between standard x-ray fluoroscopy and transesophageal echocardiography (TEE) has recently been proposed. Scanning-beam digital x-ray (SBDX) is an inverse geometry fluoroscopy system designed for cardiac procedures. This study presents a method for 3D registration of SBDX and TEE images based on the tomosynthesis and 3D tracking capabilities of SBDX. Methods: The registration algorithm utilizes the stack of tomosynthetic planes produced by the SBDX system to estimate the physical 3D coordinates of salient key-points on the TEE probe. The key-points are used to arrive at an initial estimate of the probe pose, which is then refined using a 2D/3D registration method adapted for inverse geometry fluoroscopy. A phantom study was conducted to evaluate probe pose estimation accuracy relative to the ground truth, as defined by a set of coregistered fiducial markers. This experiment was conducted with varying probe poses and levels of signal difference-to-noise ratio (SDNR). Additional phantom and in vivo studies were performed to evaluate the correspondence of catheter tip positions in TEE and x-ray images following registration of the two modalities. Results: Target registration error (TRE) was used to characterize both pose estimation and registration accuracy. In the study of pose estimation accuracy, successful pose estimates (3D TRE < 5.0 mm) were obtained in 97% of cases when the SDNR was 5.9 or higher in seven out of eight poses. Under these conditions, 3D TRE was 2.32 ± 1.88 mm, and 2D (projection) TRE was 1.61 ± 1.36 mm. Probe localization error along the source-detector axis was 0.87 ± 1.31 mm. For the in vivo experiments, mean 3D TRE ranged from 2.6 to 4.6 mm and mean 2D TRE ranged from 1.1 to 1.6 mm. Anatomy extracted from the echo images appeared well aligned when projected onto the SBDX images. Conclusions: Full 6 DOF image registration between SBDX and TEE is feasible and accurate to within 5 mm. Future studies will focus on

Method for accurate registration of tissue autofluorescence imaging data with corresponding histology: a means for enhanced tumor margin assessment

Science.gov (United States)

Unger, Jakob; Sun, Tianchen; Chen, Yi-Ling; Phipps, Jennifer E.; Bold, Richard J.; Darrow, Morgan A.; Ma, Kwan-Liu; Marcu, Laura

2018-01-01

An important step in establishing the diagnostic potential for emerging optical imaging techniques is accurate registration between imaging data and the corresponding tissue histopathology typically used as gold standard in clinical diagnostics. We present a method to precisely register data acquired with a point-scanning spectroscopic imaging technique from fresh surgical tissue specimen blocks with corresponding histological sections. Using a visible aiming beam to augment point-scanning multispectral time-resolved fluorescence spectroscopy on video images, we evaluate two different markers for the registration with histology: fiducial markers using a 405-nm CW laser and the tissue block's outer shape characteristics. We compare the registration performance with benchmark methods using either the fiducial markers or the outer shape characteristics alone to a hybrid method using both feature types. The hybrid method was found to perform best reaching an average error of 0.78±0.67 mm. This method provides a profound framework to validate diagnostical abilities of optical fiber-based techniques and furthermore enables the application of supervised machine learning techniques to automate tissue characterization.

Behavior of Lipiodol Markers During Image Guided Radiotherapy of Bladder Cancer

International Nuclear Information System (INIS)

Chai Xiangfei; Herk, Marcel van; Kamer, Jeroen B. van de; Remeijer, Peter; Bex, Axel; Betgen, Anja; De Reijke, Theo M.; Hulshof, Maarten C.C.M.; Pos, Floris J.; Bel, Arjan

2010-01-01

Purpose: To investigate the stability of a novel type of markers used in partial bladder tumor irradiation and tumor deformation as indicated by the markers. Materials and Methods: In 15 patients with solitary bladder cancer, lipiodol was injected in the bladder wall during flexible cystoscopy to identify the tumor. A planning CT scan was made, followed by daily cone-beam CT (CBCT) scans during treatment. To study the accuracy of using these markers for image guidance, uncertainties U1 and U2 were calculated, which were defined as the difference between submask registration (covering single marker) and the average of all submask registrations and the difference between the submask registration and the general mask registration (including all markers), respectively. Finally, to study tumor deformation, the relative movement of each marker pair was correlated with the relative bladder volume (RBV). Results: The analyzed patients had 2.3 marker injections on average. The lipiodol spot size was 0.72 ± 1.1 cm 3 . The intensity of spots in both CT and CBCT was significantly higher than the surrounding bladder tissue. The uncertainties U1 and U2 were comparable, and the uncertainties in left-right direction (0.14-0.19 cm) were smaller than those in cranial-caudal and anterior-posterior directions (0.19-0.32 cm). The relative marker movement of within-zone marker pairs was much smaller (and has less dependence on the RBV) than across-zones marker pairs. Conclusions: Lipiodol markers are a feasible method to track bladder tumor by using online CBCT. Tumor deformation is observed, especially for tumors that cross the defined bladder zones.

Behavior of Lipiodol Markers During Image Guided Radiotherapy of Bladder Cancer

Energy Technology Data Exchange (ETDEWEB)

Chai Xiangfei, E-mail: x.chai@amc.uva.n [Department of Radiation Oncology, Academic Medical Center, University of Amsterdam, Amsterdam (Netherlands); Herk, Marcel van [Department of Radiation Oncology, The Netherlands Cancer Institute, Antoni van Leeuwenhoek Hospital, Amsterdam (Netherlands); Kamer, Jeroen B. van de [Department of Radiation Oncology, Academic Medical Center, University of Amsterdam, Amsterdam (Netherlands); Remeijer, Peter [Department of Radiation Oncology, Netherlands Cancer Institute, Antoni van Leeuwenhoek Hospital, Amsterdam (Netherlands); Bex, Axel [Department of Urology, Netherlands Cancer Institute, Antoni van Leeuwenhoek Hospital, Amsterdam (Netherlands); Betgen, Anja [Department of Radiation Oncology, Netherlands Cancer Institute, Antoni van Leeuwenhoek Hospital, Amsterdam (Netherlands); De Reijke, Theo M [Department of Urology, Academic Medical Center, University of Amsterdam, Amsterdam (Netherlands); Hulshof, Maarten C.C.M. [Department of Radiation Oncology, Academic Medical Center, University of Amsterdam, Amsterdam (Netherlands); Pos, Floris J [Department of Radiation Oncology, Netherlands Cancer Institute, Antoni van Leeuwenhoek Hospital, Amsterdam (Netherlands); Bel, Arjan [Department of Radiation Oncology, Academic Medical Center, University of Amsterdam, Amsterdam (Netherlands)

2010-05-01

Purpose: To investigate the stability of a novel type of markers used in partial bladder tumor irradiation and tumor deformation as indicated by the markers. Materials and Methods: In 15 patients with solitary bladder cancer, lipiodol was injected in the bladder wall during flexible cystoscopy to identify the tumor. A planning CT scan was made, followed by daily cone-beam CT (CBCT) scans during treatment. To study the accuracy of using these markers for image guidance, uncertainties U1 and U2 were calculated, which were defined as the difference between submask registration (covering single marker) and the average of all submask registrations and the difference between the submask registration and the general mask registration (including all markers), respectively. Finally, to study tumor deformation, the relative movement of each marker pair was correlated with the relative bladder volume (RBV). Results: The analyzed patients had 2.3 marker injections on average. The lipiodol spot size was 0.72 +- 1.1 cm{sup 3}. The intensity of spots in both CT and CBCT was significantly higher than the surrounding bladder tissue. The uncertainties U1 and U2 were comparable, and the uncertainties in left-right direction (0.14-0.19 cm) were smaller than those in cranial-caudal and anterior-posterior directions (0.19-0.32 cm). The relative marker movement of within-zone marker pairs was much smaller (and has less dependence on the RBV) than across-zones marker pairs. Conclusions: Lipiodol markers are a feasible method to track bladder tumor by using online CBCT. Tumor deformation is observed, especially for tumors that cross the defined bladder zones.

Hierarchical and successive approximate registration of the non-rigid medical image based on thin-plate splines

Science.gov (United States)

Hu, Jinyan; Li, Li; Yang, Yunfeng

2017-06-01

The hierarchical and successive approximate registration method of non-rigid medical image based on the thin-plate splines is proposed in the paper. There are two major novelties in the proposed method. First, the hierarchical registration based on Wavelet transform is used. The approximate image of Wavelet transform is selected as the registered object. Second, the successive approximation registration method is used to accomplish the non-rigid medical images registration, i.e. the local regions of the couple images are registered roughly based on the thin-plate splines, then, the current rough registration result is selected as the object to be registered in the following registration procedure. Experiments show that the proposed method is effective in the registration process of the non-rigid medical images.

Three-dimensional measurement of small inner surface profiles using feature-based 3-D panoramic registration

Science.gov (United States)

Gong, Yuanzheng; Seibel, Eric J.

2017-01-01

Rapid development in the performance of sophisticated optical components, digital image sensors, and computer abilities along with decreasing costs has enabled three-dimensional (3-D) optical measurement to replace more traditional methods in manufacturing and quality control. The advantages of 3-D optical measurement, such as noncontact, high accuracy, rapid operation, and the ability for automation, are extremely valuable for inline manufacturing. However, most of the current optical approaches are eligible for exterior instead of internal surfaces of machined parts. A 3-D optical measurement approach is proposed based on machine vision for the 3-D profile measurement of tiny complex internal surfaces, such as internally threaded holes. To capture the full topographic extent (peak to valley) of threads, a side-view commercial rigid scope is used to collect images at known camera positions and orientations. A 3-D point cloud is generated with multiview stereo vision using linear motion of the test piece, which is repeated by a rotation to form additional point clouds. Registration of these point clouds into a complete reconstruction uses a proposed automated feature-based 3-D registration algorithm. The resulting 3-D reconstruction is compared with x-ray computed tomography to validate the feasibility of our proposed method for future robotically driven industrial 3-D inspection.

(SSR) markers

African Journals Online (AJOL)

SAM

2014-07-30

Jul 30, 2014 ... India and the country is currently the leading producer, consumer and exporter of ... registration with the competent authority for plant variety protection. Conventionally ... detection of duplicates, parental verification in crosses, gene tagging in .... allelic patterns as revealed by the current set of SSR markers.

Convex Hull Aided Registration Method (CHARM).

Science.gov (United States)

Fan, Jingfan; Yang, Jian; Zhao, Yitian; Ai, Danni; Liu, Yonghuai; Wang, Ge; Wang, Yongtian

2017-09-01

Non-rigid registration finds many applications such as photogrammetry, motion tracking, model retrieval, and object recognition. In this paper we propose a novel convex hull aided registration method (CHARM) to match two point sets subject to a non-rigid transformation. First, two convex hulls are extracted from the source and target respectively. Then, all points of the point sets are projected onto the reference plane through each triangular facet of the hulls. From these projections, invariant features are extracted and matched optimally. The matched feature point pairs are mapped back onto the triangular facets of the convex hulls to remove outliers that are outside any relevant triangular facet. The rigid transformation from the source to the target is robustly estimated by the random sample consensus (RANSAC) scheme through minimizing the distance between the matched feature point pairs. Finally, these feature points are utilized as the control points to achieve non-rigid deformation in the form of thin-plate spline of the entire source point set towards the target one. The experimental results based on both synthetic and real data show that the proposed algorithm outperforms several state-of-the-art ones with respect to sampling, rotational angle, and data noise. In addition, the proposed CHARM algorithm also shows higher computational efficiency compared to these methods.

Genomecmp: computer software to detect genomic rearrangements using markers

Science.gov (United States)

Kulawik, Maciej; Nowak, Robert M.

2017-08-01

Detection of genomics rearrangements is a tough task, because of the size of data to be processed. As genome sequences may consist of hundreds of millions symbols, it is not only practically impossible to compare them by hand, but it is also complex problem for computer software. The way to significantly accelerate the process is to use rearrangement detection algorithm based on unique short sequences called markers. The algorithm described in this paper develops markers using base genome and find the markers positions on other genome. The algorithm has been extended by support for ambiguity symbols. Web application with graphical user interface has been created using three-layer architecture, where users could run the task simultaneously. The accuracy and efficiency of proposed solution has been studied using generated and real data.

Retinal biometrics based on Iterative Closest Point algorithm.

Science.gov (United States)

Hatanaka, Yuji; Tajima, Mikiya; Kawasaki, Ryo; Saito, Koko; Ogohara, Kazunori; Muramatsu, Chisako; Sunayama, Wataru; Fujita, Hiroshi

2017-07-01

The pattern of blood vessels in the eye is unique to each person because it rarely changes over time. Therefore, it is well known that retinal blood vessels are useful for biometrics. This paper describes a biometrics method using the Jaccard similarity coefficient (JSC) based on blood vessel regions in retinal image pairs. The retinal image pairs were rough matched by the center of their optic discs. Moreover, the image pairs were aligned using the Iterative Closest Point algorithm based on detailed blood vessel skeletons. For registration, perspective transform was applied to the retinal images. Finally, the pairs were classified as either correct or incorrect using the JSC of the blood vessel region in the image pairs. The proposed method was applied to temporal retinal images, which were obtained in 2009 (695 images) and 2013 (87 images). The 87 images acquired in 2013 were all from persons already examined in 2009. The accuracy of the proposed method reached 100%.

Multimodal image registration based on binary gradient angle descriptor.

Science.gov (United States)

Jiang, Dongsheng; Shi, Yonghong; Yao, Demin; Fan, Yifeng; Wang, Manning; Song, Zhijian

2017-12-01

Multimodal image registration plays an important role in image-guided interventions/therapy and atlas building, and it is still a challenging task due to the complex intensity variations in different modalities. The paper addresses the problem and proposes a simple, compact, fast and generally applicable modality-independent binary gradient angle descriptor (BGA) based on the rationale of gradient orientation alignment. The BGA can be easily calculated at each voxel by coding the quadrant in which a local gradient vector falls, and it has an extremely low computational complexity, requiring only three convolutions, two multiplication operations and two comparison operations. Meanwhile, the binarized encoding of the gradient orientation makes the BGA more resistant to image degradations compared with conventional gradient orientation methods. The BGA can extract similar feature descriptors for different modalities and enable the use of simple similarity measures, which makes it applicable within a wide range of optimization frameworks. The results for pairwise multimodal and monomodal registrations between various images (T1, T2, PD, T1c, Flair) consistently show that the BGA significantly outperforms localized mutual information. The experimental results also confirm that the BGA can be a reliable alternative to the sum of absolute difference in monomodal image registration. The BGA can also achieve an accuracy of [Formula: see text], similar to that of the SSC, for the deformable registration of inhale and exhale CT scans. Specifically, for the highly challenging deformable registration of preoperative MRI and 3D intraoperative ultrasound images, the BGA achieves a similar registration accuracy of [Formula: see text] compared with state-of-the-art approaches, with a computation time of 18.3 s per case. The BGA improves the registration performance in terms of both accuracy and time efficiency. With further acceleration, the framework has the potential for

SU-D-202-04: Validation of Deformable Image Registration Algorithms for Head and Neck Adaptive Radiotherapy in Routine Clinical Setting

Energy Technology Data Exchange (ETDEWEB)

Zhang, L; Pi, Y; Chen, Z; Xu, X [University of Science and Technology of China, Hefei, Anhui (China); Wang, Z [University of Science and Technology of China, Hefei, Anhui (China); The First Affiliated Hospital of Anhui Medical University, Hefei, Anhui (China); Shi, C [Saint Vincent Medical Center, Bridgeport, CT (United States); Long, T; Luo, W; Wang, F [The First Affiliated Hospital of Anhui Medical University, Hefei, Anhui (China)

2016-06-15

Purpose: To evaluate the ROI contours and accumulated dose difference using different deformable image registration (DIR) algorithms for head and neck (H&N) adaptive radiotherapy. Methods: Eight H&N cancer patients were randomly selected from the affiliated hospital. During the treatment, patients were rescanned every week with ROIs well delineated by radiation oncologist on each weekly CT. New weekly treatment plans were also re-designed with consistent dose prescription on the rescanned CT and executed for one week on Siemens CT-on-rails accelerator. At the end, we got six weekly CT scans from CT1 to CT6 including six weekly treatment plans for each patient. The primary CT1 was set as the reference CT for DIR proceeding with the left five weekly CTs using ANACONDA and MORFEUS algorithms separately in RayStation and the external skin ROI was set to be the controlling ROI both. The entire calculated weekly dose were deformed and accumulated on corresponding reference CT1 according to the deformation vector field (DVFs) generated by the two different DIR algorithms respectively. Thus we got both the ANACONDA-based and MORFEUS-based accumulated total dose on CT1 for each patient. At the same time, we mapped the ROIs on CT1 to generate the corresponding ROIs on CT6 using ANACONDA and MORFEUS DIR algorithms. DICE coefficients between the DIR deformed and radiation oncologist delineated ROIs on CT6 were calculated. Results: For DIR accumulated dose, PTV D95 and Left-Eyeball Dmax show significant differences with 67.13 cGy and 109.29 cGy respectively (Table1). For DIR mapped ROIs, PTV, Spinal cord and Left-Optic nerve show difference with −0.025, −0.127 and −0.124 (Table2). Conclusion: Even two excellent DIR algorithms can give divergent results for ROI deformation and dose accumulation. As more and more TPS get DIR module integrated, there is an urgent need to realize the potential risk using DIR in clinical.

Image/patient registration from (partial) projection data by the Fourier phase matching method

International Nuclear Information System (INIS)

Weiguo Lu; You, J.

1999-01-01

A technique for 2D or 3D image/patient registration, PFPM (projection based Fourier phase matching method), is proposed. This technique provides image/patient registration directly from sequential tomographic projection data. The method can also deal with image files by generating 2D Radon transforms slice by slice. The registration in projection space is done by calculating a Fourier invariant (FI) descriptor for each one-dimensional projection datum, and then registering the FI descriptor by the Fourier phase matching (FPM) method. The algorithm has been tested on both synthetic and experimental data. When dealing with translated, rotated and uniformly scaled 2D image registration, the performance of the PFPM method is comparable to that of the IFPM (image based Fourier phase matching) method in robustness, efficiency, insensitivity to the offset between images, and registration time. The advantages of the former are that subpixel resolution is feasible, and it is more insensitive to image noise due to the averaging effect of the projection acquisition. Furthermore, the PFPM method offers the ability to generalize to 3D image/patient registration and to register partial projection data. By applying patient registration directly from tomographic projection data, image reconstruction is not needed in the therapy set-up verification, thus reducing computational time and artefacts. In addition, real time registration is feasible. Registration from partial projection data meets the geometry and dose requirements in many application cases and makes dynamic set-up verification possible in tomotherapy. (author)

Training nuclei detection algorithms with simple annotations

Directory of Open Access Journals (Sweden)

Henning Kost

2017-01-01

Full Text Available Background: Generating good training datasets is essential for machine learning-based nuclei detection methods. However, creating exhaustive nuclei contour annotations, to derive optimal training data from, is often infeasible. Methods: We compared different approaches for training nuclei detection methods solely based on nucleus center markers. Such markers contain less accurate information, especially with regard to nuclear boundaries, but can be produced much easier and in greater quantities. The approaches use different automated sample extraction methods to derive image positions and class labels from nucleus center markers. In addition, the approaches use different automated sample selection methods to improve the detection quality of the classification algorithm and reduce the run time of the training process. We evaluated the approaches based on a previously published generic nuclei detection algorithm and a set of Ki-67-stained breast cancer images. Results: A Voronoi tessellation-based sample extraction method produced the best performing training sets. However, subsampling of the extracted training samples was crucial. Even simple class balancing improved the detection quality considerably. The incorporation of active learning led to a further increase in detection quality. Conclusions: With appropriate sample extraction and selection methods, nuclei detection algorithms trained on the basis of simple center marker annotations can produce comparable quality to algorithms trained on conventionally created training sets.

SU-E-J-209: Verification of 3D Surface Registration Between Stereograms and CT Images

Energy Technology Data Exchange (ETDEWEB)

Han, T; Gifford, K [UT MD Anderson Cancer Center, Houston, TX (United States); Smith, B [MD Anderson Cancer Center, Houston, TX (United States); Salehpour, M [M.D. Anderson Cancer Center, Houston, TX (United States)

2014-06-01

Purpose: Stereography can provide a visualization of the skin surface for radiation therapy patients. The aim of this study was to verify the registration algorithm in a commercial image analysis software, 3dMDVultus, for the fusion of stereograms and CT images. Methods: CT and stereographic scans were acquired of a head phantom and a deformable phantom. CT images were imported in 3dMDVultus and the surface contours were generated by threshold segmentation. Stereograms were reconstructed in 3dMDVultus. The resulting surfaces were registered with Vultus algorithm and then exported to in-house registration software and compared with four algorithms: rigid, affine, non-rigid iterative closest point (ICP) and b-spline algorithm. RMS (root-mean-square residuals of the surface point distances) error between the registered CT and stereogram surfaces was calculated and analyzed. Results: For the head phantom, the maximum RMS error between registered CT surfaces to stereogram was 6.6 mm for Vultus algorithm, whereas the mean RMS error was 0.7 mm. For the deformable phantom, the maximum RMS error was 16.2 mm for Vultus algorithm, whereas the mean RMS error was 4.4 mm. Non-rigid ICP demonstrated the best registration accuracy, as the mean of RMS errors were both within 1 mm. Conclusion: The accuracy of registration algorithm in 3dMDVultus was verified and exceeded RMS of 2 mm for deformable cases. Non-rigid ICP and b-spline algorithms improve the registration accuracy for both phantoms, especially in deformable one. For those patients whose body habitus deforms during radiation therapy, more advanced nonrigid algorithms need to be used.

Fast-MICP for frameless image-guided surgery