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 217 records · Page 12

NASA-HBCU Space Science and Engineering Research Forum Proceedings

The proceedings of the Historically Black Colleges and Universities (HBCU) forum are presented. A wide range of research topics from plant science to space science and related academic areas was covered. The sessions were divided into the following subject areas: Life science; Mathematical modeling, image processing, pattern recognition, and algorithms; Microgravity processing, space utilization and application; Physical science and chemistry; Research and training programs; Space science (astronomy, planetary science, asteroids, moon); Space technology (engineering, structures and systems for application in space); Space technology (physics of materials and systems for space applications); and Technology (materials, techniques, measurements).

Sanders, Yvonne D.↗

Algorithms For Detection Of Correlation Spots

Three algorithms provide for improved postprocessing of outputs of optical correlators based on binary phase-only filters. Detect correlation spots. Function in presence of noise and executed rapidly. First algorithm starts processing correlation-image data while data fed out of video camera and digitized for subsequent analysis. Second involves convolution of correlation image with small-window two-dimensional impulse-response function followed by threshold operation in which negative values of convolution integral set to zero. Third affects generation as well as postprocessing of correlation image.

Scholl, Marija S.↗

Compression of echocardiographic scan line data using wavelet packet transform

An efficient compression strategy is indispensable for digital echocardiography. Previous work has suggested improved results utilizing wavelet transforms in the compression of 2D echocardiographic images. Set partitioning in hierarchical trees (SPIHT) was modified to compress echocardiographic scanline data based on the wavelet packet transform. A compression ratio of at least 94:1 resulted in preserved image quality.

Non-NASA Center↗

NASA Tech Briefs, August 2004

Topics covered include: Data Relay Board with Protocol for High-Speed, Free-Space Optical Communications; Software and Algorithms for Biomedical Image Data Processing and Visualization; Rapid Chemometric Filtering of Spectral Data; Prioritizing Scientific Data for Transmission; Determining Sizes of Particles in a Flow from DPIV Data; Faster Processing for Inverting GPS Occultation Data; FPGA-Based, Self-Checking, Fault-Tolerant Computers; Ultralow-Power Digital Correlator for Microwave Polarimetry; Grounding Headphones for Protection Against ESD; Lightweight Stacks of Direct Methanol Fuel Cells; Highly Efficient Vector-Inversion Pulse Generators; Estimating Basic Preliminary Design Performances of Aerospace Vehicles; Framework for Development of Object-Oriented Software; Analyzing Spacecraft Telecommunication Systems; Collaborative Planning of Robotic Exploration; Tools for Administration of a UNIX-Based Network; Preparing and Analyzing Iced Airfoils; Evaluating Performance of Components; Fuels Containing Methane of Natural Gas in Solution; Direct Electrolytic Deposition of Mats of MnxOy Nanowires; Bubble Eliminator Based on Centrifugal Flow; Inflatable Emergency Atmospheric-Entry Vehicles; Lightweight Deployable Mirrors with Tensegrity Supports; Centrifugal Adsorption Cartridge System; Ultrasonic Apparatus for Pulverizing Brittle Material; Transplanting Retinal Cells using Bucky Paper for Support; Using an Ultrasonic Instrument to Size Extravascular Bubbles; Coronagraphic Notch Filter for Raman Spectroscopy; On-the-Fly Mapping for Calibrating Directional Antennas; Working Fluids for Increasing Capacities of Heat Pipes; Computationally-Efficient Minimum-Time Aircraft Routes in the Presence of Winds; Liquid-Metal-Fed Pulsed Plasma Thrusters; Personal Radiation Protection System; and Attitude Control for a Solar-Sail Spacecraft.

Source record↗

Computational Ghost Imaging for Remote Sensing

This work relates to the generic problem of remote active imaging; that is, a source illuminates a target of interest and a receiver collects the scattered light off the target to obtain an image. Conventional imaging systems consist of an imaging lens and a high-resolution detector array [e.g., a CCD (charge coupled device) array] to register the image. However, conventional imaging systems for remote sensing require high-quality optics and need to support large detector arrays and associated electronics. This results in suboptimal size, weight, and power consumption. Computational ghost imaging (CGI) is a computational alternative to this traditional imaging concept that has a very simple receiver structure. In CGI, the transmitter illuminates the target with a modulated light source. A single-pixel (bucket) detector collects the scattered light. Then, via computation (i.e., postprocessing), the receiver can reconstruct the image using the knowledge of the modulation that was projected onto the target by the transmitter. This way, one can construct a very simple receiver that, in principle, requires no lens to image a target. Ghost imaging is a transverse imaging modality that has been receiving much attention owing to a rich interconnection of novel physical characteristics and novel signal processing algorithms suitable for active computational imaging. The original ghost imaging experiments consisted of two correlated optical beams traversing distinct paths and impinging on two spatially-separated photodetectors: one beam interacts with the target and then illuminates on a single-pixel (bucket) detector that provides no spatial resolution, whereas the other beam traverses an independent path and impinges on a high-resolution camera without any interaction with the target. The term ghost imaging was coined soon after the initial experiments were reported, to emphasize the fact that by cross-correlating two photocurrents, one generates an image of the target. In CGI, the measurement obtained from the reference arm (with the high-resolution detector) is replaced by a computational derivation of the measurement-plane intensity profile of the reference-arm beam. The algorithms applied to computational ghost imaging have diversified beyond simple correlation measurements, and now include modern reconstruction algorithms based on compressive sensing.

Erkmen, Baris I.↗

A Model-Based Approach for the Measurement of Eye Movements Using Image Processing

This paper describes a video eye-tracking algorithm which searches for the best fit of the pupil modeled as a circular disk. The algorithm is robust to common image artifacts such as the droopy eyelids and light reflections while maintaining the measurement resolution available by the centroid algorithm. The presented algorithm is used to derive the pupil size and center coordinates, and can be combined with iris-tracking techniques to measure ocular torsion. A comparison search method of pupil candidates using pixel coordinate reference lookup tables optimizes the processing requirements for a least square fit of the circular disk model. This paper includes quantitative analyses and simulation results for the resolution and the robustness of the algorithm. The algorithm presented in this paper provides a platform for a noninvasive, multidimensional eye measurement system which can be used for clinical and research applications requiring the precise recording of eye movements in three-dimensional space.

Sung, Kwangjae↗

Initial Navigation Alignment of Optical Instruments on GOES-R

Post-launch alignment errors for the Advanced Baseline Imager (ABI) and Geospatial Lightning Mapper (GLM) on GOES-R may be too large for the image navigation and registration (INR) processing algorithms to function without an initial adjustment to calibration parameters. We present an approach that leverages a combination of user-selected image-to-image tie points and image correlation algorithms to estimate this initial launch-induced offset and calculate adjustments to the Line of Sight Motion Compensation (LMC) parameters. We also present an approach to generate synthetic test images, to which shifts and rotations of known magnitude are applied. Results of applying the initial alignment tools to a subset of these synthetic test images are presented. The results for both ABI and GLM are within the specifications established for these tools, and indicate that application of these tools during the post-launch test (PLT) phase of GOES-R operations will enable the automated INR algorithms for both instruments to function as intended.

geolocation↗

Instrumentation and robotic image processing using top-down model control

A top-down image processing scheme is described. A three-dimensional model of a robotic working environment, with robot manipulators, workpieces, cameras, and on-the-scene visual enhancements is employed to control and direct the image processing, so that rapid, robust algorithms act in an efficient manner to continually update the model. Only the model parameters are communicated, so that savings in bandwidth are achieved. This image compression by modeling is especially important for control of space telerobotics. The background for this scheme lies in an hypothesis of human vision put forward by the senior author and colleagues almost 20 years ago - the Scanpath Theory. Evidence was obtained that repetitive sequences of saccadic eye movements, the scanpath, acted as the checking phase of visual pattern recognition. Further evidence was obtained that the scanpaths were apparently generated by a cognitive model and not directly by the visual image. This top-down theory of human vision was generalized in some sense to the frame in artificial intelligence. Another source of the concept arose from bioengineering instrumentation for measuring the pupil and eye movements with infrared video cameras and special-purpose hardware.

Stark, Lawrence↗

Reconstruction algorithm for polychromatic CT imaging: application to beam hardening correction

This paper presents a new reconstruction algorithm for both single- and dual-energy computed tomography (CT) imaging. By incorporating the polychromatic characteristics of the X-ray beam into the reconstruction process, the algorithm is capable of eliminating beam hardening artifacts. The single energy version of the algorithm assumes that each voxel in the scan field can be expressed as a mixture of two known substances, for example, a mixture of trabecular bone and marrow, or a mixture of fat and flesh. These assumptions are easily satisfied in a quantitative computed tomography (QCT) setting. We have compared our algorithm to three commonly used single-energy correction techniques. Experimental results show that our algorithm is much more robust and accurate. We have also shown that QCT measurements obtained using our algorithm are five times more accurate than that from current QCT systems (using calibration). The dual-energy mode does not require any prior knowledge of the object in the scan field, and can be used to estimate the attenuation coefficient function of unknown materials. We have tested the dual-energy setup to obtain an accurate estimate for the attenuation coefficient function of K2 HPO4 solution.

NASA Center ARC↗

A Fast Implementation of the ISODATA Clustering Algorithm

Clustering is central to many image processing and remote sensing applications. ISODATA is one of the most popular and widely used clustering methods in geoscience applications, but it can run slowly, particularly with large data sets. We present a more efficient approach to ISODATA clustering, which achieves better running times by storing the points in a kd-tree and through a modification of the way in which the algorithm estimates the dispersion of each cluster. We also present an approximate version of the algorithm which allows the user to further improve the running time, at the expense of lower fidelity in computing the nearest cluster center to each point. We provide both theoretical and empirical justification that our modified approach produces clusterings that are very similar to those produced by the standard ISODATA approach. We also provide empirical studies on both synthetic data and remotely sensed Landsat and MODIS images that show that our approach has significantly lower running times.

Memarsadeghi, Nargess↗

A Fast Implementation of the Isodata Clustering Algorithm

Clustering is central to many image processing and remote sensing applications. ISODATA is one of the most popular and widely used clustering methods in geoscience applications, but it can run slowly, particularly with large data sets. We present a more efficient approach to IsoDATA clustering, which achieves better running times by storing the points in a kd-tree and through a modification of the way in which the algorithm estimates the dispersion of each cluster. We also present an approximate version of the algorithm which allows the user to further improve the running time, at the expense of lower fidelity in computing the nearest cluster center to each point. We provide both theoretical and empirical justification that our modified approach produces clusterings that are very similar to those produced by the standard ISODATA approach. We also provide empirical studies on both synthetic data and remotely sensed Landsat and MODIS images that show that our approach has significantly lower running times.

Memarsadeghi, Nargess↗

On Kalman filter solution of space-time interpolation

The approximate Kalman filtering algorithm presented in [1] for image sequence processing can introduce unacceptable negative eigenvalues in the information matrix and can have degraded performance in some applications. The improved algorithm presented in this note guarantees a positive definite information matrix, leading to more stable filter performance.

data↗

Hadamard transform imager and imaging spectrometer

An imager and a spectrometric imager, which achieve multiplexing by the use of binary optical encoding masks, have been built and tested. The masks are based on orthogonal, pseudorandom digital codes derived from Hadamard matrices. The spatial (and/or spectral) data are therefore obtained in the form of a Hadamard transform of the spatial (and/or spectral) scene. Computer algorithms are used to decode the data and reconstruct images of the original scene. The hardware, algorithms processing and display facility are described. A number of spatial and spatial/spectral images, obtained in the laboratory, are presented.

Swift, R. D.↗

An adaptive filter for smoothing noisy radar images

A spatial domain adaptive Wiener filter for smoothing radar images corrupted by multiplicative noise is presented. The filter is optimum in a minimum mean squared error sense, computationally efficient, and preserves edges in the image better than other filters. The proposed algorithm can also be used for processing optical images with illumination variations that have a multiplicative effect.

Frost, V. S.↗

Real-Time Visualization of Tissue Ischemia

A real-time display of tissue ischemia which comprises three CCD video cameras, each with a narrow bandwidth filter at the correct wavelength is discussed. The cameras simultaneously view an area of tissue suspected of having ischemic areas through beamsplitters. The output from each camera is adjusted to give the correct signal intensity for combining with, the others into an image for display. If necessary a digital signal processor (DSP) can implement algorithms for image enhancement prior to display. Current DSP engines are fast enough to give real-time display. Measurement at three, wavelengths, combined into a real-time Red-Green-Blue (RGB) video display with a digital signal processing (DSP) board to implement image algorithms, provides direct visualization of ischemic areas.

Bearman, Gregory H.↗

A representational framework and user-interface for an image understanding workstation

Problems in image understanding involve a wide variety of data (e.g., image arrays, edge maps, 3-D shape models) and processes or algorithms (e.g., convolution, feature extraction, rendering). The underlying structure of an Image Understanding Workstation designed to support mulitple levels and types of representations for both data and processes is described, also the user-interface. The Image Understanding Workstation consists of two parts: the Image Understanding (IU) Framework, and the user-interface. The IU Framework is the set of data and process representations. It includes multiple levels of representation for data such as images (2-D), sketches (2-D), surfaces (2 1/2 D), and models (3-D). The representation scheme for processes characterizes their inputs, outputs, and parameters. Data and processes may reside on different classes of machines. The user-interface to the IU Workstation gives the user convenient access for creating, manipulating, transforming, and displaying image data. The user-interface follows the structure of the IU Framework and gives the user control over multiple types of data and processes. Both the IU Framework and user-interface are implemented on a LISP machine.

Schroeder, Joyce D.↗

Near real-time stereo vision system

The apparatus for a near real-time stereo vision system for use with a robotic vehicle is described. The system is comprised of two cameras mounted on three-axis rotation platforms, image-processing boards, a CPU, and specialized stereo vision algorithms. Bandpass-filtered image pyramids are computed, stereo matching is performed by least-squares correlation, and confidence ranges are estimated by means of Bayes' theorem. In particular, Laplacian image pyramids are built and disparity maps are produced from the 60 x 64 level of the pyramids at rates of up to 2 seconds per image pair. The first autonomous cross-country robotic traverses (of up to 100 meters) have been achieved using the stereo vision system of the present invention with all computing done onboard the vehicle. The overall approach disclosed herein provides a unifying paradigm for practical domain-independent stereo ranging.

Anderson, Charles H.↗

Real-time image enhancement

Pipelined system with "vision" algorithm is implemented on LSI chip that processes input digital image data to produce image-edge map. System contains 3 input adder, difference and absolute value cells, and adder and comparator. Data store for 1 to 2 ms, and are easily transmitted or isolated; design has reduced package count and number of interconnections for increased reliability. Applications include locating objects on moving belt, deep-sea and coal mining, and control of robotic rovers.

Wong, V. S.↗