Search NASA⌕ Search

SEARCH · Search NASA

Results for “Signal processing 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 199 records · Page 11

SU-D-12A-01: An Inter-Projection Interpolation (IPI) Approach for the Synchronized Moving Grid (SMOG) to Reduce Dose in Cone Beam CT

Purpose: Synchronized moving grid is a promising technique to reduce scatter and ghost artifacts in cone beam computed tomography (CBCT). However, it requires 2 projections in the same gantry angle to obtain full information due to signal blockage by the grid. We proposed an inter-projection interpolation (IPI) method to estimate blocked signals, which may reduce the scan time and the dose. This study aims to provide a framework to achieve a balance between speed, dose and image quality. Methods: The IPI method is based on the hypothesis that an abrupt signal in a projection can be well predicted by the information in the two immediate neighboring projections if the gantry angle step is small. The study was performed on a Catphan and a head phantom. The SMOG was simulated by erasing the information (filling with “0”) of the areas in each projection corresponding to the grid. An IPI algorithm was applied on each projection to recover the erased information. FDK algorithm was used to reconstruct CBCT images for the IPI-processed projections, and compared with the original image in term of signal to noise ratio (SNR) measured in the whole reconstruction image range. The effect of gantry angle step was investigated by comparing the CBCT images from projection sets of various gantry intervals, with IPI-predicted projections to fill the missing projection in the interval. Results: The IPI procession time was 1.79s±0.53s for each projection. SNR after IPI was 29.0db and 28.1db for the Catphan and head phantom, respectively, comparing to 15.3db and 22.7db for an inpainting based interpolation technique. SNR was 28.3, 28.3, 21.8, 19.3 and 17.3 db for gantry angle intervals of 1, 1.5, 2, 2.5 and 3 degrees, respectively. Conclusion: IPI is feasible to estimate the missing information, and achieve an reasonable CBCT image quality with reduced dose and scan time. This study is supported by NIH/NCI grant 1R01CA166948-01.

60 APPLIED LIFE SCIENCES↗

Synchrophasor Data Correction under GPS Spoofing Attack: A State Estimation-Based Approach

GPS spoofing attack (GSA) has been shown to be one of the most imminent threats to almost all cyber-physical systems incorporated with the civilian GPS signal. Specifically, for our current agenda of the modernization of the power grid, this may greatly jeopardize the benefits provided by the pervasively installed phasor measurement units (PMU). In this paper, we consider the case where synchrophasor data from PMUs are compromised due to the presence of a single GSA, and show that it can be corrected by signal processing techniques. In particular, we introduce a statistical model for synchrophasorbased power system state estimation (SE), and then derive the spoofing-matched algorithms for synchrophasor data correction against GPS spoofing attack. Different testing scenarios in IEEE 14-, 30-, 57-, 118-bus systems are simulated to show the proposed algorithms’ performance on GSA detection and state estimation. Numerical results demonstrate that our proposed algorithms can consistently locate and correct the spoofed synchrophasor data with good accuracy as long as the system observability is satisfied. The accuracy of state estimation is significantly improved compared with the traditional weighted least square method and approaches the performance under the Genie-aided method.

Phasor measurement units, Global Positioning Syste↗

Resonant di-Higgs production at gravitational wave benchmarks: a collider study using machine learning

We perform a complementarity study of gravitational waves and colliders in the context of electroweak phase transitions choosing as our template the xSM model, which consists of the Standard Model augmented by a real scalar. We carefully analyze the gravitational wave signal at benchmark points compatible with a first order phase transition, taking into account subtle issues pertaining to the bubble wall velocity and the hydrodynamics of the plasma. In particular, we comment on the tension between requiring bubble wall velocities small enough to produce a net baryon number through the sphaleron process, and large enough to obtain appreciable gravitational wave production. For the most promising benchmark models, we study resonant di-Higgs production at the high-luminosity LHC using machine learning tools: a Gaussian process algorithm to jointly search for optimum cut thresholds and tuning hyperparameters, and a boosted decision trees algorithm to discriminate signal and background. The multivariate analysis on the collider side is able either to discover or provide strong statistical evidence of the benchmark points, opening the possibility for complementary searches for electroweak phase transitions in collider and gravitational wave experiments.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Pseudo-differential representation of the metaplectic transform and its application to fast algorithms

The metaplectic transform (MT), also known as the linear canonical transform, is a unitary integral mapping that is widely used in signal processing and can be viewed as a generalization of the Fourier transform. For a given function $ψ$ on an $N$-dimensional continuous space q , the MT of $ψ$ is parameterized by a rotation (or more generally, a linear symplectic transformation) of the 2$N$-dimensional phase space ( q,p ), where p is the wavevector space dual to q . In this study, we derive a pseudo-differential form of the MT. For small-angle rotations, or near-identity transformations of the phase space, it readily yields asymptotic differential representations of the MT, which are easy to compute numerically. Rotations by larger angles are implemented as successive applications of $K \gg 1$ small-angle MTs. The algorithm complexity scales as $O(KN^3N_p)$ where $N_p$ is the number of grid points. Here, we present a numerical implementation of this algorithm and discuss how to mitigate the associated numerical instabilities.

79 ASTRONOMY AND ASTROPHYSICS↗

Error minimizing algorithms for nearest eighbor classifiers

Stack Filters define a large class of discrete nonlinear filter first introd uced in image and signal processing for noise removal. In recent years we have suggested their application to classification problems, and investigated their relationship to other types of discrete classifiers such as Decision Trees. In this paper we focus on a continuous domain version of Stack Filter Classifiers which we call Ordered Hypothesis Machines (OHM), and investigate their relationship to Nearest Neighbor classifiers. We show that OHM classifiers provide a novel framework in which to train Nearest Neighbor type classifiers by minimizing empirical error based loss functions. We use the framework to investigate a new cost sensitive loss function that allows us to train a Nearest Neighbor type classifier for low false alarm rate applications. We report results on both synthetic data and real-world image data.

97 MATHEMATICS AND COMPUTING↗

SU-D-210-03: Limited-View Multi-Source Quantitative Photoacoustic Tomography

Purpose: This work is to investigate a novel limited-view multi-source acquisition scheme for the direct and simultaneous reconstruction of optical coefficients in quantitative photoacoustic tomography (QPAT), which has potentially improved signal-to-noise ratio and reduced data acquisition time. Methods: Conventional QPAT is often considered in two steps: first to reconstruct the initial acoustic pressure from the full-view ultrasonic data after each optical illumination, and then to quantitatively reconstruct optical coefficients (e.g., absorption and scattering coefficients) from the initial acoustic pressure, using multi-source or multi-wavelength scheme.Based on a novel limited-view multi-source scheme here, We have to consider the direct reconstruction of optical coefficients from the ultrasonic data, since the initial acoustic pressure can no longer be reconstructed as an intermediate variable due to the incomplete acoustic data in the proposed limited-view scheme. In this work, based on a coupled photo-acoustic forward model combining diffusion approximation and wave equation, we develop a limited-memory Quasi-Newton method (LBFGS) for image reconstruction that utilizes the adjoint forward problem for fast computation of gradients. Furthermore, the tensor framelet sparsity is utilized to improve the image reconstruction which is solved by Alternative Direction Method of Multipliers (ADMM). Results: The simulation was performed on a modified Shepp-Logan phantom to validate the feasibility of the proposed limited-view scheme and its corresponding image reconstruction algorithms. Conclusion: A limited-view multi-source QPAT scheme is proposed, i.e., the partial-view acoustic data acquisition accompanying each optical illumination, and then the simultaneous rotations of both optical sources and ultrasonic detectors for next optical illumination. Moreover, LBFGS and ADMM algorithms are developed for the direct reconstruction of optical coefficients from the acoustic data. Jing Feng and Hao Gao were partially supported by the NSFC (#11405105), the 973 Program (#2015CB856000) and the Shanghai Pujiang Talent Program (#14PJ1404500)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

An Easy Algorithm to Generate Colored Noise Sequences

The need for accurate and efficient simulation of the noise background arises in statistical significance tests for periodic signals buried in colored noise. This paper discusses techniques for generating colored-noise sequences which simulate processes with a given spectral density. Matlab routines based on the fast fractional difference algorithm are presented. These routines can create various stochastic models (e.g., first-order autoregressive (AR(1)), power law (PL), autoregressive fractionally integrated moving average ((1, d, 0)), and generalized Gauss Markov (GGM)) that serve as possible candidate null hypotheses to test against in various scenarios. Allan variance and power spectral density (PSD) show that our algorithms are accurate and efficient, and can be easily implemented for stationary noise models and non-stationary PLs with spectral indices up to 2. Our algorithms can also be extended to produce a non-stationary PL with a range-limited steeper PSD (spectral indices up to about 4) using a GGM approximation with a proper break frequency. The red-noise leakage effect on the periodogram is further discussed. The result shows that our GGM approximation has a potential for alleviating the red-noise leakage in the PSD estimates. The Timmer and Koenig procedure is also included for comparison.

79 ASTRONOMY AND ASTROPHYSICS↗

Efficient Parallel Sparse Symmetric Tucker Decomposition for High-Order Tensors

Tensor based methods are receiving renewed attention in recent years due to their prevalence in diverse real-world applications. There is considerable literature on tensor representations and algorithms for tensor decompositions, both for dense and sparse tensors. Many applications in hypergraph analytics, machine learning, psychometry, and signal processing result in tensors that are both sparse and symmetric, making it an important class for further study. Similar to the critical Tensor Times Matrix chain operation (TTMc) in general sparse tensors, the Sparse Symmetric Tensor Times Same Matrix chain (S3TTMc) operation is compute and memory intensive due to high tensor order and the associated factorial explosion in the number of non-zeros. In this work, we present a novel compressed storage format CSS for sparse symmetric tensors, along with an efficient parallel algorithm for the S3TTMc operation. We theoretically establish that S3TTMc on CSS achieves a better memory versus run-time trade-off compared to state-of-the-art implementations. We demonstrate experimental findings that confirm these results and achieve up to 2.9× speedup on synthetic and real datasets.

Shivakumar, Shruti↗

SU-E-P-31: Quantifying the Amount of Missing Tissue in a Digital Breast Tomosynthesis

Purpose: To automatically quantify the amount of missing tissue in a digital breast tomosynthesis system using four stair-stepped chest wall missing tissue gauges in the Tomophan™ from the Phantom Laboratory and image processing from Image Owl. Methods: The Tomophan™ phantom incorporates four stair-stepped missing tissue gauges by the chest wall, allowing measurement of missing chest wall in two different locations along the chest wall at two different heights. Each of the four gauges has 12 steps in 0.5 mm increments rising from the chest wall. An image processing algorithm was developed by Image Owl that first finds the two slices containing the steps then finds the signal through the highest step in all four gauges. Using the signal drop at the beginning of each gauge the distance to the end of the image gives the length of the missing tissue gauge in millimeters. Results: The Tomophan™ was imaged in digital breast tomosynthesis (DBT) systems from various vendors resulting in 46 cases used for testing. The results showed that on average 1.9 mm of 6 mm of the gauges are visible. A small focus group was asked to count the number of visible steps for each case which resulted in a good agreement between observer counts and computed data. Conclusion: First, the results indicate that the amount of missing chest wall can differ between vendors. Secondly it was shown that an automated method to estimate the amount of missing chest wall gauges agreed well with observer assessments. This finding indicates that consistency testing may be simplified using the Tomophan™ phantom and analysis by an automated image processing named Tomo QA. In general the reason for missing chest wall may be due to a function of the beam profile at the chest wall as DBT projects through the angular sampling. Research supported by Image Owl, Inc., The Phantom Laboratory, Inc. and Raforninn ehf; Mallozzi and Healy employed by The Phantom Laboratory, Inc.; Goodenough is a consultant to The Phantom Laboratory, Inc.; Fredriksson, Kristbjornsson, Olafsson, Oskarsdottir and Olafsdottir are employed by Raforninn, Ehf.

60 APPLIED LIFE SCIENCES↗

Bayesian inference for high confidence signal validation and sensor calibration assessment - 328

Online Monitoring (OLM) systems has been investigated for applications in the nuclear industry for the past two decades. These systems offer economic and technological advantages over the currently implemented time based testing methods for sensors and associated instrumentations. The advantages offered not only augment economic viability of current nuclear reactors but will be an inevitable change called for to suit the technologies of the advanced reactors (Gen III+). Irrespective, the acceptance of OLM into the regulatory structure in the U.S. is still hindered by technical and structural clarity on uncertainty quantification used by these systems. A Bayesian inference technique is implemented in the form of a residual model to quantify uncertainty in OLM predictions. The developed system used Gaussian processes to represent the OLM predictions and model inadequacy, the stationary representation of model based uncertainty. In addition, model selection techniques are used in conjunction with numerical methods such as Genetic Algorithm (GA) and Gibb's sampler to add robustness to the estimation model inadequacy, particularly in the presence of drifts and faulted conditions. The prediction model developed herein find applicability in fault detection, obtaining real values of processes after the onset of faults etc. Further development looks into the extension of current method for a multiple output scale implementation. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Spin-wave based realization of optical computing primitives

We use micromagnetic simulations to demonstrate that spin waves can perform optically inspired, non-Boolean computing algorithms. We propose and design coherent spin-wave sources and phase shifters, which act akin to the key components of an optical signal processing system. We show that the functionality of the proposed on-chip spin-wave based signal processing system is similar to known optical computing devices. We argue that such computing system can serve as a practical, energy efficient, and integrated component of nanoscale image processing systems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Performance Evaluation of an Intelligent Sensor Platform for Radiation Monitoring Applications

Accurate, rugged, and reliable radiation detection systems are important for area and environmental monitoring applications. The desire for spectroscopic capability has increased in monitoring aspects of the nuclear fuel cycle to provide fast characterization of the radiation profile of a situation, such as the planned or unplanned release of material. The reduction or elimination of having to conduct sampling for laboratory analysis can result in significant cost savings for an industry, government agency, or regulatory body. A new system, comprised of a NaI:Tl scintillator and a G-M tube, has been designed and tested, taking into account the following end-user requirements: ease-of-use, capability to network and supervise multiple units, compact form factor, low power consumption, versatility, and stability. The detector sizes were selected to accommodate a dose rate up to 1 Sv/hr. Several algorithms and analysis routines have been developed to incorporate these key needs without sacrificing on accuracy, dynamic range, nuclide identification, and sensitivity. This presentation will introduce the major hardware and software components of the platform, as well as the user interface and data analysis workflow. Key features of the hardware include an environmentally robust housing, low power signal processing electronics, patented LED-based gain stabilization, and an embedded processor for unattended instrument management and data analysis. New and improved algorithms for determining scintillator gamma dose rates, total integrated dose, and nuclide identification will be introduced. The two detector elements were modeled with MCNP and validated experimentally. The results of the radiological testing shall be presented including energy resolution, throughput, dose response, and minimum detectable activities. The dose response has been evaluated in simulations and with measurements to ensure accurate response with respect to energy spectrum of the dose field and direction of the incident radiation. Spectroscopy evaluations, such as nuclide detection probability and false alarm rates, were performed and comparisons to existing algorithms shall also be presented. (authors)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Sparse Symmetric Format for Tucker Decomposition

Tensor-based methods are receiving renewed attention in recent years due to their prevalence in diverse real-world applications. There is considerable literature on tensor representations and algorithms for tensor decompositions, both for dense and sparse tensors. Many applications in hypergraph analytics, machine learning, psychometry, and signal processing result in tensors that are both sparse and symmetric, making them an important class for further study. Similar to the critical Tensor Times Matrix chain operation (TTM c ) in general sparse tensors, the $\underline{S}$ parse $\underline{S}$ ymmetric $\underline{T}$ ensor $\underline{T}$ imes $\underline{S}$ ame $\underline{M}$ atrix $\underline{c}$ hain (S 3 TTM c ) operation is compute and memory intensive due to high tensor order and the associated factorial explosion in the number of non-zeros. We present the novel Compressed Sparse Symmetric (CSS) format for sparse symmetric tensors, along with an efficient parallel algorithm for the S 3 TTM c operation. We theoretically establish that S 3 TTM c on CSS achieves a better memory versus run-time trade-off compared to state-of-the-art implementations, and visualize the variation of the performance gap over the parameter space. We demonstrate experimental findings that confirm these results and achieve up to 2.72× speedup on synthetic and real datasets. The scaling of the algorithm on different test architectures is also showcased to highlight the effect of machine characteristics on algorithm performance.

42 ENGINEERING↗

Assessment of volumetric noise and resolution performance for linear and nonlinear CT reconstruction methods

Purpose: For nonlinear iterative image reconstructions (IR), the computed tomography (CT) noise and resolution properties can depend on the specific imaging conditions, such as lesion contrast and image noise level. Therefore, it is imperative to develop a reliable method to measure the noise and resolution properties under clinically relevant conditions. This study aimed to develop a robust methodology to measure the three-dimensional CT noise and resolution properties under such conditions and to provide guidelines to achieve desirable levels of accuracy and precision. Methods: The methodology was developed based on a previously reported CT image quality phantom. In this methodology, CT noise properties are measured in the uniform region of the phantom in terms of a task-based 3D noise-power spectrum (NPS{sub task}). The in-plane resolution properties are measured in terms of the task transfer function (TTF) by applying a radial edge technique to the rod inserts in the phantom. The z-direction resolution properties are measured from a supplemental phantom, also in terms of the TTF. To account for the possible nonlinearity of IR, the NPS{sub task} is measured with respect to the noise magnitude, and the TTF with respect to noise magnitude and edge contrast. To determine the accuracy and precision of the methodology, images of known noise and resolution properties were simulated. The NPS{sub task} and TTF were measured on the simulated images and compared to the truth, with criteria established to achieve NPS{sub task} and TTF measurements with <10% error. To demonstrate the utility of this methodology, measurements were performed on a commercial CT system using five dose levels, two slice thicknesses, and three reconstruction algorithms (filtered backprojection, FBP; iterative reconstruction in imaging space, IRIS; and sinogram affirmed iterative reconstruction with strengths of 5, SAFIRE5). Results: To achieve NPS{sub task} measurements with <10% error, the number of regions of interest needed to be greater than 65. To achieve TTF measurements with <10% error, the contrast-to-noise ratio of the edge needed to be ≥15, achievable by averaging multiple slices across the same edge. The NPS{sub task} measured on a commercial CT system showed IR's reduced noise (IRIS, 30% and SAFIRE5, 55%) and “waxier” texture (peak frequencies: FBP, 0.25 mm{sup −1}; IRIS, 0.23 mm{sup −1}; and SAFIRE5, 0.16 mm{sup −1}). The TTF measured within the axial plane showed improved in-plane resolution with SAFIRE5 at the TTF 50% frequency, f{sub 50} (FBP, 0.36–0.41 mm{sup −1}; SAFIRE5, 0.37–0.46 mm{sup −1}). The TTF measured along the axial direction showed improved z-direction resolution with thinner slice thickness (f{sub 50}: 0.6 mm, 0.35–0.79 mm{sup −1}; 1.5 mm, 0.22–0.3 mm{sup −1}) and with SAFIRE5 (f{sub 50}: FBP, 0.35–0.52 mm{sup −1}; SAFIRE5, 0.42–0.79 mm{sup −1}). Both in-plane and z-direction resolution of SAFIRE5 showed strong dependency on contrast, reflecting SAFIRE5's nonlinearity. Conclusions: A methodology was developed to measure three-dimensional CT noise and resolution properties for iterative reconstruction, especially at challenging measurement conditions with low contrast and high image noise. The methodology also demonstrated its utility for evaluating commercial CT systems.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

SU-F-P-48: The Quantitative Evaluation and Comparison of Image Distortion and Loss of X-Ray Images Between Anti-Scattered Grid and Moire Compensation Processing in Digital Radiography

Purpose: To quantitatively analyze the influence image processing for Moire elimination has in digital radiography by comparing the image acquired from optimized anti-scattered grid only and the image acquired from software processing paired with misaligned low-frequency grid. Methods: Special phantom, which does not create scattered radiation, was used to acquire non-grid reference images and they were acquired without any grids. A set of images was acquired with optimized grid, aligned to pixel of a detector and other set of images was acquired with misaligned low-frequency grid paired with Moire elimination processing algorithm. X-ray technique used was based on consideration to Bucky factor derived from non-grid reference images. For evaluation, we analyze by comparing pixel intensity of acquired images with grids to that of reference images. Results: When compared to image acquired with optimized grid, images acquired with Moire elimination processing algorithm showed 10 to 50% lower mean contrast value of ROI. Severe distortion of images was found with when the object’s thickness was measured at 7 or less pixels. In this case, contrast value measured from images acquired with Moire elimination processing algorithm was under 30% of that taken from reference image. Conclusion: This study shows the potential risk of Moire compensation images in diagnosis. Images acquired with misaligned low-frequency grid results in Moire noise and Moire compensation processing algorithm used to remove this Moire noise actually caused an image distortion. As a result, fractures and/or calcifications which are presented in few pixels only may not be diagnosed properly. In future work, we plan to evaluate the images acquired without grid but based on 100% image processing and the potential risks it possesses.

60 APPLIED LIFE SCIENCES↗

Robotics

Mark Buckner wants to help machines see objects the way humans do, and he's also mentoring the next generation of scientists and engineers through FIRST Robotics.

42 ENGINEERING↗

Demand Response Optimization and Management System for Real-TIme (DROMS-RT)

To design and demonstrate DROMS-RT, a highly distributed Demand Response Optimization and Management System for Real-Time (DROMS-RT) power flow control to support large scale integration of distributed renewable generation into the grid. AutoGrid developed a novel control and communications platform to allow highly dispatchable demand response (DR) services in time frames suitable for providing ancillary services to the transmission grid. These services will be substantially less expensive and more efficient than other forms of ancillary services options currently available to manage the intermittency associated with large-scale renewable integration. DROMSRT successfully leveraged Automated Demand Response (ADR) by fundamentally re-thinking the architecture of the DR platform from the ground up and by developing innovative new technologies in a number of areas related to DR. DROMS-RT leveraged the low-cost, open, interoperable DR signaling technology, OpenADR, and low-cost, internet-protocol based telemetry solutions to reduce the cost of hardware. This allowed DROMS-RT to provide dynamic price signals to millions of OpenADR clients. Statistically rigorous signal processing techniques were developed to reliably detect even small load reductions in the presence of noisy baseline profiles. Novel forecasting engines based on modern online machine learning algorithms enabled accurate individualized forecasts for customer loads in the presence of dynamic pricing signals, and a real-time decision engines enabled continuous optimization and optimal dispatch of DR resources across a large portfolio of heterogeneous loads that respond at varying time-scales. Moreover, the real-time optimization conducted by the decision engine can utilize grid physics to maximize load reduction at the transmission system in addition to the distribution sites, for more efficient grid operation. Finally, the Software-as-a-Service (SaaS) availability of the DROMS-RT platform has reduced the cost of deployment and enable participation of small commercial and residential customers in DR who otherwise would not be able to do so.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Iterative image-domain decomposition for dual-energy CT

Purpose: Dual energy CT (DECT) imaging plays an important role in advanced imaging applications due to its capability of material decomposition. Direct decomposition via matrix inversion suffers from significant degradation of image signal-to-noise ratios, which reduces clinical values of DECT. Existing denoising algorithms achieve suboptimal performance since they suppress image noise either before or after the decomposition and do not fully explore the noise statistical properties of the decomposition process. In this work, the authors propose an iterative image-domain decomposition method for noise suppression in DECT, using the full variance-covariance matrix of the decomposed images. Methods: The proposed algorithm is formulated in the form of least-square estimation with smoothness regularization. Based on the design principles of a best linear unbiased estimator, the authors include the inverse of the estimated variance-covariance matrix of the decomposed images as the penalty weight in the least-square term. The regularization term enforces the image smoothness by calculating the square sum of neighboring pixel value differences. To retain the boundary sharpness of the decomposed images, the authors detect the edges in the CT images before decomposition. These edge pixels have small weights in the calculation of the regularization term. Distinct from the existing denoising algorithms applied on the images before or after decomposition, the method has an iterative process for noise suppression, with decomposition performed in each iteration. The authors implement the proposed algorithm using a standard conjugate gradient algorithm. The method performance is evaluated using an evaluation phantom (Catphan©600) and an anthropomorphic head phantom. The results are compared with those generated using direct matrix inversion with no noise suppression, a denoising method applied on the decomposed images, and an existing algorithm with similar formulation as the proposed method but with an edge-preserving regularization term. Results: On the Catphan phantom, the method maintains the same spatial resolution on the decomposed images as that of the CT images before decomposition (8 pairs/cm) while significantly reducing their noise standard deviation. Compared to that obtained by the direct matrix inversion, the noise standard deviation in the images decomposed by the proposed algorithm is reduced by over 98%. Without considering the noise correlation properties in the formulation, the denoising scheme degrades the spatial resolution to 6 pairs/cm for the same level of noise suppression. Compared to the edge-preserving algorithm, the method achieves better low-contrast detectability. A quantitative study is performed on the contrast-rod slice of Catphan phantom. The proposed method achieves lower electron density measurement error as compared to that by the direct matrix inversion, and significantly reduces the error variation by over 97%. On the head phantom, the method reduces the noise standard deviation of decomposed images by over 97% without blurring the sinus structures. Conclusions: The authors propose an iterative image-domain decomposition method for DECT. The method combines noise suppression and material decomposition into an iterative process and achieves both goals simultaneously. By exploring the full variance-covariance properties of the decomposed images and utilizing the edge predetection, the proposed algorithm shows superior performance on noise suppression with high image spatial resolution and low-contrast detectability.

62 RADIOLOGY AND NUCLEAR MEDICINE↗