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

Tracking hurricane paths

The South East coastal region experiences hurricane threat for almost six months in every year. To improve the accuracy of hurricane forecasts, meteorologists would need the storm paths of both the present and the past. A hurricane path can be established if we could identify the correct position of the storm at different times right from its birth to the end. We propose a method based on both spatial and temporal image correlations to locate the position of a storm from satellite images. During the hurricane season, the satellite images of the Atlantic ocean near the equator are examined for the hurricane presence. This is accomplished in two steps. In the first step, only segments with more than a particular value of cloud cover are selected for analysis. Next, we apply image processing algorithms to test the presence of a hurricane eye in the segment. If the eye is found, the coordinate of the eye is recorded along with the time stamp of the segment. If the eye is not found, we examine adjacent segments for the existence of hurricane eye. It is probable that more than one hurricane eye could be found from different segments of the same period. Hence, the above process is repeated till the entire potential area for hurricane birth is exhausted. The subsequent/previous position of each hurricane eye will be searched in the appropriate adjacent segments of the next/previous period to mark the hurricane path. The temporal coherence and spatial coherence of the images are taken into account by our scheme in determining the segments and the associated periods required for analysis.

Prabhakaran, Nagarajan↗

I Know I'm Right, But Does My Phone?

Transportation is the largest source of green-house gas emissions in the United States. Reducing transportation emissions depends on human travel behavior, which relies on local land use and planning. Travel diaries, consisting of sequences of trips between places for a particular individual, are typically used to instrument human travel behavior. However, these diaries are only as accurate as the underlying methods used to construct them. Travel diary algorithms have been a popular research topic since the advent of GPS tracking surveys. Mode inference algorithms in particular have been well represented in literature. However, these algorithms have typically been validated using prompted recall of pre-segmented trips, which doesn't account for segmentation error, thus disregarding the continuity of mode inference. Furthermore, phone operating systems and applications have adopted battery-conserving techniques, but we are not aware of prior work that has characterized the resulting data collection errors or evaluated procedures to mitigate them. We introduce a framework to evaluate accuracy of trip length computations and mode inference. We develop a temporal alignment procedure in analyzing continuous mode-segmented trajectories for groups of trips. We then apply our framework to evaluate an example set of travel diary algorithms from the open-source OpenPATH travel diary platform against MobilityNet, a public dataset containing information from three artificial timelines that cover 15 different travel modes. Our results show that inference based on an integration with map features results in weighted F_1 scores of 0.60 (iOS) and 0.74 (android). We also show that OpenPATH tends to under count trip length, with mean of signed relative error of -0.0438 on android and -0.0704 on iOS. We hope that other travel diary algorithms will be evaluated using this standardized process, and that the results used to understand and improve the state-of-the-art in this field.

ADVANCED PROPULSION SYSTEMS,ENERGY PLANNING, POLIC↗

Four-dimensional guidance algorithms for aircraft in an air traffic control environment

Theoretical development and computer implementation of three guidance algorithms are presented. From a small set of input parameters the algorithms generate the ground track, altitude profile, and speed profile required to implement an experimental 4-D guidance system. Given a sequence of waypoints that define a nominal flight path, the first algorithm generates a realistic, flyable ground track consisting of a sequence of straight line segments and circular arcs. Each circular turn is constrained by the minimum turning radius of the aircraft. The ground track and the specified waypoint altitudes are used as inputs to the second algorithm which generates the altitude profile. The altitude profile consists of piecewise constant flight path angle segments, each segment lying within specified upper and lower bounds. The third algorithm generates a feasible speed profile subject to constraints on the rate of change in speed, permissible speed ranges, and effects of wind. Flight path parameters are then combined into a chronological sequence to form the 4-D guidance vectors. These vectors can be used to drive the autopilot/autothrottle of the aircraft so that a 4-D flight path could be tracked completely automatically; or these vectors may be used to drive the flight director and other cockpit displays, thereby enabling the pilot to track a 4-D flight path manually.

Pecsvaradi, T.↗

A Novel Data Segmentation Method for Data-driven Phase Identification

This paper presents a smart meter phase identification algorithm for two cases: meter-phase-label-known and meter-phase-label-unknown. To improve the identification accuracy, a data segmentation method is proposed to exclude data segments that are collected when the voltage correlation between smart meters on the same phase is weakened. Then, using the selected data segments, a hierarchical clustering method is used to calculate the correlation distances and cluster the smart meters. If the phase labels are unknown, a Connected-Triple-based Similarity (CTS) method is adapted to further improve the phase identification accuracy of the ensemble clustering method. The methods are developed and tested on both synthetic and real feeder data sets. Here, simulation results show that the proposed phase identification algorithm outperforms the state-of-the-art methods in both accuracy and robustness.

24 POWER TRANSMISSION AND DISTRIBUTION↗

NucMesh: nuclear reactor geometry creation and mesh generation module in NEMoSys

NucMesh is a parameterized geometry and mesh generator for nuclear reactors developed within the Nuclear Energy Modeling System NEMoSys at Illinois Rocstar. NEMoSys is a platform developed for mesh generation, adaptive refinement, and solution verification. NucMesh is implemented to be generalized and extensible with a robust computer aided design engine and multiple mesh generation algorithms for unstructured triangular, quad-dominant, and structured quadrilateral meshing. In this paper, we present the geometric and meshing features of NucMesh. Geometrically objects are constructed bottom-to-top and overlaps are addressed automatically. A sophisticated object tracking algorithm prevents data from being lost for segmented objects. We discuss the primitive objects of circle and polygons that constitute the module and show how they are used with example inputs. Arrays of primitives and arrays of arrays are utilized to build large assemblies of objects. The concept of saved objects is discussed to demonstrate how repetitive objects can be reused easily and augmented in place. Three dimensional meshes can be obtained through mesh extrusion where all materials and side sets are extended to three dimensions. We show that side sets can be defined nearly anywhere within the geometry and can then be applied to the mesh. Finally, example reactor meshes are demonstrated for the Idaho National Laboratory Advanced Test Reactor and Los Alamos National Lab Empire reactor, both of which use control drums that NucMesh handles easily. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Texture classification using autoregressive filtering

A general theory of image texture models is proposed and its applicability to the problem of scene segmentation using texture classification is discussed. An algorithm, based on half-plane autoregressive filtering, which optimally utilizes second order statistics to discriminate between texture classes represented by arbitrary wide sense stationary random fields is described. Empirical results of applying this algorithm to natural and sysnthesized scenes are presented and future research is outlined.

Lawton, W. M.↗

Numerical study of laminar and turbulent flows inside a turnaround duct with and without guide vanes

The purpose of this study is to examine in detail incompressible laminar and turbulent flows inside a turnaround duct with and without guide vanes and to investigate the effects of vanes on the flow characteristics. To perform this study, an implicit finite difference code cast in general curvilinear coordinates is further developed. The code is based on the method of pseudo-compressibility and utilize ADI or implicit approximate factorization algorithm to achieve computational efficiency. Method of segmental sweeping is developed to overcome the multiple-zone problem due to imposition of guide vanes. In the present study, several test cases have been computed. These test cases include laminar and turbulent flows inside a turnaround duct without and with two or three guide vanes. The study reveals that: (1) there exists large recirculation zones inside the duct if no vanes are present; (2) properly shaped and positional guide vanes are effective in eliminating flow separation; and (3) laminar and turbulent flows have similar flow features. But turbulent flow has less total pressure drop.

Lin, S.-J.↗

Detecting and avoiding collisions between two robot arms in a common workspace

A novel approach to collision detection is presented and methods of avoiding collisions are discussed. Collisions are assumed to be between the wrists of two robots (which correspond to the upper three links of PUMA manipulators). A sphere model for the wrist is employed because it is rotationally invariant and computationally efficient. The collision detection algorithm involves obtaining the potential collision path segments along the straight line trajectories without considering the motion characteristics, and mapping the potential collision segment information into the time domain to obtain the space-time collisions.

Basta, Robert A.↗

Fuzzy geometry, entropy, and image information

Presented here are various uncertainty measures arising from grayness ambiguity and spatial ambiguity in an image, and their possible applications as image information measures. Definitions are given of an image in the light of fuzzy set theory, and of information measures and tools relevant for processing/analysis e.g., fuzzy geometrical properties, correlation, bound functions and entropy measures. Also given is a formulation of algorithms along with management of uncertainties for segmentation and object extraction, and edge detection. The output obtained here is both fuzzy and nonfuzzy. Ambiguity in evaluation and assessment of membership function are also described.

Pal, Sankar K.↗

Properties and decay of stratospheric aerosols in the Arctic following the 1991 eruptions of Mount Pinatubo

Sunphotometer observations made from an aircraft several months after the June 1991 eruptions of Mount Pinatubo are used to quantify the spectral opacity of the Arctic stratosphere. Ancillary surface-based measurements are presented in support of the aircraft data that show large increases in stratospheric optical depth attributed to the presence of volcanic aerosols. Visible optical depths greater than 0.2 were observed during flight segments flown above the tropopause. An inversion algorithm and the optical depth data are used to infer effective aerosol size distributions. The distributions tend to be bimodal, having a large-partical mode radius of about 0.50 micron and a small-particle mode of higher concentration with radii less than 0.18 micron. Surface measurements made during spring 1992 and 1993 are also used to estimate a time constant (e-folding time) of about 13.5 months assuming that the Arctic stratosphere's opacity decays exponentially; this estimate is larger than decay times observed following other major volcanic eruptions. Our results suggest that any climate perturbations in the Arctic caused by eruptions of Pinatubo may be significant and will very likely persist longer than any volcanically-induced changes observed there during the past century.

Stone, Robert S.↗

Vision and "Hand-Eye" Coordination for the Fujitsu HOAP-2 Humanoid Robot

Software was developed for a Fujitsu HOAP-2 humanoid robot to demonstrate that such "human form" robots can be used to perform useful tasks in an unknown environment; specifically, that they can operate with or in the place of humans to carry out construction operations necessary for space exploration, such as building or maintaining planetary surface habitats for humans. This paper describes the autonomous vision and hand-eye coordination software that enables the HOAP-2 to locate and manipulate objects. Simple vision and pattern detection algorithms including color filtering, noise filtering, image segmentation, orientation filters, and a feedback controlled tracking system enable the robot to locate marked building materials in the workspace. Experimentally determined spatial mappings associate locations in the visual field with the arm joint angles and trajectories necessary to reach these locations, allowing the robot to reach for and manipulate the building materials. These capabilities, when combined with locomotion capabilities, enable the robot to operate autonomously in an unknown workspace.

Moore, Jeffrey D.↗

Software and Algorithms for Biomedical Image Data Processing and Visualization

A new software equipped with novel image processing algorithms and graphical-user-interface (GUI) tools has been designed for automated analysis and processing of large amounts of biomedical image data. The software, called PlaqTrak, has been specifically used for analysis of plaque on teeth of patients. New algorithms have been developed and implemented to segment teeth of interest from surrounding gum, and a real-time image-based morphing procedure is used to automatically overlay a grid onto each segmented tooth. Pattern recognition methods are used to classify plaque from surrounding gum and enamel, while ignoring glare effects due to the reflection of camera light and ambient light from enamel regions. The PlaqTrak system integrates these components into a single software suite with an easy-to-use GUI (see Figure 1) that allows users to do an end-to-end run of a patient s record, including tooth segmentation of all teeth, grid morphing of each segmented tooth, and plaque classification of each tooth image. The automated and accurate processing of the captured images to segment each tooth [see Figure 2(a)] and then detect plaque on a tooth-by-tooth basis is a critical component of the PlaqTrak system to do clinical trials and analysis with minimal human intervention. These features offer distinct advantages over other competing systems that analyze groups of teeth or synthetic teeth. PlaqTrak divides each segmented tooth into eight regions using an advanced graphics morphing procedure [see results on a chipped tooth in Figure 2(b)], and a pattern recognition classifier is then used to locate plaque [red regions in Figure 2(d)] and enamel regions. The morphing allows analysis within regions of teeth, thereby facilitating detailed statistical analysis such as the amount of plaque present on the biting surfaces on teeth. This software system is applicable to a host of biomedical applications, such as cell analysis and life detection, or robotic applications, such as product inspection or assembly of parts in space and industry.

Talukder, Ashit↗

Block segmentation in feature space for realtime object detection in high granularity images

Computer vision has applications in object detection, image recognition and classification, and object tracking. One of the challenges of computer vision is the presence of useful information at multiple distance scales. Filtering techniques may sacrifice details at small scales in order to prioritize the analysis of large-scale features of the image. We present a strategy for coarse-graining multidimensional data while maintaining fine-grained detail for subsequent analysis. The algorithm is based on fixed-size block segmentation in the feature space. We apply this strategy to solve the long-standing challenge of detecting particle trajectories at the Large Hadron Collider in real time.

Computer vision↗

An adaptive algorithm for motion compensated color image coding

This paper presents an adaptive algorithm for motion compensated color image coding. The algorithm can be used for video teleconferencing or broadcast signals. Activity segmentation is used to reduce the bit rate and a variable stage search is conducted to save computations. The adaptive algorithm is compared with the nonadaptive algorithm and it is shown that with approximately 60 percent savings in computing the motion vector and 33 percent additional compression, the performance of the adaptive algorithm is similar to the nonadaptive algorithm. The adaptive algorithm results also show improvement of up to 1 bit/pel over interframe DPCM coding with nonuniform quantization. The test pictures used for this study were recorded directly from broadcast video in color.

Kwatra, Subhash C.↗

Segmented Mirror Image Degradation Due to Surface Dust, Alignment and Figure

In 1996 an algorithm was developed to include the effects of surface roughness in the calculation of the point spread function of a telescope mirror. This algorithm has been extended to include the effects of alignment errors and figure errors for the individual elements, and an overall contamination by surface dust. The final algorithm builds an array for a guard-banded pupil function of a mirror that may or may not have a central hole, a central reflecting segment, or an outer ring of segments. The central hole, central reflecting segment, and outer ring may be circular or polygonal, and the outer segments may have trimmed comers. The modeled point spread functions show that x-tilt and y-tilt, or the corresponding R-tilt and theta-tilt for a segment in an outer ring, is readily apparent for maximum wavefront errors of 0.1 lambda. A similar sized piston error is also apparent, but integral wavelength piston errors are not. Severe piston error introduces a focus error of the opposite sign, so piston could be adjusted to compensate for segments with varying focal lengths. Dust affects the image principally by decreasing the Strehl ratio, or peak intensity of the image. For an eight-meter telescope a 25% coverage by dust produced a scattered light intensity of 10(exp -9) of the peak intensity, a level well below detectability.

Schreur, Julian J.↗

Studies in Astronomical Time Series Analysis. VI. Bayesian Block Representations

This paper addresses the problem of detecting and characterizing local variability in time series and other forms of sequential data. The goal is to identify and characterize statistically significant variations, at the same time suppressing the inevitable corrupting observational errors. We present a simple nonparametric modeling technique and an algorithm implementing it-an improved and generalized version of Bayesian Blocks [Scargle 1998]-that finds the optimal segmentation of the data in the observation interval. The structure of the algorithm allows it to be used in either a real-time trigger mode, or a retrospective mode. Maximum likelihood or marginal posterior functions to measure model fitness are presented for events, binned counts, and measurements at arbitrary times with known error distributions. Problems addressed include those connected with data gaps, variable exposure, extension to piece- wise linear and piecewise exponential representations, multivariate time series data, analysis of variance, data on the circle, other data modes, and dispersed data. Simulations provide evidence that the detection efficiency for weak signals is close to a theoretical asymptotic limit derived by [Arias-Castro, Donoho and Huo 2003]. In the spirit of Reproducible Research [Donoho et al. (2008)] all of the code and data necessary to reproduce all of the figures in this paper are included as auxiliary material.

signal detection↗

Coronagraph Design Optimization for Segmented Aperture Telescopes

The goal of directly imaging Earth-like planets in the habitable zone of other stars has motivated the design of coronagraphs for use with large segmented aperture space telescopes. In order to achieve an optimal trade-o between planet light throughput and di racted starlight suppression, we consider coronagraphs comprised of a stage of phase control implemented with deformable mirrors (or other optical elements), pupil plane apodization masks (gray scale or complex valued), and focal plane masks (either amplitude only or complex-valued, including phase only such as the vector vortex coronagraph). The optimization of these optical elements, with the goal of achieving 10 or more orders of magnitude in the suppression of on-axis (starlight) di racted light, represents a challenging non-convex optimization problem with a nonlinear dependence on control degrees of freedom. We develop a new algorithmic approach to the design optimization problem, which we call the "Auxiliary Field Optimization" (AFO) algorithm. The central idea of the algorithm is to embed the original optimization problem, for either phase or amplitude (apodization) in various planes of the coronagraph, into a problem containing additional degrees of freedom, speci cally ctitious "auxiliary" electric elds which serve as targets to inform the variation of our phase or amplitude parameters leading to good feasible designs. We present the algorithm, discuss details of its numerical implementation, and prove convergence to local minima of the objective function (here taken to be the intensity of the on-axis source in a "dark hole" region in the science focal plane). Finally, we present results showing application of the algorithm to both unobscured o -axis and obscured on-axis segmented telescope aperture designs. The application of the AFO algorithm to the coronagraph design problem has produced solutions which are capable of directly imaging planets in the habitable zone, provided end-to-end telescope system stability requirements can be met. Ongoing work includes advances of the AFO algorithm reported here to design in additional robustness to a resolved star, and other phase or amplitude aberrations to be encountered in a real segmented aperture space telescope.

Redding, Dave↗