WorldWideScience

Sample records for non-rigid registration algorithm

  1. 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...

  2. Optimized imaging using non-rigid registration

    International Nuclear Information System (INIS)

    Berkels, Benjamin; Binev, Peter; Blom, Douglas A.; Dahmen, Wolfgang; Sharpley, Robert C.; Vogt, Thomas

    2014-01-01

    The extraordinary improvements of modern imaging devices offer access to data with unprecedented information content. However, widely used image processing methodologies fall far short of exploiting the full breadth of information offered by numerous types of scanning probe, optical, and electron microscopies. In many applications, it is necessary to keep measurement intensities below a desired threshold. We propose a methodology for extracting an increased level of information by processing a series of data sets suffering, in particular, from high degree of spatial uncertainty caused by complex multiscale motion during the acquisition process. An important role is played by a non-rigid pixel-wise registration method that can cope with low signal-to-noise ratios. This is accompanied by formulating objective quality measures which replace human intervention and visual inspection in the processing chain. Scanning transmission electron microscopy of siliceous zeolite material exhibits the above-mentioned obstructions and therefore serves as orientation and a test of our procedures. - Highlights: • Developed a new process for extracting more information from a series of STEM images. • An objective non-rigid registration process copes with distortions. • Images of zeolite Y show retrieval of all information available from the data set. • Quantitative measures of registration quality were implemented. • Applicable to any serially acquired data, e.g. STM, AFM, STXM, etc

  3. 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

  4. 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.

  5. 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.

  6. Non-rigid registration by geometry-constrained diffusion

    DEFF Research Database (Denmark)

    Andresen, Per Rønsholt; Nielsen, Mads

    1999-01-01

    Assume that only partial knowledge about a non-rigid registration is given so that certain point, curves, or surfaces in one 3D image map to certain points, curves, or surfaces in another 3D image. We are facing the aperture problem because along the curves and surfaces, point correspondences...

  7. 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

  8. 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.

  9. Vision based tunnel inspection using non-rigid registration

    Science.gov (United States)

    Badshah, Amir; Ullah, Shan; Shahzad, Danish

    2015-04-01

    Growing numbers of long tunnels across the globe has increased the need for safety measurements and inspections of tunnels in these days. To avoid serious damages, tunnel inspection is highly recommended at regular intervals of time to find any deformations or cracks at the right time. While following the stringent safety and tunnel accessibility standards, conventional geodetic surveying using techniques of civil engineering and other manual and mechanical methods are time consuming and results in troublesome of routine life. An automatic tunnel inspection by image processing techniques using non rigid registration has been proposed. There are many other image processing methods used for image registration purposes. Most of the processes are operation of images in its spatial domain like finding edges and corners by Harris edge detection method. These methods are quite time consuming and fail for some or other reasons like for blurred or images with noise. Due to use of image features directly by these methods in the process, are known by the group, correlation by image features. The other method is featureless correlation, in which the images are converted into its frequency domain and then correlated with each other. The shift in spatial domain is the same as in frequency domain, but the processing is order faster than in spatial domain. In the proposed method modified normalized phase correlation has been used to find any shift between two images. As pre pre-processing the tunnel images i.e. reference and template are divided into small patches. All these relative patches are registered by the proposed modified normalized phase correlation. By the application of the proposed algorithm we get the pixel movement of the images. And then these pixels shifts are converted to measuring units like mm, cm etc. After the complete process if there is any shift in the tunnel at described points are located.

  10. Non-rigid ultrasound image registration using generalized relaxation labeling process

    Science.gov (United States)

    Lee, Jong-Ha; Seong, Yeong Kyeong; Park, MoonHo; Woo, Kyoung-Gu; Ku, Jeonghun; Park, Hee-Jun

    2013-03-01

    This research proposes a novel non-rigid registration method for ultrasound images. The most predominant anatomical features in medical images are tissue boundaries, which appear as edges. In ultrasound images, however, other features can be identified as well due to the specular reflections that appear as bright lines superimposed on the ideal edge location. In this work, an image's local phase information (via the frequency domain) is used to find the ideal edge location. The generalized relaxation labeling process is then formulated to align the feature points extracted from the ideal edge location. In this work, the original relaxation labeling method was generalized by taking n compatibility coefficient values to improve non-rigid registration performance. This contextual information combined with a relaxation labeling process is used to search for a correspondence. Then the transformation is calculated by the thin plate spline (TPS) model. These two processes are iterated until the optimal correspondence and transformation are found. We have tested our proposed method and the state-of-the-art algorithms with synthetic data and bladder ultrasound images of in vivo human subjects. Experiments show that the proposed method improves registration performance significantly, as compared to other state-of-the-art non-rigid registration algorithms.

  11. 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

  12. 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

  13. Robust feature estimation by non-rigid hierarchical image registration and its application in disparity measurement

    Science.gov (United States)

    Badshah, Amir; Choudhry, Aadil Jaleel; Ullah, Shan

    2017-03-01

    Industries are moving towards automation in order to increase productivity and ensure quality. Variety of electronic and electromagnetic systems are being employed to assist human operator in fast and accurate quality inspection of products. Majority of these systems are equipped with cameras and rely on diverse image processing algorithms. Information is lost in 2D image, therefore acquiring accurate 3D data from 2D images is an open issue. FAST, SURF and SIFT are well-known spatial domain techniques for features extraction and henceforth image registration to find correspondence between images. The efficiency of these methods is measured in terms of the number of perfect matches found. A novel fast and robust technique for stereo-image processing is proposed. It is based on non-rigid registration using modified normalized phase correlation. The proposed method registers two images in hierarchical fashion using quad-tree structure. The registration process works through global to local level resulting in robust matches even in presence of blur and noise. The computed matches can further be utilized to determine disparity and depth for industrial product inspection. The same can be used in driver assistance systems. The preliminary tests on Middlebury dataset produced satisfactory results. The execution time for a 413 x 370 stereo-pair is 500ms approximately on a low cost DSP.

  14. Validation of non-rigid point-set registration methods using a porcine bladder pelvic phantom

    Science.gov (United States)

    Zakariaee, Roja; Hamarneh, Ghassan; Brown, Colin J.; Spadinger, Ingrid

    2016-01-01

    The problem of accurate dose accumulation in fractionated radiotherapy treatment for highly deformable organs, such as bladder, has garnered increasing interest over the past few years. However, more research is required in order to find a robust and efficient solution and to increase the accuracy over the current methods. The purpose of this study was to evaluate the feasibility and accuracy of utilizing non-rigid (affine or deformable) point-set registration in accumulating dose in bladder of different sizes and shapes. A pelvic phantom was built to house an ex vivo porcine bladder with fiducial landmarks adhered onto its surface. Four different volume fillings of the bladder were used (90, 180, 360 and 480 cc). The performance of MATLAB implementations of five different methods were compared, in aligning the bladder contour point-sets. The approaches evaluated were coherent point drift (CPD), gaussian mixture model, shape context, thin-plate spline robust point matching (TPS-RPM) and finite iterative closest point (ICP-finite). The evaluation metrics included registration runtime, target registration error (TRE), root-mean-square error (RMS) and Hausdorff distance (HD). The reference (source) dataset was alternated through all four points-sets, in order to study the effect of reference volume on the registration outcomes. While all deformable algorithms provided reasonable registration results, CPD provided the best TRE values (6.4 mm), and TPS-RPM yielded the best mean RMS and HD values (1.4 and 6.8 mm, respectively). ICP-finite was the fastest technique and TPS-RPM, the slowest.

  15. Validation of non-rigid point-set registration methods using a porcine bladder pelvic phantom

    International Nuclear Information System (INIS)

    Zakariaee, Roja; Hamarneh, Ghassan; Brown, Colin J; Spadinger, Ingrid

    2016-01-01

    The problem of accurate dose accumulation in fractionated radiotherapy treatment for highly deformable organs, such as bladder, has garnered increasing interest over the past few years. However, more research is required in order to find a robust and efficient solution and to increase the accuracy over the current methods. The purpose of this study was to evaluate the feasibility and accuracy of utilizing non-rigid (affine or deformable) point-set registration in accumulating dose in bladder of different sizes and shapes. A pelvic phantom was built to house an ex vivo porcine bladder with fiducial landmarks adhered onto its surface. Four different volume fillings of the bladder were used (90, 180, 360 and 480 cc). The performance of MATLAB implementations of five different methods were compared, in aligning the bladder contour point-sets. The approaches evaluated were coherent point drift (CPD), gaussian mixture model, shape context, thin-plate spline robust point matching (TPS-RPM) and finite iterative closest point (ICP-finite). The evaluation metrics included registration runtime, target registration error (TRE), root-mean-square error (RMS) and Hausdorff distance (HD). The reference (source) dataset was alternated through all four points-sets, in order to study the effect of reference volume on the registration outcomes. While all deformable algorithms provided reasonable registration results, CPD provided the best TRE values (6.4 mm), and TPS-RPM yielded the best mean RMS and HD values (1.4 and 6.8 mm, respectively). ICP-finite was the fastest technique and TPS-RPM, the slowest. (paper)

  16. Harmonic Auto-Regularization for Non Rigid Groupwise Registration in Cardiac Magnetic Resonance Imaging

    Energy Technology Data Exchange (ETDEWEB)

    Sanz-Estebanez, S.; Royuela-del-Val, J.; Sevilla, T.; Revilla-Orodea, A.; Aja-Fernandez, S.; Alberola-Lopez, C.

    2016-07-01

    In this paper we present a new approach for non rigid groupwise registration of cardiac magnetic resonance images by means of free-form deformations, imposing a prior harmonic deformation assumption. The procedure proposes a primal-dual framework for solving an equality constrained minimization problem, which allows an automatic estimate of the trade-off between image fidelity and the Laplacian smoothness terms for each iteration. The method has been applied to both a 4D extended cardio-torso phantom and to a set of voluntary patients. The accuracy of the method has been measured for the synthetic experiment as the difference in modulus between the estimated displacement field and the ground truth; as for the real data, we have calculated the Dice coefficient between the contour manual delineations provided by two cardiologists at end systolic phase and those provided by them at end diastolic phase and, consequently propagated by the registration algorithm to the systolic instant. The automatic procedure turns out to be competitive in motion compensation with other methods even though their parameters have been previously set for optimal performance in different scenarios. (Author)

  17. [Non-rigid medical image registration based on mutual information and thin-plate spline].

    Science.gov (United States)

    Cao, Guo-gang; Luo, Li-min

    2009-01-01

    To get precise and complete details, the contrast in different images is needed in medical diagnosis and computer assisted treatment. The image registration is the basis of contrast, but the regular rigid registration does not satisfy the clinic requirements. A non-rigid medical image registration method based on mutual information and thin-plate spline was present. Firstly, registering two images globally based on mutual information; secondly, dividing reference image and global-registered image into blocks and registering them; then getting the thin-plate spline transformation according to the shift of blocks' center; finally, applying the transformation to the global-registered image. The results show that the method is more precise than the global rigid registration based on mutual information and it reduces the complexity of getting control points and satisfy the clinic requirements better by getting control points of the thin-plate transformation automatically.

  18. 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.

  19. CT-3DRA registration for radiosurgery treatments: a comparison among rigid, affine and non rigid approaches

    International Nuclear Information System (INIS)

    Stancanello, J.; Loeckx, D.; Francescon, P.; Calvedon, C.; Avanzo, M.; Cora, S.; Scalchi, P.; Cerveri, P.; Ferrigno, G.

    2004-01-01

    This work aims at comparing rigid, affine and Local Non Rigid (LNR) CT-3D Rotational Angiography (CT-3DRA) registrations based on mutual information. 10 cranial and 1 spinal cases have been registered by rigid and affine transformations; while LNR has been applied to the cases where residual deformation must be corrected. An example of CT-3DRA registration without regularization term and an example of LNR using the similarity criterion and the regularization term as well as 3D superposition of the 3DRA before and after the registration without the regularization term are presented. All the registrations performed by rigid transformation converged to an acceptable solution. The results about the robustness test in axial direction are reported. Conclusions: For cranial cases, affine transformation endowed with threshold-segmentation pre-processing can be considered the most favourable solution for almost all registrations; for some cases, LNR provides more accurate results. For the spinal case rigid transformation is the most suitable when immobilizing patient during examinations; in this case the increase of accuracy by using LNR registrations seems to be not significant

  20. Non-rigid contour-to-pixel registration of photographic and quantitative light-induced fluorescence imaging of decalcified teeth

    Science.gov (United States)

    Berkels, Benjamin; Deserno, Thomas; Ehrlich, Eva E.; Fritz, Ulrike B.; Sirazitdinova, Ekaterina; Tatano, Rosalia

    2016-03-01

    Quantitative light-induced fluorescence (QLF) is widely used to assess the damage of a tooth due to decalcification. In digital photographs, decalcification appears as white spot lesions, i.e. white spots on the tooth surface. We propose a novel multimodal registration approach for the matching of digital photographs and QLF images of decalcified teeth. The registration is based on the idea of contour-to-pixel matching. Here, the curve, which represents the shape of the tooth, is extracted from the QLF image using a contour segmentation by binarization and morphological processing. This curve is aligned to the photo with a non-rigid variational registration approach. Thus, the registration problem is formulated as minimization problem with an objective function that consists of a data term and a regularizer for the deformation. To construct the data term, the photo is pointwise classified into tooth and non-tooth regions. Then, the signed distance function of the tooth region allows to measure the mismatch between curve and photo. As regularizer a higher order, linear elastic prior is used. The resulting minimization problem is solved numerically using bilinear Finite Elements for the spatial discretization and the Gauss-Newton algorithm. The evaluation is based on 150 image pairs, where an average of 5 teeth have been captured from 32 subjects. All registrations have been confirmed correctly by a dental expert. The contour-to-pixel methods can directly be used in 3D for surface-to-voxel tasks.

  1. 3D non-rigid surface-based MR-TRUS registration for image-guided prostate biopsy

    Science.gov (United States)

    Sun, Yue; Qiu, Wu; Romagnoli, Cesare; Fenster, Aaron

    2014-03-01

    Two dimensional (2D) transrectal ultrasound (TRUS) guided prostate biopsy is the standard approach for definitive diagnosis of prostate cancer (PCa). However, due to the lack of image contrast of prostate tumors needed to clearly visualize early-stage PCa, prostate biopsy often results in false negatives, requiring repeat biopsies. Magnetic Resonance Imaging (MRI) has been considered to be a promising imaging modality for noninvasive identification of PCa, since it can provide a high sensitivity and specificity for the detection of early stage PCa. Our main objective is to develop and validate a registration method of 3D MR-TRUS images, allowing generation of volumetric 3D maps of targets identified in 3D MR images to be biopsied using 3D TRUS images. Our registration method first makes use of an initial rigid registration of 3D MR images to 3D TRUS images using 6 manually placed approximately corresponding landmarks in each image. Following the manual initialization, two prostate surfaces are segmented from 3D MR and TRUS images and then non-rigidly registered using a thin-plate spline (TPS) algorithm. The registration accuracy was evaluated using 4 patient images by measuring target registration error (TRE) of manually identified corresponding intrinsic fiducials (calcifications and/or cysts) in the prostates. Experimental results show that the proposed method yielded an overall mean TRE of 2.05 mm, which is favorably comparable to a clinical requirement for an error of less than 2.5 mm.

  2. Non-rigid registration of breast surfaces using the laplace and diffusion equations

    Directory of Open Access Journals (Sweden)

    Ou Jao J

    2010-02-01

    Full Text Available Abstract A semi-automated, non-rigid breast surface registration method is presented that involves solving the Laplace or diffusion equations over undeformed and deformed breast surfaces. The resulting potential energy fields and isocontours are used to establish surface correspondence. This novel surface-based method, which does not require intensity images, anatomical landmarks, or fiducials, is compared to a gold standard of thin-plate spline (TPS interpolation. Realistic finite element simulations of breast compression and further testing against a tissue-mimicking phantom demonstrate that this method is capable of registering surfaces experiencing 6 - 36 mm compression to within a mean error of 0.5 - 5.7 mm.

  3. Improving supervised classification accuracy using non-rigid multimodal image registration: detecting prostate cancer

    Science.gov (United States)

    Chappelow, Jonathan; Viswanath, Satish; Monaco, James; Rosen, Mark; Tomaszewski, John; Feldman, Michael; Madabhushi, Anant

    2008-03-01

    Computer-aided diagnosis (CAD) systems for the detection of cancer in medical images require precise labeling of training data. For magnetic resonance (MR) imaging (MRI) of the prostate, training labels define the spatial extent of prostate cancer (CaP); the most common source for these labels is expert segmentations. When ancillary data such as whole mount histology (WMH) sections, which provide the gold standard for cancer ground truth, are available, the manual labeling of CaP can be improved by referencing WMH. However, manual segmentation is error prone, time consuming and not reproducible. Therefore, we present the use of multimodal image registration to automatically and accurately transcribe CaP from histology onto MRI following alignment of the two modalities, in order to improve the quality of training data and hence classifier performance. We quantitatively demonstrate the superiority of this registration-based methodology by comparing its results to the manual CaP annotation of expert radiologists. Five supervised CAD classifiers were trained using the labels for CaP extent on MRI obtained by the expert and 4 different registration techniques. Two of the registration methods were affi;ne schemes; one based on maximization of mutual information (MI) and the other method that we previously developed, Combined Feature Ensemble Mutual Information (COFEMI), which incorporates high-order statistical features for robust multimodal registration. Two non-rigid schemes were obtained by succeeding the two affine registration methods with an elastic deformation step using thin-plate splines (TPS). In the absence of definitive ground truth for CaP extent on MRI, classifier accuracy was evaluated against 7 ground truth surrogates obtained by different combinations of the expert and registration segmentations. For 26 multimodal MRI-WMH image pairs, all four registration methods produced a higher area under the receiver operating characteristic curve compared to that

  4. 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.

  5. Non-rigid point set registration of curves: registration of the superficial vessel centerlines of the brain

    Science.gov (United States)

    Marreiros, Filipe M. M.; Wang, Chunliang; Rossitti, Sandro; Smedby, Örjan

    2016-03-01

    In this study we present a non-rigid point set registration for 3D curves (composed by 3D set of points). The method was evaluated in the task of registration of 3D superficial vessels of the brain where it was used to match vessel centerline points. It consists of a combination of the Coherent Point Drift (CPD) and the Thin-Plate Spline (TPS) semilandmarks. The CPD is used to perform the initial matching of centerline 3D points, while the semilandmark method iteratively relaxes/slides the points. For the evaluation, a Magnetic Resonance Angiography (MRA) dataset was used. Deformations were applied to the extracted vessels centerlines to simulate brain bulging and sinking, using a TPS deformation where a few control points were manipulated to obtain the desired transformation (T1). Once the correspondences are known, the corresponding points are used to define a new TPS deformation(T2). The errors are measured in the deformed space, by transforming the original points using T1 and T2 and measuring the distance between them. To simulate cases where the deformed vessel data is incomplete, parts of the reference vessels were cut and then deformed. Furthermore, anisotropic normally distributed noise was added. The results show that the error estimates (root mean square error and mean error) are below 1 mm, even in the presence of noise and incomplete data.

  6. Topology preserving non-rigid image registration using time-varying elasticity model for MRI brain volumes.

    Science.gov (United States)

    Ahmad, Sahar; Khan, Muhammad Faisal

    2015-12-01

    In this paper, we present a new non-rigid image registration method that imposes a topology preservation constraint on the deformation. We propose to incorporate the time varying elasticity model into the deformable image matching procedure and constrain the Jacobian determinant of the transformation over the entire image domain. The motion of elastic bodies is governed by a hyperbolic partial differential equation, generally termed as elastodynamics wave equation, which we propose to use as a deformation model. We carried out clinical image registration experiments on 3D magnetic resonance brain scans from IBSR database. The results of the proposed registration approach in terms of Kappa index and relative overlap computed over the subcortical structures were compared against the existing topology preserving non-rigid image registration methods and non topology preserving variant of our proposed registration scheme. The Jacobian determinant maps obtained with our proposed registration method were qualitatively and quantitatively analyzed. The results demonstrated that the proposed scheme provides good registration accuracy with smooth transformations, thereby guaranteeing the preservation of topology. Copyright © 2015 Elsevier Ltd. All rights reserved.

  7. A batch Algorithm for Implicit Non-Rigid Shape and Motion Recovery

    DEFF Research Database (Denmark)

    Bartoli, Adrien; Olsen, Søren Ingvor

    2005-01-01

    The recovery of 3D shape and camera motion for non-rigid scenes from single-camera video footage is a very important problem in computer vision. The low-rank shape model consists in regarding the deformations as linear combinations of basis shapes. Most algorithms for reconstructing the parameters...... of this model along with camera motion are based on three main steps. Given point tracks and the rank, or equivalently the number of basis shapes, they factorize a measurement matrix containing all point tracks, from which the camera motion and basis shapes are extracted and refined in a bundle adjustment...

  8. Distortion Correction in Fetal EPI Using Non-Rigid Registration With a Laplacian Constraint.

    Science.gov (United States)

    Kuklisova-Murgasova, Maria; Lockwood Estrin, Georgia; Nunes, Rita G; Malik, Shaihan J; Rutherford, Mary A; Rueckert, Daniel; Hajnal, Joseph V

    2018-01-01

    Geometric distortion induced by the main B0 field disrupts the consistency of fetal echo planar imaging (EPI) data, on which diffusion and functional magnetic resonance imaging is based. In this paper, we present a novel data-driven method for simultaneous motion and distortion correction of fetal EPI. A motion-corrected and reconstructed T2 weighted single shot fast spin echo (ssFSE) volume is used as a model of undistorted fetal brain anatomy. Our algorithm interleaves two registration steps: estimation of fetal motion parameters by aligning EPI slices to the model; and deformable registration of EPI slices to slices simulated from the undistorted model to estimate the distortion field. The deformable registration is regularized by a physically inspired Laplacian constraint, to model distortion induced by a source-free background B0 field. Our experiments show that distortion correction significantly improves consistency of reconstructed EPI volumes with ssFSE volumes. In addition, the estimated distortion fields are consistent with fields calculated from acquired field maps, and the Laplacian constraint is essential for estimation of plausible distortion fields. The EPI volumes reconstructed from different scans of the same subject were more consistent when the proposed method was used in comparison with EPI volumes reconstructed from data distortion corrected using a separately acquired B0 field map.

  9. Validation of TMJ osteoarthritis synthetic defect database via non-rigid registration

    Science.gov (United States)

    Paniagua, Beatriz; Pera, Juliette; Budin, Francois; Gomes, Liliane; Styner, Martin; Lucia, Cevidanes; Nguyen, Tung

    2015-03-01

    Temporomandibular joint (TMJ) disorders are a group of conditions that cause pain and dysfunction in the jaw joint and the muscles controlling jaw movement. However, diagnosis and treatment of these conditions remain controversial. To date, there is no single sign, symptom, or test that can clearly diagnose early stages of osteoarthritis (OA). Instead, the diagnosis is based on a consideration of several factors, including radiological evaluation. The current radiological diagnosis scores of TMJ pathology are subject to misdiagnosis. We believe these scores are limited by the acquisition procedures, such as oblique cuts of the CT and head positioning errors, and can lead to incorrect diagnoses of flattening of the head of the condyle, formation of osteophytes, or condylar pitting. This study consists of creating and validating a methodological framework to simulate defects in CBCT scans of known location and size, in order to create synthetic TMJ OA database. User-generated defects were created using a non-rigid deformation protocol in CBCT. All segmentation evaluation, surface distances and linear distances from the user-generated to the simulated defects showed our methodological framework to be very precise and within a voxel (0.5 mm) of magnitude. A TMJ OA synthetic database will be created next, and evaluated by expert radiologists, and this will serve to evaluate how sensitive the current radiological diagnosis tools are.

  10. Non-rigid registration of 3D ultrasound for neurosurgery using automatic feature detection and matching.

    Science.gov (United States)

    Machado, Inês; Toews, Matthew; Luo, Jie; Unadkat, Prashin; Essayed, Walid; George, Elizabeth; Teodoro, Pedro; Carvalho, Herculano; Martins, Jorge; Golland, Polina; Pieper, Steve; Frisken, Sarah; Golby, Alexandra; Wells, William

    2018-06-04

    The brain undergoes significant structural change over the course of neurosurgery, including highly nonlinear deformation and resection. It can be informative to recover the spatial mapping between structures identified in preoperative surgical planning and the intraoperative state of the brain. We present a novel feature-based method for achieving robust, fully automatic deformable registration of intraoperative neurosurgical ultrasound images. A sparse set of local image feature correspondences is first estimated between ultrasound image pairs, after which rigid, affine and thin-plate spline models are used to estimate dense mappings throughout the image. Correspondences are derived from 3D features, distinctive generic image patterns that are automatically extracted from 3D ultrasound images and characterized in terms of their geometry (i.e., location, scale, and orientation) and a descriptor of local image appearance. Feature correspondences between ultrasound images are achieved based on a nearest-neighbor descriptor matching and probabilistic voting model similar to the Hough transform. Experiments demonstrate our method on intraoperative ultrasound images acquired before and after opening of the dura mater, during resection and after resection in nine clinical cases. A total of 1620 automatically extracted 3D feature correspondences were manually validated by eleven experts and used to guide the registration. Then, using manually labeled corresponding landmarks in the pre- and post-resection ultrasound images, we show that our feature-based registration reduces the mean target registration error from an initial value of 3.3 to 1.5 mm. This result demonstrates that the 3D features promise to offer a robust and accurate solution for 3D ultrasound registration and to correct for brain shift in image-guided neurosurgery.

  11. Two Phase Non-Rigid Multi-Modal Image Registration Using Weber Local Descriptor-Based Similarity Metrics and Normalized Mutual Information

    Directory of Open Access Journals (Sweden)

    Feng Yang

    2013-06-01

    Full Text Available Non-rigid multi-modal image registration plays an important role in medical image processing and analysis. Existing image registration methods based on similarity metrics such as mutual information (MI and sum of squared differences (SSD cannot achieve either high registration accuracy or high registration efficiency. To address this problem, we propose a novel two phase non-rigid multi-modal image registration method by combining Weber local descriptor (WLD based similarity metrics with the normalized mutual information (NMI using the diffeomorphic free-form deformation (FFD model. The first phase aims at recovering the large deformation component using the WLD based non-local SSD (wldNSSD or weighted structural similarity (wldWSSIM. Based on the output of the former phase, the second phase is focused on getting accurate transformation parameters related to the small deformation using the NMI. Extensive experiments on T1, T2 and PD weighted MR images demonstrate that the proposed wldNSSD-NMI or wldWSSIM-NMI method outperforms the registration methods based on the NMI, the conditional mutual information (CMI, the SSD on entropy images (ESSD and the ESSD-NMI in terms of registration accuracy and computation efficiency.

  12. Non-rigid registration of a 3D ultrasound and a MR image data set of the female pelvic floor using a biomechanical model

    Directory of Open Access Journals (Sweden)

    Rexilius Jan

    2005-03-01

    Full Text Available Abstract Background The visual combination of different modalities is essential for many medical imaging applications in the field of Computer-Assisted medical Diagnosis (CAD to enhance the clinical information content. Clinically, incontinence is a diagnosis with high clinical prevalence and morbidity rate. The search for a method to identify risk patients and to control the success of operations is still a challenging task. The conjunction of magnetic resonance (MR and 3D ultrasound (US image data sets could lead to a new clinical visual representation of the morphology as we show with corresponding data sets of the female anal canal with this paper. Methods We present a feasibility study for a non-rigid registration technique based on a biomechanical model for MR and US image data sets of the female anal canal as a base for a new innovative clinical visual representation. Results It is shown in this case study that the internal and external sphincter region could be registered elastically and the registration partially corrects the compression induced by the ultrasound transducer, so the MR data set showing the native anatomy is used as a frame for the US data set showing the same region with higher resolution but distorted by the transducer Conclusion The morphology is of special interest in the assessment of anal incontinence and the non-rigid registration of normal clinical MR and US image data sets is a new field of the adaptation of this method incorporating the advantages of both technologies.

  13. A new technique for noise reduction at coronary CT angiography with multi-phase data-averaging and non-rigid image registration

    Energy Technology Data Exchange (ETDEWEB)

    Tatsugami, Fuminari; Higaki, Toru; Nakamura, Yuko; Yamagami, Takuji; Date, Shuji; Awai, Kazuo [Hiroshima University, Department of Diagnostic Radiology, Minami-ku, Hiroshima (Japan); Fujioka, Chikako; Kiguchi, Masao [Hiroshima University, Department of Radiology, Minami-ku, Hiroshima (Japan); Kihara, Yasuki [Hiroshima University, Department of Cardiovascular Medicine, Minami-ku, Hiroshima (Japan)

    2015-01-15

    To investigate the feasibility of a newly developed noise reduction technique at coronary CT angiography (CTA) that uses multi-phase data-averaging and non-rigid image registration. Sixty-five patients underwent coronary CTA with prospective ECG-triggering. The range of the phase window was set at 70-80 % of the R-R interval. First, three sets of consecutive volume data at 70 %, 75 % and 80 % of the R-R interval were prepared. Second, we applied non-rigid registration to align the 70 % and 80 % images to the 75 % image. Finally, we performed weighted averaging of the three images and generated a de-noised image. The image noise and contrast-to-noise ratio (CNR) in the proximal coronary arteries between the conventional 75 % and the de-noised images were compared. Two radiologists evaluated the image quality using a 5-point scale (1, poor; 5, excellent). On de-noised images, mean image noise was significantly lower than on conventional 75 % images (18.3 HU ± 2.6 vs. 23.0 HU ± 3.3, P < 0.01) and the CNR was significantly higher (P < 0.01). The mean image quality score for conventional 75 % and de-noised images was 3.9 and 4.4, respectively (P < 0.01). Our method reduces image noise and improves image quality at coronary CTA. (orig.)

  14. Non-rigid isometric ICP: A practical registration method for the analysis and compensation of form errors in production engineering

    KAUST Repository

    Sacharow, Alexei

    2011-12-01

    The unprecedented success of the iterative closest point (ICP) method for registration in geometry processing and related fields can be attributed to its efficiency, robustness, and wide spectrum of applications. Its use is however quite limited as soon as the objects to be registered arise from each other by a transformation significantly different from a Euclidean motion. We present a novel variant of ICP, tailored for the specific needs of production engineering, which registers a triangle mesh with a second surface model of arbitrary digital representation. Our method inherits most of ICP\\'s practical advantages but is capable of detecting medium-strength bendings i.e. isometric deformations. Initially, the algorithm assigns to all vertices in the source their closest point on the target mesh and then iteratively establishes isometry, a process which, very similar to ICP, requires intermediate re-projections. A NURBS-based technique for applying the resulting deformation to arbitrary instances of the source geometry, other than the very mesh used for correspondence estimation, is described before we present numerical results on synthetic and real data to underline the viability of our approach in comparison with others. © 2011 Elsevier Ltd. All rights reserved.

  15. Value of a probabilistic atlas in medical image segmentation regarding non-rigid registration of abdominal CT scans

    Science.gov (United States)

    Park, Hyunjin; Meyer, Charles R.

    2012-10-01

    A probabilistic atlas provides important information to help segmentation and registration applications in medical image analysis. We construct a probabilistic atlas by picking a target geometry and mapping other training scans onto that target and then summing the results into one probabilistic atlas. By choosing an atlas space close to the desired target, we construct an atlas that represents the population well. Image registration used to map one image geometry onto another is a primary task in atlas building. One of the main parameters of registration is the choice of degrees of freedom (DOFs) of the geometric transform. Herein, we measure the effect of the registration's DOFs on the segmentation performance of the resulting probabilistic atlas. Twenty-three normal abdominal CT scans were used, and four organs (liver, spinal cord, left and right kidneys) were segmented for each scan. A well-known manifold learning method, ISOMAP, was used to find the best target space to build an atlas. In summary, segmentation performance was high for high DOF registrations regardless of the chosen target space, while segmentation performance was lowered for low DOF registrations if a target space was far from the best target space. At the 0.05 level of statistical significance, there were no significant differences at high DOF registrations while there were significant differences at low DOF registrations when choosing different targets.

  16. Performance evaluation of 2D image registration algorithms with the numeric image registration and comparison platform

    International Nuclear Information System (INIS)

    Gerganov, G.; Kuvandjiev, V.; Dimitrova, I.; Mitev, K.; Kawrakow, I.

    2012-01-01

    The objective of this work is to present the capabilities of the NUMERICS web platform for evaluation of the performance of image registration algorithms. The NUMERICS platform is a web accessible tool which provides access to dedicated numerical algorithms for registration and comparison of medical images (http://numerics.phys.uni-sofia.bg). The platform allows comparison of noisy medical images by means of different types of image comparison algorithms, which are based on statistical tests for outliers. The platform also allows 2D image registration with different techniques like Elastic Thin-Plate Spline registration, registration based on rigid transformations, affine transformations, as well as non-rigid image registration based on Mobius transformations. In this work we demonstrate how the platform can be used as a tool for evaluation of the quality of the image registration process. We demonstrate performance evaluation of a deformable image registration technique based on Mobius transformations. The transformations are applied with appropriate cost functions like: Mutual information, Correlation coefficient, Sum of Squared Differences. The accent is on the results provided by the platform to the user and their interpretation in the context of the performance evaluation of 2D image registration. The NUMERICS image registration and image comparison platform provides detailed statistical information about submitted image registration jobs and can be used to perform quantitative evaluation of the performance of different image registration techniques. (authors)

  17. The influence of non-rigid anatomy and patient positioning on endoscopy-CT image registration in the head and neck.

    Science.gov (United States)

    Ingram, W Scott; Yang, Jinzhong; Wendt, Richard; Beadle, Beth M; Rao, Arvind; Wang, Xin A; Court, Laurence E

    2017-08-01

    To assess the influence of non-rigid anatomy and differences in patient positioning between CT acquisition and endoscopic examination on endoscopy-CT image registration in the head and neck. Radiotherapy planning CTs and 31-35 daily treatment-room CTs were acquired for nineteen patients. Diagnostic CTs were acquired for thirteen of the patients. The surfaces of the airways were segmented on all scans and triangular meshes were created to render virtual endoscopic images with a calibrated pinhole model of an endoscope. The virtual images were used to take projective measurements throughout the meshes, with reference measurements defined as those taken on the planning CTs and test measurements defined as those taken on the daily or diagnostic CTs. The influence of non-rigid anatomy was quantified by 3D distance errors between reference and test measurements on the daily CTs, and the influence of patient positioning was quantified by 3D distance errors between reference and test measurements on the diagnostic CTs. The daily CT measurements were also used to investigate the influences of camera-to-surface distance, surface angle, and the interval of time between scans. Average errors in the daily CTs were 0.36 ± 0.61 cm in the nasal cavity, 0.58 ± 0.83 cm in the naso- and oropharynx, and 0.47 ± 0.73 cm in the hypopharynx and larynx. Average errors in the diagnostic CTs in those regions were 0.52 ± 0.69 cm, 0.65 ± 0.84 cm, and 0.69 ± 0.90 cm, respectively. All CTs had errors heavily skewed towards 0, albeit with large outliers. Large camera-to-surface distances were found to increase the errors, but the angle at which the camera viewed the surface had no effect. The errors in the Day 1 and Day 15 CTs were found to be significantly smaller than those in the Day 30 CTs (P projective measurement errors. In general, these errors are largest when the camera is in the superior pharynx, where it sees large distances and a lot of muscle motion. The

  18. Non-Rigid Contour-Based Registration of Cell Nuclei in 2-D Live Cell Microscopy Images Using a Dynamic Elasticity Model.

    Science.gov (United States)

    Sorokin, Dmitry V; Peterlik, Igor; Tektonidis, Marco; Rohr, Karl; Matula, Pavel

    2018-01-01

    The analysis of the pure motion of subnuclear structures without influence of the cell nucleus motion and deformation is essential in live cell imaging. In this paper, we propose a 2-D contour-based image registration approach for compensation of nucleus motion and deformation in fluorescence microscopy time-lapse sequences. The proposed approach extends our previous approach, which uses a static elasticity model to register cell images. Compared with that scheme, the new approach employs a dynamic elasticity model for the forward simulation of nucleus motion and deformation based on the motion of its contours. The contour matching process is embedded as a constraint into the system of equations describing the elastic behavior of the nucleus. This results in better performance in terms of the registration accuracy. Our approach was successfully applied to real live cell microscopy image sequences of different types of cells including image data that was specifically designed and acquired for evaluation of cell image registration methods. An experimental comparison with the existing contour-based registration methods and an intensity-based registration method has been performed. We also studied the dependence of the results on the choice of method parameters.

  19. Registration of terrestrial mobile laser data on 2D or 3D geographic database by use of a non-rigid ICP approach.

    Science.gov (United States)

    Monnier, F.; Vallet, B.; Paparoditis, N.; Papelard, J.-P.; David, N.

    2013-10-01

    This article presents a generic and efficient method to register terrestrial mobile data with imperfect location on a geographic database with better overall accuracy but less details. The registration method proposed in this paper is based on a semi-rigid point to plane ICP ("Iterative Closest Point"). The main applications of such registration is to improve existing geographic databases, particularly in terms of accuracy, level of detail and diversity of represented objects. Other applications include fine geometric modelling and fine façade texturing, object extraction such as trees, poles, road signs marks, facilities, vehicles, etc. The geopositionning system of mobile mapping systems is affected by GPS masks that are only partially corrected by an Inertial Navigation System (INS) which can cause an important drift. As this drift varies non-linearly, but slowly in time, it will be modelled by a translation defined as a piecewise linear function of time which variation over time will be minimized (rigidity term). For each iteration of the ICP, the drift is estimated in order to minimise the distance between laser points and planar model primitives (data attachment term). The method has been tested on real data (a scan of the city of Paris of 3.6 million laser points registered on a 3D model of approximately 71,400 triangles).

  20. 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

  1. 3D full-field quantification of cell-induced large deformations in fibrillar biomaterials by combining non-rigid image registration with label-free second harmonic generation.

    Science.gov (United States)

    Jorge-Peñas, Alvaro; Bové, Hannelore; Sanen, Kathleen; Vaeyens, Marie-Mo; Steuwe, Christian; Roeffaers, Maarten; Ameloot, Marcel; Van Oosterwyck, Hans

    2017-08-01

    To advance our current understanding of cell-matrix mechanics and its importance for biomaterials development, advanced three-dimensional (3D) measurement techniques are necessary. Cell-induced deformations of the surrounding matrix are commonly derived from the displacement of embedded fiducial markers, as part of traction force microscopy (TFM) procedures. However, these fluorescent markers may alter the mechanical properties of the matrix or can be taken up by the embedded cells, and therefore influence cellular behavior and fate. In addition, the currently developed methods for calculating cell-induced deformations are generally limited to relatively small deformations, with displacement magnitudes and strains typically of the order of a few microns and less than 10% respectively. Yet, large, complex deformation fields can be expected from cells exerting tractions in fibrillar biomaterials, like collagen. To circumvent these hurdles, we present a technique for the 3D full-field quantification of large cell-generated deformations in collagen, without the need of fiducial markers. We applied non-rigid, Free Form Deformation (FFD)-based image registration to compute full-field displacements induced by MRC-5 human lung fibroblasts in a collagen type I hydrogel by solely relying on second harmonic generation (SHG) from the collagen fibrils. By executing comparative experiments, we show that comparable displacement fields can be derived from both fibrils and fluorescent beads. SHG-based fibril imaging can circumvent all described disadvantages of using fiducial markers. This approach allows measuring 3D full-field deformations under large displacement (of the order of 10 μm) and strain regimes (up to 40%). As such, it holds great promise for the study of large cell-induced deformations as an inherent component of cell-biomaterial interactions and cell-mediated biomaterial remodeling. Copyright © 2017 Elsevier Ltd. All rights reserved.

  2. Efficient Constrained Local Model Fitting for Non-Rigid Face Alignment.

    Science.gov (United States)

    Lucey, Simon; Wang, Yang; Cox, Mark; Sridharan, Sridha; Cohn, Jeffery F

    2009-11-01

    Active appearance models (AAMs) have demonstrated great utility when being employed for non-rigid face alignment/tracking. The "simultaneous" algorithm for fitting an AAM achieves good non-rigid face registration performance, but has poor real time performance (2-3 fps). The "project-out" algorithm for fitting an AAM achieves faster than real time performance (> 200 fps) but suffers from poor generic alignment performance. In this paper we introduce an extension to a discriminative method for non-rigid face registration/tracking referred to as a constrained local model (CLM). Our proposed method is able to achieve superior performance to the "simultaneous" AAM algorithm along with real time fitting speeds (35 fps). We improve upon the canonical CLM formulation, to gain this performance, in a number of ways by employing: (i) linear SVMs as patch-experts, (ii) a simplified optimization criteria, and (iii) a composite rather than additive warp update step. Most notably, our simplified optimization criteria for fitting the CLM divides the problem of finding a single complex registration/warp displacement into that of finding N simple warp displacements. From these N simple warp displacements, a single complex warp displacement is estimated using a weighted least-squares constraint. Another major advantage of this simplified optimization lends from its ability to be parallelized, a step which we also theoretically explore in this paper. We refer to our approach for fitting the CLM as the "exhaustive local search" (ELS) algorithm. Experiments were conducted on the CMU Multi-PIE database.

  3. 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)

  4. 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.

  5. 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...

  6. 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

  7. Comparison of numerical results between related shapes using a non-rigid mapping with statistical quantication of uncertainty

    CSIR Research Space (South Africa)

    Jansen van Rensburg, Gerhardus J

    2011-10-01

    Full Text Available In the present study, numerical results obtained on different but related shapes are compared by using a non-rigid mapping. Non-rigid registration is employed to obtain mesh representations of different human skull geometries with the same mesh...

  8. An evaluation of canonical forms for non-rigid 3D shape retrieval

    OpenAIRE

    Pickup, David; Liu, Juncheng; Sun, Xianfang; Rosin, Paul L.; Martin, Ralph R.; Cheng, Zhiquan; Lian, Zhouhui; Nie, Sipin; Jin, Longcun; Shamai, Gil; Sahillioğlu, Yusuf; Kavan, Ladislav

    2018-01-01

    Canonical forms attempt to factor out a non-rigid shape’s pose, giving a pose-neutral shape. This opens up the\\ud possibility of using methods originally designed for rigid shape retrieval for the task of non-rigid shape retrieval.\\ud We extend our recent benchmark for testing canonical form algorithms. Our new benchmark is used to evaluate a\\ud greater number of state-of-the-art canonical forms, on five recent non-rigid retrieval datasets, within two different\\ud retrieval frameworks. A tota...

  9. Image Registration Algorithm Based on Parallax Constraint and Clustering Analysis

    Science.gov (United States)

    Wang, Zhe; Dong, Min; Mu, Xiaomin; Wang, Song

    2018-01-01

    To resolve the problem of slow computation speed and low matching accuracy in image registration, a new image registration algorithm based on parallax constraint and clustering analysis is proposed. Firstly, Harris corner detection algorithm is used to extract the feature points of two images. Secondly, use Normalized Cross Correlation (NCC) function to perform the approximate matching of feature points, and the initial feature pair is obtained. Then, according to the parallax constraint condition, the initial feature pair is preprocessed by K-means clustering algorithm, which is used to remove the feature point pairs with obvious errors in the approximate matching process. Finally, adopt Random Sample Consensus (RANSAC) algorithm to optimize the feature points to obtain the final feature point matching result, and the fast and accurate image registration is realized. The experimental results show that the image registration algorithm proposed in this paper can improve the accuracy of the image matching while ensuring the real-time performance of the algorithm.

  10. COMPARISON OF VOLUMETRIC REGISTRATION ALGORITHMS FOR TENSOR-BASED MORPHOMETRY.

    Science.gov (United States)

    Villalon, Julio; Joshi, Anand A; Toga, Arthur W; Thompson, Paul M

    2011-01-01

    Nonlinear registration of brain MRI scans is often used to quantify morphological differences associated with disease or genetic factors. Recently, surface-guided fully 3D volumetric registrations have been developed that combine intensity-guided volume registrations with cortical surface constraints. In this paper, we compare one such algorithm to two popular high-dimensional volumetric registration methods: large-deformation viscous fluid registration, formulated in a Riemannian framework, and the diffeomorphic "Demons" algorithm. We performed an objective morphometric comparison, by using a large MRI dataset from 340 young adult twin subjects to examine 3D patterns of correlations in anatomical volumes. Surface-constrained volume registration gave greater effect sizes for detecting morphometric associations near the cortex, while the other two approaches gave greater effects sizes subcortically. These findings suggest novel ways to combine the advantages of multiple methods in the future.

  11. 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

  12. 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.

  13. Dynamic Non-Rigid Objects Reconstruction with a Single RGB-D Sensor

    Directory of Open Access Journals (Sweden)

    Sen Wang

    2018-03-01

    Full Text Available This paper deals with the 3D reconstruction problem for dynamic non-rigid objects with a single RGB-D sensor. It is a challenging task as we consider the almost inevitable accumulation error issue in some previous sequential fusion methods and also the possible failure of surface tracking in a long sequence. Therefore, we propose a global non-rigid registration framework and tackle the drifting problem via an explicit loop closure. Our novel scheme starts with a fusion step to get multiple partial scans from the input sequence, followed by a pairwise non-rigid registration and loop detection step to obtain correspondences between neighboring partial pieces and those pieces that form a loop. Then, we perform a global registration procedure to align all those pieces together into a consistent canonical space as guided by those matches that we have established. Finally, our proposed model-update step helps fixing potential misalignments that still exist after the global registration. Both geometric and appearance constraints are enforced during our alignment; therefore, we are able to get the recovered model with accurate geometry as well as high fidelity color maps for the mesh. Experiments on both synthetic and various real datasets have demonstrated the capability of our approach to reconstruct complete and watertight deformable objects.

  14. Dimensional Metrology of Non-rigid Parts Without Specialized Inspection Fixtures =

    Science.gov (United States)

    Sabri, Vahid

    Quality control is an important factor for manufacturing companies looking to prosper in an era of globalization, market pressures and technological advances. Functionality and product quality cannot be guaranteed without this important aspect. Manufactured parts have deviations from their nominal (CAD) shape caused by the manufacturing process. Thus, geometric inspection is a very important element in the quality control of mechanical parts. We will focus here on the geometric inspection of non-rigid (flexible) parts which are widely used in the aeronautic and automotive industries. Non-rigid parts can have different forms in a free-state condition compared with their nominal models due to residual stress and gravity loads. To solve this problem, dedicated inspection fixtures are generally used in industry to compensate for the displacement of such parts for simulating the use state in order to perform geometric inspections. These fixtures and the installation and inspection processes are expensive and time-consuming. Our aim in this thesis is therefore to develop an inspection method which eliminates the need for specialized fixtures. This is done by acquiring a point cloud from the part in a free-state condition using a contactless measuring device such as optical scanning and comparing it with the CAD model for the deviation identification. Using a non-rigid registration method and finite element analysis, we numerically inspect the profile of a non-rigid part. To do so, a simulated displacement is performed using an improved definition of displacement boundary conditions for simulating unfixed parts. In addition, we propose a numerical method for dimensional metrology of non-rigid parts in a free-state condition based on the arc length measurement by calculating the geodesic distance using the Fast Marching Method (FMM). In this thesis, we apply our developed methods on industrial non-rigid parts with free-form surfaces simulated with different types of

  15. Computing homography with RANSAC algorithm: a novel method of registration

    Science.gov (United States)

    Li, Xiaowei; Liu, Yue; Wang, Yongtian; Yan, Dayuan

    2005-02-01

    An AR (Augmented Reality) system can integrate computer-generated objects with the image sequences of real world scenes in either an off-line or a real-time way. Registration, or camera pose estimation, is one of the key techniques to determine its performance. The registration methods can be classified as model-based and move-matching. The former approach can accomplish relatively accurate registration results, but it requires the precise model of the scene, which is hard to be obtained. The latter approach carries out registration by computing the ego-motion of the camera. Because it does not require the prior-knowledge of the scene, its registration results sometimes turn out to be less accurate. When the model defined is as simple as a plane, a mixed method is introduced to take advantages of the virtues of the two methods mentioned above. Although unexpected objects often occlude this plane in an AR system, one can still try to detect corresponding points with a contract-expand method, while this will import erroneous correspondences. Computing homography with RANSAC algorithm is used to overcome such shortcomings. Using the robustly estimated homography resulted from RANSAC, the camera projective matrix can be recovered and thus registration is accomplished even when the markers are lost in the scene.

  16. 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...

  17. 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

  18. 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

  19. Extracting a Purely Non-rigid Deformation Field of a Single Structure

    Science.gov (United States)

    Demirci, Stefanie; Manstad-Hulaas, Frode; Navab, Nassir

    During endovascular aortic repair (EVAR) treatment, the aortic shape is subject to severe deformation that is imposed by medical instruments such as guide wires, catheters, and the stent graft. The problem definition of deformable registration of images covering the entire abdominal region, however, is highly ill-posed. We present a new method for extracting the deformation of an aneurysmatic aorta. The outline of the procedure includes initial rigid alignment of two abdominal scans, segmentation of abdominal vessel trees, and automatic reduction of their centerline structures to one specified region of interest around the aorta. Our non-rigid registration procedure then only computes local non-rigid deformation and leaves out all remaining global rigid transformations. In order to evaluate our method, experiments for the extraction of aortic deformation fields are conducted on 15 patient datasets from endovascular aortic repair (EVAR) treatment. A visual assessment of the registration results were performed by two vascular surgeons and one interventional radiologist who are all experts in EVAR procedures.

  20. 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.

  1. Behaviors study of image registration algorithms in image guided radiation therapy

    International Nuclear Information System (INIS)

    Zou Lian; Hou Qing

    2008-01-01

    Objective: Study the behaviors of image registration algorithms, and analyze the elements which influence the performance of image registrations. Methods: Pre-known corresponding coordinates were appointed for reference image and moving image, and then the influence of region of interest (ROI) selection, transformation function initial parameters and coupled parameter spaces on registration results were studied with a software platform developed in home. Results: Region of interest selection had a manifest influence on registration performance. An improperly chosen ROI resulted in a bad registration. Transformation function initial parameters selection based on pre-known information could improve the accuracy of image registration. Coupled parameter spaces would enhance the dependence of image registration algorithm on ROI selection. Conclusions: It is necessary for clinic IGRT to obtain a ROI selection strategy (depending on specific commercial software) correlated to tumor sites. Three suggestions for image registration technique developers are automatic selection of the initial parameters of transformation function based on pre-known information, developing specific image registration algorithm for specific image feature, and assembling real-time image registration algorithms according to tumor sites selected by software user. (authors)

  2. List-mode-based reconstruction for respiratory motion correction in PET using non-rigid body transformations

    International Nuclear Information System (INIS)

    Lamare, F; Carbayo, M J Ledesma; Cresson, T; Kontaxakis, G; Santos, A; Rest, C Cheze Le; Reader, A J; Visvikis, D

    2007-01-01

    Respiratory motion in emission tomography leads to reduced image quality. Developed correction methodology has been concentrating on the use of respiratory synchronized acquisitions leading to gated frames. Such frames, however, are of low signal-to-noise ratio as a result of containing reduced statistics. In this work, we describe the implementation of an elastic transformation within a list-mode-based reconstruction for the correction of respiratory motion over the thorax, allowing the use of all data available throughout a respiratory motion average acquisition. The developed algorithm was evaluated using datasets of the NCAT phantom generated at different points throughout the respiratory cycle. List-mode-data-based PET-simulated frames were subsequently produced by combining the NCAT datasets with Monte Carlo simulation. A non-rigid registration algorithm based on B-spline basis functions was employed to derive transformation parameters accounting for the respiratory motion using the NCAT dynamic CT images. The displacement matrices derived were subsequently applied during the image reconstruction of the original emission list mode data. Two different implementations for the incorporation of the elastic transformations within the one-pass list mode EM (OPL-EM) algorithm were developed and evaluated. The corrected images were compared with those produced using an affine transformation of list mode data prior to reconstruction, as well as with uncorrected respiratory motion average images. Results demonstrate that although both correction techniques considered lead to significant improvements in accounting for respiratory motion artefacts in the lung fields, the elastic-transformation-based correction leads to a more uniform improvement across the lungs for different lesion sizes and locations

  3. 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.

  4. 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...

  5. Correction for non-rigid movement artefacts in calcium imaging using local-global optical flow and PCA-based templates

    DEFF Research Database (Denmark)

    Brazhe, A.; Fordsmann, J.; Lauritzen, M.

    2017-01-01

    correction of calcium timelapse imaging data is accurate, can represent non-rigid image distortions, robust to noisy data and allows for fast registration of large videos. The implementation is open-source and is programmed in Python, which provides for easy access and merging into downstream image...

  6. 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....

  7. Study on Huizhou architecture of point cloud registration based on optimized ICP algorithm

    Science.gov (United States)

    Zhang, Runmei; Wu, Yulu; Zhang, Guangbin; Zhou, Wei; Tao, Yuqian

    2018-03-01

    In view of the current point cloud registration software has high hardware requirements, heavy workload and moltiple interactive definition, the source of software with better processing effect is not open, a two--step registration method based on normal vector distribution feature and coarse feature based iterative closest point (ICP) algorithm is proposed in this paper. This method combines fast point feature histogram (FPFH) algorithm, define the adjacency region of point cloud and the calculation model of the distribution of normal vectors, setting up the local coordinate system for each key point, and obtaining the transformation matrix to finish rough registration, the rough registration results of two stations are accurately registered by using the ICP algorithm. Experimental results show that, compared with the traditional ICP algorithm, the method used in this paper has obvious time and precision advantages for large amount of point clouds.

  8. 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.

  9. Performance evaluation of grid-enabled registration algorithms using bronze-standards

    CERN Document Server

    Glatard, T; Montagnat, J

    2006-01-01

    Evaluating registration algorithms is difficult due to the lack of gold standard in most clinical procedures. The bronze standard is a real-data based statistical method providing an alternative registration reference through a computationally intensive image database registration procedure. We propose in this paper an efficient implementation of this method through a grid-interfaced workflow enactor enabling the concurrent processing of hundreds of image registrations in a couple of hours only. The performances of two different grid infrastructures were compared. We computed the accuracy of 4 different rigid registration algorithms on longitudinal MRI images of brain tumors. Results showed an average subvoxel accuracy of 0.4 mm and 0.15 degrees in rotation.

  10. 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.

  11. 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

  12. 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)

  13. 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.

  14. 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

  15. 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

  16. On developing B-spline registration algorithms for multi-core processors

    International Nuclear Information System (INIS)

    Shackleford, J A; Kandasamy, N; Sharp, G C

    2010-01-01

    Spline-based deformable registration methods are quite popular within the medical-imaging community due to their flexibility and robustness. However, they require a large amount of computing time to obtain adequate results. This paper makes two contributions towards accelerating B-spline-based registration. First, we propose a grid-alignment scheme and associated data structures that greatly reduce the complexity of the registration algorithm. Based on this grid-alignment scheme, we then develop highly data parallel designs for B-spline registration within the stream-processing model, suitable for implementation on multi-core processors such as graphics processing units (GPUs). Particular attention is focused on an optimal method for performing analytic gradient computations in a data parallel fashion. CPU and GPU versions are validated for execution time and registration quality. Performance results on large images show that our GPU algorithm achieves a speedup of 15 times over the single-threaded CPU implementation whereas our multi-core CPU algorithm achieves a speedup of 8 times over the single-threaded implementation. The CPU and GPU versions achieve near-identical registration quality in terms of RMS differences between the generated vector fields.

  17. 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.

  18. 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.

  19. 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.

  20. A Condition Number for Non-Rigid Shape Matching

    KAUST Repository

    Ovsjanikov, Maks

    2011-08-01

    © 2011 The Author(s). Despite the large amount of work devoted in recent years to the problem of non-rigid shape matching, practical methods that can successfully be used for arbitrary pairs of shapes remain elusive. In this paper, we study the hardness of the problem of shape matching, and introduce the notion of the shape condition number, which captures the intuition that some shapes are inherently more difficult to match against than others. In particular, we make a connection between the symmetry of a given shape and the stability of any method used to match it while optimizing a given distortion measure. We analyze two commonly used classes of methods in deformable shape matching, and show that the stability of both types of techniques can be captured by the appropriate notion of a condition number. We also provide a practical way to estimate the shape condition number and show how it can be used to guide the selection of landmark correspondences between shapes. Thus we shed some light on the reasons why general shape matching remains difficult and provide a way to detect and mitigate such difficulties in practice.

  1. 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.

  2. 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.

  3. 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)

  4. A Rigid Image Registration Based on the Nonsubsampled Contourlet Transform and Genetic Algorithms

    Directory of Open Access Journals (Sweden)

    Nasreddine Taleb

    2010-09-01

    Full Text Available Image registration is a fundamental task used in image processing to match two or more images taken at different times, from different sensors or from different viewpoints. The objective is to find in a huge search space of geometric transformations, an acceptable accurate solution in a reasonable time to provide better registered images. Exhaustive search is computationally expensive and the computational cost increases exponentially with the number of transformation parameters and the size of the data set. In this work, we present an efficient image registration algorithm that uses genetic algorithms within a multi-resolution framework based on the Non-Subsampled Contourlet Transform (NSCT. An adaptable genetic algorithm for registration is adopted in order to minimize the search space. This approach is used within a hybrid scheme applying the two techniques fitness sharing and elitism. Two NSCT based methods are proposed for registration. A comparative study is established between these methods and a wavelet based one. Because the NSCT is a shift-invariant multidirectional transform, the second method is adopted for its search speeding up property. Simulation results clearly show that both proposed techniques are really promising methods for image registration compared to the wavelet approach, while the second technique has led to the best performance results of all. Moreover, to demonstrate the effectiveness of these methods, these registration techniques have been successfully applied to register SPOT, IKONOS and Synthetic Aperture Radar (SAR images. The algorithm has been shown to work perfectly well for multi-temporal satellite images as well, even in the presence of noise.

  5. A rigid image registration based on the nonsubsampled contourlet transform and genetic algorithms.

    Science.gov (United States)

    Meskine, Fatiha; Chikr El Mezouar, Miloud; Taleb, Nasreddine

    2010-01-01

    Image registration is a fundamental task used in image processing to match two or more images taken at different times, from different sensors or from different viewpoints. The objective is to find in a huge search space of geometric transformations, an acceptable accurate solution in a reasonable time to provide better registered images. Exhaustive search is computationally expensive and the computational cost increases exponentially with the number of transformation parameters and the size of the data set. In this work, we present an efficient image registration algorithm that uses genetic algorithms within a multi-resolution framework based on the Non-Subsampled Contourlet Transform (NSCT). An adaptable genetic algorithm for registration is adopted in order to minimize the search space. This approach is used within a hybrid scheme applying the two techniques fitness sharing and elitism. Two NSCT based methods are proposed for registration. A comparative study is established between these methods and a wavelet based one. Because the NSCT is a shift-invariant multidirectional transform, the second method is adopted for its search speeding up property. Simulation results clearly show that both proposed techniques are really promising methods for image registration compared to the wavelet approach, while the second technique has led to the best performance results of all. Moreover, to demonstrate the effectiveness of these methods, these registration techniques have been successfully applied to register SPOT, IKONOS and Synthetic Aperture Radar (SAR) images. The algorithm has been shown to work perfectly well for multi-temporal satellite images as well, even in the presence of noise.

  6. 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

  7. Sensitivity study of voxel-based PET image comparison to image registration algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Yip, Stephen, E-mail: syip@lroc.harvard.edu; Chen, Aileen B.; Berbeco, Ross [Department of Radiation Oncology, Brigham and Women’s Hospital, Dana-Farber Cancer Institute and Harvard Medical School, Boston, Massachusetts 02115 (United States); Aerts, Hugo J. W. L. [Department of Radiation Oncology, Brigham and Women’s Hospital, Dana-Farber Cancer Institute and Harvard Medical School, Boston, Massachusetts 02115 and Department of Radiology, Brigham and Women’s Hospital and Harvard Medical School, Boston, Massachusetts 02115 (United States)

    2014-11-01

    Purpose: Accurate deformable registration is essential for voxel-based comparison of sequential positron emission tomography (PET) images for proper adaptation of treatment plan and treatment response assessment. The comparison may be sensitive to the method of deformable registration as the optimal algorithm is unknown. This study investigated the impact of registration algorithm choice on therapy response evaluation. Methods: Sixteen patients with 20 lung tumors underwent a pre- and post-treatment computed tomography (CT) and 4D FDG-PET scans before and after chemoradiotherapy. All CT images were coregistered using a rigid and ten deformable registration algorithms. The resulting transformations were then applied to the respective PET images. Moreover, the tumor region defined by a physician on the registered PET images was classified into progressor, stable-disease, and responder subvolumes. Particularly, voxels with standardized uptake value (SUV) decreases >30% were classified as responder, while voxels with SUV increases >30% were progressor. All other voxels were considered stable-disease. The agreement of the subvolumes resulting from difference registration algorithms was assessed by Dice similarity index (DSI). Coefficient of variation (CV) was computed to assess variability of DSI between individual tumors. Root mean square difference (RMS{sub rigid}) of the rigidly registered CT images was used to measure the degree of tumor deformation. RMS{sub rigid} and DSI were correlated by Spearman correlation coefficient (R) to investigate the effect of tumor deformation on DSI. Results: Median DSI{sub rigid} was found to be 72%, 66%, and 80%, for progressor, stable-disease, and responder, respectively. Median DSI{sub deformable} was 63%–84%, 65%–81%, and 82%–89%. Variability of DSI was substantial and similar for both rigid and deformable algorithms with CV > 10% for all subvolumes. Tumor deformation had moderate to significant impact on DSI for progressor

  8. Real-time motion compensated patient positioning and non-rigid deformation estimation using 4-D shape priors.

    Science.gov (United States)

    Wasza, Jakob; Bauer, Sebastian; Hornegger, Joachim

    2012-01-01

    Over the last years, range imaging (RI) techniques have been proposed for patient positioning and respiration analysis in motion compensation. Yet, current RI based approaches for patient positioning employ rigid-body transformations, thus neglecting free-form deformations induced by respiratory motion. Furthermore, RI based respiration analysis relies on non-rigid registration techniques with run-times of several seconds. In this paper we propose a real-time framework based on RI to perform respiratory motion compensated positioning and non-rigid surface deformation estimation in a joint manner. The core of our method are pre-procedurally obtained 4-D shape priors that drive the intra-procedural alignment of the patient to the reference state, simultaneously yielding a rigid-body table transformation and a free-form deformation accounting for respiratory motion. We show that our method outperforms conventional alignment strategies by a factor of 3.0 and 2.3 in the rotation and translation accuracy, respectively. Using a GPU based implementation, we achieve run-times of 40 ms.

  9. 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...

  10. 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.

  11. 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.

  12. 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.

  13. Myocardial strain assessment by cine cardiac magnetic resonance imaging using non-rigid registration.

    Science.gov (United States)

    Tsadok, Yossi; Friedman, Zvi; Haluska, Brian A; Hoffmann, Rainer; Adam, Dan

    2016-05-01

    To evaluate a novel post-processing method for assessment of longitudinal mid-myocardial strain in standard cine cardiac magnetic resonance (CMR) imaging sequences. Cine CMR imaging and tagged cardiac magnetic resonance imaging (TMRI) were performed in 15 patients with acute myocardial infarction (AMI) and 15 healthy volunteers served as control group. A second group of 37 post-AMI patients underwent both cine CMR and late gadolinium enhancement (LGE) CMR exams. Speckle tracking echocardiography (STE) was performed in 36 of these patients. Cine CMR, TMRI and STE were analyzed to obtain longitudinal strain. LGE-CMR datasets were analyzed to evaluate scar extent. Comparison of peak systolic strain (PSS) measured from CMR and TMRI yielded a strong correlation (r=0.86, pcine CMR data. The method was found to be highly correlated with strain measurements obtained by TMRI and STE. This tool allows accurate discrimination between different transmurality states of myocardial infarction. Copyright © 2015 Elsevier Inc. All rights reserved.

  14. Validation of deformable image registration algorithms on CT images of ex vivo porcine bladders with fiducial markers

    NARCIS (Netherlands)

    Wognum, S.; Heethuis, S. E.; Rosario, T.; Hoogeman, M. S.; Bel, A.

    2014-01-01

    The spatial accuracy of deformable image registration (DIR) is important in the implementation of image guided adaptive radiotherapy techniques for cancer in the pelvic region. Validation of algorithms is best performed on phantoms with fiducial markers undergoing controlled large deformations.

  15. 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

  16. 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

  17. 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.

  18. 3D ultrasound-CT registration of the liver using combined landmark-intensity information

    International Nuclear Information System (INIS)

    Lange, Thomas; Schlag, Peter M.; Papenberg, Nils; Heldmann, Stefan; Modersitzki, Jan; Fischer, Bernd; Lamecker, Hans

    2009-01-01

    An important issue in computer-assisted surgery of the liver is a fast and reliable transfer of preoperative resection plans to the intraoperative situation. One problem is to match the planning data, derived from preoperative CT or MR images, with 3D ultrasound images of the liver, acquired during surgery. As the liver deforms significantly in the intraoperative situation non-rigid registration is necessary. This is a particularly challenging task because pre- and intraoperative image data stem from different modalities and ultrasound images are generally very noisy. One way to overcome these problems is to incorporate prior knowledge into the registration process. We propose a method of combining anatomical landmark information with a fast non-parametric intensity registration approach. Mathematically, this leads to a constrained optimization problem. As distance measure we use the normalized gradient field which allows for multimodal image registration. A qualitative and quantitative validation on clinical liver data sets of three different patients has been performed. We used the distance of dense corresponding points on vessel center lines for quantitative validation. The combined landmark and intensity approach improves the mean and percentage of point distances above 3 mm compared to rigid and thin-plate spline registration based only on landmarks. The proposed algorithm offers the possibility to incorporate additional a priori knowledge - in terms of few landmarks - provided by a human expert into a non-rigid registration process. (orig.)

  19. 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.

  20. A multi-institution evaluation of deformable image registration algorithms for automatic organ delineation in adaptive head and neck radiotherapy

    International Nuclear Information System (INIS)

    Hardcastle, Nicholas; Kumar, Prashant; Oechsner, Markus; Richter, Anne; Song, Shiyu; Myers, Michael; Polat, Bülent; Bzdusek, Karl; Tomé, Wolfgang A; Cannon, Donald M; Brouwer, Charlotte L; Wittendorp, Paul WH; Dogan, Nesrin; Guckenberger, Matthias; Allaire, Stéphane; Mallya, Yogish

    2012-01-01

    Adaptive Radiotherapy aims to identify anatomical deviations during a radiotherapy course and modify the treatment plan to maintain treatment objectives. This requires regions of interest (ROIs) to be defined using the most recent imaging data. This study investigates the clinical utility of using deformable image registration (DIR) to automatically propagate ROIs. Target (GTV) and organ-at-risk (OAR) ROIs were non-rigidly propagated from a planning CT scan to a per-treatment CT scan for 22 patients. Propagated ROIs were quantitatively compared with expert physician-drawn ROIs on the per-treatment scan using Dice scores and mean slicewise Hausdorff distances, and center of mass distances for GTVs. The propagated ROIs were qualitatively examined by experts and scored based on their clinical utility. Good agreement between the DIR-propagated ROIs and expert-drawn ROIs was observed based on the metrics used. 94% of all ROIs generated using DIR were scored as being clinically useful, requiring minimal or no edits. However, 27% (12/44) of the GTVs required major edits. DIR was successfully used on 22 patients to propagate target and OAR structures for ART with good anatomical agreement for OARs. It is recommended that propagated target structures be thoroughly reviewed by the treating physician

  1. 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.

  2. Efficient nonrigid registration using ranked order statistics

    DEFF Research Database (Denmark)

    Tennakoon, Ruwan B.; Bab-Hadiashar, Alireza; de Bruijne, Marleen

    2013-01-01

    of research. In this paper we propose a fast and accurate non-rigid registration method for intra-modality volumetric images. Our approach exploits the information provided by an order statistics based segmentation method, to find the important regions for registration and use an appropriate sampling scheme......Non-rigid image registration techniques are widely used in medical imaging applications. Due to high computational complexities of these techniques, finding appropriate registration method to both reduce the computation burden and increase the registration accuracy has become an intense area...... to target those areas and reduce the registration computation time. A unique advantage of the proposed method is its ability to identify the point of diminishing returns and stop the registration process. Our experiments on registration of real lung CT images, with expert annotated landmarks, show...

  3. 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

  4. 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.

  5. Non-rigid connector: The wand to allay the stresses on abutment

    OpenAIRE

    Banerjee, Saurav; Khongshei, Arlingstone; Gupta, Tapas; Banerjee, Ardhendu

    2011-01-01

    The use of rigid connectors in 5-unit fixed dental prosthesis with a pier abutment can result in failure of weaker retainer in the long run as the pier abutment acts as a fulcrum. Non-rigid connector placed on the distal aspect of pier seems to reduce potentially excess stress concentration on the pier abutment.

  6. A non-rigid point matching method with local topology preservation for accurate bladder dose summation in high dose rate cervical brachytherapy

    International Nuclear Information System (INIS)

    Chen, Haibin; Liao, Yuliang; Zhen, Xin; Zhou, Linghong; Zhong, Zichun; Pompoš, Arnold; Hrycushko, Brian; Albuquerque, Kevin; Gu, Xuejun

    2016-01-01

    GEC-ESTRO guidelines for high dose rate cervical brachytherapy advocate the reporting of the D2cc (the minimum dose received by the maximally exposed 2cc volume) to organs at risk. Due to large interfractional organ motion, reporting of accurate cumulative D2cc over a multifractional course is a non-trivial task requiring deformable image registration and deformable dose summation. To efficiently and accurately describe the point-to-point correspondence of the bladder wall over all treatment fractions while preserving local topologies, we propose a novel graphic processing unit (GPU)-based non-rigid point matching algorithm. This is achieved by introducing local anatomic information into the iterative update of correspondence matrix computation in the ‘thin plate splines-robust point matching’ (TPS-RPM) scheme. The performance of the GPU-based TPS-RPM with local topology preservation algorithm (TPS-RPM-LTP) was evaluated using four numerically simulated synthetic bladders having known deformations, a custom-made porcine bladder phantom embedded with twenty one fiducial markers, and 29 fractional computed tomography (CT) images from seven cervical cancer patients. Results show that TPS-RPM-LTP achieved excellent geometric accuracy with landmark residual distance error (RDE) of 0.7  ±  0.3 mm for the numerical synthetic data with different scales of bladder deformation and structure complexity, and 3.7  ±  1.8 mm and 1.6  ±  0.8 mm for the porcine bladder phantom with large and small deformation, respectively. The RDE accuracy of the urethral orifice landmarks in patient bladders was 3.7  ±  2.1 mm. When compared to the original TPS-RPM, the TPS-RPM-LTP improved landmark matching by reducing landmark RDE by 50  ±  19%, 37  ±  11% and 28  ±  11% for the synthetic, porcine phantom and the patient bladders, respectively. This was achieved with a computational time of less than 15 s in all cases

  7. A non-rigid point matching method with local topology preservation for accurate bladder dose summation in high dose rate cervical brachytherapy.

    Science.gov (United States)

    Chen, Haibin; Zhong, Zichun; Liao, Yuliang; Pompoš, Arnold; Hrycushko, Brian; Albuquerque, Kevin; Zhen, Xin; Zhou, Linghong; Gu, Xuejun

    2016-02-07

    GEC-ESTRO guidelines for high dose rate cervical brachytherapy advocate the reporting of the D2cc (the minimum dose received by the maximally exposed 2cc volume) to organs at risk. Due to large interfractional organ motion, reporting of accurate cumulative D2cc over a multifractional course is a non-trivial task requiring deformable image registration and deformable dose summation. To efficiently and accurately describe the point-to-point correspondence of the bladder wall over all treatment fractions while preserving local topologies, we propose a novel graphic processing unit (GPU)-based non-rigid point matching algorithm. This is achieved by introducing local anatomic information into the iterative update of correspondence matrix computation in the 'thin plate splines-robust point matching' (TPS-RPM) scheme. The performance of the GPU-based TPS-RPM with local topology preservation algorithm (TPS-RPM-LTP) was evaluated using four numerically simulated synthetic bladders having known deformations, a custom-made porcine bladder phantom embedded with twenty one fiducial markers, and 29 fractional computed tomography (CT) images from seven cervical cancer patients. Results show that TPS-RPM-LTP achieved excellent geometric accuracy with landmark residual distance error (RDE) of 0.7  ±  0.3 mm for the numerical synthetic data with different scales of bladder deformation and structure complexity, and 3.7  ±  1.8 mm and 1.6  ±  0.8 mm for the porcine bladder phantom with large and small deformation, respectively. The RDE accuracy of the urethral orifice landmarks in patient bladders was 3.7  ±  2.1 mm. When compared to the original TPS-RPM, the TPS-RPM-LTP improved landmark matching by reducing landmark RDE by 50  ±  19%, 37  ±  11% and 28  ±  11% for the synthetic, porcine phantom and the patient bladders, respectively. This was achieved with a computational time of less than 15 s in all cases

  8. 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.

  9. 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

  10. 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).

  11. 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

  12. Real-time non-rigid target tracking for ultrasound-guided clinical interventions

    Science.gov (United States)

    Zachiu, C.; Ries, M.; Ramaekers, P.; Guey, J.-L.; Moonen, C. T. W.; de Senneville, B. Denis

    2017-10-01

    Biological motion is a problem for non- or mini-invasive interventions when conducted in mobile/deformable organs due to the targeted pathology moving/deforming with the organ. This may lead to high miss rates and/or incomplete treatment of the pathology. Therefore, real-time tracking of the target anatomy during the intervention would be beneficial for such applications. Since the aforementioned interventions are often conducted under B-mode ultrasound (US) guidance, target tracking can be achieved via image registration, by comparing the acquired US images to a separate image established as positional reference. However, such US images are intrinsically altered by speckle noise, introducing incoherent gray-level intensity variations. This may prove problematic for existing intensity-based registration methods. In the current study we address US-based target tracking by employing the recently proposed EVolution registration algorithm. The method is, by construction, robust to transient gray-level intensities. Instead of directly matching image intensities, EVolution aligns similar contrast patterns in the images. Moreover, the displacement is computed by evaluating a matching criterion for image sub-regions rather than on a point-by-point basis, which typically provides more robust motion estimates. However, unlike similar previously published approaches, which assume rigid displacements in the image sub-regions, the EVolution algorithm integrates the matching criterion in a global functional, allowing the estimation of an elastic dense deformation. The approach was validated for soft tissue tracking under free-breathing conditions on the abdomen of seven healthy volunteers. Contact echography was performed on all volunteers, while three of the volunteers also underwent standoff echography. Each of the two modalities is predominantly specific to a particular type of non- or mini-invasive clinical intervention. The method demonstrated on average an accuracy of

  13. Validation of deformable image registration algorithms on CT images of ex vivo porcine bladders with fiducial markers.

    Science.gov (United States)

    Wognum, S; Heethuis, S E; Rosario, T; Hoogeman, M S; Bel, A

    2014-07-01

    The spatial accuracy of deformable image registration (DIR) is important in the implementation of image guided adaptive radiotherapy techniques for cancer in the pelvic region. Validation of algorithms is best performed on phantoms with fiducial markers undergoing controlled large deformations. Excised porcine bladders, exhibiting similar filling and voiding behavior as human bladders, provide such an environment. The aim of this study was to determine the spatial accuracy of different DIR algorithms on CT images of ex vivo porcine bladders with radiopaque fiducial markers applied to the outer surface, for a range of bladder volumes, using various accuracy metrics. Five excised porcine bladders with a grid of 30-40 radiopaque fiducial markers attached to the outer wall were suspended inside a water-filled phantom. The bladder was filled with a controlled amount of water with added contrast medium for a range of filling volumes (100-400 ml in steps of 50 ml) using a luer lock syringe, and CT scans were acquired at each filling volume. DIR was performed for each data set, with the 100 ml bladder as the reference image. Six intensity-based algorithms (optical flow or demons-based) implemented in theMATLAB platform DIRART, a b-spline algorithm implemented in the commercial software package VelocityAI, and a structure-based algorithm (Symmetric Thin Plate Spline Robust Point Matching) were validated, using adequate parameter settings according to values previously published. The resulting deformation vector field from each registration was applied to the contoured bladder structures and to the marker coordinates for spatial error calculation. The quality of the algorithms was assessed by comparing the different error metrics across the different algorithms, and by comparing the effect of deformation magnitude (bladder volume difference) per algorithm, using the Independent Samples Kruskal-Wallis test. The authors found good structure accuracy without dependency on

  14. Validation of deformable image registration algorithms on CT images of ex vivo porcine bladders with fiducial markers

    International Nuclear Information System (INIS)

    Wognum, S.; Heethuis, S. E.; Bel, A.; Rosario, T.; Hoogeman, M. S.

    2014-01-01

    Purpose: The spatial accuracy of deformable image registration (DIR) is important in the implementation of image guided adaptive radiotherapy techniques for cancer in the pelvic region. Validation of algorithms is best performed on phantoms with fiducial markers undergoing controlled large deformations. Excised porcine bladders, exhibiting similar filling and voiding behavior as human bladders, provide such an environment. The aim of this study was to determine the spatial accuracy of different DIR algorithms on CT images ofex vivo porcine bladders with radiopaque fiducial markers applied to the outer surface, for a range of bladder volumes, using various accuracy metrics. Methods: Five excised porcine bladders with a grid of 30–40 radiopaque fiducial markers attached to the outer wall were suspended inside a water-filled phantom. The bladder was filled with a controlled amount of water with added contrast medium for a range of filling volumes (100–400 ml in steps of 50 ml) using a luer lock syringe, and CT scans were acquired at each filling volume. DIR was performed for each data set, with the 100 ml bladder as the reference image. Six intensity-based algorithms (optical flow or demons-based) implemented in theMATLAB platform DIRART, a b-spline algorithm implemented in the commercial software package VelocityAI, and a structure-based algorithm (Symmetric Thin Plate Spline Robust Point Matching) were validated, using adequate parameter settings according to values previously published. The resulting deformation vector field from each registration was applied to the contoured bladder structures and to the marker coordinates for spatial error calculation. The quality of the algorithms was assessed by comparing the different error metrics across the different algorithms, and by comparing the effect of deformation magnitude (bladder volume difference) per algorithm, using the Independent Samples Kruskal-Wallis test. Results: The authors found good structure

  15. Validation of deformable image registration algorithms on CT images of ex vivo porcine bladders with fiducial markers

    Energy Technology Data Exchange (ETDEWEB)

    Wognum, S., E-mail: s.wognum@gmail.com; Heethuis, S. E.; Bel, A. [Department of Radiation Oncology, Academic Medical Center, Meibergdreef 9, 1105 AZ Amsterdam (Netherlands); Rosario, T. [Department of Radiation Oncology, VU University Medical Center, De Boelelaan 1117, 1081 HZ Amsterdam (Netherlands); Hoogeman, M. S. [Department of Radiation Oncology, Erasmus MC Cancer Institute, Erasmus Medical Center, Groene Hilledijk 301, 3075 EA Rotterdam (Netherlands)

    2014-07-15

    Purpose: The spatial accuracy of deformable image registration (DIR) is important in the implementation of image guided adaptive radiotherapy techniques for cancer in the pelvic region. Validation of algorithms is best performed on phantoms with fiducial markers undergoing controlled large deformations. Excised porcine bladders, exhibiting similar filling and voiding behavior as human bladders, provide such an environment. The aim of this study was to determine the spatial accuracy of different DIR algorithms on CT images ofex vivo porcine bladders with radiopaque fiducial markers applied to the outer surface, for a range of bladder volumes, using various accuracy metrics. Methods: Five excised porcine bladders with a grid of 30–40 radiopaque fiducial markers attached to the outer wall were suspended inside a water-filled phantom. The bladder was filled with a controlled amount of water with added contrast medium for a range of filling volumes (100–400 ml in steps of 50 ml) using a luer lock syringe, and CT scans were acquired at each filling volume. DIR was performed for each data set, with the 100 ml bladder as the reference image. Six intensity-based algorithms (optical flow or demons-based) implemented in theMATLAB platform DIRART, a b-spline algorithm implemented in the commercial software package VelocityAI, and a structure-based algorithm (Symmetric Thin Plate Spline Robust Point Matching) were validated, using adequate parameter settings according to values previously published. The resulting deformation vector field from each registration was applied to the contoured bladder structures and to the marker coordinates for spatial error calculation. The quality of the algorithms was assessed by comparing the different error metrics across the different algorithms, and by comparing the effect of deformation magnitude (bladder volume difference) per algorithm, using the Independent Samples Kruskal-Wallis test. Results: The authors found good structure

  16. Nonlinear mechanics of non-rigid origami: an efficient computational approach

    Science.gov (United States)

    Liu, K.; Paulino, G. H.

    2017-10-01

    Origami-inspired designs possess attractive applications to science and engineering (e.g. deployable, self-assembling, adaptable systems). The special geometric arrangement of panels and creases gives rise to unique mechanical properties of origami, such as reconfigurability, making origami designs well suited for tunable structures. Although often being ignored, origami structures exhibit additional soft modes beyond rigid folding due to the flexibility of thin sheets that further influence their behaviour. Actual behaviour of origami structures usually involves significant geometric nonlinearity, which amplifies the influence of additional soft modes. To investigate the nonlinear mechanics of origami structures with deformable panels, we present a structural engineering approach for simulating the nonlinear response of non-rigid origami structures. In this paper, we propose a fully nonlinear, displacement-based implicit formulation for performing static/quasi-static analyses of non-rigid origami structures based on `bar-and-hinge' models. The formulation itself leads to an efficient and robust numerical implementation. Agreement between real models and numerical simulations demonstrates the ability of the proposed approach to capture key features of origami behaviour.

  17. Research of vibration resistance of non-rigid shafts turning with various technological set-ups

    Directory of Open Access Journals (Sweden)

    Vasilevykh Sergey L.

    2017-01-01

    Full Text Available The article considers the definition of the stability range of a dynamic system for turning non-rigid shafts with different technological set-ups: standard and developed ones; they are improved as a result of this research. The topicality of the study is due to the fact that processing such parts is associated with significant difficulties caused by deformation of the workpiece under the cutting force as well as occurrence of vibration of the part during processing, they are so intense and in practice they force to significantly reduce the cutting regime, recur to multiple-pass operation, lead to premature deterioration of the cutter, as a result, reduce the productivity of machining shafts on metal-cutting machines. In this connection, the purpose of the present research is to determine the boundaries of the stability regions with intensive turning of non-rigid shafts. In the article the basic theoretical principles of construction of a mathematical system focused on the process of non-free cutting of a dynamic machine are justified. By means of the developed mathematical model interrelations are established and legitimacies of influence of various technological set-ups on stability of the dynamic system of the machine-tool-device-tool-blank are revealed. The conducted researches allow to more objectively represent difficult processes that occur in a closed dynamic system of a machine.

  18. Understanding geological processes: Visualization of rigid and non-rigid transformations

    Science.gov (United States)

    Shipley, T. F.; Atit, K.; Manduca, C. A.; Ormand, C. J.; Resnick, I.; Tikoff, B.

    2012-12-01

    Visualizations are used in the geological sciences to support reasoning about structures and events. Research in cognitive sciences offers insights into the range of skills of different users, and ultimately how visualizations might support different users. To understand the range of skills needed to reason about earth processes we have developed a program of research that is grounded in the geosciences' careful description of the spatial and spatiotemporal patterns associated with earth processes. In particular, we are pursuing a research program that identifies specific spatial skills and investigates whether and how they are related to each other. For this study, we focus on a specific question: Is there an important distinction in the geosciences between rigid and non-rigid deformation? To study a general spatial thinking skill we employed displays with non-geological objects that had been altered by rigid change (rotation), and two types of non-rigid change ("brittle" (or discontinuous) and "ductile" (or continuous) deformation). Disciplinary scientists (geosciences and chemistry faculty), and novices (non-science faculty and undergraduate psychology students) answered questions that required them to visualize the appearance of the object before the change. In one study, geologists and chemists were found to be superior to non-science faculty in reasoning about rigid rotations (e.g., what an object would look like from a different perspective). Geologists were superior to chemists in reasoning about brittle deformations (e.g., what an object looked like before it was broken - here the object was a word cut into many fragments displaced in different directions). This finding is consistent with two hypotheses: 1) Experts are good at visualizing the types of changes required for their domain; and 2) Visualization of rigid and non-rigid changes are not the same skill. An additional important finding is that there was a broad range of skill in both rigid and non-rigid

  19. Mao-Gilles Stabilization Algorithm

    Directory of Open Access Journals (Sweden)

    Jérôme Gilles

    2013-07-01

    Full Text Available Originally, the Mao-Gilles stabilization algorithm was designed to compensate the non-rigid deformations due to atmospheric turbulence. Given a sequence of frames affected by atmospheric turbulence, the algorithm uses a variational model combining optical flow and regularization to characterize the static observed scene. The optimization problem is solved by Bregman Iteration and the operator splitting method. The algorithm is simple, efficient, and can be easily generalized for different scenarios involving non-rigid deformations.

  20. 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)

  1. 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 (0algorithms 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

  2. Evaluation of linear registration algorithms for brain SPECT and the errors due to hypoperfusion lesions

    International Nuclear Information System (INIS)

    Radau, Perry E.; Slomka, Piotr J.; Julin, Per; Svensson, Leif; Wahlund, Lars-Olof

    2001-01-01

    The semiquantitative analysis of perfusion single-photon emission computed tomography (SPECT) images requires a reproducible, objective method. Automated spatial standardization (registration) of images is a prerequisite to this goal. A source of registration error is the presence of hypoperfusion defects, which was evaluated in this study with simulated lesions. The brain perfusion images measured by 99m Tc-HMPAO SPECT from 21 patients with probable Alzheimer's disease and 35 control subjects were retrospectively analyzed. An automatic segmentation method was developed to remove external activity. Three registration methods, robust least squares, normalized mutual information (NMI), and count difference were implemented and the effects of simulated defects were compared. The tested registration methods required segmentation of the cerebrum from external activity, and the automatic and manual methods differed by a three-dimensional displacement of 1.4±1.1 mm. NMI registration proved to be least adversely effected by simulated defects with 3 mm average displacement caused by severe defects. The error in quantifying the patient-template parietal ratio due to misregistration was 2.0% for large defects (70% hypoperfusion) and 0.5% for smaller defects (85% hypoperfusion)

  3. 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

  4. Experiment and numerical simulation on the characteristics of fluid–structure interactions of non-rigid airships

    Directory of Open Access Journals (Sweden)

    Xiaocui Wu

    2015-11-01

    Full Text Available Fluid–structure interaction is an important issue for non-rigid airships with inflated envelopes. In this study, a wind tunnel test is conducted, and a loosely coupled procedure is correspondingly established for numerical simulation based on computational fluid dynamics and nonlinear finite element analysis methods. The typical results of the numerical simulation and wind tunnel experiment, including the overall lift and deformation, are in good agreement with each other. The results obtained indicate that the effect of fluid–structure interaction is noticeable and should be considered for non-rigid airships. Flow-induced deformation can further intensify the upward lift force and pitching moment, which can lead to a large deformation. Under a wind speed of 15 m/s, the lift force of the non-rigid model is increased to approximately 60% compared with that of the rigid model under a high angle of attack.

  5. 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

  6. 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.

  7. 3D craniofacial registration using thin-plate spline transform and cylindrical surface projection.

    Science.gov (United States)

    Chen, Yucong; Zhao, Junli; Deng, Qingqiong; Duan, Fuqing

    2017-01-01

    Craniofacial registration is used to establish the point-to-point correspondence in a unified coordinate system among human craniofacial models. It is the foundation of craniofacial reconstruction and other craniofacial statistical analysis research. In this paper, a non-rigid 3D craniofacial registration method using thin-plate spline transform and cylindrical surface projection is proposed. First, the gradient descent optimization is utilized to improve a cylindrical surface fitting (CSF) for the reference craniofacial model. Second, the thin-plate spline transform (TPST) is applied to deform a target craniofacial model to the reference model. Finally, the cylindrical surface projection (CSP) is used to derive the point correspondence between the reference and deformed target models. To accelerate the procedure, the iterative closest point ICP algorithm is used to obtain a rough correspondence, which can provide a possible intersection area of the CSP. Finally, the inverse TPST is used to map the obtained corresponding points from the deformed target craniofacial model to the original model, and it can be realized directly by the correspondence between the original target model and the deformed target model. Three types of registration, namely, reflexive, involutive and transitive registration, are carried out to verify the effectiveness of the proposed craniofacial registration algorithm. Comparison with the methods in the literature shows that the proposed method is more accurate.

  8. 3D craniofacial registration using thin-plate spline transform and cylindrical surface projection.

    Directory of Open Access Journals (Sweden)

    Yucong Chen

    Full Text Available Craniofacial registration is used to establish the point-to-point correspondence in a unified coordinate system among human craniofacial models. It is the foundation of craniofacial reconstruction and other craniofacial statistical analysis research. In this paper, a non-rigid 3D craniofacial registration method using thin-plate spline transform and cylindrical surface projection is proposed. First, the gradient descent optimization is utilized to improve a cylindrical surface fitting (CSF for the reference craniofacial model. Second, the thin-plate spline transform (TPST is applied to deform a target craniofacial model to the reference model. Finally, the cylindrical surface projection (CSP is used to derive the point correspondence between the reference and deformed target models. To accelerate the procedure, the iterative closest point ICP algorithm is used to obtain a rough correspondence, which can provide a possible intersection area of the CSP. Finally, the inverse TPST is used to map the obtained corresponding points from the deformed target craniofacial model to the original model, and it can be realized directly by the correspondence between the original target model and the deformed target model. Three types of registration, namely, reflexive, involutive and transitive registration, are carried out to verify the effectiveness of the proposed craniofacial registration algorithm. Comparison with the methods in the literature shows that the proposed method is more accurate.

  9. 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...

  10. 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

  11. Non-rigid Point Matching using Topology Preserving Constraints for Medical Computer Vision

    Directory of Open Access Journals (Sweden)

    Jong-Ha Lee

    2017-01-01

    Full Text Available This work presents a novel algorithm of finding correspondence using a relaxation labeling. For the variance experiments, the variance of all algorithms except the proposed algorithm is large. The largest variance of the proposed algorithm is +0.01 in the 0.08 deformation test of a character. Overall, the proposed algorithm outperforms compared to the rest of algorithms. Except the proposed algorithm, matching with neighborhood algorithm shows the best performance except an outlier to data ratio in a character test. The proposed algorithm shows the best performance as well as an outlier to data ratio in a character test.

  12. 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

  13. 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.

  14. Visual Tracking of Deformation and Classification of Non-Rigid Objects with Robot Hand Probing

    Directory of Open Access Journals (Sweden)

    Fei Hui

    2017-03-01

    Full Text Available Performing tasks with a robot hand often requires a complete knowledge of the manipulated object, including its properties (shape, rigidity, surface texture and its location in the environment, in order to ensure safe and efficient manipulation. While well-established procedures exist for the manipulation of rigid objects, as well as several approaches for the manipulation of linear or planar deformable objects such as ropes or fabric, research addressing the characterization of deformable objects occupying a volume remains relatively limited. The paper proposes an approach for tracking the deformation of non-rigid objects under robot hand manipulation using RGB-D data. The purpose is to automatically classify deformable objects as rigid, elastic, plastic, or elasto-plastic, based on the material they are made of, and to support recognition of the category of such objects through a robotic probing process in order to enhance manipulation capabilities. The proposed approach combines advantageously classical color and depth image processing techniques and proposes a novel combination of the fast level set method with a log-polar mapping of the visual data to robustly detect and track the contour of a deformable object in a RGB-D data stream. Dynamic time warping is employed to characterize the object properties independently from the varying length of the tracked contour as the object deforms. The proposed solution achieves a classification rate over all categories of material of up to 98.3%. When integrated in the control loop of a robot hand, it can contribute to ensure stable grasp, and safe manipulation capability that will preserve the physical integrity of the object.

  15. A Scheduling Algorithm for the Distributed Student Registration System in Transaction-Intensive Environment

    Science.gov (United States)

    Li, Wenhao

    2011-01-01

    Distributed workflow technology has been widely used in modern education and e-business systems. Distributed web applications have shown cross-domain and cooperative characteristics to meet the need of current distributed workflow applications. In this paper, the author proposes a dynamic and adaptive scheduling algorithm PCSA (Pre-Calculated…

  16. Optic disc boundary segmentation from diffeomorphic demons registration of monocular fundus image sequences versus 3D visualization of stereo fundus image pairs for automated early stage glaucoma assessment

    Science.gov (United States)

    Gatti, Vijay; Hill, Jason; Mitra, Sunanda; Nutter, Brian

    2014-03-01

    Despite the current availability in resource-rich regions of advanced technologies in scanning and 3-D imaging in current ophthalmology practice, world-wide screening tests for early detection and progression of glaucoma still consist of a variety of simple tools, including fundus image-based parameters such as CDR (cup to disc diameter ratio) and CAR (cup to disc area ratio), especially in resource -poor regions. Reliable automated computation of the relevant parameters from fundus image sequences requires robust non-rigid registration and segmentation techniques. Recent research work demonstrated that proper non-rigid registration of multi-view monocular fundus image sequences could result in acceptable segmentation of cup boundaries for automated computation of CAR and CDR. This research work introduces a composite diffeomorphic demons registration algorithm for segmentation of cup boundaries from a sequence of monocular images and compares the resulting CAR and CDR values with those computed manually by experts and from 3-D visualization of stereo pairs. Our preliminary results show that the automated computation of CDR and CAR from composite diffeomorphic segmentation of monocular image sequences yield values comparable with those from the other two techniques and thus may provide global healthcare with a cost-effective yet accurate tool for management of glaucoma in its early stage.

  17. 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.

  18. 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.

  19. 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.

  20. 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.

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

    NARCIS (Netherlands)

    Gutierrez, Daniel F.; Zaidi, Habib

    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

  2. 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

  3. A semi-automated 2D/3D marker-based registration algorithm modelling prostate shrinkage during radiotherapy for prostate cancer

    International Nuclear Information System (INIS)

    Budiharto, Tom; Slagmolen, Pieter; Hermans, Jeroen; Maes, Frederik; Verstraete, Jan; Heuvel, Frank Van den; Depuydt, Tom; Oyen, Raymond; Haustermans, Karin

    2009-01-01

    Background and purpose: Currently, most available patient alignment tools based on implanted markers use manual marker matching and rigid registration transformations to measure the needed translational shifts. To quantify the particular effect of prostate gland shrinkage, implanted gold markers were tracked during a course of radiotherapy including an isotropic scaling factor to model prostate shrinkage. Materials and methods: Eight patients with prostate cancer had gold markers implanted transrectally and seven were treated with (neo) adjuvant androgen deprivation therapy. After patient alignment to skin tattoos, orthogonal electronic portal images (EPIs) were taken. A semi-automated 2D/3D marker-based registration was performed to calculate the necessary couch shifts. The registration consists of a rigid transformation combined with an isotropic scaling to model prostate shrinkage. Results: The inclusion of an isotropic shrinkage model in the registration algorithm cancelled the corresponding increase in registration error. The mean scaling factor was 0.89 ± 0.09. For all but two patients, a decrease of the isotropic scaling factor during treatment was observed. However, there was almost no difference in the translation offset between the manual matching of the EPIs to the digitally reconstructed radiographs and the semi-automated 2D/3D registration. A decrease in the intermarker distance was found correlating with prostate shrinkage rather than with random marker migration. Conclusions: Inclusion of shrinkage in the registration process reduces registration errors during a course of radiotherapy. Nevertheless, this did not lead to a clinically significant change in the proposed table translations when compared to translations obtained with manual marker matching without a scaling correction

  4. 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.

  5. 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.

  6. Digital anthropomorphic phantoms of non-rigid human respiratory and voluntary body motion for investigating motion correction in emission imaging

    International Nuclear Information System (INIS)

    Könik, Arda; Johnson, Karen L; Dasari, Paul; Pretorius, P H; Dey, Joyoni; King, Michael A; Connolly, Caitlin M; Segars, Paul W; Lindsay, Clifford

    2014-01-01

    The development of methods for correcting patient motion in emission tomography has been receiving increased attention. Often the performance of these methods is evaluated through simulations using digital anthropomorphic phantoms, such as the commonly used extended cardiac torso (XCAT) phantom, which models both respiratory and cardiac motion based on human studies. However, non-rigid body motion, which is frequently seen in clinical studies, is not present in the standard XCAT phantom. In addition, respiratory motion in the standard phantom is limited to a single generic trend. In this work, to obtain a more realistic representation of motion, we developed a series of individual-specific XCAT phantoms, modeling non-rigid respiratory and non-rigid body motions derived from the magnetic resonance imaging (MRI) acquisitions of volunteers. Acquisitions were performed in the sagittal orientation using the Navigator methodology. Baseline (no motion) acquisitions at end-expiration were obtained at the beginning of each imaging session for each volunteer. For the body motion studies, MRI was again acquired only at end-expiration for five body motion poses (shoulder stretch, shoulder twist, lateral bend, side roll, and axial slide). For the respiratory motion studies, an MRI was acquired during free/regular breathing. The magnetic resonance slices were then retrospectively sorted into 14 amplitude-binned respiratory states, end-expiration, end-inspiration, six intermediary states during inspiration, and six during expiration using the recorded Navigator signal. XCAT phantoms were then generated based on these MRI data by interactive alignment of the organ contours of the XCAT with the MRI slices using a graphical user interface. Thus far we have created five body motion and five respiratory motion XCAT phantoms from the MRI acquisitions of six healthy volunteers (three males and three females). Non-rigid motion exhibited by the volunteers was reflected in both respiratory

  7. Digital anthropomorphic phantoms of non-rigid human respiratory and voluntary body motion for investigating motion correction in emission imaging

    Science.gov (United States)

    Könik, Arda; Connolly, Caitlin M.; Johnson, Karen L.; Dasari, Paul; Segars, Paul W.; Pretorius, P. H.; Lindsay, Clifford; Dey, Joyoni; King, Michael A.

    2014-07-01

    The development of methods for correcting patient motion in emission tomography has been receiving increased attention. Often the performance of these methods is evaluated through simulations using digital anthropomorphic phantoms, such as the commonly used extended cardiac torso (XCAT) phantom, which models both respiratory and cardiac motion based on human studies. However, non-rigid body motion, which is frequently seen in clinical studies, is not present in the standard XCAT phantom. In addition, respiratory motion in the standard phantom is limited to a single generic trend. In this work, to obtain a more realistic representation of motion, we developed a series of individual-specific XCAT phantoms, modeling non-rigid respiratory and non-rigid body motions derived from the magnetic resonance imaging (MRI) acquisitions of volunteers. Acquisitions were performed in the sagittal orientation using the Navigator methodology. Baseline (no motion) acquisitions at end-expiration were obtained at the beginning of each imaging session for each volunteer. For the body motion studies, MRI was again acquired only at end-expiration for five body motion poses (shoulder stretch, shoulder twist, lateral bend, side roll, and axial slide). For the respiratory motion studies, an MRI was acquired during free/regular breathing. The magnetic resonance slices were then retrospectively sorted into 14 amplitude-binned respiratory states, end-expiration, end-inspiration, six intermediary states during inspiration, and six during expiration using the recorded Navigator signal. XCAT phantoms were then generated based on these MRI data by interactive alignment of the organ contours of the XCAT with the MRI slices using a graphical user interface. Thus far we have created five body motion and five respiratory motion XCAT phantoms from the MRI acquisitions of six healthy volunteers (three males and three females). Non-rigid motion exhibited by the volunteers was reflected in both respiratory

  8. Orbital energies and structural non-rigidity of complex hydrides according to data on ab initio calculations

    Energy Technology Data Exchange (ETDEWEB)

    Boldyrev, A I; Sukhanov, L P; Charkin, O P [AN SSSR, Moscow. Inst. Novykh Khimicheskikh Problem

    1982-01-01

    In approximation by the Hartree-Fock-Routine method using several Gauss type bases ionization potentials of complex hydrides LiBeH/sub 3/, NaBeH/sub 3/, LiMgH/sub 3/, LiBH/sub 4/, NaBH/sub 4/ and LiAlH/sub 4/ have been calculated. A problem of the show of structural non-rigidity of complex molecules L(MX/sub 4/) with tetrahedral anions (MX/sub 4/)/sup -/ in photoelectron spectra is considered.

  9. 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.

  10. Simultaneous PET-MR acquisition and MR-derived motion fields for correction of non-rigid motion in PET

    International Nuclear Information System (INIS)

    Tsoumpas, C.; Mackewn, J.E.; Halsted, P.; King, A.P.; Buerger, C.; Totman, J.J.; Schaeffter, T.; Marsden, P.K.

    2010-01-01

    Positron emission tomography (PET) provides an accurate measurement of radiotracer concentration in vivo, but performance can be limited by subject motion which degrades spatial resolution and quantitative accuracy. This effect may become a limiting factor for PET studies in the body as PET scanner technology improves. In this work, we propose a new approach to address this problem by employing motion information from images measured simultaneously using a magnetic resonance (MR) scanner. The approach is demonstrated using an MR-compatible PET scanner and PET-MR acquisition with a purpose-designed phantom capable of non-rigid deformations. Measured, simultaneously acquired MR data were used to correct for motion in PET, and results were compared with those obtained using motion information from PET images alone. Motion artefacts were significantly reduced and the PET image quality and quantification was significantly improved by the use of MR motion fields, whilst the use of PET-only motion information was less successful. Combined PET-MR acquisitions potentially allow PET motion compensation in whole-body acquisitions without prolonging PET acquisition time or increasing radiation dose. This, to the best of our knowledge, is the first study to demonstrate that simultaneously acquired MR data can be used to estimate and correct for the effects of non-rigid motion in PET. (author)

  11. FZUImageReg: A toolbox for medical image registration and dose fusion in cervical cancer radiotherapy.

    Directory of Open Access Journals (Sweden)

    Qinquan Gao

    Full Text Available The combination external-beam radiotherapy and high-dose-rate brachytherapy is a standard form of treatment for patients with locally advanced uterine cervical cancer. Personalized radiotherapy in cervical cancer requires efficient and accurate dose planning and assessment across these types of treatment. To achieve radiation dose assessment, accurate mapping of the dose distribution from HDR-BT onto EBRT is extremely important. However, few systems can achieve robust dose fusion and determine the accumulated dose distribution during the entire course of treatment. We have therefore developed a toolbox (FZUImageReg, which is a user-friendly dose fusion system based on hybrid image registration for radiation dose assessment in cervical cancer radiotherapy. The main part of the software consists of a collection of medical image registration algorithms and a modular design with a user-friendly interface, which allows users to quickly configure, test, monitor, and compare different registration methods for a specific application. Owing to the large deformation, the direct application of conventional state-of-the-art image registration methods is not sufficient for the accurate alignment of EBRT and HDR-BT images. To solve this problem, a multi-phase non-rigid registration method using local landmark-based free-form deformation is proposed for locally large deformation between EBRT and HDR-BT images, followed by intensity-based free-form deformation. With the transformation, the software also provides a dose mapping function according to the deformation field. The total dose distribution during the entire course of treatment can then be presented. Experimental results clearly show that the proposed system can achieve accurate registration between EBRT and HDR-BT images and provide radiation dose warping and fusion results for dose assessment in cervical cancer radiotherapy in terms of high accuracy and efficiency.

  12. SU-C-BRA-07: Variability of Patient-Specific Motion Models Derived Using Different Deformable Image Registration Algorithms for Lung Cancer Stereotactic Body Radiotherapy (SBRT) Patients

    Energy Technology Data Exchange (ETDEWEB)

    Dhou, S; Williams, C [Brigham and Women’s Hospital / Harvard Medical School, Boston, MA (United States); Ionascu, D [William Beaumont Hospital, Royal Oak, MI (United States); Lewis, J [University of California at Los Angeles, Los Angeles, CA (United States)

    2016-06-15

    Purpose: To study the variability of patient-specific motion models derived from 4-dimensional CT (4DCT) images using different deformable image registration (DIR) algorithms for lung cancer stereotactic body radiotherapy (SBRT) patients. Methods: Motion models are derived by 1) applying DIR between each 4DCT image and a reference image, resulting in a set of displacement vector fields (DVFs), and 2) performing principal component analysis (PCA) on the DVFs, resulting in a motion model (a set of eigenvectors capturing the variations in the DVFs). Three DIR algorithms were used: 1) Demons, 2) Horn-Schunck, and 3) iterative optical flow. The motion models derived were compared using patient 4DCT scans. Results: Motion models were derived and the variations were evaluated according to three criteria: 1) the average root mean square (RMS) difference which measures the absolute difference between the components of the eigenvectors, 2) the dot product between the eigenvectors which measures the angular difference between the eigenvectors in space, and 3) the Euclidean Model Norm (EMN), which is calculated by summing the dot products of an eigenvector with the first three eigenvectors from the reference motion model in quadrature. EMN measures how well an eigenvector can be reconstructed using another motion model derived using a different DIR algorithm. Results showed that comparing to a reference motion model (derived using the Demons algorithm), the eigenvectors of the motion model derived using the iterative optical flow algorithm has smaller RMS, larger dot product, and larger EMN values than those of the motion model derived using Horn-Schunck algorithm. Conclusion: The study showed that motion models vary depending on which DIR algorithms were used to derive them. The choice of a DIR algorithm may affect the accuracy of the resulting model, and it is important to assess the suitability of the algorithm chosen for a particular application. This project was supported

  13. SU-C-BRA-07: Variability of Patient-Specific Motion Models Derived Using Different Deformable Image Registration Algorithms for Lung Cancer Stereotactic Body Radiotherapy (SBRT) Patients

    International Nuclear Information System (INIS)

    Dhou, S; Williams, C; Ionascu, D; Lewis, J

    2016-01-01

    Purpose: To study the variability of patient-specific motion models derived from 4-dimensional CT (4DCT) images using different deformable image registration (DIR) algorithms for lung cancer stereotactic body radiotherapy (SBRT) patients. Methods: Motion models are derived by 1) applying DIR between each 4DCT image and a reference image, resulting in a set of displacement vector fields (DVFs), and 2) performing principal component analysis (PCA) on the DVFs, resulting in a motion model (a set of eigenvectors capturing the variations in the DVFs). Three DIR algorithms were used: 1) Demons, 2) Horn-Schunck, and 3) iterative optical flow. The motion models derived were compared using patient 4DCT scans. Results: Motion models were derived and the variations were evaluated according to three criteria: 1) the average root mean square (RMS) difference which measures the absolute difference between the components of the eigenvectors, 2) the dot product between the eigenvectors which measures the angular difference between the eigenvectors in space, and 3) the Euclidean Model Norm (EMN), which is calculated by summing the dot products of an eigenvector with the first three eigenvectors from the reference motion model in quadrature. EMN measures how well an eigenvector can be reconstructed using another motion model derived using a different DIR algorithm. Results showed that comparing to a reference motion model (derived using the Demons algorithm), the eigenvectors of the motion model derived using the iterative optical flow algorithm has smaller RMS, larger dot product, and larger EMN values than those of the motion model derived using Horn-Schunck algorithm. Conclusion: The study showed that motion models vary depending on which DIR algorithms were used to derive them. The choice of a DIR algorithm may affect the accuracy of the resulting model, and it is important to assess the suitability of the algorithm chosen for a particular application. This project was supported

  14. Objective and expert-independent validation of retinal image registration algorithms by a projective imaging distortion model.

    Science.gov (United States)

    Lee, Sangyeol; Reinhardt, Joseph M; Cattin, Philippe C; Abràmoff, Michael D

    2010-08-01

    Fundus camera imaging of the retina is widely used to diagnose and manage ophthalmologic disorders including diabetic retinopathy, glaucoma, and age-related macular degeneration. Retinal images typically have a limited field of view, and multiple images can be joined together using an image registration technique to form a montage with a larger field of view. A variety of methods for retinal image registration have been proposed, but evaluating such methods objectively is difficult due to the lack of a reference standard for the true alignment of the individual images that make up the montage. A method of generating simulated retinal images by modeling the geometric distortions due to the eye geometry and the image acquisition process is described in this paper. We also present a validation process that can be used for any retinal image registration method by tracing through the distortion path and assessing the geometric misalignment in the coordinate system of the reference standard. The proposed method can be used to perform an accuracy evaluation over the whole image, so that distortion in the non-overlapping regions of the montage components can be easily assessed. We demonstrate the technique by generating test image sets with a variety of overlap conditions and compare the accuracy of several retinal image registration models. Copyright 2010 Elsevier B.V. All rights reserved.

  15. 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)...

  16. Calculation of the temperature of asphalt concrete at making the joints of multilane road pavement of non-rigid type

    Directory of Open Access Journals (Sweden)

    Giyasov Botir Iminzhonovich

    2015-03-01

    Full Text Available The construction quality of road surface of non-rigid type essentially depend on providing the temperature regimes in the process of laying and packing of hot asphalt concrete mixtures. In order to provide the required characteristics of asphalt concrete due to the surface width it is necessary to provide the temperature regimes of hot asphalt concrete mixture in the zones of lane connection. The hot mixture is promptly cooling right after laying within several minutes, which results, according to the construction technology and the specific conditions of work production, in temperature abuse of the mixture at joints of the lanes at packing. The authors present the analysis of the technology of arranging multilane road surface by one paver with the possibility of heating the surface lane edge with the temperature of the adjacent lane. The results of the studies of the production conditions effect on the temperature of edge heating of the previously laid lanes, and the time required to achieve the maximum heating temperature depending on the relative thickness of coating layers.

  17. SU-E-J-266: A Pitfall of a Deformable Image Registration in Lung Cancer

    Energy Technology Data Exchange (ETDEWEB)

    Sugawara, Y [The National Center for Global Health and Medicine, Shinjuku, Tokyo (Japan); Tachibana, H [The National Cancer Center Hospital East, Kashiwa, Chiba (Japan); Moriya, S [Komazawa University, Setagaya, Tokyo (Japan); Sawant, A [UT Southwestern Medical Center, Dallas, TX (United States)

    2014-06-01

    Purpose: For four-dimensional (4D) planning and adaptive radiotherapy, deformable image registration (DIR) is needed and the accuracy is essential. We evaluated the accuracy of one free-downloadable DIR software library package (NiftyReg) and one commercial DIR software (MIM) in lung SBRT cancer patients. Methods: A rigid and non-rigid registrations were implemented to our in-house software. The non-rigid registration algorithm of the NiftyReg and MIM was based on the free-form deformation. The accuracy of the two software was evaluated when contoured structures to peak-inhale and peak-exhale 4DCT image data sets were measured using the dice similarity coefficient (DSC). The evaluation was performed in 20 lung SBRT patients. Results: In our visual evaluation, the eighteen cases show good agreement between the deformed structures for the peak-inhale phase and the peak-exhale phase structures (more than 0.8 DSC value). In the evaluation of the DSC in-house software, averaged DSC values of GTV and lung, heart, spinal cord, stomach and body were 0.862 and 0.979, 0.932, 0.974, 0.860, 0.998, respectively. As the Resultof the registration using the MIM program in the two cases which had less than 0.7 DSC value when analyzed using the in-house software, the DSC value were improved to 0.8. The CT images in a case with low DSC value shows the tumor was surrounded by the structure with the similar CT values, which were the chest wall or the diaphragm. Conclusion: Not only a free-downloadable DIR software but also a commercial software may provide unexpected results and there is a possibility that the results would make us misjudge the treatment planning. Therefore, we recommend that a commissioning test of any DIR software should be performed before clinical use and we should understand the characteristics of the software.

  18. SU-E-J-266: A Pitfall of a Deformable Image Registration in Lung Cancer

    International Nuclear Information System (INIS)

    Sugawara, Y; Tachibana, H; Moriya, S; Sawant, A

    2014-01-01

    Purpose: For four-dimensional (4D) planning and adaptive radiotherapy, deformable image registration (DIR) is needed and the accuracy is essential. We evaluated the accuracy of one free-downloadable DIR software library package (NiftyReg) and one commercial DIR software (MIM) in lung SBRT cancer patients. Methods: A rigid and non-rigid registrations were implemented to our in-house software. The non-rigid registration algorithm of the NiftyReg and MIM was based on the free-form deformation. The accuracy of the two software was evaluated when contoured structures to peak-inhale and peak-exhale 4DCT image data sets were measured using the dice similarity coefficient (DSC). The evaluation was performed in 20 lung SBRT patients. Results: In our visual evaluation, the eighteen cases show good agreement between the deformed structures for the peak-inhale phase and the peak-exhale phase structures (more than 0.8 DSC value). In the evaluation of the DSC in-house software, averaged DSC values of GTV and lung, heart, spinal cord, stomach and body were 0.862 and 0.979, 0.932, 0.974, 0.860, 0.998, respectively. As the Resultof the registration using the MIM program in the two cases which had less than 0.7 DSC value when analyzed using the in-house software, the DSC value were improved to 0.8. The CT images in a case with low DSC value shows the tumor was surrounded by the structure with the similar CT values, which were the chest wall or the diaphragm. Conclusion: Not only a free-downloadable DIR software but also a commercial software may provide unexpected results and there is a possibility that the results would make us misjudge the treatment planning. Therefore, we recommend that a commissioning test of any DIR software should be performed before clinical use and we should understand the characteristics of the software

  19. 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.

  20. 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.

  1. Patient-specific non-linear finite element modelling for predicting soft organ deformation in real-time: application to non-rigid neuroimage registration.

    Science.gov (United States)

    Wittek, Adam; Joldes, Grand; Couton, Mathieu; Warfield, Simon K; Miller, Karol

    2010-12-01

    Long computation times of non-linear (i.e. accounting for geometric and material non-linearity) biomechanical models have been regarded as one of the key factors preventing application of such models in predicting organ deformation for image-guided surgery. This contribution presents real-time patient-specific computation of the deformation field within the brain for six cases of brain shift induced by craniotomy (i.e. surgical opening of the skull) using specialised non-linear finite element procedures implemented on a graphics processing unit (GPU). In contrast to commercial finite element codes that rely on an updated Lagrangian formulation and implicit integration in time domain for steady state solutions, our procedures utilise the total Lagrangian formulation with explicit time stepping and dynamic relaxation. We used patient-specific finite element meshes consisting of hexahedral and non-locking tetrahedral elements, together with realistic material properties for the brain tissue and appropriate contact conditions at the boundaries. The loading was defined by prescribing deformations on the brain surface under the craniotomy. Application of the computed deformation fields to register (i.e. align) the preoperative and intraoperative images indicated that the models very accurately predict the intraoperative deformations within the brain. For each case, computing the brain deformation field took less than 4 s using an NVIDIA Tesla C870 GPU, which is two orders of magnitude reduction in computation time in comparison to our previous study in which the brain deformation was predicted using a commercial finite element solver executed on a personal computer. Copyright © 2010 Elsevier Ltd. All rights reserved.

  2. Detailed analysis of the density change on chest CT of COPD using non-rigid registration of inspiration/expiration CT scans

    Energy Technology Data Exchange (ETDEWEB)

    Kim, Eun Young [Chonbuk National University Medical School and Hospital, Research Institute of Clinical Medicine, Department of Radiology, Jeollabuk-do (Korea, Republic of); University of Ulsan College of Medicine, Asan Medical Center, Department of Radiology and Research Institute of Radiology, Seoul (Korea, Republic of); Seo, Joon Beom; Lee, Hyun Joo; Kim, Namkug; Lee, Eunsol; Lee, Sang Min; Oh, Sang Young [University of Ulsan College of Medicine, Asan Medical Center, Department of Radiology and Research Institute of Radiology, Seoul (Korea, Republic of); Hwang, Hye Jeon [Hallym University Sacred Heart Hospital, Department of Radiology, Hallym University College of Medicine, Gyeonggi-do (Korea, Republic of); Oh, Yeon-Mok; Lee, Sang-Do [University of Ulsan College of Medicine, Asan Medical Center, Department of Pulmonary and Critical Care Medicine, and Clinical Research Center for Chronic Obstructive Airway Diseases, Seoul (Korea, Republic of)

    2014-09-14

    One objective was to evaluate the air trapping index (ATI), measured by inspiration/expiration CT, in COPD patients and nonsmokers. Another objective was to assess the association between the pulmonary function test (PFT) and CT parameters such as ATI or other indices, separately in the whole lung, in emphysema, and in hyperinflated and normal lung areas. One hundred and thirty-eight COPD patients and 29 nonsmokers were included in our study. The ATI, the emphysema index (EI), the gas trapping index (Exp -856) and expiration/inspiration ratio of mean lung density (E/Iratio of MLD) were measured on CT. The values of the whole lung, of emphysema, and of hyperinflated and normal lung areas were compared and then correlated with various PFT parameters. Compared with nonsmokers, COPD patients showed a higher ATI in the whole lung and in each lung lesion (all P < 0.05). The ATI showed a higher correlation than EI with FEF{sub 25-75%}, RV and RV/TLC, and was comparable to Exp -856 and the E/I ratio of MLD. The ATI of emphysema and hyperinflated areas on CT showed better correlation than the normal lung area with PFT parameters. Detailed analysis of density change at inspiration and expiration CT of COPD can provide new insights into pulmonary functional impairment in each lung area. (orig.)

  3. Detailed analysis of the density change on chest CT of COPD using non-rigid registration of inspiration/expiration CT scans

    International Nuclear Information System (INIS)

    Kim, Eun Young; Seo, Joon Beom; Lee, Hyun Joo; Kim, Namkug; Lee, Eunsol; Lee, Sang Min; Oh, Sang Young; Hwang, Hye Jeon; Oh, Yeon-Mok; Lee, Sang-Do

    2015-01-01

    One objective was to evaluate the air trapping index (ATI), measured by inspiration/expiration CT, in COPD patients and nonsmokers. Another objective was to assess the association between the pulmonary function test (PFT) and CT parameters such as ATI or other indices, separately in the whole lung, in emphysema, and in hyperinflated and normal lung areas. One hundred and thirty-eight COPD patients and 29 nonsmokers were included in our study. The ATI, the emphysema index (EI), the gas trapping index (Exp -856) and expiration/inspiration ratio of mean lung density (E/Iratio of MLD) were measured on CT. The values of the whole lung, of emphysema, and of hyperinflated and normal lung areas were compared and then correlated with various PFT parameters. Compared with nonsmokers, COPD patients showed a higher ATI in the whole lung and in each lung lesion (all P 25-75% , RV and RV/TLC, and was comparable to Exp -856 and the E/I ratio of MLD. The ATI of emphysema and hyperinflated areas on CT showed better correlation than the normal lung area with PFT parameters. Detailed analysis of density change at inspiration and expiration CT of COPD can provide new insights into pulmonary functional impairment in each lung area. (orig.)

  4. Continental deformation accommodated by non-rigid passive bookshelf faulting: An example from the Cenozoic tectonic development of northern Tibet

    Science.gov (United States)

    Zuza, Andrew V.; Yin, An

    2016-05-01

    Collision-induced continental deformation commonly involves complex interactions between strike-slip faulting and off-fault deformation, yet this relationship has rarely been quantified. In northern Tibet, Cenozoic deformation is expressed by the development of the > 1000-km-long east-striking left-slip Kunlun, Qinling, and Haiyuan faults. Each have a maximum slip in the central fault segment exceeding 10s to ~ 100 km but a much smaller slip magnitude (~bookshelf-fault model for the Cenozoic tectonic development of northern Tibet. Our model, quantitatively relating discrete left-slip faulting to distributed off-fault deformation during regional clockwise rotation, explains several puzzling features, including the: (1) clockwise rotation of east-striking left-slip faults against the northeast-striking left-slip Altyn Tagh fault along the northwestern margin of the Tibetan Plateau, (2) alternating fault-parallel extension and shortening in the off-fault regions, and (3) eastward-tapering map-view geometries of the Qimen Tagh, Qaidam, and Qilian Shan thrust belts that link with the three major left-slip faults in northern Tibet. We refer to this specific non-rigid bookshelf-fault system as a passive bookshelf-fault system because the rotating bookshelf panels are detached from the rigid bounding domains. As a consequence, the wallrock of the strike-slip faults deforms to accommodate both the clockwise rotation of the left-slip faults and off-fault strain that arises at the fault ends. An important implication of our model is that the style and magnitude of Cenozoic deformation in northern Tibet vary considerably in the east-west direction. Thus, any single north-south cross section and its kinematic reconstruction through the region do not properly quantify the complex deformational processes of plateau formation.

  5. Mao-Gilles Stabilization Algorithm

    OpenAIRE

    Jérôme Gilles

    2013-01-01

    Originally, the Mao-Gilles stabilization algorithm was designed to compensate the non-rigid deformations due to atmospheric turbulence. Given a sequence of frames affected by atmospheric turbulence, the algorithm uses a variational model combining optical flow and regularization to characterize the static observed scene. The optimization problem is solved by Bregman Iteration and the operator splitting method. The algorithm is simple, efficient, and can be easily generalized for different sce...

  6. 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

  7. 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.

  8. 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.

  9. 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

  10. 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

  11. Qualitative and quantitative evaluation of rigid and deformable motion correction algorithms using dual-energy CT images in view of application to CT perfusion measurements in abdominal organs affected by breathing motion.

    Science.gov (United States)

    Skornitzke, S; Fritz, F; Klauss, M; Pahn, G; Hansen, J; Hirsch, J; Grenacher, L; Kauczor, H-U; Stiller, W

    2015-02-01

    To compare six different scenarios for correcting for breathing motion in abdominal dual-energy CT (DECT) perfusion measurements. Rigid [RRComm(80 kVp)] and non-rigid [NRComm(80 kVp)] registration of commercially available CT perfusion software, custom non-rigid registration [NRCustom(80 kVp], demons algorithm) and a control group [CG(80 kVp)] without motion correction were evaluated using 80 kVp images. Additionally, NRCustom was applied to dual-energy (DE)-blended [NRCustom(DE)] and virtual non-contrast [NRCustom(VNC)] images, yielding six evaluated scenarios. After motion correction, perfusion maps were calculated using a combined maximum slope/Patlak model. For qualitative evaluation, three blinded radiologists independently rated motion correction quality and resulting perfusion maps on a four-point scale (4 = best, 1 = worst). For quantitative evaluation, relative changes in metric values, R(2) and residuals of perfusion model fits were calculated. For motion-corrected images, mean ratings differed significantly [NRCustom(80 kVp) and NRCustom(DE), 3.3; NRComm(80 kVp), 3.1; NRCustom(VNC), 2.9; RRComm(80 kVp), 2.7; CG(80 kVp), 2.7; all p VNC), 22.8%; RRComm(80 kVp), 0.6%; CG(80 kVp), 0%]. Regarding perfusion maps, NRCustom(80 kVp) and NRCustom(DE) were rated highest [NRCustom(80 kVp), 3.1; NRCustom(DE), 3.0; NRComm(80 kVp), 2.8; NRCustom(VNC), 2.6; CG(80 kVp), 2.5; RRComm(80 kVp), 2.4] and had significantly higher R(2) and lower residuals. Correlation between qualitative and quantitative evaluation was low to moderate. Non-rigid motion correction improves spatial alignment of the target region and fit of CT perfusion models. Using DE-blended and DE-VNC images for deformable registration offers no significant improvement. Non-rigid algorithms improve the quality of abdominal CT perfusion measurements but do not benefit from DECT post processing.

  12. 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

  13. A review of biomechanically informed breast image registration

    International Nuclear Information System (INIS)

    Hipwell, John H; Vavourakis, Vasileios; Mertzanidou, Thomy; Eiben, Björn; Hawkes, David J; Han, Lianghao

    2016-01-01

    Breast radiology encompasses the full range of imaging modalities from routine imaging via x-ray mammography, magnetic resonance imaging and ultrasound (both two- and three-dimensional), to more recent technologies such as digital breast tomosynthesis, and dedicated breast imaging systems for positron emission mammography and ultrasound tomography. In addition new and experimental modalities, such as Photoacoustics, Near Infrared Spectroscopy and Electrical Impedance Tomography etc, are emerging. The breast is a highly deformable structure however, and this greatly complicates visual comparison of imaging modalities for the purposes of breast screening, cancer diagnosis (including image guided biopsy), tumour staging, treatment monitoring, surgical planning and simulation of the effects of surgery and wound healing etc. Due primarily to the challenges posed by these gross, non-rigid deformations, development of automated methods which enable registration, and hence fusion, of information within and across breast imaging modalities, and between the images and the physical space of the breast during interventions, remains an active research field which has yet to translate suitable methods into clinical practice. This review describes current research in the field of breast biomechanical modelling and identifies relevant publications where the resulting models have been incorporated into breast image registration and simulation algorithms. Despite these developments there remain a number of issues that limit clinical application of biomechanical modelling. These include the accuracy of constitutive modelling, implementation of representative boundary conditions, failure to meet clinically acceptable levels of computational cost, challenges associated with automating patient-specific model generation (i.e. robust image segmentation and mesh generation) and the complexity of applying biomechanical modelling methods in routine clinical practice. (topical review)

  14. Algorithms

    Indian Academy of Sciences (India)

    polynomial) division have been found in Vedic Mathematics which are dated much before Euclid's algorithm. A programming language Is used to describe an algorithm for execution on a computer. An algorithm expressed using a programming.

  15. Free-form image registration of human cochlear μCT data using skeleton similarity as anatomical prior

    DEFF Research Database (Denmark)

    Kjer, Hans Martin; Fagertun, Jens; Vera, Sergio

    2016-01-01

    Better understanding of the anatomical variability of the human cochlear is important for the design and function of Cochlear Implants. Proper non-rigid alignment of high-resolution cochlear μCT data is a challenge for the typical cubic B-spline registration model. In this paper we study one way ...

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

    International Nuclear Information System (INIS)

    Andersen, E S; Muren, L P; Thor, M; Petersen, J B; Tanderup, K; Sørensen, T S; Noe, K Ø; Høyer, M; Bentzen, L

    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) to improve the accuracy of bladder dose assessment. For each of nine prostate cancer patients, the initial treatment plan was re-calculated on eight to nine repeat computed tomography (CT) scans. The planned bladder dose–volume histogram (DVH) parameters were compared to corresponding parameters derived from DIR-based accumulations as well as DVH summation based on dose re-calculations. It was found that the deviations between the DIR-based accumulations and the planned treatment were substantial and ranged (−0.5–2.3) Gy and (−9.4–13.5) Gy for D 2% and D mean , respectively, whereas the deviations between DIR-based accumulations and DVH summation were small and well within 1 Gy. For the investigated treatment scenario, DIR-based bladder dose accumulation did not result in substantial improvement of dose estimation as compared to the straightforward DVH summation. Large variations were found in individual patients between the doses from the initial treatment plan and the accumulated bladder doses. Hence, the use of repeat imaging has a potential for improved accuracy in treatment dose reporting. (paper)

  17. Diffusion Maps for Multimodal Registration

    Directory of Open Access Journals (Sweden)

    Gemma Piella

    2014-06-01

    Full Text Available Multimodal image registration is a difficult task, due to the significant intensity variations between the images. A common approach is to use sophisticated similarity measures, such as mutual information, that are robust to those intensity variations. However, these similarity measures are computationally expensive and, moreover, often fail to capture the geometry and the associated dynamics linked with the images. Another approach is the transformation of the images into a common space where modalities can be directly compared. Within this approach, we propose to register multimodal images by using diffusion maps to describe the geometric and spectral properties of the data. Through diffusion maps, the multimodal data is transformed into a new set of canonical coordinates that reflect its geometry uniformly across modalities, so that meaningful correspondences can be established between them. Images in this new representation can then be registered using a simple Euclidean distance as a similarity measure. Registration accuracy was evaluated on both real and simulated brain images with known ground-truth for both rigid and non-rigid registration. Results showed that the proposed approach achieved higher accuracy than the conventional approach using mutual information.

  18. 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.

  19. 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.

  20. 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.)

  1. Registration Service

    CERN Multimedia

    GS Department

    2010-01-01

    Following a reorganization in Building 55, please note that the Registration Service is now organised as follows :  Ground floor: access cards (76903). 1st floor : registration of external firms’ personnel (76611 / 76622); car access stickers (76633); biometric registration (79710). Opening hours: 07-30 to 16-00 non-stop. GS-SEM Group General Infrastructure Services Department

  2. The algorithm to generate color point-cloud with the registration between panoramic image and laser point-cloud

    International Nuclear Information System (INIS)

    Zeng, Fanyang; Zhong, Ruofei

    2014-01-01

    Laser point cloud contains only intensity information and it is necessary for visual interpretation to obtain color information from other sensor. Cameras can provide texture, color, and other information of the corresponding object. Points with color information of corresponding pixels in digital images can be used to generate color point-cloud and is conducive to the visualization, classification and modeling of point-cloud. Different types of digital cameras are used in different Mobile Measurement Systems (MMS).the principles and processes for generating color point-cloud in different systems are not the same. The most prominent feature of the panoramic images is the field of 360 degrees view angle in the horizontal direction, to obtain the image information around the camera as much as possible. In this paper, we introduce a method to generate color point-cloud with panoramic image and laser point-cloud, and deduce the equation of the correspondence between points in panoramic images and laser point-clouds. The fusion of panoramic image and laser point-cloud is according to the collinear principle of three points (the center of the omnidirectional multi-camera system, the image point on the sphere, the object point). The experimental results show that the proposed algorithm and formulae in this paper are correct

  3. Algorithms

    Indian Academy of Sciences (India)

    to as 'divide-and-conquer'. Although there has been a large effort in realizing efficient algorithms, there are not many universally accepted algorithm design paradigms. In this article, we illustrate algorithm design techniques such as balancing, greedy strategy, dynamic programming strategy, and backtracking or traversal of ...

  4. Complexity and accuracy of image registration methods in SPECT-guided radiation therapy

    Energy Technology Data Exchange (ETDEWEB)

    Yin, L S; Duzenli, C; Moiseenko, V [Physics and Astronomy, University of British Columbia, 6224 Agricultural Road, Vancouver, BC, V6T 1Z1 (Canada); Tang, L; Hamarneh, G [Computing Science, Simon Fraser University, 9400 TASC1, Burnaby, BC, V5A 1S6 (Canada); Gill, B [Medical Physics, Vancouver Cancer Centre, BC Cancer Agency, 600 West 10th Ave, Vancouver, BC, V5Z 4E6 (Canada); Celler, A; Shcherbinin, S [Department of Radiology, University of British Columbia, 828 West 10th Ave, Vancouver, BC, V5Z 1L8 (Canada); Fua, T F; Thompson, A; Sheehan, F [Radiation Oncology, Vancouver Cancer Centre, BC Cancer Agency, 600 West 10th Ave, Vancouver, BC, V5Z 4E6 (Canada); Liu, M [Radiation Oncology, Fraser Valley Cancer Centre, BC Cancer Agency, 13750 9th Ave, Surrey, BC, V3V 1Z2 (Canada)], E-mail: lyin@bccancer.bc.ca

    2010-01-07

    The use of functional imaging in radiotherapy treatment (RT) planning requires accurate co-registration of functional imaging scans to CT scans. We evaluated six methods of image registration for use in SPECT-guided radiotherapy treatment planning. Methods varied in complexity from 3D affine transform based on control points to diffeomorphic demons and level set non-rigid registration. Ten lung cancer patients underwent perfusion SPECT-scans prior to their radiotherapy. CT images from a hybrid SPECT/CT scanner were registered to a planning CT, and then the same transformation was applied to the SPECT images. According to registration evaluation measures computed based on the intensity difference between the registered CT images or based on target registration error, non-rigid registrations provided a higher degree of accuracy than rigid methods. However, due to the irregularities in some of the obtained deformation fields, warping the SPECT using these fields may result in unacceptable changes to the SPECT intensity distribution that would preclude use in RT planning. Moreover, the differences between intensity histograms in the original and registered SPECT image sets were the largest for diffeomorphic demons and level set methods. In conclusion, the use of intensity-based validation measures alone is not sufficient for SPECT/CT registration for RTTP. It was also found that the proper evaluation of image registration requires the use of several accuracy metrics.

  5. 4D ultrasound and 3D MRI registration of beating heart

    International Nuclear Information System (INIS)

    Herlambang, N.; Matsumiya, K.; Masamune, K.; Dohi, T.; Liao, H.; Tsukihara, H.; Takamoto, S.

    2007-01-01

    To realize intra-cardiac surgery without cardio-pulmonary bypass, a medical imaging technique with both high image quality and data acquisition rate that is fast enough to follow heart beat movements is required. In this research, we proposed a method that utilized the image quality of MRI and the speed of ultrasound. We developed a 4D image reconstruction method using image registration of 3D MRI and 4D ultrasound images. The registration method consists of rigid registration between 3D MRI and 3D ultrasound with the same heart beat phase, and non-rigid registration between 3D ultrasound images from different heart beat phases. Non-rigid registration was performed with B-spline based registration using variable spring model. In phantom experiment using balloon phantom, registration accuracy was less than 2 mm for total heart volume variation range of 10%. We applied our registration method on 3D MRI and 4D ultrasound images of a volunteer's beating heart data and confirmed through visual observation that heart beat pattern was well reproduced. (orig.)

  6. The effect of rigid and non-rigid connections between implants and teeth on biological and technical complications: a systematic review and a meta-analysis.

    Science.gov (United States)

    Tsaousoglou, Phoebus; Michalakis, Konstantinos; Kang, Kiho; Weber, Hans-Peter; Sculean, Anton

    2017-07-01

    To assess survival, as well as technical and biological complication rates of partial fixed dental prostheses (FDPs) supported by implants and teeth. An electronic Medline search was conducted to identify articles, published in dental journals from January 1980 to August 2015, reporting on partial FDPs supported by implants and teeth. The search terms were categorized into four groups comprising the PICO question. Manual searches of published full-text articles and related reviews were also performed. The initial database search produced 3587 relevant titles. Three hundred and eighty-six articles were retrieved for abstract review, while 39 articles were selected for full-text review. A total of 10 studies were selected for inclusion. Overall survival rate for implants ranged between 90% and 100%, after follow-up periods with a mean range of 18-120 months. The survival of the abutment teeth was 94.1-100%, while the prostheses survival was 85-100% for the same time period. The most frequent complications were "periapical lesions" (11.53%). The most frequent technical complication was "porcelain occlusal fracture" (16.6%), followed by "screw loosening" (15%). According to the meta-analysis, no intrusion was noted on the rigid connection group, while five teeth (8.19%) were intruded in the non-rigid connection group [95% CI (0.013-0.151)]. The tooth-implant FDP seems to be a possible alternative to an implant-supported FDP. There is limited evidence that rigid connection between teeth and implants presents better results when compared with the non-rigid one. The major drawback of non-rigidly connected FDPs is tooth intrusion. © 2016 John Wiley & Sons A/S. Published by John Wiley & Sons Ltd.

  7. 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...

  8. SU-E-J-94: Geometric and Dosimetric Evaluation of Deformation Image Registration Algorithms Using Virtual Phantoms Generated From Patients with Lung Cancer

    International Nuclear Information System (INIS)

    Shen, Z; Greskovich, J; Xia, P; Bzdusek, K

    2015-01-01

    Purpose: To generate virtual phantoms with clinically relevant deformation and use them to objectively evaluate geometric and dosimetric uncertainties of deformable image registration (DIR) algorithms. Methods: Ten lung cancer patients undergoing adaptive 3DCRT planning were selected. For each patient, a pair of planning CT (pCT) and replanning CT (rCT) were used as the basis for virtual phantom generation. Manually adjusted meshes were created for selected ROIs (e.g. PTV, lungs, spinal cord, esophagus, and heart) on pCT and rCT. The mesh vertices were input into a thin-plate spline algorithm to generate a reference displacement vector field (DVF). The reference DVF was used to deform pCT to generate a simulated replanning CT (srCT) that was closely matched to rCT. Three DIR algorithms (Demons, B-Spline, and intensity-based) were applied to these ten virtual phantoms. The images, ROIs, and doses were mapped from pCT to srCT using the DVFs computed by these three DIRs and compared to those mapped using the reference DVF. Results: The average Dice coefficients for selected ROIs were from 0.85 to 0.96 for Demons, from 0.86 to 0.97 for intensity-based, and from 0.76 to 0.95 for B-Spline. The average Hausdorff distances for selected ROIs were from 2.2 to 5.4 mm for Demons, from 2.3 to 6.8 mm for intensity-based, and from 2.4 to 11.4 mm for B-Spline. The average absolute dose errors for selected ROIs were from 0.2 to 0.6 Gy for Demons, from 0.1 to 0.5 Gy for intensity-based, and from 0.5 to 1.5 Gy for B-Spline. Conclusion: Virtual phantoms were modeled after patients with lung cancer and were clinically relevant for adaptive radiotherapy treatment replanning. Virtual phantoms with known DVFs serve as references and can provide a fair comparison when evaluating different DIRs. Demons and intensity-based DIRs were shown to have smaller geometric and dosimetric uncertainties than B-Spline. Z Shen: None; K Bzdusek: an employee of Philips Healthcare; J Greskovich: None; P Xia

  9. SU-F-BRF-09: A Non-Rigid Point Matching Method for Accurate Bladder Dose Summation in Cervical Cancer HDR Brachytherapy

    International Nuclear Information System (INIS)

    Chen, H; Zhen, X; Zhou, L; Zhong, Z; Pompos, A; Yan, H; Jiang, S; Gu, X

    2014-01-01

    Purpose: To propose and validate a deformable point matching scheme for surface deformation to facilitate accurate bladder dose summation for fractionated HDR cervical cancer treatment. Method: A deformable point matching scheme based on the thin plate spline robust point matching (TPSRPM) algorithm is proposed for bladder surface registration. The surface of bladders segmented from fractional CT images is extracted and discretized with triangular surface mesh. Deformation between the two bladder surfaces are obtained by matching the two meshes' vertices via the TPS-RPM algorithm, and the deformation vector fields (DVFs) characteristic of this deformation is estimated by B-spline approximation. Numerically, the algorithm is quantitatively compared with the Demons algorithm using five clinical cervical cancer cases by several metrics: vertex-to-vertex distance (VVD), Hausdorff distance (HD), percent error (PE), and conformity index (CI). Experimentally, the algorithm is validated on a balloon phantom with 12 surface fiducial markers. The balloon is inflated with different amount of water, and the displacement of fiducial markers is benchmarked as ground truth to study TPS-RPM calculated DVFs' accuracy. Results: In numerical evaluation, the mean VVD is 3.7(±2.0) mm after Demons, and 1.3(±0.9) mm after TPS-RPM. The mean HD is 14.4 mm after Demons, and 5.3mm after TPS-RPM. The mean PE is 101.7% after Demons and decreases to 18.7% after TPS-RPM. The mean CI is 0.63 after Demons, and increases to 0.90 after TPS-RPM. In the phantom study, the mean Euclidean distance of the fiducials is 7.4±3.0mm and 4.2±1.8mm after Demons and TPS-RPM, respectively. Conclusions: The bladder wall deformation is more accurate using the feature-based TPS-RPM algorithm than the intensity-based Demons algorithm, indicating that TPS-RPM has the potential for accurate bladder dose deformation and dose summation for multi-fractional cervical HDR brachytherapy. This work is supported

  10. SU-E-J-115: Correlation of Displacement Vector Fields Calculated by Deformable Image Registration Algorithms with Motion Parameters of CT Images with Well-Defined Targets and Controlled-Motion

    Energy Technology Data Exchange (ETDEWEB)

    Jaskowiak, J; Ahmad, S; Ali, I [University of Oklahoma Health Sciences Center, Oklahoma City, OK (United States); Alsbou, N [Ohio Northern University, Ada, OH (United States)

    2015-06-15

    Purpose: To investigate correlation of displacement vector fields (DVF) calculated by deformable image registration algorithms with motion parameters in helical axial and cone-beam CT images with motion artifacts. Methods: A mobile thorax phantom with well-known targets with different sizes that were made from water-equivalent material and inserted in foam to simulate lung lesions. The thorax phantom was imaged with helical, axial and cone-beam CT. The phantom was moved with a cyclic motion with different motion amplitudes and frequencies along the superior-inferior direction. Different deformable image registration algorithms including demons, fast demons, Horn-Shunck and iterative-optical-flow from the DIRART software were used to deform CT images for the phantom with different motion patterns. The CT images of the mobile phantom were deformed to CT images of the stationary phantom. Results: The values of displacement vectors calculated by deformable image registration algorithm correlated strongly with motion amplitude where large displacement vectors were calculated for CT images with large motion amplitudes. For example, the maximal displacement vectors were nearly equal to the motion amplitudes (5mm, 10mm or 20mm) at interfaces between the mobile targets lung tissue, while the minimal displacement vectors were nearly equal to negative the motion amplitudes. The maximal and minimal displacement vectors matched with edges of the blurred targets along the Z-axis (motion-direction), while DVF’s were small in the other directions. This indicates that the blurred edges by phantom motion were shifted largely to match with the actual target edge. These shifts were nearly equal to the motion amplitude. Conclusions: The DVF from deformable-image registration algorithms correlated well with motion amplitude of well-defined mobile targets. This can be used to extract motion parameters such as amplitude. However, as motion amplitudes increased, image artifacts increased

  11. 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...

  12. Algorithms

    Indian Academy of Sciences (India)

    ticians but also forms the foundation of computer science. Two ... with methods of developing algorithms for solving a variety of problems but ... applications of computers in science and engineer- ... numerical calculus are as important. We will ...

  13. 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

  14. Remote Sensing Image Registration Using Multiple Image Features

    Directory of Open Access Journals (Sweden)

    Kun Yang

    2017-06-01

    Full Text Available Remote sensing image registration plays an important role in military and civilian fields, such as natural disaster damage assessment, military damage assessment and ground targets identification, etc. However, due to the ground relief variations and imaging viewpoint changes, non-rigid geometric distortion occurs between remote sensing images with different viewpoint, which further increases the difficulty of remote sensing image registration. To address the problem, we propose a multi-viewpoint remote sensing image registration method which contains the following contributions. (i A multiple features based finite mixture model is constructed for dealing with different types of image features. (ii Three features are combined and substituted into the mixture model to form a feature complementation, i.e., the Euclidean distance and shape context are used to measure the similarity of geometric structure, and the SIFT (scale-invariant feature transform distance which is endowed with the intensity information is used to measure the scale space extrema. (iii To prevent the ill-posed problem, a geometric constraint term is introduced into the L2E-based energy function for better behaving the non-rigid transformation. We evaluated the performances of the proposed method by three series of remote sensing images obtained from the unmanned aerial vehicle (UAV and Google Earth, and compared with five state-of-the-art methods where our method shows the best alignments in most cases.

  15. Algorithms

    Indian Academy of Sciences (India)

    algorithm design technique called 'divide-and-conquer'. One of ... Turtle graphics, September. 1996. 5. ... whole list named 'PO' is a pointer to the first element of the list; ..... Program for computing matrices X and Y and placing the result in C *).

  16. Algorithms

    Indian Academy of Sciences (India)

    algorithm that it is implicitly understood that we know how to generate the next natural ..... Explicit comparisons are made in line (1) where maximum and minimum is ... It can be shown that the function T(n) = 3/2n -2 is the solution to the above ...

  17. Infrared and Raman study of the fast internal motions of non-rigid molecules in condensed state: method of selective deuteration

    International Nuclear Information System (INIS)

    Lascombe, J.; Cavagnat, D.; Lassegues, J.C.; Rafilipomanana, C.

    1983-01-01

    The dynamical behaviour of non-rigid molecules in the gas state is now well known but very little information is available on these molecules in condensed state. The authors present a method of study based on the analysis of the infrared and Raman spectra of selectively deuterated molecules. It is applied to the nitromethane and cyclopentene molecules which provide respectively characteristic examples of methyl internal rotation and ring-puckering motion. In each case, an isolated -C0 or -CD oscillator is modulated by the internal motion and several γ(CH) or γ(CD) bands are observed as a result of the dependence of the vibrational frequency of the oscillator on its conformational situation. Moreover, in the case of crystalline nitromethane a detailed study of the temperature dependence of the band profiles allows the main mechanism of relaxation of the -CH oscillator to be deduced. (orig.)

  18. GENERAL THEORY OF THE ROTATION OF THE NON-RIGID EARTH AT THE SECOND ORDER. I. THE RIGID MODEL IN ANDOYER VARIABLES

    International Nuclear Information System (INIS)

    Getino, J.; Miguel, D.; Escapa, A.

    2010-01-01

    This paper is the first part of an investigation where we will present an analytical general theory of the rotation of the non-rigid Earth at the second order, which considers the effects of the interaction of the rotation of the Earth with itself, also named as the spin-spin coupling. Here, and as a necessary step in the development of that theory, we derive complete, explicit, analytical formulae of the rigid Earth rotation that account for the second-order rotation-rotation interaction. These expressions are not provided in this form by any current rigid Earth model. Working within the Hamiltonian framework established by Kinoshita, we study the second-order effects arising from the interaction of the main term in the Earth geopotential expansion with itself, and with the complementary term arising when referring the rotational motion to the moving ecliptic. To this aim, we apply a canonical perturbation method to solve analytically the canonical equations at the second order, determining the expressions that provide the nutation-precession, the polar motion, and the length of day. In the case of the motion of the equatorial plane, nutation-precession, we compare our general approach with the particular study for this motion developed by Souchay et al., showing the existence of new terms whose numerical values are within the truncation level of 0.1 μas adopted by those authors. These terms emerge as a consequence of not assuming in this work the same restrictive simplifications taken by Souchay et al. The importance of these additional contributions is that, as the analytical formulae show, they depend on the Earth model considered, in such a way that the fluid core resonance could amplify them significatively when extending this theory to the non-rigid Earth models.

  19. Algorithms

    Indian Academy of Sciences (India)

    will become clear in the next article when we discuss a simple logo like programming language. ... Rod B may be used as an auxiliary store. The problem is to find an algorithm which performs this task. ... No disks are moved from A to Busing C as auxiliary rod. • move _disk (A, C);. (No + l)th disk is moved from A to C directly ...

  20. Mammogram CAD, hybrid registration and iconic analysis

    Science.gov (United States)

    Boucher, A.; Cloppet, F.; Vincent, N.

    2013-03-01

    This paper aims to develop a computer aided diagnosis (CAD) based on a two-step methodology to register and analyze pairs of temporal mammograms. The concept of "medical file", including all the previous medical information on a patient, enables joint analysis of different acquisitions taken at different times, and the detection of significant modifications. The developed registration method aims to superimpose at best the different anatomical structures of the breast. The registration is designed in order to get rid of deformation undergone by the acquisition process while preserving those due to breast changes indicative of malignancy. In order to reach this goal, a referent image is computed from control points based on anatomical features that are extracted automatically. Then the second image of the couple is realigned on the referent image, using a coarse-to-fine approach according to expert knowledge that allows both rigid and non-rigid transforms. The joint analysis detects the evolution between two images representing the same scene. In order to achieve this, it is important to know the registration error limits in order to adapt the observation scale. The approach used in this paper is based on an image sparse representation. Decomposed in regular patterns, the images are analyzed under a new angle. The evolution detection problem has many practical applications, especially in medical images. The CAD is evaluated using recall and precision of differences in mammograms.

  1. 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...

  2. 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...

  3. An SPM8-based Approach for Attenuation Correction Combining Segmentation and Non-rigid Template Formation: Application to Simultaneous PET/MR Brain Imaging

    Science.gov (United States)

    Izquierdo-Garcia, David; Hansen, Adam E.; Förster, Stefan; Benoit, Didier; Schachoff, Sylvia; Fürst, Sebastian; Chen, Kevin T.; Chonde, Daniel B.; Catana, Ciprian

    2014-01-01

    We present an approach for head MR-based attenuation correction (MR-AC) based on the Statistical Parametric Mapping (SPM8) software that combines segmentation- and atlas-based features to provide a robust technique to generate attenuation maps (µ-maps) from MR data in integrated PET/MR scanners. Methods Coregistered anatomical MR and CT images acquired in 15 glioblastoma subjects were used to generate the templates. The MR images from these subjects were first segmented into 6 tissue classes (gray and white matter, cerebro-spinal fluid, bone and soft tissue, and air), which were then non-rigidly coregistered using a diffeomorphic approach. A similar procedure was used to coregister the anatomical MR data for a new subject to the template. Finally, the CT-like images obtained by applying the inverse transformations were converted to linear attenuation coefficients (LACs) to be used for AC of PET data. The method was validated on sixteen new subjects with brain tumors (N=12) or mild cognitive impairment (N=4) who underwent CT and PET/MR scans. The µ-maps and corresponding reconstructed PET images were compared to those obtained using the gold standard CT-based approach and the Dixon-based method available on the Siemens Biograph mMR scanner. Relative change (RC) images were generated in each case and voxel- and region of interest (ROI)-based analyses were performed. Results The leave-one-out cross-validation analysis of the data from the 15 atlas-generation subjects showed small errors in brain LACs (RC=1.38%±4.52%) compared to the gold standard. Similar results (RC=1.86±4.06%) were obtained from the analysis of the atlas-validation datasets. The voxel- and ROI-based analysis of the corresponding reconstructed PET images revealed quantification errors of 3.87±5.0% and 2.74±2.28%, respectively. The Dixon-based method performed substantially worse (the mean RC values were 13.0±10.25% and 9.38±4.97%, respectively). Areas closer to skull showed the largest

  4. Registration of planar bioluminescence to magnetic resonance and x-ray computed tomography images as a platform for the development of bioluminescence tomography reconstruction algorithms.

    Science.gov (United States)

    Beattie, Bradley J; Klose, Alexander D; Le, Carl H; Longo, Valerie A; Dobrenkov, Konstantine; Vider, Jelena; Koutcher, Jason A; Blasberg, Ronald G

    2009-01-01

    The procedures we propose make possible the mapping of two-dimensional (2-D) bioluminescence image (BLI) data onto a skin surface derived from a three-dimensional (3-D) anatomical modality [magnetic resonance (MR) or computed tomography (CT)] dataset. This mapping allows anatomical information to be incorporated into bioluminescence tomography (BLT) reconstruction procedures and, when applied using sources visible to both optical and anatomical modalities, can be used to evaluate the accuracy of those reconstructions. Our procedures, based on immobilization of the animal and a priori determined fixed projective transforms, should be more robust and accurate than previously described efforts, which rely on a poorly constrained retrospectively determined warping of the 3-D anatomical information. Experiments conducted to measure the accuracy of the proposed registration procedure found it to have a mean error of 0.36+/-0.23 mm. Additional experiments highlight some of the confounds that are often overlooked in the BLT reconstruction process, and for two of these confounds, simple corrections are proposed.

  5. 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.

  6. 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.

  7. Quantitative assessment of global and regional air trappings using non-rigid registration and regional specific volume change of inspiratory/expiratory CT scans: Studies on healthy volunteers and asthmatics

    International Nuclear Information System (INIS)

    Lee, Eun Sol; Seo, Joon Beom; Lee, Hyun Joo; Chae, Eun Jin; Lee, Sang Min; Oh, Sang Young; Kim, Nam Kug

    2015-01-01

    The purpose of this study was to compare air trapping in healthy volunteers with asthmatics using pulmonary function test and quantitative data, such as specific volume change from paired inspiratory CT and registered expiratory CT. Sixteen healthy volunteers and 9 asthmatics underwent paired inspiratory/expiratory CT. DeltaSV, which represents the ratio of air fraction released after exhalation, was measured with paired inspiratory and anatomically registered expiratory CT scans. Air trapping indexes, DeltaSV0.4 and DeltaSV0.5, were defined as volume fraction of lung below 0.4 and 0.5 DeltaSV, respectively. To assess the gravity effect of air-trapping, DeltaSV values of anterior and posterior lung at three different levels were measured and DeltaSV ratio of anterior lung to posterior lung was calculated. Color-coded DeltaSV map of the whole lung was generated and visually assessed. Mean DeltaSV, DeltaSV0.4, and DeltaSV0.5 were compared between healthy volunteers and asthmatics. In asthmatics, correlation between air trapping indexes and clinical parameters were assessed. Mean DeltaSV, DeltaSV0.4, and DeltaSV0.5 in asthmatics were significantly higher than those in healthy volunteer group (all p < 0.05). DeltaSV values in posterior lung in asthmatics were significantly higher than those in healthy volunteer group (p = 0.049). In asthmatics, air trapping indexes, such as DeltaSV0.5 and DeltaSV0.4, showed negative strong correlation with FEF25-75, FEV1, and FEV1/FVC. DeltaSV map of asthmatics showed abnormal geographic pattern in 5 patients (55.6%) and disappearance of anterior-posterior gradient in 3 patients (33.3%). Quantitative assessment of DeltaSV (the ratio of air fraction released after exhalation) shows the difference in extent of air trapping between health volunteers and asthmatics.

  8. Quantitative assessment of global and regional air trappings using non-rigid registration and regional specific volume change of inspiratory/expiratory CT scans: Studies on healthy volunteers and asthmatics

    Energy Technology Data Exchange (ETDEWEB)

    Lee, Eun Sol; Seo, Joon Beom; Lee, Hyun Joo; Chae, Eun Jin; Lee, Sang Min; Oh, Sang Young; Kim, Nam Kug [Dept. of Radiology and Research Institute of Radiology, Asan Medical Center, University of Ulsan College of Medicine, Seoul (Korea, Republic of)

    2015-06-15

    The purpose of this study was to compare air trapping in healthy volunteers with asthmatics using pulmonary function test and quantitative data, such as specific volume change from paired inspiratory CT and registered expiratory CT. Sixteen healthy volunteers and 9 asthmatics underwent paired inspiratory/expiratory CT. DeltaSV, which represents the ratio of air fraction released after exhalation, was measured with paired inspiratory and anatomically registered expiratory CT scans. Air trapping indexes, DeltaSV0.4 and DeltaSV0.5, were defined as volume fraction of lung below 0.4 and 0.5 DeltaSV, respectively. To assess the gravity effect of air-trapping, DeltaSV values of anterior and posterior lung at three different levels were measured and DeltaSV ratio of anterior lung to posterior lung was calculated. Color-coded DeltaSV map of the whole lung was generated and visually assessed. Mean DeltaSV, DeltaSV0.4, and DeltaSV0.5 were compared between healthy volunteers and asthmatics. In asthmatics, correlation between air trapping indexes and clinical parameters were assessed. Mean DeltaSV, DeltaSV0.4, and DeltaSV0.5 in asthmatics were significantly higher than those in healthy volunteer group (all p < 0.05). DeltaSV values in posterior lung in asthmatics were significantly higher than those in healthy volunteer group (p = 0.049). In asthmatics, air trapping indexes, such as DeltaSV0.5 and DeltaSV0.4, showed negative strong correlation with FEF25-75, FEV1, and FEV1/FVC. DeltaSV map of asthmatics showed abnormal geographic pattern in 5 patients (55.6%) and disappearance of anterior-posterior gradient in 3 patients (33.3%). Quantitative assessment of DeltaSV (the ratio of air fraction released after exhalation) shows the difference in extent of air trapping between health volunteers and asthmatics.

  9. Evaluation of a New Motion-correction Algorithm Using On-rigid Registration in Respiratory-gated PET/CT Images of Liver Tumors.

    Science.gov (United States)

    Wagatsuma, Kei; Osawa, Tatsufumi; Yokokawa, Naoki; Miwa, Kenta; Oda, Keiichi; Kudo, Yoshiro; Unno, Yasushi; Ito, Kimiteru; Ishii, Kenji

    2016-01-01

    The present study aimed to determine the qualitative and quantitative accuracy of the Q.Freeze algorithm in PET/CT images of liver tumors. A body phantom and hot spheres representing liver tumors contained 5.3 and 21.2 kBq/mL of a solution containing 18 F radioactivity, respectively. The phantoms were moved in the superior-inferior direction at a motion displacement of 20 mm. Conventional respiratory-gated (RG) and Q.Freeze images were sorted into 6, 10, and 13 phase-groups. The SUV ave was calculated from the background of the body phantom, and the SUV max was determined from the hot spheres of the liver tumors. Three patients with four liver tumors were also clinically assessed by whole-body and RG PET. The RG and Q.Freeze images derived from the clinical study were also sorted into 6, 10 and 13 phase-groups. Liver signal-to-noise ratio (SNR) and SUV max were determined from the RG and Q.Freeze clinical images. The SUV ave of Q.Freeze images was the same as those derived from the body phantom using RG. The liver SNR improved with Q.Freeze, and the SUVs max was not overestimated when Q.Freeze was applied in both the phantom and clinical studies. Q.Freeze did not degrade the liver SNR and SUV max even though the phase number was larger. Q.Freeze delivered qualitative and quantitative motion correction than conventional RG imaging even in 10-phase groups.

  10. Multi-modal image registration: matching MRI with histology

    Science.gov (United States)

    Alic, Lejla; Haeck, Joost C.; Klein, Stefan; Bol, Karin; van Tiel, Sandra T.; Wielopolski, Piotr A.; Bijster, Magda; Niessen, Wiro J.; Bernsen, Monique; Veenland, Jifke F.; de Jong, Marion

    2010-03-01

    Spatial correspondence between histology and multi sequence MRI can provide information about the capabilities of non-invasive imaging to characterize cancerous tissue. However, shrinkage and deformation occurring during the excision of the tumor and the histological processing complicate the co registration of MR images with histological sections. This work proposes a methodology to establish a detailed 3D relation between histology sections and in vivo MRI tumor data. The key features of the methodology are a very dense histological sampling (up to 100 histology slices per tumor), mutual information based non-rigid B-spline registration, the utilization of the whole 3D data sets, and the exploitation of an intermediate ex vivo MRI. In this proof of concept paper, the methodology was applied to one tumor. We found that, after registration, the visual alignment of tumor borders and internal structures was fairly accurate. Utilizing the intermediate ex vivo MRI, it was possible to account for changes caused by the excision of the tumor: we observed a tumor expansion of 20%. Also the effects of fixation, dehydration and histological sectioning could be determined: 26% shrinkage of the tumor was found. The annotation of viable tissue, performed in histology and transformed to the in vivo MRI, matched clearly with high intensity regions in MRI. With this methodology, histological annotation can be directly related to the corresponding in vivo MRI. This is a vital step for the evaluation of the feasibility of multi-spectral MRI to depict histological groundtruth.

  11. 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.

  12. 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

  13. Microscopic validation of whole mouse micro-metastatic tumor imaging agents using cryo-imaging and sliding organ image registration

    Science.gov (United States)

    Liu, Yiqiao; Zhou, Bo; Qutaish, Mohammed; Wilson, David L.

    2016-03-01

    We created a metastasis imaging, analysis platform consisting of software and multi-spectral cryo-imaging system suitable for evaluating emerging imaging agents targeting micro-metastatic tumor. We analyzed CREKA-Gd in MRI, followed by cryo-imaging which repeatedly sectioned and tiled microscope images of the tissue block face, providing anatomical bright field and molecular fluorescence, enabling 3D microscopic imaging of the entire mouse with single metastatic cell sensitivity. To register MRI volumes to the cryo bright field reference, we used our standard mutual information, non-rigid registration which proceeded: preprocess --> affine --> B-spline non-rigid 3D registration. In this report, we created two modified approaches: mask where we registered locally over a smaller rectangular solid, and sliding organ. Briefly, in sliding organ, we segmented the organ, registered the organ and body volumes separately and combined results. Though sliding organ required manual annotation, it provided the best result as a standard to measure other registration methods. Regularization parameters for standard and mask methods were optimized in a grid search. Evaluations consisted of DICE, and visual scoring of a checkerboard display. Standard had accuracy of 2 voxels in all regions except near the kidney, where there were 5 voxels sliding. After mask and sliding organ correction, kidneys sliding were within 2 voxels, and Dice overlap increased 4%-10% in mask compared to standard. Mask generated comparable results with sliding organ and allowed a semi-automatic process.

  14. Three dimensional image alignment, registration and fusion

    International Nuclear Information System (INIS)

    Treves, S.T.; Mitchell, K.D.; Habboush, I.H.

    1998-01-01

    Combined assessment of three dimensional anatomical and functional images (SPECT, PET, MRI, CT) is useful to determine the nature and extent of lesions in many parts of the body. Physicians principally rely on their spatial sense of mentally re-orient and overlap images obtained with different imaging modalities. Objective methods that enable easy and intuitive image registration can help the physician arrive at more optimal diagnoses and better treatment decisions. This review describes a simple, intuitive and robust image registration approach developed in our laboratory. It differs from most other registration techniques in that it allows the user to incorporate all of the available information within the images in the registration process. This method takes full advantage of the ability of knowledgeable operators to achieve image registration and fusion using an intuitive interactive visual approach. It can register images accurately and quickly without the use of elaborate mathematical modeling or optimization techniques. The method provides the operator with tools to manipulate images in three dimensions, including visual feedback techniques to assess the accuracy of registration (grids, overlays, masks, and fusion of images in different colors). Its application is not limited to brain imaging and can be applied to images from any region in the body. The overall effect is a registration algorithm that is easy to implement and can achieve accuracy on the order of one pixel

  15. Improving fluid registration through white matter segmentation in a twin study design

    Science.gov (United States)

    Chou, Yi-Yu; Lepore, Natasha; Brun, Caroline; Barysheva, Marina; McMahon, Katie; de Zubicaray, Greig I.; Wright, Margaret J.; Toga, Arthur W.; Thompson, Paul M.

    2010-03-01

    Robust and automatic non-rigid registration depends on many parameters that have not yet been systematically explored. Here we determined how tissue classification influences non-linear fluid registration of brain MRI. Twin data is ideal for studying this question, as volumetric correlations between corresponding brain regions that are under genetic control should be higher in monozygotic twins (MZ) who share 100% of their genes when compared to dizygotic twins (DZ) who share half their genes on average. When these substructure volumes are quantified using tensor-based morphometry, improved registration can be defined based on which method gives higher MZ twin correlations when compared to DZs, as registration errors tend to deplete these correlations. In a study of 92 subjects, higher effect sizes were found in cumulative distribution functions derived from statistical maps when performing tissue classification before fluid registration, versus fluidly registering the raw images. This gives empirical evidence in favor of pre-segmenting images for tensor-based morphometry.

  16. Tensor-based morphometry with stationary velocity field diffeomorphic registration: application to ADNI.

    Science.gov (United States)

    Bossa, Matias; Zacur, Ernesto; Olmos, Salvador

    2010-07-01

    Tensor-based morphometry (TBM) is an analysis technique where anatomical information is characterized by means of the spatial transformations mapping a customized template with the observed images. Therefore, accurate inter-subject non-rigid registration is an essential prerequisite for both template estimation and image warping. Subsequent statistical analysis on the spatial transformations is performed to highlight voxel-wise differences. Most of previous TBM studies did not explore the influence of the registration parameters, such as the parameters defining the deformation and the regularization models. In this work performance evaluation of TBM using stationary velocity field (SVF) diffeomorphic registration was performed in a subset of subjects from Alzheimer's Disease Neuroimaging Initiative (ADNI) study. A wide range of values of the registration parameters that define the transformation smoothness and the balance between image matching and regularization were explored in the evaluation. The proposed methodology provided brain atrophy maps with very detailed anatomical resolution and with a high significance level compared with results recently published on the same data set using a non-linear elastic registration method. Copyright (c) 2010 Elsevier Inc. All rights reserved.

  17. 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

  18. 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.

  19. Automated Registration Of Images From Multiple Sensors

    Science.gov (United States)

    Rignot, Eric J. M.; Kwok, Ronald; Curlander, John C.; Pang, Shirley S. N.

    1994-01-01

    Images of terrain scanned in common by multiple Earth-orbiting remote sensors registered automatically with each other and, where possible, on geographic coordinate grid. Simulated image of terrain viewed by sensor computed from ancillary data, viewing geometry, and mathematical model of physics of imaging. In proposed registration algorithm, simulated and actual sensor images matched by area-correlation technique.

  20. Registration of Space Objects

    Science.gov (United States)

    Schmidt-Tedd, Bernhard

    2017-07-01

    Space objects are subject to registration in order to allocate "jurisdiction and control" over those objects in the sovereign-free environment of outer space. This approach is similar to the registration of ships in view of the high sea and for aircrafts with respect to the international airspace. Registration is one of the basic principles of space law, starting with UN General Assembly Resolution 1721 B (XVI) of December 20, 1961, followed by Resolution 1962 (XVIII) of December 13, 1963, then formulated in Article VIII of the Outer Space Treaty of 1967 and as specified in the Registration Convention of 1975. Registration of space objects can be seen today as a principle of customary international law, relevant for each spacefaring state. Registration is divided into a national and an international level. The State Party establishes a national registry for its space objects, and those registrations have to be communicated via diplomatic channel to the UN Register of space objects. This UN Register is handled by the UN Office for Outer Space Affairs (UNOOSA) and is an open source of information for space objects worldwide. Registration is linked to the so-called launching state of the relevant space object. There might be more than one launching state for the specific launch event, but only one state actor can register a specific space object. The state of registry gains "jurisdiction and control" over the space object and therefore no double registration is permissible. Based on the established UN Space Law, registration practice was subject to some adaptions due to technical developments and legal challenges. After the privatization of the major international satellite organizations, a number of non-registrations had to be faced. The state actors reacted with the UN Registration Practice Resolution of 2007 as elaborated in the Legal Subcommittee of UNCOPUOS, the Committee for the Peaceful Use of Outer Space. In this context an UNOOSA Registration Information

  1. TU-B-19A-01: Image Registration II: TG132-Quality Assurance for Image Registration

    International Nuclear Information System (INIS)

    Brock, K; Mutic, S

    2014-01-01

    AAPM Task Group 132 was charged with a review of the current approaches and solutions for image registration in radiotherapy and to provide recommendations for quality assurance and quality control of these clinical processes. As the results of image registration are always used as the input of another process for planning or delivery, it is important for the user to understand and document the uncertainty associate with the algorithm in general and the Result of a specific registration. The recommendations of this task group, which at the time of abstract submission are currently being reviewed by the AAPM, include the following components. The user should understand the basic image registration techniques and methods of visualizing image fusion. The disclosure of basic components of the image registration by commercial vendors is critical in this respect. The physicists should perform end-to-end tests of imaging, registration, and planning/treatment systems if image registration is performed on a stand-alone system. A comprehensive commissioning process should be performed and documented by the physicist prior to clinical use of the system. As documentation is important to the safe implementation of this process, a request and report system should be integrated into the clinical workflow. Finally, a patient specific QA practice should be established for efficient evaluation of image registration results. The implementation of these recommendations will be described and illustrated during this educational session. Learning Objectives: Highlight the importance of understanding the image registration techniques used in their clinic. Describe the end-to-end tests needed for stand-alone registration systems. Illustrate a comprehensive commissioning program using both phantom data and clinical images. Describe a request and report system to ensure communication and documentation. Demonstrate an clinically-efficient patient QA practice for efficient evaluation of image

  2. 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.

  3. 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%.

  4. 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

  5. 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

  6. 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.

  7. Locally orderless registration code

    DEFF Research Database (Denmark)

    2012-01-01

    This is code for the TPAMI paper "Locally Orderless Registration". The code requires intel threadding building blocks installed and is provided for 64 bit on mac, linux and windows.......This is code for the TPAMI paper "Locally Orderless Registration". The code requires intel threadding building blocks installed and is provided for 64 bit on mac, linux and windows....

  8. [Algorithm for the automated processing of rheosignals].

    Science.gov (United States)

    Odinets, G S

    1988-01-01

    Algorithm for rheosignals recognition for a microprocessing device with a representation apparatus and with automated and manual cursor control was examined. The algorithm permits to automate rheosignals registrating and processing taking into account their changeability.

  9. Registration of deformed multimodality medical images

    International Nuclear Information System (INIS)

    Moshfeghi, M.; Naidich, D.

    1989-01-01

    The registration and combination of images from different modalities have several potential applications, such as functional and anatomic studies, 3D radiation treatment planning, surgical planning, and retrospective studies. Image registration algorithms should correct for any local deformations caused by respiration, heart beat, imaging device distortions, and so forth. This paper reports on an elastic matching technique for registering deformed multimodality images. Correspondences between contours in the two images are used to stretch the deformed image toward its goal image. This process is repeated a number of times, with decreasing image stiffness. As the iterations continue, the stretched image better approximates its goal image

  10. SU-F-J-217: Accurate Dose Volume Parameters Calculation for Revealing Rectum Dose-Toxicity Effect Using Deformable Registration in Cervical Cancer Brachytherapy: A Pilot Study

    Energy Technology Data Exchange (ETDEWEB)

    Zhen, X; Chen, H; Liao, Y; Zhou, L [Southern Medical University, Guangzhou, Guangdong (China); Hrycushko, B; Albuquerque, K; Gu, X [UT Southwestern Medical Center, Dallas, TX (United States)

    2016-06-15

    Purpose: To study the feasibility of employing deformable registration methods for accurate rectum dose volume parameters calculation and their potentials in revealing rectum dose-toxicity between complication and non-complication cervical cancer patients with brachytherapy treatment. Method and Materials: Data from 60 patients treated with BT including planning images, treatment plans, and follow-up clinical exam were retrospectively collected. Among them, 12 patients complained about hematochezia were further examined with colonoscopy and scored as Grade 1–3 complication (CP). Meanwhile, another 12 non-complication (NCP) patients were selected as a reference group. To seek for potential gains in rectum toxicity prediction when fractional anatomical deformations are account for, the rectum dose volume parameters D0.1/1/2cc of the selected patients were retrospectively computed by three different approaches: the simple “worstcase scenario” (WS) addition method, an intensity-based deformable image registration (DIR) algorithm-Demons, and a more accurate, recent developed local topology preserved non-rigid point matching algorithm (TOP). Statistical significance of the differences between rectum doses of the CP group and the NCP group were tested by a two-tailed t-test and results were considered to be statistically significant if p < 0.05. Results: For the D0.1cc, no statistical differences are found between the CP and NCP group in all three methods. For the D1cc, dose difference is not detected by the WS method, however, statistical differences between the two groups are observed by both Demons and TOP, and more evident in TOP. For the D2cc, the CP and NCP cases are statistically significance of the difference for all three methods but more pronounced with TOP. Conclusion: In this study, we calculated the rectum D0.1/1/2cc by simple WS addition and two DIR methods and seek for gains in rectum toxicity prediction. The results favor the claim that accurate dose

  11. 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.

  12. Information from the Registration Service

    CERN Multimedia

    GS Department

    2011-01-01

    Please note that the Registration Service (Bldg 55-1st floor) will be exceptionally open during the annual end of year closure from 10:00 to 12:00 on the following days: 22, 23, 26, 27,28, 29 et 30 December 2011 and 2,3, et 4 January 2012. All the activities related to the Registration Service will be operational: registration for contractors’ personnel; registrations for professional visits; access cards; car stickers; biometric registration. The Registration Service

  13. 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

  14. SU-C-18A-04: 3D Markerless Registration of Lung Based On Coherent Point Drift: Application in Image Guided Radiotherapy

    International Nuclear Information System (INIS)

    Nasehi Tehrani, J; Wang, J; Guo, X; Yang, Y

    2014-01-01

    Purpose: This study evaluated a new probabilistic non-rigid registration method called coherent point drift for real time 3D markerless registration of the lung motion during radiotherapy. Method: 4DCT image datasets Dir-lab (www.dir-lab.com) have been used for creating 3D boundary element model of the lungs. For the first step, the 3D surface of the lungs in respiration phases T0 and T50 were segmented and divided into a finite number of linear triangular elements. Each triangle is a two dimensional object which has three vertices (each vertex has three degree of freedom). One of the main features of the lungs motion is velocity coherence so the vertices that creating the mesh of the lungs should also have features and degree of freedom of lung structure. This means that the vertices close to each other tend to move coherently. In the next step, we implemented a probabilistic non-rigid registration method called coherent point drift to calculate nonlinear displacement of vertices between different expiratory phases. Results: The method has been applied to images of 10-patients in Dir-lab dataset. The normal distribution of vertices to the origin for each expiratory stage were calculated. The results shows that the maximum error of registration between different expiratory phases is less than 0.4 mm (0.38 SI, 0.33 mm AP, 0.29 mm RL direction). This method is a reliable method for calculating the vector of displacement, and the degrees of freedom (DOFs) of lung structure in radiotherapy. Conclusions: We evaluated a new 3D registration method for distribution set of vertices inside lungs mesh. In this technique, lungs motion considering velocity coherence are inserted as a penalty in regularization function. The results indicate that high registration accuracy is achievable with CPD. This method is helpful for calculating of displacement vector and analyzing possible physiological and anatomical changes during treatment

  15. 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.

  16. 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.)

  17. 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...

  18. JALFHCC - Patient Registration Service

    Data.gov (United States)

    Department of Veterans Affairs — The Captain James A. Lovell Federal Health Care Center (JALFHCC) Patient Registration Service supports the operation of the first VA/Navy Federal Health Care Center...

  19. Visitor Registration System

    Data.gov (United States)

    US Agency for International Development — Visitor Registration System (VRS) streamlines visitor check-in and check-out process for expediting visitors into USAID. The system captures visitor information...

  20. Pesticide Registration Information System

    Data.gov (United States)

    U.S. Environmental Protection Agency — PRISM provides an integrated, web portal for all pesticide related data, communications, registrations and transactions for OPP and its stakeholders, partners and...

  1. Registration of the cancer

    International Nuclear Information System (INIS)

    Morales, F.; Campos, X.

    2002-01-01

    A database for the registration of the cancer was designed in ambient access, of the Microsoft Office, to take the registrations at national level. With this database the statistics will be obtained about the incidence of the cancer in the population, evaluation of the sanitary services of prevention, diagnose and treatment of the illness, etc. The used codes are according to the listings of code of the Ministry of Health (MINSA) and OPS

  2. Semiautomated Multimodal Breast Image Registration

    Directory of Open Access Journals (Sweden)

    Charlotte Curtis

    2012-01-01

    However, due to the highly deformable nature of breast tissues, comparison of 3D and 2D modalities is a challenge. To enable this comparison, a registration technique was developed to map features from 2D mammograms to locations in the 3D image space. This technique was developed and tested using magnetic resonance (MR images as a reference 3D modality, as MR breast imaging is an established technique in clinical practice. The algorithm was validated using a numerical phantom then successfully tested on twenty-four image pairs. Dice's coefficient was used to measure the external goodness of fit, resulting in an excellent overall average of 0.94. Internal agreement was evaluated by examining internal features in consultation with a radiologist, and subjective assessment concludes that reasonable alignment was achieved.

  3. 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.

  4. 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)

  5. [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.

  6. Evaluation of registration strategies for multi-modality images of rat brain slices

    International Nuclear Information System (INIS)

    Palm, Christoph; Vieten, Andrea; Salber, Dagmar; Pietrzyk, Uwe

    2009-01-01

    In neuroscience, small-animal studies frequently involve dealing with series of images from multiple modalities such as histology and autoradiography. The consistent and bias-free restacking of multi-modality image series is obligatory as a starting point for subsequent non-rigid registration procedures and for quantitative comparisons with positron emission tomography (PET) and other in vivo data. Up to now, consistency between 2D slices without cross validation using an inherent 3D modality is frequently presumed to be close to the true morphology due to the smooth appearance of the contours of anatomical structures. However, in multi-modality stacks consistency is difficult to assess. In this work, consistency is defined in terms of smoothness of neighboring slices within a single modality and between different modalities. Registration bias denotes the distortion of the registered stack in comparison to the true 3D morphology and shape. Based on these metrics, different restacking strategies of multi-modality rat brain slices are experimentally evaluated. Experiments based on MRI-simulated and real dual-tracer autoradiograms reveal a clear bias of the restacked volume despite quantitatively high consistency and qualitatively smooth brain structures. However, different registration strategies yield different inter-consistency metrics. If no genuine 3D modality is available, the use of the so-called SOP (slice-order preferred) or MOSOP (modality-and-slice-order preferred) strategy is recommended.

  7. Automatic registration of imaging mass spectrometry data to the Allen Brain Atlas transcriptome

    Science.gov (United States)

    Abdelmoula, Walid M.; Carreira, Ricardo J.; Shyti, Reinald; Balluff, Benjamin; Tolner, Else; van den Maagdenberg, Arn M. J. M.; Lelieveldt, B. P. F.; McDonnell, Liam; Dijkstra, Jouke

    2014-03-01

    Imaging Mass Spectrometry (IMS) is an emerging molecular imaging technology that provides spatially resolved information on biomolecular structures; each image pixel effectively represents a molecular mass spectrum. By combining the histological images and IMS-images, neuroanatomical structures can be distinguished based on their biomolecular features as opposed to morphological features. The combination of IMS data with spatially resolved gene expression maps of the mouse brain, as provided by the Allen Mouse Brain atlas, would enable comparative studies of spatial metabolic and gene expression patterns in life-sciences research and biomarker discovery. As such, it would be highly desirable to spatially register IMS slices to the Allen Brain Atlas (ABA). In this paper, we propose a multi-step automatic registration pipeline to register ABA histology to IMS- images. Key novelty of the method is the selection of the best reference section from the ABA, based on pre-processed histology sections. First, we extracted a hippocampus-specific geometrical feature from the given experimental histological section to initially localize it among the ABA sections. Then, feature-based linear registration is applied to the initially localized section and its two neighbors in the ABA to select the most similar reference section. A non-rigid registration yields a one-to-one mapping of the experimental IMS slice to the ABA. The pipeline was applied on 6 coronal sections from two mouse brains, showing high anatomical correspondence, demonstrating the feasibility of complementing biomolecule distributions from individual mice with the genome-wide ABA transcriptome.

  8. Integration of breathing in radiotherapy: contribution of the image deformable registration

    International Nuclear Information System (INIS)

    Boldea, Vlad

    2006-01-01

    As taking organ movements and deformations into account in radiotherapy for the treatment of lung cancer is a challenge as it allows the delivered dose to be increased while better sparing surrounding sane tissues, this research thesis addresses non-rigid (or deformable) registration iconic methods applied to thorax X ray computed tomography (X-ray CT) 3D acquisitions. The objective is to extract the information regarding lung and tumour movement and deformation. The author thus reports the development of deformable registration framework with several methods of regularisation of vector fields. Three main studies have been performed and are reported. In the first one, deformable registration allowed the breathe blockage reproducibility to be controlled. Experiments performed on ten patients showed that this blockage is efficient (displacement less than 5 mm), except for three of them with functional anomalies. In a second study, 4D X-ray CT acquisitions (3D X-ray CT images acquired at different moments of the normal breathing cycle) have been analysed to extract and follow thorax movements and deformations in order to take them into account in free breathing and to perform 4D dynamic dosimetric studies. A first 4D X-ray CT image model has been developed from 3D X-ray CT images acquired in breathe blockage at the end of expiration and at the end on inhalation [fr

  9. 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...

  10. 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.

  11. 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.

  12. Biomedical Image Registration

    DEFF Research Database (Denmark)

    This book constitutes the refereed proceedings of the 8th International Workshop on Biomedical Image Registration, WBIR 2018, held in Leiden, The Netherlands, in June 2018. The 11 full and poster papers included in this volume were carefully reviewed and selected from 17 submitted papers. The pap...

  13. Registration of Plant Varieties

    African Journals Online (AJOL)

    Registration of two Sorghum Hybrids, ESH-1 and ESH-2. Sorghum (Sorghum bicolor (L) Moench) is an indigenous crop to Ethiopia and staple for many millions of people in most parts of Africa. The crop is one of the most important cereals grown in arid and semi arid areas where others often fail to survive. In Eastern Africa ...

  14. 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

  15. 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

  16. Real Time Surface Registration for PET Motion Tracking

    DEFF Research Database (Denmark)

    Wilm, Jakob; Olesen, Oline Vinter; Paulsen, Rasmus Reinhold

    2011-01-01

    to create point clouds representing parts of the patient's face. The movement is estimated by a rigid registration of the point clouds. The registration should be done using a robust algorithm that can handle partial overlap and ideally operate in real time. We present an optimized Iterative Closest Point......Head movement during high resolution Positron Emission Tomography brain studies causes blur and artifacts in the images. Therefore, attempts are being made to continuously monitor the pose of the head and correct for this movement. Specifically, our method uses a structured light scanner system...... algorithm that operates at 10 frames per second on partial human face surfaces. © 2011 Springer-Verlag....

  17. The hidden KPI registration accuracy.

    Science.gov (United States)

    Shorrosh, Paul

    2011-09-01

    Determining the registration accuracy rate is fundamental to improving revenue cycle key performance indicators. A registration quality assurance (QA) process allows errors to be corrected before bills are sent and helps registrars learn from their mistakes. Tools are available to help patient access staff who perform registration QA manually.

  18. 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.

  19. Deformable image registration in radiation therapy

    Energy Technology Data Exchange (ETDEWEB)

    Oh, Seung Jong; Kim, Si Yong [Dept. of Radiation Oncology, Virginia Commonwealth University, Richmond (United States)

    2017-06-15

    The number of imaging data sets has significantly increased during radiation treatment after introducing a diverse range of advanced techniques into the field of radiation oncology. As a consequence, there have been many studies proposing meaningful applications of imaging data set use. These applications commonly require a method to align the data sets at a reference. Deformable image registration (DIR) is a process which satisfies this requirement by locally registering image data sets into a reference image set. DIR identifies the spatial correspondence in order to minimize the differences between two or among multiple sets of images. This article describes clinical applications, validation, and algorithms of DIR techniques. Applications of DIR in radiation treatment include dose accumulation, mathematical modeling, automatic segmentation, and functional imaging. Validation methods discussed are based on anatomical landmarks, physical phantoms, digital phantoms, and per application purpose. DIR algorithms are also briefly reviewed with respect to two algorithmic components: similarity index and deformation models.

  20. Registration of acute stroke

    DEFF Research Database (Denmark)

    Wildenschild, Cathrine; Mehnert, Frank; Thomsen, Reimar Wernich

    2014-01-01

    BACKGROUND: The validity of the registration of patients in stroke-specific registries has seldom been investigated, nor compared with administrative hospital discharge registries. The objective of this study was to examine the validity of the registration of patients in a stroke-specific registry...... (The Danish Stroke Registry [DSR]) and a hospital discharge registry (The Danish National Patient Registry [DNRP]). METHODS: Assuming that all patients with stroke were registered in either the DSR, DNRP or both, we first identified a sample of 75 patients registered with stroke in 2009; 25 patients...... in the DSR, 25 patients in the DNRP, and 25 patients registered in both data sources. Using the medical record as a gold standard, we then estimated the sensitivity and positive predictive value of a stroke diagnosis in the DSR and the DNRP. Secondly, we reviewed 160 medical records for all potential stroke...

  1. Image registration with uncertainty analysis

    Science.gov (United States)

    Simonson, Katherine M [Cedar Crest, NM

    2011-03-22

    In an image registration method, edges are detected in a first image and a second image. A percentage of edge pixels in a subset of the second image that are also edges in the first image shifted by a translation is calculated. A best registration point is calculated based on a maximum percentage of edges matched. In a predefined search region, all registration points other than the best registration point are identified that are not significantly worse than the best registration point according to a predetermined statistical criterion.

  2. 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

  3. 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

  4. 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

  5. Automatic 3D MR image registration and its evaluation for precise monitoring of knee joint disease

    International Nuclear Information System (INIS)

    Cheng Yuanzhi; Jin Quan; Guo Changyong; Ding Xiaohua; Tanaka, Hisashi; Tamura, Shinichi

    2011-01-01

    We describe a technique for the registration of three dimensional (3D) knee femur surface points from MR image data sets; it is a technique that can track local cartilage thickness changes over time. In the first coarse registration step, we use the direction vectors of the volume given by the cloud of points of the MR image to correct for different knee joint positions and orientations in the MR scanner. In the second fine registration step, we propose a global search algorithm that simultaneously determines the optimal transformation parameters and point correspondences through searching a six dimensional space of Euclidean motion vectors (translation and rotation). The present algorithm is grounded on a mathematical theory- Lipschitz optimization. Compared with the other three registration approaches (iterative closest point (ICP), EM-ICP, and genetic algorithms), the proposed method achieved the highest registration accuracy on both animal and clinical data. (author)

  6. Patient-Specific Biomechanical Model as Whole-Body CT Image Registration Tool

    OpenAIRE

    Li, Mao; Miller, Karol; Joldes, Grand Roman; Doyle, Barry; Garlapati, Revanth Reddy; Kikinis, Ron; Wittek, Adam

    2015-01-01

    Whole-body computed tomography (CT) image registration is important for cancer diagnosis, therapy planning and treatment. Such registration requires accounting for large differences between source and target images caused by deformations of soft organs/tissues and articulated motion of skeletal structures. The registration algorithms relying solely on image processing methods exhibit deficiencies in accounting for such deformations and motion. We propose to predict the deformations and moveme...

  7. 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.

  8. Fast free-form deformable registration via calculus of variations

    International Nuclear Information System (INIS)

    Lu Weiguo; Chen Mingli; Olivera, Gustavo H; Ruchala, Kenneth J; Mackie, Thomas R

    2004-01-01

    In this paper, we present a fully automatic, fast and accurate deformable registration technique. This technique deals with free-form deformation. It minimizes an energy functional that combines both similarity and smoothness measures. By using calculus of variations, the minimization problem was represented as a set of nonlinear elliptic partial differential equations (PDEs). A Gauss-Seidel finite difference scheme is used to iteratively solve the PDE. The registration is refined by a multi-resolution approach. The whole process is fully automatic. It takes less than 3 min to register two three-dimensional (3D) image sets of size 256 x 256 x 61 using a single 933 MHz personal computer. Extensive experiments are presented. These experiments include simulations, phantom studies and clinical image studies. Experimental results show that our model and algorithm are suited for registration of temporal images of a deformable body. The registration of inspiration and expiration phases of the lung images shows that the method is able to deal with large deformations. When applied to the daily CT images of a prostate patient, the results show that registration based on iterative refinement of displacement field is appropriate to describe the local deformations in the prostate and the rectum. Similarity measures improved significantly after the registration. The target application of this paper is for radiotherapy treatment planning and evaluation that incorporates internal organ deformation throughout the course of radiation therapy. The registration method could also be equally applied in diagnostic radiology

  9. 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.

  10. 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.

  11. A spline-based non-linear diffeomorphism for multimodal prostate registration.

    Science.gov (United States)

    Mitra, Jhimli; Kato, Zoltan; Martí, Robert; Oliver, Arnau; Lladó, Xavier; Sidibé, Désiré; Ghose, Soumya; Vilanova, Joan C; Comet, Josep; Meriaudeau, Fabrice

    2012-08-01

    This paper presents a novel method for non-rigid registration of transrectal ultrasound and magnetic resonance prostate images based on a non-linear regularized framework of point correspondences obtained from a statistical measure of shape-contexts. The segmented prostate shapes are represented by shape-contexts and the Bhattacharyya distance between the shape representations is used to find the point correspondences between the 2D fixed and moving images. The registration method involves parametric estimation of the non-linear diffeomorphism between the multimodal images and has its basis in solving a set of non-linear equations of thin-plate splines. The solution is obtained as the least-squares solution of an over-determined system of non-linear equations constructed by integrating a set of non-linear functions over the fixed and moving images. However, this may not result in clinically acceptable transformations of the anatomical targets. Therefore, the regularized bending energy of the thin-plate splines along with the localization error of established correspondences should be included in the system of equations. The registration accuracies of the proposed method are evaluated in 20 pairs of prostate mid-gland ultrasound and magnetic resonance images. The results obtained in terms of Dice similarity coefficient show an average of 0.980±0.004, average 95% Hausdorff distance of 1.63±0.48 mm and mean target registration and target localization errors of 1.60±1.17 mm and 0.15±0.12 mm respectively. Copyright © 2012 Elsevier B.V. All rights reserved.

  12. 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.

  13. Semi-automatic construction of reference standards for evaluation of image registration

    NARCIS (Netherlands)

    Murphy, K.; Ginneken, van B.; Klein, S.; Staring, M.; Hoop, de B.J.; Viergever, M.A.; Pluim, J.P.W.

    2011-01-01

    Quantitative evaluation of image registration algorithms is a difficult and under-addressed issue due to the lack of a reference standard in most registration problems. In this work a method is presented whereby detailed reference standard data may be constructed in an efficient semi-automatic

  14. Verification and Validation of a Fingerprint Image Registration Software

    Directory of Open Access Journals (Sweden)

    Liu Yan

    2006-01-01

    Full Text Available The need for reliable identification and authentication is driving the increased use of biometric devices and systems. Verification and validation techniques applicable to these systems are rather immature and ad hoc, yet the consequences of the wide deployment of biometric systems could be significant. In this paper we discuss an approach towards validation and reliability estimation of a fingerprint registration software. Our validation approach includes the following three steps: (a the validation of the source code with respect to the system requirements specification; (b the validation of the optimization algorithm, which is in the core of the registration system; and (c the automation of testing. Since the optimization algorithm is heuristic in nature, mathematical analysis and test results are used to estimate the reliability and perform failure analysis of the image registration module.

  15. Mass preserving image registration for lung CT

    DEFF Research Database (Denmark)

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

    2012-01-01

    This paper presents a mass preserving image registration algorithm for lung CT images. To account for the local change in lung tissue intensity during the breathing cycle, a tissue appearance model based on the principle of preservation of total lung mass is proposed. This model is incorporated...... on four groups of data: 44 pairs of longitudinal inspiratory chest CT scans with small difference in lung volume; 44 pairs of longitudinal inspiratory chest CT scans with large difference in lung volume; 16 pairs of expiratory and inspiratory CT scans; and 5 pairs of images extracted at end exhale and end...

  16. A combined alignment and registration scheme of psoriasis lesion |images

    DEFF Research Database (Denmark)

    Maletti, Gabriela Mariel; Ersbøll, Bjarne Kjær

    2003-01-01

    A two-stage registration scheme of psoriasis lesion patterns is proposed. In the first stage, global rotation and translation effects of assumed equally scaled psoriasis lesion patterns are removed. In the second stage, only local translation effects are removed. In both stages a novel algorithm...

  17. Summer Camp Registrations 2018

    CERN Multimedia

    Staff Association

    2018-01-01

    Registration for the CERN SA Summer camp, for children from 4 to 6 years old, is now open. The general conditions are available on the EVE and School website: http://nurseryschool.web.cern.ch For further questions, please contact us by email at  Summer.Camp@cern.ch An inscription per week is proposed, for 450.-CHF/week, lunch included. The camp will be open on weeks 27, 28, 29 and 30, from 8:30 am to 5:30 pm. This year the theme will be Vivaldi’s Four Seasons.

  18. The Household Registration System

    Directory of Open Access Journals (Sweden)

    2000-06-01

    Full Text Available Although longitudinal experimental community health research is crucial to testing hypotheses about the demographic impact of health technologies, longitudinal demographic research field stations are rare, owing to the complexity and high cost of developing requisite computer software systems. This paper describes the Household Registration System (HRS, a software package that has been used for the rapid development of eleven surveillance systems in sub-Saharan Africa and Asia. Features of the HRS automate software generation for a family of surveillance applications, obviating the need for new and complex computer software systems for each new longitudinal demographic study.

  19. Registration Summer Camp 2016

    CERN Multimedia

    2016-01-01

    Reminder: registration for the CERN Staff Association Summer Camp is now open for children from 4 to 6 years old.   More information on the website: http://nurseryschool.web.cern.ch/. The summer camp is open to all children. The proposed cost is 480.-CHF/week, lunch included. The camp will be open weeks 27, 28, 29 and 30, from 8:30 a.m. to 5:30 p.m. For further questions, you are welcome to contact us by email at Summer.Camp@cern.ch. CERN Staff Association

  20. 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

  1. Evaluation of multi-modality CT-MRI-SPECT registration tools for radiotherapy treatment planning purposes

    International Nuclear Information System (INIS)

    Bianchini, S.; Alfonso, R.; Castillo, J.; Coca, M.; Torres, L.

    2013-01-01

    A qualitative and quantitative comparison of registration CT-CT, CT-MR and CT-SPECT performed by the different software and algorithms studies is presented. Only two studied software were full DICOM RT compatible while accepting DICOM images in any layout. Quantitative results of fiducial displacement errors were calculated for all software and available registration methods. The presented methodology demonstrated being effective for assessing the quality of studied image registration tools in the radiotherapy planning context, provided the images are free of significant geometric deformation. When implementing this methodology in real patients, the use of immobilization devices, such as thermoplastic masks, is recommended for enhanced quality of image registration. (Author)

  2. Image Segmentation, Registration, Compression, and Matching

    Science.gov (United States)

    Yadegar, Jacob; Wei, Hai; Yadegar, Joseph; Ray, Nilanjan; Zabuawala, Sakina

    2011-01-01

    A novel computational framework was developed of a 2D affine invariant matching exploiting a parameter space. Named as affine invariant parameter space (AIPS), the technique can be applied to many image-processing and computer-vision problems, including image registration, template matching, and object tracking from image sequence. The AIPS is formed by the parameters in an affine combination of a set of feature points in the image plane. In cases where the entire image can be assumed to have undergone a single affine transformation, the new AIPS match metric and matching framework becomes very effective (compared with the state-of-the-art methods at the time of this reporting). No knowledge about scaling or any other transformation parameters need to be known a priori to apply the AIPS framework. An automated suite of software tools has been created to provide accurate image segmentation (for data cleaning) and high-quality 2D image and 3D surface registration (for fusing multi-resolution terrain, image, and map data). These tools are capable of supporting existing GIS toolkits already in the marketplace, and will also be usable in a stand-alone fashion. The toolkit applies novel algorithmic approaches for image segmentation, feature extraction, and registration of 2D imagery and 3D surface data, which supports first-pass, batched, fully automatic feature extraction (for segmentation), and registration. A hierarchical and adaptive approach is taken for achieving automatic feature extraction, segmentation, and registration. Surface registration is the process of aligning two (or more) data sets to a common coordinate system, during which the transformation between their different coordinate systems is determined. Also developed here are a novel, volumetric surface modeling and compression technique that provide both quality-guaranteed mesh surface approximations and compaction of the model sizes by efficiently coding the geometry and connectivity

  3. 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.

  4. Automated image registration for FDOPA PET studies

    International Nuclear Information System (INIS)

    Kang-Ping Lin; Sung-Cheng Huang, Dan-Chu Yu; Melega, W.; Barrio, J.R.; Phelps, M.E.

    1996-01-01

    In this study, various image registration methods are investigated for their suitability for registration of L-6-[18F]-fluoro-DOPA (FDOPA) PET images. Five different optimization criteria including sum of absolute difference (SAD), mean square difference (MSD), cross-correlation coefficient (CC), standard deviation of pixel ratio (SDPR), and stochastic sign change (SSC) were implemented and Powell's algorithm was used to optimize the criteria. The optimization criteria were calculated either unidirectionally (i.e. only evaluating the criteria for comparing the resliced image 1 with the original image 2) or bidirectionally (i.e. averaging the criteria for comparing the resliced image 1 with the original image 2 and those for the sliced image 2 with the original image 1). Monkey FDOPA images taken at various known orientations were used to evaluate the accuracy of different methods. A set of human FDOPA dynamic images was used to investigate the ability of the methods for correcting subject movement. It was found that a large improvement in performance resulted when bidirectional rather than unidirectional criteria were used. Overall, the SAD, MSD and SDPR methods were found to be comparable in performance and were suitable for registering FDOPA images. The MSD method gave more adequate results for frame-to-frame image registration for correcting subject movement during a dynamic FDOPA study. The utility of the registration method is further demonstrated by registering FDOPA images in monkeys before and after amphetamine injection to reveal more clearly the changes in spatial distribution of FDOPA due to the drug intervention. (author)

  5. [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.

  6. 32 CFR 1615.1 - Registration.

    Science.gov (United States)

    2010-07-01

    ... registration card or other method of registration prescribed by the Director of Selective Service by a person... the records (master computer file) of the Selective Service System. Registration is completed when... Director include completing a Selective Service Registration Card at a classified Post Office, registration...

  7. 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.

  8. 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)

  9. Robust image registration for multiple exposure high dynamic range image synthesis

    Science.gov (United States)

    Yao, Susu

    2011-03-01

    Image registration is an important preprocessing technique in high dynamic range (HDR) image synthesis. This paper proposed a robust image registration method for aligning a group of low dynamic range images (LDR) that are captured with different exposure times. Illumination change and photometric distortion between two images would result in inaccurate registration. We propose to transform intensity image data into phase congruency to eliminate the effect of the changes in image brightness and use phase cross correlation in the Fourier transform domain to perform image registration. Considering the presence of non-overlapped regions due to photometric distortion, evolutionary programming is applied to search for the accurate translation parameters so that the accuracy of registration is able to be achieved at a hundredth of a pixel level. The proposed algorithm works well for under and over-exposed image registration. It has been applied to align LDR images for synthesizing high quality HDR images..

  10. 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.

  11. 16 CFR 1130.8 - Requirements for Web site registration or alternative e-mail registration.

    Science.gov (United States)

    2010-01-01

    ... registration. (a) Link to registration page. The manufacturer's Web site, or other Web site established for the... web page that goes directly to “Product Registration.” (b) Purpose statement. The registration page... registration page. The Web site registration page shall request only the consumer's name, address, telephone...

  12. 21 CFR 1301.36 - Suspension or revocation of registration; suspension of registration pending final order...

    Science.gov (United States)

    2010-04-01

    ... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Suspension or revocation of registration; suspension of registration pending final order; extension of registration pending final order. 1301.36... registration pending final order; extension of registration pending final order. (a) For any registration...

  13. 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.

  14. 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.

  15. 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

  16. 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

  17. 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

  18. Image Registration: A Necessary Evil

    Science.gov (United States)

    Bell, James; McLachlan, Blair; Hermstad, Dexter; Trosin, Jeff; George, Michael W. (Technical Monitor)

    1995-01-01

    Registration of test and reference images is a key component of nearly all PSP data reduction techniques. This is done to ensure that a test image pixel viewing a particular point on the model is ratioed by the reference image pixel which views the same point. Typically registration is needed to account for model motion due to differing airloads when the wind-off and wind-on images are taken. Registration is also necessary when two cameras are used for simultaneous acquisition of data from a dual-frequency paint. This presentation will discuss the advantages and disadvantages of several different image registration techniques. In order to do so, it is necessary to propose both an accuracy requirement for image registration and a means for measuring the accuracy of a particular technique. High contrast regions in the unregistered images are most sensitive to registration errors, and it is proposed that these regions be used to establish the error limits for registration. Once this is done, the actual registration error can be determined by locating corresponding points on the test and reference images, and determining how well a particular registration technique matches them. An example of this procedure is shown for three transforms used to register images of a semispan model. Thirty control points were located on the model. A subset of the points were used to determine the coefficients of each registration transform, and the error with which each transform aligned the remaining points was determined. The results indicate the general superiority of a third-order polynomial over other candidate transforms, as well as showing how registration accuracy varies with number of control points. Finally, it is proposed that image registration may eventually be done away with completely. As more accurate image resection techniques and more detailed model surface grids become available, it will be possible to map raw image data onto the model surface accurately. Intensity

  19. Pro Forma Registration of Companies

    DEFF Research Database (Denmark)

    Werlauff, Erik

    2010-01-01

    The article analyses the view taken by Community law on companies' pro forma registration in another EU or EEA country. Community law recognises pro forma registration under company law, i.e. a brass plate is sufficient, whereas it does not recognise pro forma registration under tax law, i.......e. a brass plate is not sufficient. The article provides reasons for the differential treatment of the two contexts and clarifies the difference on the basis of the Hubbard criterion, in which it was ruled that the effectiveness of Community law cannot vary according to the various branches of national law....

  20. Computer Registration Becoming Mandatory

    CERN Multimedia

    2003-01-01

    Following the decision by the CERN Management Board (see Weekly Bulletin 38/2003), registration of all computers connected to CERN's network will be enforced and only registered computers will be allowed network access. The implementation has started with the IT buildings, continues with building 40 and the Prevessin site (as of Tuesday 4th November 2003), and will cover the whole of CERN before the end of this year. We therefore recommend strongly that you register all your computers in CERN's network database (Ethernet and wire-less cards) as soon as possible without waiting for the access restriction to take force. This will allow you accessing the network without interruption and help IT service providers to contact you in case of problems (security problems, viruses, etc.) • Users WITH a CERN computing account register at: http://cern.ch/register/ (CERN Intranet page) • Visitors WITHOUT a CERN computing account (e.g. short term visitors) register at: http://cern.ch/registerVisitorComp...

  1. Computer Registration Becoming Mandatory

    CERN Multimedia

    2003-01-01

    Following the decision by the CERN Management Board (see Weekly Bulletin 38/2003), registration of all computers connected to CERN's network will be enforced and only registered computers will be allowed network access. The implementation has started with the IT buildings, continues with building 40 and the Prevessin site (as of Tuesday 4th November 2003), and will cover the whole of CERN before the end of this year. We therefore recommend strongly that you register all your computers in CERN's network database including all network access cards (Ethernet AND wireless) as soon as possible without waiting for the access restriction to take force. This will allow you accessing the network without interruption and help IT service providers to contact you in case of problems (e.g. security problems, viruses, etc.) Users WITH a CERN computing account register at: http://cern.ch/register/ (CERN Intranet page) Visitors WITHOUT a CERN computing account (e.g. short term visitors) register at: http://cern.ch/regis...

  2. 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...

  3. 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.

  4. Drug Establishments Current Registration Site

    Data.gov (United States)

    U.S. Department of Health & Human Services — The Drug Establishments Current Registration Site (DECRS) is a database of current information submitted by drug firms to register establishments (facilities) which...

  5. Individual Pesticides in Registration Review

    Science.gov (United States)

    You can used the Chemical Search database to search pesticides by chemical name and find their registration review dockets, along with Work Plans, risk assessments, interim and final decisions, tolerance rules, and cancellation actions.

  6. 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.

  7. A first step toward uncovering the truth about weight tuning in deformable image registration

    Science.gov (United States)

    Pirpinia, Kleopatra; Bosman, Peter A. N.; Sonke, Jan-Jakob; van Herk, Marcel; Alderliesten, Tanja

    2016-03-01

    Deformable image registration is currently predominantly solved by optimizing a weighted linear combination of objectives. Successfully tuning the weights associated with these objectives is not trivial, leading to trial-and-error approaches. Such an approach assumes an intuitive interplay between weights, optimization objectives, and target registration errors. However, it is not known whether this always holds for existing registration methods. To investigate the interplay between weights, optimization objectives, and registration errors, we employ multi-objective optimization. Here, objectives of interest are optimized simultaneously, causing a set of multiple optimal solutions to exist, called the optimal Pareto front. Our medical application is in breast cancer and includes the challenging prone-supine registration problem. In total, we studied the interplay in three different ways. First, we ran many random linear combinations of objectives using the well-known registration software elastix. Second, since the optimization algorithms used in registration are typically of a local-search nature, final solutions may not always form a Pareto front. We therefore employed a multi-objective evolutionary algorithm that finds weights that correspond to registration outcomes that do form a Pareto front. Third, we examined how the interplay differs if a true multi-objective (i.e., weight-free) image registration method is used. Results indicate that a trial-and-error weight-adaptation approach can be successful for the easy prone to prone breast image registration case, due to the absence of many local optima. With increasing problem difficulty the use of more advanced approaches can be of value in finding and selecting the optimal registration outcomes.

  8. Multisensor data fusion algorithm development

    Energy Technology Data Exchange (ETDEWEB)

    Yocky, D.A.; Chadwick, M.D.; Goudy, S.P.; Johnson, D.K.

    1995-12-01

    This report presents a two-year LDRD research effort into multisensor data fusion. We approached the problem by addressing the available types of data, preprocessing that data, and developing fusion algorithms using that data. The report reflects these three distinct areas. First, the possible data sets for fusion are identified. Second, automated registration techniques for imagery data are analyzed. Third, two fusion techniques are presented. The first fusion algorithm is based on the two-dimensional discrete wavelet transform. Using test images, the wavelet algorithm is compared against intensity modulation and intensity-hue-saturation image fusion algorithms that are available in commercial software. The wavelet approach outperforms the other two fusion techniques by preserving spectral/spatial information more precisely. The wavelet fusion algorithm was also applied to Landsat Thematic Mapper and SPOT panchromatic imagery data. The second algorithm is based on a linear-regression technique. We analyzed the technique using the same Landsat and SPOT data.

  9. 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.

  10. Surface-to-surface registration using level sets

    DEFF Research Database (Denmark)

    Hansen, Mads Fogtmann; Erbou, Søren G.; Vester-Christensen, Martin

    2007-01-01

    This paper presents a general approach for surface-to-surface registration (S2SR) with the Euclidean metric using signed distance maps. In addition, the method is symmetric such that the registration of a shape A to a shape B is identical to the registration of the shape B to the shape A. The S2SR...... problem can be approximated by the image registration (IR) problem of the signed distance maps (SDMs) of the surfaces confined to some narrow band. By shrinking the narrow bands around the zero level sets the solution to the IR problem converges towards the S2SR problem. It is our hypothesis...... that this approach is more robust and less prone to fall into local minima than ordinary surface-to-surface registration. The IR problem is solved using the inverse compositional algorithm. In this paper, a set of 40 pelvic bones of Duroc pigs are registered to each other w.r.t. the Euclidean transformation...

  11. Elastic models application for thorax image registration

    International Nuclear Information System (INIS)

    Correa Prado, Lorena S; Diaz, E Andres Valdez; Romo, Raul

    2007-01-01

    This work consist of the implementation and evaluation of elastic alignment algorithms of biomedical images, which were taken at thorax level and simulated with the 4D NCAT digital phantom. Radial Basis Functions spatial transformations (RBF), a kind of spline, which allows carrying out not only global rigid deformations but also local elastic ones were applied, using a point-matching method. The applied functions were: Thin Plate Spline (TPS), Multiquadric (MQ) Gaussian and B-Spline, which were evaluated and compared by means of calculating the Target Registration Error and similarity measures between the registered images (the squared sum of intensity differences (SSD) and correlation coefficient (CC)). In order to value the user incurred error in the point-matching and segmentation tasks, two algorithms were also designed that calculate the Fiduciary Localization Error. TPS and MQ were demonstrated to have better performance than the others. It was proved RBF represent an adequate model for approximating the thorax deformable behaviour. Validation algorithms showed the user error was not significant

  12. Joint deformable liver registration and bias field correction for MR-guided HDR brachytherapy.

    Science.gov (United States)

    Rak, Marko; König, Tim; Tönnies, Klaus D; Walke, Mathias; Ricke, Jens; Wybranski, Christian

    2017-12-01

    In interstitial high-dose rate brachytherapy, liver cancer is treated by internal radiation, requiring percutaneous placement of applicators within or close to the tumor. To maximize utility, the optimal applicator configuration is pre-planned on magnetic resonance images. The pre-planned configuration is then implemented via a magnetic resonance-guided intervention. Mapping the pre-planning information onto interventional data would reduce the radiologist's cognitive load during the intervention and could possibly minimize discrepancies between optimally pre-planned and actually placed applicators. We propose a fast and robust two-step registration framework suitable for interventional settings: first, we utilize a multi-resolution rigid registration to correct for differences in patient positioning (rotation and translation). Second, we employ a novel iterative approach alternating between bias field correction and Markov random field deformable registration in a multi-resolution framework to compensate for non-rigid movements of the liver, the tumors and the organs at risk. In contrast to existing pre-correction methods, our multi-resolution scheme can recover bias field artifacts of different extents at marginal computational costs. We compared our approach to deformable registration via B-splines, demons and the SyN method on 22 registration tasks from eleven patients. Results showed that our approach is more accurate than the contenders for liver as well as for tumor tissues. We yield average liver volume overlaps of 94.0 ± 2.7% and average surface-to-surface distances of 2.02 ± 0.87 mm and 3.55 ± 2.19 mm for liver and tumor tissue, respectively. The reported distances are close to (or even below) the slice spacing (2.5 - 3.0 mm) of our data. Our approach is also the fastest, taking 35.8 ± 12.8 s per task. The presented approach is sufficiently accurate to map information available from brachytherapy pre-planning onto interventional data. It

  13. 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.

  14. 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.

  15. 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.

  16. 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.

  17. 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)

  18. 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.

  19. Algorithming the Algorithm

    DEFF Research Database (Denmark)

    Mahnke, Martina; Uprichard, Emma

    2014-01-01

    Imagine sailing across the ocean. The sun is shining, vastness all around you. And suddenly [BOOM] you’ve hit an invisible wall. Welcome to the Truman Show! Ever since Eli Pariser published his thoughts on a potential filter bubble, this movie scenario seems to have become reality, just with slight...... changes: it’s not the ocean, it’s the internet we’re talking about, and it’s not a TV show producer, but algorithms that constitute a sort of invisible wall. Building on this assumption, most research is trying to ‘tame the algorithmic tiger’. While this is a valuable and often inspiring approach, we...

  20. 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

  1. Optimizing disk registration algorithms for nanobeam electron diffraction strain mapping

    Energy Technology Data Exchange (ETDEWEB)

    Pekin, Thomas C. [Department of Materials Science and Engineering, University of California, Berkeley, Berkeley, USA 94720 (United States); National Center for Electron Microscopy, Molecular Foundry, Lawrence Berkeley National Laboratory, Berkeley, USA 94720 (United States); Gammer, Christoph [Erich Schmid Institute of Materials Science, Jahnstrasse 12, Leoben, Austria 8700 (Austria); Ciston, Jim [National Center for Electron Microscopy, Molecular Foundry, Lawrence Berkeley National Laboratory, Berkeley, USA 94720 (United States); Minor, Andrew M. [Department of Materials Science and Engineering, University of California, Berkeley, Berkeley, USA 94720 (United States); National Center for Electron Microscopy, Molecular Foundry, Lawrence Berkeley National Laboratory, Berkeley, USA 94720 (United States); Ophus, Colin, E-mail: cophus@gmail.com [National Center for Electron Microscopy, Molecular Foundry, Lawrence Berkeley National Laboratory, Berkeley, USA 94720 (United States)

    2017-05-15

    Scanning nanobeam electron diffraction strain mapping is a technique by which the positions of diffracted disks sampled at the nanoscale over a crystalline sample can be used to reconstruct a strain map over a large area. However, it is important that the disk positions are measured accurately, as their positions relative to a reference are directly used to calculate strain. In this study, we compare several correlation methods using both simulated and experimental data in order to directly probe susceptibility to measurement error due to non-uniform diffracted disk illumination structure. We found that prefiltering the diffraction patterns with a Sobel filter before performing cross correlation or performing a square-root magnitude weighted phase correlation returned the best results when inner disk structure was present. We have tested these methods both on simulated datasets, and experimental data from unstrained silicon as well as a twin grain boundary in 304 stainless steel.

  2. 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)

  3. 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.    ...

  4. Wavelet Compressed PCA Models for Real-Time Image Registration in Augmented Reality Applications

    OpenAIRE

    Christopher Cooper; Kent Wise; John Cooper; Makarand Deo

    2015-01-01

    The use of augmented reality (AR) has shown great promise in enhancing medical training and diagnostics via interactive simulations. This paper presents a novel method to perform accurate and inexpensive image registration (IR) utilizing a pre-constructed database of reference objects in conjunction with a principal component analysis (PCA) model. In addition, a wavelet compression algorithm is utilized to enhance the speed of the registration process. The proposed method is used to perform r...

  5. 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

  6. Language proficiency and nursing registration.

    Science.gov (United States)

    Müller, Amanda

    2016-02-01

    This discussion paper focuses on English proficiency standards for nursing registration in Australia, how Australia has dealt with the issue of language proficiency, and the factors which have led to the establishment of the current language standards. Also, this paper will provide a comparison of the two language tests that are currently accepted in Australia (OET and IELTS), including the appropriateness of these tests and the minimum standards used. The paper will also examine the use of educational background as an indicator of language proficiency. Finally, communication-based complaints in the post-registration environment will be explored, and some discussion will be provided about why pre-registration measures might have failed to prevent such problematic situations from occurring. Copyright © 2015 Elsevier Ltd. All rights reserved.

  7. 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.

  8. INVITED REVIEW--IMAGE REGISTRATION IN VETERINARY RADIATION ONCOLOGY: INDICATIONS, IMPLICATIONS, AND FUTURE ADVANCES.

    Science.gov (United States)

    Feng, Yang; Lawrence, Jessica; Cheng, Kun; Montgomery, Dean; Forrest, Lisa; Mclaren, Duncan B; McLaughlin, Stephen; Argyle, David J; Nailon, William H

    2016-01-01

    The field of veterinary radiation therapy (RT) has gained substantial momentum in recent decades with significant advances in conformal treatment planning, image-guided radiation therapy (IGRT), and intensity-modulated (IMRT) techniques. At the root of these advancements lie improvements in tumor imaging, image alignment (registration), target volume delineation, and identification of critical structures. Image registration has been widely used to combine information from multimodality images such as computerized tomography (CT), magnetic resonance imaging (MRI), and positron emission tomography (PET) to improve the accuracy of radiation delivery and reliably identify tumor-bearing areas. Many different techniques have been applied in image registration. This review provides an overview of medical image registration in RT and its applications in veterinary oncology. A summary of the most commonly used approaches in human and veterinary medicine is presented along with their current use in IGRT and adaptive radiation therapy (ART). It is important to realize that registration does not guarantee that target volumes, such as the gross tumor volume (GTV), are correctly identified on the image being registered, as limitations unique to registration algorithms exist. Research involving novel registration frameworks for automatic segmentation of tumor volumes is ongoing and comparative oncology programs offer a unique opportunity to test the efficacy of proposed algorithms. © 2016 American College of Veterinary Radiology.

  9. 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.

  10. Numerical methods for image registration

    CERN Document Server

    Modersitzki, Jan

    2003-01-01

    Based on the author's lecture notes and research, this well-illustrated and comprehensive text is one of the first to provide an introduction to image registration with particular emphasis on numerical methods in medical imaging. Ideal for researchers in industry and academia, it is also a suitable study guide for graduate mathematicians, computer scientists, engineers, medical physicists, and radiologists.Image registration is utilised whenever information obtained from different viewpoints needs to be combined or compared and unwanted distortion needs to be eliminated. For example, CCTV imag

  11. AN AUTOMATIC OPTICAL AND SAR IMAGE REGISTRATION METHOD USING ITERATIVE MULTI-LEVEL AND REFINEMENT MODEL

    Directory of Open Access Journals (Sweden)

    C. Xu

    2016-06-01

    Full Text Available Automatic image registration is a vital yet challenging task, particularly for multi-sensor remote sensing images. Given the diversity of the data, it is unlikely that a single registration algorithm or a single image feature will work satisfactorily for all applications. Focusing on this issue, the mainly contribution of this paper is to propose an automatic optical-to-SAR image registration method using –level and refinement model: Firstly, a multi-level strategy of coarse-to-fine registration is presented, the visual saliency features is used to acquire coarse registration, and then specific area and line features are used to refine the registration result, after that, sub-pixel matching is applied using KNN Graph. Secondly, an iterative strategy that involves adaptive parameter adjustment for re-extracting and re-matching features is presented. Considering the fact that almost all feature-based registration methods rely on feature extraction results, the iterative strategy improve the robustness of feature matching. And all parameters can be automatically and adaptively adjusted in the iterative procedure. Thirdly, a uniform level set segmentation model for optical and SAR images is presented to segment conjugate features, and Voronoi diagram is introduced into Spectral Point Matching (VSPM to further enhance the matching accuracy between two sets of matching points. Experimental results show that the proposed method can effectively and robustly generate sufficient, reliable point pairs and provide accurate registration.

  12. Contacts in the Office of Pesticide Programs, Registration Division

    Science.gov (United States)

    The Registration Division (RD) is responsible product registrations, amendments, registrations, tolerances, experimental use permits, and emergency exemptions for conventional chemical pesticides. Find contacts in this division.

  13. What drives Users' Website Registration?

    NARCIS (Netherlands)

    T. Li (Ting); P.A. Pavlou (Paul)

    2013-01-01

    textabstractUser registration is an important prerequisite for the success of many websites by enabling users to gain access to domain information and personalized content. It is not always desirable for users, however, because they need to disclose personal information. This paper examines what

  14. ACIR: automatic cochlea image registration

    Science.gov (United States)

    Al-Dhamari, Ibraheem; Bauer, Sabine; Paulus, Dietrich; Lissek, Friedrich; Jacob, Roland

    2017-02-01

    Efficient Cochlear Implant (CI) surgery requires prior knowledge of the cochlea's size and its characteristics. This information helps to select suitable implants for different patients. To get these measurements, a segmentation method of cochlea medical images is needed. An important pre-processing step for good cochlea segmentation involves efficient image registration. The cochlea's small size and complex structure, in addition to the different resolutions and head positions during imaging, reveals a big challenge for the automated registration of the different image modalities. In this paper, an Automatic Cochlea Image Registration (ACIR) method for multi- modal human cochlea images is proposed. This method is based on using small areas that have clear structures from both input images instead of registering the complete image. It uses the Adaptive Stochastic Gradient Descent Optimizer (ASGD) and Mattes's Mutual Information metric (MMI) to estimate 3D rigid transform parameters. The use of state of the art medical image registration optimizers published over the last two years are studied and compared quantitatively using the standard Dice Similarity Coefficient (DSC). ACIR requires only 4.86 seconds on average to align cochlea images automatically and to put all the modalities in the same spatial locations without human interference. The source code is based on the tool elastix and is provided for free as a 3D Slicer plugin. Another contribution of this work is a proposed public cochlea standard dataset which can be downloaded for free from a public XNAT server.

  15. 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

  16. 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.

  17. 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.

  18. 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)

  19. Multibeam 3D Underwater SLAM with Probabilistic Registration

    Directory of Open Access Journals (Sweden)

    Albert Palomer

    2016-04-01

    Full Text Available This paper describes a pose-based underwater 3D Simultaneous Localization and Mapping (SLAM using a multibeam echosounder to produce high consistency underwater maps. The proposed algorithm compounds swath profiles of the seafloor with dead reckoning localization to build surface patches (i.e., point clouds. An Iterative Closest Point (ICP with a probabilistic implementation is then used to register the point clouds, taking into account their uncertainties. The registration process is divided in two steps: (1 point-to-point association for coarse registration and (2 point-to-plane association for fine registration. The point clouds of the surfaces to be registered are sub-sampled in order to decrease both the computation time and also the potential of falling into local minima during the registration. In addition, a heuristic is used to decrease the complexity of the association step of the ICP from O ( n 2 to O ( n . The performance of the SLAM framework is tested using two real world datasets: First, a 2.5D bathymetric dataset obtained with the usual down-looking multibeam sonar configuration, and second, a full 3D underwater dataset acquired with a multibeam sonar mounted on a pan and tilt unit.

  20. Sound algorithms

    OpenAIRE

    De Götzen , Amalia; Mion , Luca; Tache , Olivier

    2007-01-01

    International audience; We call sound algorithms the categories of algorithms that deal with digital sound signal. Sound algorithms appeared in the very infancy of computer. Sound algorithms present strong specificities that are the consequence of two dual considerations: the properties of the digital sound signal itself and its uses, and the properties of auditory perception.

  1. Genetic algorithms

    Science.gov (United States)

    Wang, Lui; Bayer, Steven E.

    1991-01-01

    Genetic algorithms are mathematical, highly parallel, adaptive search procedures (i.e., problem solving methods) based loosely on the processes of natural genetics and Darwinian survival of the fittest. Basic genetic algorithms concepts are introduced, genetic algorithm applications are introduced, and results are presented from a project to develop a software tool that will enable the widespread use of genetic algorithm technology.

  2. Evaluation of the use of registration stickers.

    Science.gov (United States)

    2011-04-01

    This research evaluated the potential costs and benefits of doing away with license plate registration stickers as part : of the registration renewal process for Pennsylvania. The research consisted of a comprehensive literature review, a : survey of...

  3. Fuels Registration, Reporting, and Compliance Help

    Science.gov (United States)

    Information about the requirements for registration and health effects testing of new fuels or fuel additives and mandatory registration for fuels reporting and about mandatory reporting forms for parties regulated under EPA fuel programs.

  4. 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

  5. An embedded system for image segmentation and multimodal registration in noninvasive skin cancer screening.

    Science.gov (United States)

    Diaz, Silvana; Soto, Javier E; Inostroza, Fabian; Godoy, Sebastian E; Figueroa, Miguel

    2017-07-01

    We present a heterogeneous architecture for image registration and multimodal segmentation on an embedded system for noninvasive skin cancer screening. The architecture combines Otsu thresholding and the random walker algorithm to perform image segmentation, and features a hardware implementation of the Harris corner detection algorithm to perform region-of-interest detection and image registration. Running on a Xilinx XC7Z020 reconfigurable system-on-a-chip, our prototype computes the initial segmentation of a 400×400-pixel region of interest in the visible spectrum in 12.1 seconds, and registers infrared images against this region at 540 frames per second, while consuming 1.9W.

  6. 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

  7. Consistency and accuracy of diagnostic cancer codes generated by automated registration: comparison with manual registration

    Directory of Open Access Journals (Sweden)

    Codazzi Tiziana

    2006-09-01

    Full Text Available Abstract Background Automated procedures are increasingly used in cancer registration, and it is important that the data produced are systematically checked for consistency and accuracy. We evaluated an automated procedure for cancer registration adopted by the Lombardy Cancer Registry in 1997, comparing automatically-generated diagnostic codes with those produced manually over one year (1997. Methods The automatically generated cancer cases were produced by Open Registry algorithms. For manual registration, trained staff consulted clinical records, pathology reports and death certificates. The social security code, present and checked in both databases in all cases, was used to match the files in the automatic and manual databases. The cancer cases generated by the two methods were compared by manual revision. Results The automated procedure generated 5027 cases: 2959 (59% were accepted automatically and 2068 (41% were flagged for manual checking. Among the cases accepted automatically, discrepancies in data items (surname, first name, sex and date of birth constituted 8.5% of cases, and discrepancies in the first three digits of the ICD-9 code constituted 1.6%. Among flagged cases, cancers of female genital tract, hematopoietic system, metastatic and ill-defined sites, and oropharynx predominated. The usual reasons were use of specific vs. generic codes, presence of multiple primaries, and use of extranodal vs. nodal codes for lymphomas. The percentage of automatically accepted cases ranged from 83% for breast and thyroid cancers to 13% for metastatic and ill-defined cancer sites. Conclusion Since 59% of cases were accepted automatically and contained relatively few, mostly trivial discrepancies, the automatic procedure is efficient for routine case generation effectively cutting the workload required for routine case checking by this amount. Among cases not accepted automatically, discrepancies were mainly due to variations in coding practice.

  8. 12 CFR 583.18 - Registrant.

    Science.gov (United States)

    2010-01-01

    ... 12 Banks and Banking 5 2010-01-01 2010-01-01 false Registrant. 583.18 Section 583.18 Banks and Banking OFFICE OF THRIFT SUPERVISION, DEPARTMENT OF THE TREASURY DEFINITIONS FOR REGULATIONS AFFECTING SAVINGS AND LOAN HOLDING COMPANIES § 583.18 Registrant. The term registrant means a savings and loan...

  9. Clinical trial registration in oral health journals.

    Science.gov (United States)

    Smaïl-Faugeron, V; Fron-Chabouis, H; Durieux, P

    2015-03-01

    Prospective registration of randomized controlled trials (RCTs) represents the best solution to reporting bias. The extent to which oral health journals have endorsed and complied with RCT registration is unknown. We identified journals publishing RCTs in dentistry, oral surgery, and medicine in the Journal Citation Reports. We classified journals into 3 groups: journals requiring or recommending trial registration, journals referring indirectly to registration, and journals providing no reference to registration. For the 5 journals with the highest 2012 impact factors in each group, we assessed whether RCTs with results published in 2013 had been registered. Of 78 journals examined, 32 (41%) required or recommended trial registration, 19 (24%) referred indirectly to registration, and 27 (35%) provided no reference to registration. We identified 317 RCTs with results published in the 15 selected journals in 2013. Overall, 73 (23%) were registered in a trial registry. Among those, 91% were registered retrospectively and 32% did not report trial registration in the published article. The proportion of trials registered was not significantly associated with editorial policies: 29% with results in journals that required or recommended registration, 15% in those that referred indirectly to registration, and 21% in those providing no reference to registration (P = 0.05). Less than one-quarter of RCTs with results published in a sample of oral health journals were registered with a public registry. Improvements are needed with respect to how journals inform and require their authors to register their trials. © International & American Associations for Dental Research.

  10. 32 CFR 634.19 - Registration policy.

    Science.gov (United States)

    2010-07-01

    ... 32 National Defense 4 2010-07-01 2010-07-01 true Registration policy. 634.19 Section 634.19 National Defense Department of Defense (Continued) DEPARTMENT OF THE ARMY (CONTINUED) LAW ENFORCEMENT AND CRIMINAL INVESTIGATIONS MOTOR VEHICLE TRAFFIC SUPERVISION Motor Vehicle Registration § 634.19 Registration policy. (a) Motor vehicles will be...

  11. 21 CFR 710.8 - Misbranding by reference to registration or to registration number.

    Science.gov (United States)

    2010-04-01

    ... HUMAN SERVICES (CONTINUED) COSMETICS VOLUNTARY REGISTRATION OF COSMETIC PRODUCT ESTABLISHMENTS § 710.8 Misbranding by reference to registration or to registration number. Registration of a cosmetic product... products by the Food and Drug Administration. Any representation in labeling or advertising that creates an...

  12. 21 CFR 710.6 - Notification of registrant; cosmetic product establishment registration number.

    Science.gov (United States)

    2010-04-01

    ... 21 Food and Drugs 7 2010-04-01 2010-04-01 false Notification of registrant; cosmetic product... OF HEALTH AND HUMAN SERVICES (CONTINUED) COSMETICS VOLUNTARY REGISTRATION OF COSMETIC PRODUCT ESTABLISHMENTS § 710.6 Notification of registrant; cosmetic product establishment registration number. The...

  13. 21 CFR 1301.52 - Termination of registration; transfer of registration; distribution upon discontinuance of business.

    Science.gov (United States)

    2010-04-01

    ... discontinues business or professional practice. Any registrant who ceases legal existence or discontinues... registration; distribution upon discontinuance of business. 1301.52 Section 1301.52 Food and Drugs DRUG... of registration; transfer of registration; distribution upon discontinuance of business. (a) Except...

  14. A mixture model for robust registration in Kinect sensor

    Science.gov (United States)

    Peng, Li; Zhou, Huabing; Zhu, Shengguo

    2018-03-01

    The Microsoft Kinect sensor has been widely used in many applications, but it suffers from the drawback of low registration precision between color image and depth image. In this paper, we present a robust method to improve the registration precision by a mixture model that can handle multiply images with the nonparametric model. We impose non-parametric geometrical constraints on the correspondence, as a prior distribution, in a reproducing kernel Hilbert space (RKHS).The estimation is performed by the EM algorithm which by also estimating the variance of the prior model is able to obtain good estimates. We illustrate the proposed method on the public available dataset. The experimental results show that our approach outperforms the baseline methods.

  15. 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.

  16. 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.)

  17. Algorithmic cryptanalysis

    CERN Document Server

    Joux, Antoine

    2009-01-01

    Illustrating the power of algorithms, Algorithmic Cryptanalysis describes algorithmic methods with cryptographically relevant examples. Focusing on both private- and public-key cryptographic algorithms, it presents each algorithm either as a textual description, in pseudo-code, or in a C code program.Divided into three parts, the book begins with a short introduction to cryptography and a background chapter on elementary number theory and algebra. It then moves on to algorithms, with each chapter in this section dedicated to a single topic and often illustrated with simple cryptographic applic

  18. Summer Camp July 2017 - Registration

    CERN Multimedia

    EVE et École

    2017-01-01

    The CERN Staff Association’s Summer Camp will be open for children from 4 to 6 years old during four weeks, from 3 to 28 July. Registration is offered on a weekly basis for 450 CHF, lunch included. This year, the various activities will revolve around the theme of the Four Elements. Registration opened on 20 March 2017 for children currently attending the EVE and School of the Association. It will be open from 3 April for children of CERN Members of Personnel, and starting from 24 April for all other children. The general conditions are available on the website of the EVE and School of CERN Staff Association: http://nurseryschool.web.cern.ch. For further questions, please contact us by email at Summer.Camp@cern.ch.

  19. Propagation of registration uncertainty during multi-fraction cervical cancer brachytherapy

    Science.gov (United States)

    Amir-Khalili, A.; Hamarneh, G.; Zakariaee, R.; Spadinger, I.; Abugharbieh, R.

    2017-10-01

    Multi-fraction cervical cancer brachytherapy is a form of image-guided radiotherapy that heavily relies on 3D imaging during treatment planning, delivery, and quality control. In this context, deformable image registration can increase the accuracy of dosimetric evaluations, provided that one can account for the uncertainties associated with the registration process. To enable such capability, we propose a mathematical framework that first estimates the registration uncertainty and subsequently propagates the effects of the computed uncertainties from the registration stage through to the visualizations, organ segmentations, and dosimetric evaluations. To ensure the practicality of our proposed framework in real world image-guided radiotherapy contexts, we implemented our technique via a computationally efficient and generalizable algorithm that is compatible with existing deformable image registration software. In our clinical context of fractionated cervical cancer brachytherapy, we perform a retrospective analysis on 37 patients and present evidence that our proposed methodology for computing and propagating registration uncertainties may be beneficial during therapy planning and quality control. Specifically, we quantify and visualize the influence of registration uncertainty on dosimetric analysis during the computation of the total accumulated radiation dose on the bladder wall. We further show how registration uncertainty may be leveraged into enhanced visualizations that depict the quality of the registration and highlight potential deviations from the treatment plan prior to the delivery of radiation treatment. Finally, we show that we can improve the transfer of delineated volumetric organ segmentation labels from one fraction to the next by encoding the computed registration uncertainties into the segmentation labels.

  20. 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.

  1. Victoria's review of registration for health practitioners.

    Science.gov (United States)

    Scotts, H; Carter, M

    1988-01-01

    This article discusses some of the issues raised in the Interim Report of the current Review of Registration of Health Practitioners being conducted for the Victorian Health Department. The Report attempts to develop the framework in which the registration Boards will operate as part of a cohesive registration system. It proposed a mechanism and criteria for the registration of new groups as well as principles which can be applied to the ongoing review of each existing Board. The Review takes the perspective that registration of health practitioners carries with it both advantages and disadvantages for the general community. Under the proposed new system the controls exercised over health care providers by Registration Boards would be evaluated on the basis of to what extent the benefits to the public outweighed the potential costs. It is in this context that the Report addresses issues such as consumer complaints handling, registration of individual practitioners and controls over professional advertising and other business practices.

  2. Algorithmic mathematics

    CERN Document Server

    Hougardy, Stefan

    2016-01-01

    Algorithms play an increasingly important role in nearly all fields of mathematics. This book allows readers to develop basic mathematical abilities, in particular those concerning the design and analysis of algorithms as well as their implementation. It presents not only fundamental algorithms like the sieve of Eratosthenes, the Euclidean algorithm, sorting algorithms, algorithms on graphs, and Gaussian elimination, but also discusses elementary data structures, basic graph theory, and numerical questions. In addition, it provides an introduction to programming and demonstrates in detail how to implement algorithms in C++. This textbook is suitable for students who are new to the subject and covers a basic mathematical lecture course, complementing traditional courses on analysis and linear algebra. Both authors have given this "Algorithmic Mathematics" course at the University of Bonn several times in recent years.

  3. Comparison of time-series registration methods in breast dynamic infrared imaging

    Science.gov (United States)

    Riyahi-Alam, S.; Agostini, V.; Molinari, F.; Knaflitz, M.

    2015-03-01

    Automated motion reduction in dynamic infrared imaging is on demand in clinical applications, since movement disarranges time-temperature series of each pixel, thus originating thermal artifacts that might bias the clinical decision. All previously proposed registration methods are feature based algorithms requiring manual intervention. The aim of this work is to optimize the registration strategy specifically for Breast Dynamic Infrared Imaging and to make it user-independent. We implemented and evaluated 3 different 3D time-series registration methods: 1. Linear affine, 2. Non-linear Bspline, 3. Demons applied to 12 datasets of healthy breast thermal images. The results are evaluated through normalized mutual information with average values of 0.70 ±0.03, 0.74 ±0.03 and 0.81 ±0.09 (out of 1) for Affine, Bspline and Demons registration, respectively, as well as breast boundary overlap and Jacobian determinant of the deformation field. The statistical analysis of the results showed that symmetric diffeomorphic Demons' registration method outperforms also with the best breast alignment and non-negative Jacobian values which guarantee image similarity and anatomical consistency of the transformation, due to homologous forces enforcing the pixel geometric disparities to be shortened on all the frames. We propose Demons' registration as an effective technique for time-series dynamic infrared registration, to stabilize the local temperature oscillation.

  4. 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.

  5. Total algorithms

    NARCIS (Netherlands)

    Tel, G.

    We define the notion of total algorithms for networks of processes. A total algorithm enforces that a "decision" is taken by a subset of the processes, and that participation of all processes is required to reach this decision. Total algorithms are an important building block in the design of

  6. 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.

  7. 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.

  8. 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.

  9. 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.

  10. 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.

  11. 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.

  12. 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...

  13. Non-rigid molecular group theory and its applications

    International Nuclear Information System (INIS)

    Balasubramanian, K.

    1982-06-01

    The use of generalized wreath product groups as representations of symmetry groups of nonrigid molecules is considered. Generating function techniques are outlined for nuclear spin statistics and character tables of the symmetry groups of nonrigid molecules. Several applications of nonrigid molecular group theory to NMR spectroscopy, rovibronic splitting and nuclear spin statistics of nonrigid molecules, molecular beam deflection and electric resonance experiments of weakly bound Van der Waal complexes, isomerization processes, configuration interaction calculations and the symmetry of crystals with structural distortions are described. 81 references

  14. Modeling susceptibility difference artifacts produced by metallic implants in magnetic resonance imaging with point-based thin-plate spline image registration.

    Science.gov (United States)

    Pauchard, Y; Smith, M; Mintchev, M

    2004-01-01

    Magnetic resonance imaging (MRI) suffers from geometric distortions arising from various sources. One such source are the non-linearities associated with the presence of metallic implants, which can profoundly distort the obtained images. These non-linearities result in pixel shifts and intensity changes in the vicinity of the implant, often precluding any meaningful assessment of the entire image. This paper presents a method for correcting these distortions based on non-rigid image registration techniques. Two images from a modelled three-dimensional (3D) grid phantom were subjected to point-based thin-plate spline registration. The reference image (without distortions) was obtained from a grid model including a spherical implant, and the corresponding test image containing the distortions was obtained using previously reported technique for spatial modelling of magnetic susceptibility artifacts. After identifying the nonrecoverable area in the distorted image, the calculated spline model was able to quantitatively account for the distortions, thus facilitating their compensation. Upon the completion of the compensation procedure, the non-recoverable area was removed from the reference image and the latter was compared to the compensated image. Quantitative assessment of the goodness of the proposed compensation technique is presented.

  15. Speeding up coarse point cloud registration by threshold-independent baysac match selection

    NARCIS (Netherlands)

    Kang, Z.; Lindenbergh, R.C.; Pu, S

    2016-01-01

    This paper presents an algorithm for the automatic registration of terrestrial point clouds by match selection using an efficiently conditional sampling method - Threshold-independent BaySAC (BAYes SAmpling Consensus) and employs the error metric of average point- To-surface residual to reduce

  16. 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

  17. Towards 3D Face Recognition in the Real: A Registration-Free Approach Using Fine-Grained Matching of 3D Keypoint Descriptors

    KAUST Repository

    Li, Huibin; Huang, Di; Morvan, Jean-Marie; Wang, Yunhong; Chen, Liming

    2014-01-01

    Registration algorithms performed on point clouds or range images of face scans have been successfully used for automatic 3D face recognition under expression variations, but have rarely been investigated to solve pose changes and occlusions mainly

  18. Registration Day-Camp 2016

    CERN Multimedia

    Nursery School

    2016-01-01

    Reminder Registration for the CERN Staff Association Day-camp are open for children from 4 to 6 years old More information on the website: http://nurseryschool.web.cern.ch/. The day-camp is open to all children. An inscription per week is proposed, cost 480.-CHF/week, lunch included The camp will be open weeks 27, 28, 29 and 30, from 8:30 am to 5:30 pm. For further questions, thanks you for contacting us by email at Summer.Camp@cern.ch.

  19. 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)

  20. Automatic Registration of Vehicle-borne Mobile Mapping Laser Point Cloud and Sequent Panoramas

    Directory of Open Access Journals (Sweden)

    CHEN Chi

    2018-02-01

    Full Text Available An automatic registration method of mobile mapping system laser point cloud and sequence panoramic image is proposed in this paper.Firstly,hierarchical object extraction method is applied on LiDAR data to extract the building façade and outline polygons are generated to construct the skyline vectors.A virtual imaging method is proposed to solve the distortion on panoramas and corners on skylines are further detected on the virtual images combining segmentation and corner detection results.Secondly,the detected skyline vectors are taken as the registration primitives.Registration graphs are built according to the extracted skyline vector and further matched under graph edit distance minimization criteria.The matched conjugate primitives are utilized to solve the 2D-3D rough registration model to obtain the initial transformation between the sequence panoramic image coordinate system and the LiDAR point cloud coordinate system.Finally,to reduce the impact of registration primitives extraction and matching error on the registration results,the optimal transformation between the multi view stereo matching dens point cloud generated from the virtual imaging of the sequent panoramas and the LiDAR point cloud are solved by a 3D-3D ICP registration algorithm variant,thus,refine the exterior orientation parameters of panoramas indirectly.Experiments are undertaken to validate the proposed method and the results show that 1.5 pixel level registration results are achieved on the experiment dataset.The registration results can be applied to point cloud and panoramas fusion applications such as true color point cloud generation.

  1. A Markov Random Field Groupwise Registration Framework for Face Recognition.

    Science.gov (United States)

    Liao, Shu; Shen, Dinggang; Chung, Albert C S

    2014-04-01

    In this paper, we propose a new framework for tackling face recognition problem. The face recognition problem is formulated as groupwise deformable image registration and feature matching problem. The main contributions of the proposed method lie in the following aspects: (1) Each pixel in a facial image is represented by an anatomical signature obtained from its corresponding most salient scale local region determined by the survival exponential entropy (SEE) information theoretic measure. (2) Based on the anatomical signature calculated from each pixel, a novel Markov random field based groupwise registration framework is proposed to formulate the face recognition problem as a feature guided deformable image registration problem. The similarity between different facial images are measured on the nonlinear Riemannian manifold based on the deformable transformations. (3) The proposed method does not suffer from the generalizability problem which exists commonly in learning based algorithms. The proposed method has been extensively evaluated on four publicly available databases: FERET, CAS-PEAL-R1, FRGC ver 2.0, and the LFW. It is also compared with several state-of-the-art face recognition approaches, and experimental results demonstrate that the proposed method consistently achieves the highest recognition rates among all the methods under comparison.

  2. 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

  3. 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

  4. 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

  5. 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

  6. The cadastral registration of the property right

    Directory of Open Access Journals (Sweden)

    D.-G. IONAȘ

    2017-12-01

    Full Text Available Real rights are subjective patrimonial rights which provide the holder with the right to directly exercise certain prerogatives over a determined good. Real rights over immobile goods, registered in the cadastral register are called tabular rights. Cadastral registration is that certain form of registration by which a real right over an immobile good is acquired, changed or ended, from the time de registration request is filed. At this time, registration in the cadastral register provides the opposability effect, as the constitutive effect is suspended until the cadastral works are finalized and new cadastral registers are created for each administrative unit.

  7. Automatic block-matching registration to improve lung tumor localization during image-guided radiotherapy

    Science.gov (United States)

    Robertson, Scott Patrick

    To improve relatively poor outcomes for locally-advanced lung cancer patients, many current efforts are dedicated to minimizing uncertainties in radiotherapy. This enables the isotoxic delivery of escalated tumor doses, leading to better local tumor control. The current dissertation specifically addresses inter-fractional uncertainties resulting from patient setup variability. An automatic block-matching registration (BMR) algorithm is implemented and evaluated for the purpose of directly localizing advanced-stage lung tumors during image-guided radiation therapy. In this algorithm, small image sub-volumes, termed "blocks", are automatically identified on the tumor surface in an initial planning computed tomography (CT) image. Each block is independently and automatically registered to daily images acquired immediately prior to each treatment fraction. To improve the accuracy and robustness of BMR, this algorithm incorporates multi-resolution pyramid registration, regularization with a median filter, and a new multiple-candidate-registrations technique. The result of block-matching is a sparse displacement vector field that models local tissue deformations near the tumor surface. The distribution of displacement vectors is aggregated to obtain the final tumor registration, corresponding to the treatment couch shift for patient setup correction. Compared to existing rigid and deformable registration algorithms, the final BMR algorithm significantly improves the overlap between target volumes from the planning CT and registered daily images. Furthermore, BMR results in the smallest treatment margins for the given study population. However, despite these improvements, large residual target localization errors were noted, indicating that purely rigid couch shifts cannot correct for all sources of inter-fractional variability. Further reductions in treatment uncertainties may require the combination of high-quality target localization and adaptive radiotherapy.

  8. An efficient direct method for image registration of flat objects

    Science.gov (United States)

    Nikolaev, Dmitry; Tihonkih, Dmitrii; Makovetskii, Artyom; Voronin, Sergei

    2017-09-01

    Image alignment of rigid surfaces is a rapidly developing area of research and has many practical applications. Alignment methods can be roughly divided into two types: feature-based methods and direct methods. Known SURF and SIFT algorithms are examples of the feature-based methods. Direct methods refer to those that exploit the pixel intensities without resorting to image features and image-based deformations are general direct method to align images of deformable objects in 3D space. Nevertheless, it is not good for the registration of images of 3D rigid objects since the underlying structure cannot be directly evaluated. In the article, we propose a model that is suitable for image alignment of rigid flat objects under various illumination models. The brightness consistency assumptions used for reconstruction of optimal geometrical transformation. Computer simulation results are provided to illustrate the performance of the proposed algorithm for computing of an accordance between pixels of two images.

  9. 77 FR 66920 - Registration of Claims to Copyright: Group Registration of Serial Issues Filed Electronically

    Science.gov (United States)

    2012-11-08

    ... registered on a single application and for a single fee. The group registration privilege is contingent upon... was limited to basic registrations, i.e., claims in single works, while the capacity to process online... of related serials. Revisions to the electronic registration system will upgrade the capacity of the...

  10. An accelerated image matching technique for UAV orthoimage registration

    Science.gov (United States)

    Tsai, Chung-Hsien; Lin, Yu-Ching

    2017-06-01

    Using an Unmanned Aerial Vehicle (UAV) drone with an attached non-metric camera has become a popular low-cost approach for collecting geospatial data. A well-georeferenced orthoimage is a fundamental product for geomatics professionals. To achieve high positioning accuracy of orthoimages, precise sensor position and orientation data, or a number of ground control points (GCPs), are often required. Alternatively, image registration is a solution for improving the accuracy of a UAV orthoimage, as long as a historical reference image is available. This study proposes a registration scheme, including an Accelerated Binary Robust Invariant Scalable Keypoints (ABRISK) algorithm and spatial analysis of corresponding control points for image registration. To determine a match between two input images, feature descriptors from one image are compared with those from another image. A "Sorting Ring" is used to filter out uncorrected feature pairs as early as possible in the stage of matching feature points, to speed up the matching process. The results demonstrate that the proposed ABRISK approach outperforms the vector-based Scale Invariant Feature Transform (SIFT) approach where radiometric variations exist. ABRISK is 19.2 times and 312 times faster than SIFT for image sizes of 1000 × 1000 pixels and 4000 × 4000 pixels, respectively. ABRISK is 4.7 times faster than Binary Robust Invariant Scalable Keypoints (BRISK). Furthermore, the positional accuracy of the UAV orthoimage after applying the proposed image registration scheme is improved by an average of root mean square error (RMSE) of 2.58 m for six test orthoimages whose spatial resolutions vary from 6.7 cm to 10.7 cm.

  11. Advanced methods for image registration applied to JET videos

    Energy Technology Data Exchange (ETDEWEB)

    Craciunescu, Teddy, E-mail: teddy.craciunescu@jet.uk [EURATOM-MEdC Association, NILPRP, Bucharest (Romania); Murari, Andrea [Consorzio RFX, Associazione EURATOM-ENEA per la Fusione, Padova (Italy); Gelfusa, Michela [Associazione EURATOM-ENEA – University of Rome “Tor Vergata”, Roma (Italy); Tiseanu, Ion; Zoita, Vasile [EURATOM-MEdC Association, NILPRP, Bucharest (Romania); Arnoux, Gilles [EURATOM/CCFE Fusion Association, Culham Science Centre, Abingdon, Oxon (United Kingdom)

    2015-10-15

    Graphical abstract: - Highlights: • Development of an image registration method for JET IR and fast visible cameras. • Method based on SIFT descriptors and coherent point drift points set registration technique. • Method able to deal with extremely noisy images and very low luminosity images. • Computation time compatible with the inter-shot analysis. - Abstract: The last years have witnessed a significant increase in the use of digital cameras on JET. They are routinely applied for imaging in the IR and visible spectral regions. One of the main technical difficulties in interpreting the data of camera based diagnostics is the presence of movements of the field of view. Small movements occur due to machine shaking during normal pulses while large ones may arise during disruptions. Some cameras show a correlation of image movement with change of magnetic field strength. For deriving unaltered information from the videos and for allowing correct interpretation an image registration method, based on highly distinctive scale invariant feature transform (SIFT) descriptors and on the coherent point drift (CPD) points set registration technique, has been developed. The algorithm incorporates a complex procedure for rejecting outliers. The method has been applied for vibrations correction to videos collected by the JET wide angle infrared camera and for the correction of spurious rotations in the case of the JET fast visible camera (which is equipped with an image intensifier). The method has proved to be able to deal with the images provided by this camera frequently characterized by low contrast and a high level of blurring and noise.

  12. 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.

  13. Central research registration at Technical University of Denmark (DTU)

    DEFF Research Database (Denmark)

    Sand, Ane Ahrenkiel

    Some five years ago, DTU switched from decentralized research registration, where researchers entered their publications into the DTU research repository themselves to centralized research registration, whereby library staff upload academic publications to the repository on behalf...... up the registration team, the configuration of the repository platform (Pure), the registration workflow and last but not least the results since DTU switched to centralized research registration....

  14. Central Research Registration at Technical University of Denmark (DTU)

    DEFF Research Database (Denmark)

    Sand, Ane Ahrenkiel

    Some five years ago, DTU switched from decentralized research registration, where researchers entered their publications into the DTU research repository themselves to centralized research registration, whereby library staff upload academic publications to the repository on behalf...... up the registration team, the configuration of the repository platform (Pure), the registration workflow and last but not least the results since DTU switched to centralized research registration....

  15. Using manual prostate contours to enhance deformable registration of endorectal MRI.

    Science.gov (United States)

    Cheung, M R; Krishnan, K

    2012-10-01

    Endorectal MRI provides detailed images of the prostate anatomy and is useful for radiation treatment planning. Here we describe a Demons field-initialized B-spline deformable registration of prostate MRI. T2-weighted endorectal MRIs of five patients were used. The prostate and the tumor of each patient were manually contoured. The planning MRIs and their segmentations were simulated by warping the corresponding endorectal MRIs using thin plate spline (TPS). Deformable registration was initialized using the deformation field generated using Demons algorithm to map the deformed prostate MRI to the non-deformed one. The solution was refined with B-Spline registration. Volume overlap similarity was used to assess the accuracy of registration and to suggest a minimum margin to account for the registration errors. Initialization using Demons algorithm took about 15 min on a computer with 2.8 GHz Intel, 1.3 GB RAM. Refinement B-spline registration (200 iterations) took less than 5 min. Using the synthetic images as the ground truth, at zero margin, the average (S.D.) 98 (±0.4)% for prostate coverage was 97 (±1)% for tumor. The average (±S.D.) treatment margin required to cover the entire prostate was 1.5 (±0.2)mm. The average (± S.D.) treatment margin required to cover the tumor was 0.7 (±0.1)mm. We also demonstrated the challenges in registering an in vivo deformed MRI to an in vivo non-deformed MRI. We here present a deformable registration scheme that can overcome large deformation. This platform is expected to be useful for prostate cancer radiation treatment planning. Copyright © 2012 Elsevier Ireland Ltd. All rights reserved.

  16. 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)

  17. 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.

  18. 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.

  19. 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.

  20. Technical Note: DIRART- A software suite for deformable image registration and adaptive radiotherapy research

    International Nuclear Information System (INIS)

    Yang Deshan; Brame, Scott; El Naqa, Issam; Aditya, Apte; Wu Yu; Murty Goddu, S.; Mutic, Sasa; Deasy, Joseph O.; Low, Daniel A.

    2011-01-01

    Purpose: Recent years have witnessed tremendous progress in image guide radiotherapy technology and a growing interest in the possibilities for adapting treatment planning and delivery over the course of treatment. One obstacle faced by the research community has been the lack of a comprehensive open-source software toolkit dedicated for adaptive radiotherapy (ART). To address this need, the authors have developed a software suite called the Deformable Image Registration and Adaptive Radiotherapy Toolkit (DIRART). Methods: DIRART is an open-source toolkit developed in MATLAB. It is designed in an object-oriented style with focus on user-friendliness, features, and flexibility. It contains four classes of DIR algorithms, including the newer inverse consistency algorithms to provide consistent displacement vector field in both directions. It also contains common ART functions, an integrated graphical user interface, a variety of visualization and image-processing features, dose metric analysis functions, and interface routines. These interface routines make DIRART a powerful complement to the Computational Environment for Radiotherapy Research (CERR) and popular image-processing toolkits such as ITK. Results: DIRART provides a set of image processing/registration algorithms and postprocessing functions to facilitate the development and testing of DIR algorithms. It also offers a good amount of options for DIR results visualization, evaluation, and validation. Conclusions: By exchanging data with treatment planning systems via DICOM-RT files and CERR, and by bringing image registration algorithms closer to radiotherapy applications, DIRART is potentially a convenient and flexible platform that may facilitate ART and DIR research.

  1. 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.

  2. 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

  3. 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.

  4. Registration Day-Camp 2016

    CERN Multimedia

    Nursery School

    2016-01-01

    Registration for the CERN SA Day-camp are open for children from 4 to 6 years old From March 14 to 25 for children already enrolled in CERN SA EVE and School From April 4 to 15 for the children of CERN members of the personnel (MP) From April 18 for other children More information on the website: http://nurseryschool.web.cern.ch/. The day-camp is open to all children. An inscription per week is proposed, cost 480.-CHF/week, lunch included The camp will be open weeks 27, 28, 29 and 30, from 8:30 am to 5:30 pm. For further questions, thanks you for contacting us by email at Summer.Camp@cern.ch.

  5. [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.

  6. A novel registration-based methodology for prediction of trabecular bone fabric from clinical QCT: A comprehensive analysis.

    Directory of Open Access Journals (Sweden)

    Vimal Chandran

    Full Text Available Osteoporosis leads to hip fractures in aging populations and is diagnosed by modern medical imaging techniques such as quantitative computed tomography (QCT. Hip fracture sites involve trabecular bone, whose strength is determined by volume fraction and orientation, known as fabric. However, bone fabric cannot be reliably assessed in clinical QCT images of proximal femur. Accordingly, we propose a novel registration-based estimation of bone fabric designed to preserve tensor properties of bone fabric and to map bone fabric by a global and local decomposition of the gradient of a non-rigid image registration transformation. Furthermore, no comprehensive analysis on the critical components of this methodology has been previously conducted. Hence, the aim of this work was to identify the best registration-based strategy to assign bone fabric to the QCT image of a patient's proximal femur. The normalized correlation coefficient and curvature-based regularization were used for image-based registration and the Frobenius norm of the stretch tensor of the local gradient was selected to quantify the distance among the proximal femora in the population. Based on this distance, closest, farthest and mean femora with a distinction of sex were chosen as alternative atlases to evaluate their influence on bone fabric prediction. Second, we analyzed different tensor mapping schemes for bone fabric prediction: identity, rotation-only, rotation and stretch tensor. Third, we investigated the use of a population average fabric atlas. A leave one out (LOO evaluation study was performed with a dual QCT and HR-pQCT database of 36 pairs of human femora. The quality of the fabric prediction was assessed with three metrics, the tensor norm (TN error, the degree of anisotropy (DA error and the angular deviation of the principal tensor direction (PTD. The closest femur atlas (CTP with a full rotation (CR for fabric mapping delivered the best results with a TN error of 7

  7. Multi-stage 3D-2D registration for correction of anatomical deformation in image-guided spine surgery

    Science.gov (United States)

    Ketcha, M. D.; De Silva, T.; Uneri, A.; Jacobson, M. W.; Goerres, J.; Kleinszig, G.; Vogt, S.; Wolinsky, J.-P.; Siewerdsen, J. H.

    2017-06-01

    A multi-stage image-based 3D-2D registration method is presented that maps annotations in a 3D image (e.g. point labels annotating individual vertebrae in preoperative CT) to an intraoperative radiograph in which the patient has undergone non-rigid anatomical deformation due to changes in patient positioning or due to the intervention itself. The proposed method (termed msLevelCheck) extends a previous rigid registration solution (LevelCheck) to provide an accurate mapping of vertebral labels in the presence of spinal deformation. The method employs a multi-stage series of rigid 3D-2D registrations performed on sets of automatically determined and increasingly localized sub-images, with the final stage achieving a rigid mapping for each label to yield a locally rigid yet globally deformable solution. The method was evaluated first in a phantom study in which a CT image of the spine was acquired followed by a series of 7 mobile radiographs with increasing degree of deformation applied. Second, the method was validated using a clinical data set of patients exhibiting strong spinal deformation during thoracolumbar spine surgery. Registration accuracy was assessed using projection distance error (PDE) and failure rate (PDE  >  20 mm—i.e. label registered outside vertebra). The msLevelCheck method was able to register all vertebrae accurately for all cases of deformation in the phantom study, improving the maximum PDE of the rigid method from 22.4 mm to 3.9 mm. The clinical study demonstrated the feasibility of the approach in real patient data by accurately registering all vertebral labels in each case, eliminating all instances of failure encountered in the conventional rigid method. The multi-stage approach demonstrated accurate mapping of vertebral labels in the presence of strong spinal deformation. The msLevelCheck method maintains other advantageous aspects of the original LevelCheck method (e.g. compatibility with standard clinical workflow, large

  8. 49 CFR 107.503 - Registration statement.

    Science.gov (United States)

    2010-10-01

    ... tank motor vehicles which the registrant intends to manufacture, assemble, repair, inspect, test or... this section, each person who repairs a cargo tank or cargo tank motor vehicle must submit a copy of... PROGRAM PROCEDURES Registration of Cargo Tank and Cargo Tank Motor Vehicle Manufacturers, Assemblers...

  9. 76 FR 27898 - Registration and Recordation Program

    Science.gov (United States)

    2011-05-13

    ... to reflect a reorganization that has moved the Recordation function from the Visual Arts and... function from the Visual Arts and Recordation Division of the Registration and Recordation Program to the... Visual Arts Division of the Registration and Recordation Program, has been renamed the Recordation...

  10. 27 CFR 25.112 - Dealer registration.

    Science.gov (United States)

    2010-04-01

    .... Every brewer who sells, or offers for sale, any alcohol product (distilled spirits, wines, or beer) fit... registration. Registration covers all sales from the same location, including sales of wine, spirits, or other... for making sales of wine or beer at the customer's place of business. Otherwise, a brewer who conducts...

  11. Deformable image registration using convolutional neural networks

    NARCIS (Netherlands)

    Eppenhof, Koen A.J.; Lafarge, Maxime W.; Moeskops, Pim; Veta, Mitko; Pluim, Josien P.W.

    2018-01-01

    Deformable image registration can be time-consuming and often needs extensive parameterization to perform well on a specific application. We present a step towards a registration framework based on a three-dimensional convolutional neural network. The network directly learns transformations between

  12. Tenure Security Reformand Electronic Registration: Exploring ...

    African Journals Online (AJOL)

    This paper examines the potential significance of updating registration practices in resolving some of the issues about tenure security in a transformative context. It deals with the importance of good governance in the context of land administration and considers its impact on intended reforms. Land registration practice as an ...

  13. 40 CFR 68.160 - Registration.

    Science.gov (United States)

    2010-07-01

    ... Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) AIR PROGRAMS (CONTINUED) CHEMICAL ACCIDENT PREVENTION PROVISIONS Risk Management Plan § 68.160 Registration. (a) The owner or operator shall... substances handled in covered processes. (b) The registration shall include the following data: (1...

  14. 32 CFR 636.9 - Registration requirement.

    Science.gov (United States)

    2010-07-01

    ... 32 National Defense 4 2010-07-01 2010-07-01 true Registration requirement. 636.9 Section 636.9 National Defense Department of Defense (Continued) DEPARTMENT OF THE ARMY (CONTINUED) LAW ENFORCEMENT AND CRIMINAL INVESTIGATIONS MOTOR VEHICLE TRAFFIC SUPERVISION (SPECIFIC INSTALLATIONS) Fort Stewart, Georgia § 636.9 Registration requirement. In...

  15. 32 CFR 636.8 - Registration policy.

    Science.gov (United States)

    2010-07-01

    ... 32 National Defense 4 2010-07-01 2010-07-01 true Registration policy. 636.8 Section 636.8 National Defense Department of Defense (Continued) DEPARTMENT OF THE ARMY (CONTINUED) LAW ENFORCEMENT AND CRIMINAL INVESTIGATIONS MOTOR VEHICLE TRAFFIC SUPERVISION (SPECIFIC INSTALLATIONS) Fort Stewart, Georgia § 636.8 Registration policy. In addition to th...

  16. 19 CFR 360.102 - Online registration.

    Science.gov (United States)

    2010-04-01

    ... 19 Customs Duties 3 2010-04-01 2010-04-01 false Online registration. 360.102 Section 360.102... ANALYSIS SYSTEM § 360.102 Online registration. (a) In general. (1) Any importer, importing company, customs.... boxes will not be accepted. A user identification number will be issued within two business days...

  17. 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)

  18. 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.

  19. Nonrigid registration with tissue-dependent filtering of the deformation field

    International Nuclear Information System (INIS)

    Staring, Marius; Klein, Stefan; Pluim, Josien P W

    2007-01-01

    In present-day medical practice it is often necessary to nonrigidly align image data. Current registration algorithms do not generally take the characteristics of tissue into account. Consequently, rigid tissue, such as bone, can be deformed elastically, growth of tumours may be concealed, and contrast-enhanced structures may be reduced in volume. We propose a method to locally adapt the deformation field at structures that must be kept rigid, using a tissue-dependent filtering technique. This adaptive filtering of the deformation field results in locally linear transformations without scaling or shearing. The degree of filtering is related to tissue stiffness: more filtering is applied at stiff tissue locations, less at parts of the image containing nonrigid tissue. The tissue-dependent filter is incorporated in a commonly used registration algorithm, using mutual information as a similarity measure and cubic B-splines to model the deformation field. The new registration algorithm is compared with this popular method. Evaluation of the proposed tissue-dependent filtering is performed on 3D computed tomography (CT) data of the thorax and on 2D digital subtraction angiography (DSA) images. The results show that tissue-dependent filtering of the deformation field leads to improved registration results: tumour volumes and vessel widths are preserved rather than affected

  20. 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

  1. 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

  2. Deformable Registration for Longitudinal Breast MRI Screening.

    Science.gov (United States)

    Mehrabian, Hatef; Richmond, Lara; Lu, Yingli; Martel, Anne L

    2018-04-13

    MRI screening of high-risk patients for breast cancer provides very high sensitivity, but with a high recall rate and negative biopsies. Comparing the current exam to prior exams reduces the number of follow-up procedures requested by radiologists. Such comparison, however, can be challenging due to the highly deformable nature of breast tissues. Automated co-registration of multiple scans has the potential to aid diagnosis by providing 3D images for side-by-side comparison and also for use in CAD systems. Although many deformable registration techniques exist, they generally have a large number of parameters that need to be optimized and validated for each new application. Here, we propose a framework for such optimization and also identify the optimal input parameter set for registration of 3D T 1 -weighted MRI of breast using Elastix, a widely used and freely available registration tool. A numerical simulation study was first conducted to model the breast tissue and its deformation through finite element (FE) modeling. This model generated the ground truth for evaluating the registration accuracy by providing the deformation of each voxel in the breast volume. An exhaustive search was performed over various values of 7 registration parameters (4050 different combinations of parameters were assessed) and the optimum parameter set was determined. This study showed that there was a large variation in the registration accuracy of different parameter sets ranging from 0.29 mm to 2.50 mm in median registration error and 3.71 mm to 8.90 mm in 95 percentile of the registration error. Mean registration errors of 0.32 mm, 0.29 mm, and 0.30 mm and 95 percentile errors of 3.71 mm, 5.02 mm, and 4.70 mm were obtained by the three best parameter sets. The optimal parameter set was applied to consecutive breast MRI scans of 13 patients. A radiologist identified 113 landmark pairs (~ 11 per patient) which were used to assess registration accuracy. The results demonstrated that

  3. A MRI-CT prostate registration using sparse representation technique

    Science.gov (United States)

    Yang, Xiaofeng; Jani, Ashesh B.; Rossi, Peter J.; Mao, Hui; Curran, Walter J.; Liu, Tian

    2016-03-01

    Purpose: To develop a new MRI-CT prostate registration using patch-based deformation prediction framework to improve MRI-guided prostate radiotherapy by incorporating multiparametric MRI into planning CT images. Methods: The main contribution is to estimate the deformation between prostate MRI and CT images in a patch-wise fashion by using the sparse representation technique. We assume that two image patches should follow the same deformation if their patch-wise appearance patterns are similar. Specifically, there are two stages in our proposed framework, i.e., the training stage and the application stage. In the training stage, each prostate MR images are carefully registered to the corresponding CT images and all training MR and CT images are carefully registered to a selected CT template. Thus, we obtain the dense deformation field for each training MR and CT image. In the application stage, for registering a new subject MR image with the same subject CT image, we first select a small number of key points at the distinctive regions of this subject CT image. Then, for each key point in the subject CT image, we extract the image patch, centered at the underlying key point. Then, we adaptively construct the coupled dictionary for the underlying point where each atom in the dictionary consists of image patches and the respective deformations obtained from training pair-wise MRI-CT images. Next, the subject image patch can be sparsely represented by a linear combination of training image patches in the dictionary, where we apply the same sparse coefficients to the respective deformations in the dictionary to predict the deformation for the subject MR image patch. After we repeat the same procedure for each subject CT key point, we use B-splines to interpolate a dense deformation field, which is used as the initialization to allow the registration algorithm estimating the remaining small segment of deformations from MRI to CT image. Results: Our MRI-CT registration

  4. 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

  5. Optical registration of spaceborne low light remote sensing camera

    Science.gov (United States)

    Li, Chong-yang; Hao, Yan-hui; Xu, Peng-mei; Wang, Dong-jie; Ma, Li-na; Zhao, Ying-long

    2018-02-01

    For the high precision requirement of spaceborne low light remote sensing camera optical registration, optical registration of dual channel for CCD and EMCCD is achieved by the high magnification optical registration system. System integration optical registration and accuracy of optical registration scheme for spaceborne low light remote sensing camera with short focal depth and wide field of view is proposed in this paper. It also includes analysis of parallel misalignment of CCD and accuracy of optical registration. Actual registration results show that imaging clearly, MTF and accuracy of optical registration meet requirements, it provide important guarantee to get high quality image data in orbit.

  6. Sulcal set optimization for cortical surface registration.

    Science.gov (United States)

    Joshi, Anand A; Pantazis, Dimitrios; Li, Quanzheng; Damasio, Hanna; Shattuck, David W; Toga, Arthur W; Leahy, Richard M

    2010-04-15

    Flat mapping based cortical surface registration constrained by manually traced sulcal curves has been widely used for inter subject comparisons of neuroanatomical data. Even for an experienced neuroanatomist, manual sulcal tracing can be quite time consuming, with the cost increasing with the number of sulcal curves used for registration. We present a method for estimation of an optimal subset of size N(C) from N possible candidate sulcal curves that minimizes a mean squared error metric over all combinations of N(C) curves. The resulting procedure allows us to estimate a subset with a reduced number of curves to be traced as part of the registration procedure leading to optimal use of manual labeling effort for registration. To minimize the error metric we analyze the correlation structure of the errors in the sulcal curves by modeling them as a multivariate Gaussian distribution. For a given subset of sulci used as constraints in surface registration, the proposed model estimates registration error based on the correlation structure of the sulcal errors. The optimal subset of constraint curves consists of the N(C) sulci that jointly minimize the estimated error variance for the subset of unconstrained curves conditioned on the N(C) constraint curves. The optimal subsets of sulci are presented and the estimated and actual registration errors for these subsets are computed. Copyright 2009 Elsevier Inc. All rights reserved.

  7. Study on the Detection of Moving Target in the Mining Method Based on Hybrid Algorithm for Sports Video Analysis

    Directory of Open Access Journals (Sweden)

    Huang Tian

    2014-10-01

    Full Text Available Moving object detection and tracking is the computer vision and image processing is a hot research direction, based on the analysis of the moving target detection and tracking algorithm in common use, focus on the sports video target tracking non rigid body. In sports video, non rigid athletes often have physical deformation in the process of movement, and may be associated with the occurrence of moving target under cover. Media data is surging to fast search and query causes more difficulties in data. However, the majority of users want to be able to quickly from the multimedia data to extract the interested content and implicit knowledge (concepts, rules, rules, models and correlation, retrieval and query quickly to take advantage of them, but also can provide the decision support problem solving hierarchy. Based on the motion in sport video object as the object of study, conducts the system research from the theoretical level and technical framework and so on, from the layer by layer mining between low level motion features to high-level semantic motion video, not only provides support for users to find information quickly, but also can provide decision support for the user to solve the problem.

  8. 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

  9. Overcoming Registration Uncertainty in Image Super-Resolution: Maximize or Marginalize?

    Directory of Open Access Journals (Sweden)

    Andrew Zisserman

    2007-01-01

    Full Text Available In multiple-image super-resolution, a high-resolution image is estimated from a number of lower-resolution images. This usually involves computing the parameters of a generative imaging model (such as geometric and photometric registration, and blur and obtaining a MAP estimate by minimizing a cost function including an appropriate prior. Two alternative approaches are examined. First, both registrations and the super-resolution image are found simultaneously using a joint MAP optimization. Second, we perform Bayesian integration over the unknown image registration parameters, deriving a cost function whose only variables of interest are the pixel values of the super-resolution image. We also introduce a scheme to learn the parameters of the image prior as part of the super-resolution algorithm. We show examples on a number of real sequences including multiple stills, digital video, and DVDs of movies.

  10. 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

  11. Automated registration of diagnostic to prediagnostic x-ray mammograms: Evaluation and comparison to radiologists' accuracy

    Energy Technology Data Exchange (ETDEWEB)

    Pinto Pereira, Snehal M.; Hipwell, John H.; McCormack, Valerie A.; Tanner, Christine; Moss, Sue M.; Wilkinson, Louise S.; Khoo, Lisanne A. L.; Pagliari, Catriona; Skippage, Pippa L.; Kliger, Carole J.; Hawkes, David J.; Santos Silva, Isabel M. dos [Cancer Research UK Epidemiology and Genetics Group, London School of Hygiene and Tropical Medicine, Keppel Street, London WC1E 7HT (United Kingdom); Centre for Medical Image Computing, University College London, London WC1E 6BT (United Kingdom); Lifestyle and Cancer Group, International Agency for Research on Cancer, 150 cours Albert Thomas, Lyon 69008 (France); Centre for Medical Image Computing, University College London, London WC1E 6BT (United Kingdom); Cancer Screening Evaluation Unit, Institute of Cancer Research, Surrey SM2 5NG (United Kingdom); St. George' s Healthcare NHS Trust and South West London Breast Screening Service, London SW17 0QT (United Kingdom); Centre for Medical Image Computing, University College London, London WC1E 6BT (United Kingdom); Cancer Research UK Epidemiology and Genetics Group, London School of Hygiene and Tropical Medicine, Keppel Street, London WC1E 7HT (United Kingdom)

    2010-09-15

    Purpose: To compare and evaluate intensity-based registration methods for computation of serial x-ray mammogram correspondence. Methods: X-ray mammograms were simulated from MRIs of 20 women using finite element methods for modeling breast compressions and employing a MRI/x-ray appearance change model. The parameter configurations of three registration methods, affine, fluid, and free-form deformation (FFD), were optimized for registering x-ray mammograms on these simulated images. Five mammography film readers independently identified landmarks (tumor, nipple, and usually two other normal features) on pairs of diagnostic and corresponding prediagnostic digitized images from 52 breast cancer cases. Landmarks were independently reidentified by each reader. Target registration errors were calculated to compare the three registration methods using the reader landmarks as a gold standard. Data were analyzed using multilevel methods. Results: Between-reader variability varied with landmark (p<0.01) and screen (p=0.03), with between-reader mean distance (mm) in point location on the diagnostic/prediagnostic images of 2.50 (95% CI 1.95, 3.15)/2.84 (2.24, 3.55) for nipples and 4.26 (3.43, 5.24)/4.76 (3.85, 5.84) for tumors. Registration accuracy was sensitive to the type of landmark and the amount of breast density. For dense breasts ({>=}40%), the affine and fluid methods outperformed FFD. For breasts with lower density, the affine registration surpassed both fluid and FFD. Mean accuracy (mm) of the affine registration varied between 3.16 (95% CI 2.56, 3.90) for nipple points in breasts with density 20%-39% and 5.73 (4.80, 6.84) for tumor points in breasts with density <20%. Conclusions: Affine registration accuracy was comparable to that between independent film readers. More advanced two-dimensional nonrigid registration algorithms were incapable of increasing the accuracy of image alignment when compared to affine registration.

  12. Registration of central paths and colonic polyps between supine and prone scans in computed tomography colonography: Pilot study

    International Nuclear Information System (INIS)

    Li Ping; Napel, Sandy; Acar, Burak; Paik, David S.; Jeffrey, R. Brooke Jr.; Beaulieu, Christopher F.

    2004-01-01

    Computed tomography colonography (CTC) is a minimally invasive method that allows the evaluation of the colon wall from CT sections of the abdomen/pelvis. The primary goal of CTC is to detect colonic polyps, precursors to colorectal cancer. Because imperfect cleansing and distension can cause portions of the colon wall to be collapsed, covered with water, and/or covered with retained stool, patients are scanned in both prone and supine positions. We believe that both reading efficiency and computer aided detection (CAD) of CTC images can be improved by accurate registration of data from the supine and prone positions. We developed a two-stage approach that first registers the colonic central paths using a heuristic and automated algorithm and then matches polyps or polyp candidates (CAD hits) by a statistical approach. We evaluated the registration algorithm on 24 patient cases. After path registration, the mean misalignment distance between prone and supine identical anatomic landmarks was reduced from 47.08 to 12.66 mm, a 73% improvement. The polyp registration algorithm was specifically evaluated using eight patient cases for which radiologists identified polyps separately for both supine and prone data sets, and then manually registered corresponding pairs. The algorithm correctly matched 78% of these pairs without user input. The algorithm was also applied to the 30 highest-scoring CAD hits in the prone and supine scans and showed a success rate of 50% in automatically registering corresponding polyp pairs. Finally, we computed the average number of CAD hits that need to be manually compared in order to find the correct matches among the top 30 CAD hits. With polyp registration, the average number of comparisons was 1.78 per polyp, as opposed to 4.28 comparisons without polyp registration

  13. 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

  14. Development and Analysis of Image Registration Program for the Communication, Ocean, Meteorological Satellite (COMS

    Directory of Open Access Journals (Sweden)

    Un-Seob Lee

    2007-09-01

    Full Text Available We developed a software for simulations and analyses of the Image Navigation and Registration (INR system, and compares the characteristics of Image Motion Compensation (IMC algorithms for the INR system. According to the orbit errors and attitude errors, the capabilities of the image distortions are analyzed. The distortions of images can be compensated by GOES IMC algorithm and Modified IMC (MIMC algorithm. The capabilities of each IMC algorithm are confirmed based on compensated images. The MIMC yields better results than GOES IMC although both the algorithms well compensate distorted images. The results of this research can be used as valuable asset to design of INR system for the Communication, Ocean, Meteorological Satellite (COMS.

  15. 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.)

  16. Quantitative evaluation of an image registration method for a NIPAM gel dosimeter

    International Nuclear Information System (INIS)

    Chang, Yuan-Jen; Yao, Chun-Hsu; Wu, Jay; Hsieh, Bor-Tsung; Tsang, Yuk-Wah; Chen, Chin-Hsing

    2015-01-01

    One of the problems in obtaining quality results is image registration when a gel dosimeter is used in conjunction with optical computed tomography (CT). This study proposes a passive alignment mechanism to obtain a precisely measured dose map. A holder plate with two pin–hole pairs is placed on the gel container cap. These two pin–hole pairs attach the gel container to the vertical shaft and can be precisely aligned with the rotation center of the vertical shaft at any time. Accordingly, a better reconstructed image quality is obtained. After obtaining a precisely measured dose map, the scale invariant feature transform (SIFT)-flow algorithm is utilized as an image registration method to align the treatment plan software (TPS) image with the measured dose map image. The results show that the gamma pass rate for the single-field irradiation increases from 83.39% to 94.03% when the algorithm is applied. And the gamma pass rate for the five-field irradiation treatment plan increases from 87.36% to 94.34%. The translation, scaling, and rotation occurring in the dose map image constructed using an optical CT scanner are also aligned with those in the TPS image using the SIFT-flow algorithm. Accordingly, improved gamma comparison results and a higher gamma pass rate are obtained. - Highlights: • A passive alignment method for obtaining a precisely measured dose map is developed. • The SIFT-flow algorithm is adopted as an image registration method for the gel dosimeter. • The SIFT-flow algorithm increases the gamma pass rate from 83.39% to 94.03% for the single-field irradiation. • The SIFT-flow algorithm increases the gamma pass rate from 87.36% to 94.34% for the five-field irradiation. • The translation, scaling, and rotation in the measured dose map image are aligned with those in the TPS image using the SIFT-flow algorithm

  17. Quantitative evaluation of an image registration method for a NIPAM gel dosimeter

    Energy Technology Data Exchange (ETDEWEB)

    Chang, Yuan-Jen [Department of Management Information Systems, Central Taiwan University of Science and Technology, No. 666, Buzih Rd., Beitun District, Taichung City, Taiwan (R.O.C.) (China); Institute of Biomedical Engineering and Materials Science, Central Taiwan University of Science and Technology, No. 666, Buzih Rd., Beitun District, Taichung City, Taiwan (R.O.C.) (China); Yao, Chun-Hsu [School of Chinese Medicine, China Medical University, Taichung, Taiwan (R.O.C.) (China); Department of Biomedical Imaging and Radiological Science, China Medical University, Taichung, Taiwan (R.O.C.) (China); Department of Biomedical Informatics, Asia University, Taichung, Taiwan (R.O.C.) (China); Wu, Jay [Department of Biomedical Imaging and Radiological Sciences, National Yang-Ming University, Taipei, Taiwan (R.O.C.) (China); Hsieh, Bor-Tsung [Department of Biomedical Imaging and Radiological Sciences, Central Taiwan University of Science and Technology, Taichung, Taiwan (R.O.C.) (China); Tsang, Yuk-Wah [Department of Radiation Oncology, Ditmanson Medical Foundation Chiayi Christian Hospital, Chiayi, Taiwan (R.O.C.) (China); Chen, Chin-Hsing [Department of Management Information Systems, Central Taiwan University of Science and Technology, No. 666, Buzih Rd., Beitun District, Taichung City, Taiwan (R.O.C.) (China)

    2015-06-01

    One of the problems in obtaining quality results is image registration when a gel dosimeter is used in conjunction with optical computed tomography (CT). This study proposes a passive alignment mechanism to obtain a precisely measured dose map. A holder plate with two pin–hole pairs is placed on the gel container cap. These two pin–hole pairs attach the gel container to the vertical shaft and can be precisely aligned with the rotation center of the vertical shaft at any time. Accordingly, a better reconstructed image quality is obtained. After obtaining a precisely measured dose map, the scale invariant feature transform (SIFT)-flow algorithm is utilized as an image registration method to align the treatment plan software (TPS) image with the measured dose map image. The results show that the gamma pass rate for the single-field irradiation increases from 83.39% to 94.03% when the algorithm is applied. And the gamma pass rate for the five-field irradiation treatment plan increases from 87.36% to 94.34%. The translation, scaling, and rotation occurring in the dose map image constructed using an optical CT scanner are also aligned with those in the TPS image using the SIFT-flow algorithm. Accordingly, improved gamma comparison results and a higher gamma pass rate are obtained. - Highlights: • A passive alignment method for obtaining a precisely measured dose map is developed. • The SIFT-flow algorithm is adopted as an image registration method for the gel dosimeter. • The SIFT-flow algorithm increases the gamma pass rate from 83.39% to 94.03% for the single-field irradiation. • The SIFT-flow algorithm increases the gamma pass rate from 87.36% to 94.34% for the five-field irradiation. • The translation, scaling, and rotation in the measured dose map image are aligned with those in the TPS image using the SIFT-flow algorithm.

  18. 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.

  19. Deformable image registration using convolutional neural networks

    Science.gov (United States)

    Eppenhof, Koen A. J.; Lafarge, Maxime W.; Moeskops, Pim; Veta, Mitko; Pluim, Josien P. W.

    2018-03-01

    Deformable image registration can be time-consuming and often needs extensive parameterization to perform well on a specific application. We present a step towards a registration framework based on a three-dimensional convolutional neural network. The network directly learns transformations between pairs of three-dimensional images. The outputs of the network are three maps for the x, y, and z components of a thin plate spline transformation grid. The network is trained on synthetic random transformations, which are applied to a small set of representative images for the desired application. Training therefore does not require manually annotated ground truth deformation information. The methodology is demonstrated on public data sets of inspiration-expiration lung CT image pairs, which come with annotated corresponding landmarks for evaluation of the registration accuracy. Advantages of this methodology are its fast registration times and its minimal parameterization.

  20. Playing with labour: the labour registration game

    NARCIS (Netherlands)

    Leesberg, J.; Valencia, E.

    1992-01-01

    Description of a method to register labour allocation patterns of small-scale producer families through a self-registration 'game'. Division of tasks between men and women become visible through this method

  1. 27 CFR 53.140 - Registration.

    Science.gov (United States)

    2010-04-01

    ... of selling or purchasing articles tax free as provided in this section. In the case of a nonprofit....141. (e) Cross references. (1) For exceptions to the requirement for registration, see section 4222(b...

  2. Biometric Authorization and Registration Systems and Methods

    National Research Council Canada - National Science Library

    Caulfield, H

    2002-01-01

    Biometric authorization and registration systems and methods are disclosed. In one embodiment, the system preferably comprises a firearm that includes a biometric authorization system, a plurality of training computers, and a server...

  3. Registration of DRRs and portal images for verification of stereotactic body radiotherapy: a feasibility study in lung cancer treatment

    Energy Technology Data Exchange (ETDEWEB)

    Kuenzler, Thomas [Department of Radiotherapy and Radiobiology, Medical University Vienna, Vienna (Austria); Grezdo, Jozef [Department of Radiotherapy, St Elisabeth Institute of Oncology, Bratislava (Slovakia); Bogner, Joachim [Department of Radiotherapy and Radiobiology, Medical University Vienna, Vienna (Austria); Birkfellner, Wolfgang [Center for Biomedical Engineering and Physics, Medical University Vienna, Vienna (Austria); Georg, Dietmar [Department of Radiotherapy and Radiobiology, Medical University Vienna, Vienna (Austria)

    2007-04-21

    Image guidance has become a pre-requisite for hypofractionated radiotherapy where the applied dose per fraction is increased. Particularly in stereotactic body radiotherapy (SBRT) for lung tumours, one has to account for set-up errors and intrafraction tumour motion. In our feasibility study, we compared digitally reconstructed radiographs (DRRs) of lung lesions with MV portal images (PIs) to obtain the displacement of the tumour before irradiation. The verification of the tumour position was performed by rigid intensity based registration and three different merit functions such as the sum of squared pixel intensity differences, normalized cross correlation and normalized mutual information. The registration process then provided a translation vector that defines the displacement of the target in order to align the tumour with the isocentre. To evaluate the registration algorithms, 163 test images were created and subsequently, a lung phantom containing an 8 cm{sup 3} tumour was built. In a further step, the registration process was applied on patient data, containing 38 tumours in 113 fractions. To potentially improve registration outcome, two filter types (histogram equalization and display equalization) were applied and their impact on the registration process was evaluated. Generated test images showed an increase in successful registrations when applying a histogram equalization filter whereas the lung phantom study proved the accuracy of the selected algorithms, i.e. deviations of the calculated translation vector for all test algorithms were below 1 mm. For clinical patient data, successful registrations occurred in about 59% of anterior-posterior (AP) and 46% of lateral projections, respectively. When patients with a clinical target volume smaller than 10 cm{sup 3} were excluded, successful registrations go up to 90% in AP and 50% in lateral projection. In addition, a reliable identification of the tumour position was found to be difficult for clinical

  4. Registration of DRRs and portal images for verification of stereotactic body radiotherapy: a feasibility study in lung cancer treatment

    International Nuclear Information System (INIS)

    Kuenzler, Thomas; Grezdo, Jozef; Bogner, Joachim; Birkfellner, Wolfgang; Georg, Dietmar

    2007-01-01

    Image guidance has become a pre-requisite for hypofractionated radiotherapy where the applied dose per fraction is increased. Particularly in stereotactic body radiotherapy (SBRT) for lung tumours, one has to account for set-up errors and intrafraction tumour motion. In our feasibility study, we compared digitally reconstructed radiographs (DRRs) of lung lesions with MV portal images (PIs) to obtain the displacement of the tumour before irradiation. The verification of the tumour position was performed by rigid intensity based registration and three different merit functions such as the sum of squared pixel intensity differences, normalized cross correlation and normalized mutual information. The registration process then provided a translation vector that defines the displacement of the target in order to align the tumour with the isocentre. To evaluate the registration algorithms, 163 test images were created and subsequently, a lung phantom containing an 8 cm 3 tumour was built. In a further step, the registration process was applied on patient data, containing 38 tumours in 113 fractions. To potentially improve registration outcome, two filter types (histogram equalization and display equalization) were applied and their impact on the registration process was evaluated. Generated test images showed an increase in successful registrations when applying a histogram equalization filter whereas the lung phantom study proved the accuracy of the selected algorithms, i.e. deviations of the calculated translation vector for all test algorithms were below 1 mm. For clinical patient data, successful registrations occurred in about 59% of anterior-posterior (AP) and 46% of lateral projections, respectively. When patients with a clinical target volume smaller than 10 cm 3 were excluded, successful registrations go up to 90% in AP and 50% in lateral projection. In addition, a reliable identification of the tumour position was found to be difficult for clinical target

  5. Algorithmic alternatives

    International Nuclear Information System (INIS)

    Creutz, M.

    1987-11-01

    A large variety of Monte Carlo algorithms are being used for lattice gauge simulations. For purely bosonic theories, present approaches are generally adequate; nevertheless, overrelaxation techniques promise savings by a factor of about three in computer time. For fermionic fields the situation is more difficult and less clear. Algorithms which involve an extrapolation to a vanishing step size are all quite closely related. Methods which do not require such an approximation tend to require computer time which grows as the square of the volume of the system. Recent developments combining global accept/reject stages with Langevin or microcanonical updatings promise to reduce this growth to V/sup 4/3/

  6. Combinatorial algorithms

    CERN Document Server

    Hu, T C

    2002-01-01

    Newly enlarged, updated second edition of a valuable text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discusses binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. 153 black-and-white illus. 23 tables.Newly enlarged, updated second edition of a valuable, widely used text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discussed are binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. New to this edition: Chapter 9

  7. 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.

  8. 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

  9. 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

  10. Detection of patient setup errors with a portal image - DRR registration software application.

    Science.gov (United States)

    Sutherland, Kenneth; Ishikawa, Masayori; Bengua, Gerard; Ito, Yoichi M; Miyamoto, Yoshiko; Shirato, Hiroki

    2011-02-18

    The purpose of this study was to evaluate a custom portal image - digitally reconstructed radiograph (DRR) registration software application. The software works by transforming the portal image into the coordinate space of the DRR image using three control points placed on each image by the user, and displaying the fused image. In order to test statistically that the software actually improves setup error estimation, an intra- and interobserver phantom study was performed. Portal images of anthropomorphic thoracic and pelvis phantoms with virtually placed irradiation fields at known setup errors were prepared. A group of five doctors was first asked to estimate the setup errors by examining the portal and DRR image side-by-side, not using the software. A second group of four technicians then estimated the same set of images using the registration software. These two groups of human subjects were then compared with an auto-registration feature of the software, which is based on the mutual information between the portal and DRR images. For the thoracic case, the average distance between the actual setup error and the estimated error was 4.3 ± 3.0 mm for doctors using the side-by-side method, 2.1 ± 2.4 mm for technicians using the registration method, and 0.8 ± 0.4mm for the automatic algorithm. For the pelvis case, the average distance between the actual setup error and estimated error was 2.0 ± 0.5 mm for the doctors using the side-by-side method, 2.5 ± 0.4 mm for technicians using the registration method, and 2.0 ± 1.0 mm for the automatic algorithm. The ability of humans to estimate offset values improved statistically using our software for the chest phantom that we tested. Setup error estimation was further improved using our automatic error estimation algorithm. Estimations were not statistically different for the pelvis case. Consistency improved using the software for both the chest and pelvis phantoms. We also tested the automatic algorithm with a

  11. MRI to X-ray mammography registration using a volume-preserving affine transformation.

    Science.gov (United States)

    Mertzanidou, Thomy; Hipwell, John; Cardoso, M Jorge; Zhang, Xiying; Tanner, Christine; Ourselin, Sebastien; Bick, Ulrich; Huisman, Henkjan; Karssemeijer, Nico; Hawkes, David

    2012-07-01

    X-ray mammography is routinely used in national screening programmes and as a clinical diagnostic tool. Magnetic Resonance Imaging (MRI) is commonly used as a complementary modality, providing functional information about the breast and a 3D image that can overcome ambiguities caused by the superimposition of fibro-glandular structures associated with X-ray imaging. Relating findings between these modalities is a challenging task however, due to the different imaging processes involved and the large deformation that the breast undergoes. In this work we present a registration method to determine spatial correspondence between pairs of MR and X-ray images of the breast, that is targeted for clinical use. We propose a generic registration framework which incorporates a volume-preserving affine transformation model and validate its performance using routinely acquired clinical data. Experiments on simulated mammograms from 8 volunteers produced a mean registration error of 3.8±1.6mm for a mean of 12 manually identified landmarks per volume. When validated using 57 lesions identified on routine clinical CC and MLO mammograms (n=113 registration tasks) from 49 subjects the median registration error was 13.1mm. When applied to the registration of an MR image to CC and MLO mammograms of a patient with a localisation clip, the mean error was 8.9mm. The results indicate that an intensity based registration algorithm, using a relatively simple transformation model, can provide radiologists with a clinically useful tool for breast cancer diagnosis. Copyright © 2012 Elsevier B.V. All rights reserved.

  12. How precise is manual CT-MRI registration for cranial radiotherapy planning?

    International Nuclear Information System (INIS)

    Mosleh-Shirazi, M. A.; South, P. C.

    2005-01-01

    Manual fusion is a readily available image registration technique that does not require matching algorithms. The operator performs rigid-body transformations interactively. The precision of Manual fusion (as implemented on the Philips Pinnacle treatment planning system) was required for cranial CT-MR images used in radiotherapy planning for typical centrally located planning target volumes . Materials and Methods: A multi-stage Manual fusion procedure was developed which 11 observers followed to match the head contour, bones, soft tissues and contoured structures for 5 patient image-sets. Registration parameters were calculated by solving the transformation matrix following a consistent order of translations (T) and rotations (R). The mean position of centre of each planning target volumes averaged over all observers was used as the reference. The effect of mis registration on the planning target volumes co-ordinates and the volume increase resulting from application of a margin for registration uncertainty were calculated. Results: Mean intra- and inter-observer T/R SDs were 0.5 mm/ 0.4 d ig a nd 1.1 mm/ 1.0 d ig , respectively. Mean intra- and inter-observer registration error (3D distance of each planning target volumes centre from the mean position for all observers) was 0.7 ±0.3 mm (1 SD) and 1.6±0.7 mm respectively, the latter reducing to 1.4±0.6 mm excluding the 3 least experienced operators. A subsequent 2 mm margin for mis registration on average increased the planning target volume by 27%. Conclusion: Moderately trained operators produced clinically acceptable results while experienced operators improved the precision. Manual fusion still has an important role in the registration of cranial CT and MR images for radiotherapy planning especially for under-resourced centers

  13. Image navigation and registration for the geostationary lightning mapper (GLM)

    Science.gov (United States)

    van Bezooijen, Roel W. H.; Demroff, Howard; Burton, Gregory; Chu, Donald; Yang, Shu S.

    2016-10-01

    The Geostationary Lightning Mappers (GLM) for the Geostationary Operational Environmental Satellite (GOES) GOES-R series will, for the first time, provide hemispherical lightning information 24 hours a day from longitudes of 75 and 137 degrees west. The first GLM of a series of four is planned for launch in November, 2016. Observation of lightning patterns by GLM holds promise to improve tornado warning lead times to greater than 20 minutes while halving the present false alarm rates. In addition, GLM will improve airline traffic flow management, and provide climatology data allowing us to understand the Earth's evolving climate. The paper describes the method used for translating the pixel position of a lightning event to its corresponding geodetic longitude and latitude, using the J2000 attitude of the GLM mount frame reported by the spacecraft, the position of the spacecraft, and the alignment of the GLM coordinate frame relative to its mount frame. Because the latter alignment will experience seasonal variation, this alignment is determined daily using GLM background images collected over the previous 7 days. The process involves identification of coastlines in the background images and determination of the alignment change necessary to match the detected coastline with the coastline predicted using the GSHHS database. Registration is achieved using a variation of the Lucas-Kanade algorithm where we added a dither and average technique to improve performance significantly. An innovative water mask technique was conceived to enable self-contained detection of clear coastline sections usable for registration. Extensive simulations using accurate visible images from GOES13 and GOES15 have been used to demonstrate the performance of the coastline registration method, the results of which are presented in the paper.

  14. 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

  15. Multimodal registration of three-dimensional maxillodental cone beam CT and photogrammetry data over time.

    Science.gov (United States)

    Bolandzadeh, N; Bischof, W; Flores-Mir, C; Boulanger, P

    2013-01-01

    In recent years, one of the foci of orthodontics has been on systems for the evaluation of treatment results and the tracking of tissue variations over time. This can be accomplished through analysing three-dimensional orthodontic images obtained before and after the treatments. Since complementary information is achieved by integrating multiple imaging modalities, cone beam CT (CBCT) and stereophotogrammetry technologies are used in this study to develop a method for tracking bone, teeth and facial soft-tissue variations over time. We propose a two-phase procedure of multimodal (Phase 1) and multitemporal (Phase 2) registration which aligns images taken from the same patient by different imaging modalities and at different times. Extrinsic (for Phase 1) and intrinsic (for Phase 2) landmark-based registration methods are employed as an initiation for a robust iterative closest points algorithm. Since the mandible moves independently of the upper skull, the registration procedure is applied separately on the mandible and the upper skull. The results show that the signed error distributions of both mandible and skull registrations follow a mixture of two Gaussian distributions, corresponding to alignment errors (due to our method) and temporal change over time. We suggest that the large values among the total registration errors correspond to the temporal change resulting from (1) the effect of treatment (i.e. the orthodontic changes of teeth positions); (2) the biological changes such as teeth growth over time, especially for teenagers; and (3) the segmentation procedure and CBCT precision change over time.

  16. SU-E-J-89: Deformable Registration Method Using B-TPS in Radiotherapy.

    Science.gov (United States)

    Xie, Y

    2012-06-01

    A novel deformable registration method for four-dimensional computed tomography (4DCT) images is developed in radiation therapy. The proposed method combines the thin plate spline (TPS) and B-spline together to achieve high accuracy and high efficiency. The method consists of two steps. First, TPS is used as a global registration method to deform large unfit regions in the moving image to match counterpart in the reference image. Then B-spline is used for local registration, the previous deformed moving image is further deformed to match the reference image more accurately. Two clinical CT image sets, including one pair of lung and one pair of liver, are simulated using the proposed algorithm, which results in a tremendous improvement in both run-time and registration quality, compared with the conventional methods solely using either TPS or B-spline. The proposed method can combine the efficiency of TPS and the accuracy of B-spline, performing good adaptively and robust in registration of clinical 4DCT image. © 2012 American Association of Physicists in Medicine.

  17. 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

  18. Progressive attenuation fields: Fast 2D-3D image registration without precomputation

    International Nuclear Information System (INIS)

    Rohlfing, Torsten; Russakoff, Daniel B.; Denzler, Joachim; Mori, Kensaku; Maurer, Calvin R. Jr.

    2005-01-01

    Computation of digitally reconstructed radiograph (DRR) images is the rate-limiting step in most current intensity-based algorithms for the registration of three-dimensional (3D) images to two-dimensional (2D) projection images. This paper introduces and evaluates the progressive attenuation field (PAF), which is a new method to speed up DRR computation. A PAF is closely related to an attenuation field (AF). A major difference is that a PAF is constructed on the fly as the registration proceeds; it does not require any precomputation time, nor does it make any prior assumptions of the patient pose or limit the permissible range of patient motion. A PAF effectively acts as a cache memory for projection values once they are computed, rather than as a lookup table for precomputed projections like standard AFs. We use a cylindrical attenuation field parametrization, which is better suited for many medical applications of 2D-3D registration than the usual two-plane parametrization. The computed attenuation values are stored in a hash table for time-efficient storage and access. Using clinical gold-standard spine image data sets from five patients, we demonstrate consistent speedups of intensity-based 2D-3D image registration using PAF DRRs by a factor of 10 over conventional ray casting DRRs with no decrease of registration accuracy or robustness

  19. VBM with viscous fluid registration of grey matter segments in SPM.

    Directory of Open Access Journals (Sweden)

    João M. S. Pereira

    2013-07-01

    Full Text Available Improved registration of grey matter segments in SPM has been achieved with the DARTEL algorithm. Previous work from our group suggested, however, that such improvements may not translate to studies of clinical groups. To address the registration issue in atrophic brains, this paper relaxed the condition of diffeomorphism, central to DARTEL, and made use of a viscous fluid registration model with limited regularisation constraints to register the modulated grey matter probability maps to an intra-population template. Quantitative analysis of the registration results after the additional viscous fluid step showed no worsening of co-localisation of fiducials compared to DARTEL or unified segmentation methods, and the resulting voxel based morphometry (VBM analyses were able to better identify atrophic regions and to produce results with fewer apparent false positives. DARTEL showed great sensitivity to atrophy, but the resulting VBM maps presented broad, amorphous regions of significance that are hard to interpret. We propose that the condition of diffeomorphism is not necessary for basic VBM studies in atrophic populations, but also that it has disadvantages that must be taken into consideration before a study. The presented viscous fluid registration method is proposed for VBM studies to enhance sensitivity and localizing power.

  20. Automated registration of diagnostic to prediagnostic x-ray mammograms: Evaluation and comparison to radiologists' accuracy

    International Nuclear Information System (INIS)

    Pinto Pereira, Snehal M.; Hipwell, John H.; McCormack, Valerie A.; Tanner, Christine; Moss, Sue M.; Wilkinson, Louise S.; Khoo, Lisanne A. L.; Pagliari, Catriona; Skippage, Pippa L.; Kliger, Carole J.; Hawkes, David J.; Santos Silva, Isabel M. dos

    2010-01-01

    Purpose: To compare and evaluate intensity-based registration methods for computation of serial x-ray mammogram correspondence. Methods: X-ray mammograms were simulated from MRIs of 20 women using finite element methods for modeling breast compressions and employing a MRI/x-ray appearance change model. The parameter configurations of three registration methods, affine, fluid, and free-form deformation (FFD), were optimized for registering x-ray mammograms on these simulated images. Five mammography film readers independently identified landmarks (tumor, nipple, and usually two other normal features) on pairs of diagnostic and corresponding prediagnostic digitized images from 52 breast cancer cases. Landmarks were independently reidentified by each reader. Target registration errors were calculated to compare the three registration methods using the reader landmarks as a gold standard. Data were analyzed using multilevel methods. Results: Between-reader variability varied with landmark (p<0.01) and screen (p=0.03), with between-reader mean distance (mm) in point location on the diagnostic/prediagnostic images of 2.50 (95% CI 1.95, 3.15)/2.84 (2.24, 3.55) for nipples and 4.26 (3.43, 5.24)/4.76 (3.85, 5.84) for tumors. Registration accuracy was sensitive to the type of landmark and the amount of breast density. For dense breasts (≥40%), the affine and fluid methods outperformed FFD. For breasts with lower density, the affine registration surpassed both fluid and FFD. Mean accuracy (mm) of the affine registration varied between 3.16 (95% CI 2.56, 3.90) for nipple points in breasts with density 20%-39% and 5.73 (4.80, 6.84) for tumor points in breasts with density <20%. Conclusions: Affine registration accuracy was comparable to that between independent film readers. More advanced two-dimensional nonrigid registration algorithms were incapable of increasing the accuracy of image alignment when compared to affine registration.

  1. Deformable 3D–2D registration for CT and its application to low dose tomographic fluoroscopy

    International Nuclear Information System (INIS)

    Flach, Barbara; Brehm, Marcus; Sawall, Stefan; Kachelrieß, Marc

    2014-01-01

    Many applications in medical imaging include image registration for matching of images from the same or different modalities. In the case of full data sampling, the respective reconstructed images are usually of such a good image quality that standard deformable volume-to-volume (3D–3D) registration approaches can be applied. But research in temporal-correlated image reconstruction and dose reductions increases the number of cases where rawdata are available from only few projection angles. Here, deteriorated image quality leads to non-acceptable deformable volume-to-volume registration results. Therefore a registration approach is required that is robust against a decreasing number of projections defining the target position. We propose a deformable volume-to-rawdata (3D–2D) registration method that aims at finding a displacement vector field maximizing the alignment of a CT volume and the acquired rawdata based on the sum of squared differences in rawdata domain. The registration is constrained by a regularization term in accordance with a fluid-based diffusion. Both cost function components, the rawdata fidelity and the regularization term, are optimized in an alternating manner. The matching criterion is optimized by a conjugate gradient descent for nonlinear functions, while the regularization is realized by convolution of the vector fields with Gaussian kernels. We validate the proposed method and compare it to the demons algorithm, a well-known 3D–3D registration method. The comparison is done for a range of 4–60 target projections using datasets from low dose tomographic fluoroscopy as an application example. The results show a high correlation to the ground truth target position without introducing artifacts even in the case of very few projections. In particular the matching in the rawdata domain is improved compared to the 3D–3D registration for the investigated range. The proposed volume-to-rawdata registration increases the robustness

  2. 46 CFR 402.220 - Registration of pilots.

    Science.gov (United States)

    2010-10-01

    ... 46 Shipping 8 2010-10-01 2010-10-01 false Registration of pilots. 402.220 Section 402.220 Shipping... ORDERS Registration of Pilots § 402.220 Registration of pilots. (a) Each applicant pilot must complete the number of round trips specified in this section prior to registration as a U.S. registered pilot...

  3. Autodriver algorithm

    Directory of Open Access Journals (Sweden)

    Anna Bourmistrova

    2011-02-01

    Full Text Available The autodriver algorithm is an intelligent method to eliminate the need of steering by a driver on a well-defined road. The proposed method performs best on a four-wheel steering (4WS vehicle, though it is also applicable to two-wheel-steering (TWS vehicles. The algorithm is based on coinciding the actual vehicle center of rotation and road center of curvature, by adjusting the kinematic center of rotation. The road center of curvature is assumed prior information for a given road, while the dynamic center of rotation is the output of dynamic equations of motion of the vehicle using steering angle and velocity measurements as inputs. We use kinematic condition of steering to set the steering angles in such a way that the kinematic center of rotation of the vehicle sits at a desired point. At low speeds the ideal and actual paths of the vehicle are very close. With increase of forward speed the road and tire characteristics, along with the motion dynamics of the vehicle cause the vehicle to turn about time-varying points. By adjusting the steering angles, our algorithm controls the dynamic turning center of the vehicle so that it coincides with the road curvature center, hence keeping the vehicle on a given road autonomously. The position and orientation errors are used as feedback signals in a closed loop control to adjust the steering angles. The application of the presented autodriver algorithm demonstrates reliable performance under different driving conditions.

  4. WE-H-202-00: Session in Memory of Jean Pouliot: Next-Generation Deformable Image Registration

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    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.

  5. WE-H-202-00: Session in Memory of Jean Pouliot: Next-Generation Deformable Image Registration

    International Nuclear Information System (INIS)

    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.

  6. 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.

  7. Registration of synthetic tomographic projection data sets using cross-correlation

    International Nuclear Information System (INIS)

    Fitchard, E.E.; Aldridge, J.S.; Reckwerdt, P.J.; Mackie, T.R.

    1998-01-01

    Tomographic registration, a method that makes possible accurate patient registration directly from projection data, consists of three processing steps: (i) manual coarse positioning, (ii) tomographic projection set acquisition, and (iii) computer mediated refined positioning. In the coarse positioning stage, the degree of patient alignment is comparable with that achieved with the standard radiotherapy set-up. However, the accuracy requirements are somewhat more relaxed in that meticulous alignment of the patient using external laser indicators is not necessary. Instead, tomographic projection sets are compared with planning CTs in order to achieve improved patient set-up. The projection sets are cross-correlated to obtain the best-fit translation and rotation offsets. The algorithm has been tested on synthetic data with the incorporation of varying amounts of Gaussian pseudo-random noise. These tests demonstrate the algorithm's stability and also confirm that alignment can be achieved with an accuracy of less than one projection pixel. (author)

  8. 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)

  9. 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.

  10. 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

  11. 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

  12. Balancing dose and image registration accuracy for cone beam tomosynthesis (CBTS) for breast patient setup

    International Nuclear Information System (INIS)

    Winey, B. A.; Zygmanski, P.; Cormack, R. A.; Lyatskaya, Y.

    2010-01-01

    Purpose: To balance dose reduction and image registration accuracy in breast setup imaging. In particular, the authors demonstrate the relationship between scan angle and dose delivery for cone beam tomosynthesis (CBTS) when employed for setup verification of breast cancer patients with surgical clips. Methods: The dose measurements were performed in a female torso phantom for varying scan angles of CBTS. Setup accuracy was measured using three registration methods: Clip centroid localization accuracy and the accuracy of two semiautomatic registration algorithms. The dose to the organs outside of the ipsilateral breast and registration accuracy information were compared to determine the optimal scan angle for CBTS for breast patient setup verification. Isocenter positions at the center of the patient and at the breast-chest wall interface were considered. Results: Image registration accuracy was within 1 mm for the CBTS scan angles θ above 20 deg. for some scenarios and as large as 80 deg. for the worst case, depending on the imaged breast and registration algorithm. Registration accuracy was highest based on clip centroid localization. For left and right breast imaging with the isocenter at the chest wall, the dose to the contralateral side of the patient was very low (<0.5 cGy) for all scan angles considered. For central isocenter location, the optimal scan angles were 30 deg. - 50 deg. for the left breast imaging and 40 deg. - 50 deg. for the right breast imaging, with the difference due to the geometric asymmetry of the current clinical imaging system. Conclusions: The optimal scan angles for CBTS imaging were found to be between 10 deg. and 50 deg., depending on the isocenter location and ipsilateral breast. Use of the isocenter at the breast-chest wall locations always resulted in greater accuracy of image registration (<1 mm) at smaller angles (10 deg. - 20 deg.) and at lower doses (<0.1 cGy) to the contralateral organs. For chest wall isocenters, doses

  13. Algorithmic Self

    DEFF Research Database (Denmark)

    Markham, Annette

    This paper takes an actor network theory approach to explore some of the ways that algorithms co-construct identity and relational meaning in contemporary use of social media. Based on intensive interviews with participants as well as activity logging and data tracking, the author presents a richly...... layered set of accounts to help build our understanding of how individuals relate to their devices, search systems, and social network sites. This work extends critical analyses of the power of algorithms in implicating the social self by offering narrative accounts from multiple perspectives. It also...... contributes an innovative method for blending actor network theory with symbolic interaction to grapple with the complexity of everyday sensemaking practices within networked global information flows....

  14. Image Registration for PET/CT and CT Images with Particle Swarm Optimization

    International Nuclear Information System (INIS)

    Lee, Hak Jae; Kim, Yong Kwon; Lee, Ki Sung; Choi, Jong Hak; Kim, Chang Kyun; Moon, Guk Hyun; Joo, Sung Kwan; Kim, Kyeong Min; Cheon, Gi Jeong

    2009-01-01

    Image registration is a fundamental task in image processing used to match two or more images. It gives new information to the radiologists by matching images from different modalities. The objective of this study is to develop 2D image registration algorithm for PET/CT and CT images acquired by different systems at different times. We matched two CT images first (one from standalone CT and the other from PET/CT) that contain affluent anatomical information. Then, we geometrically transformed PET image according to the results of transformation parameters calculated by the previous step. We have used Affine transform to match the target and reference images. For the similarity measure, mutual information was explored. Use of particle swarm algorithm optimized the performance by finding the best matched parameter set within a reasonable amount of time. The results show good agreements of the images between PET/CT and CT. We expect the proposed algorithm can be used not only for PET/CT and CT image registration but also for different multi-modality imaging systems such as SPECT/CT, MRI/PET and so on.

  15. 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

  16. 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