Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Iterative methods”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 901 records · Page 50
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

3D reconstruction of magnetization from dichroic soft X-ray transmission tomography

The development of magnetic nanostructures for applications in spintronics requires methods capable of visualizing their magnetization. Soft X-ray magnetic imaging combined with circular magnetic dichroism allows nanostructures up to 100–300 nm in thickness to be probed with resolutions of 20–40 nm. Here a new iterative tomographic reconstruction method to extract the three-dimensional magnetization configuration from tomographic projections is presented. The vector field is reconstructed by using a modified algebraic reconstruction approach based on solving a set of linear equations in an iterative manner. In conclusion, the application of this method is illustrated with two examples (magnetic nano-disc and micro-square heterostructure) along with comparison of error in reconstructions, and convergence of the algorithm.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Phase-Only Beam Broadening of Contiguous Uniform Subarrayed Arrays

In modern antenna systems, beam broadening of subarrayed arrays provides continuous coverage of a wide angular extent in a cost-effective manner. While many methods have been published that address beam broadening of traditional (non-subarrayed) arrays, there is a knowledge gap in the published literature with respect to efficient beam broadening of contiguous uniform subarrayed arrays. This article presents efficient methods for beam broadening of contiguous uniform subarrayed arrays where the excitation of each element is not individually controlled, but the elements of the array are grouped together as subarrays to have the same element excitations. Particularly, this article focuses on phase-only optimization to preserve maximum power output. Additionally, three modilied iterative Fourier transform (IFT) methods and one genetic algorithm (GA) are presented to efliciently search the vast solution space of possible phase settings for a solution that satislies the desired broadened pattern. These methods are evaluated on idealized 1 x 40 and 1 x 80 linear arrays with live element subarrays and 40 x 40 and 80 x 80 element rectangular arrays with 5 x 5 element subarrays. The proposed modilied IFT methods are found to be faster than the GA approach, while the GA approach only offers a few percentage points of better effectiveness.

42 ENGINEERING↗
DOE OSTI2025

Simultaneous Celestial Navigation

GPS technology is used in a multitude of applications around the world for navigation. However, GPS can be contested or denied and thus alternatives to GPS are needed for positioning in high-consequence systems. This project investigates a non-RF based method to produce an estimated geolocation using stellar/celestial measurements in combination with measurements from inclinometers and a real time clock. The initial iteration of this method, developed in FY20/21, achieved an estimated location accuracy within approximately 3 kilometers of the true location with a 3-sigma bound of about 8 kilometers. The next iteration aims to enhance this technology further, targeting an estimation accuracy within 100 meters of the true location, representing a 30-fold improvement over the initial method.

42 ENGINEERING↗
DOE OSTI2018

Specializations in the SCEPTRE code for charged-particle transport - 25454

Charged particles present some unique challenges for radiation transport codes. This is because charged particles have cross sections that are extremely forward peaked, are huge in the limit of small energy transfer, and are highly scattering, which causes slow convergence of the source iterations. The primary application of SCEPTRE is modeling radiation-driven electrical effects, so substantial effort has been invested in SCEPTRE for the efficient modeling of electron transport. This paper will summarize recent and ongoing activities involving the accurate deterministic-transport modeling of charged particles and methods implemented to improve iterative convergence. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2012

Four-dimensional cone beam CT reconstruction and enhancement using a temporal nonlocal means method

Purpose: Four-dimensional cone beam computed tomography (4D-CBCT) has been developed to provide respiratory phase-resolved volumetric imaging in image guided radiation therapy. Conventionally, it is reconstructed by first sorting the x-ray projections into multiple respiratory phase bins according to a breathing signal extracted either from the projection images or some external surrogates, and then reconstructing a 3D CBCT image in each phase bin independently using FDK algorithm. This method requires adequate number of projections for each phase, which can be achieved using a low gantry rotation or multiple gantry rotations. Inadequate number of projections in each phase bin results in low quality 4D-CBCT images with obvious streaking artifacts. 4D-CBCT images at different breathing phases share a lot of redundant information, because they represent the same anatomy captured at slightly different temporal points. Taking this redundancy along the temporal dimension into account can in principle facilitate the reconstruction in the situation of inadequate number of projection images. In this work, the authors propose two novel 4D-CBCT algorithms: an iterative reconstruction algorithm and an enhancement algorithm, utilizing a temporal nonlocal means (TNLM) method. Methods: The authors define a TNLM energy term for a given set of 4D-CBCT images. Minimization of this term favors those 4D-CBCT images such that any anatomical features at one spatial point at one phase can be found in a nearby spatial point at neighboring phases. 4D-CBCT reconstruction is achieved by minimizing a total energy containing a data fidelity term and the TNLM energy term. As for the image enhancement, 4D-CBCT images generated by the FDK algorithm are enhanced by minimizing the TNLM function while keeping the enhanced images close to the FDK results. A forward-backward splitting algorithm and a Gauss-Jacobi iteration method are employed to solve the problems. The algorithms implementation on GPU is designed to avoid redundant and uncoalesced memory access, in order to ensure a high computational efficiency. Our algorithms have been tested on a digital NURBS-based cardiac-torso phantom and a clinical patient case. Results: The reconstruction algorithm and the enhancement algorithm generate visually similar 4D-CBCT images, both better than the FDK results. Quantitative evaluations indicate that, compared with the FDK results, our reconstruction method improves contrast-to-noise-ratio (CNR) by a factor of 2.56-3.13 and our enhancement method increases the CNR by 2.75-3.33 times. The enhancement method also removes over 80% of the streak artifacts from the FDK results. The total computation time is 509-683 s for the reconstruction algorithm and 524-540 s for the enhancement algorithm on an NVIDIA Tesla C1060 GPU card. Conclusions: By innovatively taking the temporal redundancy among 4D-CBCT images into consideration, the proposed algorithms can produce high quality 4D-CBCT images with much less streak artifacts than the FDK results, in the situation of inadequate number of projections.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2014

Evaluation of advanced automatic PET segmentation methods using nonspherical thin-wall inserts

Purpose: The use of positron emission tomography (PET) within radiotherapy treatment planning requires the availability of reliable and accurate segmentation tools. PET automatic segmentation (PET-AS) methods have been recommended for the delineation of tumors, but there is still a lack of thorough validation and cross-comparison of such methods using clinically relevant data. In particular, studies validating PET segmentation tools mainly use phantoms with thick plastic walls inserts of simple spherical geometry and have not specifically investigated the effect of the target object geometry on the delineation accuracy. Our work therefore aimed at generating clinically realistic data using nonspherical thin-wall plastic inserts, for the evaluation and comparison of a set of eight promising PET-AS approaches. Methods: Sixteen nonspherical inserts were manufactured with a plastic wall of 0.18 mm and scanned within a custom plastic phantom. These included ellipsoids and toroids derived with different volumes, as well as tubes, pear- and drop-shaped inserts with different aspect ratios. A set of six spheres of volumes ranging from 0.5 to 102 ml was used for a baseline study. A selection of eight PET-AS methods, written in house, was applied to the images obtained. The methods represented promising segmentation approaches such as adaptive iterative thresholding, region-growing, clustering and gradient-based schemes. The delineation accuracy was measured in terms of overlap with the computed tomography reference contour, using the dice similarity coefficient (DSC), and error in dimensions. Results: The delineation accuracy was lower for nonspherical inserts than for spheres of the same volume in 88% cases. Slice-by-slice gradient-based methods, showed particularly lower DSC for tori (DSC < 0.5), caused by a failure to recover the object geometry. The region-growing method reached high levels of accuracy for most inserts (DSC > 0.76 except for tori) but showed the largest errors in the recovery of pears and drops dimensions (higher than 10% and 30% of the true length, respectively). Large errors were visible for one of the gradient-based contouring methods when delineating drop-shaped inserts. Low DSC due to systematic underestimation of the volumes was observed for our fuzzy clustering method when using nonspherical inserts. The adaptive iterative thresholding method produced the highest DSC score on our nonspherical dataset (DSC > 0.83, except for tori) and showed robustness to the insert geometry. Conclusions: This study investigated the accuracy of eight PET-AS methods for the delineation of objects with a range of nonspherical geometries. The authors’ results confirmed the robustness of some segmentation approaches, but also showed the weaknesses of some of the other methods implemented, which were not observed with spherical inserts. This work therefore highlights the importance of using a variety of thin-wall inserts with complex geometries for the validation of PET-AS methods and provided useful information for further development of the methods tested.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2016

TH-AB-202-08: A Robust Real-Time Surface Reconstruction Method On Point Clouds Captured From a 3D Surface Photogrammetry System

Purpose: Surface photogrammetry (e.g. VisionRT, C-Rad) provides a noninvasive way to obtain high-frequency measurement for patient motion monitoring in radiotherapy. This work aims to develop a real-time surface reconstruction method on the acquired point clouds, whose acquisitions are subject to noise and missing measurements. In contrast to existing surface reconstruction methods that are usually computationally expensive, the proposed method reconstructs continuous surfaces with comparable accuracy in real-time. Methods: The key idea in our method is to solve and propagate a sparse linear relationship from the point cloud (measurement) manifold to the surface (reconstruction) manifold, taking advantage of the similarity in local geometric topology in both manifolds. With consistent point cloud acquisition, we propose a sparse regression (SR) model to directly approximate the target point cloud as a sparse linear combination from the training set, building the point correspondences by the iterative closest point (ICP) method. To accommodate changing noise levels and/or presence of inconsistent occlusions, we further propose a modified sparse regression (MSR) model to account for the large and sparse error built by ICP, with a Laplacian prior. We evaluated our method on both clinical acquired point clouds under consistent conditions and simulated point clouds with inconsistent occlusions. The reconstruction accuracy was evaluated w.r.t. root-mean-squared-error, by comparing the reconstructed surfaces against those from the variational reconstruction method. Results: On clinical point clouds, both the SR and MSR models achieved sub-millimeter accuracy, with mean reconstruction time reduced from 82.23 seconds to 0.52 seconds and 0.94 seconds, respectively. On simulated point cloud with inconsistent occlusions, the MSR model has demonstrated its advantage in achieving consistent performance despite the introduced occlusions. Conclusion: We have developed a real-time and robust surface reconstruction method on point clouds acquired by photogrammetry systems. It serves an important enabling step for real-time motion tracking in radiotherapy. This work is supported in part by NIH grant R01 CA169102-02.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2024

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Adapting CLUTCH methodology to multigroup TSUNAMI-3D for eigenvalue sensitivity calculations

The sensitivity of the eigenvalue to uncertainties in nuclear data and its evaluation are important for nuclear criticality safety. TSUNAMI-3D sequences within the SCALE code system offer several options to the user community for calculating eigenvalue sensitivity coefficients with multigroup (MG) and continuous energy (CE) 3D transport capabilities. TSUNAMI-3D sequences implement the adjoint-based perturbation theory with MG KENO code, the Contributon Linked eigenvalue sensitivity/Uncertainty estimation via Track length importance CHaracterization (CLUTCH) method with CE KENO code, and the Iterated Fission Probability (IFP) method with CE KENO and Shift codes. Each method has benefits and limitations depending on the problem that is run. The work presented here aims to adapt the CLUTCH method, which enables the Contributon method's mesh-free, memory-efficient approach for calculating adjoint-weighted tallies for sensitivity calculations, to the MG TSUNAMI-3D sequence. This application would eliminate the explicit adjoint KENO calculation, as well as the memory-consuming mesh flux moment tallies required by the conventional MG TSUNAMI-3D. Smaller memory footprints in the CLUTCH methodology and relatively shorter runtimes in MG KENO transport can make MG TSUNAMI-3D a viable method for some complex problems. Moreover, this adaptation allows MG sensitivity calculations with Shift, ORNL's next-generation high-performance Monte Carlo transport code, which currently does not offer any sensitivity capabilities with MG particle transport simulations. Initial implementation of the new MG TSUNAMI-3D sequence and its preliminary results with a selected critical benchmark experiment in the Verified, Archived Library of Inputs and Data (VALID) are presented in this study.

KENO↗
DOE OSTI2015

A Full-Core Resonance Self-Shielding Method Using a Continuous-Energy Quasi–One-Dimensional Slowing-Down Solution that Accounts for Temperature-Dependent Fuel Subregions and Resonance Interference

In this paper, a correction-based resonance self-shielding method is developed that allows annular subdivision of the fuel rod. The method performs the conventional iteration of the embedded self-shielding method (ESSM) without subdivision of the fuel to capture the interpin shielding effect. The resultant self-shielded cross sections are modified by correction factors incorporating the intrapin effects of radial variation of the shielded cross section, radial temperature distribution, and resonance interference. A quasi–one-dimensional slowing-down equation is developed to calculate such correction factors. The method is implemented in the DeCART code and compared with the conventional ESSM and subgroup method with benchmark MCNP results. The new method yields substantially improved results for both spatially dependent reaction rates and eigenvalues for typical pressurized water reactor pin cell cases with uniform and nonuniform fuel temperature profiles. Finally, the new method is also proved effective in treating assembly heterogeneity and complex material composition such as mixed oxide fuel, where resonance interference is much more intense.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2021

Brought to Light. I. Quantification of Disk Substructure in Dwarf Early-type Galaxies

Dwarf early-type galaxies (ETGs) display a rich diversity in their photometric, structural, and dynamical properties. In this work, we address their structural complexity by studying with deep imaging a sample of nine dwarf ETGs from the Virgo galaxy cluster, characterized by having faint disk features such as bars and spiral arms, that lie mostly hidden within the bright diffuse light of the galaxies. We present a new, robust method that aims to identify and extract the disk substructure embedded in these dwarf ETGs. The method consists in an iterative procedure that gradually separates a galaxy image into two components: the bright, dominant, diffuse component, and the much fainter, underlying disk component. By applying it to the dwarf ETG sample, we quantify their disk substructure and find that its relative contribution to the total galaxy light ranges between 2.2% and 6.4% within two effective radii. We test the reliability of the method, and prove that it is accurate in recovering the disk substructure we introduce in mock galaxy images, even at low disk-to-total light fractions of a few percent. As a potential application of the method, we perform a Fourier analysis on the extracted disk substructures and measure the orientation, length, and strength of the bars, as well as the pitch angle and strength of the spiral arms. We also briefly discuss a scenario based on the numerical simulations presented in our companion paper, Brought to Light II: Smith et al., in which we investigate the origins of the substructure in such dwarf systems.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2018

Active Power Control for Wind Farms Using Distributed Model Predictive Control and Nearest Neighbor Communication: Preprint

Wind plant control strategies, including axial induction and wake steering control, aim to improve the performance of wind farms, including increasing energy production and decreasing turbine loads. This paper presents a linear model of wake characteristics for use with a distributed model predictive control method for the purpose of optimizing axial induction and yaw misalignment setpoints. In particular, we use an iterative, distributed control method with nearest neighbor communication to coordinate turbine control actions that account for wake interactions between turbines. Simulations of the model and controller are performed on a 2x3 array of turbines using a modified version of the FLOw Redirection and Induction in Steady-state (FLORIS) model to dynamically track the relevant wake parameters. Preliminary results show the controller's ability to follow an arbitrary wind farm power reference signal for the purpose of providing active power control (APC) ancillary services for power grid stability. This efficient distributed control strategy can enable real-time wind farm optimization and control, even for very large scale farms.

17 WIND ENERGY↗
DOE OSTI2019

PtychoNet: Fast and High Quality Phase Retrieval for Ptychography

Ptychography is a coherent diffractive imaging method that captures multiple diffraction patterns of a sample with a set of shifted localized illuminations (“probes”). The reconstruction problem, known as “phase retrieval”, is typically solved by iterative algorithms. In this paper, we propose PtychoNet, a deep learning based method to perform phase retrieval for ptychography in a non-iterative manner. We devise a generative network to encode a full ptychography scan, reverse the diffractions at each scanning point and compute the amplitude and phase of the object. We demonstrate successful reconstructions using PtychoNet as well as recovering fine features in the case of extreme sparse scanning where conventional iterative methods fail to give recognizable features.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

An iterative phase-space explicit discontinuous Galerkin method for stellar radiative transfer in extended atmospheres

In this work, a phase-space discontinuous Galerkin (PSDG) method is presented for the solution of stellar radiative transfer problems. It allows for greater adaptivity than competing methods without sacrificing generality. The method is extensively tested on a spherically symmetric, static, inverse-power-law scattering atmosphere. Results for different sizes of atmospheres and intensities of scattering agreed with asymptotic values. The exponentially decaying behavior of the radiative field in the diffusive-transparent transition region, and the forward peaking behavior at the surface of extended atmospheres were accurately captured. The integrodifferential equation of radiation transfer is solved iteratively by alternating between the radiative pressure equation and the original equation with the integral term treated as an energy density source term. In each iteration, the equations are solved via an explicit, flux-conserving, discontinuous Galerkin method. Finite elements are ordered in wave fronts perpendicular to the characteristic curves so that elemental linear algebraic systems are solved quickly by sweeping the phase space element by element. Two implementations of a diffusive boundary condition at the origin are demonstrated wherein the finite discontinuity in the radiation intensity is accurately captured by the proposed method. This allows for a consistent mechanism to preserve photon luminosity. The method was proved to be robust and fast, and a case is made for the adequacy of parallel processing. In addition to classical two-dimensional plots, results of normalized radiation intensity were mapped onto a log-polar surface exhibiting all distinguishing features of the problem studied.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Introducing a Markov chain-based time calibration procedure for multi-channel particle detectors: application to the SuperFGD and ToF detectors of the T2K experiment

Inter-channel mis-synchronisation can be a limiting factor to the time resolution of high performance timing detectors with multiple readout channels and independent electronics units. In these systems, time calibration methods employed must be able to efficiently correct for minimal mis-synchronisation between channels and achieve the best detector performance. We present an iterative time calibration method based on Markov Chains, suitable for detector systems with multiple readout channels. Starting from correlated hit pairs alone, and without requiring an external reference time measurement, the method solves for fixed per-channel offsets, with precision limited only by the intrinsic single-channel resolution. A mathematical proof that the method is able to find the correct time offsets to be assigned to each detector channel in order to achieve inter-channel synchronisation is given, and it is shown that the number of iterations to reach convergence within the desired precision is controllable with a single parameter. Numerical studies are used to confirm unbiased recovery of true offsets. Finally, the application of the calibration method to the Super Fine-Grained Detector (SuperFGD) and the Time of Flight (TOF) detector at the upgraded T2K near detector (ND280) shows good improvement in overall timing resolution, demonstrating the effectiveness in a real-world scenario and scalability.

calibration and fitting methods↗
DOE OSTI2019

A Multilevel in Space and Energy Solver for 3-D Multigroup Diffusion and Coarse-Mesh Finite Difference Eigenvalue Problems

The Multilevel in Space and Energy Diffusion (MSED) method accelerates the iterative convergence of multigroup diffusion eigenvalue problems by performing work on lower-order equations with only one group and/or coarser spatial grids. It consists of two primary components: (1) a grey (one-group) diffusion eigenvalue problem that is solved via Wielandt-shifted power iteration (PI) and (2) a multigrid-in-space linear solver. In previous work, the efficiency of MSED was verified using Fourier analysis and numerical results from a one-dimensional multigroup diffusion code. Since that work, MSED has been implemented as a solver for the coarse-mesh finite difference (CMFD) system in the three-dimensional Michigan Parallel Characteristics Transport (MPACT) code. In this paper, the results from the implementation of MSED in MPACT are introduced, and the changes needed to make MSED more suitable for MPACT are described. For problems without feedback, the conclusions in this paper show that MSED can reduce the CMFD run time by an order of magnitude and the overall run time by a factor of 2 to 3 compared to the default CMFD solver in MPACT [PI with the generalized minimal residual (GMRES) method]. For problems with feedback, the convergence of the outer Picard iteration scheme is worsened by the well-converged CMFD solutions produced by the standard MSED method. To overcome this unintuitive deficiency, MSED may be run with looser convergence criteria (a modified version of the MSED method called MSED-L) to circumvent the issue until the multiphysics iteration in MPACT is improved. Results show that MSED-L can reduce the CMFD run time in MPACT by an order of magnitude, without negatively impacting the outer Picard iteration scheme.

3-D↗
DOE OSTI2020

Unfolding quantum computer readout noise

Abstract In the current era of noisy intermediate-scale quantum computers, noisy qubits can result in biased results for early quantum algorithm applications. This is a significant challenge for interpreting results from quantum computer simulations for quantum chemistry, nuclear physics, high energy physics (HEP), and other emerging scientific applications. An important class of qubit errors are readout errors. The most basic method to correct readout errors is matrix inversion, using a response matrix built from simple operations to probe the rate of transitions from known initial quantum states to readout outcomes. One challenge with inverting matrices with large off-diagonal components is that the results are sensitive to statistical fluctuations. This challenge is familiar to HEP, where prior-independent regularized matrix inversion techniques (“unfolding”) have been developed for years to correct for acceptance and detector effects, when performing differential cross section measurements. We study one such method, known as iterative Bayesian unfolding, as a potential tool for correcting readout errors from universal gate-based quantum computers. This method is shown to avoid pathologies from commonly used matrix inversion and least squares methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

Evaluation of MRI and cannabinoid type 1 receptor PET templates constructed using DARTEL for spatial normalization of rat brains

Purpose: Image registration is one prerequisite for the analysis of brain regions in magnetic-resonance-imaging (MRI) or positron-emission-tomography (PET) studies. Diffeomorphic anatomical registration through exponentiated Lie algebra (DARTEL) is a nonlinear, diffeomorphic algorithm for image registration and construction of image templates. The goal of this small animal study was (1) the evaluation of a MRI and calculation of several cannabinoid type 1 (CB1) receptor PET templates constructed using DARTEL and (2) the analysis of the image registration accuracy of MR and PET images to their DARTEL templates with reference to analytical and iterative PET reconstruction algorithms. Methods: Five male Sprague Dawley rats were investigated for template construction using MRI and [{sup 18}F]MK-9470 PET for CB1 receptor representation. PET images were reconstructed using the algorithms filtered back-projection, ordered subset expectation maximization in 2D, and maximum a posteriori in 3D. Landmarks were defined on each MR image, and templates were constructed under different settings, i.e., based on different tissue class images [gray matter (GM), white matter (WM), and GM + WM] and regularization forms (“linear elastic energy,” “membrane energy,” and “bending energy”). Registration accuracy for MRI and PET templates was evaluated by means of the distance between landmark coordinates. Results: The best MRI template was constructed based on gray and white matter images and the regularization form linear elastic energy. In this case, most distances between landmark coordinates were <1 mm. Accordingly, MRI-based spatial normalization was most accurate, but results of the PET-based spatial normalization were quite comparable. Conclusions: Image registration using DARTEL provides a standardized and automatic framework for small animal brain data analysis. The authors were able to show that this method works with high reliability and validity. Using DARTEL templates together with nonlinear registration algorithms allows for accurate spatial normalization of combined MRI/PET or PET-only studies.

60 APPLIED LIFE SCIENCES↗