Search NASA⌕ Search

SEARCH · Search NASA

Results for “compression 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.

At least 1,171 records · Page 65

A data compression technique for synthetic aperture radar images

A data compression technique is developed for synthetic aperture radar (SAR) imagery. The technique is based on an SAR image model and is designed to preserve the local statistics in the image by an adaptive variable rate modification of block truncation coding (BTC). A data rate of approximately 1.6 bit/pixel is achieved with the technique while maintaining the image quality and cultural (pointlike) targets. The algorithm requires no large data storage and is computationally simple.

Frost, V. S.↗

Parabolized Navier-Stokes algorithm for chemically reacting flows

A second-order parabolized Navier-Stokes algorithm based on the MacCormack (1969) explicit scheme is used to study three-dimensional chemically reacting flows with finite-rate chemistry. The method can treat the chemical source term implicitly, and it accounts for the multicomponent diffusion and convection of the chemical species. The method is demonstrated with the nonreacting case of a Mach-3 flow over a double-wedge compression corner and the case of streamwise hydrogen injection at sonic velocity in a Mach-2.44 vitiated air stream.

Kamath, H.↗

Development of iterative techniques for the solution of unsteady compressible viscous flows

A research effort was initiated at Georgia Tech in February 1991 on the development of efficient techniques for the computation of 2-D and 3-D unsteady compressible flow problems. It was found that in 2-D unsteady viscous flow applications, the generalized minimal residual (GMRES) scheme was able to significantly improve the accuracy and stability characteristics of an existing 2-D ADI (Alternating Direction Implicit) time marching scheme. That is, the GMRES/ADI combination allowed 10 to 20 times larger time steps compared to an ADI scheme. Because the GMRES algorithm requires 5 to 10 times the CPU work compared to the ADI scheme, the combined GMRES/ADI scheme yields a net factor of 2 savings in CPU cost. During the past year, we also experimented with GMRES/multigrid/ADI combination. The purpose of this combination was to compute the low frequency components of the change in the flow properties from one time step to the next on a coarse grid. This strategy reduces the memory requirements of the GMRES method roughly by a factor of 4-8 for steady flow problems.

Sankar, Lakshmi N.↗

Influence of gradation on shear behavior and pore water response of sand

Here, this paper examines the influence of particle size distribution (PSD) on the shearing behavior of sand using axisymmetric triaxial compression (ATC) testing in conjunction with 3D imaging using synchrotron micro-computed tomography (SMT). Angular sand was sieved to obtain a narrow gradation (uniform) and a wide gradation (non-uniform) with uniformity coefficients (C u ) of 1.2 and 3.0, respectively. Experiments were conducted under drained conditions and a constant effective cell pressure (σ$^{'}_3$) of 50 kPa at low and high back pressures (BP). Results of paired ATC-SMT were analyzed in terms of global constitutive behavior, strain localization, and localized flow characteristics. A new particle tracking algorithm is developed to expose strain localization. Relative particle translation gradient (RPTG) results revealed that gradation affects how early the shear band develops and a tendency for narrow gradation to exhibit varying degrees of diffused shear band at high axial strain (ε 1 ) even though a clear single shear band was observed at the peak strength. Geometric tortuosity (τ) is used as a quantitative parameter to assess flow changes and the efficiency of the flow path. Representative elementary volumes (REVs) inside and outside the shear band were analyzed and the results showed a variation in flow path characteristics where wide gradation specimens had preferential flow paths.

Computed tomography↗

Compressed video camera with a moving patterned disk

A high-speed video system is disclosed that includes a moving image absorbing disk at an image plane. The disk has a pattern that passes and blocks image data. The disk is located between an event and an image sensor, or reflects an image to the image sensor. The disk is rotated at a speed that matches the desired reconstructed image frame rate. The image sensor frame data is processed using image reconstruction techniques, such as the D-AMP or TWIST algorithm, to recover a time sequence of reconstructed images. Additional images can be reconstructed for each image sensor frame if some spatial resolution is sacrificed. For continuous video, the disk speed is adjusted to the sensor frame rate. For burst mode, a single sensor image is acquired and a short image sequence is reconstructed. This image capture system works with a variety of radiations, including infrared, light, UV and X-rays.

42 ENGINEERING↗

Sparse Recovery for Scientific Data

We have built build and analyzed fundamental mathematical tools that enable sparse recovery of scientific data for high performance computing, experimental facilities and sensor measurement. The proposed work will impact many areas of research across the DOE. We have designed, developed and analyzed fast scalable algorithms for the sparse recovery of scientific data sets that may be extremely large, generated very quickly and distributed across multiple storage devices. The algorithms we developed will be used to process the copious amounts of scientific data generated by the DOE supercomputer simulations and by DOE experimental and observational facilities. They leverage the fact that while the amount of data produced can be extremely large, the actual quantities of interest (QoI's) are often sparse, either in space time, or in some feature space. Mathematically, notions of compressive sensing, including l1 regularized and total variation regularized optimization have played an important part in this effort.

97 MATHEMATICS AND COMPUTING↗

Planning and executing motions for multibody systems in free-fall

The purpose of this research is to develop an end-to-end system that can be applied to a multibody system in free-fall to analyze its possible motions, save those motions in a database, and design a controller that can execute those motions. A goal is for the process to be highly automated and involve little human intervention. Ideally, the output of the system would be data and algorithms that could be put in ROM to control the multibody system in free-fall. The research applies to more than just robots in space. It applies to any multibody system in free-fall. Mathematical techniques from nonlinear control theory were used to study the nature of the system dynamics and its possible motions. Optimization techniques were applied to plan motions. Image compression techniques were proposed to compress the precomputed motion data for storage. A linearized controller was derived to control the system while it executes preplanned trajectories.

Cameron, Jonathan M.↗

Development of iterative techniques for the solution of unsteady compressible viscous flows

The development of efficient iterative solution methods for the numerical solution of two- and three-dimensional compressible Navier-Stokes equations is discussed. Iterative time marching methods have several advantages over classical multi-step explicit time marching schemes, and non-iterative implicit time marching schemes. Iterative schemes have better stability characteristics than non-iterative explicit and implicit schemes. In this work, another approach based on the classical conjugate gradient method, known as the Generalized Minimum Residual (GMRES) algorithm is investigated. The GMRES algorithm has been used in the past by a number of researchers for solving steady viscous and inviscid flow problems. Here, we investigate the suitability of this algorithm for solving the system of non-linear equations that arise in unsteady Navier-Stokes solvers at each time step.

Sankar, Lakshmi N.↗

A petabyte size electronic library using the N-Gram memory engine

A model library containing petabytes of data is proposed by Triada, Ltd., Ann Arbor, Michigan. The library uses the newly patented N-Gram Memory Engine (Neurex), for storage, compression, and retrieval. Neurex splits data into two parts: a hierarchical network of associative memories that store 'information' from data and a permutation operator that preserves sequence. Neurex is expected to offer four advantages in mass storage systems. Neurex representations are dense, fully reversible, hence less expensive to store. Neurex becomes exponentially more stable with increasing data flow; thus its contents and the inverting algorithm may be mass produced for low cost distribution. Only a small permutation operator would be recalled from the library to recover data. Neurex may be enhanced to recall patterns using a partial pattern. Neurex nodes are measures of their pattern. Researchers might use nodes in statistical models to avoid costly sorting and counting procedures. Neurex subsumes a theory of learning and memory that the author believes extends information theory. Its first axiom is a symmetry principle: learning creates memory and memory evidences learning. The theory treats an information store that evolves from a null state to stationarity. A Neurex extracts information data without a priori knowledge; i.e., unlike neural networks, neither feedback nor training is required. The model consists of an energetically conservative field of uniformly distributed events with variable spatial and temporal scale, and an observer walking randomly through this field. A bank of band limited transducers (an 'eye'), each transducer in a bank being tuned to a sub-band, outputs signals upon registering events. Output signals are 'observed' by another transducer bank (a mid-brain), except the band limit of the second bank is narrower than the band limit of the first bank. The banks are arrayed as n 'levels' or 'time domains, td.' The banks are the hierarchical network (a cortex) and transducers are (associative) memories. A model Neurex was built and studied. Data were 50 MB to 10 GB samples of text, data base, and images: black/white, grey scale, and high resolution in several spectral bands. Memories at td, S(m(sub td)), were plotted against outputs of memories at td-1. S(m(sub td)) was Boltzman distributed, and memory frequencies exhibited self-organized criticality (SOC); i.e., 'l/f(sup beta)' after long exposures to data. Whereas output signals from level n may be encoded with B(sub output) = O(-log(2)f(sup beta)) bits, and input data encoded with B(sub input) = O((S(td)/S(td-1))(sup n)), B(sup output)/B(sub input) is much less than 1 always, the Neurex determines a canonical code for data and it is a lossless data compressor. Further tests are underway to confirm these results with more data types and larger samples.

Bugajski, Joseph M.↗

Improved melt model for power flow

Accelerators that drive z-pinch experiments transport current densities in excess of 1 MA/cm 2 in order to melt or ionize the target and implode it on axis. These high current densities stress the transmission lines upstream from the target, where rapid electrode heating causes plasma formation, melt, and possibly vaporization. These plasmas negatively impact accelerator efficiency by diverting some portion of the current away from the target, referred to as “current loss”. Simulations that are able to reproduce this behavior may be applied to improving the efficiency of existing accelerators and to designing systems operating at ever higher current densities. The relativistic particle-in-cell code CHICAGO ® is the primary code for modeling power flow on Sandia National Laboratories’ Z accelerator. We report here on new algorithms that incorporate vaporization and melt into the standard power-flow simulation framework. Taking a hybrid approach, the CHICAGO® kinetic/multi-fluid treatment has been expanded to include vaporization while the quasi-neutral equation-of-motion has been updated for melt at high current-densities. For vaporization, a new one-dimensional substrate model provides a more accurate calculation of electrode thermal, mass, and magnetic field diffusion as well as a means of emitting absorbed contaminants and vaporized metal ions. A quasi-fluid model has been implemented expressly to mimic the motion of imploding liners for accurate inductance histories. For melt, a multi-ion Hall-MHD option has been implemented and benchmarked against Alegra MHD. This new model is described with sufficient detail to reproduce these algorithms in any hybrid kinetic code. Physics results from the new code are also presented. A CHICAGO ® Hall-MHD simulation of a radial transmission line demonstrates that Hall physics, not included in Alegra, has no significant impact on the diffusion of electrode material. When surface contaminant desorption is mocked in as a hydrogen surface plasma, both the surface and bulk-material plasmas largely compress under the influence of the j × B force. Similar results are seen in Alegra, which also shows magnetic and material diffusion scaling with peak current. Test vaporization simulations using MagLIF and a power-flow experimental geometry show Fe + ions diffuse only a few hundred µm from the electrodes, so present models of Z power flow remain valid.

43 PARTICLE ACCELERATORS↗

Long decoding runs for Galileo's convolutional codes

Decoding results are described for long decoding runs of Galileo's convolutional codes. A 1 k-bit/sec hardware Viterbi decoder is used for the (15, 1/4) convolutional code, and a software Viterbi decoder is used for the (7, 1/2) convolutional code. The output data of these long runs are stored in data files using a data compression format which can reduce file size by a factor of 100 to 1 typically. These data files can be used to replicate the long, time-consuming runs exactly and are useful to anyone who wants to analyze the burst statistics of the Viterbi decoders. The 1 k-bit/sec hardware Viterbi decoder was developed in order to demonstrate the correctness of certain algorithmic concepts for decoding Galileo's experimental (15, 1/4) code, and for the long-constraint-length codes in general. The hardware decoder can be used both to search for good codes and to measure accurately the performance of known codes.

Lahmeyer, C. R.↗

Techniques in processing multi-frequency multi-polarization spaceborne SAR data

This paper presents the algorithm design of the SIR-C ground data processor, with emphasis on the unique elements involved in the production of registered multifrequency polarimetric data products. A quick-look processing algorithm used for generation of low-resolution browse image products and estimation of echo signal parameters is also presented. Specifically the discussion covers: (1) azimuth reference function generation to produce registered polarimetric imagery; (2) geometric rectification to accommondate cross-track and along-track Doppler drifts; (3) multilook filtering designed to generate output imagery with a uniform resolution; and (4) efficient coding to compress the polarimetric image data for distribution.

Curlander, John C.↗

Vortex tubes in turbulent flows: Identification, representation, reconstruction

In many cases the structure of a fluid flow is well-characterized by its vortices, especially for the purpose of visualization. In this paper we present a new algorithm for identifying vortices in complex flows. The algorithm produces a skeleton line along the center of a vortex by using a two-step predictor-corrector scheme. The vorticity vector field serves as the predictor and the pressure gradient (in the perpendicular plane) serves as the corrector. We describe an economical description of the vortex tube's cross-section: a 5-term truncated Fourier series is generally sufficient, and it compresses the representation of the flow by a factor of 4000 or more. We reconstruct the vortex tubes as generalized cylinders, providing a polygonal mesh suitable for display on a graphics workstation. We show how the reconstructed geometry of vortex tubes can be enhanced to help visualize helical motion in a static image.

Banks, David C.↗

An inexact semismooth Newton method with application to adaptive randomized sketching for dynamic optimization

In many applications, one can only access the inexact gradients and inexact hessian times vector products. Thus it is essential to consider algorithms that can handle such inexact quantities with a guaranteed convergence to solution. An inexact adaptive and provably convergent semismooth Newton method is considered to solve constrained optimization problems. In particular, dynamic optimization problems, which are known to be highly expensive, are the focus. A memory efficient semismooth Newton algorithm is introduced for these problems. The source of efficiency and inexactness is the randomized matrix sketching. Further, applications to optimization problems constrained by partial differential equations are also considered.

97 MATHEMATICS AND COMPUTING↗

Traversing large graphs on GPUs with unified memory

Due to the limited capacity of GPU memory, the majority of prior work on graph applications on GPUs has been restricted to graphs of modest sizes that fit in memory. Recent hardware and software advances make it possible to address much larger host memory transparently as a part of a feature known as unified virtual memory. While accessing host memory over an interconnect is understandably slower, the problem space has not been sufficiently explored in the context of a challenging workload with low computational intensity and an irregular data access pattern such as graph traversal. We analyse the performance of breadth first search (BFS) for several large graphs in the context of unified memory and identify the key factors that contribute to slowdowns. Next, we propose a lightweight offline graph reordering algorithm, HALO (Harmonic Locality Ordering), that can be used as a pre-processing step for static graphs. HALO yields speedups of 1.5x-1.9x over baseline in subsequent traversals. Our method specifically aims to cover large directed real world graphs in addition to undirected graphs whereas prior methods only account for the latter. Additionally, we demonstrate ties between the locality ordering problem and graph compression and show that prior methods from graph compression such as recursive graph bisection can be suitably adapted to this problem.

Gera, Prasun↗

Detection of the Impact of Ice Crystal Accretion in an Aircraft Engine Compression System During Dynamic Operation

The accretion of ice in the compression system of commercial gas turbine engines operating in high ice water content conditions is a safety issue being studied by the aviation community. While most of the research focuses on the underlying physics of ice accretion and the meteorological conditions in which accretion can occur, a systems-level perspective on the topic lends itself to potential near-term operational improvements. Here a detection algorithm is developed which has the capability to detect the impact of ice accretion in the Low Pressure Compressor of an aircraft engine during steady flight as well as during changes in altitude. Unfortunately, the algorithm as implemented was not able to distinguish throttle changes from ice accretion and thus more work remains to be done.

high ice water content↗

Detection of the Impact of Ice Crystal Accretion in an Aircraft Engine Compression System During Dynamic Operation

The accretion of ice in the compression system of commercial gas turbine engines operating in high ice water content conditions is a safety issue being studied by the aviation community. While most of the research focuses on the underlying physics of ice accretion and the meteorological conditions in which accretion can occur, a systems-level perspective on the topic lends itself to potential near-term operational improvements. Here a detection algorithm is developed which has the capability to detect the impact of ice accretion in the Low Pressure Compressor of an aircraft engine during steady flight as well as during changes in altitude. Unfortunately, the algorithm as implemented was not able to distinguish throttle changes from ice accretion and thus more work remains to be done.

detection↗

Distributed Tomographic Reconstruction with Quantization

Conventional tomographic reconstruction typically depends on centralized servers for both data storage and computation, leading to concerns about memory limitations and data privacy. Distributed reconstruction algorithms mitigate these issues by partitioning data across multiple nodes, reducing server load and enhancing privacy. However, these algorithms often encounter challenges related to memory constraints and communication overhead between nodes. In this paper, we introduce a decentralized Alternating Directions Method of Multipliers (ADMM) with configurable quantization. By distributing local objectives across nodes, our approach is highly scalable and can efficiently reconstruct images while adapting to available resources. To overcome communication bottlenecks, we propose two quantization techniques based on K-means clustering and JPEG compression. Numerical experiments with benchmark images illustrate the tradeoffs between communication efficiency, memory use, and reconstruction accuracy.

Miao, Runxuan↗