SEARCH · Engineering Papers
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.
This work focuses on incorporating pairwise constraints into a spectral clustering algorithm. A new constrained spectral clustering method is proposed, as well as an active constraint acquisition technique and a heuristic for parameter selection. We demonstrate that our constrained spectral clustering method, CSC, works well when the data exhibits what we term local proximity structure.
This paper presents a methodology for reducing the complexity of large-scale power network models using spectral clustering, aggregation of electrical components, and cost function approximation. Two approaches are explored using unconstrained and constrained spectral clustering to determine areas for effective system reduction. Once the system areas are determined, both loads and generators by type are aggregated, and their new cost function is approximated through polynomial curve-fitting or statistical methods. The performance of reduced networks is evaluated in terms of their ability to follow the true daily cost of the original system over a 24-hour period considering a set of several days. Two test systems are taken as test beds. Application of the methodology to a modified version of the IEEE 39-bus system reduces it from 17 generators to a 4-bus system and 9 generators with about 93% of accuracy. Similarly, the IEEE 118-bus system is reduced from 19 generators to a 3-bus system with three aggregated units achieving over 99% of accuracy. These findings address scalability challenges and enhance accuracy for high and mid-loading level conditions, and by aggregating thermal units with similar cost functions.
This paper describes an algorithm for hierarchical image segmentation (referred to as HSEG) and its recursive formulation (referred to as RHSEG). The HSEG algorithm is a hybrid of region growing and constrained spectral clustering that produces a hierarchical set of image segmentations based on detected convergence points. In the main, HSEG employs the hierarchical stepwise optimization (HS WO) approach to region growing, which seeks to produce segmentations that are more optimized than those produced by more classic approaches to region growing. In addition, HSEG optionally interjects between HSWO region growing iterations merges between spatially non-adjacent regions (i.e., spectrally based merging or clustering) constrained by a threshold derived from the previous HSWO region growing iteration. While the addition of constrained spectral clustering improves the segmentation results, especially for larger images, it also significantly increases HSEG's computational requirements. To counteract this, a computationally efficient recursive, divide-and-conquer, implementation of HSEG (RHSEG) has been devised and is described herein. Included in this description is special code that is required to avoid processing artifacts caused by RHSEG s recursive subdivision of the image data. Implementations for single processor and for multiple processor computer systems are described. Results with Landsat TM data are included comparing HSEG with classic region growing. Finally, an application to image information mining and knowledge discovery is discussed.
Explore the source record for details and available documents.
Not Available
High-sensitivity IRAS coadded survey data, coupled with new high-sensitivity near-IR observations, are used to investigate the nature of embedded objects over an 4.3-sq-pc area comprising the central star-forming cloud of the Ophiuchi molecular complex; the area encompasses the central cloud of the Rho Ophiuchi complex and includes the core region. Seventy-eight members of the embedded cluster were identified; spectral energy distributions were constructed for 53 objects and were compared with theoretical models to gain insight into their evolutionary status. Bolometric luminosities could be estimated for nearly all of the association members, leading to a revised luminosity function for this dust-embedded cluster.
Explore the source record for details and available documents.
This work focuses on the active selection of pairwise constraints for spectral clustering. We develop and analyze a technique for Active Constrained Clustering by Examining Spectral eigenvectorS (ACCESS) derived from a similarity matrix.
Spectral classification has been carried out for B-type stars in Ori OBl Ib, NGC 2362, IC 5146 and NGC 2264. Six stars with weak helium lines for their UBV colors were found in Ori OBl Ib, one in NGC 2362 which might be helium variable, and none in IC 5146. The star Walker No 109 (B6V) in NGC 2264 is a helium variable which has developed an outstanding absorption feature between 4144 and 4156 A.
The nodal admittance matrix (NAM)-based approach is well-suited for small-signal stability analysis of large-scale power electronics-based power systems (PEPSs), as it preserves the system structure through its admittance matrix. Previous studies have explored partitioning such systems into subareas and interconnections to reduce computational burden; however, they lacked a formal algorithmic procedure for determining feasible partitions. While several grid partitioning methods, such as those based on graph theory or machine learning, exist in the literature, they cannot be directly applied to NAM-based analysis due to differing objectives and constraints. Here, this paper addresses this gap by presenting a systematic, step-by-step procedure for applying a spectral partitioning algorithm that yields a division of the system into subareas suitable for NAM-based analysis. The computational complexity of the proposed method is also derived to demonstrate its efficiency and justify the practicality of the resulting subarea decomposition. The performance of the partitioning method is evaluated by applying the spectral clustering-derived subareas and interconnections to the NAM-based partitioning approach on a 140-bus system. Computational times for the full-system and partitioned NAM analyses are compared using MATLAB. Additionally, PSCAD simulations of the complete system and partitioned subareas are carried out to verify the effectiveness of the proposed method.
The hierarchical image segmentation algorithm (referred to as HSEG) is a hybrid of hierarchical step-wise optimization (HSWO) and constrained spectral clustering that produces a hierarchical set of image segmentations. HSWO is an iterative approach to region grooving segmentation in which the optimal image segmentation is found at N(sub R) regions, given a segmentation at N(sub R+1) regions. HSEG's addition of constrained spectral clustering makes it a computationally intensive algorithm, for all but, the smallest of images. To counteract this, a computationally efficient recursive approximation of HSEG (called RHSEG) has been devised. Further improvements in processing speed are obtained through a parallel implementation of RHSEG. This chapter describes this parallel implementation and demonstrates its computational efficiency on a Landsat Thematic Mapper test scene.
Comparisons were made between subscenes from the first TM scene acquired of the Washington, D.C. area and a MSS scene acquired approximately one year earlier. Three types of analyses were conducted to compare TM and MSS data: a water body analysis, a principal components analysis and a spectral clustering analysis. The water body analysis compared the capability of the TM to the MSS for detecting small uniform targets. Of the 59 ponds located on aerial photographs 34 (58%) were detected by the TM with six commission errors (15%) and 13 (22%) were detected by the MSS with three commission errors (19%). The smallest water body detected by the TM was 16 meters; the smallest detected by the MSS was 40 meters. For the principal components analysis, means and covariance matrices were calculated for each subscene, and principal components images generated and characterized. In the spectral clustering comparison each scene was independently clustered and the clusters were assigned to informational classes. The preliminary comparison indicated that TM data provides enhancements over MSS in terms of (1) small target detection and (2) data dimensionality (even with 4-band data). The extra dimension, partially resultant from TM band 1, appears useful for built-up/non-built-up area separation.
The development of a computer program is reported for extracting features from remotely sensed data presented in digital image form. This computer program requires no human supervision or prejudgment and operates unassisted on the raw digital data. A condensed general background is included on remote sensing of earth features and a short synopsis on some of the most commonly used types of feature extraction techniques. Results obtained from the unsupervised feature extraction computer program along with a description and listing of the computer program are presented.
Some preliminary indications were provided as to the relative merits of actual TM data versus MSS data for land cover mapping related applications. Three analyses were designed which had sensitivity to the differences in spectral, spatial and radiometric parameters between the TM and MSS. In the water body analysis, a primarily spatially related test, the detectability of small uniform targets was examined. The principal components analysis, an examination of the inherent dimensionality of the data, was more spectrally and radiometrically related. The spectral clustering analysis, also heavily spectrally and radiometrically influenced, provided information on the types of targets separable on TM versus MSS data. These analyses were to be conducted with simultaneously collected LANDSAT-4 complete TM (7 band) and MSS (4 band) data. In actuality, 4-band TM data, and archived LANDSAT-2 MSS data of the same area were used.
The NASA Analogy Software Costing Tool Suite (ASCoT) consists of a cluster-based analogy estimator for estimating software development effort, a K-Nearest Neighbors (KNN) analogy estimator for estimating effort and delivered lines of code, a simple regression-based cost estimating relationship (CER) model that estimates cost in dollars, and a probabilistic version of COCOMO II. In this paper we document the analogy algorithms as well as summarize the results of the performance of the KNN and the principle components (PCA) cluster analogy models. KNN performance is assessed by varying the number of inputs and number of neighbors. Four different clustering methods: K-means, Spectral Clustering, Hierarchical Clustering, and Principle Components Analysis (PCA), and their respective evaluation criterion are described in detail. The comparative performance of all four estimation models is assessed using magnitude of relative error (MRE) measurements.
A hierarchical set of image segmentations is a set of several image segmentations of the same image at different levels of detail in which the segmentations at coarser levels of detail can be produced from simple merges of regions at finer levels of detail. In [1], Tilton, et a1 describes an approach for producing hierarchical segmentations (called HSEG) and gave a progress report on exploiting these hierarchical segmentations for image information mining. The HSEG algorithm is a hybrid of region growing and constrained spectral clustering that produces a hierarchical set of image segmentations based on detected convergence points. In the main, HSEG employs the hierarchical stepwise optimization (HSWO) approach to region growing, which was described as early as 1989 by Beaulieu and Goldberg. The HSWO approach seeks to produce segmentations that are more optimized than those produced by more classic approaches to region growing (e.g. Horowitz and T. Pavlidis, [3]). In addition, HSEG optionally interjects between HSWO region growing iterations, merges between spatially non-adjacent regions (i.e., spectrally based merging or clustering) constrained by a threshold derived from the previous HSWO region growing iteration. While the addition of constrained spectral clustering improves the utility of the segmentation results, especially for larger images, it also significantly increases HSEG s computational requirements. To counteract this, a computationally efficient recursive, divide-and-conquer, implementation of HSEG (RHSEG) was devised, which includes special code to avoid processing artifacts caused by RHSEG s recursive subdivision of the image data. The recursive nature of RHSEG makes for a straightforward parallel implementation. This paper describes the HSEG algorithm, its recursive formulation (referred to as RHSEG), and the implementation of RHSEG using massively parallel GNU-LINUX software. Results with Landsat TM data are included comparing RHSEG with classic region growing.
Resolving the local structure motifs that characterize phase evolution as a function of composition is a key challenge in structure characterization of complex materials. Here, in this study, we combine first-principles simulations and x-ray absorption near-edge structures (XANES) analysis to gain insights into the structure evolution revealed by measurements across a combinatorial zinc titanate thin film, which was grown with smoothly varying composition over a wide range of the Ti:Zn ratio. Specifically, we propose a cluster blind-signal-separation (cBSS) method for XANES spectral analysis based on a library of the structures and spectra of representative local motifs. In addition to motifs from zinc titanate crystals, two types of Ti-defect models constructed in this study are key to the understanding of the structure characteristics in the Zn-rich region. The cBSS method makes use of both spectral clustering of the simulated site-XANES spectra library and the BSS procedure to construct high-fidelity spectral basis functions from an experimental spectral sequence. The method provides a rigorous measure of the spectral sensitivity and basis completeness. The results of the XANES analysis are corroborated with other experimental modalities, including x-ray diffraction and spectroscopic ellipsometry, to validate the cBSS method. The calculated motif weights resulting from fitting the XANES spectra with the cBSS basis probe the atomic structure characteristics of both crystalline and amorphous phases as a function of the Ti/Zn composition. The insights of the local structure motif evolution are pivotal to the understanding of the nonmonotonic trend in the optical gap, which may lead to potential applications through tuning the optical properties of zinc titanate. The workflow of the XANES spectral analysis developed in this work can be generalized to construct the structure-property relationship in a broad material space.
Absolute spectral energy distributions were measured in galaxies of three distant clusters. Redshifts and information on evolutionary effects are inferred by a comparison of the results with the integrated light energy distribution for nearby giant elliptical galaxies. Evidence for evolution over the last 3 to 6 billion years could not be established for these galaxies.