Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Regularization”

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 55 records · Page 3

Deblurring galaxy images with Tikhonov regularization on magnitude domain

Abstract We propose a regularization-based deblurring method that works efficiently for galaxy images. The spatial resolution of a ground-based telescope is generally limited by seeing conditions and is much worse than space-based telescopes. This circumstance has generated considerable research interest in the restoration of spatial resolution. Since image deblurring is a typical inverse problem and often ill-posed, solutions tend to be unstable. To obtain a stable solution, much research has adopted regularization-based methods for image deblurring, but the regularization term is not necessarily appropriate for galaxy images. Although galaxies have an exponential or Sérsic profile, the conventional regularization assumes the image profiles to behave linearly in space. The significant deviation between the assumption and real situations leads to blurring of the images and smoothing out the detailed structures. Clearly, regularization on logarithmic domain, i.e., magnitude domain, should provide a more appropriate assumption, which we explore in this study. We formulate a problem of deblurring galaxy images by an objective function with a Tikhonov regularization term on a magnitude domain. We introduce an iterative algorithm minimizing the objective function with a primal–dual splitting method. We investigate the feasibility of the proposed method using simulation and observation images. In the simulation, we blur galaxy images with a realistic point spread function and add both Gaussian and Poisson noise. For the evaluation with the observed images, we use galaxy images taken by the Subaru HSC-SSP. Both of these evaluations show that our method successfully recovers the spatial resolution of the deblurred images and significantly outperforms the conventional methods. The code is publicly available from the GitHub 〈https://github.com/kzmurata-astro/PSFdeconv_amag〉.

Murata, Kazumi↗

DIAS: A Data-Informed Active Subspace Regularization Framework for Inverse Problems

This paper presents a regularization framework that aims to improve the fidelity of Tikhonov inverse solutions. At the heart of the framework is the data-informed regularization idea that only data-uninformed parameters need to be regularized, while the data-informed parameters, on which data and forward model are integrated, should remain untouched. We propose to employ the active subspace method to determine the data-informativeness of a parameter. The resulting framework is thus called a data-informed (DI) active subspace (DIAS) regularization. Four proposed DIAS variants are rigorously analyzed, shown to be robust with the regularization parameter and capable of avoiding polluting solution features informed by the data. They are thus well suited for problems with small or reasonably small noise corruptions in the data. Furthermore, the DIAS approaches can effectively reuse any Tikhonov regularization codes/libraries. Though they are readily applicable for nonlinear inverse problems, we focus on linear problems in this paper in order to gain insights into the framework. Various numerical results for linear inverse problems are presented to verify theoretical findings and to demonstrate advantages of the DIAS framework over the Tikhonov, truncated SVD, and the TSVD-based DI approaches.

Nguyen, Hai↗

Regularized inversion of aerosol hygroscopic growth factor probability density function: application to humidity-controlled fast integrated mobility spectrometer measurements

Abstract. Aerosol hygroscopic growth plays an important role in atmospheric particle chemistry and the effects of aerosol on radiation and hence climate. The hygroscopic growth is often characterized by a growth factor probability density function (GF-PDF), where the growth factor is defined as the ratio of the particle size at a specified relative humidity to its dry size. Parametric, least-squares methods are the most widely used algorithms for inverting the GF-PDF from measurements of the humidified tandem differential mobility analyzer (HTDMA) and have been recently applied to the GF-PDF inversion from measurements of the humidity-controlled fast integrated mobility spectrometer (HFIMS). However, these least-squares methods suffer from noise amplification due to the lack of regularization in solving the ill-posed problem, resulting in significant fluctuations in the retrieved GF-PDF and even occasional failures of convergence. In this study, we introduce nonparametric, regularized methods to invert the aerosol GF-PDF and apply them to HFIMS measurements. Based on the HFIMS kernel function, the forward convolution is transformed into a matrix-based form, which facilitates the application of the nonparametric inversion methods with regularizations, including Tikhonov regularization and Twomey's iterative regularization. Inversions of the GF-PDF using the nonparameteric methods with regularization are demonstrated using HFIMS measurements simulated from representative GF-PDFs of ambient aerosols. The characteristics of reconstructed GF-PDFs resulting from different inversion methods, including previously developed least-squares methods, are quantitatively compared. The result shows that Twomey's method generally outperforms other inversion methods. The capabilities of Twomey's method in reconstructing the pre-defined GF-PDFs and recovering the mode parameters are validated.

54 ENVIRONMENTAL SCIENCES↗

Physics-informed regularization and structure preservation for learning stable reduced models from data with operator inference

Operator inference learns low-dimensional dynamical-system models with polynomial nonlinear terms from trajectories of high-dimensional physical systems (non-intrusive model reduction). Here, this work focuses on the large class of physical systems that can be well described by models with quadratic and cubic nonlinear terms and proposes a regularizer for operator inference that induces a stability bias onto learned models. The proposed regularizer is physics informed in the sense that it penalizes higher-order terms with large norms and so explicitly leverages the polynomial model form that is given by the underlying physics. This means that the proposed approach judiciously learns from data and physical insights combined, rather than from either data or physics alone. Additionally, a formulation of operator inference is proposed that enforces model constraints for preserving structure such as symmetry and definiteness in linear terms. Numerical results demonstrate that models learned with operator inference and the proposed regularizer and structure preservation are accurate and stable even in cases where using no regularization and Tikhonov regularization leads to models that are unstable.

97 MATHEMATICS AND COMPUTING↗

Detecting regular sound changes in linguistics as events of concerted evolution

Background: Concerted evolution is normally used to describe parallel changes at different sites in a genome, but it is also observed in languages where a specific phoneme changes to the same other phoneme in many words in the lexicon—a phenomenon known as regular sound change. We develop a general statistical model that can detect concerted changes in aligned sequence data and apply it to study regular sound changes in the Turkic language family. Results: Linguistic evolution, unlike the genetic substitutional process, is dominated by events of concerted evolutionary change. Our model identified more than 70 historical events of regular sound change that occurred throughout the evolution of the Turkic language family, while simultaneously inferring a dated phylogenetic tree. Including regular sound changes yielded an approximately 4-fold improvement in the characterization of linguistic change over a simpler model of sporadic change, improved phylogenetic inference, and returned more reliable and plausible dates for events on the phylogenies. The historical timings of the concerted changes closely follow a Poisson process model, and the sound transition networks derived from our model mirror linguistic expectations. Conclusions: We demonstrate that a model with no prior knowledge of complex concerted or regular changes can nevertheless infer the historical timings and genealogical placements of events of concerted change from the signals left in contemporary data. Our model can be applied wherever discrete elements—such as genes, words, cultural trends, technologies, or morphological traits—can change in parallel within an organism or other evolving group.

59 BASIC BIOLOGICAL SCIENCES↗

A hybrid inventory policy with split delivery under regular and surge demand

This paper proposes a hybrid inventory policy with split delivery under regular demand and surge demand. The combination of regular demand and surge demand can be observed in many areas, such as healthcare inventory and humanitarian supply chain management. The arrival rate for regular demand is typically higher than the arrival rate of surge demand; whereas, the volume of a regular demand is typically lower than the volume of a surge demand. This paper proposes an inventory management model that considers both emergency and regular replenishment corresponding to both demand patterns. The equilibrium equations developed for this model are based on the level crossing theory. This paper finally presents a search-based heuristics that can be used to identify near optimal inventory management policies. Numerical results show that proposed hybrid inventory policy with split delivery outperforms similar hybrid inventory policy without split delivery.

97 MATHEMATICS AND COMPUTING↗

Recovering fine details from under-resolved electron tomography data using higher order total variation ℓ 1 regularization

Over the last decade or so, reconstruction methods using ℓ 1 regularization, often categorized as compressed sensing (CS) algorithms, have significantly improved the capabilities of high fidelity imaging in electron tomography. The most popular ℓ 1 regularization approach within electron tomography has been total variation (TV) regularization. In addition to reducing unwanted noise, TV regularization encourages a piecewise constant solution with sparse boundary regions. In this paper we propose an alternative ℓ 1 regularization approach for electron tomography based on higher order total variation (HOTV). Like TV, the HOTV approach promotes solutions with sparse boundary regions. In smooth regions however, the solution is not limited to piecewise constant behavior. We demonstrate that this allows for more accurate reconstruction of a broader class of images – even those for which TV was designed for – particularly when dealing with pragmatic tomographic sampling patterns and very fine image features. In conclusion, we develop results for an electron tomography data set as well as a phantom example, and we also make comparisons with discrete tomography approaches.

47 OTHER INSTRUMENTATION↗

On a regularization of a scalar conservation law with discontinuous coefficients

This paper is devoted to a scalar conservation law with a linear flux function involving discontinuous coefficients. It is clear that the delta standing wave should be introduced into the Riemann solution in some nonclassical situation. In order to study the formation of delta standing wave, we consider a regularization of the discontinuous coefficient with the Helmholtz mollifier and then obtain a regularized system which depends on a regularization parameter ε > 0. The regularization mechanism is a nonlinear bending of characteristic curves that prevents their finite-time intersection. It is proved rigorously that the solutions of regularized system converge to the delta standing wave solution in the ε → 0 limit. Compared with the classical method of vanishing viscosity, here it is clear to see how the delta standing wave forms naturally along the characteristics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Modified sparse regularization for electrical impedance tomography

Electrical impedance tomography (EIT) aims to estimate the electrical properties at the interior of an object from current-voltage measurements on its boundary. It has been widely investigated due to its advantages of low cost, non-radiation, non-invasiveness, and high speed. Image reconstruction of EIT is a nonlinear and ill-posed inverse problem. Therefore, regularization techniques like Tikhonov regularization are used to solve the inverse problem. A sparse regularization based on L{sub 1} norm exhibits superiority in preserving boundary information at sharp changes or discontinuous areas in the image. However, the limitation of sparse regularization lies in the time consumption for solving the problem. In order to further improve the calculation speed of sparse regularization, a modified method based on separable approximation algorithm is proposed by using adaptive step-size and preconditioning technique. Both simulation and experimental results show the effectiveness of the proposed method in improving the image quality and real-time performance in the presence of different noise intensities and conductivity contrasts.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Mechanism-Based Energy Regularization in Computational Modeling of Quasibrittle Fracture

Abstract Quasibrittle materials are featured by a strain-softening constitutive behavior under many loading scenarios, which could eventually lead to localization instability. It has long been known that strain localization would result in spurious mesh sensitivity in finite element (FE) simulations. Previous studies have shown that, for the case of fully localized damage, the mesh sensitivity can be mitigated through energy regularization of the material constitutive law. However, depending on the loading configuration and structural geometry, quasibrittle structures could exhibit a complex damage process, which involves both localized and diffused damage patterns at different stages of loading. This study presents a generalized energy regularization method that considers the spatial and temporal evolution of damage pattern. The method introduces a localization parameter, which describes the local damage pattern. The localization parameter governs the energy regularization of the constitutive model, which captures the transition from diffused to localized damage during the failure process. The method is cast into an isotropic damage model, and is further extended to rate-dependent behavior. The energy regularization scheme is directly incorporated into the kinetics of damage growth. The model is applied to simulate static and dynamic failures of ceramic specimens. It is shown that the present model is able to effectively mitigate the spurious mesh sensitivity in FE simulations of both types of failure. The present analysis demonstrates the essential role of mechanism-based energy regularization of constitutive relation in FE simulations of quasibrittle fracture.

Mechanics↗

SU-E-I-93: Improved Imaging Quality for Multislice Helical CT Via Sparsity Regularized Iterative Image Reconstruction Method Based On Tensor Framelet

Purpose: Inspired by compressive sensing, sparsity regularized iterative reconstruction method has been extensively studied. However, its utility pertinent to multislice helical 4D CT for radiotherapy with respect to imaging quality, dose, and time has not been thoroughly addressed. As the beginning of such an investigation, this work carries out the initial comparison of reconstructed imaging quality between sparsity regularized iterative method and analytic method through static phantom studies using a state-of-art 128-channel multi-slice Siemens helical CT scanner. Methods: In our iterative method, tensor framelet (TF) is chosen as the regularization method for its superior performance from total variation regularization in terms of reduced piecewise-constant artifacts and improved imaging quality that has been demonstrated in our prior work. On the other hand, X-ray transforms and its adjoints are computed on-the-fly through GPU implementation using our previous developed fast parallel algorithms with O(1) complexity per computing thread. For comparison, both FDK (approximate analytic method) and Katsevich algorithm (exact analytic method) are used for multislice helical CT image reconstruction. Results: The phantom experimental data with different imaging doses were acquired using a state-of-art 128-channel multi-slice Siemens helical CT scanner. The reconstructed image quality was compared between TF-based iterative method, FDK and Katsevich algorithm with the quantitative analysis for characterizing signal-to-noise ratio, image contrast, and spatial resolution of high-contrast and low-contrast objects. Conclusion: The experimental results suggest that our tensor framelet regularized iterative reconstruction algorithm improves the helical CT imaging quality from FDK and Katsevich algorithm for static experimental phantom studies that have been performed.

60 APPLIED LIFE SCIENCES↗

X-ray computed tomography using curvelet sparse regularization

Purpose: Reconstruction of x-ray computed tomography (CT) data remains a mathematically challenging problem in medical imaging. Complementing the standard analytical reconstruction methods, sparse regularization is growing in importance, as it allows inclusion of prior knowledge. The paper presents a method for sparse regularization based on the curvelet frame for the application to iterative reconstruction in x-ray computed tomography. Methods: In this work, the authors present an iterative reconstruction approach based on the alternating direction method of multipliers using curvelet sparse regularization. Results: Evaluation of the method is performed on a specifically crafted numerical phantom dataset to highlight the method’s strengths. Additional evaluation is performed on two real datasets from commercial scanners with different noise characteristics, a clinical bone sample acquired in a micro-CT and a human abdomen scanned in a diagnostic CT. The results clearly illustrate that curvelet sparse regularization has characteristic strengths. In particular, it improves the restoration and resolution of highly directional, high contrast features with smooth contrast variations. The authors also compare this approach to the popular technique of total variation and to traditional filtered backprojection. Conclusions: The authors conclude that curvelet sparse regularization is able to improve reconstruction quality by reducing noise while preserving highly directional features.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Noise suppression for dual-energy CT via penalized weighted least-square optimization with similarity-based regularization

Purpose: Dual-energy CT (DECT) expands applications of CT imaging in its capability to decompose CT images into material images. However, decomposition via direct matrix inversion leads to large noise amplification and limits quantitative use of DECT. Their group has previously developed a noise suppression algorithm via penalized weighted least-square optimization with edge-preservation regularization (PWLS-EPR). In this paper, the authors improve method performance using the same framework of penalized weighted least-square optimization but with similarity-based regularization (PWLS-SBR), which substantially enhances the quality of decomposed images by retaining a more uniform noise power spectrum (NPS). Methods: The design of PWLS-SBR is based on the fact that averaging pixels of similar materials gives a low-noise image. For each pixel, the authors calculate the similarity to other pixels in its neighborhood by comparing CT values. Using an empirical Gaussian model, the authors assign high/low similarity value to one neighboring pixel if its CT value is close/far to the CT value of the pixel of interest. These similarity values are organized in matrix form, such that multiplication of the similarity matrix to the image vector reduces image noise. The similarity matrices are calculated on both high- and low-energy CT images and averaged. In PWLS-SBR, the authors include a regularization term to minimize the L-2 norm of the difference between the images without and with noise suppression via similarity matrix multiplication. By using all pixel information of the initial CT images rather than just those lying on or near edges, PWLS-SBR is superior to the previously developed PWLS-EPR, as supported by comparison studies on phantoms and a head-and-neck patient. Results: On the line-pair slice of the Catphan{sup ©}600 phantom, PWLS-SBR outperforms PWLS-EPR and retains spatial resolution of 8 lp/cm, comparable to the original CT images, even at 90% reduction in noise standard deviation (STD). Similar performance on spatial resolution is observed on an anthropomorphic head phantom. In addition, results of PWLS-SBR show substantially improved image quality due to preservation of image NPS. On the Catphan{sup ©}600 phantom, NPS using PWLS-SBR has a correlation of 93% with that via direct matrix inversion, while the correlation drops to −52% for PWLS-EPR. Electron density measurement studies indicate high accuracy of PWLS-SBR. On seven different materials, the measured electron densities calculated from the decomposed material images using PWLS-SBR have a root-mean-square error (RMSE) of 1.20%, while the results of PWLS-EPR have a RMSE of 2.21%. In the study on a head-and-neck patient, PWLS-SBR is shown to reduce noise STD by a factor of 3 on material images with image qualities comparable to CT images, whereas fine structures are lost in the PWLS-EPR result. Additionally, PWLS-SBR better preserves low contrast on the tissue image. Conclusions: The authors propose improvements to the regularization term of an optimization framework which performs iterative image-domain decomposition for DECT with noise suppression. The regularization term avoids calculation of image gradient and is based on pixel similarity. The proposed method not only achieves a high decomposition accuracy, but also improves over the previous algorithm on NPS as well as spatial resolution.

60 APPLIED LIFE SCIENCES↗

A Regularized Entropy-Based Moment Method for Kinetic Equations

Here, we present a new entropy-based moment method for the velocity discretization of kinetic equations. This method is based on a regularization of the optimization problem defining the original entropy-based moment method, and this gives the new method the advantage that the moment vectors of the solution do not have to take on realizable values. We show that this equation still retains many of the properties of the original equations, including hyperbolicity, an entropy-dissipation law, and rotational invariance. The cost of the regularization is mismatch between the moment vector of the solution and that of the ansatz returned by the regularized optimization problem. However, we show how to control this error using the parameter defining the regularization. This suggests that with proper choice of the regularization parameter, the new method can be used to generate accurate solutions of the original entropy-based moment method, and we confirm this with numerical simulations.

97 MATHEMATICS AND COMPUTING↗

Qubit Regularization of Quantum Field Theories

To study quantum field theories on a quantum computer, we must begin with Hamiltonians defined on a finite-dimensional Hilbert space and then take appropriate limits. This approach can be seen as a new type of regularization for quantum field theories, which we refer to as qubit regularization. A related finite-dimensional regularization, known as the D-theory approach, was proposed long ago as a general framework for all quantum field theories. In this framework, the dimensionality of the local Hilbert space at each spatial point can increase as needed through an additional flavor index. To reproduce asymptotically free QFTs, most studies assume that qubit-regularized theories require extending the local Hilbert space to infinity. However, contrary to this common belief, recent discoveries in (1+1) dimensions have revealed two examples where asymptotic freedom appears to emerge within a strictly finite-dimensional local Hilbert space through a novel renormalization group (RG) flow. These findings motivate further investigation into whether asymptotically free gauge theories could also emerge within a strictly finite-dimensional local Hilbert space. To support these explorations, we propose an orthonormal basis called the monomer-dimer-tensor-network (MDTN) basis and use it to construct new types of qubit-regularized lattice gauge theories.

Chandrasekharan, Shailesh [Duke Univ., Durham, NC ↗

Do Lower Calorie or Lower Fat Foods Have More Sodium Than Their Regular Counterparts?

The objective of this study was to compare the sodium content of a regular food and its lower calorie/fat counterpart. Four food categories, among the top 20 contributing the most sodium to the US diet, met the criteria of having the most matches between regular foods and their lower calorie/fat counterparts. A protocol was used to search websites to create a list of “matches”, a regular and comparable lower calorie/fat food(s) under each brand. Nutrient information was recorded and analyzed for matches. In total, 283 matches were identified across four food categories: savory snacks (N = 44), cheese (N = 105), salad dressings (N = 90), and soups (N = 44). As expected, foods modified from their regular versions had significantly reduced average fat (total fat and saturated fat) and caloric profiles. Mean sodium content among modified salad dressings and cheeses was on average 8%–12% higher, while sodium content did not change with modification of savory snacks. Modified soups had significantly lower mean sodium content than their regular versions (28%–38%). Consumers trying to maintain a healthy diet should consider that sodium content may vary in foods modified to be lower in calories/fat.

60 APPLIED LIFE SCIENCES↗

Qubit Regularization and Qubit Embedding Algebras

Qubit regularization is a procedure to regularize the infinite dimensional local Hilbert space of bosonic fields to a finite dimensional one, which is a crucial step when trying to simulate lattice quantum field theories on a quantum computer. When the qubit-regularized lattice quantum fields preserve important symmetries of the original theory, qubit regularization naturally enforces certain algebraic structures on these quantum fields. We introduce the concept of qubit embedding algebras (QEAs) to characterize this algebraic structure associated with a qubit regularization scheme. We show a systematic procedure to derive QEAs for the O(N) lattice spin models and the SU(N) lattice gauge theories. While some of the QEAs we find were discovered earlier in the context of the D-theory approach, our method shows that QEAs are far richer. A more complete understanding of the QEAs could be helpful in recovering the fixed points of the desired quantum field theories.

97 MATHEMATICS AND COMPUTING↗

Regularization of soft-X-ray data in a tokamak application

An image inversion scheme for soft X-ray (SXR) diagnostics at the DIII-D tokamak is developed to obtain the local soft X-ray emission at a poloidal cross-section from the spatially line-integrated image taken by either a set of SXR arrays or a tangential camera. The scheme uses the Tikhonov regularization method since the inversion problem is generally ill-posed. The regularization technique uses the generalized singular value decomposition (GSVD) to determine a solution that depends on a free regularization parameter. The latter has to be chosen carefully, and the so called L -curve method to find the optimum regularization parameter is outlined. A representative test image is used to study the properties of the inversion scheme with respect to inversion accuracy, amount/strength of regularization and image resolution. The SXR arrays thereby represent an under-determined case while the tangential camera is an over-determined case of the linear inversion problem. In conclusion, it is found that the under-determined case suffers from lack of information but can still return a coarse, but fair image, while the camera data can be well inverted with high resolution.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗