Search NASA⌕ Search

SEARCH · Search NASA

Results for “linear kernel”

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 19 records

FPGA Coprocessor for Accelerated Classification of Images

An effort related to that described in the preceding article focuses on developing a spaceborne processing platform for fast and accurate onboard classification of image data, a critical part of modern satellite image processing. The approach again has been to exploit the versatility of recently developed hybrid Virtex-4FX field-programmable gate array (FPGA) to run diverse science applications on embedded processors while taking advantage of the reconfigurable hardware resources of the FPGAs. In this case, the FPGA serves as a coprocessor that implements legacy C-language support-vector-machine (SVM) image-classification algorithms to detect and identify natural phenomena such as flooding, volcanic eruptions, and sea-ice break-up. The FPGA provides hardware acceleration for increased onboard processing capability than previously demonstrated in software. The original C-language program demonstrated on an imaging instrument aboard the Earth Observing-1 (EO-1) satellite implements a linear-kernel SVM algorithm for classifying parts of the images as snow, water, ice, land, or cloud or unclassified. Current onboard processors, such as on EO-1, have limited computing power, extremely limited active storage capability and are no longer considered state-of-the-art. Using commercially available software that translates C-language programs into hardware description language (HDL) files, the legacy C-language program, and two newly formulated programs for a more capable expanded-linear-kernel and a more accurate polynomial-kernel SVM algorithm, have been implemented in the Virtex-4FX FPGA. In tests, the FPGA implementations have exhibited significant speedups over conventional software implementations running on general-purpose hardware.

Pingree, Paula J.↗

Spectral Kernel Approach to Study Radiative Response of Climate Variables and Interannual Variability of Reflected Solar Spectrum

The radiative kernel approach provides a simple way to separate the radiative response to different climate parameters and to decompose the feedback into radiative and climate response components. Using CERES/MODIS/Geostationary data, we calculated and analyzed the solar spectral reflectance kernels for various climate parameters on zonal, regional, and global spatial scales. The kernel linearity is tested. Errors in the kernel due to nonlinearity can vary strongly depending on climate parameter, wavelength, surface, and solar elevation; they are large in some absorption bands for some parameters but are negligible in most conditions. The spectral kernels are used to calculate the radiative responses to different climate parameter changes in different latitudes. The results show that the radiative response in high latitudes is sensitive to the coverage of snow and sea ice. The radiative response in low latitudes is contributed mainly by cloud property changes, especially cloud fraction and optical depth. The large cloud height effect is confined to absorption bands, while the cloud particle size effect is found mainly in the near infrared. The kernel approach, which is based on calculations using CERES retrievals, is then tested by direct comparison with spectral measurements from Scanning Imaging Absorption Spectrometer for Atmospheric Cartography (SCIAMACHY) (a different instrument on a different spacecraft). The monthly mean interannual variability of spectral reflectance based on the kernel technique is consistent with satellite observations over the ocean, but not over land, where both model and data have large uncertainty. RMS errors in kernel ]derived monthly global mean reflectance over the ocean compared to observations are about 0.001, and the sampling error is likely a major component.

Jin, Zhonghai↗

A methodology for using nonlinear aerodynamics in aeroservoelastic analysis and design

A methodology is presented for using the Volterra-Wiener theory of nonlinear systems in aeroservoelastic (ASE) analyses and design. The theory is applied to the development of nonlinear aerodynamic response models that can be defined in state-space form and are, therefore, appropriate for use in modern control theory. The theory relies on the identification of nonlinear kernels that can be used to predict the response of a nonlinear system due to an arbitrary input. A numerical kernel identification technique, based on unit impulse responses, is presented and applied to a simple bilinear, single-input-single-output system. The linear kernel (unit impulse response) and the nonlinear second-order kernel of the system are numerically-identified and compared with the exact, analytically-defined linear and second-order kernels. This kernel identification technique is then applied to the CAP-TSD code for identification of the linear and second-order kernels of a NACA64A010 rectangular wing undergoing pitch at M = 0.5, M = 0.85 (transonic), and M = 0.93 (transonic). Results presented demonstrate the feasibility of this approach for use with nonlinear, unsteady aerodynamic responses.

Silva, Walter A.↗

A methodology for using nonlinear aerodynamics in aeroservoelastic analysis and design

A methodology is presented for using the Volterra-Wiener theory of nonlinear systems in aeroservoelastic (ASE) analyses and design. The theory is applied to the development of nonlinear aerodynamic response models that can be defined in state-space form and are, therefore, appropriate for use in modern control theory. The theory relies on the identification of nonlinear kernels that can be used to predict the response of a nonlinear system due to an arbitrary input. A numerical kernel identification technique, based on unit impulse responses, is presented and applied to a simple bilinear, single-input single-output (SISO) system. The linear kernel (unit impulse response) and the nonlinear second-order kernel of the system are numerically-identified and compared with the exact, analytically-defined and linear and second-order kernels. This kernel identification technique is then applied to the CAP-TSD (Computational Aeroelasticity Program-Transonic Small Disturbance) code for identification of the linear and second-order kernels of a NACA64A010 rectangular wing undergoing pitch at M = 0.5, M = 8.5 (transonic), and M = 0.93 (transonic). Results presented demonstrate the feasibility of this approach for use with nonlinear, unsteady aerodynamic responses.

Silva, Walter A.↗

Land Surface Temperature Measurements from EOS MODIS Data

We made modifications to the linear kernel bidirectional reflectance distribution function (BRDF) models from Roujean et al. and Wanner et al. that extend the spectral range into the thermal infrared (TIR). With these TIR BRDF models and the IGBP land-cover product, we developed a classification-based emissivity database for the EOS/MODIS land-surface temperature (LST) algorithm and used it in version V2.0 of the MODIS LST code. Two V2.0 LST codes have been delivered to the MODIS SDST, one for the daily L2 and L3 LST products, and another for the 8-day 1km L3 LST product. New TIR thermometers (broadband radiometer with a filter in the 10-13 micron window) and an IR camera have been purchased in order to reduce the uncertainty in LST field measurements due to the temporal and spatial variations in LST. New improvements have been made to the existing TIR spectrometer in order to increase its accuracy to 0.2 C that will be required in the vicarious calibration of the MODIS TIR bands.

Wan, Zhengming↗

Sparse Regression as a Sparse Eigenvalue Problem

We extend the l0-norm "subspectral" algorithms for sparse-LDA [5] and sparse-PCA [6] to general quadratic costs such as MSE in linear (kernel) regression. The resulting "Sparse Least Squares" (SLS) problem is also NP-hard, by way of its equivalence to a rank-1 sparse eigenvalue problem (e.g., binary sparse-LDA [7]). Specifically, for a general quadratic cost we use a highly-efficient technique for direct eigenvalue computation using partitioned matrix inverses which leads to dramatic x103 speed-ups over standard eigenvalue decomposition. This increased efficiency mitigates the O(n4) scaling behaviour that up to now has limited the previous algorithms' utility for high-dimensional learning problems. Moreover, the new computation prioritizes the role of the less-myopic backward elimination stage which becomes more efficient than forward selection. Similarly, branch-and-bound search for Exact Sparse Least Squares (ESLS) also benefits from partitioned matrix inverse techniques. Our Greedy Sparse Least Squares (GSLS) generalizes Natarajan's algorithm [9] also known as Order-Recursive Matching Pursuit (ORMP). Specifically, the forward half of GSLS is exactly equivalent to ORMP but more efficient. By including the backward pass, which only doubles the computation, we can achieve lower MSE than ORMP. Experimental comparisons to the state-of-the-art LARS algorithm [3] show forward-GSLS is faster, more accurate and more flexible in terms of choice of regularization

Exact Sparse Least Squares (ESLS)↗

Improving the MODIS LAI Compositing Using Prior Time-Series Information

The Moderate Resolution Imaging Spectroradiometer (MODIS) long-term leaf area index (LAI) products have significantly contributed to global energy fluxes, climate change, and biogeochemistry research. However, the maximum fraction of photosynthetically active radiation absorbed by vegetation (Max-FPAR) compositing strategy of the Collection 6 (C6) products dictates that the main or backup algorithm is always triggered by observations of different quality, which indirectly causes the observed instability in the LAI time-series. Based on MODIS daily LAI retrievals, this study develops a prior knowledge time-series compositing algorithm (PKA) using a linear kernel driven (LKD) model. Our results show that the newly proposed PKA can significantly improve the LAI composites compared to the Max-FPAR strategy using ground-based observations for validation. We found that the PKA performs better than Max-FPAR in various aspects (different sites, seasons, and retrieval index (RI) ranges), with R2 increasing from 0.69 to 0.76 and root means square error (RMSE) decreasing from 1.01 to 0.84 compared to GBOV ground truth. The same improvement was shown for the ground truth LAIs measured at the Honghe and Hailun sites in northeastern China, with R2 increasing from 0.23 to 0.41 and RMSE decreasing from 1.27 to 1.25. In addition, three newly proposed temporal uncertainty metrics (time-series stability, TSS and time-series anomaly, TSA and reconstruction error metric, RE (the proximity to the main RT-based retrievals)) were applied to compare the stability of LAI time-series before and after PKA implementation. We found that the time series stability of PKA LAI was improved, the time series anomalies were reduced, and the retrieval rates of the main algorithm were also greatly enhanced compared to Max-FPAR LAI. A case intercomparison for Max-FPAR-MODIS, Max-FPAR-VIIRS (Visible Infrared Imager Radiometer Suite), and PKA-MODIS LAIs in the Amazon Forest region showed that the PKA is also effective in improving the LAI retrieval over large regions with few qualified observations due to poor atmospheric conditions (RE decreased from 2.37/2.35 (Max-FPAR-MODIS/Max-FPAR-VIIRS) to 2.25 (PKA-MODIS) and RI increased from 61.94%/59.62% to 66.88%). The same improvement was seen in the BELMANIP 2.1 sites for almost all biomes except deciduous broadleaf forest, where the RE decreased from 1.85/2.13 to 1.15 overall. We note that the PKA has the potential to be easily implemented in the operational algorithms of subsequent MODIS and MODIS-like LAI Collections.

MODIS↗

Kernel PLS-SVC for Linear and Nonlinear Discrimination

A new methodology for discrimination is proposed. This is based on kernel orthonormalized partial least squares (PLS) dimensionality reduction of the original data space followed by support vector machines for classification. Close connection of orthonormalized PLS and Fisher's approach to linear discrimination or equivalently with canonical correlation analysis is described. This gives preference to use orthonormalized PLS over principal component analysis. Good behavior of the proposed method is demonstrated on 13 different benchmark data sets and on the real world problem of the classification finger movement periods versus non-movement periods based on electroencephalogram.

Rosipal, Roman↗

The HadGEM3-GA7.1 radiative kernel: the importance of a well-resolved stratosphere

We present top-of-atmosphere and surface radiative kernels based on the atmospheric component (GA7.1) of the HadGEM3 general circulation model developed by the UK Met Office. We show that the utility of radiative kernels for forcing adjustments in idealised CO2 perturbation experiments is greatest where there is sufficiently high resolution in the stratosphere in both the target climate model and the radiative kernel. This is because stratospheric cooling to a CO2 perturbation continues to increase with height, and low-resolution or low-top kernels or climate model output are unable to fully resolve the full stratospheric temperature adjustment. In the sixth phase of the Coupled Model Intercomparison Project (CMIP6), standard atmospheric model data are available up to 1 hPa on 19 pressure levels, which is a substantial advantage compared to CMIP5. We show in the IPSL-CM6A-LR model where a full set of climate diagnostics are available that the HadGEM3-GA7.1 kernel exhibits linear behaviour and the residual error term is small, as well as from a survey of kernels available in the literature that in general low-top radiative kernels underestimate the stratospheric temperature response. The HadGEM3-GA7.1 radiative kernels are available at https://doi.org/10.5281/zenodo.3594673 (Smith, 2019).

radiative kernels↗

A Method for Improving Hotspot Directional Signatures in BRDF Models Used for MODIS

The semi-empirical, kernel-driven, linear RossThick-LiSparseReciprocal (RTLSR) Bidirectional Reflectance Distribution Function (BRDF) model is used to generate the routine MODIS BRDFAlbedo product due to its global applicability and the underlying physics. A challenge of this model in regard to surface reflectance anisotropy effects comes from its underestimation of the directional reflectance signatures near the Sun illumination direction; also known as the hotspot effect. In this study, a method has been developed for improving the ability of the RTLSR model to simulate the magnitude and width of the hotspot effect. The method corrects the volumetric scattering component of the RTLSR model using an exponential approximation of a physical hotspot kernel, which recreates the hotspot magnitude and width using two free parameters (C(sub 1) and C(sub 2), respectively). The approach allows one to reconstruct, with reasonable accuracy, the hotspot effect by adjusting or using the prior values of these two hotspot variables. Our results demonstrate that: (1) significant improvements in capturing hotspot effect can be made to this method by using the inverted hotspot parameters; (2) the reciprocal nature allow this method to be more adaptive for simulating the hotspot height and width with high accuracy, especially in cases where hotspot signatures are available; and (3) while the new approach is consistent with the heritage RTLSR model inversion used to estimate intrinsic narrowband and broadband albedos, it presents some differences for vegetation clumping index (CI) retrievals. With the hotspot-related model parameters determined a priori, this method offers improved performance for various ecological remote sensing applications; including the estimation of canopy structure parameters.

airborne measurements↗

Domain decomposition methods in aerodynamics

Compressible Euler equations are solved for two-dimensional problems by a preconditioned conjugate gradient-like technique. An approximate Riemann solver is used to compute the numerical fluxes to second order accuracy in space. Two ways to achieve parallelism are tested, one which makes use of parallelism inherent in triangular solves and the other which employs domain decomposition techniques. The vectorization/parallelism in triangular solves is realized by the use of a recording technique called wavefront ordering. This process involves the interpretation of the triangular matrix as a directed graph and the analysis of the data dependencies. It is noted that the factorization can also be done in parallel with the wave front ordering. The performances of two ways of partitioning the domain, strips and slabs, are compared. Results on Cray YMP are reported for an inviscid transonic test case. The performances of linear algebra kernels are also reported.

Venkatakrishnan, V.↗

Performance and Portability of a Linear Solver Across Emerging Architectures

A linear solver algorithm used by a large-scale unstructured-grid computational fluid dynamics application is examined for a broad range of familiar and emerging architectures. Efficient implementation of a linear solver is challenging on recent CPUs offering vector architectures. Vector loads and stores are essential to effectively utilize available memory bandwidth on CPUs, and maintaining performance across different CPUs can be difficult in the face of varying vector lengths offered by each. A similar challenge occurs on GPU architectures, where it is essential to have coalesced memory accesses to utilize memory bandwidth effectively. In this work, we demonstrate that restructuring a computation, and possibly data layout, with regard to architecture is essential to achieve optimal performance by establishing a performance benchmark for each target architecture in a low level language such as vector intrinsics or CUDA. In doing so, we demonstrate how a linear solver kernel can be mapped to Intel® Xeon™ and Xeon Phi™, Marvell® ThunderX2®, NEC® SX-Aurora™ TSUBASA Vector Engine, and NVIDIA® and AMD® GPUs. We further demonstrate that the required code restructuring can be achieved in higher level programming environments such as OpenACC, OCCA, and Intel® OneAPI™/SYCL, and that each generally results in optimal performance on the target architecture. Relative performance metrics for all implementations are shown, and subjective ratings for ease of implementation and optimization are suggested.

Programming models↗

Memory Optimizations for Sparse Linear Algebra on GPU Hardware

An effort to maximize memory bandwidth utilization for a sparse linear algebra kernel executing on NVIDIA® Tesla V100 and A100 Graphics Processing Units (GPUs) is described. The kernel consists of a block-sparse matrix-vector product and a series of forward/backward triangular solves. The computation is memory-bound and exhibits low arithmetic intensity. Along with a relatively small block size, the data layout poses a challenge to effectively utilize the available memory bandwidth on common GPU architectures. An earlier implementation using a warp to process a single row of the matrix was found to yield good memory performance on the V100 architecture. However, anew approach, which assigns a warp to six rows of the matrix, is proposed for the A100. In addition, two new features offered by the A100 architecture are explored.L2residency control enables a portion of theL2cache to be used for persistent data access, and the asynchronous copy instruction allows data to be loaded directly from main memory into shared memory. Demonstrations show that the new implementation improves memory bandwidth utilization from 71.5% to 81.2% of the peak available on theA100 architecture.

GPU↗

Hyperspectral Sounder Spectral Fingerprinting: Using Machine Learning Techniques to Enhance Model-Based Physical Inversion

Different retrieval algorithms have been developed to process top-of-atmosphere (TOA) spectral radiance data provided by hyperspectral infrared sounder missions. Those algorithms are either optimal estimation method (OEM) based schemes with radiative transfer calculation involved in the retrieval process, or machine learning based methods that allow ultra-efficient data procession but lack of radiometric consistency validation based on the directly measured information. Combining both approaches leverages their respective technical advantages, leading to more accurate results. This study introduces a hyperspectral sounder fingerprinting algorithm to explore this hybrid approach. This approach involves the use of a spectral information-based classification method to identify an reference geophysical state and the corresponding radiative kernel. This enables the efficient retrieval of geophysical variables of interest through a radiative kernel-based linear inversion procedure. The fingerprinting method has been applied to analyze a decade-long hyperspectral sounder data record.

Wan Wu↗

Unsteady Subsonic Loadings Due to Control-Surface Motion

RHOIV computer program predicts unsteady lifting-surface loadings caused by motions of leading edge and trailing-edge control surfaces having sealed gaps at hinge lines and side edges. Analysis is based on linear, subsonic, potential-flow theory using kernel function method. Linear combinations of pressure distributions are used that are continuous except at planform edges and hinge lines. Loading solution is obtained by downwash collocation for deflection or motion of main wing and control surfaces.

Rowe, W. S.↗