Search NASA⌕ Search

SEARCH · Search NASA

Results for “iterative projection algorithms”

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 163 records · Page 9

The MHOST finite element program: 3-D inelastic analysis methods for hot section components. Volume 1: Theoretical manual

Formulations and algorithms implemented in the MHOST finite element program are discussed. The code uses a novel concept of the mixed iterative solution technique for the efficient 3-D computations of turbine engine hot section components. The general framework of variational formulation and solution algorithms are discussed which were derived from the mixed three field Hu-Washizu principle. This formulation enables the use of nodal interpolation for coordinates, displacements, strains, and stresses. Algorithmic description of the mixed iterative method includes variations for the quasi static, transient dynamic and buckling analyses. The global-local analysis procedure referred to as the subelement refinement is developed in the framework of the mixed iterative solution, of which the detail is presented. The numerically integrated isoparametric elements implemented in the framework is discussed. Methods to filter certain parts of strain and project the element discontinuous quantities to the nodes are developed for a family of linear elements. Integration algorithms are described for linear and nonlinear equations included in MHOST program.

Nakazawa, Shohei↗

Exact Reconstruction From Uniformly Attenuated Helical Cone-Beam Projections in SPECT

In recent years the development of cone-beam reconstruction algorithms has been an active research area in x-ray computed tomography (CT), and significant progress has been made in the advancement of algorithms. Theoretically exact and computationally efficient analytical algorithms can be found in the literature. However, in single photon emission computed tomography (SPECT), published cone-beam reconstruction algorithms are either approximate or involve iterative methods. The SPECT reconstruction problem is more complicated due to degradations in the imaging detection process, one of which is the effect of attenuation of gamma ray photons. Attenuation should be compensated for to obtain quantitative results. In this paper, an analytical reconstruction algorithm for uniformly attenuated cone-beam projection data is presented for SPECT imaging. The algorithm adopts the DBH method, a procedure consisting of differentiation and backprojection followed by a finite inverse cosh-weighted Hilbert transform. The significance of the proposed approach is that a selected region of interest can be reconstructed even with a detector with a reduced field of view. The algorithm is designed for a general trajectory. However, to validate the algorithm, a numerical study was performed using a helical trajectory. The implementation is efficient and the simulation result is promising.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

SU-D-17A-02: Four-Dimensional CBCT Using Conventional CBCT Dataset and Iterative Subtraction Algorithm of a Lung Patient

Purpose: The Iterative Subtraction Algorithm (ISA) method generates retrospectively a pre-selected motion phase cone-beam CT image from the full motion cone-beam CT acquired at standard rotation speed. This work evaluates ISA method with real lung patient data. Methods: The goal of the ISA algorithm is to extract motion and no- motion components form the full reconstruction CBCT. The workflow consists of subtracting from the full CBCT all of the undesired motion phases and obtain a motion de-blurred single-phase CBCT image, followed by iteration of this subtraction process. ISA is realized as follows: 1) The projections are sorted to various phases, and from all phases, a full reconstruction is performed to generate an image CTM. 2) Generate forward projections of CTM at the desired phase projection angles, the subtraction of projection and the forward projection will reconstruct a CTSub1, which diminishes the desired phase component. 3) By adding back the CTSub1 to CTm, no motion CBCT, CTS1, can be computed. 4) CTS1 still contains residual motion component. 5) This residual motion component can be further reduced by iteration.The ISA 4DCBCT technique was implemented using Varian Trilogy accelerator OBI system. To evaluate the method, a lung patient CBCT dataset was used. The reconstruction algorithm is FDK. Results: The single phase CBCT reconstruction generated via ISA successfully isolates the desired motion phase from the full motion CBCT, effectively reducing motion blur. It also shows improved image quality, with reduced streak artifacts with respect to the reconstructions from unprocessed phase-sorted projections only. Conclusion: A CBCT motion de-blurring algorithm, ISA, has been developed and evaluated with lung patient data. The algorithm allows improved visualization of a single phase motion extracted from a standard CBCT dataset. This study has been supported by National Institute of Health through R01CA133539.

60 APPLIED LIFE SCIENCES↗

WE-G-207-03: Mask Guided Image Reconstruction (MGIR): A Novel Method for Ultra-Low-Dose 3D and Enhanced 4D Cone-Beam Computer-Tomography

Purpose: Recently, compressed sensing (CS) based iterative reconstruction (IR) method is receiving attentions to reconstruct high quality cone beam computed tomography (CBCT) images using sparsely sampled or noisy projections. The aim of this study is to develop a novel baseline algorithm called Mask Guided Image Reconstruction (MGIR), which can provide superior image quality for both low-dose 3DCBCT and 4DCBCT under single mathematical framework. Methods: In MGIR, the unknown CBCT volume was mathematically modeled as a combination of two regions where anatomical structures are 1) within the priori-defined mask and 2) outside the mask. Then we update each part of images alternatively thorough solving minimization problems based on CS type IR. For low-dose 3DCBCT, the former region is defined as the anatomically complex region where it is focused to preserve edge information while latter region is defined as contrast uniform, and hence aggressively updated to remove noise/artifact. In 4DCBCT, the regions are separated as the common static part and moving part. Then, static volume and moving volumes were updated with global and phase sorted projection respectively, to optimize the image quality of both moving and static part simultaneously. Results: Examination of MGIR algorithm showed that high quality of both low-dose 3DCBCT and 4DCBCT images can be reconstructed without compromising the image resolution and imaging dose or scanning time respectively. For low-dose 3DCBCT, a clinical viable and high resolution head-and-neck image can be obtained while cutting the dose by 83%. In 4DCBCT, excellent quality 4DCBCT images could be reconstructed while requiring no more projection data and imaging dose than a typical clinical 3DCBCT scan. Conclusion: The results shown that the image quality of MGIR was superior compared to other published CS based IR algorithms for both 4DCBCT and low-dose 3DCBCT. This makes our MGIR algorithm potentially useful in various on-line clinical applications. Provisional Patent: UF#15476; WGS Ref. No. U1198.70067US00.

60 APPLIED LIFE SCIENCES↗

A hybrid reconstruction algorithm for fast and accurate 4D cone-beam CT imaging

Purpose: 4D cone beam CT (4D-CBCT) has been utilized in radiation therapy to provide 4D image guidance in lung and upper abdomen area. However, clinical application of 4D-CBCT is currently limited due to the long scan time and low image quality. The purpose of this paper is to develop a new 4D-CBCT reconstruction method that restores volumetric images based on the 1-min scan data acquired with a standard 3D-CBCT protocol. Methods: The model optimizes a deformation vector field that deforms a patient-specific planning CT (p-CT), so that the calculated 4D-CBCT projections match measurements. A forward-backward splitting (FBS) method is invented to solve the optimization problem. It splits the original problem into two well-studied subproblems, i.e., image reconstruction and deformable image registration. By iteratively solving the two subproblems, FBS gradually yields correct deformation information, while maintaining high image quality. The whole workflow is implemented on a graphic-processing-unit to improve efficiency. Comprehensive evaluations have been conducted on a moving phantom and three real patient cases regarding the accuracy and quality of the reconstructed images, as well as the algorithm robustness and efficiency. Results: The proposed algorithm reconstructs 4D-CBCT images from highly under-sampled projection data acquired with 1-min scans. Regarding the anatomical structure location accuracy, 0.204 mm average differences and 0.484 mm maximum difference are found for the phantom case, and the maximum differences of 0.3–0.5 mm for patients 1–3 are observed. As for the image quality, intensity errors below 5 and 20 HU compared to the planning CT are achieved for the phantom and the patient cases, respectively. Signal-noise-ratio values are improved by 12.74 and 5.12 times compared to results from FDK algorithm using the 1-min data and 4-min data, respectively. The computation time of the algorithm on a NVIDIA GTX590 card is 1–1.5 min per phase. Conclusions: High-quality 4D-CBCT imaging based on the clinically standard 1-min 3D CBCT scanning protocol is feasible via the proposed hybrid reconstruction algorithm.

60 APPLIED LIFE SCIENCES↗

Simultaneous motion estimation and image reconstruction (SMEIR) for 4D cone-beam CT

Purpose: Image reconstruction and motion model estimation in four-dimensional cone-beam CT (4D-CBCT) are conventionally handled as two sequential steps. Due to the limited number of projections at each phase, the image quality of 4D-CBCT is degraded by view aliasing artifacts, and the accuracy of subsequent motion modeling is decreased by the inferior 4D-CBCT. The objective of this work is to enhance both the image quality of 4D-CBCT and the accuracy of motion model estimation with a novel strategy enabling simultaneous motion estimation and image reconstruction (SMEIR).Methods: The proposed SMEIR algorithm consists of two alternating steps: (1) model-based iterative image reconstruction to obtain a motion-compensated primary CBCT (m-pCBCT) and (2) motion model estimation to obtain an optimal set of deformation vector fields (DVFs) between the m-pCBCT and other 4D-CBCT phases. The motion-compensated image reconstruction is based on the simultaneous algebraic reconstruction technique (SART) coupled with total variation minimization. During the forward- and backprojection of SART, measured projections from an entire set of 4D-CBCT are used for reconstruction of the m-pCBCT by utilizing the updated DVF. The DVF is estimated by matching the forward projection of the deformed m-pCBCT and measured projections of other phases of 4D-CBCT. The performance of the SMEIR algorithm is quantitatively evaluated on a 4D NCAT phantom. The quality of reconstructed 4D images and the accuracy of tumor motion trajectory are assessed by comparing with those resulting from conventional sequential 4D-CBCT reconstructions (FDK and total variation minimization) and motion estimation (demons algorithm). The performance of the SMEIR algorithm is further evaluated by reconstructing a lung cancer patient 4D-CBCT.Results: Image quality of 4D-CBCT is greatly improved by the SMEIR algorithm in both phantom and patient studies. When all projections are used to reconstruct a 3D-CBCT by FDK, motion-blurring artifacts are present, leading to a 24.4% relative reconstruction error in the NACT phantom. View aliasing artifacts are present in 4D-CBCT reconstructed by FDK from 20 projections, with a relative error of 32.1%. When total variation minimization is used to reconstruct 4D-CBCT, the relative error is 18.9%. Image quality of 4D-CBCT is substantially improved by using the SMEIR algorithm and relative error is reduced to 7.6%. The maximum error (MaxE) of tumor motion determined from the DVF obtained by demons registration on a FDK-reconstructed 4D-CBCT is 3.0, 2.3, and 7.1 mm along left–right (L-R), anterior–posterior (A-P), and superior–inferior (S-I) directions, respectively. From the DVF obtained by demons registration on 4D-CBCT reconstructed by total variation minimization, the MaxE of tumor motion is reduced to 1.5, 0.5, and 5.5 mm along L-R, A-P, and S-I directions. From the DVF estimated by SMEIR algorithm, the MaxE of tumor motion is further reduced to 0.8, 0.4, and 1.5 mm along L-R, A-P, and S-I directions, respectively.Conclusions: The proposed SMEIR algorithm is able to estimate a motion model and reconstruct motion-compensated 4D-CBCT. The SMEIR algorithm improves image reconstruction accuracy of 4D-CBCT and tumor motion trajectory estimation accuracy as compared to conventional sequential 4D-CBCT reconstruction and motion estimation.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Automatic projection image registration for nanoscale X-ray tomographic reconstruction

Novel developments in X-ray sources, optics and detectors have significantly advanced the capability of X-ray microscopy at the nanoscale. Depending on the imaging modality and the photon energy, state-of-the-art X-ray microscopes are routinely operated at a spatial resolution of tens of nanometres for hard X-rays or ~ 10 nm for soft X-rays. The improvement in spatial resolution, however, has led to challenges in the tomographic reconstruction due to the fact that the imperfections of the mechanical system become clearly detectable in the projection images.Without proper registration of the projection images, a severe point spread function will be introduced into the tomographic reconstructions, causing the reduction of the three-dimensional (3D) spatial resolution as well as the enhancement of image artifacts. In this work, the development of a method that iteratively performs registration of the experimentally measured projection images to those that are numerically calculated by reprojecting the 3D matrix in the corresponding viewing angles is shown. Multiple algorithms are implemented to conduct the registration, which corrects the translational and/ or the rotational errors. A sequence that offers a superior performance is presented and discussed. Going beyond the visual assessment of the reconstruction results, the morphological quantification of a battery electrode particle that has gone through substantial cycling is investigated. The results show that the presented method has led to a better quality tomographic reconstruction, which, subsequently, promotes the fidelity in the quantification of the sample morphology.

42 ENGINEERING↗

SU-F-J-214: Dose Reduction by Spatially Optimized Image Quality Via Fluence Modulated Proton CT (FMpCT)

Purpose: Proton CT (pCT) is a promising imaging modality for reducing range uncertainty in image-guided proton therapy. Range uncertainties partially originate from X-ray CT number conversion to stopping power ratio (SPR) and are limiting the exploitation of the full potential of proton therapy. In this study we explore the concept of spatially dependent fluence modulated proton CT (FMpCT), for achieving optimal image quality in a clinical region of interest (ROI), while reducing significantly the imaging dose to the patient. Methods: The study was based on simulated ideal pCT using pencil beam (PB) scanning. A set of 250 MeV protons PBs was used to create 360 projections of a cylindrical water phantom and a head and neck cancer patient. The tomographic images were reconstructed using a filtered backprojection (FBP) as well as an iterative algorithm (ITR). Different fluence modulation levels were investigated and their impact on the image was quantified in terms of SPR accuracy as well as noise within and outside selected ROIs, as a function of imaging dose. The unmodulated image served as reference. Results: Both FBP reconstruction and ITR without total variation (TV) yielded image quality in the ROIs similar to the reference images, for modulation down to 0.1 of the full proton fluence. The average dose was reduced by 75% for the water phantom and by 40% for the patient. FMpCT does not improve the noise for ITR with TV and modulation 0.1. Conclusion: This is the first work proposing and investigating FMpCT for producing optimal image quality for treatment planning and image guidance, while simultaneously reducing imaging dose. Future work will address spatial resolution effects and the impact of FMpCT on the quality of proton treatment plans for a prototype pCT scanner capable of list mode data acquisition. Acknowledgement: DFG-MAP DFG - Munich-Centre for Advanced Photonics (MAP)

60 APPLIED LIFE SCIENCES↗

Atmospheric Infrared Sounder Version 7 Near-Real-Time Product and Imagery Released by NASA GES DISC

The NASA Goddard Earth Sciences Data and Information Services Center (GES DISC) has been the home of data processing, archive, and distribution services for data from the Atmospheric Infrared Sounder (AIRS) mission since its launch in 2002. The GES DISC provides service to both AIRS routine and Near Real-Time (NRT) products. The AIRS NRT products are an important element in the Land, Atmosphere Near real-time Capability for EOS (LANCE). In collaboration with AIRS Project, the GES DISC has just released products from the Version 7 algorithm. The new version algorithm provides significant improvements over the previous version. The most substantial advances are: improved consistency between day and night water vapor; improved total column ozone and temperature; improved infrared-only (IR-only) retrievals, especially in high latitude regions; an improved Stochastic Cloud Clearing Neural Network used as a first guess at the initial value in the iterative retrieval process; and removal of ambiguity in surface classification in the IR-only retrieval algorithm. In addition, the GES DISC produces AIRS NRT imagery. The AIRS NRT imagery are generated by mosaicking and mapping the available AIRS 6-minute retrieval granules to a global projection. The images are constantly refreshed when new granules are produced. The AIRS NRT Viewer and LANCE Worldview provide visualization services to online users for AIRS NRT imagery. The data products used to generate this imagery include atmospheric temperature, humidity, precipitation, cloud, Dust Score, CO, and SO2. In this presentation, we will demonstrate visualization of the AIRS NRT imagery from the new Version 7, and demonstrate some improvements over the previous version. Progress on improving the AIRS NRT imagery, a collaboration project with the AIRS Applications Development Team at NASA Jet Propulsion Laboratory (JPL), will also be presented.

Feng Ding↗

SU-D-18A-07: Towards 6-Degree-Of-Freedom Real-Time Motion Management in Cancer Radiotherapy

Purpose: Lung tumor motion has been identified as a major issue that deteriorates treatment efficacy for radiotherapy, especially for SBRT. As tighter PTV margins are applied due to translational compensation, tumor rotation will become the dominant factor limiting tumor targeting accuracy. This is the world-first study quantifies lung tumor rotation by utilizing kV images with fiducial markers and a step towards 6-degree-of-freedom real-time cancer radiotherapy. Methods: Three or four gold coils were implanted as tumor surrogates in 3 lung cancer patients. 50 fractions of 8- minute, 10 Hz 4D CBCT projections were acquired for the patients immediately prior or after radiotherapy. The fiducial marker positions are segmented, reconstructed and used to determine tumour rotation by the iterative closest point algorithm. Different data acceptance and filtering methods were applied to accept data or smooth the marker trajectory. Results: The average rotation angles around the left/ right (LR), superior/inferior (SI), anterior/posterior (AP) rotations were found to be 0.8±4.2, -0.8±4.5 and 1.7±3.1 degrees respectively. For 28% of the treatment time, the lung tumors rotated more than 5° around the SI axis. Respiration-induced rotational motion was detected in 2 of the 3 lung patients. This can be explained by the patient developed atelectasis during the treatment period. Interestingly, no heart beating component of rotation was observed in the power spectrum. Different rotational types were observed within the patient cohort with large variations in the magnitude of the rotation between patients. Conclusions: For the first time, continuous tumor rotation has been measured for lung patients with gold fiducial markers. Tumors were found to undergo rotations of more than 5° for almost a third of the total treatment time. The study also demonstrated the feasibility of using continuously kV images for real-time lung tumour motion adaptive radiotherapy which can potentially reduce treatment margins and side effects. The authors acknowledge the financial support of an NHMRC Australia Fellowship.

60 APPLIED LIFE SCIENCES↗

Few-view image reconstruction

A CT image reconstruction system is provided that provides a solution to a few-view problem by generating a 3D image from measurements and a forward projection matrix for a CT scan of an object that tends to minimize streaks and other artifacts. The system initially receives measurements and a forward projection matrix for the CT scan. The system during an initial stage generates an initial 3D image based on various constraints so that (1) the reconstruction of the initial 3D image can be perform quickly and (2) the difference between the measurements and the forward projection of the initial 3D image has significantly lower contrast and high frequency content as compared the measurements themselves. The system then during a final stage applies an iterative algorithm to reconstruct the 3D image with the 3D image initialized to the initial 3D image at the beginning of the iterative algorithm.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A Refined Method to Translate Solar Data Quality Assessment Flags to Estimated Measurement Uncertainty

Integrating solar resource uncertainties due to radiometer measurement performance and operational data quality assessment can provide improved estimates of economic bankability, system design performance, and compliance of solar energy conversion systems. Estimating radiometer measurement uncertainty is an established procedure consistent with recognized best practices and international guidelines. SERI QC is a robust solar data quality assessment software tool that has been in continuous use for more than three decades. This report, the fourth of six for the Data Quality and Uncertainty Integration Project, presents a refined algorithm description for software to translate solar resource data quality assessment results into estimated uncertainty values in a Solar Resource Operational Uncertainty Integrator (SROUI) application. This algorithm requires three-component solar irradiance measurements - global horizontal irradiance, direct normal irradiance, and diffuse horizontal irradiance - collected at 1- to 60-minute intervals, as described in the previous deliverables. The development of this report as Deliverable 6.4 was an iterative process that included reviews and feedback from the project team on initial drafts designed to refine how the new software could best support determining solar resource data uncertainty. The results of this effort will contribute to the final software system development by National Renewable Energy Laboratory staff.

14 SOLAR ENERGY↗

Parallel Implicit Algorithms for CFD

The main goal of this project was efficient distributed parallel and workstation cluster implementations of Newton-Krylov-Schwarz (NKS) solvers for implicit Computational Fluid Dynamics (CFD.) "Newton" refers to a quadratically convergent nonlinear iteration using gradient information based on the true residual, "Krylov" to an inner linear iteration that accesses the Jacobian matrix only through highly parallelizable sparse matrix-vector products, and "Schwarz" to a domain decomposition form of preconditioning the inner Krylov iterations with primarily neighbor-only exchange of data between the processors. Prior experience has established that Newton-Krylov methods are competitive solvers in the CFD context and that Krylov-Schwarz methods port well to distributed memory computers. The combination of the techniques into Newton-Krylov-Schwarz was implemented on 2D and 3D unstructured Euler codes on the parallel testbeds that used to be at LaRC and on several other parallel computers operated by other agencies or made available by the vendors. Early implementations were made directly in Massively Parallel Integration (MPI) with parallel solvers we adapted from legacy NASA codes and enhanced for full NKS functionality. Later implementations were made in the framework of the PETSC library from Argonne National Laboratory, which now includes pseudo-transient continuation Newton-Krylov-Schwarz solver capability (as a result of demands we made upon PETSC during our early porting experiences). A secondary project pursued with funding from this contract was parallel implicit solvers in acoustics, specifically in the Helmholtz formulation. A 2D acoustic inverse problem has been solved in parallel within the PETSC framework.

Keyes, David E.↗

Final Report for Award #DE-SC3956 Separating Algorithm and Implementation via programming Model Injection (SAIMI)

Programming parallel machines is fraught with difficulties: the obfuscation of algorithms due to implementation details such as communication and synchronization, the need for transparency between language constructs and performance, the difficulty of performing program analysis to enable automatic parallelization techniques, and the existence of important "dusty deck" codes. The SAIMI project developed abstractions that enable the orthogonal specification of algorithms and implementation details within the context of existing DOE applications. The main idea is to enable the injection of small programming models such as expressions involving transcendental functions, polyhedral iteration spaces with sparse constraints, and task graphs into full programs through the use of pragmas. These smaller, more restricted programming models enable orthogonal specification of many implementation details such as how to map the computation on to parallel processors, how to schedule the computation, and how to allocation storage for the computation. At the same time, these small programming models enable the expression of the most computationally intense and communication heavy portions in many scientific simulations. The ability to orthogonally manipulate the implementation for such computations will significantly ease performance programming efforts and expose transformation possibilities and parameter to automated approaches such as autotuning. At Colorado State University, the SAIMI project was supported through DOE grant DE-SC3956 from April 2010 through August 2015. The SAIMI project has contributed a number of important results to programming abstractions that enable the orthogonal specification of implementation details in scientific codes. This final report summarizes the research that was funded by the SAIMI project.

97 MATHEMATICS AND COMPUTING↗

DAVIS: A direct algorithm for velocity-map imaging system

Here, we report a direct (non-iterative) algorithm to reconstruct the three-dimensional (3D) momentum-space picture of any charged particles collected with a velocity-map imaging system from the two-dimensional (2D) projected image captured by a position-sensitive detector. The technique consists of fitting the measured image with the 2D projection of a model 3D velocity distribution defined by the physics of the light-matter interaction. The meaningful angle-correlated information is first extracted from the raw data by expanding the image with a complete set of Legendre polynomials. Both the particle’s angular and energy distributions are then directly retrieved from the expansion coefficients. The algorithm is simple, easy to implement, fast, and explicitly takes into account the pixelization effect in the measurement.

74 ATOMIC AND MOLECULAR PHYSICS↗

SU-E-J-100: Reconstruction of Prompt Gamma Ray Three Dimensional SPECT Image From Boron Neutron Capture Therapy(BNCT)

Purpose: Purpose of paper is to confirm the feasibility of acquisition of three dimensional single photon emission computed tomography (SPECT) image from boron neutron capture therapy (BNCT) using Monte Carlo simulation. Methods: In case of simulation, the pixelated SPECT detector, collimator and phantom were simulated using Monte Carlo n particle extended (MCNPX) simulation tool. A thermal neutron source (<1 eV) was used to react with the boron uptake region (BUR) in the phantom. Each geometry had a spherical pattern, and three different BURs (A, B and C region, density: 2.08 g/cm3) were located in the middle of the brain phantom. The data from 128 projections for each sorting process were used to achieve image reconstruction. The ordered subset expectation maximization (OSEM) reconstruction algorithm was used to obtain a tomographic image with eight subsets and five iterations. The receiver operating characteristic (ROC) curve analysis was used to evaluate the geometric accuracy of reconstructed image. Results: The OSEM image was compared with the original phantom pattern image. The area under the curve (AUC) was calculated as the gross area under each ROC curve. The three calculated AUC values were 0.738 (A region), 0.623 (B region), and 0.817 (C region). The differences between length of centers of two boron regions and distance of maximum count points were 0.3 cm, 1.6 cm and 1.4 cm. Conclusion: The possibility of extracting a 3D BNCT SPECT image was confirmed using the Monte Carlo simulation and OSEM algorithm. The prospects for obtaining an actual BNCT SPECT image were estimated from the quality of the simulated image and the simulation conditions. When multiple tumor region should be treated using the BNCT, a reasonable model to determine how many useful images can be obtained from the SPECT could be provided to the BNCT facilities. This research was supported by the Leading Foreign Research Institute Recruitment Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, Information and Communication Technologies (ICT) and Future Planning (MSIP)(Grant No.200900420) and the Radiation Technology Research and Development program (Grant No.2013043498), Republic of Korea.

07 ISOTOPE AND RADIATION SOURCES↗

An Active Subspace Method for Accelerating Convergence in Delaunay-Based Optimization via Dimension Reduction

Delaunay-based derivative-free optimization, ∆DOGS, is an efficient and provably-convergent global optimization method for the problems which has computationally expensive objection function and the analytical expression for the objective function is not available. ∆-DOGS is a novel optimization scheme in the family of response surface methods (RSMs); however, it suffers from the curse of dimensionality since the computational cost increases dramatically as the number of design parameters increases. As a result, the number of design parameters in ∆-DOGS algorithm is relatively low (n.10). To avoid such problems, this paper proposes a combination of derivative-free optimization, seeking the global minimizer of an expensive and nonconvex objective function f(x) and active subspace method, detecting the directions of the most variability using evaluations of the gradient. The contribution of other directions to the objective function is bounded by a sufficiently small constant. This new algorithm iteratively applied Delaunay-based derivative-free optimization to seek the minimizer on the d-dimensional active subspace that has most function variation. Inverse mapping is needed to project data from active subspace to full-model for evaluating function values. This task is overcome by solving an inequality constrained problem that curves the response surface of the objective function. The test results show that this strategy is effective on a handful of optimization problems.

Bewley, Thomas R.↗

Metal artifact reduction in x-ray computed tomography (CT) by constrained optimization

Purpose: The streak artifacts caused by metal implants have long been recognized as a problem that limits various applications of CT imaging. In this work, the authors propose an iterative metal artifact reduction algorithm based on constrained optimization. Methods: After the shape and location of metal objects in the image domain is determined automatically by the binary metal identification algorithm and the segmentation of ''metal shadows'' in projection domain is done, constrained optimization is used for image reconstruction. It minimizes a predefined function that reflects a priori knowledge of the image, subject to the constraint that the estimated projection data are within a specified tolerance of the available metal-shadow-excluded projection data, with image non-negativity enforced. The minimization problem is solved through the alternation of projection-onto-convex-sets and the steepest gradient descent of the objective function. The constrained optimization algorithm is evaluated with a penalized smoothness objective. Results: The study shows that the proposed method is capable of significantly reducing metal artifacts, suppressing noise, and improving soft-tissue visibility. It outperforms the FBP-type methods and ART and EM methods and yields artifacts-free images. Conclusions: Constrained optimization is an effective way to deal with CT reconstruction with embedded metal objects. Although the method is presented in the context of metal artifacts, it is applicable to general ''missing data'' image reconstruction problems.

62 RADIOLOGY AND NUCLEAR MEDICINE↗