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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 379 records · Page 21

All sources NASA NTRS DOE OSTI

NASA NTRS1987

Studies of pressure-velocity coupling schemes for analysis of incompressible and compressible flows

Two pressure-velocity coupling schemes, both of which solve the fully implicit discretized equations governing the flow of fluids were examined, and the capability of performing large Reynolds number, low Mach number compressible flow calculations were assessed. The semi-implicit iterative SIMPLE algorithm is extended to handle transient compressible flow calculations. This extension takes into account a strong coupling between the pressure and temperature through a correction procedure, based on the equations of state. Results obtained from the extended SIMPLE algorithm are then compared to similar results obtained from the non-iterative PISO algorithm. Both time-dependent and steady state calculations were performed using an axisymmetric 2:1 pipe expansion geometry and laminar flow conditions corresponding to Reynolds number of 1000 and Mach number of 2.0. For calculations simulating a time-dependent compression/expansion process, both schemes exhibit transient features in excellent agreement with each other, and moreover, the PISO method shows a significant computational time reduction of 60 percent over the SIMPLE scheme, regardless of the time step size or grid size employed. The effects of numerical diffusion are shown to be significant in these calculations. For steady state compressible flows, however, the SIMPLE algorithm displays increasing computational efficiency over the PISO method as the time step sizes employed to reach steady state conditions are decreased.

Burgreen, Gregory Wayne↗

NASA NTRS1986

Image data compression with vector quantization in the transform domain

In this paper, an algorithm is presented for image data compression based upon vector quantization of the two-dimensional discrete cosine transformed coefficients. The ac energies of the transformed blocks are used to classify them into eight different ac classes. The ac coefficients of the transformed blocks of class one are set to zero, while those of classes two through eight are transmitted by seven different code books. The dc coefficients of all eight classes are scalar quantized by an adaptive uniform quantizer. As a result, only 4.5 bits instead of eight bits are required to transmit the dc coefficient with negligible additional degradation. Overall, this algorithm requires approximately 0.75 bits per pixel and gives an average reconstruction error of 7.1.

Abdelwahab, A. A.↗

DOE OSTI2019

Optical Sampler for Broad-Spectrum Sensing

We investigated the feasibility of using non-uniform optical sampling to measure wide bandwidth RF signals more efficiently. This combined two areas of signal measurement research: optical sampling, which uses optics to alleviate the bandwidth limitations of traditional electronic sampling, and compressed sensing, which seeks to measure signals with fewer samples than typically necessary. This can both increase accuracy and reduce cost over current state-of-the-art sampling devices. However, several different compressed sensing architectures and algorithms offer varying levels of performance, robustness and complexity. In this work, we compared the tradeoffs between several of these methods in simulation of a remote sensing application. We found that while feasible, compressed sensing is inherently less sensitive than fully sampled systems, and so must be paired with a very low noise optical system. We also built an experimental prototype of the system and took initial measurements.

47 OTHER INSTRUMENTATION↗

DOE OSTI2023

Efficient Network Partitioning: Application for Decentralized State Estimation in Power Distribution Grids: Preprint

Increase in the proliferation of DERs requires real-time situational awareness for efficient grid operations. State estimation plays an important role for real time control and management of the power grid. As the sensing infrastructure grows, aggregating and handling high volumes of data at a centralized location is extremely difficult. To address this challenge, this paper first proposes a novel and efficient hierarchical spectral clustering-based network partition algorithm followed by a decentralized compressive sensing (DCS) based state estimation. The applicability of the proposed network partitioning algorithm is tested on IEEE-123 bus, IEEE-8500 node, and a 6204-node distribution network. The results shows that the proposed approach efficiently divides the network into multiple sub-networks with the minimum edge connections among the neighbors. Then, we perform DCS-based state estimation on the 6204-node distribution network after dividing the network into 18 optimal partitions. Simulation results show that DCS-based state estimation recovers the system states with high accuracy and low complexity.

ADMM↗

DOE OSTI2023

Efficient Network Partitioning: Application for Decentralized State Estimation in Power Distribution Grids

Increase in the proliferation of distributed energy resources require real-time situational awareness for efficient grid operations. State estimation plays an important role for the real-time control and management of the power grid. As the sensing infrastructure grows, aggregating and handling high volumes of data at a centralized location is extremely difficult. To address this challenge, this paper first proposes a novel and efficient hier-archical spectral clustering-based network partitioning algorithm followed by a decentralized compressive sensing (DCS)-based state estimation. The applicability of the proposed network partitioning algorithm is tested on an IEEE 123-bus network, an IEEE 8,500-node system, and a 6,000+ node distribution network. The results shows that the proposed approach efficiently divides the network into multiple sub-networks with the minimum number of edge connections among the neighbors. Then, we perform DCS-based state estimation on the 6,000+ node distribution network after dividing the network into 18 optimal partitions. Simulation results show that the DCS-based state estimation recovers the system states with high accuracy and low complexity.

alternating direction method of multipliers↗

NASA NTRS1976

A block iterative finite element algorithm for numerical solution of the steady-state, compressible Navier-Stokes equations

An iterative method for numerically solving the time independent Navier-Stokes equations for viscous compressible flows is presented. The method is based upon partial application of the Gauss-Seidel principle in block form to the systems of nonlinear algebraic equations which arise in construction of finite element (Galerkin) models approximating solutions of fluid dynamic problems. The C deg-cubic element on triangles is employed for function approximation. Computational results for a free shear flow at Re = 1,000 indicate significant achievement of economy in iterative convergence rate over finite element and finite difference models which employ the customary time dependent equations and asymptotic time marching procedure to steady solution. Numerical results are in excellent agreement with those obtained for the same test problem employing time marching finite element and finite difference solution techniques.

Cooke, C. H.↗

NASA NTRS1977

A block iterative finite element algorithm for numerical solution of the steady-state, compressible Navier-Stokes equations

An iterative method for numerically solving the time independent Navier-Stokes equations for viscous compressible flows is presented. The method is based upon partial application of the Gauss-Seidel principle in block form to the systems of the nonlinear algebraic equations which arise in construction of finite element (Galerkin) models approximating solutions of fluid dynamic problems. The continuous cubic element on triangles is employed for function approximation. Computational results for a free shear flow at Re = 1000 indicate significant achievement of economy in iterative convergence rate over finite element and finite difference models which employ the customary time dependent equations and symptotic time marching procedure to steady solution. Numerical results are in excellent agreement with those obtained for the same test problem employing time marching finite element and finite difference solution techniques.

Cooke, C. H.↗

NASA NTRS1983

A modified Dodge algorithm for the parabolized Navier-Stokes equations and compressible duct flows

A revised version of Dodge's split-velocity method for numerical calculation of compressible duct flow has been developed. The revision incorporates balancing of massflow rates on each marching step in order to maintain front-to-back continuity during the calculation. Qualitative agreement with analytical predictions and experimental results has been obtained for some flows with well-known solutions.

Cooke, C. H.↗

NASA NTRS1998

Information-Adaptive Image Encoding and Restoration

The multiscale retinex with color restoration (MSRCR) has shown itself to be a very versatile automatic image enhancement algorithm that simultaneously provides dynamic range compression, color constancy, and color rendition. A number of algorithms exist that provide one or more of these features, but not all. In this paper we compare the performance of the MSRCR with techniques that are widely used for image enhancement. Specifically, we compare the MSRCR with color adjustment methods such as gamma correction and gain/offset application, histogram modification techniques such as histogram equalization and manual histogram adjustment, and other more powerful techniques such as homomorphic filtering and 'burning and dodging'. The comparison is carried out by testing the suite of image enhancement methods on a set of diverse images. We find that though some of these techniques work well for some of these images, only the MSRCR performs universally well oil the test set.

Park, Stephen K.↗

NASA NTRS1997

A Comparison of the Multiscale Retinex With Other Image Enhancement Techniques

Rahman, Zia-Ur↗

NASA NTRS1985

A multistage time-stepping scheme for the Navier-Stokes equations

A class of explicit multistage time-stepping schemes is used to construct an algorithm for solving the compressible Navier-Stokes equations. Flexibility in treating arbitrary geometries is obtained with a finite-volume formulation. Numerical efficiency is achieved by employing techniques for accelerating convergence to steady state. Computer processing is enhanced through vectorization of the algorithm. The scheme is evaluated by solving laminar and turbulent flows over a flat plate and an NACA 0012 airfoil. Numerical results are compared with theoretical solutions or other numerical solutions and/or experimental data.

Swanson, R. C.↗

NASA NTRS1985

A multistage time-stepping scheme for the Navier-Stokes equations

Swanson, R. C.↗

NASA NTRS1989

A programmable image compression system

A programmable image compression system which has the necessary flexibility to address diverse imaging needs is described. It can compress and expand single frame video images (monochrome or color) as well as documents and graphics (black and white or color) for archival or transmission applications. Through software control, the compression mode can be set for lossless or controlled quality coding; the image size and bit depth can be varied; and the image source and destination devices can be readily changed. Despite the large combination of image data types, image sources, and algorithms, the system provides a simple consistent interface to the programmer. This system (OPTIPAC) is based on the TITMS320C25 digital signal processing (DSP) chip and has been implemented as a co-processor board for an IBM PC-AT compatible computer. The underlying philosophy can readily be applied to different hardware platforms. By using multiple DSP chips or incorporating algorithm specific chips, the compression and expansion times can be significantly reduced to meet performance requirements.

Farrelle, Paul M.↗

DOE OSTI2024

Spinning metasurface stack for spectro-polarimetric thermal imaging

Spectro-polarimetric imaging in the long-wave infrared (LWIR) region plays a crucial role in applications from night vision and machine perception to trace gas sensing and thermography. However, the current generation of spectro-polarimetric LWIR imagers suffers from limitations in size, spectral resolution, and field of view (FOV). While meta-optics-based strategies for spectro-polarimetric imaging have been explored in the visible spectrum, their potential for thermal imaging remains largely unexplored. In this work, we introduce an approach for spectro-polarimetric decomposition by combining large-area stacked meta-optical devices with advanced computational imaging algorithms. The co-design of a stack of spinning dispersive metasurfaces along with compressive sensing and dictionary learning algorithms allows simultaneous spectral and polarimetric resolution without the need for bulky filter wheels or interferometers. Our spinning-metasurface-based spectro-polarimetric stack is compact (<10×10×10cm) and robust, and it offers a wide field of view (20.5°). We show that the spectral resolving power of our system substantially enhances performance in machine learning tasks such as material classification, a challenge for conventional panchromatic thermal cameras. Our approach represents a significant advance in the field of thermal imaging for a wide range of applications including heat-assisted detection and ranging (HADAR).

Optics↗

NASA NTRS1987

Finite element methods for compressible flows

The problems of mesh generation and developing effective algorithms for the solution of the equations of compressible flow on unstructured meshes are discussed. Adaptive mesh refinement methods can be implemented in a straightforward manner. Possible adaptive strategies are examined. A finite element method adapted to problems involving high speed compressible flow is described. The adaptive mesh regeneration procedure appears to offer the possibility of large computational savings in three dimensional flow computation.

Morgan, K.↗

NASA NTRS1985

A Taylor-Galerkin finite element algorithm for transient nonlinear thermal-structural analysis

A Taylor-Galerkin finite element solution algorithm for transient nonlinear thermal-structural analysis of large, complex structural problems subjected to rapidly applied thermal-structural loads is described. The two-step Taylor-Galerkin algorithm is an application of an algorithm recently developed for problems in compressible fluid dynamics. The element integrals that appear in the algorithm can be evaluated in closed form for two and three dimensional elements.

Thornton, Earl A.↗

NASA NTRS1992

A 3D finite element multigrid solver for the Euler equations

A low storage, computationally efficient algorithm for the solution of the compressible Euler equations on unstructured tetrahedral meshes is developed. The algorithm takes the form of a centered scheme with the explicit addition of a high accuracy artificial viscosity and the solution is advanced to steady state by means of a multistage timestepping method. The side-based data structure which is employed enables a clear connection to be established between the proposed algorithm and upwind cell vertex schemes for unstructured meshes. The computational efficiency of the procedure is improved by incorporating an unstructured multigrid acceleration procedure. A number of flows of practical interest are analyzed to demonstrate the numerical performance of the proposed approach.

Peraire, J.↗

DOE OSTI2018

Microstructural packing- and rheology-based binder selection and characterization for Ultra-high Performance Concrete (UHPC)

This paper reports strategies to design the binder phase of ultra-high performance concretes (UHPC) from commonly available cement replacement (fly ash, slag, microsilica, metakaolin) and fine filler (limestone) materials. A packing algorithm is used to extract the number density, mean centroidal distance, and coordination number of the microstructure. Similarly, rheological studies on the pastes provide yield stress, plastic viscosity, and min-slump spread. The selection criteria involves using the three microstructural and three rheological parameters individually or in combination to define packing and flow coefficients. The selection criteria is flexible enough to allow users modify the constraints depending on the application. In this study, only ternary and quaternary blends, with a total cement replacement of 30% by mass are selected for further characterization. The highly efficient microstructural packing in these mixtures and better workability that facilitated dispersion of particles to enhance the reactivity results in beneficial pore structure and mechanical properties.

36 MATERIALS SCIENCE↗