Search NASA⌕ Search

SEARCH · Search NASA

Results for “image decomposition”

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

ZTF SN Ia DR2: An environmental study of Type Ia supernovae using host galaxy image decomposition

The second data release of Type Ia supernovae (SNe Ia) observed by the Zwicky Transient Facility has provided a homogeneous sample of 3628 SNe Ia with photometric and spectral information. This unprecedented sample size enables us to better explore our currently tentative understanding of the dependence of the host environment on SN Ia properties. In this paper, we make use of two-dimensional image decomposition to model the host galaxies of SNe Ia. We model elliptical galaxies as well as disc and spiral galaxies with or without central bulges and bars. This allows for the categorisation of SN Ia based on their morphological host environment, as well as the extraction of intrinsic galaxy properties corrected for both cosmological and atmospheric effects, through point-spread-function (PSF) convolution. We find that although this image decomposition technique leads to a significant bias towards elliptical galaxies in our final sample of processed galaxies, the overall results are still robust. By successfully modelling 728 host galaxies, we find that the photometric properties of SNe Ia found in discs and in elliptical galaxies correlate fundamentally differently with their host environment. We identified strong linear relations between light-curve stretch and our model-derived galaxy colour for both the elliptical (16.8σ) and disc (5.1σ) subpopulations of SNe Ia. Lower-stretch SNe Ia are found in redder environments, which we identify as an age and/or metallicity effect. Within the subpopulation of SNe Ia found in disc-containing galaxies, we find a significant linear trend (6.1σ) between light-curve stretch and model-derived local r-band surface brightness, which we link to the age and metallicity gradients found in disc galaxies. SN Ia colour shows little correlation with the host environment, as is seen in the literature. We do identify a possible dust effect in our model-derived surface brightness (3.3σ) for SNe Ia in disc galaxies.

79 ASTRONOMY AND ASTROPHYSICS↗

DECT-MULTRA: Dual-Energy CT Image Decomposition With Learned Mixed Material Models and Efficient Clustering

Dual-energy computed tomography (DECT) imaging plays an important role in advanced imaging applications due to its material decomposition capability. Image-domain decomposition operates directly on CT images using linear matrix inversion, but the decomposed material images can be severely degraded by noise and artifacts. This paper proposes a new method dubbed DECT-MULTRA for image-domain DECT material decomposition that combines conventional penalized weighted-least squares (PWLS) estimation with regularization based on a mixed union of learned transforms (MULTRA) model. Our proposed approach pre-learns a union of common-material sparsifying transforms from patches extracted from all the basis materials, and a union of cross-material sparsifying transforms from multi-material patches. The common-material transforms capture the common properties among different material images, while the cross-material transforms capture the cross-dependencies. The proposed PWLS formulation is optimized efficiently by alternating between an image update step and a sparse coding and clustering step, with both of these steps having closed-form solutions. The effectiveness of our method is validated with both XCAT phantom and clinical head data. The results demonstrate that our proposed method provides superior material image quality and decomposition accuracy compared to other competing methods.

47 OTHER INSTRUMENTATION↗

Agile Multi-Scale Decompositions for Automatic Image Registration

In recent works, the first and third authors developed an automatic image registration algorithm based on a multiscale hybrid image decomposition with anisotropic shearlets and isotropic wavelets. This prototype showed strong performance, improving robustness over registration with wavelets alone. However, this method imposed a strict hierarchy on the order in which shearlet and wavelet features were used in the registration process, and also involved an unintegrated mixture of MATLAB and C code. In this paper, we introduce a more agile model for generating features, in which a flexible and user-guided mix of shearlet and wavelet features are computed. Compared to the previous prototype, this method introduces a flexibility to the order in which shearlet and wavelet features are used in the registration process. Moreover, the present algorithm is now fully coded in C, making it more efficient and portable than the MATLAB and C prototype. We demonstrate the versatility and computational efficiency of this approach by performing registration experiments with the fully-integrated C algorithm. In particular, meaningful timing studies can now be performed, to give a concrete analysis of the computational costs of the flexible feature extraction. Examples of synthetically warped and real multi-modal images are analyzed.

Science Data Processing↗

Agile Multi-Scale Decompositions for Automatic Image Registration

In recent works, the first and third authors developed an automatic image registration algorithm based on a multiscale hybrid image decomposition with anisotropic shearlets and isotropic wavelets. This prototype showed strong performance, improving robustness over registration with wavelets alone. However, this method imposed a strict hierarchy on the order in which shearlet and wavelet features were used in the registration process, and also involved an unintegrated mixture of MATLAB and C code. In this paper, we introduce a more agile model for generating features, in which a flexible and user-guided mix of shearlet and wavelet features are computed. Compared to the previous prototype, this method introduces a flexibility to the order in which shearlet and wavelet features are used in the registration process. Moreover, the present algorithm is now fully coded in C, making it more efficient and portable than the MATLAB and C prototype. We demonstrate the versatility and computational efficiency of this approach by performing registration experiments with the fully-integrated C algorithm. In particular, meaningful timing studies can now be performed, to give a concrete analysis of the computational costs of the flexible feature extraction. Examples of synthetically warped and real multi-modal images are analyzed.

Science Data Processing↗

Image Gradient Decomposition for Parallel and Memory-Efficient Ptychographic Reconstruction

Ptychography is a popular microscopic imaging modality for many scientific discoveries and sets the record for highest image resolution. Unfortunately, the high image resolution for ptychographic reconstruction requires significant amount of memory and computations, forcing many applications to compromise their image resolution in exchange for a smaller memory footprint and a shorter reconstruction time. In this paper, we propose a novel image gradient decomposition method that significantly reduces the memory footprint for ptychographic reconstruction by tessellating image gradients and diffraction measurements into tiles. In addition, we propose a parallel image gradient decomposition method that enables asynchronous point-to-point communications and parallel pipelining with minimal overhead on a large number of GPUs. Our experiments on a Titanate material dataset (PbTiO3) with 16632 probe locations show that our Gradient Decomposition algorithm reduces memory footprint by 51 times. In addition, it achieves time-to-solution within 2.2 minutes by scaling to 4158 GPUs with a super-linear strong scaling efficiency at 364% compared to runtimes at 6 GPUs. This performance is 2.7 times more memory efficient, 9 times more scalable and 86 times faster than the state-of-the-art algorithm.

Wang, Xiao↗

Discriminating Accretion States via Rotational Symmetry in Simulated Polarimetric Images of M87

In 2017 April, the Event Horizon Telescope observed the shadow of the supermassive black hole at the core of the elliptical galaxy Messier 87. While the original image was constructed from measurements of the total intensity, full polarimetric data were also collected, and linear polarimetric images are expected in the near future. We propose a modal image decomposition of the linear polarization field into basis functions with varying azimuthal dependence of the electric vector position angle. We apply this decomposition to images of ray traced general relativistic magnetohydrodynamics simulations of the Messier 87 accretion disk. Furthermore, for simulated images that are physically consistent with previous observations, the magnitude of the coefficient associated with rotational symmetry, β2, is a useful discriminator between accretion states. We find that at 20 μas resolution, $| {\beta }_{2}| $ is greater than 0.2 only for models of disks with horizon-scale magnetic pressures large enough to disrupt steady accretion. We also find that images with a more radially directed electric vector position angle correspond to models with higher black hole spin. Our analysis demonstrates the utility of the proposed decomposition as a diagnostic framework to improve constraints on theoretical models.

79 ASTRONOMY AND ASTROPHYSICS↗

Finding corner point correspondence from wavelet decomposition of image data

A time efficient algorithm for image registration between two images that differ in translation is discussed. The algorithm is based on coarse-fine strategy using wavelet decomposition of both the images. The wavelet decomposition serves two different purposes: (1) its high frequency components are used to detect feature points (corner points here) and (2) it provides coarse-to-fine structure for making the algorithm time efficient. The algorithm is based on detecting the corner points from one of the images called reference image and computing corresponding points from the other image called test image by using local correlations using 7x7 windows centered around the corner points. The corresponding points are detected at the lowest decomposition level in a search area of about 11x11 (depending on the translation) and potential points of correspondence are projected onto higher levels. In the subsequent levels the local correlations are computed in a search area of no more than 3x3 for refinement of the correspondence.

Manohar, Mareboyana↗

Facile alignment estimation in carbon nanotube films using image processing

Whether a macroscopic assembly of carbon nanotubes can exhibit the one-dimensional properties expected from individual nanotubes critically depends on how well the nanotubes are aligned inside the assembly. Therefore, a simple and accurate method for assessing the degree of alignment is desired for the rapid characterization of carbon nanotube films and fibers. Here, we present an end-to-end solution for determining the global and local spatial orientation of carbon nanotubes in films within a short amount of time using a fast, precise, and economical approach based on an image processing method applied to scanning electron microscopy images. Further, we first use Laplacian edge enhancement filtering for improving the appearance of edge regions, which is followed by image partitioning into multiple blocks to capture the nanoscale orientation characteristics and total variation-based image decomposition of these image blocks. We then perform a 2D-fast Fourier transform on the image decomposed textural components of these edge-enhanced image blocks to determine the orientation distribution, which is utilized to estimate the 2D nematic order parameter. To show the effectiveness of our method, we corroborated our results against results obtained with other state-of-the-art image processing and experimental techniques.

2D-FFT↗

Image wavelet decomposition and applications

The general problem of computer vision has been investigated for more that 20 years and is still one of the most challenging fields in artificial intelligence. Indeed, taking a look at the human visual system can give us an idea of the complexity of any solution to the problem of visual recognition. This general task can be decomposed into a whole hierarchy of problems ranging from pixel processing to high level segmentation and complex objects recognition. Contrasting an image at different representations provides useful information such as edges. An example of low level signal and image processing using the theory of wavelets is introduced which provides the basis for multiresolution representation. Like the human brain, we use a multiorientation process which detects features independently in different orientation sectors. So, images of the same orientation but of different resolutions are contrasted to gather information about an image. An interesting image representation using energy zero crossings is developed. This representation is shown to be experimentally complete and leads to some higher level applications such as edge and corner finding, which in turn provides two basic steps to image segmentation. The possibilities of feedback between different levels of processing are also discussed.

Treil, N.↗

Scaling Resolution of Gigapixel Whole Slide Images Using Spatial Decomposition on Convolutional Neural Networks

Gigapixel images are prevalent in scientific domains ranging from remote sensing, and satellite imagery to microscopy, etc. However, training a deep learning model at the natural resolution of those images has been a challenge in terms of both, overcoming the resource limit (e.g. HBM memory constraints), as well as scaling up to a large number of GPUs. In this paper, we trained Residual neural Networks (ResNet) on 22,528 x 22,528-pixel size images using a distributed spatial decomposition method on 2,304 GPUs on the Summit Supercomputer. We applied our method on a Whole Slide Imaging (WSI) dataset from The Cancer Genome Atlas (TCGA) database. WSI images can be in the size of 100,000 x 100,000 pixels or even larger, and in this work we studied the effect of image resolution on a classification task, while achieving state-of-the-art AUC scores. Moreover, our approach doesn't need pixel-level labels, since we're avoiding patching from the WSI images completely, while adding the capability of training arbitrary large-size images. This is achieved through a distributed spatial decomposition method, by leveraging the non-block fat-tree interconnect network of the Summit architecture, which enabled GPU-to-GPU direct communication. Finally, detailed performance analysis results are shown, as well as a comparison with a data-parallel approach when possible.

Tsaris, Aristeidis (aris)↗

The eROSITA Final Equatorial-Depth Survey (eFEDS)

Here, we investigate the physical properties – such as the stellar mass (M * ), star-formation rate, infrared (IR) luminosity (L IR ), X-ray luminosity (L X ), and hydrogen column density (N H ) – of mid-IR (MIR) galaxies and active galactic nuclei (AGN) at z < 4 in the 140 deg 2 field observed by eROSITA on SRG using the Performance-and-Verification-Phase program named the eROSITA Final Equatorial Depth Survey (eFEDS). By cross-matching the WISE 22 μm (W4)-detected sample and the eFEDS X-ray point-source catalog, we find that 692 extragalactic objects are detected by eROSITA. We have compiled a multiwavelength dataset extending from X-ray to far-IR wavelengths. We have also performed (i) an X-ray spectral analysis, (ii) spectral-energy-distribution fitting using X-CIGALE, (iii) 2D image-decomposition analysis using Subaru Hyper Suprime-Cam images, and (iv) optical spectral fitting with QSFit to investigate the AGN and host-galaxy properties. For 7088 WISE 22 μm objects that are undetected by eROSITA, we have performed an X-ray stacking analysis to examine the typical physical properties of these X-ray faint and probably obscured objects. We find that (i) 82% of the eFEDS–W4 sources are classified as X-ray AGN with log L X > 42 erg s –1 ; (ii) 67 and 24% of the objects have log(L IR /L ⊙ ) > 12 and 13, respectively; (iii) the relationship between L X and the 6 μm luminosity is consistent with that reported in previous works; and (iv) the relationship between the Eddington ratio and N H for the eFEDS–W4 sample and a comparison with a model prediction from a galaxy-merger simulation indicates that approximately 5.0% of the eFEDS–W4 sources in our sample are likely to be in an AGN-feedback phase, in which strong radiation pressure from the AGN blows out the surrounding material from the nuclear region. Thanks to the wide area coverage of eFEDS, we have been able to constrain the ranges of the physical properties of the WISE 22 μm-selected sample of AGNs at z < 4, providing a benchmark for forthcoming studies on a complete census of MIR galaxies selected from the full-depth eROSITA all-sky survey.

79 ASTRONOMY AND ASTROPHYSICS↗

Low bit rate coding of Earth science images

In this paper, the authors discuss compression based on some new ideas in vector quantization and their incorporation in a sub-band coding framework. Several variations are considered, which collectively address many of the individual compression needs within the earth science community. The approach taken in this work is based on some recent advances in the area of variable rate residual vector quantization (RVQ). This new RVQ method is considered separately and in conjunction with sub-band image decomposition. Very good results are achieved in coding a variety of earth science images. The last section of the paper provides some comparisons that illustrate the improvement in performance attributable to this approach relative the the JPEG coding standard.

Kossentini, Faouzi↗

On Hilbert-Huang Transform Based Synthesis of a Signal Contaminated by Radio Frequency Interference or Fringes

Norden E. Huang et al. had proposed and published the Hilbert-Huang Transform (HHT) concept correspondently in 1996, 1998. The HHT is a novel method for adaptive spectral analysis of non-linear and non-stationary signals. The HHT comprises two components: - the Huang Empirical Mode Decomposition (EMD), resulting in an adaptive data-derived basis of Intrinsic Mode functions (IMFs), and the Hilbert Spectral Analysis (HSA1) based on the Hilbert Transform for 1-dimension (1D) applied to the EMD IMF's outcome. Although paper describes the HHT concept in great depth, it does not contain all needed methodology to implement the HHT computer code. In 2004, Semion Kizhner and Karin Blank implemented the reference digital HHT real-time data processing system for 1D (HHT-DPS Version 1.4). The case for 2-Dimension (2D) (HHT2) proved to be difficult due to the computational complexity of EMD for 2D (EMD2) and absence of a suitable Hilbert Transform for 2D spectral analysis (HSA2). The real-time EMD2 and HSA2 comprise the real-time HHT2. Kizhner completed the real-time EMD2 and the HSA2 reference digital implementations respectively in 2013 & 2014. Still, the HHT2 outcome synthesis remains an active research area. This paper presents the initial concepts and preliminary results of HHT2-based synthesis and its application to processing of signals contaminated by Radio-Frequency Interference (RFI), as well as optical systems' fringe detection and mitigation at design stage. The Soil Moisture Active Passive (SMAP mission (SMAP) carries a radiometer instrument that measures Earth soil moisture at L1 frequency (1.4 GHz polarimetric - H, V, 3rd and 4th Stokes parameters). There is abundant RFI at L1 and because soil moisture is a strategic parameter, it is important to be able to recover the RFI-contaminated measurement samples (15% of telemetry). State-of-the-art only allows RFI detection and removes RFI-contaminated measurements. The HHT-based analysis and synthesis facilitates recovery of measurements contaminated by all kinds of RFI, including jamming [7-8]. The fringes are inherent in optical systems and multi-layer complex contour expensive coatings are employed to remove the unwanted fringes. HHT2-based analysis allows test image decomposition to analyze and detect fringes, and HHT2-based synthesis of useful image.

Spacecraft Electronics Equipment↗

High-throughput single-cell sorting by stimulated Raman-activated cell ejection

Raman-activated cell sorting isolates single cells in a nondestructive and label-free manner, but its throughput is limited by small spontaneous Raman scattering cross section. Coherent Raman scattering integrated with microfluidics enables high-throughput cell analysis, but faces challenges with small cells (<3 μm) and tissue sections. Here, we report stimulated Raman-activated cell ejection (S-RACE) that enables high-throughput single-cell sorting by integrating stimulated Raman imaging, in situ image decomposition, and laser-induced cell ejection. S-RACE allows ejection of live bacteria or fungi guided by their Raman signatures. Furthermore, S-RACE successfully sorted lipid-richRhodotorula glutiniscells from a cell mixture with a throughput of ~13 cells per second, and the sorting results were confirmed by downstream quantitative polymerase chain reaction. Beyond single cells, S-RACE shows high compatibility with tissue sections. Incorporating a closed-loop feedback control circuit further enables real-time SRS imaging-identification-ejection. In summary, S-RACE opens exciting opportunities for diverse single-cell sorting applications.

Science & Technology - Other Topics↗

Application of Cloude's target decomposition theorem to polarimetric imaging radar data

We apply Cloude's decomposition to imaging radar polarimetry. We derive the general expressions for the eigenvalues and eigenvectors for the case of terrain with reflection symmetry, and show in detail how the decomposition results can guide the interpretation of scattering from vegetated areas. For multi-frequency polarimetric radar measurements of a clear-cut area, the decomposition leads us to conclude that the vegetation is probably thin compared to even the C-band radar wavelength of 6 cm. For a forested area, we notice an increased amount of even number of reflection scattering at P-band and L-band, probably the result of penetration through the coniferous canopy resulting in trunk-ground double reflection scattering. The scattering for the forested area is still dominated by scattering from randomly oriented cylinders, however. It is found that these cylinders are thicker than in the case of clear-cut areas, leading us to conclude that scattering from the branches probably dominate in this case.

Vanzyl, Jakob J.↗

Application of Cloude's target decomposition theorem to polarimetric imaging radar data

In this paper we applied Cloude's decomposition to imaging radar polarimetry. We show in detail how the decomposition results can guide the interpretation of scattering from vegetated areas. For multifrequency polarimetric radar measurements of a clear-cut area, the decomposition leads us to conclude that the vegetation is probably thin compared to even the C-band radar wavelength of 6 cm. For a frosted area, we notice an increased amount of even number of reflection scattering at P-band and L-band, probably the result of penetration through the coniferous canopy resulting in trunk-ground double reflection scattering. However, the scattering for the forested area is still dominated by scattering from randomly oriented cylinders. It is found that these cylinders are thicker than in the case of clear-cut areas, leading us to conclude that scattering from the branches probably dominates in this case.

Vanzyl, Jakob J.↗

Inversion of imaging spectrometry data using singular value decomposition

The use of imaging spectrometers, which acquire data that are both spectrally contiguous images and spatially contiguous spectra, for quantitative remote sensing of the earth is addressed. Such data sets cannot be analyzed fully using either existing spectroscopic or image techniques. Singular value decomposition (SVD) is used here for spectral unmixing and determination of the spatial scales of mixing. It is shown that when it is used to invert the mixing endmember library, SVD allows more insight into library characteristics and more control of the inversion process than other commonly used matrix inversion techniques.

Boardman, Joe W.↗