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

A programmable image compression system

A programmable image compression system which has the necessary flexibility to address diverse imaging needs is described. It can compress and expand single frame video images (monochrome or color) as well as documents and graphics (black and white or color) for archival or transmission applications. Through software control, the compression mode can be set for lossless or controlled quality coding; the image size and bit depth can be varied; and the image source and destination devices can be readily changed. Despite the large combination of image data types, image sources, and algorithms, the system provides a simple consistent interface to the programmer. This system (OPTIPAC) is based on the TITMS320C25 digital signal processing (DSP) chip and has been implemented as a co-processor board for an IBM PC-AT compatible computer. The underlying philosophy can readily be applied to different hardware platforms. By using multiple DSP chips or incorporating algorithm specific chips, the compression and expansion times can be significantly reduced to meet performance requirements.

Farrelle, Paul M.↗

Development of a machine vision system for automated structural assembly

Research is being conducted at the LaRC to develop a telerobotic assembly system designed to construct large space truss structures. This research program was initiated within the past several years, and a ground-based test-bed was developed to evaluate and expand the state of the art. Test-bed operations currently use predetermined ('taught') points for truss structural assembly. Total dependence on the use of taught points for joint receptacle capture and strut installation is neither robust nor reliable enough for space operations. Therefore, a machine vision sensor guidance system is being developed to locate and guide the robot to a passive target mounted on the truss joint receptacle. The vision system hardware includes a miniature video camera, passive targets mounted on the joint receptacles, target illumination hardware, and an image processing system. Discrimination of the target from background clutter is accomplished through standard digital processing techniques. Once the target is identified, a pose estimation algorithm is invoked to determine the location, in three-dimensional space, of the target relative to the robots end-effector. Preliminary test results of the vision system in the Automated Structural Assembly Laboratory with a range of lighting and background conditions indicate that it is fully capable of successfully identifying joint receptacle targets throughout the required operational range. Controlled optical bench test results indicate that the system can also provide the pose estimation accuracy to define the target position.

Sydow, P. Daniel↗

Algorithm for Lossless Compression of Calibrated Hyperspectral Imagery

A two-stage predictive method was developed for lossless compression of calibrated hyperspectral imagery. The first prediction stage uses a conventional linear predictor intended to exploit spatial and/or spectral dependencies in the data. The compressor tabulates counts of the past values of the difference between this initial prediction and the actual sample value. To form the ultimate predicted value, in the second stage, these counts are combined with an adaptively updated weight function intended to capture information about data regularities introduced by the calibration process. Finally, prediction residuals are losslessly encoded using adaptive arithmetic coding. Algorithms of this type are commonly tested on a readily available collection of images from the Airborne Visible/Infrared Imaging Spectrometer (AVIRIS) hyperspectral imager. On the standard calibrated AVIRIS hyperspectral images that are most widely used for compression benchmarking, the new compressor provides more than 0.5 bits/sample improvement over the previous best compression results. The algorithm has been implemented in Mathematica. The compression algorithm was demonstrated as beneficial on 12-bit calibrated AVIRIS images.

Kiely, Aaron B.↗

NASA Tech Briefs, December 2007

Topics include: Ka-Band TWT High-Efficiency Power Combiner for High-Rate Data Transmission; Reusable, Extensible High-Level Data-Distribution Concept; Processing Satellite Imagery To Detect Waste Tire Piles; Monitoring by Use of Clusters of Sensor-Data Vectors; Circuit and Method for Communication Over DC Power Line; Switched Band-Pass Filters for Adaptive Transceivers; Noncoherent DTTLs for Symbol Synchronization; High-Voltage Power Supply With Fast Rise and Fall Times; Waveguide Calibrator for Multi-Element Probe Calibration; Four-Way Ka-Band Power Combiner; Loss-of-Control-Inhibitor Systems for Aircraft; Improved Underwater Excitation-Emission Matrix Fluorometer; Metrology Camera System Using Two-Color Interferometry; Design and Fabrication of High-Efficiency CMOS/CCD Imagers; Foam Core Shielding for Spacecraft CHEM-Based Self-Deploying Planetary Storage Tanks Sequestration of Single-Walled Carbon Nanotubes in a Polymer PPC750 Performance Monitor Application-Program-Installer Builder Using Visual Odometry to Estimate Position and Attitude Design and Data Management System Simple, Script-Based Science Processing Archive Automated Rocket Propulsion Test Management Online Remote Sensing Interface Fusing Image Data for Calculating Position of an Object Implementation of a Point Algorithm for Real-Time Convex Optimization Handling Input and Output for COAMPS Modeling and Grid Generation of Iced Airfoils Automated Identification of Nucleotide Sequences Balloon Design Software Rocket Science 101 Interactive Educational Program Creep Forming of Carbon-Reinforced Ceramic-Matrix Composites Dog-Bone Horns for Piezoelectric Ultrasonic/Sonic Actuators Benchtop Detection of Proteins Recombinant Collagenlike Proteins Remote Sensing of Parasitic Nematodes in Plants Direct Coupling From WGM Resonator Disks to Photodetectors Using Digital Radiography To Image Liquid Nitrogen in Voids Multiple-Parameter, Low-False-Alarm Fire-Detection Systems Mosaic-Detector-Based Fluorescence Spectral Imager Plasmoid Thruster for High Specific-Impulse Propulsion Analysis Method for Quantifying Vehicle Design Goals Improved Tracking of Targets by Cameras on a Mars Rover Sample Caching Subsystem Multistage Passive Cooler for Spaceborne Instruments GVIPS Models and Software Stowable Energy-Absorbing Rocker-Bogie Suspensions

Source record↗

IFSAR Simulation Using the Shooting and Bouncing Ray Technique

Interferometric Synthetic Aperture Radar (IFSAR) is a technique that allows an automated way to carry out terrain mapping. IFSAR is carried out by first generating a SAR image pair from two antennas that are spatially separated. The phase difference between the SAR image pair is proportional to the topography. After registering the SAR images, the difference in phase in each pixel is extracted to generate an interferogram. Since the phase can only be measured within 2pi radians, phase unwrapping is carried out to extract the absolute phase for each pixel that will be proportional to the local height. While IFSAR algorithm is typically applied to measurement data, it is useful to develop an IFSAR simulator to develop a better understanding of the IFSAR technique. The IFSAR simulator can be used in choosing system parameters, experimenting with processing procedures and mission planning. In this paper we will present an IFSAR simulation methodology to simulate the interferogram based on the shooting and bouncing ray (SBR) technique. SBR is a standard ray-tracing technique used to simulate scattering from large, complex targets. SBR is carried out by shooting rays at the target or scene. At the exit point of each ray, a ray-tube integration is done to find its contribution to the total field. A fast algorithm has been developed for the SBR for simulating SAR images of complex targets. In the IFSAR simulation, we build upon the fast SAR simulation technique. Given the antenna pair configuration, radar system parameters and the geometrical description of the scene, we first simulate two SAR images from each antenna. After post processing the two SAR images, we generate an interferogram. Phase unwrapping is then performed on the interferogram to arrive at the desired terrain map. We will present results from the SBR-based IFSAR simulator. The results will include terrain map reconstruction of urban environments. The reconstruction will be compared to the ground truth to examine the fidelity of the simulation. We will also investigate the effect of multi-bounce scattering in urban environments on phase unwrapping and reconstruction.

Houshmand, Bijan↗

Hierarchical Image Segmentation of Remotely Sensed Data using Massively Parallel GNU-LINUX Software

A hierarchical set of image segmentations is a set of several image segmentations of the same image at different levels of detail in which the segmentations at coarser levels of detail can be produced from simple merges of regions at finer levels of detail. In [1], Tilton, et a1 describes an approach for producing hierarchical segmentations (called HSEG) and gave a progress report on exploiting these hierarchical segmentations for image information mining. The HSEG algorithm is a hybrid of region growing and constrained spectral clustering that produces a hierarchical set of image segmentations based on detected convergence points. In the main, HSEG employs the hierarchical stepwise optimization (HSWO) approach to region growing, which was described as early as 1989 by Beaulieu and Goldberg. The HSWO approach seeks to produce segmentations that are more optimized than those produced by more classic approaches to region growing (e.g. Horowitz and T. Pavlidis, [3]). In addition, HSEG optionally interjects between HSWO region growing iterations, merges between spatially non-adjacent regions (i.e., spectrally based merging or clustering) constrained by a threshold derived from the previous HSWO region growing iteration. While the addition of constrained spectral clustering improves the utility of the segmentation results, especially for larger images, it also significantly increases HSEG s computational requirements. To counteract this, a computationally efficient recursive, divide-and-conquer, implementation of HSEG (RHSEG) was devised, which includes special code to avoid processing artifacts caused by RHSEG s recursive subdivision of the image data. The recursive nature of RHSEG makes for a straightforward parallel implementation. This paper describes the HSEG algorithm, its recursive formulation (referred to as RHSEG), and the implementation of RHSEG using massively parallel GNU-LINUX software. Results with Landsat TM data are included comparing RHSEG with classic region growing.

Tilton, James C.↗

Neutrino event selection in the MicroBooNE liquid argon time projection chamber using Wire-Cell 3D imaging, clustering, and charge-light matching

An accurate and efficient event reconstruction is required to realize the full scientific capability of liquid argon time projection chambers (LArTPCs). The current and future neutrino experiments that rely on massive LArTPCs create a need for new ideas and reconstruction approaches. Wire-Cell, proposed in recent years, is a novel tomographic event reconstruction method for LArTPCs. The Wire-Cell 3D imaging approach capitalizes on charge, sparsity, time, and geometry information to reconstruct a topology-agnostic 3D image of the ionization electrons prior to pattern recognition. A second novel method, the many-to-many charge-light matching, then pairs the TPC charge activity to the detected scintillation light signal, thus enabling a powerful rejection of cosmic-ray muons in the MicroBooNE detector. A robust processing of the scintillation light signal and an appropriate clustering of the reconstructed 3D image are fundamental to this technique. In this paper, we describe the principles and algorithms of these techniques and their successful application in the MicroBooNE experiment. A quantitative evaluation of the performance of these techniques is presented. Using these techniques, a 95% efficient pre-selection of neutrino charged-current events is achieved with a 30-fold reduction of non-beam-coincident cosmic-ray muons, and about 80% of the selected neutrino charged-current events are reconstructed with at least 70% completeness and 80% purity.

3D imaging↗

A VLSI implementation for synthetic aperture radar image processing

A simple physical model for the Synthetic Aperture Radar (SAR) is presented. This model explains the one dimensional and two dimensional nature of the received SAR signal in the range and azimuth directions. A time domain correlator, its algorithm, and features are explained. The correlator is ideally suited for VLSI implementation. A real time SAR architecture using these correlators is proposed. In the proposed architecture, the received SAR data is processed using one dimensional correlators for determining the range while two dimensional correlators are used to determine the azimuth of a target. The architecture uses only three different types of custom VLSI chips and a small amount of memory.

Premkumar, A.↗

Knowledge Driven Image Mining with Mixture Density Mercer Kernels

This paper presents a new methodology for automatic knowledge driven image mining based on the theory of Mercer Kernels; which are highly nonlinear symmetric positive definite mappings from the original image space to a very high, possibly infinite dimensional feature space. In that high dimensional feature space, linear clustering, prediction, and classification algorithms can be applied and the results can be mapped back down to the original image space. Thus, highly nonlinear structure in the image can be recovered through the use of well-known linear mathematics in the feature space. This process has a number of advantages over traditional methods in that it allows for nonlinear interactions to be modelled with only a marginal increase in computational costs. In this paper, we present the theory of Mercer Kernels, describe its use in image mining, discuss a new method to generate Mercer Kernels directly from data, and compare the results with existing algorithms on data from the MODIS (Moderate Resolution Spectral Radiometer) instrument taken over the Arctic region. We also discuss the potential application of these methods on the Intelligent Archive, a NASA initiative for developing a tagged image data warehouse for the Earth Sciences.

Srivastava, Ashok N.↗

Knowledge Driven Image Mining with Mixture Density Mercer Kernals

This paper presents a new methodology for automatic knowledge driven image mining based on the theory of Mercer Kernels, which are highly nonlinear symmetric positive definite mappings from the original image space to a very high, possibly infinite dimensional feature space. In that high dimensional feature space, linear clustering, prediction, and classification algorithms can be applied and the results can be mapped back down to the original image space. Thus, highly nonlinear structure in the image can be recovered through the use of well-known linear mathematics in the feature space. This process has a number of advantages over traditional methods in that it allows for nonlinear interactions to be modelled with only a marginal increase in computational costs. In this paper we present the theory of Mercer Kernels; describe its use in image mining, discuss a new method to generate Mercer Kernels directly from data, and compare the results with existing algorithms on data from the MODIS (Moderate Resolution Spectral Radiometer) instrument taken over the Arctic region. We also discuss the potential application of these methods on the Intelligent Archive, a NASA initiative for developing a tagged image data warehouse for the Earth Sciences.

Srivastava, Ashok N.↗

On the Implementation of a Land Cover Classification System for SAR Images Using Khoros

The Synthetic Aperture Radar (SAR) sensor is widely used to record data about the ground under all atmospheric conditions. The SAR acquired images have very good resolution which necessitates the development of a classification system that process the SAR images to extract useful information for different applications. In this work, a complete system for the land cover classification was designed and programmed using the Khoros, a data flow visual language environment, taking full advantages of the polymorphic data services that it provides. Image analysis was applied to SAR images to improve and automate the processes of recognition and classification of the different regions like mountains and lakes. Both unsupervised and supervised classification utilities were used. The unsupervised classification routines included the use of several Classification/Clustering algorithms like the K-means, ISO2, Weighted Minimum Distance, and the Localized Receptive Field (LRF) training/classifier. Different texture analysis approaches such as Invariant Moments, Fractal Dimension and Second Order statistics were implemented for supervised classification of the images. The results and conclusions for SAR image classification using the various unsupervised and supervised procedures are presented based on their accuracy and performance.

Medina Revera, Edwin J.↗

Investigation of registration algorithms for the automatic tile processing system

The Robotic Tile Inspection System (RTPS), under development in NASA-KSC, is expected to automate the processes of post-flight re-water-proofing and the process of inspection of the Shuttle heat absorbing tiles. An important task of the robot vision sub-system is to register the 'real-world' coordinates with the coordinates of the robot model of the Shuttle tiles. The model coordinates relate to a tile data-base and pre-flight tile-images. In the registration process, current (post-flight) images are aligned with pre-flight images to detect the rotation and translation displacement required for the coordinate systems rectification. The research activities performed this summer included study and evaluation of the registration algorithm that is currently implemented by the RTPS, as well as, investigation of the utility of other registration algorithms. It has been found that the current algorithm is not robust enough. This algorithm has a success rate of less than 80% and is, therefore, not suitable for complying with the requirements of the RTPS. Modifications to the current algorithm has been developed and tested. These modifications can improve the performance of the registration algorithm in a significant way. However, this improvement is not sufficient to satisfy system requirements. A new algorithm for registration has been developed and tested. This algorithm presented very high degree of robustness with success rate of 96%.

Tamir, Dan E.↗

Prospects for three-dimensional projective and tomographic imaging radar networks

Results of a study demonstrating the feasibility of broadband and speckle-free projective imaging of a complex shaped scattering object in the 6-17 GHz range with centimeter resolution are presented. It is shown how angular, spectral, and polarization diversities can be combined in the data acquisition process with a unique target-derived reference technique to access the three-dimensional Fourier space of the scatterer cost-effectively. Imagea retrieval algorithms, based on the projection slice theorem and knowledge of object symmetry, are utilized in obtaining images of a model aircraft with near optical resolution. The implications for high-resolution three-dimensional tomographic imaging radar networks are discussed.

Farhat, N. H.↗

A New Discrete Wavelength BUV Algorithm for Consistent Volcanic SO2 Retrievals from Multiple Satellite Missions

This paper describes a new discrete wavelength algorithm developed for retrieving volcanic sulfur dioxide (SO2) vertical column density (VCD) from UV observing satellites. The Multi-Satellite SO2 algorithm (MS_SO2) simultaneously retrieves column densities of sulfur dioxide, ozone, and Lambertian effective reflectivity (LER) and its spectral dependence. It is used operationally to process measurements from the heritage Total Ozone Mapping Spectrometer (TOMS) onboard NASA's Nimbus-7 satellite (N7/TOMS: 1978-1993) and from the current Earth Polychromatic Imaging Camera (EPIC) onboard Deep Space Climate Observatory (DSCOVR: 2015-) from the Earth-Sun Lagrange (L1) orbit. Results from MS_SO2 algorithm for several volcanic cases were assessed using the more sensitive principal component analysis (PCA) algorithm. The PCA is an operational algorithm used by NASA to retrieve SO2 from hyperspectral UV spectrometers, such as the Ozone Monitoring Instrument (OMI) onboard NASA's Earth Observing System Aura satellite and Ozone Mapping and Profiling Suite (OMPS) onboard NASA-NOAA Suomi National Polar Partnership (SNPP) satellite. For this comparative study, the PCA algorithm was modified to use the discrete wavelengths of the Nimbus-7/TOMS instrument, described in Sect. S1 of the Supplement. Our results demonstrate good agreement between the two retrievals for the largest volcanic eruptions of the satellite era, such as the 1991 Pinatubo eruption. To estimate SO2 retrieval systematic uncertainties, we use radiative transfer simulations explicitly accounting for volcanic sulfate and ash aerosols. Our results suggest that the discrete-wavelength MS_SO2 algorithm, although less sensitive than hyperspectral PCA algorithm, can be adapted to retrieve volcanic SO2 VCDs from contemporary hyperspectral UV instruments, such as OMI and OMPS, to create consistent, multi-satellite, long-term volcanic SO2 climate data records.

Bradford L Fisher↗

Architecture and data processing alternatives for the TSE computer. Volume 3: Execution of a parallel counting algorithm using array logic (Tse) devices

A parallel algorithm for counting the number of logic-l elements in a binary array or image developed during preliminary investigation of the Tse concept is described. The counting algorithm is implemented using a basic combinational structure. Modifications which improve the efficiency of the basic structure are also presented. A programmable Tse computer structure is proposed, along with a hardware control unit, Tse instruction set, and software program for execution of the counting algorithm. Finally, a comparison is made between the different structures in terms of their more important characteristics.

Metcalfe, A. G.↗

An algorithm for resolving intragranular orientation fields using coupled far-field and near-field high energy $\mathrm{X}$-ray diffraction microscopy

Here, we present a novel algorithm for reconstructing spatial intragranular lattice orientation fields using both far-field and near-field high energy X-ray diffraction microscopy (HEDM) measurements. An established far-field indexing algorithm is modified to include lattice orientation distribution information (grain orientation envelopes) in addition to average grain orientations. The near-field data reduction algorithm utilizes this enriched far-field orientation data as a seed for reconstructing intragranular spatial maps of lattice orientation from the diffraction images. The primary benefit of the new algorithm is a significant decrease in the number of trial calculations that must be performed in the reconstruction process compared to existing methodologies while maintaining scalability. The resulting gains in efficiency facilitate the use of relatively modest computational resources and improve throughput at the point of measurement. We provide two example applications: volumetric orientation field reconstructions for a Ti-Al alloy both before and after the application of 3% uniaxial strain. The results showcase the efficiency of the new method and the ability to resolve subtle changes in microstructure, which are associated with incipient plastic deformation.

36 MATERIALS SCIENCE↗

ASTEP user's guide and software documentation

The Algorithm Simulation Test and Evaluation Program (ASTEP) is a modular computer program developed for the purpose of testing and evaluating methods of processing remotely sensed multispectral scanner earth resources data. ASTEP is written in FORTRAND V on the UNIVAC 1110 under the EXEC 8 operating system and may be operated in either a batch or interactive mode. The program currently contains over one hundred subroutines consisting of data classification and display algorithms, statistical analysis algorithms, utility support routines, and feature selection capability. The current program can accept data in LARSC1, LARSC2, ERTS, and Universal formats, and can output processed image or data tapes in Universal format.

Gliniewicz, A. S.↗

Using spatial logic in classification of Landsat TM data

A strategy for spatial/spectral classification of Landsat TM data is presented. The strategy is founded upon 'spatial logic', a logic that seeks to emulate important aspects of visual image interpretation. The carefully structured classification process begins with spectral stratification of the data into water, vegetated and non-vegetated pixels. A region growing algorithm is then used to define 'fields' of similar land cover composition. Fields are characterized by cover composition, size and neighborhood characteristics. A supervised iterative contextual classification algorithm is developed to assign final land use/land cover labels. Maps are generalized using a spatial post-processing technique. Positive, though preliminary, results are presented.

Merchant, J. W.↗