Search NASA⌕ Search

SEARCH · Search NASA

Results for “Image processing”

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 775 records · Page 43

Models of the strongly lensed quasar DES J0408-5354

We present gravitational lens models of the multiply imaged quasar DES J0408-5354, recently discovered in the Dark Energy Survey (DES) footprint, with the aim of interpreting its remarkable quad-like configuration. We first model the DES single-epoch $grizY$ images as a superposition of a lens galaxy and four point-like objects, obtaining spectral energy distributions (SEDs) and relative positions for the objects. Three of the point sources (A,B,D) have SEDs compatible with the discovery quasar spectra, while the faintest point-like image (G2/C) shows significant reddening and a `grey' dimming of $\approx0.8$mag. In order to understand the lens configuration, we fit different models to the relative positions of A,B,D. Models with just a single deflector predict a fourth image at the location of G2/C but considerably brighter and bluer. The addition of a small satellite galaxy ($R_{\rm E}\approx0.2$") in the lens plane near the position of G2/C suppresses the flux of the fourth image and can explain both the reddening and grey dimming. All models predict a main deflector with Einstein radius between $1.7"$ and $2.0",$ velocity dispersion $267-280$km/s and enclosed mass $\approx 6\times10^{11}M_{\odot},$ even though higher resolution imaging data are needed to break residual degeneracies in model parameters. The longest time-delay (B-A) is estimated as $\approx 85$ (resp. $\approx125$) days by models with (resp. without) a perturber near G2/C. The configuration and predicted time-delays of J0408-5354 make it an excellent target for follow-up aimed at understanding the source quasar host galaxy and substructure in the lens, and measuring cosmological parameters. We also discuss some lessons learnt from J0408-5354 on lensed quasar finding strategies, due to its chromaticity and morphology.

79 ASTRONOMY AND ASTROPHYSICS↗

DES meets Gaia: discovery of strongly lensed quasars from a multiplet search

We report the discovery, spectroscopic confirmation and first lens models of the first two, strongly lensed quasars from a combined search in WISE and Gaia over the DES footprint. Their Einstein radii span a range between ≈2.0 arcsec and ≈0.4 arcsec. Two of these (WGD2038-4008, RA = 20:38:02.65, Dec. = -40:08:14.64; WGD2021-4115, RA = 20:21:39.45, Dec. = -41:15:57.11) also have confirmed deflector redshifts. The four-image lens WGD2038-4008, with source and deflector redshifts s = 0.777 ± 0.001 and zl = 0.230 ± 0.002, respectively, has a deflector with radius R eff ≈ 3.4 arcsec, stellar mass $\log(M_{\star}/M_{\odot}) = 11.64^{+0.20}_{-0.43}$, and shows extended isophotal shape variation. Simple lens models yield Einstein radii $R_{\rm E}=(1.30\pm0.04)^{\prime\prime},$ axis ratio $q=0.75\pm0.1$ (compatible with that of the starlight) and considerable shear-ellipticity degeneracies. The two-image lens WGD2021-4115 (r.a.=20:21:39.45, dec.=--41:15:57.11) has $z_{s}=1.390\pm0.001$ and $z_l = 0.335 \pm 0.002$, and Einstein radius $R_{\rm E} = (1.1\pm0.1)^{\prime\prime},$ but higher-resolution imaging is needed to accurately separate the deflector and faint quasar image. Finally, we also show high-rank candidate doubles selected this way, some of which have been independently identified with different techniques, and discuss a DES+WISE quasar multiplet selection.

79 ASTRONOMY AND ASTROPHYSICS↗

Sparse Bayesian mass mapping with uncertainties: peak statistics and feature locations

ABSTRACT Weak lensing convergence maps – upon which higher order statistics can be calculated – can be recovered from observations of the shear field by solving the lensing inverse problem. For typical surveys this inverse problem is ill-posed (often seriously) leading to substantial uncertainty on the recovered convergence maps. In this paper we propose novel methods for quantifying the Bayesian uncertainty in the location of recovered features and the uncertainty in the cumulative peak statistic – the peak count as a function of signal-to-noise ratio (SNR). We adopt the sparse hierarchical Bayesian mass-mapping framework developed in previous work, which provides robust reconstructions and principled statistical interpretation of reconstructed convergence maps without the need to assume or impose Gaussianity. We demonstrate our uncertainty quantification techniques on both Bolshoi N-body (cluster scale) and Buzzard V-1.6 (large-scale structure) N-body simulations. For the first time, this methodology allows one to recover approximate Bayesian upper and lower limits on the cumulative peak statistic at well-defined confidence levels.

79 ASTRONOMY AND ASTROPHYSICS↗

Automatic Kalman-filter-based wavelet shrinkage denoising of 1D stellar spectra

We propose a non-parametric method to denoise 1D stellar spectra based on wavelet shrinkage followed by adaptive Kalman thresholding. Wavelet shrinkage denoising involves applying the discrete wavelet transform (DWT) to the input signal, ‘shrinking’ certain frequency components in the transform domain, and then applying inverse DWT to the reduced components. The performance of this procedure is influenced by the choice of base wavelet, the number of decomposition levels, and the thresholding function. Typically, these parameters are chosen by ‘trial and error’, which can be strongly dependent on the properties of the data being denoised. We here introduce an adaptive Kalman-filter-based thresholding method that eliminates the need for choosing the number of decomposition levels. We use the ‘Haar’ wavelet basis, which we found to provide excellent filtering for 1D stellar spectra, at a low computational cost. We introduce various levels of Poisson noise into synthetic PHOENIX spectra, and test the performance of several common denoising methods against our own. It proves superior in terms of noise suppression and peak shape preservation. Finally, we expect it may also be of use in automatically and accurately filtering low signal-to-noise galaxy and quasar spectra obtained from surveys such as SDSS, Gaia, LSST, PESSTO, VANDELS, LEGA-C, and DESI.

79 ASTRONOMY AND ASTROPHYSICS↗

Space-Charge Aberrations in Single-Shot Time-Resolved Transmission Electron Microscopy

In this paper, we discuss effects of space-charge fields on imaging performance in a single-shot time-resolved transmission electron microscope. Using a Green’s function perturbation method, we derive analytical estimates for the effects of space-charge nonlinearity on the image formation process and the associated aberration coefficients. The dependence of these coefficients on the initial beam phase space distribution is elucidated. The results are validated by particle tracking simulations and provide fundamental scaling laws for the trade-off between temporal and spatial resolutions in single-shot time-resolved transmission electron microscopy.

43 PARTICLE ACCELERATORS↗

Semantic segmentation with a sparse convolutional neural network for event reconstruction in MicroBooNE

We present the performance of a semantic segmentation network, SparseSSNet, that provides pixel-level classification of MicroBooNE data. The MicroBooNE experiment employs a liquid argon time projection chamber for the study of neutrino properties and interactions. SparseSSNet is a submanifold sparse convolutional neural network, which provides the initial machine learning based algorithm utilized in one of MicroBooNE's ν e -appearance oscillation analyses. The network is trained to categorize pixels into five classes, which are re-classified into two classes more relevant to the current analysis. The output of SparseSSNet is a key input in further analysis steps. This technique, used for the first time in liquid argon time projection chambers data and is an improvement compared to a previously used convolutional neural network, both in accuracy and computing resource utilization. Here, the accuracy achieved on the test sample is ≥ 99%. For full neutrino interaction simulations, the time for processing one image is ≈ 0.5 sec, the memory usage is at 1 GB level, which allows utilization of most typical CPU worker machine.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Ring artifact reduction via multiscale nonlocal collaborative filtering of spatially correlated noise

X-ray micro-tomography systems often suffer severe ring artifacts in reconstructed images. These artifacts are caused by defects in the detector, calibration errors, and fluctuations producing streak noise in the raw sinogram data. In this work, these streaks are modeled in the sinogram domain as additive stationary correlated noise upon logarithmic transformation. Based on this model, a streak removal procedure is proposed where the Block-Matching and 3-D (BM3D) filtering algorithm is applied across multiple scales, achieving state-of-the-art performance in both real and simulated data. Specifically, the proposed fully automatic procedure allows for attenuation of streak noise and the corresponding ring artifacts without creating major distortions common to other streak removal algorithms.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Using a modified double deep image prior for crosstalk mitigation in multislice ptychography

Multislice ptychography is a high-resolution microscopy technique used to image multiple separate axial planes using a single illumination direction. However, multislice ptychography reconstructions are often degraded by crosstalk, where some features on one plane erroneously contribute to the reconstructed image of another plane. Here, the use of a modified `double deep image prior' (DDIP) architecture is demonstrated in mitigating crosstalk artifacts in multislice ptychography. Utilizing the tendency of generative neural networks to produce natural images, a modified DDIP method yielded good results on experimental data. For one of the datasets, it is shown that using DDIP could remove the need of using additional experimental data, such as from X-ray fluorescence, to suppress the crosstalk. This method may help X-ray multislice ptychography work for more general experimental scenarios.

36 MATERIALS SCIENCE↗

Ring artifact and Poisson noise attenuation via volumetric multiscale nonlocal collaborative filtering of spatially correlated noise

X-ray micro-tomography systems often suffer from high levels of noise. In particular, severe ring artifacts are common in reconstructed images, caused by defects in the detector, calibration errors, and fluctuations producing streak noise in the raw sinogram data. Furthermore, the projections commonly contain high levels of Poissonian noise arising from the photon-counting detector. This work presents a 3-D multiscale framework for streak attenuation through a purposely designed collaborative filtering of correlated noise in volumetric data. A distinct multiscale denoising step for attenuation of the Poissonian noise is further proposed. By utilizing the volumetric structure of the projection data, the proposed fully automatic procedure offers improved feature preservation compared with 2-D denoising and avoids artifacts which arise from individual filtering of sinograms.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

End-to-end orientation estimation from 2D cryo-EM1images

Cryo-electron microscopy (cryo-EM) is a Nobel Prize-winning technique for deter-mining high-resolution 3D structures of biological macromolecules. A 3D structure is reconstructed from hundreds of thousands of noisy 2D projection images. However, existing 3D reconstruction methods are still time-consuming, and one of the major computational bottlenecks is to recover the unknown orientation of the particle in16each 2D image. The dominant methods typically exploit expensive global search on each image to estimate the missing orientations. Here, a novel end-to-end supervised learning method is introduced to directly recover the missing orientations from 2D cryo-EM images. A neural network is used to approximate the mapping from images to orientations. Furthermore, a robust loss function is proposed for optimizing the parameters of the network, which can handle both asymmetric and symmetric 3D structures. Experiments on synthetic datasets with various symmetry types confirm that the neural network is capable of recovering orientations from 2D cryo-EM images, and the results on one real cryo-EM dataset further demonstrate its potential in more challenging imaging conditions.

3D reconstruction↗

Iterative Joint Ptychography-Tomography with Total Variation Regularization

In order to determine the 3D structure of a thick sample, researchers have recently combined ptychography (for high resolution) and tomography (for 3D imaging) in a single experiment. 2-step methods are usually adopted for reconstruction, where the ptychography and tomography problems are often solved independently. In this paper, we provide a novel model and ADMM-based algorithm to jointly solve the ptychography-tomography problem iteratively, also employing total variation regularization. The proposed method permits large scan stepsizes for the ptychography experiment, requiring less measurements and being more robust to noise with respect to other strategies, while achieving higher reconstruction quality results.

2-step methods↗

Occlusion-Perturbed Deep Learning for Probabilistic Solar Forecasting via Sky Images

Solar forecasting is shifting to the probabilistic paradigm due to the inherent uncertainty within the solar resource. Input uncertainty quantification is one of the widely used and best-performing ways to model solar uncertainty. However, compared to other sources of inputs, such as numerical weather prediction models, pure sky image-based probabilistic solar forecasting lags behind. In this research, an occlusion-perturbed convolutional neural network, named the PSolarNet, is developed. The PSolarNet provides very short-term deterministic forecasts, forecast scenarios, and probabilistic forecasts of the global horizontal irradiance from sky image sequences. Case studies based on 6 years of open-source data show that the developed PSolarNet is able to generate accurate 10-minute ahead deterministic forecasts with a 5.62% normalized root mean square error, realistic and diverse forecast scenarios with a 0.966 average correlation with the actual time series, and reliable and sharp probabilistic forecasts with a 2.77% normalized continuous ranked probability score.

Bayesian model averaging↗

Movement of Cracked Silicon Solar Cells During Module Temperature Changes

Cracks in crystalline silicon solar cells can lead to substantial power loss. While the cells' metal contacts can initially bridge these cracks and maintain electrical connections, the bridges are damaged by mechanical loads, including those due to temperature changes. We investigated the metallization bridges that form over cracks in encapsulated silicon solar cells. Microscopic characterization showed that the crack in the silicon can immediately propagate through the metal grid, but the grid can maintain electrical contact once the load is removed. We also quantified the movement of the cell fragments separated by a crack as a function of temperature. Cell fragments are free to move diagonally and to rotate, so the change in gap across the crack during a temperature change varies along the length of the crack. In one sample, we showed that a 10 degrees C temperature change, causing a 2 um increase in the separation of cell fragments, was sufficient to cause a reversible electrical disconnection of metallization bridging a crack.

14 SOLAR ENERGY↗

Crack Identification and Characterization in Deformed Nb3Sn Rutherford Cable Stacks Using Machine Learning

An investigation of instance segmentation of cracks in Nb3Sn 4-stack 40-strand Rutherford cables using machine learning is presented. Three samples were uniaxially and biaxially loaded before metallographic inspections were performed. The Mask R-CNN model was used in the Detectron2 framework with pre-trained weights but fine-tuned to detect and segment cracks. The model detected cracks with bounding box and mask average precisions (AP) of 42.8 and 27.9, respectively, and was used for instance segmentation of all cracks in the three samples. More cracks were found in the sample pre-loaded along the z-axis (i.e., along the cable length). Pre-loading along the x-axis (i.e., on the cables edges) reduced the number of cracks and changed the crack orientation distribution, away from being highly aligned with the y-axis (i.e., normal to the cables broad faces), i.e., the direction with the highest applied load. Fine-tuning of the Segment Anything Model (SAM) was also studied but performed poorly without human-provided prompts. However, the zero-shot capability of SAM showed high promises to accelerate the image annotation process for applications beyond this study.

Croteau, Jean-Francois↗

Kernelized Generalized Likelihood Ratio Test for Spectrum Sensing in Cognitive Radio

Spectrum sensing in next-generation wireless radio networks is considered a key technology to overcome the problem of spectrum scarcity. Unfortunately, many approaches to spectrum sensing do not work well in low signal-to-noise ratio (SNR) environments. This paper proposes and analyzes a new algorithm named kernelized generalized likelihood ratio test (KGLRT) for spectrum sensing in cognitive radio systems to overcome this problem. Effectively, KGLRT uses a nonlinear kernel to map input data onto a high-dimensional feature space; then, the widely accepted (linear) generalized likelihood ratio test is used for hypothesis testing. This new algorithm gives a gain of 4 dB in SNR over its linear counterpart. A theoretical analysis for this algorithm is given for the first time and is shown analogous to algorithms used in image signal processing. The detection metrics are found to be concentrated random variables; furthermore, the probability distributions of the detection metrics are proved to follow the F -distributions, which agree with the results obtained using the concentration inequality. The analytical thresholds are derived for target false-alarm probabilities. Here, the thresholds are independent of noise power; thus, the proposed algorithm can overcome noise uncertainty issues at very low SNR levels. Simulations validate the theoretical results.

47 OTHER INSTRUMENTATION↗

Non-Blind Deblurring for Fluorescence: A Deformable Latent Space Approach with Kernel Parameterization

We report N\non-blind deblurring (NBD) is a modeling method of the image deblurring problem in computer vision, where the blurring kernel is known or can be externally estimated. In this paper, we attempt to solve a parametric NBD problem, inspired by the simultaneous acquisition of ptychography and fluorescent imaging (FI). Ptychography is an imaging method that favors larger probes, i.e. convolutional kernels, while FI relies on a small probe for high resolution. Also, the kernel can be solved during ptychographic reconstruction. With Ptycho-FI using the same larger kernel, we can perform NBD on the blurred fluorescent images to achieve high-resolution FI, and thus speed up the experiments. To this end, we design a deep latent space deformation network that is directly parameterized by the kernel. The network consists of three components: encoder, deformer, and decoder, where the deformer is specifically meant to rectify the latent space representations of blurred images to a standard latent space, regardless of the kernel. The deformation network is trained with a two-stage training scheme. We conduct extensive experiments to confirm that our parametric model can adapt to drastically different blurring kernels and perform robust deblurring.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Visualizing the Uncertainty of Graph-based 2D Segmentation with Min-path Stability

Here, this paper presents a novel approach to visualize the uncertainty in graph-based segmentations of scalar data. Segmentation of 2D scalar data has wide application in a variety of scientific and medical domains. Typically, a segmentation is presented as a single unambiguous boundary although the solution is often uncertain due to noise or blur in the underlying data as well as imprecision in user input. Our approach provides insight into this uncertainty by computing the “min-path stability”, a scalar measure analyzing the stability of the segmentation given a set of input constraints. Our approach is efficient, easy to compute, and can be generally applied to either graph cuts or live-wire (even partial) segmentations. In addition to its general applicability, our new approach to graph cuts uncertainty visualization improves on the time complexity of the current state-of-the-art with an additional fast approximate solution. We also introduce a novel query enabled by our approach which provides users with alternate segmentations by efficiently extracting local minima of the segmentation optimization. Finally, we evaluate our approach and demonstrate its utility on data from scientific and medical applications.

97 MATHEMATICS AND COMPUTING↗