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 1,189 records · Page 66

Neutronics and Depletion Methods for Parametric Studies of Fluoride Salt Cooled High Temperature Reactors with Slab Fuel Geometry and Multi-Batch Fuel Management Schemes

The Advanced High-Temperature Reactor (AHTR) is a 3400 MWth fluoride-salt-cooled high-temperature reactor (FHR) that uses TRISO particle fuel compacted into slabs rather than spherical or cylindrical fuel compacts. Simplified methods are required for parametric design studies such that analyzing the entire feasible design space for an AHTR is tractable. These simplifications include fuel homogenization techniques to increase the speed of neutron transport calculations in depletion analysis and equilibrium depletion analysis methods to analyze systems with multi-batch fuel management schemes. This paper presents three elements of significant novelty. First, the Reactivity-Equivalent Physical Transformation (RPT) methodology usually applied in systems with coated-particle fuel in cylindrical and spherical geometries has been extended to slab geometries. Secondly, based on this newly developed RPT method for slab geometries, a methodology that uses Monte Carlo depletion approaches was further developed to search for the maximum discharge burnup in a multi-batch system by iteratively estimating the beginning of equilibrium cycle (BOEC) composition and sampling different discharge burnups. This Iterative Equilibrium Depletion Search (IEDS) method fully defines an equilibrium fuel cycle (keff, power, flux, and composition evolutions) but is computationally demanding, although feasible on single-processor workstations. Finally, an analytical method, the Non-Linear Reactivity Model, was developed by expanding the linear reactivity model to include an arbitrary number of higher order terms so that single-batch depletion results could be extrapolated to estimate the maximum discharge burnup and BOEC keff in systems with multi-batch fuel management schemes. Results from this method were benchmarked against equilibrium depletion analysis results using the IEDS.

fluoride-salt-cooled high-temperature reactor (FHR↗

In-Field Testing of Components for Feedback and Control of the ITER Disruption Mitigation System

Here, the shattered pellet injection (SPI) method has been chosen as the disruption mitigation system (DMS) for ITER. To protect the device from plasma disruptions that cause damaging heat and electromagnetic loads, SPI is used to inject high-Z material into the plasma. The process of SPI utilizes cryogenic cooling to form solid pellets. Pellets are accelerated down a barrel and into an angled surface, causing the pellet to shatter prior to entering the tokamak chamber. For the DMS to function reliably, the 27 separate shattered pellet injectors planned for ITER must rely on many components to provide accurate feedback data and for control functions. Each component in the DMS is exposed to an elevated background magnetic field depending on its placement and proximity to the plasma chamber. A Helmholtz coil test stand that is operated at Oak Ridge National Laboratory was utilized to test the components in relevant background field levels to assess component performance. This paper details the test design and results for in-field component operation for a variety of components. This list includes the following components: two different network switches for camera connectivity, a VAT fast shutter valve intended to reduce the flow of SPI propellant gas into the torus, a solenoid control valve intended for use in the pellet formation process, pressure/vacuum switches to be used for feedback and control, a printed circuit board piezo pressure sensor to be used to measure breech pressure, and various relays for the high-voltage pulsed power supply used to drive the SPI propellant valve.

Disruption mitigation↗

On the efficiency of different numerical methods for the calculation of intrapulse Raman scattering of optical solitons

In this paper we compare the performance of different numerical methods for the calculation of the asymptotic evolution of soliton self-frequency shift in the presence of intrapulse Raman scattering (IRS) in optical fibers. First we have calculated the order of global accuracy for the fundamental soliton and the second-order bound state of the unperturbed nonlinear Schrödinger equation for the following numerical methods: the simple split step (SS) method, the full SS method, the reduced SS method, the reduced SS method with fourth order Runge–Kutta (RK4), the Blow–Wood method, the fourth order Runge–Kutta in the interaction picture (RK4IP) method and the Agrawal SS method with one and two iterations. We have shown that the asymptotic evolution of soliton self-frequency shift in the presence of IRS in optical fiber can be best described by the Agrawal SS method (compared to the Blow–Wood method and the RK4IP method). The obtained numerical results for the soliton position and frequency are in agreement with the predictions for these parameters according to the perturbation theory. We have shown that in the presence of IRS the fundamental soliton quickly develops an oscillating tail on its left. The generated tail hardly influences the soliton propagation at large distances. At large distances the form of the soliton gradually becomes asymmetric. The increase of the frequency resolution leads to a notable increase of the maximum propagation distance of the numerical soliton under the influence of IRS.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Patient-specific quantification of image quality: An automated method for measuring spatial resolution in clinical CT images

Purpose: To develop and validate an automated technique for evaluating the spatial resolution characteristics of clinical computed tomography (CT) images. Methods: Twenty one chest and abdominopelvic clinical CT datasets were examined in this study. An algorithm was developed to extract a CT resolution index (RI) analogous to the modulation transfer function from clinical CT images by measuring the edge-spread function (ESF) across the patient’s skin. A polygon mesh of the air-skin boundary was created. The faces of the mesh were then used to measure the ESF across the air-skin interface. The ESF was differentiated to obtain the line-spread function (LSF), and the LSF was Fourier transformed to obtain the RI. The algorithm’s ability to detect the radial dependence of the RI was investigated. RIs measured with the proposed method were compared with a conventional phantom-based method across two reconstruction algorithms (FBP and iterative) using the spatial frequency at 50% RI, f{sub 50}, as the metric for comparison. Three reconstruction kernels were investigated for each reconstruction algorithm. Finally, an observer study was conducted to determine if observers could visually perceive the differences in the measured blurriness of images reconstructed with a given reconstruction method. Results: RI measurements performed with the proposed technique exhibited the expected dependencies on the image reconstruction. The measured f{sub 50} values increased with harder kernels for both FBP and iterative reconstruction. Furthermore, the proposed algorithm was able to detect the radial dependence of the RI. Patient-specific measurements of the RI were comparable to the phantom-based technique, but the patient data exhibited a large spread in the measured f{sub 50}, indicating that some datasets were blurrier than others even when the projection data were reconstructed with the same reconstruction algorithm and kernel. Results from the observer study substantiated this finding. Conclusions: Clinically informed, patient-specific spatial resolution can be measured from clinical datasets. The method is sufficiently sensitive to reflect changes in spatial resolution due to different reconstruction parameters. The method can be applied to automatically assess the spatial resolution of patient images and quantify dependencies that may not be captured in phantom data.

60 APPLIED LIFE SCIENCES↗

SU-E-T-106: Development of a Collision Prediction Algorithm for Determining Problematic Geometry for SBRT Treatments Using a Stereotactic Body Frame

Purpose: Collision between the gantry and the couch or patient during Radiotherapy is not a common concern for conventional RT (static fields or arc). With the increase in the application of stereotactic planning techniques to the body, collisions have become a greater concern. Non-coplanar beam geometry is desirable in stereotatic treatments in order to achieve sharp gradients and a high conformality. Non-coplanar geometry is less intuitive in the body and often requires an iterative process of planning and dry runs to guarantee deliverability. Methods: Purpose written software was developed in order to predict the likelihood of collision between the head of the gantry and the couch, patient or stereotatic body frame. Using the DICOM plan and structures set, exported by the treatment planning system, this software is able to predict the possibility of a collision. Given the plan's isocenter, treatment geometry and exterior contours, the software is able to determine if a particular beam/arc is clinically deliverable or if collision is imminent. Results: The software was tested on real world treatment plans with untreatable beam geometry. Both static non-coplanar and VMAT plans were tested. Of these, the collision prediction software could identify all as having potentially problematic geometry. Re-plans of the same cases were also tested and validated as deliverable. Conclusion: This software is capable of giving good initial indication of deliverability for treatment plans that utilize complex geometry (SBRT) or have lateral isocenters. This software is not intended to replace the standard pre-treatment QA dry run. The effectiveness is limited to those portions of the patient and immobilization devices that have been included in the simulation CT and contoured in the planning system. It will however aid the planner in reducing the iterations required to create complex treatment geometries necessary to achieve ideal conformality and organ sparing.

60 APPLIED LIFE SCIENCES↗

SU-E-T-446: Group-Sparsity Based Angle Generation Method for Beam Angle Optimization

Purpose: This work is to develop the effective algorithm for beam angle optimization (BAO), with the emphasis on enabling further improvement from existing treatment-dependent templates based on clinical knowledge and experience. Methods: The proposed BAO algorithm utilizes a priori beam angle templates as the initial guess, and iteratively generates angular updates for this initial set, namely angle generation method, with improved dose conformality that is quantitatively measured by the objective function. That is, during each iteration, we select “the test angle” in the initial set, and use group-sparsity based fluence map optimization to identify “the candidate angle” for updating “the test angle”, for which all the angles in the initial set except “the test angle”, namely “the fixed set”, are set free, i.e., with no group-sparsity penalty, and the rest of angles including “the test angle” during this iteration are in “the working set”. And then “the candidate angle” is selected with the smallest objective function value from the angles in “the working set” with locally maximal group sparsity, and replaces “the test angle” if “the fixed set” with “the candidate angle” has a smaller objective function value by solving the standard fluence map optimization (with no group-sparsity regularization). Similarly other angles in the initial set are in turn selected as “the test angle” for angular updates and this chain of updates is iterated until no further new angular update is identified for a full loop. Results: The tests using the MGH public prostate dataset demonstrated the effectiveness of the proposed BAO algorithm. For example, the optimized angular set from the proposed BAO algorithm was better the MGH template. Conclusion: A new BAO algorithm is proposed based on the angle generation method via group sparsity, with improved dose conformality from the given template. Hao Gao was partially supported by the NSFC (#11405105), the 973 Program (#2015CB856000) and the Shanghai Pujiang Talent Program (#14PJ1404500)

60 APPLIED LIFE SCIENCES↗

SU-D-206-02: Evaluation of Partial Storage of the System Matrix for Cone Beam Computed Tomography Using a GPU Platform

Purpose: Iterative reconstruction algorithms in computed tomography (CT) require a fast method for computing the intersections between the photons’ trajectories and the object, also called ray-tracing or system matrix computation. This work evaluates different ways to store the system matrix, aiming to reconstruct dense image grids in reasonable time. Methods: We propose an optimized implementation of the Siddon’s algorithm using graphics processing units (GPUs) with a novel data storage scheme. The algorithm computes a part of the system matrix on demand, typically, for one projection angle. The proposed method was enhanced with accelerating options: storage of larger subsets of the system matrix, systematic reuse of data via geometric symmetries, an arithmetic-rich parallel code and code configuration via machine learning. It was tested on geometries mimicking a cone beam CT acquisition of a human head. To realistically assess the execution time, the ray-tracing routines were integrated into a regularized Poisson-based reconstruction algorithm. The proposed scheme was also compared to a different approach, where the system matrix is fully pre-computed and loaded at reconstruction time. Results: Fast ray-tracing of realistic acquisition geometries, which often lack spatial symmetry properties, was enabled via the proposed method. Ray-tracing interleaved with projection and backprojection operations required significant additional time. In most cases, ray-tracing was shown to use about 66 % of the total reconstruction time. In absolute terms, tracing times varied from 3.6 s to 7.5 min, depending on the problem size. The presence of geometrical symmetries allowed for non-negligible ray-tracing and reconstruction time reduction. Arithmetic-rich parallel code and machine learning permitted a modest reconstruction time reduction, in the order of 1 %. Conclusion: Partial system matrix storage permitted the reconstruction of higher 3D image grid sizes and larger projection datasets at the cost of additional time, when compared to the fully pre-computed approach. This work was supported in part by the Fonds de recherche du Quebec - Nature et technologies (FRQ-NT). The authors acknowledge partial support by the CREATE Medical Physics Research Training Network grant of the Natural Sciences and Engineering Research Council of Canada (Grant No. 432290).

60 APPLIED LIFE SCIENCES↗

Technical Note: Improving the VMERGE treatment planning algorithm for rotational radiotherapy

Purpose: The authors revisit the VMERGE treatment planning algorithm by Craft et al. [“Multicriteria VMAT optimization,” Med. Phys. 39, 686–696 (2012)] for arc therapy planning and propose two changes to the method that are aimed at improving the achieved trade-off between treatment time and plan quality at little additional planning time cost, while retaining other desirable properties of the original algorithm. Methods: The original VMERGE algorithm first computes an “ideal,” high quality but also highly time consuming treatment plan that irradiates the patient from all possible angles in a fine angular grid with a highly modulated beam and then makes this plan deliverable within practical treatment time by an iterative fluence map merging and sequencing algorithm. We propose two changes to this method. First, we regularize the ideal plan obtained in the first step by adding an explicit constraint on treatment time. Second, we propose a different merging criterion that comprises of identifying and merging adjacent maps whose merging results in the least degradation of radiation dose. Results: The effect of both suggested modifications is evaluated individually and jointly on clinical prostate and paraspinal cases. Details of the two cases are reported. Conclusions: In the authors’ computational study they found that both proposed modifications, especially the regularization, yield noticeably improved treatment plans for the same treatment times than what can be obtained using the original VMERGE method. The resulting plans match the quality of 20-beam step-and-shoot IMRT plans with a delivery time of approximately 2 min.

60 APPLIED LIFE SCIENCES↗

A systematic way for the cost reduction of density fitting methods

We present a simple approach for the reduction of the size of auxiliary basis sets used in methods exploiting the density fitting (resolution of identity) approximation for electron repulsion integrals. Starting out of the singular value decomposition of three-center two-electron integrals, new auxiliary functions are constructed as linear combinations of the original fitting functions. The new functions, which we term natural auxiliary functions (NAFs), are analogous to the natural orbitals widely used for the cost reduction of correlation methods. The use of the NAF basis enables the systematic truncation of the fitting basis, and thereby potentially the reduction of the computational expenses of the methods, though the scaling with the system size is not altered. The performance of the new approach has been tested for several quantum chemical methods. It is demonstrated that the most pronounced gain in computational efficiency can be expected for iterative models which scale quadratically with the size of the fitting basis set, such as the direct random phase approximation. The approach also has the promise of accelerating local correlation methods, for which the processing of three-center Coulomb integrals is a bottleneck.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

WE-AB-303-09: Rapid Projection Computations for On-Board Digital Tomosynthesis in Radiation Therapy

Purpose: To facilitate fast and accurate iterative volumetric image reconstruction from limited-angle on-board projections. Methods: Intrafraction motion hinders the clinical applicability of modern radiotherapy techniques, such as lung stereotactic body radiation therapy (SBRT). The LIVE system may impact clinical practice by recovering volumetric information via Digital Tomosynthesis (DTS), thus entailing low time and radiation dose for image acquisition during treatment. The DTS is estimated as a deformation of prior CT via iterative registration with on-board images; this shifts the challenge to the computational domain, owing largely to repeated projection computations across iterations. We address this issue by composing efficient digital projection operators from their constituent parts. This allows us to separate the static (projection geometry) and dynamic (volume/image data) parts of projection operations by means of pre-computations, enabling fast on-board processing, while also relaxing constraints on underlying numerical models (e.g. regridding interpolation kernels). Further decoupling the projectors into simpler ones ensures the incurred memory overhead remains low, within the capacity of a single GPU. These operators depend only on the treatment plan and may be reused across iterations and patients. The dynamic processing load is kept to a minimum and maps well to the GPU computational model. Results: We have integrated efficient, pre-computable modules for volumetric ray-casting and FDK-based back-projection with the LIVE processing pipeline. Our results show a 60x acceleration of the DTS computations, compared to the previous version, using a single GPU; presently, reconstruction is attained within a couple of minutes. The present implementation allows for significant flexibility in terms of the numerical and operational projection model; we are investigating the benefit of further optimizations and accurate digital projection sub-kernels. Conclusion: Composable projection operators constitute a versatile research tool which can greatly accelerate iterative registration algorithms and may be conducive to the clinical applicability of LIVE. National Institutes of Health Grant No. R01-CA184173; GPU donation by NVIDIA Corporation.

60 APPLIED LIFE SCIENCES↗

HFEM3D

Software solves the three-dimensional Poisson equation div(k(grad(u)) = f, by the finite element method for the case when material properties, k, are distributed over hierarchy of edges, facets and tetrahedra in the finite element mesh. Method is described in Weiss, CJ, Finite element analysis for model parameters distributed on a hierarchy of geometric simplices, Geophysics, v82, E155-167, doi:10.1190/GEO2017-0058.1 (2017). A standard finite element method for solving Poisson’s equation is augmented by including in the 3D stiffness matrix additional 2D and 1D stiffness matrices representing the contributions from material properties associated with mesh faces and edges, respectively. The resulting linear system is solved iteratively using the conjugate gradient method with Jacobi preconditioning. To minimize computer storage for program execution, the linear solver computes matrix-vector contractions element-by-element over the mesh, without explicit storage of the global stiffness matrix. Program output vtk compliant for visualization and rendering by 3rd party software. Program uses dynamic memory allocation and as such there are no hard limits on problem size outside of those imposed by the operating system and configuration on which the software is run. Dimension, N, of the finite element solution vector is constrained by the the addressable space in 32-vs-64 bit operating systems. Total storage requirements for the problem. Total working space required for the program is approximately 13*N double precision words.

Weiss, Chester J↗

Extending the applicability of the Tkatchenko-Scheffler dispersion correction via iterative Hirshfeld partitioning

Recently we have demonstrated that the applicability of the Tkatchenko-Scheffler (TS) method for calculating dispersion corrections to density-functional theory can be extended to ionic systems if the Hirshfeld method for estimating effective volumes and charges of atoms in molecules or solids (AIM’s) is replaced by its iterative variant [T. Bučko, S. Lebègue, J. Hafner, and J. Ángyán, J. Chem. Theory Comput. 9, 4293 (2013)]. The standard Hirshfeld method uses neutral atoms as a reference, whereas in the iterative Hirshfeld (HI) scheme the fractionally charged atomic reference states are determined self-consistently. We show that the HI method predicts more realistic AIM charges and that the TS/HI approach leads to polarizabilities and C{sub 6} dispersion coefficients in ionic or partially ionic systems which are, as expected, larger for anions than for cations (in contrast to the conventional TS method). For crystalline materials, the new algorithm predicts polarizabilities per unit cell in better agreement with the values derived from the Clausius-Mosotti equation. The applicability of the TS/HI method has been tested for a wide variety of molecular and solid-state systems. It is demonstrated that for systems dominated by covalent interactions and/or dispersion forces the TS/HI method leads to the same results as the conventional TS approach. The difference between the TS/HI and TS approaches increases with increasing ionicity. A detailed comparison is presented for isoelectronic series of octet compounds, layered crystals, complex intermetallic compounds, and hydrides, and for crystals built of molecules or containing molecular anions. It is demonstrated that only the TS/HI method leads to accurate results for systems where both electrostatic and dispersion interactions are important, as illustrated for Li-intercalated graphite and for molecular adsorption on the surfaces in ionic solids and in the cavities of zeolites.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

STRONG GRAVITATIONAL LENS MODELING WITH SPATIALLY VARIANT POINT-SPREAD FUNCTIONS

Astronomical instruments generally possess spatially variant point-spread functions, which determine the amount by which an image pixel is blurred as a function of position. Several techniques have been devised to handle this variability in the context of the standard image deconvolution problem. We have developed an iterative gravitational lens modeling code called Mirage that determines the parameters of pixelated source intensity distributions for a given lens model. We are able to include the effects of spatially variant point-spread functions using the iterative procedures in this lensing code. In this paper, we discuss the methods to include spatially variant blurring effects and test the results of the algorithm in the context of gravitational lens modeling problems.

79 ASTRONOMY AND ASTROPHYSICS↗

FEM-BEM coupling methods for Tokamak plasma axisymmetric free-boundary equilibrium computations in unbounded domains

Incorporating boundary conditions at infinity into simulations on bounded computational domains is a repeatedly occurring problem in scientific computing. The combination of finite element methods (FEM) and boundary element methods (BEM) is the obvious instrument, and we adapt here for the first time the two standard FEM-BEM coupling approaches to the free-boundary equilibrium problem: the Johnson–Nédélec coupling and the Bielak–MacCamy coupling. We recall also the classical approach for fusion applications, dubbed according to its first appearance von-Hagenow–Lackner coupling and present the less used alternative introduced by Albanese, Blum and de Barbieri in . We show that the von-Hagenow–Lackner coupling suffers from undesirable non-optimal convergence properties, that suggest that other coupling schemes, in particular Johnson–Nédélec or Albanese–Blum–de Barbieri are more appropriate for non-linear equilibrium problems. Moreover, we show that any of such coupling methods requires Newton-like iteration schemes for solving the corresponding non-linear discrete algebraic systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Benchmarking the completely renormalised equation-of-motion coupled-cluster approaches for vertical excitation energies

When vertical energies are excited for a comprehensive test set of about 150 singlet excited states of 28 medium-sized organic molecules computed using two variants of the completely renormalised (CR) equation-of-motion (EOM) coupled-cluster (CC) method with singles, doubles, and non-iterative triples, abbreviated as δ-CR-EOMCCSD(T), and the analogous two variants of the newer, left-eigenstate δ-CR-EOMCC(2,3) approach are benchmarked against the previously published CASPT2, CC3, and EOMCCSDT-3 results, as well as the suggested theoretical best estimate (TBE) values. The δ-CR-EOMCC approaches are also used to identify and characterise about 50 additional excited states, including several states having substantial two-electron excitation components, which have not been found in the previous work and which can be used in future benchmark studies. We demonstrated that the non-iterative triples corrections to the EOMCCSD excitation energies defining the relatively inexpensive, single-reference, black-box δ-CR-EOMCC approaches provide significant improvements in the EOMCCSD data, while closely matching the results of the iterative and considerably more expensive CC3 and EOMCCSDT-3 calculations and their CASPT2 and TBE counterparts. It is also shown that the δ-CR-EOMCC methods, especially δ-CR-EOMCC(2,3), are capable of bringing the results of the CC3 and EOMCCSDT-3 calculations to a closer agreement with the CASPT2 and TBE data, demonstrating the utility of the cost-effective δ-CR-EOMCC methods in applications involving molecular electronic spectra. Finally, we show that there may exist a relationship between the magnitude of the triples corrections defining δ-CR-EOMCC approaches and the reduced excitation level diagnostic resulting from EOMCCSD.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Multi-Sensor Optimal Motion Planning for Radiological Contamination Surveys by Using Prediction-Difference Maps

Distributed and networked mobile sensor platforms using unmanned aerial and/or ground vehicles to survey areas of interest offer a safer and more efficient method for radiological contamination mapping; however, most applications rely on uniformly sweeping of the area in a raster-type motion without utilizing the information available in a dynamic sense. We have developed a fully autonomous optimal motion planning procedure for networks with two or more mobile sensors. The procedure utilizes well-established concepts of Gaussian processes in combination with control laws based on centroidal Voronoi tessellations to achieve optimal next-iteration sensor movements. A new method of informing optimal motion planning is proposed, whereby the absolute difference between the prior and current full-map prediction, referred to as the prediction-difference map, is used as the spatial density function within each Voronoi cell, providing immediate and iterative feedback for dynamic use of available information. The Gaussian process regression model used to estimate the contamination in unvisited locations also provides prediction uncertainties, and can be used as a quantitative metric to assess the confidence in the calculated contamination map; these estimates and prediction uncertainties are unavailable for standard uniform survey routines as they can only produce maps in the vicinity of observed locations. We present through simulation the achievable performance gains from using this new method by directly comparing to a uniform survey method. Results show that using the prediction-difference maps to inform motion planning procedures offers a faster rate of producing an accurate and convergent map relative to a uniform survey route.

47 OTHER INSTRUMENTATION↗

Variable frequency iteration MPPT for resonant power converters

A method of maximum power point tracking (MPPT) uses an MPPT algorithm to determine a switching frequency for a resonant power converter, including initializing by setting an initial boundary frequency range that is divided into initial frequency sub-ranges bounded by initial frequencies including an initial center frequency and first and second initial bounding frequencies. A first iteration includes measuring initial powers at the initial frequencies to determine a maximum power initial frequency that is used to set a first reduced frequency search range centered or bounded by the maximum power initial frequency including at least a first additional bounding frequency. A second iteration includes calculating first and second center frequencies by averaging adjacent frequent values in the first reduced frequency search range and measuring second power values at the first and second center frequencies. The switching frequency is determined from measured power values including the second power values.

14 SOLAR ENERGY↗

SU-F-I-08: CT Image Ring Artifact Reduction Based On Prior Image

Purpose: In computed tomography (CT) system, CT images with ring artifacts will be reconstructed when some adjacent bins of detector don’t work. The ring artifacts severely degrade CT image quality. We present a useful CT ring artifacts reduction based on projection data correction, aiming at estimating the missing data of projection data accurately, thus removing the ring artifacts of CT images. Methods: The method consists of ten steps: 1) Identification of abnormal pixel line in projection sinogram; 2) Linear interpolation within the pixel line of projection sinogram; 3) FBP reconstruction using interpolated projection data; 4) Filtering FBP image using mean filter; 5) Forwarding projection of filtered FBP image; 6) Subtraction forwarded projection from original projection; 7) Linear interpolation of abnormal pixel line area in the subtraction projection; 8) Adding the interpolated subtraction projection on the forwarded projection; 9) FBP reconstruction using corrected projection data; 10) Return to step 4 until the pre-set iteration number is reached. The method is validated on simulated and real data to restore missing projection data and reconstruct ring artifact-free CT images. Results: We have studied impact of amount of dead bins of CT detector on the accuracy of missing data estimation in projection sinogram. For the simulated case with a resolution of 256 by 256 Shepp-Logan phantom, three iterations are sufficient to restore projection data and reconstruct ring artifact-free images when the dead bins rating is under 30%. The dead-bin-induced artifacts are substantially reduced. More iteration number is needed to reconstruct satisfactory images while the rating of dead bins increases. Similar results were found for a real head phantom case. Conclusion: A practical CT image ring artifact correction scheme based on projection data is developed. This method can produce ring artifact-free CT images feasibly and effectively.

60 APPLIED LIFE SCIENCES↗