Multi-Resolution Analysis Algorithm for Fast Fault Classification and Location in Distribution Systems.
Abstract not provided.
Jimenez Aparicio, Miguel↗
SEARCH · Search NASA
Results for “classification algorithms”
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.
Tests of a Semi-Analytical Case 1 and Gelbstoff Case 2 SeaWiFS Algorithm with a Global Data Set
A semi-analytical algorithm was tested with a total of 733 points of either unpackaged or packaged-pigment data, with corresponding algorithm parameters for each data type. The 'unpackaged' type consisted of data sets that were generally consistent with the Case 1 CZCS algorithm and other well calibrated data sets. The 'packaged' type consisted of data sets apparently containing somewhat more packaged pigments, requiring modification of the absorption parameters of the model consistent with the CalCOFI study area. This resulted in two equally divided data sets. A more thorough scrutiny of these and other data sets using a semianalytical model requires improved knowledge of the phytoplankton and gelbstoff of the specific environment studied. Since the semi-analytical algorithm is dependent upon 4 spectral channels including the 412 nm channel, while most other algorithms are not, a means of testing data sets for consistency was sought. A numerical filter was developed to classify data sets into the above classes. The filter uses reflectance ratios, which can be determined from space. The sensitivity of such numerical filters to measurement resulting from atmospheric correction and sensor noise errors requires further study. The semi-analytical algorithm performed superbly on each of the data sets after classification, resulting in RMS1 errors of 0.107 and 0.121, respectively, for the unpackaged and packaged data-set classes, with little bias and slopes near 1.0. In combination, the RMS1 performance was 0.114. While these numbers appear rather sterling, one must bear in mind what mis-classification does to the results. Using an average or compromise parameterization on the modified global data set yielded an RMS1 error of 0.171, while using the unpackaged parameterization on the global evaluation data set yielded an RMS1 error of 0.284. So, without classification, the algorithm performs better globally using the average parameters than it does using the unpackaged parameters. Finally, the effects of even more extreme pigment packaging must be examined in order to improve algorithm performance at high latitudes. Note, however, that the North Sea and Mississippi River plume studies contributed data to the packaged and unpackaged classess, respectively, with little effect on algorithm performance. This suggests that gelbstoff-rich Case 2 waters do not seriously degrade performance of the semi-analytical algorithm.
Carder, Kendall L.↗
Automated Recognition of 3D Features in GPIR Images
A method of automated recognition of three-dimensional (3D) features in images generated by ground-penetrating imaging radar (GPIR) is undergoing development. GPIR 3D images can be analyzed to detect and identify such subsurface features as pipes and other utility conduits. Until now, much of the analysis of GPIR images has been performed manually by expert operators who must visually identify and track each feature. The present method is intended to satisfy a need for more efficient and accurate analysis by means of algorithms that can automatically identify and track subsurface features, with minimal supervision by human operators. In this method, data from multiple sources (for example, data on different features extracted by different algorithms) are fused together for identifying subsurface objects. The algorithms of this method can be classified in several different ways. In one classification, the algorithms fall into three classes: (1) image-processing algorithms, (2) feature- extraction algorithms, and (3) a multiaxis data-fusion/pattern-recognition algorithm that includes a combination of machine-learning, pattern-recognition, and object-linking algorithms. The image-processing class includes preprocessing algorithms for reducing noise and enhancing target features for pattern recognition. The feature-extraction algorithms operate on preprocessed data to extract such specific features in images as two-dimensional (2D) slices of a pipe. Then the multiaxis data-fusion/ pattern-recognition algorithm identifies, classifies, and reconstructs 3D objects from the extracted features. In this process, multiple 2D features extracted by use of different algorithms and representing views along different directions are used to identify and reconstruct 3D objects. In object linking, which is an essential part of this process, features identified in successive 2D slices and located within a threshold radius of identical features in adjacent slices are linked in a directed-graph data structure. Relative to past approaches, this multiaxis approach offers the advantages of more reliable detections, better discrimination of objects, and provision of redundant information, which can be helpful in filling gaps in feature recognition by one of the component algorithms. The image-processing class also includes postprocessing algorithms that enhance identified features to prepare them for further scrutiny by human analysts (see figure). Enhancement of images as a postprocessing step is a significant departure from traditional practice, in which enhancement of images is a preprocessing step.
Park, Han↗
The Calipso Version 4.5 Stratospheric Aerosol Subtyping Algorithm
The accurate classification of aerosol types injected into the stratosphere is important to properly characterize their chemical and radiative impacts within the Earth climate system. The updated stratospheric aerosol subtyping algorithm used in the version 4.5 (V4.5) release of the Cloud Aerosol Lidar with Orthogonal Polarization (CALIOP) level 2 data products now delivers more comprehensive and accurate classifications than its predecessor. The original algorithm identified four aerosol subtypes for layers detected above the tropopause: volcanic ash, smoke, sulfate/other, and polar stratospheric aerosol (PSA). In the revised algorithm, sulfates are separately identified as a distinct, homogeneous subtype, and the diffuse, weakly scattering layers previously assigned to the sulfate/other class are recategorized as a fifth “unclassified” subtype. By making two structural changes to the algorithm and revising two thresholds, the V4.5 algorithm improves the ability to discriminate between volcanic ash and smoke from pyrocumulonimbus injections, improves the fidelity of the sulfate subtype, and more accurately reflects the uncertainties inherent in the classification process. The 532 nm lidar ratio for volcanic ash was also revised to a value more consistent with the current state of knowledge. This paper briefly reviews the previous version of the algorithm (V4.1 and V4.2) then fully details the rationale and impact of the V4.5 changes on subtype classification frequency for specific events where the dominant aerosol type is known based on the literature. Classification accuracy is best for volcanic ash due to its characteristically high depolarization ratio. Smoke layers in the stratosphere are also classified with reasonable accuracy, though during the daytime a substantial fraction are misclassified as ash. It is also possible for mixtures of ash and sulfate to be misclassified as smoke. The V4.5 sulfate subtype accuracy is less than that for ash or smoke, with sulfates being misclassified as smoke about one-third of the time. However, because exceptionally tenuous layers are now assigned to the unclassified subtype and the revised algorithm levies more stringent criteria for identifying an aerosol as sulfate, it is more likely that layers labeled as this subtype are in fact sulfate compared to those assigned the sulfate/other classification in the previous data release.
Jason L Tackett↗
Herbig Ae/Be Stars toward the Dark Cloud LDN 1667
We report the discovery of a new emission-line object, named SPH 4-South = (GAIA EDR3 5616553300192230272), toward the dark cloud LDN 1667. This object came to our attention after inspecting public images that show a faint diffuse nebula a few arcseconds south of SPH 4, an emission-line object previously classified as a T Tauri star. We present high-resolution spectra and analyzed JHK photometry of SPH 4 and SPH 4-South and new narrowband and archival broadband images of these objects. A comparison of the spectra of SPH 4 and SPH 4-South with high-resolution ones of DG Cir and R Mon strongly suggests that SPH 4 and SPH 4-South are Herbig Ae/Be stars. The classification of SPH 4-South is further supported by using a k-NN algorithm to its position in an H–K versus J–H color–color diagram. Both stars are detected in the four WISE bands and the WISE colors allow us to classify SPH 4 as a Class I and SPH 4-South as a Class II source. We also show that the faint nebula is most probably associated with SPH 4-South. Using published results on LDN 1667 and the Gaia Early Data Release 3, we conclude that SPH 4 is a member of LDN 1667. The case of SPH 4-South is not clear because the determination of its distance and proper motion could be affected by the nebulosity around the star, although membership of SPH 4-South to LDN 1667 cannot be ruled out.
47 OTHER INSTRUMENTATION↗
Impact of Non-Uniform Beam Filling on Spaceborne Cloud and Precipitation Radar Retrieval Algorithms
In this presentation we will discuss the performance of classification and retrieval algorithms for spaceborne cloud and precipitation radars such as the Global Precipitation Measurement mission Dual-frequency Precipitation Radar (GPM/DPR), and notional radar for the Aerosol/Clouds/Ecosystem (ACE) mission and related concepts. Spaceborne radar measurements are simulated either from Airborne Precipitation Radar 2nd Generation observations, or from atmospheric model outputs via instrument simulators contained in the NASA Earth Observing Systems Simulators Suite (NEOS(sup 3)). Both methods account for the three dimensional nature of the scattering field at resolutions smaller than that of the spaceborne radar under consideration. We will focus on the impact of non-homogeneities of the field of hydrometeors within the beam. We will discuss also the performance of methods to identify and mitigate such conditions, and the resulting improvements in retrieval accuracy. The classification and retrieval algorithms analyzed in this study are those derived from APR-2's Suite of Processing and Retrieval Algorithms (ASPRA); here generalized to operate on an arbitrary set of radar configuration parameters to study the expected performance of spaceborne cloud and precipitation radars. The presentation will highlight which findings extend to other algorithm families and which ones do not.
Aerosol/Clouds/Ecosystem (ACE)↗
Pushing automated morphological classifications to their limits with the Dark Energy Survey
ABSTRACT We present morphological classifications of ∼27 million galaxies from the Dark Energy Survey (DES) Data Release 1 (DR1) using a supervised deep learning algorithm. The classification scheme separates: (a) early-type galaxies (ETGs) from late-type galaxies (LTGs); and (b) face-on galaxies from edge-on. Our convolutional neural networks (CNNs) are trained on a small subset of DES objects with previously known classifications. These typically have mr ≲ 17.7 mag; we model fainter objects to mr < 21.5 mag by simulating what the brighter objects with well-determined classifications would look like if they were at higher redshifts. The CNNs reach 97 per cent accuracy to mr < 21.5 on their training sets, suggesting that they are able to recover features more accurately than the human eye. We then used the trained CNNs to classify the vast majority of the other DES images. The final catalogue comprises five independent CNN predictions for each classification scheme, helping to determine if the CNN predictions are robust or not. We obtain secure classifications for ∼87 per cent and 73 per cent of the catalogue for the ETG versus LTG and edge-on versus face-on models, respectively. Combining the two classifications (a) and (b) helps to increase the purity of the ETG sample and to identify edge-on lenticular galaxies (as ETGs with high ellipticity). Where a comparison is possible, our classifications correlate very well with Sérsic index (n), ellipticity (ϵ), and spectral type, even for the fainter galaxies. This is the largest multiband catalogue of automated galaxy morphologies to date.
79 ASTRONOMY AND ASTROPHYSICS↗
A new image enhancement algorithm with applications to forestry stand mapping
The theory and applications are presented of a new image enhancement algorithm which refines computer classification maps of multispectral data. The refinement eliminates connected sets smaller than a prespecified size and merges them to the surrounding area. Conventional practices in forestry timber stand mapping requires small geographic areas to be absorbed by surrounding large areas to form homogeneous stands. This homogeneity is often incompatible with the statistical formulation of homogeneity. Elements within a timber stand which should be labeled as one feature often correspond to more than one class mapped by existing computer classification techniques. The new algorithm is designed to postprocess classification maps to result in more usable timber stand maps. The new image enhancement technique is compared with an accepted neighbor-checking postprocessing technique, demonstrating the superiority of the new technique for forestry stand mapping.
Kan, E. P.↗
Learning algorithms for multi-class pattern classification and problems associated with on-line handwritten character recognition
On-line handwritten alphanumeric character recognition system and learning algorithm for multiclass pattern classification
Li, C. C.↗
Machine Learning (ML) Classifier to Assist Metadata Creation
The Atmospheric Radiation Measurement (ARM) Data Center is responsible for the timely collection, archival, and curation of science data products. These products are freely available through an online data repository. Metadata creation is paramount for scientific users to find and access over seven petabytes of atmospheric science data. The hierarchical metadata structure allows users to search for information at both broad and narrow levels. This project aims to leverage 30 years’ worth of manually created metadata to enable machine predictions of broad-term classifications from narrow-term descriptions. These classification predictions would assist metadata coordinators with their term selections. This paper discusses the cleaning and preprocessing of the training data, the pipeline developed to determine the best model for this task, and the creation of an API metadata classifier for ARM measurement metadata. Our results show that the Linear Support Vector Classification (LinearSVC) algorithm, along with the Term Frequency – Inverse Document Frequency (TF-IDF) vectorizer, is well-suited for our multi-class classification task. Lengthier input training data led to better results, and artificial balancing was unnecessary for this particular use case. This predictive classifier enhances efficiency in metadata creation, as well as supports greater consistency and accuracy in metadata tagging.
Collier, Hannah [ORNL] (ORCID:0000000341284292)↗
Direction-optimizing Label Propagation Framework for Structure Detection in Graphs: Design, Implementation, and Experimental Analysis
Label Propagation is not only a well-known machine learning algorithm for classification but also an effective method for discovering communities and connected components in networks. We propose a new Direction-optimizing Label Propagation Algorithm (DOLPA) framework that enhances the performance of the standard Label Propagation Algorithm (LPA), increases its scalability, and extends its versatility and application scope. As a central feature, the DOLPA framework relies on the use of frontiers and alternates between label push and label pull operations to attain high performance. It is formulated in such a way that the same basic algorithm can be used for finding communities or connected components in graphs by only changing the objective function used. Additionally, DOLPA has parameters for tuning the processing order of vertices in a graph to reduce the number of edges visited and improve the quality of solution obtained. We present the design and implementation of the enhanced algorithm as well as our shared-memory parallelization of it using OpenMP. We also present an extensive experimental evaluation of our implementations using the LFR benchmark and real-world networks drawn from various domains. Compared with an implementation of LPA for community detection available in a widely used network analysis software, we achieve at most five times the F-Score while maintaining similar runtime for graphs with overlapping communities. We also compare DOLPA against an implementation of the Louvain method for community detection using the same LFR-graphs and show that DOLPA achieves about three times the F-Score at just 10% of the runtime. For connected component decomposition, our algorithm achieves orders of magnitude speedups over the basic LP-based algorithm on large-diameter graphs, up to 13.2× speedup over the Shiloach-Vishkin algorithm, and up to 1.6× speedup over Afforest on an Intel Xeon processor using 40 threads.
97 MATHEMATICS AND COMPUTING↗
Fast Extraction and Characterization of Fundamental Frequency Events from a Large PMU Dataset using Big Data Analytics
A novel method for fast extraction of fundamental frequency events (FFE) based on measurements of frequency and rate of change of frequency by Phasor Measurement Units (PMU) is introduced. The method is designed to work with exceptionally large historical PMU datasets. Statistical analysis was used to extract the features and train Random Forest and Catboost classifiers. The method is capable of fast extraction of FFE from a historical dataset containing measurements from hundreds of PMUs captured over multiple years. The reported accuracy of the best algorithm for classification expressed as Area Under the receiver operating Characteristic curve reaches 0.98, which was obtained in out-of-sample evaluations on 109 system-wide events over 2 years observed at 43 PMUs. Then Minimum Volume Enclosing Ellipsoid Algorithm was used to further analyze the events. 93.72% events were correctly characterized, where average duration of the event as seen by the PMU was 9.93 sec.
Baembitov, Rashid↗
Cloud classification from satellite data using a fuzzy sets algorithm: A polar example
Where spatial boundaries between phenomena are diffuse, classification methods which construct mutually exclusive clusters seem inappropriate. The Fuzzy c-means (FCM) algorithm assigns each observation to all clusters, with membership values as a function of distance to the cluster center. The FCM algorithm is applied to AVHRR data for the purpose of classifying polar clouds and surfaces. Careful analysis of the fuzzy sets can provide information on which spectral channels are best suited to the classification of particular features, and can help determine likely areas of misclassification. General agreement in the resulting classes and cloud fraction was found between the FCM algorithm, a manual classification, and an unsupervised maximum likelihood classifier.
Key, J. R.↗
Cloud classification from satellite data using a fuzzy sets algorithm - A polar example
Where spatial boundaries between phenomena are diffuse, classification methods which construct mutually exclusive clusters seem inappropriate. The Fuzzy c-means (FCM) algorithm assigns each observation to all clusters, with membership values as a function of distance to the cluster center. The FCM algorithm is applied to AVHRR data for the purpose of classifying polar clouds and surfaces. Careful analysis of the fuzzy sets can provide information on which spectral channels are best suited to the classification of particular features, and can help determine like areas of misclassification. General agreement in the resulting classes and cloud fraction was found between the FCM algorithm, a manual classification, and an unsupervised maximum likelihood classifier.
Key, J. R.↗
Oregon Coast Range Ecological Conservation: Mapping Recent Logging Within Drinking Watersheds of Oregon’s Coastal Range to Support Future Resource Management Policies
Logging operations are widespread across the Oregon Coast Range and conventional logging practices pose a risk of contamination to surface water quality. The NASA DEVELOP Oregon Coast Ecological Conservation team partnered with nonprofit Oregon Wild to quantify the extent of clearcutting and commercial thinning in 80 Coast Range drinking watersheds between 2000 and 2022. This project used all available Landsat data from 1997 through June 2023 in Google Earth Engine. Sensors used include Landsat 5 Thematic Mapper, Landsat 7 Enhanced Thematic Mapper Plus, Landsat 8 Operational Land Imager, and Landsat 9 Operational Land Imager-2. The Continuous Change Detection and Classification (CCDC) algorithm was used with Landsat observations to identify clearcutting patches. Percent change in summer median Landsat Normalized Difference Vegetation Index (NDVI) images were used to identify areas of forest disturbance including commercial thinning. The team concluded that logging, including both clearcutting and commercial thinning, impacted 31% of forested area in drinking watersheds and the intensity of logging remained consistent from year to year. Clearcutting occurred primarily on private land while commercial thinning occurred primarily on state and federal lands. This study showed that CCDC effectively identifies clearcutting, and percent change in NDVI successfully identifies disturbances including commercial thinning. Key constraints included the lack of field validation data and the inability to attribute disturbances to logging with certainty. Ultimately, this study identified the drinking watersheds and communities most likely to be impacted by logging activity. These results can inform legislation aimed at balancing the commercial and environmental benefits of forestlands.
Logging↗
Photometric redshift estimation of BASS DR3 quasars by machine learning
ABSTRACT Correlating Beijing–Arizona Sky Survey (BASS) data release 3 (DR3) catalogue with the ALLWISE data base, the data from optical and infrared information are obtained. The quasars from Sloan Digital Sky Survey are taken as training and test samples while those from LAMOST are considered as external test sample. We propose two schemes to construct the redshift estimation models with XGBoost, CatBoost, and Random Forest. One scheme (namely one-step model) is to predict photometric redshifts directly based on the optimal models created by these three algorithms; the other scheme (namely two-step model) is to first classify the data into low- and high-redshift data sets, and then predict photometric redshifts of these two data sets separately. For one-step model, the performance of these three algorithms on photometric redshift estimation is compared with different training samples, and CatBoost is superior to XGBoost and Random Forest. For two-step model, the performances of these three algorithms on the classification of low and high redshift subsamples are compared, and CatBoost still shows the best performance. Therefore, CatBoost is regarded as the core algorithm of classification and regression in two-step model. In contrast to one-step model, two-step model is optimal when predicting photometric redshift of quasars, especially for high-redshift quasars. Finally, the two models are applied to predict photometric redshifts of all quasar candidates of BASS DR3. The number of high-redshift quasar candidates is 3938 (redshift ≥3.5) and 121 (redshift ≥4.5) by two-step model. The predicted result will be helpful for quasar research and follow-up observation of high-redshift quasars.
79 ASTRONOMY AND ASTROPHYSICS↗
Hijacking a rapid and scalable metagenomic method reveals subgenome dynamics and evolution in polyploid plants
Premise: The genomes of polyploid plants archive the evolutionary events leading to their present forms. However, plant polyploid genomes present numerous hurdles to the genome comparison algorithms for classification of polyploid types and exploring genome dynamics. Methods: Here, the problem of intra- and inter-genome comparison for examining polyploid genomes is reframed as a metagenomic problem, enabling the use of the rapid and scalable MinHashing approach. To determine how types of polyploidy are described by this metagenomic approach, plant genomes were examined from across the polyploid spectrum for both k-mer composition and frequency with a range of k-mer sizes. In this approach, no subgenome-specific k-mers are identified; rather, whole-chromosome k-mer subspaces were utilized. Results: Given chromosome-scale genome assemblies with sufficient subgenome-specific repetitive element content, literature-verified subgenomic and genomic evolutionary relationships were revealed, including distinguishing auto- from allopolyploidy and putative progenitor genome assignment. The sequences responsible were the rapidly evolving landscape of transposable elements. An investigation into the MinHashing parameters revealed that the downsampled k-mer space (genomic signatures) produced excellent approximations of sequence similarity. Furthermore, the clustering approach used for comparison of the genomic signatures is scrutinized to ensure applicability of the metagenomics-based method. Discussion: The easily implementable and highly computationally efficient MinHashing-based sequence comparison strategy enables comparative subgenomics and genomics for large and complex polyploid plant genomes. Such comparisons provide evidence for polyploidy-type subgenomic assignments. In cases where subgenome-specific repeat signal may not be adequate given a chromosomes' global k-mer profile, alternative methods that are more specific but more computationally complex outperform this approach.
59 BASIC BIOLOGICAL SCIENCES↗