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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
NASA NTRS1980

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.↗
NASA NTRS1986

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.↗
NASA NTRS1974

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.↗
NASA NTRS2003

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↗
NASA NTRS1988

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↗
NASA NTRS2013

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.↗
NASA NTRS1992

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↗
NASA NTRS2007

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.↗
NASA NTRS1973

Automated thematic mapping and change detection of ERTS-A images

The author has identified the following significant results. This investigation is concerned with the development of automated interpretation techniques for the recognition and identification of earth resources. The resources will be identified by using both multispectral and spatial signatures. Ground truth data and aircraft underflight photography will be used to train the recognition algorithms. The data processed will be RBV and MSS images acquired by the ERTS-1 satellite, over six tests sites located in the vicinities of: Phoenix, Arizona; Weslaco, Texas; Cascade Mountains, Washington; New Orleans, Louisiana; Salt Lake, Utah; and Salton Sea, California. The processed data will be thematic maps of resources consisting of annotated and outlined images. The seasonal changes of hydrologic and agricultural resources will also be identified. The results are expected to be applicable to a future automatic system of resource inventory and management.

Gramenopoulos, N.↗
NASA NTRS1973

Automated thematic mapping and change detection of ERTS-A images

There are no author-identified significant results in this report. This investigation is concerned with the development of automated interpretation techniques for the recognition and identification of earth resources. The resources will be identified by using both multispectral and spatial signatures. Ground truth data and aircraft underflight photography will be used to train the recognition algorithms. The data processed will be RBV and MSS images acquired by ERTS-1 satellite, over six test sites located in the vicinities of: Phoenix, Arizona; Weslaco, Texas; Cascade Mountains, Washington; New Orleans, Louisiana; Salt Lake City, Utah; and Salton Sea, California. The processed data will be thematic maps of resources consisting of annotated and outlined images. The seasonal changes of hydrologic and agricultural resources will also be identified. The results are expected to be applicable to a future automatic system of resource inventory and management.

Gramenopoulos, N.↗
NASA NTRS1997

Constellation Coverage Analysis

The design of satellite constellations require an understanding of the dynamic global coverage provided by the constellations. We have developed a fast and simple algorithm for detemining the global constellation coverage dynamically using image processing techniques. This approach provides a fast, powerful and simple method for the anysis of global constellation coverage.

Satellite↗
NASA NTRS1973

Terrain type recognition using ERTS-1 MSS images

For the automatic recognition of earth resources from ERTS-1 digital tapes, both multispectral and spatial pattern recognition techniques are important. Recognition of terrain types is based on spatial signatures that become evident by processing small portions of an image through selected algorithms. An investigation of spatial signatures that are applicable to ERTS-1 MSS images is described. Artifacts in the spatial signatures seem to be related to the multispectral scanner. A method for suppressing such artifacts is presented. Finally, results of terrain type recognition for one ERTS-1 image are presented.

Gramenopoulos, N.↗
NASA NTRS1978

Synthetic Aperture Radar (SAR) data processing

The available and optimal methods for generating SAR imagery for NASA applications were identified. The SAR image quality and data processing requirements associated with these applications were studied. Mathematical operations and algorithms required to process sensor data into SAR imagery were defined. The architecture of SAR image formation processors was discussed, and technology necessary to implement the SAR data processors used in both general purpose and dedicated imaging systems was addressed.

Beckner, F. L.↗
NASA NTRS2002

Performance of the Microwave Anisotropy Probe AST-201 Star Trackers

The Microwave Anisotropy Probe (MAP) was launched to create a full-sky map of the cosmic microwave background. MAP incorporates two modified Lockheed Martin AST-201 (Autonomous Star Tracker) star trackers. The AST-201 employs an eight element radiation hardened lens assembly which is used to focus an image on a charge coupled device (CCD). The CCD image is then processed by a star identification algorithm which outputs a three-axis attitude. A CCD-shift algorithm called Time Delayed Integration (TDI) was also included in each star tracker. In order to provide some radiation effect filtering during MAP's three to five phasing loop passes through the Van Allen radiation belts, a simple pixel filtering scheme was implemented, rather than using a more complex, but more robust windowing algorithm. The trackers also include a fiber optic data interface. This paper details the ground testing that was accomplished on the MAP trackers.

Ward, David K.↗
NASA NTRS2001

Mapping Ungulate Habitats in Yellowstone National Park with Airborne Hyperspectral Data

Mapping vegetation habitats of ungulates (e.g., bison, elk, and deer) is critical to the development of efficient wildlife management and monitoring practices in Yellowstone National Park. Image endmembers were chosen using the ENVI minimum noise fraction, pixel purity index, N-dimensional visualizer approach. The spectral angle mapper algorithm was used to classify the image. This process was applied to low altitude AVIRIS and Probe-1 hyperspectral imagery of the Lamar River/Soda Butte Creek confluence to map several ungulate habitats (e.g., grasses, sedge, sage, aspen, willow, and cottonwood. The results are being compared to field measurements and large-scale color infrared aerial photography to assess mapping accuracy. The use of AVIRIS and Probe-1 data enabled the examination of hyperspectral data collected at different spatial and spectral resolutions.

Terrie, Gregory↗
NASA NTRS2006

Phase Sensor for Aligning a Segmented Telescope Mirror

A phase sensor has been developed for use in aligning a segmented telescope mirror to within a fraction of a wavelength in piston. (As used here, piston signifies displacement of a mirror segment along the optical axis of the telescope.) Such precise alignment is necessary in order to realize the full benefit of the large aperture achievable through segmentation. This phase sensor is achromatic. It is based on two-wavelength shearing interferometry, and can be modified to utilize an extended or broad-band (e.g., white) light source. The sensor optics include a ruled diffraction grating and an imaging lens. The sensor can measure the piston shift between segments as well as aberrations of the segments. It can measure the surface error of an individual segment, making it possible to compensate for the error with optimal amount(s) of piston and/or tilt. The precise capture range of the sensor depends partly on the telescope design; the largest relative piston shifts measurable by use of this sensor are of the order of 100 m. The accuracy of the sensor also depends partly on the telescope design; in general, the accuracy is sufficient to enable alignment to within approximately half a wavelength. The interferometric image is digitized and processed by a simple algorithm in real time, and the output of the algorithm can be used to maintain alignment in real time, even in the presence of atmospheric turbulence. The sensor is robust. Through calibration, it can be made insensitive to (and, hence, tolerant of) misalignments and aberrations of its own optics, most aberrations of the telescope as a whole (in contradistinction to aberrations of individual segments), and most aberrations introduced by atmospheric turbulence

Stahl, Philip↗
NASA NTRS2013

Vectorized Rebinning Algorithm for Fast Data Down-Sampling

A vectorized rebinning (down-sampling) algorithm, applicable to N-dimensional data sets, has been developed that offers a significant reduction in computer run time when compared to conventional rebinning algorithms. For clarity, a two-dimensional version of the algorithm is discussed to illustrate some specific details of the algorithm content, and using the language of image processing, 2D data will be referred to as "images," and each value in an image as a "pixel." The new approach is fully vectorized, i.e., the down-sampling procedure is done as a single step over all image rows, and then as a single step over all image columns. Data rebinning (or down-sampling) is a procedure that uses a discretely sampled N-dimensional data set to create a representation of the same data, but with fewer discrete samples. Such data down-sampling is fundamental to digital signal processing, e.g., for data compression applications.

Dean, Bruce↗