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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
NASA NTRS2013

Ionospheric Specifications for SAR Interferometry (ISSI)

The ISSI software package is designed to image the ionosphere from space by calibrating and processing polarimetric synthetic aperture radar (PolSAR) data collected from low Earth orbit satellites. Signals transmitted and received by a PolSAR are subject to the Faraday rotation effect as they traverse the magnetized ionosphere. The ISSI algorithms combine the horizontally and vertically polarized (with respect to the radar system) SAR signals to estimate Faraday rotation and ionospheric total electron content (TEC) with spatial resolutions of sub-kilometers to kilometers, and to derive radar system calibration parameters. The ISSI software package has been designed and developed to integrate the algorithms, process PolSAR data, and image as well as visualize the ionospheric measurements. A number of tests have been conducted using ISSI with PolSAR data collected from various latitude regions using the phase array-type L-band synthetic aperture radar (PALSAR) onboard Japan Aerospace Exploration Agency's Advanced Land Observing Satellite mission, and also with Global Positioning System data. These tests have demonstrated and validated SAR-derived ionospheric images and data correction algorithms.

Pi, Xiaoqing↗
NASA NTRS2002

Software for Partly Automated Recognition of Targets

The Feature Analyst is a computer program for assisted (partially automated) recognition of targets in images. This program was developed to accelerate the processing of high-resolution satellite image data for incorporation into geographic information systems (GIS). This program creates an advanced user interface that embeds proprietary machine-learning algorithms in commercial image-processing and GIS software. A human analyst provides samples of target features from multiple sets of data, then the software develops a data-fusion model that automatically extracts the remaining features from selected sets of data. The program thus leverages the natural ability of humans to recognize objects in complex scenes, without requiring the user to explain the human visual recognition process by means of lengthy software. Two major subprograms are the reactive agent and the thinking agent. The reactive agent strives to quickly learn the user's tendencies while the user is selecting targets and to increase the user's productivity by immediately suggesting the next set of pixels that the user may wish to select. The thinking agent utilizes all available resources, taking as much time as needed, to produce the most accurate autonomous feature-extraction model possible.

Opitz, David↗
NASA NTRS2003

Software for Partly Automated Recognition of Targets

The Feature Analyst is a computer program for assisted (partially automated) recognition of targets in images. This program was developed to accelerate the processing of high-resolution satellite image data for incorporation into geographic information systems (GIS). This program creates an advanced user interface that embeds proprietary machine-learning algorithms in commercial image-processing and GIS software. A human analyst provides samples of target features from multiple sets of data, then the software develops a data-fusion model that automatically extracts the remaining features from selected sets of data. The program thus leverages the natural ability of humans to recognize objects in complex scenes, without requiring the user to explain the human visual recognition process by means of lengthy software. Two major subprograms are the reactive agent and the thinking agent. The reactive agent strives to quickly learn the user s tendencies while the user is selecting targets and to increase the user s productivity by immediately suggesting the next set of pixels that the user may wish to select. The thinking agent utilizes all available resources, taking as much time as needed, to produce the most accurate autonomous feature-extraction model possible.

Opitz, David↗
NASA NTRS1986

Color constancy - A method for recovering surface spectral reflectance

An algorithm has been developed for estimating the surface reflectance functions of objects in a scene with incomplete knowledge of the spectral power distribution of the ambient light. An image processing system employing this algorithm can assign colors that are constant despite changes in the lighting of the scene; this capability is essential to correct color rendering in photography, TV, and in the construction of artificial visual systems for robotics. Attention is given to the way in which constraints on lights and surfaces in the environment make color-constancy possible for a visual system, and the algorithm's implications for human color vision are discussed.

Maloney, L. T.↗
NASA NTRS2009

Trajectory Reconstruction of the ST-9 Sounding Rocket Experiment Using IMU and Landmark Data

This paper presents trajectory reconstruction of the ST-9 sounding rocket experiment using the onboard IMU data and descent imagery. The raw IMU accelerometer measurements are first converted into inertial acceleration and then used in trajectory integration. The descent images are pre-processed using a map-matching algorithm and unique landmarks for each image are created. Using the converted IMU data and descent images, the result from dead-reckoning and the kinematic-fix approaches are first compared with the GPS measurements. Then, both the IMU data and landmarks are processed together using a batch least-squares filter and the position, velocity, stochastic acceleration, and camera orientation of each image are estimated. The reconstructed trajectory is compared with the GPS data and the corresponding formal uncertainties are presented. The result shows that IMU data and descent images processed with a batch filter algorithm provide the trajectory accuracy required for pin-point landing.

Park, Ryan S.↗
DOE OSTI2024

Extraction of Vibration Data with Imaging

To date, the primary sensing technology used to measure the vibration response has been accelerometers and strain gages mounted directly to the structure and using either wired or, more recently, wireless telemetry. Cost issues with these sensors and the associated data acquisition systems typically limit the numbers that are deployed on in situ structures. Although there are a few structures with larger sensing counts that in some cases exceed over 1000 sensors, more typical numbers range from ten to one hundred sensors resulting in low spatial resolution when they are applied to physically large systems. When one considers that nuclear power plant structures usually have complex geometries, material properties, connectivity and boundary conditions, it is clear these current approaches to vibration measurements can only provide limited information about a system’s dynamics response characteristics. As an alternative, many non-contact measurement technologies have emerged, including point wise measurement methods such as Global Positioning System (GPS), microwave interferometry, and laser Doppler vibrometry (LDV), as well as simultaneous full-field measurement methods such as electronic speckle pattern interferometry, holography interferometry, and muon tomography, some of which can provide high spatial resolution measurements. Among these methods, digital video imaging techniques have emerged as a feasible solution for full-field vibration measurements that provide significantly more detailed dynamic response information because every pixel becomes a measurement point. Furthermore, recent advances in image processing and computer vision algorithms have been successfully used to process video data for experimental and operational modal analysis. Such full-field measurements have the potential to significantly improve many current structural assessment procedures including system identification (modal parameter estimation), structural health monitoring, load reconstruction, model validation, and model updating. Furthermore, more recent full-field imaging techniques can be accomplished with relatively low-cost, commercially-available off-the-shelf cameras. However, these measurement procedures have other limitations that must be considered such as the ability to only measure visibly accessible points on a structure and a more limited dynamic range and bandwidth than can be achieved with accelerometers or strain gages.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
NASA NTRS2016

DeepSAT: A Deep Learning Approach to Tree-Cover Delineation in 1-m NAIP Imagery for the Continental United States

High resolution tree cover classification maps are needed to increase the accuracy of current land ecosystem and climate model outputs. Limited studies are in place that demonstrates the state-of-the-art in deriving very high resolution (VHR) tree cover products. In addition, most methods heavily rely on commercial softwares that are difficult to scale given the region of study (e.g. continents to globe). Complexities in present approaches relate to (a) scalability of the algorithm, (b) large image data processing (compute and memory intensive), (c) computational cost, (d) massively parallel architecture, and (e) machine learning automation. In addition, VHR satellite datasets are of the order of terabytes and features extracted from these datasets are of the order of petabytes. In our present study, we have acquired the National Agriculture Imagery Program (NAIP) dataset for the Continental United States at a spatial resolution of 1-m. This data comes as image tiles (a total of quarter million image scenes with ~60 million pixels) and has a total size of ~65 terabytes for a single acquisition. Features extracted from the entire dataset would amount to ~8-10 petabytes. In our proposed approach, we have implemented a novel semi-automated machine learning algorithm rooted on the principles of "deep learning" to delineate the percentage of tree cover. Using the NASA Earth Exchange (NEX) initiative, we have developed an end-to-end architecture by integrating a segmentation module based on Statistical Region Merging, a classification algorithm using Deep Belief Network and a structured prediction algorithm using Conditional Random Fields to integrate the results from the segmentation and classification modules to create per-pixel class labels. The training process is scaled up using the power of GPUs and the prediction is scaled to quarter million NAIP tiles spanning the whole of Continental United States using the NEX HPC supercomputing cluster. An initial pilot over the state of California spanning a total of 11,095 NAIP tiles covering a total geographical area of 163,696 sq. miles has produced true positive rates of around 88 percent for fragmented forests and 74 percent for urban tree cover areas, with false positive rates lower than 2 percent for both landscapes.

Imagery↗
NASA NTRS2008

Symmetric Phase-Only Filtering in Particle-Image Velocimetry

Symmetrical phase-only filtering (SPOF) can be exploited to obtain substantial improvements in the results of data processing in particle-image velocimetry (PIV). In comparison with traditional PIV data processing, SPOF PIV data processing yields narrower and larger amplitude correlation peaks, thereby providing more-accurate velocity estimates. The higher signal-to-noise ratios associated with the higher amplitude correlation peaks afford greater robustness and reliability of processing. SPOF also affords superior performance in the presence of surface flare light and/or background light. SPOF algorithms can readily be incorporated into pre-existing algorithms used to process digitized image data in PIV, without significantly increasing processing times. A summary of PIV and traditional PIV data processing is prerequisite to a meaningful description of SPOF PIV processing. In PIV, a pulsed laser is used to illuminate a substantially planar region of a flowing fluid in which particles are entrained. An electronic camera records digital images of the particles at two instants of time. The components of velocity of the fluid in the illuminated plane can be obtained by determining the displacements of particles between the two illumination pulses. The objective in PIV data processing is to compute the particle displacements from the digital image data. In traditional PIV data processing, to which the present innovation applies, the two images are divided into a grid of subregions and the displacements determined from cross-correlations between the corresponding sub-regions in the first and second images. The cross-correlation process begins with the calculation of the Fourier transforms (or fast Fourier transforms) of the subregion portions of the images. The Fourier transforms from the corresponding subregions are multiplied, and this product is inverse Fourier transformed, yielding the cross-correlation intensity distribution. The average displacement of the particles across a subregion results in a displacement of the correlation peak from the center of the correlation plane. The velocity is then computed from the displacement of the correlation peak and the time between the recording of the two images. The process as described thus far is performed for all the subregions. The resulting set of velocities in grid cells amounts to a velocity vector map of the flow field recorded on the image plane. In traditional PIV processing, surface flare light and bright background light give rise to a large, broad correlation peak, at the center of the correlation plane, that can overwhelm the true particle- displacement correlation peak. This has made it necessary to resort to tedious image-masking and background-subtraction procedures to recover the relatively small amplitude particle-displacement correlation peak. SPOF is a variant of phase-only filtering (POF), which, in turn, is a variant of matched spatial filtering (MSF). In MSF, one projects a first image (denoted the input image) onto a second image (denoted the filter) as part of a computation to determine how much and what part of the filter is present in the input image. MSF is equivalent to cross-correlation. In POF, the frequency-domain content of the MSF filter is modified to produce a unitamplitude (phase-only) object. POF is implemented by normalizing the Fourier transform of the filter by its magnitude. The advantage of POFs is that they yield correlation peaks that are sharper and have higher signal-to-noise ratios than those obtained through traditional MSF. In the SPOF, these benefits of POF can be extended to PIV data processing. The SPOF yields even better performance than the POF approach, which is uniquely applicable to PIV type image data. In SPOF as now applied to PIV data processing, a subregion of the first image is treated as the input image and the corresponding subregion of the second image is treated as the filter. The Fourier transforms from both the firs and second- image subregions are normalized by the square roots of their respective magnitudes. This scheme yields optimal performance because the amounts of normalization applied to the spatial-frequency contents of the input and filter scenes are just enough to enhance their high-spatial-frequency contents while reducing their spurious low-spatial-frequency content. As a result, in SPOF PIV processing, particle-displacement correlation peaks can readily be detected above spurious background peaks, without need for masking or background subtraction.

Wemet, Mark P.↗
NASA NTRS2011

Optimal Padding for the Two-Dimensional Fast Fourier Transform

One-dimensional Fast Fourier Transform (FFT) operations work fastest on grids whose size is divisible by a power of two. Because of this, padding grids (that are not already sized to a power of two) so that their size is the next highest power of two can speed up operations. While this works well for one-dimensional grids, it does not work well for two-dimensional grids. For a two-dimensional grid, there are certain pad sizes that work better than others. Therefore, the need exists to generalize a strategy for determining optimal pad sizes. There are three steps in the FFT algorithm. The first is to perform a one-dimensional transform on each row in the grid. The second step is to transpose the resulting matrix. The third step is to perform a one-dimensional transform on each row in the resulting grid. Steps one and three both benefit from padding the row to the next highest power of two, but the second step needs a novel approach. An algorithm was developed that struck a balance between optimizing the grid pad size with prime factors that are small (which are optimal for one-dimensional operations), and with prime factors that are large (which are optimal for two-dimensional operations). This algorithm optimizes based on average run times, and is not fine-tuned for any specific application. It increases the amount of times that processor-requested data is found in the set-associative processor cache. Cache retrievals are 4-10 times faster than conventional memory retrievals. The tested implementation of the algorithm resulted in faster execution times on all platforms tested, but with varying sized grids. This is because various computer architectures process commands differently. The test grid was 512 512. Using a 540 540 grid on a Pentium V processor, the code ran 30 percent faster. On a PowerPC, a 256x256 grid worked best. A Core2Duo computer preferred either a 1040x1040 (15 percent faster) or a 1008x1008 (30 percent faster) grid. There are many industries that can benefit from this algorithm, including optics, image-processing, signal-processing, and engineering applications.

Dean, Bruce H.↗
NASA NTRS1994

Electronic photography at NASA Langley Research Center

The field of photography began a metamorphosis several years ago which promises to fundamentally change how images are captured, transmitted, and output. At this time the metamorphosis is still in the early stages, but already new processes, hardware, and software are allowing many individuals and organizations to explore the entry of imaging into the information revolution. Exploration at this time is prerequisite to leading expertise in the future, and a number of branches at LaRC have ventured into electronic and digital imaging. Their progress until recently has been limited by two factors: the lack of an integrated approach and the lack of an electronic photographic capability. The purpose of the research conducted was to address these two items. In some respects, the lack of electronic photographs has prevented application of an integrated imaging approach. Since everything could not be electronic, the tendency was to work with hard copy. Over the summer, the Photographics Section has set up an Electronic Photography Laboratory. This laboratory now has the capability to scan film images, process the images, and output the images in a variety of forms. Future plans also include electronic capture capability. The current forms of image processing available include sharpening, noise reduction, dust removal, tone correction, color balancing, image editing, cropping, electronic separations, and halftoning. Output choices include customer specified electronic file formats which can be output on magnetic or optical disks or over the network, 4400 line photographic quality prints and transparencies to 8.5 by 11 inches, and 8000 line film negatives and transparencies to 4 by 5 inches. The problem of integrated imaging involves a number of branches at LaRC including Visual Imaging, Research Printing and Publishing, Data Visualization and Animation, Advanced Computing, and various research groups. These units must work together to develop common approaches to image processing and archiving. The ultimate goal is to be able to search for images using an on-line database and image catalog. These images could then be retrieved over the network as needed, along with information on the acquisition and processing prior to storage. For this goal to be realized, a number of standard processing protocols must be developed to allow the classification of images into categories. Standard series of processing algorithms can then be applied to each category (although many of these may be adaptive between images). Since the archived image files would be standardized, it should also be possible to develop standard output processing protocols for a number of output devices. If LaRC continues the research effort begun this summer, it may be one of the first organizations to develop an integrated approach to imaging. As such, it could serve as a model for other organizations in government and the private sector.

Holm, Jack M.↗
DOE OSTI2023

Quantum JPEG

The joint photographic expert group algorithm compresses a digital image by filtering its high spatial-frequency components. Similarly, we introduce a quantum algorithm that uses the quantum Fourier transform to discard the high spatial-frequency qubits of an image, downsampling it to a lower resolution. This allows one to capture, compress, and send images even with limited quantum resources for storage and communication. We show under which conditions this protocol is advantageous with respect to its classical counterpart.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A globally sampled high-resolution hand-labeled validation dataset for evaluating surface water extent maps

Effective monitoring of global water resources is increasingly critical due to climate change and population growth. Advancements in remote sensing technology, specifically in spatial, spectral, and temporal resolutions, are revolutionizing water resource monitoring, leading to more frequent and high-quality surface water extent maps using various techniques such as traditional image processing and machine learning algorithms. However, satellite imagery datasets contain trade-offs that result in inconsistencies in performance, such as disparities in measurement principles between optical (e.g., Sentinel-2) and radar (e.g., Sentinel-1) sensors and differences in spatial and spectral resolutions among optical sensors. Therefore, developing accurate and robust surface water mapping solutions requires independent validations from multiple datasets to identify potential biases within the imagery and algorithms. However, high-quality validation datasets are expensive to build, and few contain information on water resources. For this purpose, we introduce a globally sampled, high-spatial-resolution dataset labeled using 3 m PlanetScope imagery. Our surface water extent dataset comprises 100 images, each with a size of 1024×1024 pixels, which were sampled using a stratified random sampling strategy covering all 14 biomes. We highlighted urban and rural regions, lakes, and rivers, including braided rivers and coastal regions. We evaluated two surface water extent mapping methods using our dataset – Dynamic World, based on Sentinel-2, and the NASA IMPACT model, based on Sentinel-1. Dynamic World achieved a mean intersection over union (IoU) of 72.16 % and F1 score of 79.70 %, while the NASA IMPACT model had a mean IoU of 57.61 % and F1 score of 65.79 %. Performance varied substantially across biomes, highlighting the importance of evaluating models on diverse landscapes to assess their generalizability and robustness. Our dataset can be used to analyze satellite products and methods, providing insights into their advantages and drawbacks. Our dataset offers a unique tool for analyzing satellite products, aiding the development of more accurate and robust surface water monitoring solutions. The dataset can be accessed via https://doi.org/10.25739/03nt-4f29.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS2011

Options for Parallelizing a Planning and Scheduling Algorithm

Space missions have a growing interest in putting multi-core processors onboard spacecraft. For many missions processing power significantly slows operations. We investigate how continual planning and scheduling algorithms can exploit multi-core processing and outline different potential design decisions for a parallelized planning architecture. This organization of choices and challenges helps us with an initial design for parallelizing the CASPER planning system for a mesh multi-core processor. This work extends that presented at another workshop with some preliminary results.

parallel algorithms↗
DOE OSTI2022

Automated processing of environmental transmission electron microscopy images for quantification of thin film dewetting and carbon nanotube nucleation dynamics

We report scalable production of carbon nanotubes (CNTs) requires catalysts and reaction conditions that provide high nucleation efficiency. In situ characterization methods such as environmental transmission electron microscopy (ETEM) can reveal fundamental mechanisms of synthesis, but to date have primarily provided qualitative observations on small sample sizes. Here, quantitative analysis is performed using high-resolution, high-rate video capture of ETEM experimentation coupled with automated image processing, involving computer vision algorithms and convolutional neural networks. By this approach, we detect distinct nanoparticle formation from an alumina-supported iron thin film and subsequent CNT nucleation from the nanoparticles. The statistical summary of particles in each video shows that, compared to a H 2 -only atmosphere, pretreatment of the catalyst with carbon added to the H 2 atmosphere results in a smaller average particle diameter, a 2-fold increase in particle density (to 5300 particles/μm 2 ), a 3-fold increase in CNT nucleation efficiency (to 92%), and more than a 5-fold increase in CNT density (to 4800/μm 2 ). Addition of carbon during exposure to H 2 is also more effective than NH 3 at dewetting the catalyst film and increasing the CNT nucleation efficiency, in spite of NH 3 being a stronger reducing agent for iron. Insights from this study are applicable to improving CNT yield and productivity in both batch-style and continuous processes.

25 ENERGY STORAGE↗
NASA NTRS2019

AWARE: An Algorithm for the Automated Characterization of EUV Waves in the Solar Atmosphere

Conference Poster-Introduction Extreme ultraviolet (EUV) waves are large-scale propagating disturbances observed in the solar corona, frequently associated with coronal mass ejections and flares (Thompson et al., 1999, Thompson & Myers 2009). They appear as faint, extended structures propagating from a source region across the structured solar corona, making them difficult to isolate and measure. To further the understanding of EUV waves, we have constructed the Automated Wave Analysis and REduction (AWARE) algorithm for the measurement of EUV waves (Ireland et al, submitted). AWARE is implemented using the persistence transform, simple image processing operations and the RANSAC algorithm.

Ireland, Jack↗
NASA NTRS1982

1982 International Geoscience and Remote Sensing Symposium, Munich, West Germany, June 1-4, 1982, Digest. Volumes 1 & 2

Theoretical and experimental data which have defined and/or extended the effectiveness of remote sensing operations are explored, with consideration given to both scientific and commercial activities. The remote sensing of soil moisture, the sea surface, and oil slicks is discussed, as are programs using satellites for studying geodynamics and geodesy, currents and waves, and coastal zones. NASA, Canadian, and Japanese radar and microwave passive and active systems are described, together with algorithms and techniques for image processing and classification. The SAR-580 project is outlined, and attention is devoted to satellite applications in investigations of the structure of the atmosphere, agriculture and land use, and geology. Design and performance features of various optical scanner, radar, and multispectral data processing systems and procedures are detailed.

Source record↗
NASA NTRS1990

Truncation Of Images For Correlation

Correlation performed on relatively small computer. Proposed method for processing video images in slowly changing scenes, renditions of complicated objects truncated to points, lines, polygons, or other simplified geometrical objects. Processed by image-correlating algorithms to extract information: recognize features and to track displacements of features in subsequent image frames to determine velocities. Entails correlation of far fewer data than original images.

Shimada, Katsunori↗
NASA NTRS1991

Hypercube technology

The JPL designed MARKIII hypercube supercomputer has been in application service since June 1988 and has had successful application to a broad problem set including electromagnetic scattering, discrete event simulation, plasma transport, matrix algorithms, neural network simulation, image processing, and graphics. Currently, problems that are not homogeneous are being attempted, and, through this involvement with real world applications, the software is evolving to handle the heterogeneous class problems efficiently.

Parker, Jay W.↗