Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “classification problem”

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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
NASA NTRS1993

Using machine learning techniques to automate sky survey catalog generation

We describe the application of machine classification techniques to the development of an automated tool for the reduction of a large scientific data set. The 2nd Palomar Observatory Sky Survey provides comprehensive photographic coverage of the northern celestial hemisphere. The photographic plates are being digitized into images containing on the order of 10(exp 7) galaxies and 10(exp 8) stars. Since the size of this data set precludes manual analysis and classification of objects, our approach is to develop a software system which integrates independently developed techniques for image processing and data classification. Image processing routines are applied to identify and measure features of sky objects. Selected features are used to determine the classification of each object. GID3* and O-BTree, two inductive learning techniques, are used to automatically learn classification decision trees from examples. We describe the techniques used, the details of our specific application, and the initial encouraging results which indicate that our approach is well-suited to the problem. The benefits of the approach are increased data reduction throughput, consistency of classification, and the automated derivation of classification rules that will form an objective, examinable basis for classifying sky objects. Furthermore, astronomers will be freed from the tedium of an intensely visual task to pursue more challenging analysis and interpretation problems given automatically cataloged data.

Fayyad, Usama M.↗
NASA NTRS1967

Generalized superposition.

Generalization of superposition principle for linear systems applied to classification of nonlinear systems and solution of nonlinear filtering problems

Oppenheim, A. V.↗
NASA NTRS1975

LANDSAT data for state planning

The results of an effort to generate and apply automated classification of LANDSAT digital data to state of Georgia problems are presented. This phase centers on an analysis of the usefulness of LANDSAT digital data to provide land-use data for transportation planning. Hall County, Georgia was chosen as a test site because it is part of a seventeen county area for which the Georgia Department of Transportation is currently designing a Transportation Planning Land-Use Simulation Model. The land-cover information derived from this study was compared to several other existing sources of land-use data for Hall County and input into this simulation. The results indicate that there is difficulty comparing LANDSAT derived land-cover information with previous land-use information since the LANDSAT data are acquired on an acre by acre grid basis while all previous land-use surveys for Hall County used land-use data on a parcel basis.

Faust, N. L.↗
NASA NTRS1995

The luminosity structure and objective classification of galaxies

The luminosity structure of spiral galaxies is studied using the technique of principal component analysis. It is found that approximately 94% of the variation in the luminosity distribution of galaxies can be accounted for by just two principal components. The principal luminosity components may contain valuable information about star formation history or whatever luminosity-regulating process occurs in galaxies. Practically, these principal components provide a new approach for the investigation of the luminosity structures of galaxies and their dependence on other properties. They also serve as an excellent objective classification system for galaxies. We introduce in this paper such a classification scheme and explore its various properties. The new system shows a number of very impressive characteristics. Most important, it can well segregate virtually all the important galactic properties we tested and does so much better than the conventional morphological classification systems. Of particular interest is that some distance-dependent parameters can also be determined to a surprisingly good accuracy; for example, absolute magnitude may be determined to an accuracy of approximately 0.6 mag (yet further improvement is believed to be highly possible). Second, the system is objective, and the classification procedure can be automated to a large degree; also the new system can apply to much smaller and fainter images than do eye-based clasification systems. These properties make the new system suitable for practical application, especially on very large (and deeper) digital image catalogs. Third, the classification is expressed in dimensionless numbers, yet the simple notation bears significant and easily understandable meaning, making it easy and convenient to use. Finally, the new system has another extremely useful feature: it provides a very powerful and convenient platform not only for classification, but also for easily recording, examining, and studying the variations and correlations of galaxy properties-all these may be carried out graphically by using the C-vectors and the C-diagrams introduced in the paper. We wil also give an example to demonstrate the use of the classification system for the study of the internal extinction problem in spiral galaxies.

Han, Mingshen↗
NASA NTRS2010

Fast Solution in Sparse LDA for Binary Classification

An algorithm that performs sparse linear discriminant analysis (Sparse-LDA) finds near-optimal solutions in far less time than the prior art when specialized to binary classification (of 2 classes). Sparse-LDA is a type of feature- or variable- selection problem with numerous applications in statistics, machine learning, computer vision, computational finance, operations research, and bio-informatics. Because of its combinatorial nature, feature- or variable-selection problems are NP-hard or computationally intractable in cases involving more than 30 variables or features. Therefore, one typically seeks approximate solutions by means of greedy search algorithms. The prior Sparse-LDA algorithm was a greedy algorithm that considered the best variable or feature to add/ delete to/ from its subsets in order to maximally discriminate between multiple classes of data. The present algorithm is designed for the special but prevalent case of 2-class or binary classification (e.g. 1 vs. 0, functioning vs. malfunctioning, or change versus no change). The present algorithm provides near-optimal solutions on large real-world datasets having hundreds or even thousands of variables or features (e.g. selecting the fewest wavelength bands in a hyperspectral sensor to do terrain classification) and does so in typical computation times of minutes as compared to days or weeks as taken by the prior art. Sparse LDA requires solving generalized eigenvalue problems for a large number of variable subsets (represented by the submatrices of the input within-class and between-class covariance matrices). In the general (fullrank) case, the amount of computation scales at least cubically with the number of variables and thus the size of the problems that can be solved is limited accordingly. However, in binary classification, the principal eigenvalues can be found using a special analytic formula, without resorting to costly iterative techniques. The present algorithm exploits this analytic form along with the inherent sequential nature of greedy search itself. Together this enables the use of highly-efficient partitioned-matrix-inverse techniques that result in large speedups of computation in both the forward-selection and backward-elimination stages of greedy algorithms in general.

Moghaddam, Baback↗
NASA NTRS1990

Vorticity-dilatation boundary conditions for viscous compressible flows

The theoretical generalization, synthesis, and classification of various relevant formulations of the vorticity-dilatation conditioning problem is presented. Kinematic and dynamic conditions as well as differential and integral forms are considered. The possibility of using various variables that relate directly to vorticity and dilatation to construct the desired boundary conditions is examined. Some new formulations are given and previously proposed ones are located properly in the classification, and their interrelations are clarified.

Wu, J. Z.↗
NASA NTRS2002

Classification of Aircraft Maneuvers for Fault Detection

Automated fault detection is an increasingly important problem in aircraft maintenance and operation. Standard methods of fault detection assume the availability of either data produced during all possible faulty operation modes or a clearly-defined means to determine whether the data is a reasonable match to known examples of proper operation. In our domain of fault detection in aircraft, the first assumption is unreasonable and the second is difficult to determine. We envision a system for online fault detection in aircraft, one part of which is a classifier that predicts the maneuver being performed by the aircraft as a function of vibration data and other available data. We explain where this subsystem fits into our envisioned fault detection system as well its experiments showing the promise of this classification subsystem.

Oza, Nikunj C.↗
NASA NTRS1979

Classification and equivalence in estimation theory

A method is proposed for classifying estimation problems based on the Lie algebra generated by the operators which appear in the conditional density equation. A natural class of automorphisms of this algebra is examined and a systematic method of generating equivalent problems is developed. Finally, a new class of nonlinear filtering problems with essentially nonlinear filtering equations are presented.

Brockett, R. W.↗
NASA NTRS2002

Classification of Aircraft Maneuvers for Fault Detection

Automated fault detection is an increasingly important problem in aircraft maintenance and operation. Standard methods of fault detection assume the availability of either data produced during all possible faulty operation modes or a clearly-defined means to determine whether the data provide a reasonable match to known examples of proper operation. In the domain of fault detection in aircraft, the first assumption is unreasonable and the second is difficult to determine. We envision a system for online fault detection in aircraft, one part of which is a classifier that predicts the maneuver being performed by the aircraft as a function of vibration data and other available data. To develop such a system, we use flight data collected under a controlled test environment, subject to many sources of variability. We explain where our classifier fits into the envisioned fault detection system as well as experiments showing the promise of this classification subsystem.

Oza, Nikunj↗
DOE OSTI2022

Multisource Mobile Transfer Learning Algorithm Based on Dynamic Model Compression

With the development of the Internet of Things, the application of computer vision on mobile phones is becoming more and more extensive and people have higher and higher requirements for the timeliness of the recognition results returned and the processing capabilities of the mobile phone for image recognition. However, the processing capability and storage capability of the user terminal equipment cannot meet the needs of identifying and storing a large number of pictures, and the data transmission process will cause high energy consumption of the terminal equipment. At the same time, multisource deep transfer learning has outstanding performance in computer vision and image classification. However, due to the huge amount of calculation of the deep network model, it is impossible to use the existing excellent network model to realize image recognition and classification on the mobile terminal. In order to solve the abovementioned problems, we propose a multisource mobile transfer learning algorithm based on dynamic model compression, this algorithm considers the realization of multisource transfer learning computing in the case of multiple mobile device computing source domains, and the method also guarantees data privacy and security for each device (origin domain). Meanwhile, extensive experiments show that our method can achieve remarkable results in popular image classification datasets.

Gao, Peng↗
DOE OSTI2021

Train Like a (Var)Pro: Efficient Training of Neural Networks with Variable Projection

Deep neural networks (DNNs) have achieved state-of-the-art performance across a variety of traditional machine learning tasks, e.g., speech recognition, image classification, and segmentation. The ability of DNNs to efficiently approximate high-dimensional functions has also motivated their use in scientific applications, e.g., to solve partial differential equations and to generate surrogate models. In this paper, we consider the supervised training of DNNs, which arises in many of the above applications. We focus on the central problem of optimizing the weights of the given DNN such that it accurately approximates the relation between observed input and target data. Devising effective solvers for this optimization problem is notoriously challenging due to the large number of weights, nonconvexity, data sparsity, and nontrivial choice of hyperparameters. To solve the optimization problem more efficiently, we propose the use of variable projection (VarPro), a method originally designed for separable nonlinear least-squares problems. Our main contribution is the Gauss--Newton VarPro method (GNvpro) that extends the reach of the VarPro idea to nonquadratic objective functions, most notably cross-entropy loss functions arising in classification. These extensions make GNvpro applicable to all training problems that involve a DNN whose last layer is an affine mapping, which is common in many state-of-the-art architectures. In our four numerical experiments from surrogate modeling, segmentation, and classification, GNvpro solves the optimization problem more efficiently than commonly used stochastic gradient descent (SGD) schemes. Finally, GNvpro finds solutions that generalize well, and in all but one example better than well-tuned SGD methods, to unseen data points.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Characterization and classification of interacting ( 2 + 1 )-dimensional topological crystalline insulators with orientation-preserving wallpaper groups

While free fermion topological crystalline insulators have been largely classified, the analogous problem in the strongly interacting case has been only partially solved. In this work, we develop a characterization and classification of interacting, invertible fermionic topological phases in (2+1) dimensions with charge conservation, discrete magnetic translation and M-fold point group rotation symmetries, which form the group G f = U(1) f × Φ [Z 2 $\rtimes$Z M ] for M = 1,2,3,4, and 6. Φ is the magnetic flux per unit cell. We derive a topological response theory in terms of background crystalline gauge fields, which gives a complete classification of different phases and a physical characterization in terms of quantized response to symmetry defects. We then derive the same classification in terms of a set of real space invariants {$Θ^±_o$} that can be obtained from ground state expectation values of suitable partial rotation operators. We explicitly relate these real space invariants to the quantized coefficients in the topological response theory, and find the dependence of the invariants on the chiral central charge c – of the invertible phase. Finally, when Φ = 0 we derive an explicit map between the free and interacting classifications.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
NASA NTRS1979

Classification and mensuration of LACIE segments

The theory of classification methods and the functional steps in the manual training process used in the three phases of LACIE are discussed. The major problems that arose in using a procedure for manually training a classifier and a method of machine classification are discussed to reveal the motivation that led to a redesign for the third LACIE phase.

Heydorn, R. P.↗
DOE OSTI2023

First Impressions: Early-time Classification of Supernovae Using Host-galaxy Information and Shallow Learning

Substantial effort has been devoted to the characterization of transient phenomena from photometric information. Automated approaches to this problem have taken advantage of complete phase coverage of an event, limiting their use for triggering rapid follow-up of ongoing phenomena. In this work, we introduce a neural network with a single recurrent layer designed explicitly for early photometric classification of supernovae (SNe). Our algorithm leverages transfer learning to account for model misspecification, host-galaxy photometry to solve the data-scarcity problem soon after discovery, and a custom weighted loss to prioritize accurate early classification. We first train our algorithm using state-of-the-art transient and host-galaxy simulations, then adapt its weights and validate it on the spectroscopically confirmed SNe Ia, SNe II, and SNe Ib/c from the Zwicky Transient Facility Bright Transient Survey. On observed data, our method achieves an overall accuracy of 82% ± 2% within 3 days of an event’s discovery, and an accuracy of 87% ± 5% within 30 days of discovery. At both early and late phases, our method achieves comparable or superior results to the leading classification algorithms with a simpler network architecture. These results help pave the way for rapid photometric and spectroscopic follow-up of scientifically valuable transients discovered in massive synoptic surveys.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1979

Remote Sensing and Problems of the Hydrosphere

A discussion of freshwater and marine systems is presented including areas of the classification of lakes, identification and quantification of major functional groups of phytoplankton, sources and sinks of biochemical factors, and temporal and regional variability of surface features. Atmospheric processes linked to hydrospheric process through the transfer of matter via aerosols and gases are discussed. Particle fluxes to the aquatic environment and global geochemical problems are examined.

Goldberg, E. D.↗
DOE OSTI2024

Few measurement shots challenge generalization in learning to classify entanglement

The ability to extract general laws from a few known examples depends on the complexity of the problem and on the amount of training data. In the quantum setting, the learner's generalization performance is further challenged by the destructive nature of quantum measurements that, together with the no-cloning theorem, limits the amount of information that can be extracted from each training sample. In this paper we focus on hybrid quantum learning techniques where classical machine-learning methods are paired with quantum algorithms and show that, in some settings, the uncertainty coming from a few measurement shots can be the dominant source of errors. We identify an instance of this possibly general issue by focusing on the classification of maximally entangled vs. separable states, showing that this toy problem becomes challenging for learners unaware of entanglement theory. Finally, we introduce an estimator based on classical shadows that performs better in the big data, few copy regime. Our results show that the naive application of classical machine-learning methods to the quantum setting is problematic, and that a better theoretical foundation of quantum learning is required.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Data Fusion of Very High Resolution Hyperspectral and Polarimetric SAR Imagery for Terrain Classification

Performing terrain classification with data from heterogeneous imaging modalities is a very challenging problem. The challenge is further compounded by very high spatial resolution. (In this paper we consider very high spatial resolution to be much less than a meter.) At very high resolution many additional complications arise, such as geometric differences in imaging modalities and heightened pixel-by-pixel variability due to inhomogeneity within terrain classes. In this paper we consider the fusion of very high resolution hyperspectral imaging (HSI) and polarimetric synthetic aperture radar (PolSAR) data. We introduce a framework that utilizes the probabilistic feature fusion (PFF) one-class classifier for data fusion and demonstrate the effect of making pixelwise, superpixel, and pixelwise voting (within a superpixel) terrain classification decisions. We show that fusing imaging modality data sets, combined with pixelwise voting within the spatial extent of superpixels, gives a robust terrain classification framework that gives a good balance between quantitative and qualitative results.

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

Jet classification using high-level features from anatomy of top jets

Recent advancements in deep learning models have significantly enhanced jet classification performance by analyzing low-level features (LLFs). However, this approach often leads to less interpretable models, emphasizing the need to understand the decision-making process and to identify the high-level features (HLFs) crucial for explaining jet classification. To address this, we consider the top jet tagging problems and introduce an analysis model (AM) that analyzes selected HLFs designed to capture important features of top jets. Our AM mainly consists of the following three modules: a relation network analyzing two-point energy correlations, mathematical morphology and Minkowski functionals for generalizing jet constituent multiplicities, and a recursive neural network analyzing subjet constituent multiplicity to enhance sensitivity to subjet color charges. We demonstrate that our AM achieves performance comparable to the Particle Transformer (ParT) while requiring fewer computational resources in a comparison of top jet tagging using jets simulated at the hadronic calorimeter angular resolution scale. Furthermore, as a more constrained architecture than ParT, the AM exhibits smaller training uncertainties because of the bias-variance tradeoff. We also compare the information content of AM and ParT by decorrelating the features already learned by AM. Lastly, we briefly comment on the results of AM with finer angular resolution inputs.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗