Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “alternating minimization”

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 19 records

A Note on Alternating Minimization Algorithm for the Matrix Completion Problem

Here, we consider the problem of reconstructing a low-rank matrix from a subset of its entries and analyze two variants of the so-called alternating minimization algorithm, which has been proposed in the past.We establish that when the underlying matrix has rank one, has positive bounded entries, and the graph underlying the revealed entries has diameter which is logarithmic in the size of the matrix, both algorithms succeed in reconstructing the matrix approximately in polynomial time starting from an arbitrary initialization.We further provide simulation results which suggest that the second variant which is based on the message passing type updates performs significantly better.

97 MATHEMATICS AND COMPUTING↗

Matrix Completion Using Alternating Minimization for Distribution System State Estimation

This paper examines the problem of state estimation in power distribution systems under low-observability conditions. The recently proposed constrained matrix completion method which combines the standard matrix completion method and power flow constraints has been shown to be effective in estimating voltage phasors under low-observability conditions using single-snapshot information. However, the method requires solving a semidefinite programming (SDP) problem, which becomes computationally infeasible for large systems and if multiple-snapshot (time-series) information is used. This paper proposes an efficient algorithm to solve the constrained matrix completion problem with time-series data. This algorithm is based on reformulating the matrix completion problem as a bilinear (non-convex) optimization problem, and applying the alternating minimization algorithm to solve this problem. This paper proves the summable convergence of the proposed algorithm, and demonstrates its efficacy and scalability via IEEE 123-bus system and a real utility feeder system. This paper also explores the value of adding more data from the history in terms of computation time and estimation accuracy.

41 EE - Solar Energy Technologies Office (EE-4S)↗

Matrix Completion Using Alternating Minimization for Distribution System State Estimation: Preprint

This paper examines the problem of state estimation in power distribution systems under low-observability conditions. The recently proposed constrained matrix completion method which combines the standard matrix completion method and power flow constraints has been shown to be effective in estimating voltage phasors under low-observability conditions using single-snapshot information. However, the method requires solving a semidefinite programming (SDP) problem, which becomes computationally infeasible for large systems and if multiple-snapshot (time-series) information is used. This paper proposes an efficient algorithm to solve the constrained matrix completion problem with time-series data. This algorithm is based on reformulating the matrix completion problem as a bilinear (non-convex) optimization problem, and applying the alternating minimization algorithm to solve this problem. This paper proves the summable convergence of the proposed algorithm, and demonstrates its efficacy and scalability via IEEE 123-bus system and a real utility feeder system. This paper also explores the value of adding more data from the history in terms of computation time and estimation accuracy.

41 EE - Solar Energy Technologies Office (EE-4S)↗

Noise-resolution tradeoffs in x-ray CT imaging: A comparison of penalized alternating minimization and filtered backprojection algorithms

Purpose: In comparison with conventional filtered backprojection (FBP) algorithms for x-ray computed tomography (CT) image reconstruction, statistical algorithms directly incorporate the random nature of the data and do not assume CT data are linear, noiseless functions of the attenuation line integral. Thus, it has been hypothesized that statistical image reconstruction may support a more favorable tradeoff than FBP between image noise and spatial resolution in dose-limited applications. The purpose of this study is to evaluate the noise-resolution tradeoff for the alternating minimization (AM) algorithm regularized using a nonquadratic penalty function. Methods: Idealized monoenergetic CT projection data with Poisson noise were simulated for two phantoms with inserts of varying contrast (7%-238%) and distance from the field-of-view (FOV) center (2-6.5 cm). Images were reconstructed for the simulated projection data by the FBP algorithm and two penalty function parameter values of the penalized AM algorithm. Each algorithm was run with a range of smoothing strengths to allow quantification of the noise-resolution tradeoff curve. Image noise is quantified as the standard deviation in the water background around each contrast insert. Modulation transfer functions (MTFs) were calculated from six-parameter model fits to oversampled edge-spread functions defined by the circular contrast-insert edges as a metric of local resolution. The integral of the MTF up to 0.5 lp/mm was adopted as a single-parameter measure of local spatial resolution. Results: The penalized AM algorithm noise-resolution tradeoff curve was always more favorable than that of the FBP algorithm. While resolution and noise are found to vary as a function of distance from the FOV center differently for the two algorithms, the ratio of noises when matching the resolution metric is relatively uniform over the image. The ratio of AM-to-FBP image variances, a predictor of dose-reduction potential, was strongly dependent on the shape of the AM's nonquadratic penalty function and was also strongly influenced by the contrast of the insert for which resolution is quantified. Dose-reduction potential, reported here as the fraction (%) of FBP dose necessary for AM to reconstruct an image with comparable noise and resolution, for one penalty parameter value of the AM algorithm was found to vary from 70% to 50% for low-contrast and high-contrast structures, respectively, and from 70% to 10% for the second AM penalty parameter value. However, the second penalty, AM-700, was found to suffer from poor low-contrast resolution when matching the high-contrast resolution metric with FBP. Conclusions: The results of this simulation study imply that penalized AM has the potential to reconstruct images with similar noise and resolution using a fraction (10%-70%) of the FBP dose. However, this dose-reduction potential depends strongly on the AM penalty parameter and the contrast magnitude of the structures of interest. In addition, the authors' results imply that the advantage of AM can be maximized by optimizing the nonquadratic penalty function to the specific imaging task of interest. Future work will extend the methods used here to quantify noise and resolution in images reconstructed from real CT data.

60 APPLIED LIFE SCIENCES↗

Denoising Poisson phaseless measurements via orthogonal dictionary learning

Phaseless diffraction measurements recorded by CCD detectors are often affected by Poisson noise. In this paper, we propose a dictionary learning model by employing patches based sparsity in order to denoise such Poisson phaseless measurements. The model consists of three terms: (i) A representation term by an orthogonal dictionary, (ii) an L 0 pseudo norm of the coefficient matrix, and (iii) a Kullback-Leibler divergence term to fit phaseless Poisson data. Fast alternating minimization method (AMM) and proximal alternating linearized minimization (PALM) are adopted to solve the proposed model, and especially the theoretical guarantee of the convergence of PALM is provided. The subproblems for these two algorithms both have fast solvers, and indeed, the solutions for the sparse coding and dictionary updating both have closed forms due to the orthogonality of learned dictionaries. Numerical experiments for phase retrieval using coded diffraction and ptychographic patterns are conducted to show the efficiency and robustness of proposed methods, which, by preserving texture features, produce visually and quantitatively improved restored images compared with other phase retrieval algorithms without regularization and local sparsity promoting algorithms.

97 MATHEMATICS AND COMPUTING↗

Prospects for in vivo estimation of photon linear attenuation coefficients using postprocessing dual-energy CT imaging on a commercial scanner: Comparison of analytic and polyenergetic statistical reconstruction algorithms

Purpose: Accurate patient-specific photon cross-section information is needed to support more accurate model-based dose calculation for low energy photon-emitting modalities in medicine such as brachytherapy and kilovoltage x-ray imaging procedures. A postprocessing dual-energy CT (pDECT) technique for noninvasivein vivo estimation of photon linear attenuation coefficients has been experimentally implemented on a commercial CT scanner and its accuracy assessed in idealized phantom geometries. Methods: Eight test materials of known composition and density were used to compare pDECT-estimated linear attenuation coefficients to NIST reference values over an energy range from 10 keV to 1 MeV. As statistical image reconstruction (SIR) has been shown to reconstruct images with less random and systematic error than conventional filtered backprojection (FBP), the pDECT technique was implemented with both an in-house polyenergetic SIR algorithm, alternating minimization (AM), as well as a conventional FBP reconstruction algorithm. Improvement from increased spectral separation was also investigated by filtering the high-energy beam with an additional 0.5 mm of tin. The law of propagated uncertainty was employed to assess the sensitivity of the pDECT process to errors in reconstructed images. Results: Mean pDECT-estimated linear attenuation coefficients for the eight test materials agreed within 1% of NIST reference values for energies from 1 MeV down to 30 keV, with mean errors rising to between 3% and 6% at 10 keV, indicating that the method is unbiased when measurement and calibration phantom geometries are matched. Reconstruction with FBP and AM algorithms conferred similar mean pDECT accuracy. However, single-voxel pDECT estimates reconstructed on a 1 × 1 × 3 mm{sup 3} grid are shown to be highly sensitive to reconstructed image uncertainty; in some cases pDECT attenuation coefficient estimates exhibited standard deviations on the order of 20% around the mean. Reconstruction with the statistical AM algorithm led to standard deviations roughly 40% to 60% less than FBP reconstruction. Additional tin filtration of the high energy beam exhibits similar pDECT estimation accuracy as the unfiltered beam, even when scanning with only 25% of the dose. Using the law of propagated uncertainty, low Z materials are found to be more sensitive to image reconstruction errors than high Z materials. Furthermore, it is estimated that reconstructed CT image uncertainty must be limited to less than 0.25% to achieve a target linear-attenuation coefficient estimation uncertainty of 3% at 28 keV. Conclusions: That pDECT supports mean linear attenuation coefficient measurement accuracies of 1% of reference values for energies greater than 30 keV is encouraging. However, the sensitivity of the pDECT measurements to noise and systematic errors in reconstructed CT images warrants further investigation in more complex phantom geometries. The investigated statistical reconstruction algorithm, AM, reduced random measurement uncertainty relative to FBP owing to improved noise performance. These early results also support efforts to increase DE spectral separation, which can further reduce the pDECT sensitivity to measurement uncertainty.

61 RADIATION PROTECTION AND DOSIMETRY↗

SU-C-9A-03: Simultaneous Deconvolution and Segmentation for PET Tumor Delineation Using a Variational Method

Purpose: To implement a new method that integrates deconvolution with segmentation under the variational framework for PET tumor delineation. Methods: Deconvolution and segmentation are both challenging problems in image processing. The partial volume effect (PVE) makes tumor boundaries in PET image blurred which affects the accuracy of tumor segmentation. Deconvolution aims to obtain a PVE-free image, which can help to improve the segmentation accuracy. Conversely, a correct localization of the object boundaries is helpful to estimate the blur kernel, and thus assist in the deconvolution. In this study, we proposed to solve the two problems simultaneously using a variational method so that they can benefit each other. The energy functional consists of a fidelity term and a regularization term, and the blur kernel was limited to be the isotropic Gaussian kernel. We minimized the energy functional by solving the associated Euler-Lagrange equations and taking the derivative with respect to the parameters of the kernel function. An alternate minimization method was used to iterate between segmentation, deconvolution and blur-kernel recovery. The performance of the proposed method was tested on clinic PET images of patients with non-Hodgkin's lymphoma, and compared with seven other segmentation methods using the dice similarity index (DSI) and volume error (VE). Results: Among all segmentation methods, the proposed one (DSI=0.81, VE=0.05) has the highest accuracy, followed by the active contours without edges (DSI=0.81, VE=0.25), while other methods including the Graph Cut and the Mumford-Shah (MS) method have lower accuracy. A visual inspection shows that the proposed method localizes the real tumor contour very well. Conclusion: The result showed that deconvolution and segmentation can contribute to each other. The proposed variational method solve the two problems simultaneously, and leads to a high performance for tumor segmentation in PET. This work was supported in part by National Natural Science Foundation of China (NNSFC), under Grant Nos. 60971112 and 61375018, and Fundamental Research Funds for the Central Universities, under Grant No. 2012QN086. Wei Lu was supported in part by the National Institutes of Health (NIH) Grant No. R01 CA172638.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Lumbar Spinal Stenosis Minimally Invasive Treatment with Bilateral Transpedicular Facet Augmentation System

Purpose. The purpose of this study was to evaluate the effectiveness of a new pedicle screw-based posterior dynamic stabilization device PDS Percudyn System Trade-Mark-Sign Anchor and Stabilizer (Interventional Spine Inc., Irvine, CA) as alternative minimally invasive treatment for patients with lumbar spine stenosis. Methods. Twenty-four consecutive patients (8 women, 16 men; mean age 61.8 yr) with lumbar spinal stenosis underwent implantation of the minimally invasive pedicle screw-based device for posterior dynamic stabilization. Inclusion criteria were lumbar stenosis without signs of instability, resistant to conservative treatment, and eligible to traditional surgical posterior decompression. Results. Twenty patients (83 %) progressively improved during the 1-year follow-up. Four (17 %) patients did not show any improvement and opted for surgical posterior decompression. For both responder and nonresponder patients, no device-related complications were reported. Conclusions. Minimally invasive PDS Percudyn System Trade-Mark-Sign has effectively improved the clinical setting of 83 % of highly selected patients treated, delaying the need for traditional surgical therapy.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Partitioning sources of CO 2 emission after soil wetting using high-resolution observations and minimal models

Wetting dry soil triggers a pulse of microbial respiration. Respiration pulses after wetting can be complex, evolving through several stages before subsiding—possibly reflecting contributions from multiple carbon (C) sources. In this work we hypothesized that respiration after wetting combines C from cellular sources (notably trehalose, a cellular osmo-protectant) and soluble extracellular C made available by the physical effects of wetting, with cellular sources contributing early during the pulse and extracellular C dominating later. We tested this hypothesis by making measurements of soil respiration, microbial biomass, trehalose, and water extractable organic C after wetting dry soil in the laboratory. We then devised several alternative minimal models to evaluate the potential contributions of trehalose and extracellular C to the respiration pulse. We found that the chloroform-labile fraction of the microbial biomass was comprised of 50% trehalose in dry soil. Both trehalose and water extractable organic C pools declined rapidly after wetting; trehalose disappeared within 3 h of water addition. Chloroform-labile glucose increased 3 h after water addition and then declined, suggesting rapid hydrolysis of trehalose and consumption of the resulting glucose. Respiration dynamics after wetting could be best explained by models that included two C sources, combining rapid metabolism of trehalose with slower consumption of extracellular soluble C. These results suggest that pulses of respiration after wetting reflect both osmolyte consumption within the microbial biomass and enhanced extracellular C availability; hence, models of microbial drought response must account for both processes to fully resolve soil C dynamics.

54 ENVIRONMENTAL SCIENCES↗

Reverse-mode differentiation in arbitrary tensor network format: with application to supervised learning.

This paper describes an efficient reverse-mode differentiation algorithm for contraction operations of tensor networks that may have arbitrary and unconventional network topologies. The approach leverages the tensor contraction tree of Evenbly and Pfeifer (2014), which provides an instruction set for the contraction sequence of a network. We show that this tree can be efficiently leveraged for differentiation of a full tensor network contraction using a recursive scheme that exploits (1) the bilinear property of contraction and (2) the property that trees have single path from root to leaves. While differentiation of tensor-tensor contraction is already possible in most automatic differentiation packages, we show that exploiting these two additional properties in the specific context of contraction sequences can improve efficiency. Following a description of the algorithm and computational complexity analysis, we investigate its utility for gradient-based supervised learning for low-rank function recovery and for fitting real-world unstructured datasets. We demonstrate improved performance over alternating least-squares optimization approaches and the capability to handle heterogeneous and arbitrary tensor network formats. When compared to alternating minimization algorithms, we find that the gradient-based approach requires a smaller oversampling ratio (number of samples compared to number model parameters) for recovery. This increased efficiency extends to fitting unstructured data of varying dimensionality and when employing a variety of tensor network formats. Here, we show improved learning using the hierarchical Tucker method over the tensor-train in high-dimensional settings on a number of benchmark problems.

97 MATHEMATICS AND COMPUTING↗

TU-CD-BRA-12: Coupling PET Image Restoration and Segmentation Using Variational Method with Multiple Regularizations

Purpose: To propose a new variational method which couples image restoration with tumor segmentation for PET images using multiple regularizations. Methods: Partial volume effect (PVE) is a major degrading factor impacting tumor segmentation accuracy in PET imaging. The existing segmentation methods usually need to take prior calibrations to compensate PVE and they are highly system-dependent. Taking into account that image restoration and segmentation can promote each other and they are tightly coupled, we proposed a variational method to solve the two problems together. Our method integrated total variation (TV) semi-blind deconvolution and Mumford-Shah (MS) segmentation. The TV norm was used on edges to protect the edge information, and the L{sub 2} norm was used to avoid staircase effect in the no-edge area. The blur kernel was constrained to the Gaussian model parameterized by its variance and we assumed that the variances in the X-Y and Z directions are different. The energy functional was iteratively optimized by an alternate minimization algorithm. Segmentation performance was tested on eleven patients with non-Hodgkin’s lymphoma, and evaluated by Dice similarity index (DSI) and classification error (CE). For comparison, seven other widely used methods were also tested and evaluated. Results: The combination of TV and L{sub 2} regularizations effectively improved the segmentation accuracy. The average DSI increased by around 0.1 than using either the TV or the L{sub 2} norm. The proposed method was obviously superior to other tested methods. It has an average DSI and CE of 0.80 and 0.41, while the FCM method — the second best one — has only an average DSI and CE of 0.66 and 0.64. Conclusion: Coupling image restoration and segmentation can handle PVE and thus improves tumor segmentation accuracy in PET. Alternate use of TV and L2 regularizations can further improve the performance of the algorithm. This work was supported in part by National Natural Science Foundation of China (NNSFC), under Grant No.61375018, and Fundamental Research Funds for the Central Universities, under Grant No. 2012QN086. Wei Lu was supported in part by the National Institutes of Health (NIH) Grant No. R01 CA172638.

60 APPLIED LIFE SCIENCES↗

On-Site Disposition of Concrete During Decommissioning and Decontamination: A Data Quality Objective-Based Approach

On-site disposition of concrete derived during decommissioning and demolition (D and D) of buildings at industrial sites is a cost-effective, waste minimization alternative to off-site disposal. Because the concrete is to be left on-site it becomes part of the solid matrix of the site and is subject to the compositional constraints governing site soils. In addition, the concrete and its contained-in materials may be subject to physical constraints such as size and shape which do not apply to soils. When considering on-site disposition of concrete, the data quality objective (DQO) process should be used to determine the compositional and physical constraints on the concrete and for developing the characterization approach to determine whether those constraints have been met. The information inputs to the compositional and physical constraints on the concrete constitute the concrete acceptance criteria (CAC) which become the basis for developing decision rules - the yes/no statements that unequivocally state the compositional and physical conditions under which concrete may be left on site. An important DQO boundary concept is concrete classification. The cost of concrete characterization can be minimized with a thorough data gap assessment by focusing resources on the concrete most in need of characterization. Concrete for which a yes/no decision can be made with reasonable certainty based on a comparison of existing data to the CAC receives a lesser amount of characterization scrutiny than does concrete for which existing data is non-existent or ambiguous relative to the CAC. In conclusion: Developing acceptance criteria for the on-site disposition of concrete through the DQO process provides a systematic methodology for determining and documenting what decisions will be made and what information is necessary to support those decisions. At each step in the process, input from all individuals or organizations that have a role in making the ultimate decision must be invited. The primary goal of the DQO process is the development of a clear and defensible set of decision rules that are acceptable, unanimously agreed upon, and approved by all decision makers. By conducting the DQO process in an analytical and systematic manner, unexpected and, perhaps, costly changes to an operational program resulting from last minute second-guessing can be prevented. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

A realistic theory of E6 unification through novel intermediate symmetries

Abstract We propose a non-supersymmetric E 6 GUT with the scalar sector consisting of650⨁351′ ⨁27. Making use of the first representation for the initial symmetry breaking to an intermediate stage, and the latter two representations for second-stage breaking to the Standard Model and a realistic Yukawa sector, this theory represents the minimal E 6 GUT that proceeds through one of the intermediate stages that are novel compared to SU(5) or SO(10) GUT: trinification SU(3) C × SU(3) L × SU(3) R , SU(6) × SU(2) and flipped SO(10) × U(1). We analyze these possibilities under the choice of vacuum that preserves a ℤ 2 “spinorial parity”, which disentangles the chiral and vector-like fermions of E 6 and provides a dark matter candidate in the form of a (scalar) inert doublet. Three cases are shown to consistently unify under the extended survival hypothesis (with minimal fine-tuning): trinification symmetry SU(3) C × SU(3) L × SU(3) R with eitherLRorCRparity, and SU(6) CR × SU(2) L . Although the successful cases give a large range for proton lifetime estimates, all of them include regions consistent with current experimental bounds and within reach of forthcoming experiments. The scenario investigated in this paper essentially represents the unique (potentially) viable choice in the class of E 6 GUTs proceeding through a novel-symmetry intermediate stage, since non-minimal alternatives seem to be intrinsically non-perturbative.

Physics↗

Scientific data interpolation with low dimensional manifold model

Here, we propose to apply a low dimensional manifold model to scientific data interpolation from regular and irregular samplings with a significant amount of missing information. The low dimensionality of the patch manifold for general scientific data sets has been used as a regularizer in a variational formulation. The problem is solved via alternating minimization with respect to the manifold and the data set, and the Laplace–Beltrami operator in the Euler–Lagrange equation is discretized using the weighted graph Laplacian. Various scientific data sets from different fields of study are used to illustrate the performance of the proposed algorithm on data compression and interpolation from both regular and irregular samplings.

97 MATHEMATICS AND COMPUTING↗

Ptychographic phase retrieval by proximal algorithms

We derive a set of ptychography phase-retrieval iterative engines based on proximal algorithms originally developed in convex optimization theory, and discuss their connections with existing ones. The use of proximal operator creates a simple frame work that allows us to incorporate the effect of noise from a maximum-likelihood (ML) principle. We focus on three particular algorithms, namely proximal minimization, alternating direction method of multiplier and accelerated proximal gradient (APG). We benchmark their performance with numerical simulations, and discuss their optimal conditions for convergence and accuracy. An experimental dataset is used to demonstrate their effectiveness as well, in which case an array of cubic Au nanoparticles with a size of 50 nm is imaged. We show that with the presence of Poisson noise, a dataset with photon counts up to 10 4 at one detector pixel already requires ML-based methods to achieve a stable convergence. Among the three algorithms derived in this work, APG method is reported first time for its application in ptychographic reconstruction and shows superior performance in terms of both accuracy and convergence rate with a noisy dataset.

36 MATERIALS SCIENCE↗