Search NASA⌕ Search

SEARCH · Search NASA

Results for “regularity”

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 37 records · Page 2

Stabilization of prescribed values and periodic orbits with regular and pulse target oriented control

Investigating a method of chaos control for one-dimensional maps, where the intervention is proportional to the difference between a fixed value and a current state, we demonstrate that stabilization is possible in one of the two following cases: (1) for small values, the map is increasing and the slope of the line connecting the points on the line with the origin is decreasing; (2) the chaotic map is locally Lipschitz. Moreover, in the latter case we prove that any point of the map can be stabilized. In addition, we study pulse stabilization when the intervention occurs each m-th step and illustrate that stabilization is possible for the first type of maps. In the context of population dynamics, we notice that control with a positive target, even if stabilization is not achieved, leads to persistent solutions and prevents extinction in models which experience the Allee effect.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Full particle orbit effects in regular and stochastic magnetic fields

Here we present a numerical study of charged particle motion in a time-independent magnetic field in cylindrical geometry. The magnetic field model consists of an unperturbed reversed-shear (non-monotonic q-profile) helical part and a perturbation consisting of a superposition of modes. Contrary to most of the previous studies, the particle trajectories are computed by directly solving the full Lorentz force equations of motion in a six-dimensional phase space using a sixth-order, implicit, symplectic Gauss-Legendre method. The level of stochasticity in the particle orbits is diagnosed using averaged, effective Poincare sections. It is shown that when only one mode is present, the particle orbits can be stochastic even though the magnetic field line orbits are not stochastic (i.e., fully integrable). The lack of integrability of the particle orbits in this case is related to separatrix crossing and the breakdown of the global conservation of the magnetic moment. Some perturbation consisting of two modes creates resonance overlapping, leading to Hamiltonian chaos in magnetic field lines. Then, the particle orbits exhibit a nontrivial dynamics depending on their energy and pitch angle. It is shown that the regions where the particle motion is stochastic decrease as the energy increases. The non-monotonicity of the q-profile implies the existence of magnetic ITBs (internal transport barriers) which correspond to shearless flux surfaces located in the vicinity of the q-profile minimum. It is shown that depending on the energy, these magnetic ITBs might or might not confine particles. That is, magnetic ITBs act as an energy-dependent particle confinement filter. Magnetic field lines in reversed-shear configurations exhibit topological bifurcations (from homoclinic to heteroclinic) due to separatrix reconnection. Finally, we show that a similar but more complex scenario appears in the case of particle orbits that depend in a non-trivial way on the energy and pitch angle of the particles.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Energy optimization of a regular macromolecular crystallography beamline for ultra-high-resolution crystallography

A practical method for operating existing undulator synchrotron beamlines at photon energies considerably higher than their standard operating range is described and applied at beamline 19-ID of the Structural Biology Center at the Advanced Photon Source enabling operation at 30 keV. Adjustments to the undulator spectrum were critical to enhance the 30 keV flux while reducing the lower- and higher-energy harmonic contamination. A Pd-coated mirror and Al attenuators acted as effective low- and high-bandpass filters. The resulting flux at 30 keV, although significantly lower than with X-ray optics designed and optimized for this energy, allowed for accurate data collection on crystals of the small protein crambin to 0.38 Å resolution.

Rosenbaum, Gerd↗

An adaptive regularization parameter choice strategy for multispectral bioluminescence tomography

Purpose: Bioluminescence tomography (BLT) provides an effective tool for monitoring physiological and pathological activities in vivo. However, the measured data in bioluminescence imaging are corrupted by noise. Therefore, regularization methods are commonly used to find a regularized solution. Nevertheless, for the quality of the reconstructed bioluminescent source obtained by regularization methods, the choice of the regularization parameters is crucial. To date, the selection of regularization parameters remains challenging. With regards to the above problems, the authors proposed a BLT reconstruction algorithm with an adaptive parameter choice rule. Methods: The proposed reconstruction algorithm uses a diffusion equation for modeling the bioluminescent photon transport. The diffusion equation is solved with a finite element method. Computed tomography (CT) images provide anatomical information regarding the geometry of the small animal and its internal organs. To reduce the ill-posedness of BLT, spectral information and the optimal permissible source region are employed. Then, the relationship between the unknown source distribution and multiview and multispectral boundary measurements is established based on the finite element method and the optimal permissible source region. Since the measured data are noisy, the BLT reconstruction is formulated as l{sub 2} data fidelity and a general regularization term. When choosing the regularization parameters for BLT, an efficient model function approach is proposed, which does not require knowledge of the noise level. This approach only requests the computation of the residual and regularized solution norm. With this knowledge, we construct the model function to approximate the objective function, and the regularization parameter is updated iteratively. Results: First, the micro-CT based mouse phantom was used for simulation verification. Simulation experiments were used to illustrate why multispectral data were used rather than monochromatic data. Furthermore, the study conducted using an adaptive regularization parameter demonstrated our ability to accurately localize the bioluminescent source. With the adaptively estimated regularization parameter, the reconstructed center position of the source was (20.37, 31.05, 12.95) mm, and the distance to the real source was 0.63 mm. The results of the dual-source experiments further showed that our algorithm could localize the bioluminescent sources accurately. The authors then presented experimental evidence that the proposed algorithm exhibited its calculated efficiency over the heuristic method. The effectiveness of the new algorithm was also confirmed by comparing it with the L-curve method. Furthermore, various initial speculations regarding the regularization parameter were used to illustrate the convergence of our algorithm. Finally, in vivo mouse experiment further illustrates the effectiveness of the proposed algorithm. Conclusions: Utilizing numerical, physical phantom and in vivo examples, we demonstrated that the bioluminescent sources could be reconstructed accurately with automatic regularization parameters. The proposed algorithm exhibited superior performance than both the heuristic regularization parameter choice method and L-curve method based on the computational speed and localization error.

61 RADIATION PROTECTION AND DOSIMETRY↗

SU-E-J-67: Evaluation of Breathing Patterns for Respiratory-Gated Radiation Therapy Using Respiration Regularity Index

Purpose: Despite the importance of accurately estimating the respiration regularity of a patient in motion compensation treatment, an effective and simply applicable method has rarely been reported. The authors propose a simple respiration regularity index based on parameters derived from a correspondingly simplified respiration model. Methods: In order to simplify a patient's breathing pattern while preserving the data's intrinsic properties, we defined a respiration model as a power of cosine form with a baseline drift. According to this respiration formula, breathing-pattern fluctuation could be explained using four factors: sample standard deviation of respiration period, sample standard deviation of amplitude and the results of simple regression of the baseline drift (slope and standard deviation of residuals of a respiration signal. Overall irregularity (δ) was defined as a Euclidean norm of newly derived variable using principal component analysis (PCA) for the four fluctuation parameters. Finally, the proposed respiration regularity index was defined as ρ=ln(1+(1/ δ))/2, a higher ρ indicating a more regular breathing pattern. Subsequently, we applied it to simulated and clinical respiration signals from real-time position management (RPM; Varian Medical Systems, Palo Alto, CA) and investigated respiration regularity. Moreover, correlations between the regularity of the first session and the remaining fractions were investigated using Pearson's correlation coefficient. Results: The respiration regularity was determined based on ρ; patients with ρ<0.3 showed worse regularity than the others, whereas ρ>0.7 was suitable for respiratory-gated radiation therapy (RGRT). Fluctuations in breathing cycle and amplitude were especially determinative of ρ. If the respiration regularity of a patient's first session was known, it could be estimated through subsequent sessions. Conclusions: Respiration regularity could be objectively determined using a respiration regularity index, ρ. Such single-index testing of respiration regularity can facilitate determination of RGRT availability in clinical settings, especially for free-breathing cases. This work was supported by a Korea Science and Engineering Foundation (KOSEF) grant funded by the Korean Ministry of Science, ICT and Future Planning (No. 2013043498)

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Spatially-Variant Tikhonov Regularization for Double-Difference Waveform Inversion

Double-difference waveform inversion is a potential tool for quantitative monitoring for geologic carbon storage. It jointly inverts time-lapse seismic data for changes in reservoir geophysical properties. Due to the ill-posedness of waveform inversion, it is a great challenge to obtain reservoir changes accurately and efficiently, particularly when using time-lapse seismic reflection data. Regularization techniques can be utilized to address the issue of ill-posedness. The regularization parameter controls the smoothness of inversion results. A constant regularization parameter is normally used in waveform inversion, and an optimal regularization parameter has to be selected. The resulting inversion results are a trade off among regions with different smoothness or noise levels; therefore the images are either over regularized in some regions while under regularized in the others. In this paper, we employ a spatially-variant parameter in the Tikhonov regularization scheme used in double-difference waveform tomography to improve the inversion accuracy and robustness. We compare the results obtained using a spatially-variant parameter with those obtained using a constant regularization parameter and those produced without any regularization. We observe that, utilizing a spatially-variant regularization scheme, the target regions are well reconstructed while the noise is reduced in the other regions. We show that the spatially-variant regularization scheme provides the flexibility to regularize local regions based on the a priori information without increasing computational costs and the computer memory requirement.

ACCURACY↗

Bilevel optimization, deep learning and fractional Laplacian regularization with applications in tomography

Here we consider a generalized bilevel optimization framework for solving inverse problems. We introduce fractional Laplacian as a regularizer to improve the reconstruction quality, and compare it with the total variation regularization. We emphasize that the key advantage of using fractional Laplacian as a regularizer is that it leads to a linear operator, as opposed to the total variation regularization which results in a nonlinear degenerate operator. Inspired by residual neural networks, to learn the optimal strength of regularization and the exponent of fractional Laplacian, we develop a dedicated bilevel optimization neural network with a variable depth for a general regularized inverse problem. We illustrate how to incorporate various regularizer choices into our proposed network. As an example, we consider tomographic reconstruction as a model problem and show an improvement in reconstruction quality, especially for limited data, via fractional Laplacian regularization. We successfully learn the regularization strength and the fractional exponent via our proposed bilevel optimization neural network. We observe that the fractional Laplacian regularization outperforms total variation regularization. This is specially encouraging, and important, in the case of limited and noisy data.

97 MATHEMATICS AND COMPUTING↗

Selective-diffusion regularization for enhancement of microcalcifications in digital breast tomosynthesis reconstruction

Purpose: Digital breast tomosynthesis (DBT) has been shown to improve mass detection. Detection of microcalcifications is more challenging because of the large breast volume to be searched for subtle signals. The simultaneous algebraic reconstruction technique (SART) was found to provide good image quality for DBT, but the image noise is amplified with an increasing number of iterations. In this study, the authors developed a selective-diffusion (SD) method for noise regularization with SART to improve the contrast-to-noise ratio (CNR) of microcalcifications in the DBT slices for human or machine detection. Methods: The SD method regularizes SART reconstruction during updating with each projection view. Potential microcalcifications are differentiated from the noisy background by estimating the local gradient information. Different degrees of regularization are applied to the signal or noise classes, such that the microcalcifications will be enhanced while the noise is suppressed. The new SD method was compared to several current methods, including the quadratic Laplacian (QL) method, the total variation (TV) method, and the nonconvex total p-variation (TpV) method for noise regularization with SART. A GE GEN2 prototype DBT system with a stationary digital detector was used for the acquisition of DBT scans at 21 angles in 3 deg. increments over a {+-}30 deg. range. The reconstruction image quality without regularization and that with the different regularization methods were compared using the DBT scans of an American College of Radiology phantom and a human subject. The CNR and the full width at half maximum (FWHM) of the line profiles of microcalcifications within the in-focus DBT slices were used as image quality measures. Results: For the comparison of large microcalcifications in the DBT data of the subject, the SD method resulted in comparable CNR to the nonconvex TpV method. Both of them performed better than the other two methods. For subtle microcalcifications, the SD method was superior to other methods in terms of CNR. In both the subject and phantom DBT data, for large microcalcifications, the FWHM of the SD method was comparable to that without regularization, which was wider than that of the TV type methods. For subtle microcalcifications, the SD method had comparable FWHM values to the TV type methods. All three regularization methods were superior to the QL method in terms of FWHM. Conclusions: The SART regularized by the selective-diffusion method enhanced the CNR and preserved the sharpness of microcalcifications. In comparison with three existing regularization methods, the selective-diffusion regularization was superior to the other methods for subtle microcalcifications.

60 APPLIED LIFE SCIENCES↗

Regularization via f -Divergence: An Application to Multi-Oxide Spectroscopic Analysis

In this paper, we explore the application of convolutional neural networks (CNNs) for predicting the chemical composition of complex geologic samples in a simulated Martian atmospheric environment. Specifically, we aim to characterize oxide weight percentages (wt.%) of rock samples analyzed by remote Laser-Induced Breakdown Spectroscopy (LIBS), framing the problem as a multi-target regression task . Neural networks trained on LIBS spectra are prone to overfitting due to high spectral complexity, limited labeled data, and measurement noise. While regularization is critical for improving generalization, common methods (e.g., ℓ 2 regularization) impose constraints not directly tied to data distribution properties. We propose a novel regularization method based on a specific ƒ-divergence induced by a graph-based estimator, designed to constrain the distributional discrepancy between predictions and targets. This regularizer serves a dual purpose: (a) mitigating overfitting by enforcing a constraint on the distributional difference between predictions and noisy targets, and (b) acting as an auxiliary loss that penalizes large divergences. To enable backpropagation, we develop a differentiable approximation of this particular ƒ-divergence, making the method feasible for neural networks. Experiments on ChemCam and SuperCam LIBS calibration spectra show that mathematical equation-divergence regularization outperforms or matches standard regularization methods (ℓ 1 , ℓ 2 , dropout) and the classical baseline, partial least squares (PLS). Combining ƒ-divergence regularization with standard regularization yields further performance gains, indicating that distributional regularization is useful in this context giving a promising direction for robust model training in planetary science applications. Source code is publicly available at Klein and Li (2025), https://doi.org/10.11578/dc.20250530.7.

58 GEOSCIENCES↗

Regularized Differentiation for Bioburden Density Estimation in Planetary Protection

In this paper, we propose and investigate the performance of two novel shrinkage estimators for bioburden density estimation in planetary protection. The estimators are based on the regularized differentiation of a cumulative count of colony forming units collected throughout the data collecting session or the life cycle of the entire mission. The regularized differentiation recasts the problem of bioburden density estimation as a linear least squares problem. The least squares problem is then solved through regularization techniques, such as truncated singular value decomposition and penalized least squares. The regularization is necessary to avoid noise amplification during the differentiation of noisy data. The two regularization estimators are compared with four other commonly used estimators to simultaneously evaluate the means of multivariable independent Poisson distributions: the maximum likelihood, noninformative Bayes estimator with Jeffreys prior, Empirical Bayes using conjugate gamma-Poisson model with gamma parameters selected by method of moments, and the Clevenson-Zidek estimator. It is shown through computer-simulated data that the regularized differentiation based on ridge regression has the smallest mean-squared error among all estimators. The analysis of shrinkage mechanism implemented by regularized differentiation is performed, and it is shown that the regularized differentiation amounts to performing a weighted averaging of all the samples. The weights are determined by the regularization parameter automatically selected by the L-curve technique. Since the method of least squares makes no distributional assumptions about the data, it presents an attractive technique for bioburden density estimation when there are concerns about the misspecification of the distributional model. The paper concludes with the analysis of the bioburden data collected during InSight mission and directions for future work.

97 - MATHEMATICS AND COMPUTING↗

Alternative regularizations for Outer-Approximation algorithms for convex MINLP

In this work, we extend the regularization framework from Kronqvist et al. (Math Program 180(1):285–310, 2020) by incorporating several new regularization functions and develop a regularized single-tree search method for solving convex mixed-integer nonlinear programming (MINLP) problems. We propose a set of regularization functions based on distance metrics and Lagrangean approximations, used in the projection problem for finding new integer combinations to be used within the Outer-Approximation (OA) method. The new approach, called Regularized Outer-Approximation (ROA), has been implemented as part of the open-source Mixed-integer nonlinear decomposition toolbox for Pyomo—MindtPy. We compare the OA method with seven regularization function alternatives for ROA. Moreover, we extend the LP/NLP Branch and Bound method proposed by Quesada and Grossmann (Comput Chem Eng 16(10–11):937–947, 1992) to include regularization in an algorithm denoted RLP/NLP. We provide convergence guarantees for both ROA and RLP/NLP. Finally, we perform an extensive computational experiment considering all convex MINLP problems in the benchmark library MINLPLib. The computational results show clear advantages of using regularization combined with the OA method.

Convex Mixed-integer nonlinear programming↗

Bayesian Spatially Varying Multi-Regularization Image Deblurring

Many scientific experiments such as those found in astronomy, geology, microbiology, and X-ray radiography require the use of high-energy instruments to capture images. Since blur and noise are inevitably present in any imaging system, the images must be \deblurred" to extract the full information content. Mathematically, image deblurring is an ill-posed inverse problem that requires regularization. The regularization, in turn, has a large effect on the deblurred image: different regularization strengths, and types, lead to drastically different reconstructions. Moreover, many images contain a mixture of smooth and sharp features which suggests the use of multi-regularization, i.e., varying the type of regularization (e.g. Tikhonov or total variation) across the image. We address these issues by formulating the image deblurring problem within a hierarchical Bayesian framework in which we spatially adapt the strength of the regularization and also vary the regularization type across the image. In this way, the image itself, along with corresponding regularization strength at each pixel, are described jointly by a posterior distribution which we can sample by Markov chain Monte Carlo (MCMC) methods. We illustrate our techniques on simplified test problems and apply them to high-energy X-ray images taken at the Nevada National Security Site. Numerical tests show that our new method is robustly applicable and increases the quality of the image reconstruction when compared to other (Bayesian) methods.

97 MATHEMATICS AND COMPUTING↗

Incremental projection approach of regularization for inverse problems

This paper presents an alternative approach to the regularized least squares solution of ill-posed inverse problems. Instead of solving a minimization problem with an objective function composed of a data term and a regularization term, the regularization information is used to define a projection onto a convex subspace of regularized candidate solutions. The objective function is modified to include the projection of each iterate in the place of the regularization. Numerical experiments based on the problem of motion estimation for geophysical fluid images, show the improvement of the proposed method compared with regularization methods. For the presented test case, the incremental projection method uses 7 times less computation time than the regularization method, to reach the same error target. Moreover, at convergence, the incremental projection is two order of magnitude more accurate than the regularization method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗