Search NASA⌕ Search

SEARCH · Search NASA

Results for “Imaging algorithm”

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 685 records · Page 38

Coadding Techniques for Image-based Wavefront Sensing for Segmented-mirror Telescopes

Image-based wavefront sensing algorithms are being used to characterize optical performance for a variety of current and planned astronomical telescopes. Phase retrieval recovers the optical wavefront that correlates to a series of diversity-defocused point-spread functions (PSFs), where multiple frames can be acquired at each defocus setting. Multiple frames of data can be coadded in different ways; two extremes are in "image-plane space," to average the frames for each defocused PSF and use phase retrieval once on the averaged images, or in "pupil-plane space," to use phase retrieval on every set of PSFs individually and average the resulting wavefronts. The choice of coadd methodology is particularly noteworthy for segmented-mirror telescopes that are subject to noise that causes uncorrelated motions between groups of segments. Using data collected on and simulations of the James Webb Space Telescope Testbed Telescope (TBT) commissioned at Ball Aerospace, we show how different sources of noise (uncorrelated segment jitter, turbulence, and common-mode noise) and different parts of the optical wavefront, segment and global aberrations, contribute to choosing the coadd method. Of particular interest, segment piston is more accurately recovered in "image-plane space" coadding, while segment tip/tilt is recovered in "pupil-plane space" coadding.

Smith, Scott↗

Wavefront Control and Image Restoration with Less Computing

PseudoDiversity is a method of recovering the wavefront in a sparse- or segmented- aperture optical system typified by an interferometer or a telescope equipped with an adaptive primary mirror consisting of controllably slightly moveable segments. (PseudoDiversity should not be confused with a radio-antenna-arraying method called pseudodiversity.) As in the cases of other wavefront- recovery methods, the streams of wavefront data generated by means of PseudoDiversity are used as feedback signals for controlling electromechanical actuators of the various segments so as to correct wavefront errors and thereby, for example, obtain a clearer, steadier image of a distant object in the presence of atmospheric turbulence. There are numerous potential applications in astronomy, remote sensing from aircraft and spacecraft, targeting missiles, sighting military targets, and medical imaging (including microscopy) through such intervening media as cells or water. In comparison with prior wavefront-recovery methods used in adaptive optics, PseudoDiversity involves considerably simpler equipment and procedures and less computation. For PseudoDiversity, there is no need to install separate metrological equipment or to use any optomechanical components beyond those that are already parts of the optical system to which the method is applied. In Pseudo- Diversity, the actuators of a subset of the segments or subapertures are driven to make the segments dither in the piston, tilt, and tip degrees of freedom. Each aperture is dithered at a unique frequency at an amplitude of a half wavelength of light. During the dithering, images on the focal plane are detected and digitized at a rate of at least four samples per dither period. In the processing of the image samples, the use of different dither frequencies makes it possible to determine the separate effects of the various dithered segments or apertures. The digitized image-detector outputs are processed in the spatial-frequency (Fourier-transform) domain to obtain measures of the piston, tip, and tilt errors over each segment or subaperture. Once these measures are known, they are fed back to the actuators to correct the errors. In addition, measures of errors that remain after correction by use of the actuators are further utilized in an algorithm in which the image is phase-corrected in the spatial-frequency domain and then transformed back to the spatial domain at each time step and summed with the images from all previous time steps to obtain a final image having a greater signal-to-noise ratio (and, hence, a visual quality) higher than would otherwise be attainable.

Lyon, Richard G.↗

Time-resolved diffusion tomographic imaging in highly scattering turbid media

A method for imaging objects in highly scattering turbid media. According to one embodiment of the invention, the method involves using a plurality of intersecting source/detectors sets and time-resolving equipment to generate a plurality of time-resolved intensity curves for the diffusive component of light emergent from the medium. For each of the curves, the intensities at a plurality of times are then inputted into the following inverse reconstruction algorithm to form an image of the medium: X.sup.(k+1).spsp.T =?Y.sup.T W+X.sup.(k).spsp.T .LAMBDA.!?W.sup.T W+.LAMBDA.!.sup.-1 wherein W is a matrix relating output at detector position r.sub.d, at time t, to source at position r.sub.s, .LAMBDA. is a regularization matrix, chosen for convenience to be diagonal, but selected in a way related to the ratio of the noise, to fluctuations in the absorption (or diffusion) X.sub.j that we are trying to determine: .LAMBDA..sub.ij =.lambda..sub.j .delta..sub.ij with .lambda..sub.j = /<.DELTA.Xj.DELTA.Xj> Here Y is the data collected at the detectors, and X.sup.k is the kth iterate toward the desired absoption information.

Alfano, Robert R.↗

Mapping minerals, amorphous materials, environmental materials, vegetation, water, ice and snow, and other materials: The USGS tricorder algorithm

One of the challenges of Imaging Spectroscopy is the identification, mapping and abundance determination of materials, whether mineral, vegetable, or liquid, given enough spectral range, spectral resolution, signal to noise, and spatial resolution. Many materials show diagnostic absorption features in the visual and near infrared region (0.4 to 2.5 micrometers) of the spectrum. This region is covered by the modern imaging spectrometers such as AVIRIS. The challenge is to identify the materials from absorption bands in their spectra, and determine what specific analyses must be done to derive particular parameters of interest, ranging from simply identifying its presence to deriving its abundance, or determining specific chemistry of the material. Recently, a new analysis algorithm was developed that uses a digital spectral library of known materials and a fast, modified-least-squares method of determining if a single spectral feature for a given material is present. Clark et al. made another advance in the mapping algorithm: simultaneously mapping multiple minerals using multiple spectral features. This was done by a modified-least-squares fit of spectral features, from data in a digital spectral library, to corresponding spectral features in the image data. This version has now been superseded by a more comprehensive spectral analysis system called Tricorder.

Clark, Roger N.↗

Algorithm for automatic atmospheric corrections to visible and near-IR satellite imagery

An algorithm for automatic atmospheric correction of satellite imagery of the earth's surface is proposed which is applicable to low-resolution and high-resolution imagery of land areas. The algorithm is based on the satellite image being corrected and on the climatology of the area, and it requires that some pixels in the image correspond to dense dark vegetation as the surface cover. The algorithm is sensitive to the assumed reflectance of the dense dark vegetation, and the accuracy of the corrected surface reflectance is expected to be + or - 0.01. Using the method, aerosol optical thicknesses were derived from clear and hazy Landsat MSS images in the Washington, D.C. and Chesapeake Bay region, and the results are found to agree well with simultaneous sunphotometer ground measurements.

Kaufman, Yoram J.↗

High Contrast Integral Field Spectrograph (HCIFS): Multi-Spectral Wavefront Control and Reduced-Dimensional System Identification

Any High-contrast imaging instrument in a future large ground-based or space-based telescopes will include an integral field spectrograph (IFS) for measuring broadband starlight residuals and characterizing the exoplanet's atmospheric spectrum. In this paper, we report the development of a high-contrast integral field spectrograph (HCIFS) at Princeton University and demonstrate its application in multi-spectral wavefront control. Moreover, we propose and experimentally validate a new reduced-dimensional system identification algorithm for an IFS imaging system, which improves the system's wavefront control speed, contrast and computational and data storage efficiency.

He Sun↗

Interannual Variability of the Tropical Water Cycle: Capabilities in the TRMM Era and Challenges for GPM

Considerable uncertainty surrounds the issue of whether precipitation over the tropical oceans (30" NE) systematically changes with interannual sea-surface temperature (SST) anomalies that accompany El Nino (warm) and La Nina (cold) events. Although it is well documented that El Nino-Southern Oscillation (ENSO) events with marked SST changes over the tropical oceans, produce significant regional changes in precipitation, water vapor, and radiative fluxes in the tropics, we still cannot yet adequately quantify the associated net integrated changes to water and heat balance over the entire tropical oceanic or land sectors. Robertson et al., [2001 GRL] for example, showed that substantial disagreement exists among contemporary satellite estimates of interannual variations in tropical rainfall that are associated with SST changes. Berg et al., [2002 J. Climate] have documented the distinct differences between precipitation structure over the eastern and western Pacific ITCZ and noted how various satellite precipitation algorithms may respond quite differently to ENSO modulations of these precipitation regimes. Resolving this uncertainty is important since precipitation and latent heat release variations over land and ocean sectors are key components of the tropical heat balance in its most aggregated form. Rainfall estimates from the Tropical Rainfall Measuring Mission (TRMM) Precipitation Radar (PR) averaged over the tropical oceans have not solved this issue and, in fact, show marked differences with estimates from two TRMM Microwave Imager (TMI) passive microwave algorithms. In this paper we will focus on findings that uncertainties in microphysical assumptions necessitated by the single-frequency PR measurement pose difficulties for detecting climate-related precipitation signals. Recent work has shown that path-integrated attenuation derived from the effects of precipitation on the radar return from the ocean surface exhibits interannual variability that agrees closely with the TMI time series, yet the PR rainfall interannual variability (and attenuation derived predominantly from reflectivity) differs even in sign. We will explore these apparent inconsistencies and detail their impact on estimates of how ENSO events perturb the tropical rainfall. We will place these results in perspective by considering requirements for precipitation accuracy for global climate variability and change studies involving ENSO, monsoon dynamics and variations, and climate model improvement and validation. The discussion will conclude with an assessment of the implications of these findings for Global Precipitation Mission (GPM) requirements.

Robertson, Franklin R.↗

Efficient geometric rectification techniques for spectral analysis algorithm

The spectral analysis algorithm is a viable technique for processing synthetic aperture radar (SAR) data in near real time throughput rates by trading the image resolution. One major challenge of the spectral analysis algorithm is that the output image, often referred to as the range-Doppler image, is represented in the iso-range and iso-Doppler lines, a curved grid format. This phenomenon is known to be the fanshape effect. Therefore, resampling is required to convert the range-Doppler image into a rectangular grid format before the individual images can be overlaid together to form seamless multi-look strip imagery. An efficient algorithm for geometric rectification of the range-Doppler image is presented. The proposed algorithm, realized in two one-dimensional resampling steps, takes into consideration the fanshape phenomenon of the range-Doppler image as well as the high squint angle and updates of the cross-track and along-track Doppler parameters. No ground reference points are required.

Chang, C. Y.↗

Use of multiresolution wavelet feature pyramids for automatic registration of multisensor imagery

The problem of image registration, or the alignment of two or more images representing the same scene or object, has to be addressed in various disciplines that employ digital imaging. In the area of remote sensing, just like in medical imaging or computer vision, it is necessary to design robust, fast, and widely applicable algorithms that would allow automatic registration of images generated by various imaging platforms at the same or different times and that would provide subpixel accuracy. One of the main issues that needs to be addressed when developing a registration algorithm is what type of information should be extracted from the images being registered, to be used in the search for the geometric transformation that best aligns them. The main objective of this paper is to evaluate several wavelet pyramids that may be used both for invariant feature extraction and for representing images at multiple spatial resolutions to accelerate registration. We find that the bandpass wavelets obtained from the steerable pyramid due to Simoncelli performs best in terms of accuracy and consistency, while the low-pass wavelets obtained from the same pyramid give the best results in terms of the radius of convergence. Based on these findings, we propose a modification of a gradient-based registration algorithm that has recently been developed for medical data. We test the modified algorithm on several sets of real and synthetic satellite imagery.

Evaluation Studies↗

Brain segmentation and the generation of cortical surfaces

This paper describes methods for white matter segmentation in brain images and the generation of cortical surfaces from the segmentations. We have developed a system that allows a user to start with a brain volume, obtained by modalities such as MRI or cryosection, and constructs a complete digital representation of the cortical surface. The methodology consists of three basic components: local parametric modeling and Bayesian segmentation; surface generation and local quadratic coordinate fitting; and surface editing. Segmentations are computed by parametrically fitting known density functions to the histogram of the image using the expectation maximization algorithm [DLR77]. The parametric fits are obtained locally rather than globally over the whole volume to overcome local variations in gray levels. To represent the boundary of the gray and white matter we use triangulated meshes generated using isosurface generation algorithms [GH95]. A complete system of local parametric quadratic charts [JWM+95] is superimposed on the triangulated graph to facilitate smoothing and geodesic curve tracking. Algorithms for surface editing include extraction of the largest closed surface. Results for several macaque brains are presented comparing automated and hand surface generation. Copyright 1999 Academic Press.

NASA Discipline Neuroscience↗

Online randomized interpolative decomposition with a posteriori error estimator for temporal PDE data reduction

Traditional low-rank approximation is a powerful tool for compressing large data matrices that arise in simulations of partial differential equations (PDEs), but suffers from high computational cost and requires several passes over the PDE data. The compressed data may also lack interpretability thus making it difficult to identify feature patterns from the original data. Here, to address these issues, we present an online randomized algorithm to compute the interpolative decomposition (ID) of large-scale data matrices in situ. Compared to previous randomized IDs that used the QR decomposition to determine the column basis, we adopt a streaming ridge leverage score-based column subset selection algorithm that dynamically selects proper basis columns from the data and thus avoids an extra pass over the data to compute the coefficient matrix of the ID. In particular, we adopt a single-pass error estimator based on the non-adaptive Hutch++ algorithm to provide real-time error approximation for determining the best coefficients. As a result, our approach only needs a single pass over the original data and thus is suitable for large and high-dimensional matrices stored outside of core memory or generated in PDE simulations. A strategy to improve the accuracy of the reconstructed data gradient, when desired, within the ID framework is also presented. We provide numerical experiments on turbulent channel flow and ignition simulations, and on the NSTX Gas Puff Image dataset, comparing our algorithm with the offline ID algorithm to demonstrate its utility in real-world applications.

Column subset selection↗

Spatiotemporal Learning in Power Modules: Wavelet-Enhanced Forecasting of Thermomechanical Degradation

Detecting internal defects in power electronics packages is critical for their performance and reliability, especially under extreme operating conditions, as these defects can lead to catastrophic failure if not properly addressed. Confocal scanning acoustic microscopy (C-SAM) plays a key role in the nondestructive evaluation of bond layer degradation within a power electronics package by detecting defects such as delamination, voids, and cracks. However, accurately quantifying and predicting these defects from C-SAM images remains a significant challenge due to the low noise-to-signal ratio, which typically arises from both imaging process and bond patterns itself. In this paper, we explore machine learning strategies for processing C-SAM images and providing predictive models of defect growth. We use C-SAM images of sintered copper and sintered silver samples, which are obtained under accelerated thermal experiments, as the representative dataset for our study. We investigate the effect of Fourier transforms and wavelet transforms on these datasets to remove high-frequency noise and address noise across multiple scales with histogram equalization to enhance the contrast and improve the visibility of defects. As a result, defect boundaries can be clearly distinguished, enabling more accurate tracking of their growth over time. We then employ different time-series forecasting algorithms on the denoised images to formulate an image-based lifetime prediction model. Statistical models and deep-learning techniques are trained on images obtained in the early stages of thermal shock, and defect growth in the later stages is predicted. Our work serves as a preliminary attempt to improve the accuracy of lifetime prediction models of power electronics packages, which is critical under extreme operating environments.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Closed-Form Approximation of the Total Variation Proximal Operator

Total variation (TV) is a widely used function for regularizing imaging inverse problems that is particularly appropriate for images whose underlying structure is piecewise constant. TV regularized optimization problems are typically solved using proximal methods, but the way in which they are applied is constrained by the absence of a closed-form expression for the proximal operator of the TV function. A closed-form approximation of the TV proximal operator has previously been proposed, but its accuracy was not theoretically explored in detail. Here, we address this gap by making several new theoretical contributions, proving that the approximation leads to a proximal operator of some convex function, it is equivalent to a gradient descent step on a smoothed version of TV, and that its error can be fully characterized and controlled with its scaling parameter. We experimentally validate our theoretical results on image denoising and sparse-view computed tomography (CT) image reconstruction.

97 MATHEMATICS AND COMPUTING↗

Longitudinal Phase Space Tomography for the Booster Synchrotron

Efforts in the study of the longitudinal behavior of charged particles in the Fermilab Booster can be catalyzed with an image of the two-dimensional phase space distribution. In the past, tomography had been employed in the reconstruction of the phase space in accelerators such as the Recycler at Fermilab and the Proton Synchrotron Booster at CERN. However, such a capability had yet to realize for the Fermilab Booster synchrotron. In this work, the first successful tomographic phase space reconstruction of a low-energy Booster bunch is presented along with validation metrics. A numerical turn-by-turn model of the longitudinal particle dynamics in the Booster has been implemented, which utilizes a fast, map-based particle transport algorithm. Using a sinogram generated from the Wall Current Monitor signal, the iterative reconstruction algorithm recovers a discretized image of the original phase space distribution at variable resolution. The reconstruction result shows low root-mean-square error and a rapid convergence toward the solution, providing strong evidence of accuracy. Future and ongoing work includes modeling high-energy bunches above transition and using tomography to infer certain machine parameters such as synchronous phase, peak gap voltage, and synchronous energy in addition to the phase space distribution.

Ebeid, Safi [Unlisted; Fermilab]↗

Longitudinal Phase Space Tomography for the Booster Synchrotron

Efforts in the study of the longitudinal behavior of charged particles in the Fermilab Booster can be catalyzed with an image of the two-dimensional phase space distribution. In the past, tomography has been extensively employed in the reconstruction of the phase space in accelerators such as the Recycler at Fermilab and the Proton Synchrotron Booster at CERN. However, such a capability had yet to realize for the Fermilab Booster synchrotron. In this work, the first successful tomographic phase space reconstruction of a low-energy Booster bunch is presented along with validation metrics. A numerical turn-by-turn model of the longitudinal particle dynamics in the Booster has been implemented, which utilizes a fast, map-based particle transport algorithm. Using a sinogram generated from the Wall Current Monitor, the iterative reconstruction algorithm recovers a discretized image of the original phase space distribution at variable resolution. The reconstruction result shows low root-mean-square error and a rapid convergence toward the solution, providing strong evidence of accuracy. Future and ongoing work includes modeling high-energy bunches above transition and using tomography to infer certain machine parameters such as synchronous phase, peak gap voltage, and synchronous energy in addition to the phase space distribution.

Ebeid, Safi [Unlisted]↗

Longitudinal Phase Space Tomography for the Booster Synchrotron (Abstract Only)

Efforts in the study of the longitudinal behavior of charged particles in the Fermilab Booster can be catalyzed with an image of the two-dimensional phase space distribution. In the past, tomography has been extensively employed in the reconstruction of the phase space in accelerators such as the Recycler at Fermilab and the Proton Synchrotron Booster at CERN. However, such a capability had yet to realize for the Fermilab Booster synchrotron. In this work, the first successful tomographic phase space reconstruction of a low-energy Booster bunch is presented along with validation metrics. A numerical turn-by-turn model of the longitudinal particle dynamics in the Booster has been implemented, which utilizes a fast, map-based particle transport algorithm. Using a sinogram generated from the Wall Current Monitor, the iterative reconstruction algorithm recovers a discretized image of the original phase space distribution at variable resolution. The reconstruction result shows low root-mean-square error and a rapid convergence toward the solution, providing strong evidence of accuracy. Future and ongoing work includes modeling high-energy bunches above transition and using tomography to infer certain machine parameters such as synchronous phase, peak gap voltage, and synchronous energy in addition to the phase space distribution.

Ebeid, Safi [Unlisted, US]↗

Lossless Astronomical Image Compression and the Effects of Random Noise

In this paper we compare a variety of modern image compression methods on a large sample of astronomical images. We begin by demonstrating from first principles how the amount of noise in the image pixel values sets a theoretical upper limit on the lossless compression ratio of the image. We derive simple procedures for measuring the amount of noise in an image and for quantitatively predicting how much compression will be possible. We then compare the traditional technique of using the GZIP utility to externally compress the image, with a newer technique of dividing the image into tiles, and then compressing and storing each tile in a FITS binary table structure. This tiled-image compression technique offers a choice of other compression algorithms besides GZIP, some of which are much better suited to compressing astronomical images. Our tests on a large sample of images show that the Rice algorithm provides the best combination of speed and compression efficiency. In particular, Rice typically produces 1.5 times greater compression and provides much faster compression speed than GZIP. Floating point images generally contain too much noise to be effectively compressed with any lossless algorithm. We have developed a compression technique which discards some of the useless noise bits by quantizing the pixel values as scaled integers. The integer images can then be compressed by a factor of 4 or more. Our image compression and uncompression utilities (called fpack and funpack) that were used in this study are publicly available from the HEASARC web site.Users may run these stand-alone programs to compress and uncompress their own images.

Pence, William↗

ALDF Data Retrieval Algorithms for Validating the Optical Transient Detector (OTD) and the Lightning Imaging Sensor (LIS)

A linear algebraic solution is provided for the problem of retrieving the location and time of occurrence of lightning ground strikes from in Advanced Lightning Direction Finder (ALDF) network. The ALDF network measures field strength, magnetic bearing, and arrival time of lightning radio emissions and solutions for the plane (i.e.. no Earth curvature) are provided that implement all of these measurements. The accuracy of the retrieval method is tested using computer-simulated data sets and the relative influence of bearing and arrival time data on the outcome of the final solution is formally demonstrated. The algorithm is sufficiently accurate to validate NASA's Optical Transient Detector (OTD) and Lightning Imaging System (LIS). We also introduce a quadratic planar solution that is useful when only three arrival time measurements are available. The algebra of the quadratic root results are examined in detail to clarify what portions of the analysis region lead to fundamental ambiguities in source location. Complex root results are shown to be associated with the presence of measurement errors when the lightning source lies near an outer sensor baseline of the ALDF network. For arbitrary noncollinear network geometries and in the absence of measurement errors, it is shown that the two quadratic roots are equivalent (no source location ambiguity) on the outer sensor baselines. The accuracy of the quadratic planar method is tested with computer-generated data sets and the results are generally better than those obtained from the three station linear planar method when bearing errors are about 2 degrees.

Koshak, W. J.↗