Technical Note: Iterative megavoltage CT (MVCT) reconstruction using block-matching 3D-transform (BM3D) regularization
Not provided.
SEARCH · Search NASA
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.
Not provided.
The empirical scaling for the H-mode power threshold in tokamaks has been revisited using a database with threshold data from machines with a metallic first wall as part of International Tokamak Physics Activity (ITPA) task TC-26. The database contains discharges from ASDEX Upgrade (AUG) (W), JET (Be/W) and Alcator C-Mod (Mo). This was motivated by reports that in like-for-like discharges the power threshold was reduced by approximately 30% after the change from carbon based to metallic first wall materials on AUG (Ryter et al 2013 Nucl. Fusion 53 113003) and JET (Maggi et al 2014 Nucl. Fusion 54 023007). The database contains L–H transition data for all hydrogen isotopes and mixtures, including T and DT from the recent JET campaigns. Compared to the ITPA 2008 scaling (Martin et al 2008 J. Phys.: Conf. Ser. 123 012033), the metal wall scaling has a smaller magnetic field exponent but a larger density exponent. We present an additional parameter to capture the strong dependence of the L–H power threshold (approx. factor 2) on the magnetic configuration in the divertor on JET. The scaling recovers the approximate inverse isotope mass scaling of the threshold power. Alternative scalings involving the plasma current and poloidal magnetic field are explored. Despite the reduction in threshold observed earlier, the scalings based on the metal wall database do not necessarily extrapolate to a lower threshold for ITER compared to the ITPA 2008 scaling, especially at high density. The divertor configuration effect induces the largest uncertainty in the extrapolation.
Not provided.
Plug-and-play priors (PnP) is a powerful framework for regularizing imaging inverse problems by using advanced denoisers within an iterative algorithm. Recent experimental evidence suggests that PnP algorithms achieve state-of-the-art performance in a range of imaging applications. Here, we introduce a new online PnP algorithm based on the proximal gradient method (PGM). The proposed algorithm uses only a subset of measurements at every iteration, which makes it scalable to very large datasets. We present a new theoretical convergence analysis, for both batch and online variants of PnP-PGM, for denoisers that do not necessarily correspond to proximal operators. We also present simulations illustrating the applicability of the algorithm to image reconstruction in diffraction tomography. Finally, the results in this paper have the potential to expand the applicability of the PnP framework to very large datasets.
SHEBO (surrogate optimization of problems with hidden constraints and expensive black-box objectives) is an efficient optimization algorithm that employs surrogate models to solve computationally expensive black-box simulation optimization problems that have hidden constraints. Hidden constraints are encountered when the objective function evaluation does not return a value for a parameter vector. These constraints are often encountered in optimization problems in which the objective function is computed by a black-box simulation code. SHEBO uses a combination of local and global search strategies together with an evaluability prediction function and a dynamically adjusted evaluability threshold to iteratively select new sample points.
In this paper we design high rate protograph based LDPC codes suitable for binary erasure channels. To simplify the encoder and decoder implementation for high data rate transmission, the structure of codes are based on protographs and circulants. These LDPC codes can improve data link and network layer protocols in support of communication networks. Two classes of codes were designed. One class is designed for large block sizes with an iterative decoding threshold that approaches capacity of binary erasure channels. The other class is designed for short block sizes based on maximizing minimum stopping set size. For high code rates and short blocks the second class outperforms the first class.
A recently developed method of constructing protograph-based low-density parity-check (LDPC) codes provides for low iterative decoding thresholds and minimum distances proportional to block sizes, and can be used for various code rates. A code constructed by this method can have either fixed input block size or fixed output block size and, in either case, provides rate compatibility. The method comprises two submethods: one for fixed input block size and one for fixed output block size. The first mentioned submethod is useful for applications in which there are requirements for rate-compatible codes that have fixed input block sizes. These are codes in which only the numbers of parity bits are allowed to vary. The fixed-output-blocksize submethod is useful for applications in which framing constraints are imposed on the physical layers of affected communication systems. An example of such a system is one that conforms to one of many new wireless-communication standards that involve the use of orthogonal frequency-division modulation
A method of constructing certain low-density parity-check (LDPC) codes by use of relatively simple loop-free coding modules has been developed. The subclasses of LDPC codes to which the method applies includes accumulate-repeat-accumulate (ARA) codes, accumulate-repeat-check-accumulate codes, and the codes described in Accumulate-Repeat-Accumulate-Accumulate Codes (NPO-41305), NASA Tech Briefs, Vol. 31, No. 9 (September 2007), page 90. All of the affected codes can be characterized as serial/parallel (hybrid) concatenations of such relatively simple modules as accumulators, repetition codes, differentiators, and punctured single-parity check codes. These are error-correcting codes suitable for use in a variety of wireless data-communication systems that include noisy channels. These codes can also be characterized as hybrid turbolike codes that have projected graph or protograph representations (for example see figure); these characteristics make it possible to design high-speed iterative decoders that utilize belief-propagation algorithms. The present method comprises two related submethods for constructing LDPC codes from simple loop-free modules with circulant permutations. The first submethod is an iterative encoding method based on the erasure-decoding algorithm. The computations required by this method are well organized because they involve a parity-check matrix having a block-circulant structure. The second submethod involves the use of block-circulant generator matrices. The encoders of this method are very similar to those of recursive convolutional codes. Some encoders according to this second submethod have been implemented in a small field-programmable gate array that operates at a speed of 100 megasymbols per second. By use of density evolution (a computational- simulation technique for analyzing performances of LDPC codes), it has been shown through some examples that as the block size goes to infinity, low iterative decoding thresholds close to channel capacity limits can be achieved for the codes of the type in question having low maximum variable node degrees. The decoding thresholds in these examples are lower than those of the best-known unstructured irregular LDPC codes constrained to have the same maximum node degrees. Furthermore, the present method enables the construction of codes of any desired rate with thresholds that stay uniformly close to their respective channel capacity thresholds.
Digital communication coding methods are shown, which generate certain types of low-density parity-check (LDPC) codes built from protographs. A first method creates protographs having the linear minimum distance property and comprising at least one variable node with degree less than 3. A second method creates families of protographs of different rates, all having the linear minimum distance property, and structurally identical for all rates except for a rate-dependent designation of certain variable nodes as transmitted or non-transmitted. A third method creates families of protographs of different rates, all having the linear minimum distance property, and structurally identical for all rates except for a rate-dependent designation of the status of certain variable nodes as non-transmitted or set to zero. LDPC codes built from the protographs created by these methods can simultaneously have low error floors and low iterative decoding thresholds, and families of such codes of different rates can be decoded efficiently using a common decoding architecture.
Digital communication coding methods are shown, which generate certain types of low-density parity-check (LDPC) codes built from protographs. A first method creates protographs having the linear minimum distance property and comprising at least one variable node with degree less than 3. A second method creates families of protographs of different rates, all structurally identical for all rates except for a rate-dependent designation of certain variable nodes as transmitted or non-transmitted. A third method creates families of protographs of different rates, all structurally identical for all rates except for a rate-dependent designation of the status of certain variable nodes as non-transmitted or set to zero. LDPC codes built from the protographs created by these methods can simultaneously have low error floors and low iterative decoding thresholds.
Abstract In ITER, pellets are calculated to require more than 8 times the mass than currently planned to reliably trigger edge-localized modes (ELMs). Unmitigated heat flux impulses from ELMs are intolerable in ITER at full power and current. Therefore, ITER operation relies on multiple approaches to control ELM heat fluxes. One method is pellet ELM pacing to instigate small rapid ELMs with low heat flux. Predicting the performance of pellet pacing is critical for ITER, which is expected to operate in a regime with a low-collisionality, peeling-limited pedestal. However, to trigger ELMs the local pressure increase in the expanding pellet cloud pushes the equilibrium over the ballooning stability limit. In this work, linear and nonlinear M3D-C1 simulations are used to predict pellet mass thresholds in DIII-D discharges and ITER scenarios with peeling-limited pedestals. It is found that the distance of the equilibrium’s operational point from the ballooning branch of the pedestal stability boundary strongly changes thresholds. Linear M3D-C1 simulations find a strong dependence of the pellet mass threshold on the poloidal injection location for ITER’s 15 MA, Q = 10 scenario. The required pellet mass at the planned injection locations is 8 to 17 times larger than currently considered. However, such linear simulations do not include pellet ablation physics or time evolution of density and temperature. A new scheme of 2D nonlinear simulations, coupled with linear stability analysis at various steps throughout the nonlinear time evolution, was developed to include such physics and improve on the linear results. These new nonlinear-to-linear simulations confirm previous findings. This result suggests that pellet ELM triggering in ITER could require pellets much larger than those currently planned, which makes ELM-pacing operationally challenging. On the other hand, fueling pellets injected from the high-field side will likely not unintentionally trigger ELMs in an otherwise ELM-stable plasma.
We provide a prescription called ThickBrick to train optimal machine-learning-based event selectors and categorizers that maximize the statistical significance of a potential signal excess in high energy physics (HEP) experiments, as quantified by any of six different performance measures. For analyses where the signal search is performed in the distribution of some event variables, our prescription ensures that only the information complementary to those event variables is used in event selection and categorization. This eliminates a major misalignment with the physics goals of the analysis (maximizing the significance of an excess) that exists in the training of typical ML-based event selectors and categorizers. In addition, this decorrelation of event selectors from the relevant event variables prevents the background distribution from becoming peaked in the signal region as a result of event selection, thereby ameliorating the challenges imposed on signal searches by systematic uncertainties. Our event selectors (categorizers) use the output of machine-learning-based classifiers as input and apply optimal selection cutoffs (categorization thresholds) that are functions of the event variables being analyzed, as opposed to flat cutoffs (thresholds). These optimal cutoffs and thresholds are learned iteratively, using a novel approach with connections to Lloyd’s k-means clustering algorithm. We provide a public, Python implementation of our prescription, also called ThickBrick, along with usage examples.
High-resolution near-surface imaging has important applications in civil engineering, infrastructure inspection, military threat detection, geological characterization, and lunar and planetary exploration. Zero-offset, singlechannel ground penetrating radar (GPR) imaging is an established technique for near-surface target imaging and sensing but often suffers from low spatial resolution and imaging artifacts, especially of deep structures. In response, we formulate the GPR imaging as a dual-sparsity optimization problem, and develop a super-resolution electromagnetic imaging method based on a fast iterative shrinkage-thresholding algorithm. We develop our GPR imaging method in the framework of electromagnetic exploding-reflectors simulation theory, therefore the imaging method is computationally efficient. In this work, we demonstrate through synthetic and field data examples that our method can produce sharper, more reliable images with fewer artifacts compared with single-pass reverse-time migration GPR method, thus leading to improved near-surface interpretation and object identification.
Compliance of member States to the Treaty on the Non-Proliferation of Nuclear Weapons is monitored through nuclear safeguards. The Passive Gamma Emission Tomography (PGET) system is a novel instrument developed within the framework of the International Atomic Energy Agency (IAEA) project JNT 1510, which included the European Commission, Finland, Hungary and Sweden. The PGET is used for the verification of spent nuclear fuel stored in water pools. Advanced image reconstruction techniques are crucial for obtaining high-quality cross-sectional images of the spent-fuel bundle to allow inspectors of the IAEA to monitor nuclear material and promptly identify its diversion. In this work, we have developed a software suite to accurately reconstruct the spent-fuel cross sectional image, automatically identify present fuel rods, and estimate their activity. Unique image reconstruction challenges are posed by the measurement of spent fuel, due to its high activity and the self-attenuation. While the former is mitigated by detector physical collimation, we implemented a linear forward model to model the detector responses to the fuel rods inside the PGET, to account for the latter. The image reconstruction is performed by solving a regularized linear inverse problem using the fast-iterative shrinkage-thresholding algorithm. We have also implemented the traditional filtered back projection (FBP) method based on the inverse Radon transform for comparison and applied both methods to reconstruct images of simulated mockup fuel assemblies. Higher image resolution and fewer reconstruction artifacts were obtained with the inverse-problem approach, with the mean-square-error reduced by 50%, and the structural-similarity improved by 200%. We then used a convolutional neural network (CNN) to automatically identify the bundle type and extract the pin locations from the images; the estimated activity levels finally being compared with the ground truth. The proposed computational methods accurately estimated the activity levels of the present pins, with an associated uncertainty of approximately 5%.
The perturbed ion temperature and toroidal flow were measured in rotating Neoclassical Tearing Modes (NTM) in a tokamak for the first time. These toroidally and radially resolved profiles were obtained by impurity ion spectroscopy in a 2,1 NTM in DIII-D. In agreement with drift-kinetic simulations, the electron temperature profile is flat, while the ion temperature gradient is restored across the magnetic island O-point in the presence of fast ions; the perturbed flow has minima in the O-points and maxima at the X-points. Furthermore, these measurements provide the first confirmation of the theoretically expected ion temperature and flow response to a magnetic island needed to predict the NTM on set threshold scaling for ITER and other future tokamaks.
The most common source of transformer failure is in the insulation, and the most prevalent warning signal for insulation weakness is partial discharge (PD). Locating the positions of these partial discharges would help repair the transformer to prevent failures. This work investigates algorithms that could be deployed to locate the position of a PD event using data from ultra-high frequency (UHF) sensors inside the transformer. These algorithms typically proceed in two steps: first determining the signal arrival time, and then locating the position based on time differences. This paper reviews available methods for each task and then propose new algorithms: a convolutional iterative filter with thresholding (CIFT) to determine the signal arrival time and a reference table of travel times to resolve the source location. The effectiveness of these algorithms are tested with a set of laboratory-triggered PD events and two sets of simulated PD events inside transformers in production use. Tests show the new approach provides more accurate locations than the best-known data analysis algorithms, and the difference is particularly large, 3.7X, when the signal sources are far from sensors.
As climate change increases the severity and frequency of extreme weather events in the tropics, it is vital for the safety of local communities and the health of ecosystems to monitor seasonal inundation. Forested inundation affects the ability of forested wetlands to provide ecosystem services, such as flood mitigation, water filtration, carbon storage, and erosion mitigation. While ground-based monitoring has traditionally been used to map inundation extent, those methods are costly and time-intensive. The NASA DEVELOP team focused on seasonal inundation throughout 2008 in the Maya Forest, when changes in inundation were drastic. To monitor seasonal inundation, our team used in situ field data and Earth observations from Landsat 7 Enhanced Thematic Mapper (ETM+), Advanced Land Observing Satellite (ALOS) Phased Array type L-band Synthetic Aperture Radar (PALSAR) 1, Shuttle Radar Topography Mission (SRTM), and products from the Ice, Cloud, and Land Elevation Satellite (ICESat). The team applied a Random Forest algorithm to Landsat 7 imagery, generating an object-level land cover classification with an overall accuracy of 72.1% and forest class with 100% recall and 78% precision. The team applied L-band backscatter thresholds from existing literature to forest-masked ALOS imagery and refined the thresholds in an iterative process using field data and hydrology models to delineate seasonal inundation extent. These publicly available data products help end users from Belize’s Land Information Center (LIC) and Forest Department, Guatemala’s Center for Monitoring and Evaluation (CEMEC), and Mexico’s El Colegio de la Frontera Sur (ECOSUR) to inform land management and protect community infrastructure.
The recent deuterium–tritium campaign in JET-ILW (DTE2) has provided a unique opportunity to study the isotope dependence of the L-H power threshold in an ITER-like wall environment (Be wall and W divertor). Here we present results from dedicated L-H transition experiments at JET-ILW, documenting the power threshold in tritium and deuterium–tritium plasmas, comparing them with the matching deuterium and hydrogen datasets. From earlier experiments in JET-ILW it is known that as plasma isotopic composition changes from deuterium, through varying deuterium/hydrogen concentrations, to pure hydrogen, the value of the line averaged density at which the threshold is minimum, ${\bar n_{{\text{e}},{\text{min}}}}$, increases, leading us to expect that ${\bar n_{{\text{e}},{\text{min}}}}$(T) < ${\bar n_{{\text{e}},{\text{min}}}}$(DT) < ${\bar n_{{\text{e}},{\text{min}}}}$(D) < ${\bar n_{{\text{e}},{\text{min}}}}$(H). The new power threshold data confirms these expectations in most cases, with the corresponding ordering of the minimum power thresholds. We present a comparison of this data to power threshold scalings, used for extrapolation to future devices such as ITER and DEMO.