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

SKYSURF: Constraints on Zodiacal Light and Extragalactic Background Light through Panchromatic HST All-sky Surface-brightness Measurements. I. Survey Overview and Methods

We give an overview and describe the rationale, methods, and testing of the Hubble Space Telescope (HST) Archival Legacy project "SKYSURF." SKYSURF uses HST's unique capability as an absolute photometer to measure the ∼0.2–1.7 μm sky-surface brightness (sky-SB) from 249,861 WFPC2, ACS, and WFC3 exposures in ∼1400 independent HST fields. SKYSURF's panchromatic data set is designed to constrain the discrete and diffuse UV to near-IR sky components: Zodiacal Light (ZL), Kuiper Belt Objects (KBOs), Diffuse Galactic Light (DGL), and the discrete plus diffuse Extragalactic Background Light (EBL). We outline SKYSURF's methods to: (1) measure sky-SB levels between detected objects; (2) measure the discrete EBL, most of which comes from AB≃17–22 mag galaxies; and (3) estimate how much truly diffuse light may exist. Simulations of HST WFC3/IR images with known sky values and gradients, realistic cosmic ray (CR) distributions, and star plus galaxy counts were processed with nine different algorithms to measure the "Lowest Estimated Sky-SB" (LES) in each image between the discrete objects. The best algorithms recover the LES values within 0.2% when there are no image gradients, and within 0.2%–0.4% when there are 5%–10% gradients. We provide a proof of concept of our methods from the WFC3/IR F125W images, where any residual diffuse light that HST sees in excess of zodiacal model predictions does not depend on the total object flux that each image contains. This enables us to present our first SKYSURF results on diffuse light in Carleton et al.

Hubble Space Telescope↗

A Comprehensive Plan for the Long-Term Calibration and Validation of Oceanic Biogeochemical Satellite Data

The primary objective of this planning document is to establish a long-term capability and validating oceanic biogeochemical satellite data. It is a pragmatic solution to a practical problem based primarily o the lessons learned from prior satellite missions. All of the plan's elements are seen to be interdependent, so a horizontal organizational scheme is anticipated wherein the overall leadership comes from the NASA Ocean Biology and Biogeochemistry (OBB) Program Manager and the entire enterprise is split into two components of equal sature: calibration and validation plus satellite data processing. The detailed elements of the activity are based on the basic tasks of the two main components plus the current objectives of the Carbon Cycle and Ecosystems Roadmap. The former is distinguished by an internal core set of responsibilities and the latter is facilitated through an external connecting-core ring of competed or contracted activities. The core elements for the calibration and validation component include a) publish protocols and performance metrics; b) verify uncertainty budgets; c) manage the development and evaluation of instrumentation; and d) coordinate international partnerships. The core elements for the satellite data processing component are e) process and reprocess multisensor data; f) acquire, distribute, and archive data products; and g) implement new data products. Both components have shared responsibilities for initializing and temporally monitoring satellite calibration. Connecting-core elements include (but are not restricted to) atmospheric correction and characterization, standards and traceability, instrument and analysis round robins, field campaigns and vicarious calibration sites, in situ database, bio-optical algorithm (and product) validation, satellite characterization and vicarious calibration, and image processing software. The plan also includes an accountability process, creating a Calibration and Validation Team (to help manage the activity), and a discussion of issues associated with the plan's scientific focus.

Hooker, Stanford B.↗

The Alaska SAR processor

The Alaska SAR processor was designed to process over 200 100 km x 100 km (Seasat like) frames per day from the raw SAR data, at a ground resolution of 30 m x 30 m from ERS-1, J-ERS-1, and Radarsat. The near real time processor is a set of custom hardware modules operating in a pipelined architecture, controlled by a general purpose computer. Input to the processor is provided from a high density digital cassette recording of the raw data stream as received by the ground station. A two pass processing is performed. During the first pass clutter-lock and auto-focus measurements are made. The second pass uses the results to accomplish final image formation which is recorded on a high density digital cassette. The processing algorithm uses fast correlation techniques for range and azimuth compression. Radiometric compensation, interpolation and deskewing is also performed by the processor. The standard product of the ASP is a high resolution four-look image, with a low resolution (100 to 200 m) many look image provided simultaneously.

Carande, R. E.↗

Optical Implementation of Matching Pursuit for Image Representation

We have developed a technique for image analysis, representation, and decomposition. This technique was motivated by Stephane Mallat's matching-pursuit algorithm. We've altered and simplified the mechanics of his algorithm to enable an extremely fast implementation via optical processing. Initial computer simulations show that our algorithm is capable of decomposing and representing a 2-D image as a linear combination of basis images with both high speed and high fidelity.

matching pursuit adaptive wavelet transform image ↗

Low-level processing for real-time image analysis

A system that detects object outlines in television images in real time is described. A high-speed pipeline processor transforms the raw image into an edge map and a microprocessor, which is integrated into the system, clusters the edges, and represents them as chain codes. Image statistics, useful for higher level tasks such as pattern recognition, are computed by the microprocessor. Peak intensity and peak gradient values are extracted within a programmable window and are used for iris and focus control. The algorithms implemented in hardware and the pipeline processor architecture are described. The strategy for partitioning functions in the pipeline was chosen to make the implementation modular. The microprocessor interface allows flexible and adaptive control of the feature extraction process. The software algorithms for clustering edge segments, creating chain codes, and computing image statistics are also discussed. A strategy for real time image analysis that uses this system is given.

Eskenazi, R.↗

Computability of five-color maps

Aside from the mathematical question as to whether any planar map can be colored with four or five colors so that no adjacent regions are assigned the same color, there is a computational problem of finding a coloration for a given map. This report presents an algorithm for the five-color problem which has an asymptotic computing time which is proportional to the square of the number of regions, at worst. The algorithm can be modified to produce six-color maps in linear time. The algorithm has been implemented for practical use in an image processing system and can be used in practical cases to produce four-color maps.

Mclemore, B. D.↗

Techniques in processing multi-frequency multi-polarization spaceborne SAR data

This paper presents the algorithm design of the SIR-C ground data processor, with emphasis on the unique elements involved in the production of registered multifrequency polarimetric data products. A quick-look processing algorithm used for generation of low-resolution browse image products and estimation of echo signal parameters is also presented. Specifically the discussion covers: (1) azimuth reference function generation to produce registered polarimetric imagery; (2) geometric rectification to accommondate cross-track and along-track Doppler drifts; (3) multilook filtering designed to generate output imagery with a uniform resolution; and (4) efficient coding to compress the polarimetric image data for distribution.

Curlander, John C.↗

Constellation Coverage Analysis

The design of satellite constellations requires an understanding of the dynamic global coverage provided by the constellations. Even for a small constellation with a simple circular orbit propagator, the combinatorial nature of the analysis frequently renders the problem intractable. Particularly for the initial design phase where the orbital parameters are still fluid and undetermined, the coverage information is crucial to evaluate the performance of the constellation design. We have developed a fast and simple algorithm for determining the global constellation coverage dynamically using image processing techniques. This approach provides a fast, powerful and simple method for the analysis of global constellation coverage.

Martin W. Lo↗

The Development and Hover Test Application of a Projection Moire Interferometry Blade Displacement Measurement System

Projection moir interferometry (PMI) was employed to measure blade deflections during a hover test of a generic model-scale rotor in the NASA Langley 14x22 subsonic wind tunnel s hover facility. PMI was one of several optical measurement techniques tasked to acquire deflection and flow visualization data for a rotor at several distinct heights above a ground plane. Two of the main objectives of this test were to demonstrate that multiple optical measurement techniques can be used simultaneously to acquire data and to identify and address deficiencies in the techniques. Several PMI-specific technical challenges needed to be addressed during the test and in post-processing of the data. These challenges included developing an efficient and accurate calibration method for an extremely large (65 inch) height range; automating the analysis of the large amount of data acquired during the test; and developing a method to determinate the absolute displacement of rotor blades without a required anchor point measurement. The results indicate that the use of a single-camera/single-projector approach for the large height range reduced the accuracy of the PMI system compared to PMI systems designed for smaller height ranges. The lack of the anchor point measurement (due to a technical issue with one of the other measurement techniques) limited the ability of the PMI system to correctly measure blade displacements to only one of the three rotor heights tested. The new calibration technique reduced the data required by 80 percent while new post-processing algorithms successfully automated the process of locating rotor blades in images, determining the blade quarter chord location, and calculating the blade root and blade tip heights above the ground plane.

Sekula, Martin K.↗

Magnetospheric Image Unfolding

The Grant was a three year grant funded under the Space Physics Supporting Research and Technology and Suborbital Program. Our objective was to develop automated techniques needed to unfold or "invert" global images of the magnetospheric ion populations obtained by the new magnetospheric imaging techniques (ENA, EUV) in anticipation of future missions such as the Magnetospheric Imager and, now, IMAGE. Our focus on the present three year grant is to determine the degree to which such images can quantitatively constrain the global electromagnetic properties of the magnetosphere. In a previous three year grant period we successfully automated a forward modeling inversion algorithm, demonstrated that these inversions are robust in the face of realistic instrumental considerations such as counting statistics and backgrounds, applied error analysis techniques to the extracted parameters using variational procedures, implemented very realistic magnetospheric test images to test the inversion algorithms using the Rice University Magnetospheric Specification Model, and began the process of generating parametric models with the flexibility to handle the realistic magnetospheric images (e.g. Roelof et al, 1992; 1993). Our plan for the present 3 year grant period was to complete the development of the inversion tools needed to handle realistic magnetospheric images, assess the degree to which global electrodynamics is quantitatively constrained by ENA images of the magnetosphere, and bring the inversion of EUV images up to the maturity that we will have achieved for the ENA imaging. Below the accomplishments of our three year effort are present followed by a list of our presentations and publications. The accomplishments of all three years are presented here, and thus some of these items appeared on interim progress reports.

Source record↗

Geologic interpretation of HCMM and aircraft thermal data

Progress on the Heat Capacity Mapping Mission (HCMM) follow-on study is reported. Numerous image products for geologic interpretation of both HCMM and aircraft thermal data were produced. These include, among others, various combinations of the thermal data with LANDSAT and SEASAT data. The combined data sets were displayed using simple color composites, principal component color composites and black and white images, and hue, saturation intensity color composites. Algorithms for incorporating both atmospheric and elevation data simultaneously into the digital processing for creation of quantitatively correct thermal inertia images, are in the final development stage. A field trip to Death Valley was undertaken to field check the aircraft and HCMM data.

Source record↗

Aeroelastic Flight Data Analysis with the Hilbert-Huang Algorithm

This report investigates the utility of the Hilbert Huang transform for the analysis of aeroelastic flight data. It is well known that the classical Hilbert transform can be used for time-frequency analysis of functions or signals. Unfortunately, the Hilbert transform can only be effectively applied to an extremely small class of signals, namely those that are characterized by a single frequency component at any instant in time. The recently-developed Hilbert Huang algorithm addresses the limitations of the classical Hilbert transform through a process known as empirical mode decomposition. Using this approach, the data is filtered into a series of intrinsic mode functions, each of which admits a well-behaved Hilbert transform. In this manner, the Hilbert Huang algorithm affords time-frequency analysis of a large class of signals. This powerful tool has been applied in the analysis of scientific data, structural system identification, mechanical system fault detection, and even image processing. The purpose of this report is to demonstrate the potential applications of the Hilbert Huang algorithm for the analysis of aeroelastic systems, with improvements such as localized online processing. Applications for correlations between system input and output, and amongst output sensors, are discussed to characterize the time-varying amplitude and frequency correlations present in the various components of multiple data channels. Online stability analyses and modal identification are also presented. Examples are given using aeroelastic test data from the F-18 Active Aeroelastic Wing airplane, an Aerostructures Test Wing, and pitch plunge simulation.

Brenner, Martin J.↗

Covisualization by computational optical-sectioning microscopy of integrin and associated proteins at the cell membrane of living onion protoplasts

Using higher-resolution wide-field computational optical-sectioning fluorescence microscopy, the distribution of antigens recognized by antibodies against animal beta 1 integrin, fibronectin, and vitronectin has been visualized at the outer surface of enzymatically protoplasted onion epidermis cells and in depectinated cell wall fragments. On the protoplast all three antigens are colocalized in an array of small spots, as seen in raw images, in Gaussian filtered images, and in images restored by two different algorithms. Fibronectin and vitronectin but not beta 1 integrin antigenicities colocalize as puncta in comparably prepared and processed images of the wall fragments. Several control visualizations suggest considerable specifity of antibody recognition. Affinity purification of onion cell extract with the same anti-integrin used for visualization has yielded protein that separates in SDS-PAGE into two bands of about 105-110 and 115-125 kDa. These bands are again recognized by the visualization antibody, which was raised against the extracellular domain of chicken beta 1 integrin, and are also recognized by an antibody against the intracellular domain of chicken beta 1 integrin. Because beta 1 integrin is a key protein in numerous animal adhesion sites, it appears that the punctate distribution of this protein in the cell membranes of onion epidermis represents the adhesion sites long known to occur in cells of this tissue. Because vitronectin and fibronection are matrix proteins that bind to integrin in animals, the punctate occurrence of antigenically similar proteins both in the wall (matrix) and on enzymatically prepared protoplasts reinforces the concept that onion cells have adhesion sites with some similarity to certain kinds of adhesion sites in animals.

NASA Discipline Plant Biology↗

Average Cross-Sectional Area of DebriSat Fragments Using Volumetrically Constructed 3D Representations

Debris fragments from the hypervelocity impact testing of DebriSat are being collected and characterized for use in updating existing satellite breakup models. One of the key parameters utilized in these models is the ballistic coefficient of the fragment which is directly related to its area‐to‐mass ratio. However, since the attitude of fragments varies during their orbital lifetime, it is customary to use the average cross‐sectional area in the calculation of the area‐to‐mass ratio. The average cross‐sectional area is defined as the average of the projected surface areas perpendicular to the direction of motion and has been shown to be equal to one‐fourth of the total surface area of a convex object. Unfortunately, numerous fragments obtained from the DebriSat experiment show significant concavity (i.e., shadowing) and thus we have explored alternate methods for computing the average cross‐sectional area of the fragments. An imaging system based on the volumetric reconstruction of a 3D object from multiple 2D photographs of the object was developed for use in determining the size characteristic (i.e., characteristics length) of the DebriSat fragments. For each fragment, the imaging system generates N number of images from varied azimuth and elevation angles and processes them using a space‐carving algorithm to construct a 3D point cloud of the fragment. This paper describes two approaches for calculating the average cross‐sectional area of debris fragments based on the 3D imager. Approach A utilizes the constructed 3D object to generate equally distributed cross‐sectional area projections and then averages them to determine the average cross‐sectional area. Approach B utilizes a weighted average of the area of the 2D photographs to directly compute the average cross‐sectional area. A comparison of the accuracy and computational needs of each approach is described as well as preliminary results of an analysis to determine the "optimal" number of images needed for the 3D imager to accurately measure the average cross sectional area of objects with known dimensions.

Scruggs, T.↗

Robust pupil center detection using a curvature algorithm

Determining the pupil center is fundamental for calculating eye orientation in video-based systems. Existing techniques are error prone and not robust because eyelids, eyelashes, corneal reflections or shadows in many instances occlude the pupil. We have developed a new algorithm which utilizes curvature characteristics of the pupil boundary to eliminate these artifacts. Pupil center is computed based solely on points related to the pupil boundary. For each boundary point, a curvature value is computed. Occlusion of the boundary induces characteristic peaks in the curvature function. Curvature values for normal pupil sizes were determined and a threshold was found which together with heuristics discriminated normal from abnormal curvature. Remaining boundary points were fit with an ellipse using a least squares error criterion. The center of the ellipse is an estimate of the pupil center. This technique is robust and accurately estimates pupil center with less than 40% of the pupil boundary points visible.

Non-NASA Center↗

Vision Algorithm for the Solar Aspect System of the HEROES Mission

This work covers the design and test of a machine vision algorithm for generating high-accuracy pitch and yaw pointing solutions relative to the sun for the High Energy Replicated Optics to Explore the Sun (HEROES) mission. It describes how images were constructed by focusing an image of the sun onto a plate printed with a pattern of small fiducial markers. Images of this plate were processed in real time to determine relative position of the balloon payload to the sun. The algorithm is broken into four problems: circle detection, fiducial detection, fiducial identification, and image registration. Circle detection is handled by an "Average Intersection" method, fiducial detection by a matched filter approach, identification with an ad-hoc method based on the spacing between fiducials, and image registration with a simple least squares fit. Performance is verified on a combination of artificially generated images, test data recorded on the ground, and images from the 2013 flight

Solar Aspect↗

Vision Algorithm for the Solar Aspect System of the HEROES Mission

This work covers the design and test of a machine vision algorithm for generating high-accuracy pitch and yaw pointing solutions relative to the sun for the High Energy Replicated Optics to Explore the Sun (HEROES) mission. It describes how images were constructed by focusing an image of the sun onto a plate printed with a pattern of small fiducial markers. Images of this plate were processed in real time to determine relative position of the balloon payload to the sun. The algorithm is broken into four problems: circle detection, fiducial detection, fiducial identification, and image registration. Circle detection is handled by an Average Intersection method, fiducial detection by a matched filter approach, identification with an ad-hoc method based on the spacing between fiducials, and image registration with a simple least squares fit. Performance is verified on a combination of artificially generated images, test data recorded on the ground, and images from the 2013 flight.

HEROES↗

Conference on Applications of Digital Image Processing to Astronomy, Pasadena, Calif., August 20-22, 1980, Proceedings

The astronomic applications of non-military digital image processing are covered in this conference volume. Systems like CCD's, interactive data analysis facilities, stellar speckle interferometry, sky flux subsystems, guide star systems and various image processing systems are described. Techniques in photometry including filtering, automatic photometry, and image restoration are examined. Digital spectral analyses of galaxies, supernova remnants, stars and other celestial bodies are discussed together with algorithms developed to calibrate, clean up, enhance, and quantitatively analyze data. The techniques of image processing permit astronomers to make much more efficient use of their data for both subjective and quantitative analyses. Future missions, such as the Space Telescope, representing a vast data base are briefly covered.

Elliott, D. A.↗