Search NASA⌕ Search

SEARCH · Search NASA

Results for “segmentation 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

Execution time supports for adaptive scientific algorithms on distributed memory machines

Optimizations are considered that are required for efficient execution of code segments that consists of loops over distributed data structures. The PARTI (Parallel Automated Runtime Toolkit at ICASE) execution time primitives are designed to carry out these optimizations and can be used to implement a wide range of scientific algorithms on distributed memory machines. These primitives allow the user to control array mappings in a way that gives an appearance of shared memory. Computations can be based on a global index set. Primitives are used to carry out gather and scatter operations on distributed arrays. Communications patterns are derived at runtime, and the appropriate send and receive messages are automatically generated.

Berryman, Harry↗

Geoscience Laser Altimeter System: Characteristics and Performance of the Altimeter Receiver

The Geoscience Laser Altimeter System (GLAS) on board ICESat spacecraft measures the surface height (altimetry) via the time of flight of its 1064 nm laser pulse. The GLAS laser transmitter produces 6 ns wide pulses with 70 mJ energy at 1064 nm at a 40 Hz rate. The altimeter receiver consists of a telescope, aft optics, a silicon avalanche photodiode, and electronic amplifiers. The transmitted and echo pulse waveforms are digitized at 1 GHz rate. The laser pulse time of flight is determined on the ground from the two digitized pulse waveforms and their positions in the full waveform record (about 5.4 ms ong) by computing the pulse centroids or by curve fitting. The GLAS receiver algorithms in on board software selects the two waveform segments containing the transmitted and the echo pulses and sends them to ground. The probability of echo pulse detection and the accuracy of time of flight measurement depend on the received signal level, the background light within the receiver field of view, the inherent detector and amplifier noise, the quantization of the digitizer, and some times by cloud obscurations. A receiver model has been developed to calculate the probability of detection and accuracy of the altimeter measurements with these noise sources. From prelaunch testing, the minimum detectable echo pulse energy for 90% detection probability was about 0.1 fj/pulse onto the detector. Such a receiver sensitivity allows GLAS to measure the surface height through clouds with optical density less than 2. The echo pulse energy required to achieve 10 cm ranging accuracy was found to be about 3 times higher than the minimum detectable signal level. The smallest single shot range measurement error, which was determined by ranging to a fixed target with strong echo pulses and no background light, was 2 to 3cm. The maximum linear response echo pulse energy was 10 fJ/pulse for the strongest echo signals, assuming a Lambertian scattering snow surface, clear sky atmosphere transmission, and no pulse width spreading due to surface slopes. Results from the initial 38 days of GLAS operation on-orbit with Laser 1, showed the echo pulse energies varied, as expected, over a wide dynamic range due to the variability of atmosphere transmission and Earth surface characteristics. The receiver was able to reliably detect the ground surface echoes and measure time of flight under such dynamic conditions, except when there were dense clouds. When over Antarctica, the echo pulse energies were several times stronger than predicted. This suggests that the 1064 nm backscattering from the snow pack and ice-sheet &ce are not completely Lambertian but is somewhat peaked at opposit.ion. With Laser 1, the peak amplitude of the echo pulses from flat ice sheets under clear sky conditions exceeded the linear response range of the receiver, causing some pulse waveform distortion due to saturation. We have characterized the effects of receiver saturation on the time of flight, pulse width, and pulse energy measurements for flat surface by testing a night spare detector in the lab with simulated echo pulses. A data processing algorithm that minimizes the errors due to saturation for these measurements are described.

Sun, Xiao-Li↗

A new method for optimizing multiple flyby trajectories

A new procedure has been developed which minimizes total impulsive Delta V for multiple flyby trajectories with constraints on flyby parameters and maneuver times. The method involves solving a bounds-constrained parameter optimization problem with a Newton algorithm utilizing analytic first and second derivatives. Each trajectory segment connecting consecutive maneuver points is found by first targeting from the preceding maneuver point to the parameters of the upcoming flyby and then propagating the resulting trajectory to the next maneuver point. Multi-conic techniques are used for trajectory propagation and for computation of the state transition matrix. This procedure has successfully optimized Galileo satellite tours containing up to 11 flybys.

Damario, L. A.↗

Detection of edges using local geometry

Researchers described a new representation, the local geometry, for early visual processing which is motivated by results from biological vision. This representation is richer than is often used in image processing. It extracts more of the local structure available at each pixel in the image by using receptive fields that can be continuously rotated and that go to third order spatial variation. Early visual processing algorithms such as edge detectors and ridge detectors can be written in terms of various local geometries and are computationally tractable. For example, Canny's edge detector has been implemented in terms of a local geometry of order two, and a ridge detector in terms of a local geometry of order three. The edge detector in local geometry was applied to synthetic and real images and it was shown using simple interpolation schemes that sufficient information is available to locate edges with sub-pixel accuracy (to a resolution increase of at least a factor of five). This is reasonable even for noisy images because the local geometry fits a smooth surface - the Taylor series - to the discrete image data. Only local processing was used in the implementation so it can readily be implemented on parallel mesh machines such as the MPP. Researchers expect that other early visual algorithms, such as region growing, inflection point detection, and segmentation can also be implemented in terms of the local geometry and will provide sufficiently rich and robust representations for subsequent visual processing.

Gualtieri, J. A.↗

The three-dimensional structure of cumulus clouds over the ocean. 1: Structural analysis

Thermal channel (channel 6, 10.4-12.5 micrometers) images of five Landsat thematic mapper cumulus scenes over the ocean are examined. These images are thresholded using the standard International Satellite Cloud Climatology Project (ISCCP) thermal threshold algorithm. The individual clouds in the cloud fields are segmented to obtain their structural statistics which include size distribution, orientation angle, horizontal aspect ratio, and perimeter-to-area (PtA) relationship. The cloud size distributions exhibit a double power law with the smaller clouds having a smaller absolute exponent. The cloud orientation angles, horizontal aspect ratios, and PtA exponents are found in good agreement with earlier studies. A technique also is developed to recognize individual cells within a cloud so that statistics of cloud cellular structure can be obtained. Cell structural statistics are computed for each cloud. Unicellular clouds are generally smaller (less than or equal to 1 km) and have smaller PtA exponents, while multicellular clouds are larger (greater than or equal to 1 km) and have larger PtA exponents. Cell structural statistics are similar to those of the smaller clouds. When each cell is approximated as a quadric surface using a linear least squares fit, most cells have the shape of a hyperboloid of one sheet, but about 15% of the cells are best modeled by a hyperboloid of two sheets. Less than 1% of the clouds are ellipsoidal. The number of cells in a cloud increases slightly faster than linearly with increasing cloud size. The mean nearest neighbor distance between cells in a cloud, however, appears to increase linearly with increasing cloud size and to reach a maximum when the cloud effective diameter is about 10 km; then it decreases with increasing cloud size. Sensitivity studies of threshold and lapse rate show that neither has a significant impact upon the results. A goodness-of-fit ratio is used to provide a quantitative measure of the individual cloud results. Significantly improved results are obtained after applying a smoothing operator, suggesting the eliminating subresolution scale variations with higher spatial resolution may yield even better shape analyses.

Kuo, Kwo-Sen↗

Advances in Spectral-Spatial Classification of Hyperspectral Images

Recent advances in spectral-spatial classification of hyperspectral images are presented in this paper. Several techniques are investigated for combining both spatial and spectral information. Spatial information is extracted at the object (set of pixels) level rather than at the conventional pixel level. Mathematical morphology is first used to derive the morphological profile of the image, which includes characteristics about the size, orientation and contrast of the spatial structures present in the image. Then the morphological neighborhood is defined and used to derive additional features for classification. Classification is performed with support vector machines using the available spectral information and the extracted spatial information. Spatial post-processing is next investigated to build more homogeneous and spatially consistent thematic maps. To that end, three presegmentation techniques are applied to define regions that are used to regularize the preliminary pixel-wise thematic map. Finally, a multiple classifier system is defined to produce relevant markers that are exploited to segment the hyperspectral image with the minimum spanning forest algorithm. Experimental results conducted on three real hyperspectral images with different spatial and spectral resolutions and corresponding to various contexts are presented. They highlight the importance of spectral-spatial strategies for the accurate classification of hyperspectral images and validate the proposed methods.

Fauvel, Mathieu↗

Advances in Spectral-Spatial Classification of Hyperspectral Images

Recent advances in spectral-spatial classification of hyperspectral images are presented in this paper. Several techniques are investigated for combining both spatial and spectral information. Spatial information is extracted at the object (set of pixels) level rather than at the conventional pixel level. Mathematical morphology is first used to derive the morphological profile of the image, which includes characteristics about the size, orientation, and contrast of the spatial structures present in the image. Then, the morphological neighborhood is defined and used to derive additional features for classification. Classification is performed with support vector machines (SVMs) using the available spectral information and the extracted spatial information. Spatial postprocessing is next investigated to build more homogeneous and spatially consistent thematic maps. To that end, three presegmentation techniques are applied to define regions that are used to regularize the preliminary pixel-wise thematic map. Finally, a multiple-classifier (MC) system is defined to produce relevant markers that are exploited to segment the hyperspectral image with the minimum spanning forest algorithm. Experimental results conducted on three real hyperspectral images with different spatial and spectral resolutions and corresponding to various contexts are presented. They highlight the importance of spectral–spatial strategies for the accurate classification of hyperspectral images and validate the proposed methods.

hyperspectral image↗

Vision based obstacle detection and grouping for helicopter guidance

Electro-optical sensors can be used to compute range to objects in the flight path of a helicopter. The computation is based on the optical flow/motion at different points in the image. The motion algorithms provide a sparse set of ranges to discrete features in the image sequence as a function of azimuth and elevation. For obstacle avoidance guidance and display purposes, these discrete set of ranges, varying from a few hundreds to several thousands, need to be grouped into sets which correspond to objects in the real world. This paper presents a new method for object segmentation based on clustering the sparse range information provided by motion algorithms together with the spatial relation provided by the static image. The range values are initially grouped into clusters based on depth. Subsequently, the clusters are modified by using the K-means algorithm in the inertial horizontal plane and the minimum spanning tree algorithms in the image plane. The object grouping allows interpolation within a group and enables the creation of dense range maps. Researchers in robotics have used densely scanned sequence of laser range images to build three-dimensional representation of the outside world. Thus, modeling techniques developed for dense range images can be extended to sparse range images. The paper presents object segmentation results for a sequence of flight images.

Sridhar, Banavar↗

Robotic Vision-Based Localization in an Urban Environment

A system of electronic hardware and software, now undergoing development, automatically estimates the location of a robotic land vehicle in an urban environment using a somewhat imprecise map, which has been generated in advance from aerial imagery. This system does not utilize the Global Positioning System and does not include any odometry, inertial measurement units, or any other sensors except a stereoscopic pair of black-and-white digital video cameras mounted on the vehicle. Of course, the system also includes a computer running software that processes the video image data. The software consists mostly of three components corresponding to the three major image-data-processing functions: Visual Odometry This component automatically tracks point features in the imagery and computes the relative motion of the cameras between sequential image frames. This component incorporates a modified version of a visual-odometry algorithm originally published in 1989. The algorithm selects point features, performs multiresolution area-correlation computations to match the features in stereoscopic images, tracks the features through the sequence of images, and uses the tracking results to estimate the six-degree-of-freedom motion of the camera between consecutive stereoscopic pairs of images (see figure). Urban Feature Detection and Ranging Using the same data as those processed by the visual-odometry component, this component strives to determine the three-dimensional (3D) coordinates of vertical and horizontal lines that are likely to be parts of, or close to, the exterior surfaces of buildings. The basic sequence of processes performed by this component is the following: 1. An edge-detection algorithm is applied, yielding a set of linked lists of edge pixels, a horizontal-gradient image, and a vertical-gradient image. 2. Straight-line segments of edges are extracted from the linked lists generated in step 1. Any straight-line segments longer than an arbitrary threshold (e.g., 30 pixels) are assumed to belong to buildings or other artificial objects. 3. A gradient-filter algorithm is used to test straight-line segments longer than the threshold to determine whether they represent edges of natural or artificial objects. In somewhat oversimplified terms, the test is based on the assumption that the gradient of image intensity varies little along a segment that represents the edge of an artificial object.

Mchenry, Michael↗

Evaluation of LANDSAT-4 TM and MSS ground segment geometry performance without ground control

The along-line one dimensional FFT algorithm was successfully used to test band-to-band, swath-to-swath, and inter-swath registration of a Washington, D.C. scene. Analysis of the tabulated and plotted results of the MSS and TM P-data shows that a slow spacecraft roll condition of under one hertz exists in this scene. Characteristics of the data for both instruments are listed.

Source record↗

Segmented mirror coarse phasing with white light interferometry: modeling and experiment on NGST's wavefront control testbed

A method of coarse phasing segmented mirrors using white light interferometry (WLI) has been developed for Next Generation Space Telescope (NGST) wavefront sensing and control. Using the broadband point spread function (PSF) of the segmented mirrors taken during a segment piston scan, the WLI can accurately detect small residual piston errors. WLI does not rely on any extra optics and uses only the final imaging camera. With its high sensitivity to small segment piston error WLI can be used as a complementary phasing algorithm to the dispersed fringe sensor (DFS) for NGST. The paper will present the results from modeling and experiment on the NGST's Wavefront Control Testbed (WCT).

Space↗

Evaluation of the VIIRS Land Algorithms at Land PEATE

The Land Product Evaluation and Algorithm Testing Element (Land PEATE), a component of the Science Data Segment of the National Polar-orbiting Operational Environmental Satellite System (NPOESS) Preparatory Project (NPP), is being developed at the NASA Goddard Space Flight Center (GSFC). The primary task of the Land PEATE is to assess the quality of the Visible Infrared Imaging Radiometer Suite (VIIRS) Land data products made by the Interface Data Processing System (IDPS) using the Operational (OPS) Code during the NPP era and to recommend improvements to the algorithms in the IDPS OPS code. The Land PEATE uses a version of the MODIS Adaptive Processing System (MODAPS), NPPDAPS, that has been modified to produce products from the IDPS OPS code and software provided by the VIIRS Science Team, and uses the MODIS Land Data Operational Product Evaluation (LDOPE) team for evaluation of the data records generated by the NPPDAPS. Land PEATE evaluates the algorithms by comparing data products generated using different versions of the algorithm and also by comparing to heritage products generated from different instrument such as MODIS using various quality assessment tools developed at LDOPE. This paper describes the Land PEATE system and some of the approaches used by the Land PEATE for evaluating the VIIRS Land algorithms during the pre-launch period of the NPP mission and the proposed plan for long term monitoring of the quality of the VIIRS Land products post-launch.

Wolfe, Robert E.↗

1D-Convolutional Neural Network Architecture for Generalized Time-Segmentation Tasks

Time segmentation of experimental data is a common and often difficult task. Consequently, it is of interest to automate this type of segmentation to reduce manual inputs, which are labor intensive and less consistent. However, simple thresholding algorithms are often insufficiently robust due either to noise or inconsistent data. This paper proposes a simple 1D CNN architecture as a generalized solution for typical time segmentation tasks. The layer architecture, training methods, and methods for simple customization are described as well as the results of application to three separate arc jet data streams: facility condition segmentation, video highlight segmentation, and calorimeter time-series segmentation.

Machine learning↗

1d-Convolutional Neural Network Architecture for Generalized Time-Segmentation Tasks

Time segmentation of experimental data is a common and often difficult task. Consequently, it is of interest to automate this type of segmentation to reduce manual inputs, which are labor intensive and less consistent. However, simple thresholding algorithms are often insufficiently robust due either to noise or inconsistent data. This paper proposes a simple 1D CNN architecture as a generalized solution for typical time segmentation tasks. The layer architecture, training methods, and methods for simple customization are described as well as the results of application to three separate arc jet data streams: facility condition segmentation, video highlight segmentation, and calorimeter time-series segmentation.

Machine learning↗

Improved Speech Coding Based on Open-Loop Parameter Estimation

A nonlinear optimization algorithm for linear predictive speech coding was developed early that not only optimizes the linear model coefficients for the open loop predictor, but does the optimization including the effects of quantization of the transmitted residual. It also simultaneously optimizes the quantization levels used for each speech segment. In this paper, we present an improved method for initialization of this nonlinear algorithm, and demonstrate substantial improvements in performance. In addition, the new procedure produces monotonically improving speech quality with increasing numbers of bits used in the transmitted error residual. Examples of speech encoding and decoding are given for 8 speech segments and signal to noise levels as high as 47 dB are produced. As in typical linear predictive coding, the optimization is done on the open loop speech analysis model. Here we demonstrate that minimizing the error of the closed loop speech reconstruction, instead of the simpler open loop optimization, is likely to produce negligible improvement in speech quality. The examples suggest that the algorithm here is close to giving the best performance obtainable from a linear model, for the chosen order with the chosen number of bits for the codebook.

Juang, Jer-Nan↗

MeV Gamma Ray Detection Algorithms for Stacked Silicon Detectors

By making use of the signature of a gamma ray event as it appears in N = 5 to 20 lithium-drifted silicon detectors and applying smart selection algorithms, gamma rays in the energy range of 1 to 8 MeV can be detected with good efficiency and selectivity. Examples of the types of algorithms used for different energy regions include the simple sum mode, the sum-coincidence mode used in segmented detectors, unique variations on sum-coincidence for an N-dimensional vector event, and a new and extremely useful mode for double escape peak spectroscopy at pair-production energies. The latter algorithm yields a spectrum similar to that of the pair spectrometer, but without the need of the dual external segments for double escape coincidence, and without the large loss in efficiency of double escape events. Background events due to Compton scattering are largely suppressed. Monte Carlo calculations were used to model the gamma ray interactions in the silicon, in order to enable testing of a wide array of different algorithms on the event N-vectors for a large-N stack.

McMurray, Robert E. Jr.↗

An evaluation of the signature extension approach to large area crop inventories utilizing space image data

The author has identified the following significant results. Two examples of haze correction algorithms were tested: CROP-A and XSTAR. The CROP-A was tested in a unitemporal mode on data collected in 1973-74 over ten sample segments in Kansas. Because of the uniformly low level of haze present in these segments, no conclusion could be reached about CROP-A's ability to compensate for haze. It was noted, however, that in some cases CROP-A made serious errors which actually degraded classification performance. The haze correction algorithm XSTAR was tested in a multitemporal mode on 1975-76 LACIE sample segment data over 23 blind sites in Kansas and 18 sample segments in North Dakota, providing wide range of haze levels and other conditions for algorithm evaluation. It was found that this algorithm substantially improved signature extension classification accuracy when a sum-of-likelihoods classifier was used with an alien rejection threshold.

Nalepka, R. F.↗