Search NASA⌕ Search

SEARCH · Search NASA

Results for “compression algorithm”

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 415 records · Page 23

Lion Cub: Minimizing Communication Overhead in Distributed Lion

Communication overhead is a key challenge in distributed deep learning, especially on slower Ethernet intercon nects, and given current hardware trends, communication is likely to become a major bottleneck. While gradient compression techniques have been explored for SGD and Adam, the Lion optimizer has the distinct advantage that its update vectors are the output of a sign operation, enabling straightforward quantization. However, simply compressing updates for communication and using techniques like majority voting fails to lead to end-to-end speedups due to inefficient communication algorithms and reduced convergence. We analyze three factors critical to distributed learning with Lion: optimizing communication methods, identifying effective quantization methods, and assessing the necessity of momentum synchronization. Our findings show that quantization techniques adapted to Lion and selective momentum synchronization can significantly reduce communication costs while maintaining convergence. We combine these into Lion Cub, which enables up to 5x speedups in end-to-end training compared to Lion. This highlights Lion’s potential as a communication-efficient solution for distributed training.

97 MATHEMATICS AND COMPUTING↗

Application of gas-liquid fluid dynamics techniques to the modeling of sprays

The purpose of this paper is to provide an overview of modern computational techniques for gas-liquid systems as they are found in liquid fuel atomization applications. Fuel atomization – the generation of ligaments and droplets from the bulk of liquid injection – offers several modeling challenges: a localized surface tension force, depending on the accurate evaluation of interface curvature; drastic topology changes, which complicate interface advection and introduce local length scales; and separation of phases that have substantially different physical properties. The techniques presented in this review specifically target the gas-liquid interface and couple its evolution in time with the equations of multiphase fluid dynamics. Recent algorithmic advances in this area are discussed first, including new methods that improve conservation properties and deal with very large density ratios and compressibility effects. This part is followed by a discussion on the issue of convergence in simulations with topology changes (i.e., surface pinch-off) and on the viewpoint offered by atomistic and statistical modeling. State-of the-art simulations for various types of fuel injectors are presented next, with particular attention to numerical convergence and to the inclusion of realistic inlet boundary conditions. The review is concluded by the discussion of some of the challenges that still remains in this field.

42 ENGINEERING↗

Restricted Boltzmann Machines for galaxy morphology classification with a quantum annealer

We present the application of Restricted Boltzmann Machines (RBMs) to the task of astronomical image classification using a quantum annealer built by D-Wave Systems. Morphological analysis of galaxies provides critical information for studying their formation and evolution across cosmic time scales. We compress the images using principal component analysis to fit a representation on the quantum hardware. Then, we train RBMs with discriminative and generative algorithms, including contrastive divergence and hybrid generative-discriminative approaches. We compare these methods to Quantum Annealing (QA), Markov Chain Monte Carlo (MCMC) Gibbs Sampling, Simulated Annealing (SA) as well as machine learning algorithms like gradient boosted decision trees. We find that RBMs implemented on D-wave hardware perform well, and that they show some classification performance advantages on small datasets, but they don't offer a broadly strategic advantage for this task. During this exploration, we analyzed the steps required for Boltzmann sampling with the D-Wave 2000Q, including a study of temperature estimation, and examined the impact of qubit noise by comparing and contrasting the original D-Wave 2000Q to the lower-noise version recently made available. While these analyses ultimately had minimal impact on the performance of the RBMs, we include them for reference.

79 ASTRONOMY AND ASTROPHYSICS↗

Geometry-aware training of factorized layers in tensor Tucker format

Reducing parameter redundancies in neural network architectures is crucial for achieving feasible computational and memory requirements during train and inference of large networks. Given its easy implementation and flexibility, one promising approach is layer factorization, which reshapes weight tensors into a matrix format and parameterizes it as the product of two rank-r matrices. However, this family of approaches often requires an initial full-model warm-up phase, prior knowledge of a feasible rank, and it is sensitive to parameter initialization.In this work, we introduce a novel approach to train the factors of a Tucker decomposition of the weight tensors. Our training proposal proves to be optimal in locally approximating the original unfactorized dynamics and stable for the initialization. Furthermore, the rank of each mode is dynamically updated during training.We provide a theoretical analysis of the algorithm, showing convergence, approximation and local descent guarantees. The method's performance is further illustrated through a variety of experiments, showing remarkable training compression rates and comparable or even better performance than the full baseline and alternative layer factorization strategies.

Zangrando, Emanuele [Gran Sasso Science Institute ↗

A high-order WENO-limited finite-volume algorithm for atmospheric flow using the ADER-differential transform time discretization

A high-order-accurate weighted essentially non-oscillatory (WENO) limited upwind finite-volume scheme is detailed for the compressible, nonhydrostatic, inviscid Euler equations using an arbitrary derivatives (ADER) time-stepping scheme based on differential transforms (DTs). A second-order-accurate alternating Strang dimensional splitting is compared against multidimensional simulation with 2D transport using solid body rotation of various data. The two were found to give nearly identical accuracy in orthogonal, Cartesian coordinates. Orders of convergence are demonstrated at up to ninth-order accuracy with 2D transport. 1D transport is used to confirm that error decreases monotonically with increasing order of accuracy with WENO limiting even for discontinuous data. Further, WENO limiting always decreased the error compared with simulation without limiting in the L 1 norm. A series of standard 2D compressible nonhydrostatic Euler equation test cases were validated against previous results from literature. Finally, it was demonstrated that increasing the order of accuracy led to better resolved features and increased power for kinetic energy at small wavelengths.

54 ENVIRONMENTAL SCIENCES↗

A data-driven approach to sampling matrix selection for compressive sensing

Sampling is a fundamental aspect of any implementation of compressive sensing. Typically, the choice of sampling method is guided by the reconstruction basis. However, this approach can be problematic with respect to certain hardware constraints and is not responsive to domain-specific context. We propose a method for defining an order for a sampling basis that is optimal with respect to capturing variance in data, thus allowing for meaningful sensing at any desired level of compression. We focus on the Walsh-Hadamard sampling basis for its relevance to hardware constraints, but our approach applies to any sampling basis of interest. We illustrate the effectiveness of our method on the Physical Sciences Inc. Fabry-Perot interferometer sensor multispectral dataset, the Johns Hopkins Applied Physics Lab FTIR-based longwave infrared sensor hyperspectral dataset, and a Colorado State University Swiss Ranger depth image dataset. The spectral datasets consist of simulant experiments, including releases of chemicals such as GAA and SF6. We combine our sampling and reconstruction with the adaptive coherence estimator (ACE) and bulk coherence for chemical detection and we incorporate an algorithmic threshold for ACE values to determine the presence or absence of a chemical. We compare results across sampling methods in this context. We have successful chemical detection at a compression rate of 90%. For all three datasets, we compare our sampling approach to standard orderings of sampling basis such as random, sequency, and an analog of sequency that we term `frequency.' In one instance, the peak signal to noise ratio was improved by over 30% across a test set of depth images.

compressive sensing, hyperspectral imaging, Walsh-↗

Ensemble-Based Support Vector Regression with Gravitational Search Algorithm Optimization for Estimating Magnetic Relative Cooling Power of Manganite Refrigerant in Magnetic Refrigeration Application

Magnetic refrigeration technology (MRT) is considered an energy-efficient and environmental-friendly system of refrigeration that has a considerable potential of replacing the classical gas-compression expansion method of refrigeration. Inclusion of manganite-based material (MBM) in MRT as a magnetic refrigerant has attracted significant attention recently due to cost effectiveness of the refrigerant as well as better resistance to oxidation and corrosion as compared to the commonly used metal gadolinium refrigerant. Relative cooling power (RCP) is one of the most important parameters to be considered while assessing the usefulness of MBM. Its value can be altered through doping with external materials and accurate estimation of the dopant influence is required to achieve the right amount of RCP. This present research work proposes support vector regression (SVR) ensemble models with gravitational search algorithm (GSA) hyper-parameters optimization, for estimating RCP of MBM and to determine the influence of dopants on RCP using ionic radii and dopant concentrations as descriptors. GSA-SVR ensemble model (GSE) is developed by employing the outputs of five different SVR models as descriptors while GSA-SVR ensemble model with averaging (GSEA) uses the average of the five different SVR models as its descriptor. The novel ensemble models outperform other SVR models, specifically; GSE performs better than GSA-SVR model and the conventional SVR model with performance improvement of 269.14% and 283.61%, respectively on the basis of root mean square error (RMSE). Furthermore, GSEA outperforms GSE, GSA-SVR model and conventional SVR with performance improvement of 27.51%, 370.70%, and 389.14%, respectively on the basis of RMSE. The developed GSE and GSEA also perform better than the existing RCP model in the literature with performance improvement of 11.53% and 42.21%, respectively. The results of this research work will not only serve to circumvent the experimental challenges of RCP measurement without loss of experimental precision but also further promotes environment-friendly system of refrigeration.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

TU-H-206-01: An Automated Approach for Identifying Geometric Distortions in Gamma Cameras

Purpose: To develop a clinically-deployable, automated process for detecting artifacts in routine nuclear medicine (NM) quality assurance (QA) bar phantom images. Methods: An artifact detection algorithm was created to analyze bar phantom images as part of an ongoing QA program. A low noise, high resolution reference image was acquired from an x-ray of the bar phantom with a Philips Digital Diagnost system utilizing image stitching. NM bar images, acquired for 5 million counts over a 512×512 matrix, were registered to the template image by maximizing mutual information (MI). The MI index was used as an initial test for artifacts; low values indicate an overall presence of distortions regardless of their spatial location. Images with low MI scores were further analyzed for bar linearity, periodicity, alignment, and compression to locate differences with respect to the template. Findings from each test were spatially correlated and locations failing multiple tests were flagged as potential artifacts requiring additional visual analysis. The algorithm was initially deployed for GE Discovery 670 and Infinia Hawkeye gamma cameras. Results: The algorithm successfully identified clinically relevant artifacts from both systems previously unnoticed by technologists performing the QA. Average MI indices for artifact-free images are 0.55. Images with MI indices < 0.50 have shown 100% sensitivity and specificity for artifact detection when compared with a thorough visual analysis. Correlation of geometric tests confirms the ability to spatially locate the most likely image regions containing an artifact regardless of initial phantom orientation. Conclusion: The algorithm shows the potential to detect gamma camera artifacts that may be missed by routine technologist inspections. Detection and subsequent correction of artifacts ensures maximum image quality and may help to identify failing hardware before it impacts clinical workflow. Going forward, the algorithm is being deployed to monitor data from all gamma cameras within our health system.

60 APPLIED LIFE SCIENCES↗

Approximate Bayesian computation for forward modeling in cosmology

Bayesian inference is often used in cosmology and astrophysics to derive constraints on model parameters from observations. This approach relies on the ability to compute the likelihood of the data given a choice of model parameters. In many practical situations, the likelihood function may however be unavailable or intractable due to non-gaussian errors, non-linear measurements processes, or complex data formats such as catalogs and maps. In these cases, the simulation of mock data sets can often be made through forward modeling. We discuss how Approximate Bayesian Computation (ABC) can be used in these cases to derive an approximation to the posterior constraints using simulated data sets. This technique relies on the sampling of the parameter set, a distance metric to quantify the difference between the observation and the simulations and summary statistics to compress the information in the data. We first review the principles of ABC and discuss its implementation using a Population Monte-Carlo (PMC) algorithm and the Mahalanobis distance metric. We test the performance of the implementation using a Gaussian toy model. We then apply the ABC technique to the practical case of the calibration of image simulations for wide field cosmological surveys. We find that the ABC analysis is able to provide reliable parameter constraints for this problem and is therefore a promising technique for other applications in cosmology and astrophysics. Our implementation of the ABC PMC method is made available via a public code release.

79 ASTRONOMY AND ASTROPHYSICS↗

Development of in-use engine speed/torque heat maps across multiple heavy-duty commercial vehicle vocations

The U.S. Department of Energy (DOE) established the SuperTruck program with the goal of achieving brake thermal efficiency (BTE) greater than or equal to 55% as demonstrated in an operational heavy-duty (HD) diesel engine at a 65-miles-per-hour (mph) cruise point. Beyond the line-haul application, HD engines operate in a wide range of speed and torque conditions that are unlikely to yield the same efficiency under real-world operation. Thereby, the in-use engine heat maps described in this paper are a valuable tool to illustrate whether the engine-efficiency “sweet spot” matches the most frequent operating conditions. In this study, NREL developed engine heat maps to quantify the important operating points for various vocations using our Fleet DNA database of commercial fleet vehicle operations data. These heat maps clearly show that high-frequency operating points vary significantly according to vehicle vocation, while only a few of them match the sweet spot. Beyond the illustration, engine in-use heat maps can also be leveraged to build up reduced-order engine-efficiency models, needed by many rapid powertrain simulations. As case studies, nine reduced-order models – including line-haul truck, transfer truck, transit bus, transit bus with compressed natural gas (CNG) engine, drayage, refuse pickup, local delivery, utility truck, and school bus with CNG engine – using a trust-region reflective algorithm to fit the on-road data extracted based on the engine in-use heat maps.

33 ADVANCED PROPULSION SYSTEMS↗

OpenACC acceleration of an unstructured CFD solver based on a reconstructed discontinuous Galerkin method for compressible flows

Here, an OpenACC directive-based graphics processing unit (GPU) parallel scheme is presented for solving the compressible Navier–Stokes equations on 3D hybrid unstructured grids with a third-order reconstructed discontinuous Galerkin method. The developed scheme requires the minimum code intrusion and algorithm alteration for upgrading a legacy solver with the GPU computing capability at very little extra effort in programming, which leads to a unified and portable code development strategy. A face coloring algorithm is adopted to eliminate the memory contention because of the threading of internal and boundary face integrals. A number of flow problems are presented to verify the implementation of the developed scheme. Timing measurements were obtained by running the resulting GPU code on one Nvidia Tesla K20c GPU card (Nvidia Corporation, Santa Clara, CA, USA) and compared with those obtained by running the equivalent Message Passing Interface (MPI) parallel CPU code on a compute node (consisting of two AMD Opteron 6128 eight-core CPUs (Advanced Micro Devices, Inc., Sunnyvale, CA, USA)). Speedup factors of up to 24× and 1.6× for the GPU code were achieved with respect to one and 16 CPU cores, respectively. The numerical results indicate that this OpenACC-based parallel scheme is an effective and extensible approach to port unstructured high-order CFD solvers to GPU computing.

97 MATHEMATICS AND COMPUTING↗

A Pilot Evaluation of a 4-Dimensional Cone-Beam Computed Tomographic Scheme Based on Simultaneous Motion Estimation and Image Reconstruction

Purpose: To evaluate the performance of a 4-dimensional (4-D) cone-beam computed tomographic (CBCT) reconstruction scheme based on simultaneous motion estimation and image reconstruction (SMEIR) through patient studies. Methods and Materials: The SMEIR algorithm contains 2 alternating steps: (1) motion-compensated CBCT reconstruction using projections from all phases to reconstruct a reference phase 4D-CBCT by explicitly considering the motion models between each different phase and (2) estimation of motion models directly from projections by matching the measured projections to the forward projection of the deformed reference phase 4D-CBCT. Four lung cancer patients were scanned for 4 to 6 minutes to obtain approximately 2000 projections for each patient. To evaluate the performance of the SMEIR algorithm on a conventional 1-minute CBCT scan, the number of projections at each phase was reduced by a factor of 5, 8, or 10 for each patient. Then, 4D-CBCTs were reconstructed from the down-sampled projections using Feldkamp-Davis-Kress, total variation (TV) minimization, prior image constrained compressive sensing (PICCS), and SMEIR. Using the 4D-CBCT reconstructed from the fully sampled projections as a reference, the relative error (RE) of reconstructed images, root mean square error (RMSE), and maximum error (MaxE) of estimated tumor positions were analyzed to quantify the performance of the SMEIR algorithm. Results: The SMEIR algorithm can achieve results consistent with the reference 4D-CBCT reconstructed with many more projections per phase. With an average of 30 to 40 projections per phase, the MaxE in tumor position detection is less than 1 mm in SMEIR for all 4 patients. Conclusion: The results from a limited number of patients show that SMEIR is a promising tool for high-quality 4D-CBCT reconstruction and tumor motion modeling.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Fast Parallel Tensor Times Same Vector for Hypergraphs

Hypergraphs are a popular paradigm to rep- resent complex real-world networks exhibiting multi-way relationships of varying sizes. Mining centrality in hyper- graphs via symmetric adjacency tensors has only recently become computationally feasible for large and complex datasets. To enable scalable computation of these and related hypergraph analytics, here we focus on the Sparse Symmetric Tensor Times Same Vector (S3TTVC) oper- ation. We introduce the Compound Compressed Sparse Symmetric (CCSS) format, an extension of the compact CSS format for hypergraphs of varying hyperedge sizes and present a shared-memory parallel algorithm to compute S3TTVC. We experimentally show S3TTVC computation using the CCSS format achieves better performance than the naive baseline, and is subsequently more performant for hypergraph H-eigenvector centrality.

Shivakumar, Shruti↗

Cortexsys v. 3.0

This code implements a variety of "deep learning" algorithms from openly published academic journals. These deep learning algorithms allow the user to train neural networks to do various tasks. Such tasks include predicting future values in a time sequence, categorizing images or compressing information. The code is mostly written in the easy to understand Matlab / GNU Octave language, which enables rapid prototyping and understanding for research and educational purposes.

Cox, JonathanA.↗

Designing Experiments Through Compressed Sensing

In the following paper, we discuss how to design an ensemble of experiments through the use of compressed sensing. Specifically, we show how to conduct a small number of physical experiments and then use compressed sensing to reconstruct a larger set of data. In order to accomplish this, we organize our results into four sections. We begin by extending the theory of compressed sensing to a finite product of Hilbert spaces. Then, we show how these results apply to experiment design. Next, we develop an efficient reconstruction algorithm that allows us to reconstruct experimental data projected onto a finite element basis. Finally, we verify our approach with two computational experiments.

Young, Joseph G.↗

Cortexsys v. 3.0

This code implements a variety of "deep learning" algorithms from openly published academic journals. These deep learning algorithms allow the user to train neural networks to do various tasks. Such tasks include predicting future values in a time sequence, categorizing images or compressing information. The code is mostly written in the easy to understand Matlab / GNU Octave language, which enables rapid prototyping and understanding for research and educational purposes.

Cox, Jonathan A.↗

The compressed state Kalman filter for nonlinear state estimation: Application to large-scale reservoir monitoring

Reservoir monitoring aims to provide snapshots of reservoir conditions and their uncertainties to assist operation management and risk analysis. These snapshots may contain millions of state variables, e.g., pressures and saturations, which can be estimated by assimilating data in real time using the Kalman filter (KF). However, the KF has a computational cost that scales quadratically with the number of unknowns, m, due to the cost of computing and storing the covariance and Jacobian matrices, along with their prod-ucts. The compressed state Kalman filter (CSKF) adapts the KF for solving large-scale monitoring problems. The CSKF uses N preselected orthogonal bases to compute an accurate rank-N approximation of the covari-ance that is close to the optimal spectral approximation given by SVD. The CSKF has a computational cost that scales linearly in m and uses an efficient matrix-free approach that propagates uncertainties using N + 1 forward model evaluations, where N << m. Here in this paper we present a generalized CSKF algorithm for nonlin-ear state estimation problems such as CO 2 monitoring. For simultaneous estimation of multiple types of state variables, the algorithm allows selecting bases that represent the variability of each state type. Through synthetic numerical experiments of CO 2 monitoring, we show that the CSKF can reproduce the Kal-man gain accurately even for large compression ratios (m/N). For a given computational cost, the CSKF uses a robust and flexible compression scheme that gives more reliable uncertainty estimates than the ensemble Kalman filter, which may display loss of ensemble variability leading to suboptimal uncertainty estimates.

97 MATHEMATICS AND COMPUTING↗

On the Need for Comprehensive Validation of Deformable Image Registration, Investigated With a Novel 3-Dimensional Deformable Dosimeter

Purpose: To introduce and evaluate a novel deformable 3-dimensional (3D) dosimetry system (Presage-Def/Optical-CT) and its application toward investigating the accuracy of dose deformation in a commercial deformable image registration (DIR) package. Methods and Materials: Presage-Def is a new dosimetry material consisting of an elastic polyurethane matrix doped with radiochromic leuco dye. Radiologic and mechanical properties were characterized using standard techniques. Dose-tracking feasibility was evaluated by comparing dose distributions between dosimeters irradiated with and without 27% lateral compression. A checkerboard plan of 5-mm square fields enabled precise measurement of true deformation using 3D dosimetry. Predicted deformation was determined from a commercial DIR algorithm. Results: Presage-Def exhibited a linear dose response with sensitivity of 0.0032 ΔOD/(Gy∙cm). Mass density is 1.02 g/cm{sup 3}, and effective atomic number is within 1.5% of water over a broad (0.03-10 MeV) energy range, indicating good water-equivalence. Elastic characteristics were close to that of liver tissue, with Young's modulus of 13.5-887 kPa over a stress range of 0.233-303 kPa, and Poisson's ratio of 0.475 (SE, 0.036). The Presage-Def/Optical-CT system successfully imaged the nondeformed and deformed dose distributions, with isotropic resolution of 1 mm. Comparison with the predicted deformed 3D dose distribution identified inaccuracies in the commercial DIR algorithm. Although external contours were accurately deformed (submillimeter accuracy), volumetric dose deformation was poor. Checkerboard field positioning and dimension errors of up to 9 and 14 mm, respectively, were identified, and the 3D DIR-deformed dose γ passing rate was only γ{sub 3%/3} {sub mm} = 60.0%. Conclusions: The Presage-Def/Optical-CT system shows strong potential for comprehensive investigation of DIR algorithm accuracy. Substantial errors in a commercial DIR were found in the conditions evaluated. This work highlights the critical importance of careful validation of DIR algorithms before clinical implementation.

62 RADIOLOGY AND NUCLEAR MEDICINE↗