Search NASA⌕ Search

SEARCH · Search NASA

Results for “dimensionality reduction”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS1984

LANDSAT-D Thematic Mapper image dimensionality reduction and geometric correction accuracy

Principal components transformations was applied to a Walnut Creek, Texas subscene to reduce the dimensionality of the multispectral sensor data. This transformation was also applied to a LANDSAT 3 MSS subscene of the same area acquired in a different season and year. Results of both procedures are tabulated and allow for comparisons between TM and MSS data. The TM correlation matrix shows that visible bands 1 to 3 exhibit a high degree of correlation in the range 0.92 to 0.96. Correlation for bands 5 to 7 is 0.93. Band 4 is not highly correlated with any other band, with corrections in the range 0.13 to 0.52. The thermal band (6) is not highly correlated with other bands in the range 0.13 to 0.46. The MSS correlation matrix shows that bands 4 and 5 are highly correlated (0.96) as are bands 6 and 7 with a correlation of 0.92.

Ford, G. E.↗
NASA NTRS1999

Dimensionality Reduction Through Classifier Ensembles

In data mining, one often needs to analyze datasets with a very large number of attributes. Performing machine learning directly on such data sets is often impractical because of extensive run times, excessive complexity of the fitted model (often leading to overfitting), and the well-known "curse of dimensionality." In practice, to avoid such problems, feature selection and/or extraction are often used to reduce data dimensionality prior to the learning step. However, existing feature selection/extraction algorithms either evaluate features by their effectiveness across the entire data set or simply disregard class information altogether (e.g., principal component analysis). Furthermore, feature extraction algorithms such as principal components analysis create new features that are often meaningless to human users. In this article, we present input decimation, a method that provides "feature subsets" that are selected for their ability to discriminate among the classes. These features are subsequently used in ensembles of classifiers, yielding results superior to single classifiers, ensembles that use the full set of features, and ensembles based on principal component analysis on both real and synthetic datasets.

Oza, Nikunj C.↗
DOE OSTI2026

Dimensional Reduction for Sampled Priors and Application to Photometric Redshift Distributions

A typical Bayesian inference on the values of some parameters of interest q from some data D involves running a Markov Chain (MC) to sample from the posterior $p$($q$,$n$|$D$) $\propto$ $\mathcal{L}$($D$|$q$,$n$)$p$(q)$p$($n$), where n are some nuisance parameters with a separable prior. In some cases, the nuisance parameters are high-dimensional, and their prior p(n) is itself defined only by a set of samples that have been drawn from some other MC. The MC for the posterior will typically require evaluation of p(n) at arbitrary values of n, i.e., one needs to provide a density estimator over the full n space from the provided samples. But the high dimensionality of n hinders both the density estimation and the efficiency of the MC for the posterior. We describe a solution to this problem: a linear compression of the n space into a much lower-dimensional space u, which projects away directions in n space that cannot appreciably alter $\mathcal{L}$. The algorithm for doing so is a slight modification to principal components analysis, and is less restrictive on p(n) than other proposed solutions to this issue. We demonstrate this “mode projection” technique using the analysis of 2-point correlation functions of weak lensing fields and galaxy density in the Dark Energy Survey, where n is a binned representation of the redshift distribution n(z) of the galaxies.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS2010

Analytical Dimensional Reduction of a Fuel Optimal Powered Descent Subproblem

Current renewed interest in exploration of the moon, Mars, and other planetary objects is driving technology development in many fields of space system design. In particular, there is a desire to land both robotic and human missions on the moon and elsewhere. The landing guidance system must be able to deliver the vehicle to a desired soft landing while meeting several constraints necessary for the safety of the vehicle. Due to performance limitations of current launch vehicles, it is desired to minimize the amount of fuel used. In addition, the landing site may change in real-time in order to avoid previously undetected hazards which become apparent during the landing maneuver. This complicated maneuver can be broken into simpler subproblems that bound the full problem. One such subproblem is to find a minimum-fuel landing solution that meets constraints on the initial state, final state, and bounded thrust acceleration magnitude. With the assumptions of constant gravity and negligible atmosphere, the form of the optimal steering law is known, and the equations of motion can be integrated analytically, resulting in a system of five equations in five unknowns. It is shown that this system of equations can be reduced analytically to two equations in two unknowns. With an additional assumption of constant thrust acceleration magnitude, this system can be reduced further to one equation in one unknown. It is shown that these unknowns can be bounded analytically. An algorithm is developed to quickly and reliably solve the resulting one-dimensional bounded search, and it is used as a real-time guidance applied to a lunar landing test case.

Rea, Jeremy R.↗
DOE OSTI2025

Online learning of quadratic manifolds from streaming data for nonlinear dimensionality reduction and nonlinear model reduction

Here, this work introduces an online greedy method for constructing quadratic manifolds from streaming data, designed to enable in situ analysis of numerical simulation data on the Petabyte scale. Unlike traditional batch methods, which require all data to be available upfront and take multiple passes over the data, the proposed online greedy method incrementally updates quadratic manifolds in one pass as data points are received, eliminating the need for expensive disk input/output operations as well as storing and loading data points once they have been processed. A range of numerical examples demonstrate that the online greedy method learns accurate quadratic manifold embeddings while being capable of processing data that far exceed common disk input/output capabilities and volumes as well as main-memory sizes.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1983

LANDSAT-D thematic mapper image dimensionality reduction and geometric correction accuracy

When principal component analysis of a subscene of a section of the Sacramento River showed lower correlation among the TM spectral components that were observed for the MSS spectral components, principal component analysis was applied to a LANDSAT 2 MSS subscene of the same area for comparison purposes. Correlation coefficient matrices indicate the pairwise similarity and correlation of the data for the spectral components. The principal components transformation matrix, indicates the weights applied to the original components to generate the transformed components. The first two TM components can be described as visible and near infrared. For the MSS data, the first transformed component is roughly the average of the four original components. The second transformed component is roughly the difference between the visible and infrared components. Tables show that 97.0% of the variance in an MSS image is contained in only two transformed components.

Ford, G. E.↗
NASA NTRSDate not supplied

Evaluation of Near Singular Integrals for Computational Electromagnetics by Dimensionality Reduction

With the need for ever faster codes, a limiting factor that must be dealt with is the accurate yet efficient evaluation of interaction integrals between the more problematic near-field elements. Several recent works have together shown that all evaluations of source potential integrals and their derivatives for the most common bases and elements can be reduced to the evaluation of boundary line integrals; these can be evaluated by Gauss-Legendre quadrature, though integrand-smoothing transforms are often needed to accelerate their computation. In this paper, we modify the reported approach to eliminate cancellation errors in the line integral integrand, reinterpret the integral as a vertex function, and study the scalar potential integral form under the sinh transform and static subtraction acceleration methods.

D R Wilton↗
DOE OSTI2026

Hierarchical Gaussian Random Field Sampling for Multilevel Markov Chain Monte Carlo: Coupling Stochastic Partial Differential Equation and the Karhunen–Loève Decomposition

This work introduces structure preserving hierarchical decompositions for sampling Gaussian random fields (GRFs) within the context of multilevel Bayesian inference in high-dimensional space. Existing scalable hierarchical sampling methods, such as those based on stochastic partial differential equations (SPDEs), often reduce the dimensionality of the sample space at the cost of accuracy of inference. Other approaches, such that those based on Karhunen-Loève (KL) expansions, offer sample space dimensionality reduction but sacrifice GRF representation accuracy and ergodicity of the Markov chain Monte Carlo (MCMC) sampler and are computationally expensive for high-dimensional problems. The proposed method integrates the dimensionality reduction capabilities of KL expansions with the scalability of SPDE-based sampling, thereby providing a robust, unified framework for high-dimensional uncertainty quantification (UQ) that is scalable and accurate, preserves ergodicity, and offers dimensionality reduction of the sample space. The hierarchy in our multilevel algorithm is derived from the geometric multigrid hierarchy. By constructing a hierarchical decomposition that maintains the covariance structure across the levels in the hierarchy, the approach enables efficient coarse-to-fine sampling while ensuring that all samples are drawn from the desired distribution. The effectiveness of the proposed method is demonstrated on a benchmark subsurface flow problem, demonstrating its effectiveness in improving computational efficiency and statistical accuracy. Furthermore, our proposed technique is more efficient and accurate and displays better convergence properties than existing methods for high-dimensional Bayesian inference problems.

Gaussian random fields↗
NASA NTRS1973

Multispectral combination and display of ERTS-1 data

A significant problem in the use of ERTS-1 data is the extraction of information pertinent to each application and the presentation of that information in a form most suitable to users. When the information is to be displayed for visual study by an observer, the problem can be reduced to two steps: (1) Dimensionality reduction, an objective procedure which attempts to preserve most of the ERTS-1 information in a smaller number of components. (2) Display of the reduced number of components for optimum visibility by an observer. A specific dimensionality reduction technique has been applied to ERTS-1 data for several geographical areas in California and distinct types of earth resources. In the display of the reduced number of components, consideration has to be given to properties of the human visual system and the statistics of the data to be displayed. Previous work on digital image enhancement was applied to this problem to generate color composites which contain and display most of the information provided by the ERTS-1 sensors. Results of this approach were interesting, both in terms of the small mean-square caused by the dimensionality reduction, as well as for the examples of enhanced images that have been obtained.

Algazi, V. R.↗
NASA NTRSDate not supplied

Reduced Dimensionality Analysis of TEMPO Ozone Profile Retrievals Using the Compact Phase Space (CPSR) Algorithm

TEMPO ozone (O 3 ) profile retrievals are expected to have fidelity in the troposphere due the sensitivities of the associated averaging kernels. However, those averaging kernels are severely rank deficiency meaning that a visual inspection of the vertical structure of the averaging kernel profile sensitivities is misleading due linear dependencies in the profile. The Compact Phase Space Retrieval (CPSR) algorithm use singular value decompositions of the averaging kernels and the ‘compressed’ retrieval solution error covariance to project the transformed averaging kernels into a space that removes the linear dependencies and accounts for the solution error uncertainties. In this oral presentation and poster, we apply the CPSR dimensional reduction analysis to TEMPO and TROPOMI O 3 profile retrievals for 13:45 UTC March 29, 2024 to study the phase space characteristics of the transformed averaging kernels as a function of latitude for North America. Our results show that TEMPO generally has more phase space vertical structure in the troposphere than TROPOMI. TEMPO has four to five dominant modes, and TROPOMI has five to six dominant modes. That means that dimensional reduction can reduce the TEMPO resource requirements by ~77% and the TROPOMI requirements by ~81%. Finally, we found that after removing linear dependences and after accounting for solution uncertainties TEMPO still has sensitivities throughout the troposphere.

TEMPO↗
DOE OSTI2025

Randomized Algorithms for Low-Rank Matrix and Tensor Decompositions

This paper surveys randomized algorithms in numerical linear algebra for low-rank decompositions of matrices and tensors. The survey begins with a review of classical matrix algorithms that can be accelerated by randomized dimensionality reduction, such as the singular value decomposition (SVD) or interpolative (ID) and CUR decompositions. Recent advances in randomized dimensionality reduction are discussed, including new methods of fast matrix sketching and sampling techniques, which are incorporated into classical matrix algorithms for fast low-rank matrix approximations. The extension of randomized matrix algorithms to tensors is then explored for several low-rank tensor decompositions in the CP and Tucker formats, including the higher-order SVD, ID, and CUR decomposition.

Pearce, Katherine J. [The University of Texas at A↗