Search NASA⌕ Search

SEARCH · Search NASA

Results for “Image processing 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 289 records · Page 16

Laboratory Testbed Verification of Data Post-Processing Strategies for the WFIRST Coronagraph Instrument

One of the objectives of the WFIRST Coronagraph Instrument is to demonstrate post-processing algorithms for space-based exoplanet imaging data in the regime of very high contrast ratios (< 1E-8). We analyzed two 15-hour time series of laboratory images acquired with prototype coronagraph designs on a vacuum chamber testbed at JPL. These data sets enabled us to test the performance of reference differential imaging (RDI) PSF subtraction as a function of time and Euclidean (L2) speckle pattern distance. Starting from an analytical relationship between speckle pattern stability and classical subtraction gain, we compared the classical subtraction result to those of the KLIP RDI algorithm. In both data sets, KLIP RDI contrast gains are typically 3-4× greater than those of classical subtraction. These results suggest that a diverse reference PSF library will enable a significant gain in sensitivity beyond that suggested by the raw, frame-to-frame speckle pattern stability.

Ygouf, Marie↗

A quantum algorithm for string matching

Algorithms that search for a pattern within a larger data-set appear ubiquitously in text and image processing. Here, we present an explicit, circuit-level implementation of a quantum pattern-matching algorithm that matches a search string (pattern) of length M inside a longer text of length N. Our algorithm has a time complexity of $\tildeO$($\sqrt{N}$), while the space complexity remains modest at O(N+ M). We report the quantum gate counts relevant for both pre-fault-tolerant and fault-tolerant regimes.

Physics↗

Multi-frequency Tomography Radar Observations of Snow Stratigraphy at Fraser during SnowEx

SnowEx is a multi-year airborne snow campaign led by NASA. The purpose of SnowEx is to figure out how much water is stored in Earth’s terrestrial snow-covered regions. As part of the 2017 NASA SnowEx campaign, we deployed a portable triple-frequency (9.6GHz, 13.5GHz and 17.2GHz) and fully polarimetric frequency-modulated continuous-wave (FMCW) radar at Fraser, Colorado. The radar was installed on a 60cmx60cm frame to enable a full reconstruction of the three-dimensional variability per each radar channel. The tomography technique uses the radar echo from the multiple viewing positions and provides a unique access to the vertical structure of the snow layer. With current setup, the range resolution is 30cm. In this paper, we will review the radar design and signal-processing algorithm – time domain back projection. The generated vertical images show the snow stratigraphy, which is consistent with ground snow pit measurement. The continuous operation demonstrates diurnal thawing and refreezing process. The snow density is retrieved by comparing to the snow free image.

Esteban-Fernandez, Daniel↗

A statistical model for radar images of agricultural scenes

The presently derived and validated statistical model for radar images containing many different homogeneous fields predicts the probability density functions of radar images of entire agricultural scenes, thereby allowing histograms of large scenes composed of a variety of crops to be described. Seasat-A SAR images of agricultural scenes are accurately predicted by the model on the basis of three assumptions: each field has the same SNR, all target classes cover approximately the same area, and the true reflectivity characterizing each individual target class is a uniformly distributed random variable. The model is expected to be useful in the design of data processing algorithms and for scene analysis using radar images.

Frost, V. S.↗

A Step Toward Working with Untrusted Ground Stations

We are witnessing a shift toward outsourcing satellite and ground station services to third-party commercial entities. As with any enterprise, these third parties can be vulnerable to cyber compromise, including image tampering and deepfake injection. The multimedia community is beginning to establish standards and technology to enable authenticity verification of multimedia created and edited by others. While appealing to the remote sensing domain, the nature of raw satellite imagery is incompatible with the proposed change verification tools, resulting in the need for a means to validate updates made to image products. We present a simple method for verifying a specific class of algorithms. Our inverse processing approach eliminates the need to see the original image as the reversed data can be checked against an original digital signature. We demonstrate our approach on basic image restoration routines and conclude with a discussion on open challenges and next steps.

97 MATHEMATICS AND COMPUTING↗

Mapping biomass for a northern forest ecosystem using multi-frequency SAR data

Image processing methods for mapping standing biomass for a forest in Maine, using NASA/JPL airborne synthetic aperture radar (AIRSAR) polarimeter data, are presented. By examining the dependence of backscattering on standing biomass, it is determined that the ratio of HV backscattering from a longer wavelength (P- or L-band) to a shorter wavelength (C) is a good combination for mapping total biomass. This ratio enhances the correlation of the image signature to the standing biomass and compensates for a major part of the variations in backscattering attributed to radar incidence angle. The image processing methods used include image calibration, ratioing, filtering, and segmentation. The image segmentation algorithm uses both means and variances of the image, and it is combined with the image filtering process. Preliminary assessment of the resultant biomass maps suggests that this is a promising method.

Ranson, K. J.↗

A digital system to produce imagery from SAR data

This paper describes a digital processing algorithm and its associated system design for producing images from Synthetic Aperture Radar (SAR) data. The proposed system uses the Fast Fourier Transform (FFT) approach to perform the two-dimensional correlation process. The range migration problem, which is often a major obstacle to efficient processing, can be alleviated by approximating the locus of echoes from a point target by several linear segments. SAR data corresponding to each segment is correlated separately, and the results are coherently summed to produce full-resolution images. This processing approach exhibits greatly improved computation efficiency relative to conventional digital processing methods.

Wu, C.↗

A digital fast correlation approach to produce SEASAT SAR imagery

This paper describes a digital processing algorithm and its associated system design for producing images from SEASAT Synthetic Aperture Radar (SAR) data. The proposed system uses the fast Fourier transform approach to perform the two-dimensional correlation process. The range migration problem, which is often a major obstacle to efficient processing, can be alleviated by approximating the locus of echoes from a point target by several linear segments. SAR data corresponding to each segment is correlated separately, and the results are coherently summed to produce full-resolution images. This processing approach exhibits high computation efficiency and simple processing control functions. It is particularly attractive for software implementation based on general purpose computer. Results of this implementation and examples of digitally correlated SEASAT SAR imagery are discussed

Wu, C.↗

A software-based system which produces SEASAT SAR imagery

A digital processing algorithm and its associated system design for producing images from SEASAT synthetic aperture radar (SAR) data is described. The proposed system uses the fast Fourier transform approach to perform the two dimensional correlation process. The range migration problem can be alleviated by approximating the locus of echoes from a point target by several linear segments. Data corresponding to each segment are correlated separately and the results are coherently summed to produce full resolution images. This processing approach exhibits high computation efficiency and simple processing control functions. It is particularly attractive for software implementation based on general purpose computers. Results of this implementation and examples of digitally correlated SEASAT SAR imagery are discussed.

Wu, C.↗

New algorithms for microwave measurements of ocean winds Applications to Seasat and the special sensor microwave imager

Improved second generation wind algorithms are used to process the three month Seasat SMMR and SASS data sets. The new algorithms are derived without using in situ anemometer measurements. All known biases in the sensors prime measurements are removed, and the algorithms prime model functions are internally self-consistent. The computed SMMR and SASS winds are collocated and compared on a 10 km cell-by-cell basis, giving a total of 115444 wind comparisons. The comparisons are done using three different sets of SMMR channels. When the 6.6H SMMR channel is used for wind retrieval, the SMMR and SASS winds agree to within 1.3 m/s over the SASS primary swath. At nadir where the radar cross section is less sensitive to wind, the agreement degrades to 1.9 m/s. The agreement is very good for winds from 0 to 15 m/s. Above 15 m/s, the off-nadir SASS winds are consistently lower than the SMMR winds, while at nadir the high SASS winds are greater than SMMR's. When 10.7H is used for the SMMR wind channel, the SMMR/SASS wind comparisons are not quite as good. When the frequency of the wind channel is increased to 18 GHz, the SMMR/SASS agreement substantially degrades to about 5 m/S.

Wentz, F. J.↗

Automated thematic mapping and change detection of ERTS-A images

The author has identified the following significant results. A diffraction pattern analysis of MSS images led to the development of spatial signatures for farm land, urban areas and mountains. Four spatial features are employed to describe the spatial characteristics of image cells in the digital data. Three spectral features are combined with the spatial features to form a seven dimensional vector describing each cell. Then, the classification of the feature vectors is accomplished by using the maximum likelihood criterion. It was determined that the recognition accuracy with the maximum likelihood criterion depends on the statistics of the feature vectors. It was also determined that for a given geographic area the statistics of the classes remain invariable for a period of a month, but vary substantially between seasons. Three ERTS-1 images from the Phoenix, Arizona area were processed, and recognition rates between 85% and 100% were obtained for the terrain classes of desert, farms, mountains, and urban areas. To eliminate the need for training data, a new clustering algorithm has been developed. Seven ERTS-1 images from four test sites have been processed through the clustering algorithm, and high recognition rates have been achieved for all terrain classes.

Gramenopoulos, N.↗

A Fast Implementation of the ISOCLUS Algorithm

Unsupervised clustering is a fundamental tool in numerous image processing and remote sensing applications. For example, unsupervised clustering is often used to obtain vegetation maps of an area of interest. This approach is useful when reliable training data are either scarce or expensive, and when relatively little a priori information about the data is available. Unsupervised clustering methods play a significant role in the pursuit of unsupervised classification. One of the most popular and widely used clustering schemes for remote sensing applications is the ISOCLUS algorithm, which is based on the ISODATA method. The algorithm is given a set of n data points (or samples) in d-dimensional space, an integer k indicating the initial number of clusters, and a number of additional parameters. The general goal is to compute a set of cluster centers in d-space. Although there is no specific optimization criterion, the algorithm is similar in spirit to the well known k-means clustering method in which the objective is to minimize the average squared distance of each point to its nearest center, called the average distortion. One significant feature of ISOCLUS over k-means is that clusters may be merged or split, and so the final number of clusters may be different from the number k supplied as part of the input. This algorithm will be described in later in this paper. The ISOCLUS algorithm can run very slowly, particularly on large data sets. Given its wide use in remote sensing, its efficient computation is an important goal. We have developed a fast implementation of the ISOCLUS algorithm. Our improvement is based on a recent acceleration to the k-means algorithm, the filtering algorithm, by Kanungo et al.. They showed that, by storing the data in a kd-tree, it was possible to significantly reduce the running time of k-means. We have adapted this method for the ISOCLUS algorithm. For technical reasons, which are explained later, it is necessary to make a minor modification to the ISOCLUS specification. We provide empirical evidence, on both synthetic and Landsat image data sets, that our algorithm's performance is essentially the same as that of ISOCLUS, but with significantly lower running times. We show that our algorithm runs from 3 to 30 times faster than a straightforward implementation of ISOCLUS. Our adaptation of the filtering algorithm involves the efficient computation of a number of cluster statistics that are needed for ISOCLUS, but not for k-means.

Memarsadeghi, Nargess↗

Range data description based on multiple characteristics

An algorithm for describing range images based on Mean curvature (H) and Gaussian curvature (K) is presented. Range images are unique in that they directly approximate the physical surfaces of a real world 3-D scene. The curvature parameters are derived from the fundamental theorems of differential geometry and provides visible invariant pixel labels that can be used to characterize the scene. The sign of H and K can be used to classify each pixel into one of eight possible surface types. Due to the sensitivity of these parameters to noise the resulting HK-sing map does not directly identify surfaces in the range images and must be further processed. A region growing algorithm based on modeling the scene points with a Markov Random Field (MRF) of variable neighborhood size and edge models is suggested. This approach allows the integration of information from multiple characteristics in an efficient way. The performance of the proposed algorithm on a number of synthetic and real range images is discussed.

Al-Hujazi, Ezzet↗

High throughput automated characterization of enamel microstructure using synchrotron tomography and optical flow imaging

The remarkable damage-tolerance of enamel has been attributed to its hierarchical microstructure and the organized bands of decussated rods. A thorough characterization of the microscale rod evolution within the enamel is needed to elucidate this complex structure. While prior efforts in this area have made use of single particle tracking to track a single rod evolution to various degrees of success, such a process can be both computationally and labor intensive, limited to the evolution path of a single rod, and is therefore prone to error from potentially tracking outliers. Particle image velocimetry (PIV) is a well-established algorithm to derive field information from image sequences for processes that are time-dependent, such as fluid flows and structural deformation. In this work, we demonstrate the use of PIV in extracting the full-field microstructural distribution of rods within the enamel. Further, enamel samples from a wild African lion were analyzed using high-energy synchrotron X-ray micro-tomography. Results from the PIV analysis provide sufficient full-field information to reconstruct the growth of individual rods that can potentially enable rapid analysis of complex microstructures from high resolution synchrotron datasets. Such information can serve as a template for designing damage-tolerant bioinspired structures for advanced manufacturing.

36 MATERIALS SCIENCE↗

Investigation of a Cross-Correlation Based Optical Strain Measurement Technique for Detecting radial Growth on a Rotating Disk

The Aeronautical Sciences Project under NASA`s Fundamental Aeronautics Program is extremely interested in the development of novel measurement technologies, such as optical surface measurements in the internal parts of a flow path, for in situ health monitoring of gas turbine engines. In situ health monitoring has the potential to detect flaws, i.e. cracks in key components, such as engine turbine disks, before the flaws lead to catastrophic failure. In the present study, a cross-correlation imaging technique is investigated in a proof-of-concept study as a possible optical technique to measure the radial growth and strain field on an already cracked sub-scale turbine engine disk under loaded conditions in the NASA Glenn Research Center`s High Precision Rotordynamics Laboratory. The optical strain measurement technique under investigation offers potential fault detection using an applied high-contrast random speckle pattern and imaging the pattern under unloaded and loaded conditions with a CCD camera. Spinning the cracked disk at high speeds induces an external load, resulting in a radial growth of the disk of approximately 50.0-im in the flawed region and hence, a localized strain field. When imaging the cracked disk under static conditions, the disk will be undistorted; however, during rotation the cracked region will grow radially, thus causing the applied particle pattern to be .shifted`. The resulting particle displacements between the two images will then be measured using the two-dimensional cross-correlation algorithms implemented in standard Particle Image Velocimetry (PIV) software to track the disk growth, which facilitates calculation of the localized strain field. In order to develop and validate this optical strain measurement technique an initial proof-of-concept experiment is carried out in a controlled environment. Using PIV optimization principles and guidelines, three potential speckle patterns, for future use on the rotating disk, are developed and investigated in the controlled experiment. A range of known shifts are induced on the patterns; reference and data images are acquired before and after the induced shift, respectively, and the images are processed using the cross-correlation algorithms in order to determine the particle displacements. The effectiveness of each pattern at resolving the known shift is evaluated and discussed in order to choose the most suitable pattern to be implemented onto a rotating disk in the Rotordynamics Lab. Although testing on the rotating disk has not yet been performed, the driving principles behind the development of the present optical technique are based upon critical aspects of the future experiment, such as the amount of expected radial growth, disk analysis, and experimental design and are therefore addressed in the paper.

Clem, Michelle M.↗

Model-based vision for space applications

This paper describes a method for tracking moving image features by combining spatial and temporal edge information with model based feature information. The algorithm updates the two-dimensional position of object features by correlating predicted model features with current image data. The results of the correlation process are used to compute an updated model. The algorithm makes use of a high temporal sampling rate with respect to spatial changes of the image features and operates in a real-time multiprocessing environment. Preliminary results demonstrate successful tracking for image feature velocities between 1.1 and 4.5 pixels every image frame. This work has applications for docking, assembly, retrieval of floating objects and a host of other space-related tasks.

Chaconas, Karen↗

Iterative-Transform Phase Retrieval Using Adaptive Diversity

A phase-diverse iterative-transform phase-retrieval algorithm enables high spatial-frequency, high-dynamic-range, image-based wavefront sensing. [The terms phase-diverse, phase retrieval, image-based, and wavefront sensing are defined in the first of the two immediately preceding articles, Broadband Phase Retrieval for Image-Based Wavefront Sensing (GSC-14899-1).] As described below, no prior phase-retrieval algorithm has offered both high dynamic range and the capability to recover high spatial-frequency components. Each of the previously developed image-based phase-retrieval techniques can be classified into one of two categories: iterative transform or parametric. Among the modifications of the original iterative-transform approach has been the introduction of a defocus diversity function (also defined in the cited companion article). Modifications of the original parametric approach have included minimizing alternative objective functions as well as implementing a variety of nonlinear optimization methods. The iterative-transform approach offers the advantage of ability to recover low, middle, and high spatial frequencies, but has disadvantage of having a limited dynamic range to one wavelength or less. In contrast, parametric phase retrieval offers the advantage of high dynamic range, but is poorly suited for recovering higher spatial frequency aberrations. The present phase-diverse iterative transform phase-retrieval algorithm offers both the high-spatial-frequency capability of the iterative-transform approach and the high dynamic range of parametric phase-recovery techniques. In implementation, this is a focus-diverse iterative-transform phaseretrieval algorithm that incorporates an adaptive diversity function, which makes it possible to avoid phase unwrapping while preserving high-spatial-frequency recovery. The algorithm includes an inner and an outer loop (see figure). An initial estimate of phase is used to start the algorithm on the inner loop, wherein multiple intensity images are processed, each using a different defocus value. The processing is done by an iterative-transform method, yielding individual phase estimates corresponding to each image of the defocus-diversity data set. These individual phase estimates are combined in a weighted average to form a new phase estimate, which serves as the initial phase estimate for either the next iteration of the iterative-transform method or, if the maximum number of iterations has been reached, for the next several steps, which constitute the outerloop portion of the algorithm. The details of the next several steps must be omitted here for the sake of brevity. The overall effect of these steps is to adaptively update the diversity defocus values according to recovery of global defocus in the phase estimate. Aberration recovery varies with differing amounts as the amount of diversity defocus is updated in each image; thus, feedback is incorporated into the recovery process. This process is iterated until the global defocus error is driven to zero during the recovery process. The amplitude of aberration may far exceed one wavelength after completion of the inner-loop portion of the algorithm, and the classical iterative transform method does not, by itself, enable recovery of multi-wavelength aberrations. Hence, in the absence of a means of off-loading the multi-wavelength portion of the aberration, the algorithm would produce a wrapped phase map. However, a special aberration-fitting procedure can be applied to the wrapped phase data to transfer at least some portion of the multi-wavelength aberration to the diversity function, wherein the data are treated as known phase values. In this way, a multiwavelength aberration can be recovered incrementally by successively applying the aberration-fitting procedure to intermediate wrapped phase maps. During recovery, as more of the aberration is transferred to the diversity function following successive iterations around the ter loop, the estimated phase ceases to wrap in places where the aberration values become incorporated as part of the diversity function. As a result, as the aberration content is transferred to the diversity function, the phase estimate resembles that of a reference flat.

Dean, Bruce H.↗

Expediting DECam Multimessenger Counterpart Searches with Convolutional Neural Networks

Searches for counterparts to multimessenger events with optical imagers use difference imaging to detect new transient sources. However, even with existing artifact-detection algorithms, this process simultaneously returns several classes of false positives: false detections from poor-quality image subtractions, false detections from low signal-to-noise images, and detections of preexisting variable sources. Currently, human visual inspection to remove the false positives is a central part of multimessenger follow-up observations, but when next generation gravitational wave and neutrino detectors come online and increase the rate of multimessenger events, the visual inspection process will be prohibitively expensive. We approach this problem with two convolutional neural networks operating on the difference imaging outputs. The first network focuses on removing false detections and demonstrates an accuracy of 92% on our data set. The second network focuses on sorting all real detections by the probability of being a transient source within a host galaxy and distinguishes between various classes of images that previously required additional human inspection. We find the number of images requiring human inspection will decrease by a factor of 1.5 using our approach alone and a factor of 3.6 using our approach in combination with existing algorithms, facilitating rapid multimessenger counterpart identification by the astronomical community.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗