Engineering Papers⌕ Search

SEARCH · Engineering Papers

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

Digital processing of satellite imagery application to jungle areas of Peru

The author has identified the following significant results. The use of clustering methods permits the development of relatively fast classification algorithms that could be implemented in an inexpensive computer system with limited amount of memory. Analysis of CCTs using these techniques can provide a great deal of detail permitting the use of the maximum resolution of LANDSAT imagery. Potential cases were detected in which the use of other techniques for classification using a Gaussian approximation for the distribution functions can be used with advantage. For jungle areas, channels 5 and 7 can provide enough information to delineate drainage patterns, swamp and wet areas, and make a reasonable broad classification of forest types.

Pomalaza, J. C.↗

Radiobrightness decision criteria for freeze/thaw boundaries

A freeze indicator (FI), based on a low 37-GHz radiobrightness and a low 10.7, 18, and 37-GHz radiobrightness spectral gradient, has been used to classify frozen surfaces in the northern Great Plains. By modeling the radiometer beampatterns as Gaussian, freeze/thaw boundaries can be located at the (fine) resolution of the 37-GHz channel. The performance of the freeze indicator, and subsequent boundary location estimate, depends on the accuracy of the boundary decision criteria. It is shown that decision criteria based on clustering and unsupervised classification yield good performance. A simple algorithm for registering coarse-resolution FI boundaries to equivalent boundaries in fine-resolution 37-GHz radiobrightness images is also presented.

Zuerndorfer, B.↗

An Algorithm for Converting Static Earth Sensor Measurements into Earth Observation Vectors

An algorithm has been developed that converts penetration angles reported by Static Earth Sensors (SESs) into Earth observation vectors. This algorithm allows compensation for variation in the horizon height including that caused by Earth oblateness. It also allows pitch and roll to be computed using any number (greater than 1) of simultaneous sensor penetration angles simplifying processing during periods of Sun and Moon interference. The algorithm computes body frame unit vectors through each SES cluster. It also computes GCI vectors from the spacecraft to the position on the Earth's limb where each cluster detects the Earth's limb. These body frame vectors are used as sensor observation vectors and the GCI vectors are used as reference vectors in an attitude solution. The attitude, with the unobservable yaw discarded, is iteratively refined to provide the Earth observation vector solution.

Harman, R.↗

Acquisition and track algorithms for the Astros star tracker

The Astros star tracker has been designed for an employment with the Space Shuttle. An achievement of the performance levels needed has required critical trade-offs between the hardware design and the control algorithms. This paper provides a description of the development of the acquisition and track algorithms. Attention is given to an Astros system overview, a system firmware description, cluster evaluation, guide star selection, exposure time determination, video data input, update interval timing, exposure time sequencing full frame video A/D conversion, analog threshold for acquisition, minimum threshold determination, and the theoretical basis for the track algorithm.

Shalom, E.↗

Detecting bimodality in astronomical datasets

We discuss statistical techniques for detecting and quantifying bimodality in astronomical datasets. We concentrate on the KMM algorithm, which estimates the statistical significance of bimodality in such datasets and objectively partitions data into subpopulations. By simulating bimodal distributions with a range of properties we investigate the sensitivity of KMM to datasets with varying characteristics. Our results facilitate the planning of optimal observing strategies for systems where bimodality is suspected. Mixture-modeling algorithms similar to the KMM algorithm have been used in previous studies to partition the stellar population of the Milky Way into subsystems. We illustrate the broad applicability of KMM by analyzing published data on globular cluster metallicity distributions, velocity distributions of galaxies in clusters, and burst durations of gamma-ray sources. FORTRAN code for the KMM algorithm and directions for its use are available from the authors upon request.

Ashman, Keith A.↗

Grid generation and flow solution method for Euler equations on unstructured grids

A grid generation and flow solution algorithm for the Euler equations on unstructured grids is presented. The grid generation scheme, which uses Delaunay triangulation, generates the field points for the mesh based on cell aspect ratios and allows clustering of grid points near solid surfaces. The flow solution method is an implicit algorithm in which the linear set of equations arising at each time step is solved using a Gauss-Seidel procedure that is completely vectorizable. Also, a study is conducted to examine the number of subiterations required for good convergence of the overall algorithm. Grid generation results are shown in two dimensions for an NACA 0012 airfoil as well as a two element configuration. Flow solution results are shown for a two dimensional flow over the NACA 0012 airfoil and for a two element configuration in which the solution was obtained through an adaptation procedure and compared with an exact solution. Preliminary three dimensional results also are shown in which the subsonic flow over a business jet is computed.

Anderson, W. Kyle↗

M-DAS: System for multispectral data analysis

M-DAS is a ground data processing system designed for analysis of multispectral data. M-DAS operates on multispectral data from LANDSAT, S-192, M2S and other sources in CCT form. Interactive training by operator-investigators using a variable cursor on a color display was used to derive optimum processing coefficients and data on cluster separability. An advanced multivariate normal-maximum likelihood processing algorithm was used to produce output in various formats: color-coded film images, geometrically corrected map overlays, moving displays of scene sections, coverage tabulations and categorized CCTs. The analysis procedure for M-DAS involves three phases: (1) screening and training, (2) analysis of training data to compute performance predictions and processing coefficients, and (3) processing of multichannel input data into categorized results. Typical M-DAS applications involve iteration between each of these phases. A series of photographs of the M-DAS display are used to illustrate M-DAS operation.

Johnson, R. H.↗

Particle Filtering for Model-Based Anomaly Detection in Sensor Networks

A novel technique has been developed for anomaly detection of rocket engine test stand (RETS) data. The objective was to develop a system that postprocesses a csv file containing the sensor readings and activities (time-series) from a rocket engine test, and detects any anomalies that might have occurred during the test. The output consists of the names of the sensors that show anomalous behavior, and the start and end time of each anomaly. In order to reduce the involvement of domain experts significantly, several data-driven approaches have been proposed where models are automatically acquired from the data, thus bypassing the cost and effort of building system models. Many supervised learning methods can efficiently learn operational and fault models, given large amounts of both nominal and fault data. However, for domains such as RETS data, the amount of anomalous data that is actually available is relatively small, making most supervised learning methods rather ineffective, and in general met with limited success in anomaly detection. The fundamental problem with existing approaches is that they assume that the data are iid, i.e., independent and identically distributed, which is violated in typical RETS data. None of these techniques naturally exploit the temporal information inherent in time series data from the sensor networks. There are correlations among the sensor readings, not only at the same time, but also across time. However, these approaches have not explicitly identified and exploited such correlations. Given these limitations of model-free methods, there has been renewed interest in model-based methods, specifically graphical methods that explicitly reason temporally. The Gaussian Mixture Model (GMM) in a Linear Dynamic System approach assumes that the multi-dimensional test data is a mixture of multi-variate Gaussians, and fits a given number of Gaussian clusters with the help of the wellknown Expectation Maximization (EM) algorithm. The parameters thus learned are used for calculating the joint distribution of the observations. However, this GMM assumption is essentially an approximation and signals the potential viability of non-parametric density estimators. This is the key idea underlying the new approach.

Solano, Wanda↗

Understanding the International Space Station Crew Perspective following Long-Duration Missions through Data Analytics & Visualization of Crew Feedback

The International Space Station (ISS) first became a home and research laboratory for NASA and International Partner crewmembers over 16 years ago. Each ISS mission lasts approximately 6 months and consists of three to six crewmembers. After returning to Earth, most crewmembers participate in an extensive series of 30+ debriefs intended to further understand life onboard ISS and allow crews to reflect on their experiences. Examples of debrief data collected include ISS crew feedback about sleep, dining, payload science, scheduling and time planning, health & safety, and maintenance. The Flight Crew Integration (FCI) Operational Habitability (OpsHab) team, based at Johnson Space Center (JSC), is a small group of Human Factors engineers and one stenographer that has worked collaboratively with the NASA Astronaut office and ISS Program to collect, maintain, disseminate and analyze this data. The database provides an exceptional and unique resource for understanding the "crew perspective" on long duration space missions. Data is formatted and categorized to allow for ease of search, reporting, and ultimately trending, in order to understand lessons learned, recurring issues and efficiencies gained over time. Recently, the FCI OpsHab team began collaborating with the NASA JSC Knowledge Management team to provide analytical analysis and visualization of these over 75,000 crew comments in order to better ascertain the crew's perspective on long duration spaceflight and gain insight on changes over time. In this initial phase of study, a text mining framework was used to cluster similar comments and develop measures of similarity useful for identifying relevant topics affecting crew health or performance, locating similar comments when a particular issue or item of operational interest is identified, and providing search capabilities to identify information pertinent to future spaceflight systems and processes for things like procedure development and training. In addition, the comments were scored for sentiment using a polarity scoring algorithm to identify both positive and negative comments for particular groups and clusters, allowing the team to make analytically informed decisions regarding future hardware and operating procedures. The use of polarity scoring with time series analysis was used to provide insight into how crew health and habitability is changing throughout various spaceflight increments or the station lifecycle as a whole. Finally, a visualization framework was developed to address the needs of the end users to search for and analyze comments by user, category or mission. This paper will discuss how the use of an analytical framework in conjunction with the current human interface, improved the understanding of crew perspective and shortened the time for analysis allowing for more informed decisions and rapid development of improvements. These methods are significantly optimizing the way that this valuable data can be assessed and applied to current and future spaceflight design and development. This collaboration allows the FCI OpsHab team to effectively analyze and share data in a more automated and timely fashion. Trends are no longer derived manually and can be illustrated effectively and accurately with these evolving techniques to an ever growing group of human spaceflight end users.

Bryant, Cody↗

Automatic Data Filter Customization Using a Genetic Algorithm

This work predicts whether a retrieval algorithm will usefully determine CO2 concentration from an input spectrum of GOSAT (Greenhouse Gases Observing Satellite). This was done to eliminate needless runtime on atmospheric soundings that would never yield useful results. A space of 50 dimensions was examined for predictive power on the final CO2 results. Retrieval algorithms are frequently expensive to run, and wasted effort defeats requirements and expends needless resources. This algorithm could be used to help predict and filter unneeded runs in any computationally expensive regime. Traditional methods such as the Fischer discriminant analysis and decision trees can attempt to predict whether a sounding will be properly processed. However, this work sought to detect a subsection of the dimensional space that can be simply filtered out to eliminate unwanted runs. LDAs (linear discriminant analyses) and other systems examine the entire data and judge a "best fit," giving equal weight to complex and problematic regions as well as simple, clear-cut regions. In this implementation, a genetic space of "left" and "right" thresholds outside of which all data are rejected was defined. These left/right pairs are created for each of the 50 input dimensions. A genetic algorithm then runs through countless potential filter settings using a JPL computer cluster, optimizing the tossed-out data s yield (proper vs. improper run removal) and number of points tossed. This solution is robust to an arbitrary decision boundary within the data and avoids the global optimization problem of whole-dataset fitting using LDA or decision trees. It filters out runs that would not have produced useful CO2 values to save needless computation. This would be an algorithmic preprocessing improvement to any computationally expensive system.

Mandrake, Lukas↗

Pre-Hardware Optimization and Implementation Of Fast Optics Closed Control Loop Algorithms

One of the main heritage tools used in scientific and engineering data spectrum analysis is the Fourier Integral Transform and its high performance digital equivalent - the Fast Fourier Transform (FFT). The FFT is particularly useful in two-dimensional (2-D) image processing (FFT2) within optical systems control. However, timing constraints of a fast optics closed control loop would require a supercomputer to run the software implementation of the FFT2 and its inverse, as well as other image processing representative algorithm, such as numerical image folding and fringe feature extraction. A laboratory supercomputer is not always available even for ground operations and is not feasible for a night project. However, the computationally intensive algorithms still warrant alternative implementation using reconfigurable computing technologies (RC) such as Digital Signal Processors (DSP) and Field Programmable Gate Arrays (FPGA), which provide low cost compact super-computing capabilities. We present a new RC hardware implementation and utilization architecture that significantly reduces the computational complexity of a few basic image-processing algorithm, such as FFT2, image folding and phase diversity for the NASA Solar Viewing Interferometer Prototype (SVIP) using a cluster of DSPs and FPGAs. The DSP cluster utilization architecture also assures avoidance of a single point of failure, while using commercially available hardware. This, combined with the control algorithms pre-hardware optimization, or the first time allows construction of image-based 800 Hertz (Hz) optics closed control loops on-board a spacecraft, based on the SVIP ground instrument. That spacecraft is the proposed Earth Atmosphere Solar Occultation Imager (EASI) to study greenhouse gases CO2, C2H, H2O, O3, O2, N2O from Lagrange-2 point in space. This paper provides an advanced insight into a new type of science capabilities for future space exploration missions based on on-board image processing for control and for robotics missions using vision sensors. It presents a top-level description of technologies required for the design and construction of SVIP and EASI and to advance the spatial-spectral imaging and large-scale space interferometry science and engineering.

Kizhner, Semion↗

An Algorithm for Hyperspectral Remote Sensing of Aerosols: 3. Application to the GEO-TASO Data in KORUS-AQ Field Campaign

This paper describes the third part of a series of investigations to develop algorithms for simultaneous retrieval of aerosol parameters and surface spectral reflectance from the data measured by GEOstationary Trace gas and Aerosol Sensor Optimization (GEO-TASO) instrument. Since the algorithm is designed for future hyperspectral and geostationary satellite sensors, such as Tropospheric Emissions: Monitoring of Pollution (TEMPO), it is applied to GEO-TASO data measured over the same area by different flights as part of the Korea-United Stated Air Quality Study (KORUS-AQ) field campaign in 2016. While GEO-TAOS has a spectral sampling interval of ~0.28 nm in the visible, its data is thinned through a band selection approach with consideration of atmospheric transmittance and different surface types, which yields 20 common spectral bands to be used by the algorithm. The algorithm starts with 4 common principal components (PCs) for surface spectral reflectance extracted from various spectral libraries, and the constraints of surface reflectance parameters and aerosol scattering models respectively from k- means clustering analysis of the Rayleigh-corrected GEO-TASO spectra and AERONET data. The algorithm then proceeds iteratively with an optimal estimation approach to update PCs and retrieve aerosol optical depth (AOD) until the best match between simulated and GEOS-TASO measured spectra is achieved. The spectral AODs are compared between those retrieved from GEO-TASO (x) and 7 AERONETS (y) in 440, 550, 550, 675 nm, respectively. The comparison reveals that iterative updates of surface spectral PCs (and so surface reflectance) yield significant enhancement in AOD retrievals, improving the mean linear fitting equations from y = 0.735x + 0.088 (without update of PCs) to y = 1.055x+ 0.01, and the Pearson correlation coefficient (𝑅𝑅2) from 0.54 to 0.76, respectively. Move case studies are need to further evaluate the algorithm for its application to TEMPO that carries a enhanced version of GEO-TASO instrument.

Tropospheric Emissions: Monitoring of Pollution (T↗

Parallel Implicit Algorithms for CFD

The main goal of this project was efficient distributed parallel and workstation cluster implementations of Newton-Krylov-Schwarz (NKS) solvers for implicit Computational Fluid Dynamics (CFD.) "Newton" refers to a quadratically convergent nonlinear iteration using gradient information based on the true residual, "Krylov" to an inner linear iteration that accesses the Jacobian matrix only through highly parallelizable sparse matrix-vector products, and "Schwarz" to a domain decomposition form of preconditioning the inner Krylov iterations with primarily neighbor-only exchange of data between the processors. Prior experience has established that Newton-Krylov methods are competitive solvers in the CFD context and that Krylov-Schwarz methods port well to distributed memory computers. The combination of the techniques into Newton-Krylov-Schwarz was implemented on 2D and 3D unstructured Euler codes on the parallel testbeds that used to be at LaRC and on several other parallel computers operated by other agencies or made available by the vendors. Early implementations were made directly in Massively Parallel Integration (MPI) with parallel solvers we adapted from legacy NASA codes and enhanced for full NKS functionality. Later implementations were made in the framework of the PETSC library from Argonne National Laboratory, which now includes pseudo-transient continuation Newton-Krylov-Schwarz solver capability (as a result of demands we made upon PETSC during our early porting experiences). A secondary project pursued with funding from this contract was parallel implicit solvers in acoustics, specifically in the Helmholtz formulation. A 2D acoustic inverse problem has been solved in parallel within the PETSC framework.

Keyes, David E.↗

A Parallel Processing Algorithm for Remote Sensing Classification

A current thread in parallel computation is the use of cluster computers created by networking a few to thousands of commodity general-purpose workstation-level commuters using the Linux operating system. For example on the Medusa cluster at NASA/GSFC, this provides for super computing performance, 130 G(sub flops) (Linpack Benchmark) at moderate cost, $370K. However, to be useful for scientific computing in the area of Earth science, issues of ease of programming, access to existing scientific libraries, and portability of existing code need to be considered. In this paper, I address these issues in the context of tools for rendering earth science remote sensing data into useful products. In particular, I focus on a problem that can be decomposed into a set of independent tasks, which on a serial computer would be performed sequentially, but with a cluster computer can be performed in parallel, giving an obvious speedup. To make the ideas concrete, I consider the problem of classifying hyperspectral imagery where some ground truth is available to train the classifier. In particular I will use the Support Vector Machine (SVM) approach as applied to hyperspectral imagery. The approach will be to introduce notions about parallel computation and then to restrict the development to the SVM problem. Pseudocode (an outline of the computation) will be described and then details specific to the implementation will be given. Then timing results will be reported to show what speedups are possible using parallel computation. The paper will close with a discussion of the results.

Gualtieri, J. Anthony↗

A cluster analysis method for identification of subpopulations of cells in flow cytometric list-mode arrays

A specialized program was developed for flow cytometric list-mode data using an heirarchical tree method for identifying and enumerating individual subpopulations, the method of principal components for a two-dimensional display of 6-parameter data array, and a standard sorting algorithm for characterizing subpopulations. The program was tested against a published data set subjected to cluster analysis and experimental data sets from controlled flow cytometry experiments using a Coulter Electronics EPICS V Cell Sorter. A version of the program in compiled BASIC is usable on a 16-bit microcomputer with the MS-DOS operating system. It is specialized for 6 parameters and up to 20,000 cells. Its two-dimensional display of Euclidean distances reveals clusters clearly, as does its 1-dimensional display. The identified subpopulations can, in suitable experiments, be related to functional subpopulations of cells.

Li, Z. K.↗

Monte Carlo predictions of DNA fragment-size distributions for large sizes after HZE particle irradiation

DSBs (double-strand breaks) produced by densely ionizing space radiation are not located randomly in the genome: recent data indicate DSB clustering along chromosomes. DSB clustering at large scales, from >100 Mbp down to approximately 2 kbp, is modeled using a Monte-Carlo algorithm. A random-walk model of chromatin is combined with a track model, that predicts the radial distribution of energy from an ion, and the RLC (randomly-located-clusters) formalism, in software called DNAbreak. This model generalizes the random-breakage model, whose broken-stick fragment-size distribution is applicable to low-LET radiation. DSB induction due to track interaction with the DNA volume depends on the radiation quality parameter Q. This dose-independent parameter depends only weakly on LET. Multi-track, high-dose effects depend on the cluster intensity parameter lambda, proportional to fluence as defined by the RLC formalism. After lambda is determined by a numerical experiment, the model reduces to one adjustable parameter Q. The best numerical fits to the experimental data, determining Q, are obtained. The knowledge of lambda and Q allows us to give biophysically based extrapolations of high-dose DNA fragment-size data to low doses or to high LETs.

NASA Center JSC↗

Leveraging ­ CPF Spectral Information for Effective Angular Corrections in Sensor Inter-calibration Studies

The Climate Absolute Radiance and Refractivity Observatory Pathfinder (CPF) mission will provide a high-accuracy (0.3% radiometric uncertainty at k=1) SI-traceable on-orbit calibration reference for sensor intercalibration in reflective solar spectral region. CPF inter-calibration algorithms have been developed to address various sampling differences between CPF and target sensors, particularly in spectral, angular, spatial and temporal domains. CPF provides unique hyper-spectral measurements that allow the utilization of rich spectral information for critical inter-calibration procedures including angular correction and spectral-gap filling. The angular correction scheme of CPF mission has been constructed based on the spectral correlation relationship between CPF observed spectra and the spectra to be measured at the viewing/sun geometry angles of target sensors. The angular correction relationship is both angular and scene dependent. The scene variability issue can impose undesired uncertainties that complicates the correction for those errors. We have demonstrated that hyper-spectral radiance information can be well utilized to identify different scene types associated with CPF observations. Using spectral radiances-based scene clustering analysis can greatly reduce the uncertainty associated with the angular correction algorithm. Additionally, a reliable quality control scheme has been established, utilizing spectral similarity and regression-prediction error analyses, to ensure the successful and efficient implementation of the angular correction method.

Wan Wu↗

Fuzzy Classification of Ocean Color Satellite Data for Bio-optical Algorithm Constituent Retrievals

The ocean has been traditionally viewed as a 2 class system. Morel and Prieur (1977) classified ocean water according to the dominant absorbent particle suspended in the water column. Case 1 is described as having a high concentration of phytoplankton (and detritus) relative to other particles. Conversely, case 2 is described as having inorganic particles such as suspended sediments in high concentrations. Little work has gone into the problem of mixing bio-optical models for these different water types. An approach is put forth here to blend bio-optical algorithms based on a fuzzy classification scheme. This scheme involves two procedures. First, a clustering procedure identifies classes and builds class statistics from in-situ optical measurements. Next, a classification procedure assigns satellite pixels partial memberships to these classes based on their ocean color reflectance signature. These membership assignments can be used as the basis for a weighting retrievals from class-specific bio-optical algorithms. This technique is demonstrated with in-situ optical measurements and an image from the SeaWiFS ocean color satellite.

Campbell, Janet W.↗