Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Lossless”

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
DOE OSTI2022

Implementation of Ion Mobility Spectrometry-Based Separations in Structures for Lossless Ion Manipulations (SLIM)

Structures for Lossless Ion Manipulations (SLIM) is a powerful variant of traveling wave ion mobility spectrometry (TW-IMS) that uses a serpentine pattern of microelectrodes deposited onto printed circuit boards to achieve ultralong ion path lengths (13.5 m). Ions are propelled through SLIM platforms via arrays of TW electrodes while RF and DC electrodes provide radial confinement, establishing near lossless transmission. The recent ability to cycle ions multiple times through a SLIM has allowed ion path lengths to exceed 1000 m, providing unprecedented separation power and the ability to observe ion structural conformations unobtainable with other IMS technologies. The combination of high separation power, high signal intensity, and the ability to couple with mass spectrometry places SLIM in the unique position of being able to address longstanding proteomics and metabolomics challenges by allowing the characterization of isomeric mixtures containing low abundance analytes.

Hollerbach, Adam L.↗
NASA NTRS1992

Modeling of video traffic in packet networks, low rate video compression, and the development of a lossy+lossless image compression algorithm

During this reporting period we have worked on three somewhat different problems. These are modeling of video traffic in packet networks, low rate video compression, and the development of a lossy + lossless image compression algorithm, which might have some application in browsing algorithms. The lossy + lossless scheme is an extension of work previously done under this grant. It provides a simple technique for incorporating browsing capability. The low rate coding scheme is also a simple variation on the standard discrete cosine transform (DCT) coding approach. In spite of its simplicity, the approach provides surprisingly high quality reconstructions. The modeling approach is borrowed from the speech recognition literature, and seems to be promising in that it provides a simple way of obtaining an idea about the second order behavior of a particular coding scheme. Details about these are presented.

Sayood, K.↗
NASA NTRS1993

The implementation of a lossless data compression module in an advanced orbiting system: Analysis and development

Data compression has been proposed for several flight missions as a means of either reducing on board mass data storage, increasing science data return through a bandwidth constrained channel, reducing TDRSS access time, or easing ground archival mass storage requirement. Several issues arise with the implementation of this technology. These include the requirement of a clean channel, onboard smoothing buffer, onboard processing hardware and on the algorithm itself, the adaptability to scene changes and maybe even versatility to the various mission types. This paper gives an overview of an ongoing effort being performed at Goddard Space Flight Center for implementing a lossless data compression scheme for space flight. We will provide analysis results on several data systems issues, the performance of the selected lossless compression scheme, the status of the hardware processor and current development plan.

Yeh, Pen-Shu↗
NASA NTRS1992

Lossless compression of AVIRIS data: Comparison of methods and instrument constraints

A family of lossless compression methods, allowing exact image reconstruction, are evaluated for compressing Airborne Visible/Infrared Imaging Spectrometers (AVIRIS) image data. The methods are used on Differential Pulse Code Modulation (DPCM). The compressed data have an entropy of order 6 bits/pixel. A theoretical model indicates that significantly better lossless compression is unlikely to be achieved because of limits caused by the noise in the AVIRIS channels. AVIRIS data differ from data produced by other visible/near-infrared sensors, such as LANDSAT-TM or SPOT, in several ways. Firstly, the data are recorded at a greater resolution (12 bits, though packed into 16-bit words). Secondly, the spectral channels are relatively narrow and provide continuous coverage of the spectrum so that the data in adjacent channels are generally highly correlated. Thirdly, the noise characteristics of the AVIRIS are defined by the channels' Noise Equivalent Radiances (NER's), and these NER's show that, at some wavelengths, the least significant 5 or 6 bits of data are essentially noise.

Roger, R. E.↗
NASA NTRS1993

An adaptive, lossless data compression algorithm and VLSI implementations

This paper first provides an overview of an adaptive, lossless, data compression algorithm originally devised by Rice in the early '70s. It then reports the development of a VLSI encoder/decoder chip set developed which implements this algorithm. A recent effort in making a space qualified version of the encoder is described along with several enhancements to the algorithm. The performance of the enhanced algorithm is compared with those from other currently available lossless compression techniques on multiple sets of test data. The results favor our implemented technique in many applications.

Venbrux, Jack↗
NASA NTRS1994

An adaptive technique to maximize lossless image data compression of satellite images

Data compression will pay an increasingly important role in the storage and transmission of image data within NASA science programs as the Earth Observing System comes into operation. It is important that the science data be preserved at the fidelity the instrument and the satellite communication systems were designed to produce. Lossless compression must therefore be applied, at least, to archive the processed instrument data. In this paper, we present an analysis of the performance of lossless compression techniques and develop an adaptive approach which applied image remapping, feature-based image segmentation to determine regions of similar entropy and high-order arithmetic coding to obtain significant improvements over the use of conventional compression techniques alone. Image remapping is used to transform the original image into a lower entropy state. Several techniques were tested on satellite images including differential pulse code modulation, bi-linear interpolation, and block-based linear predictive coding. The results of these experiments are discussed and trade-offs between computation requirements and entropy reductions are used to identify the optimum approach for a variety of satellite images. Further entropy reduction can be achieved by segmenting the image based on local entropy properties then applying a coding technique which maximizes compression for the region. Experimental results are presented showing the effect of different coding techniques for regions of different entropy. A rule-base is developed through which the technique giving the best compression is selected. The paper concludes that maximum compression can be achieved cost effectively and at acceptable performance rates with a combination of techniques which are selected based on image contextual information.

Stewart, Robert J.↗
NASA NTRS1994

Radiometric resolution enhancement by lossy compression as compared to truncation followed by lossless compression

Recent advances in imaging technology make it possible to obtain imagery data of the Earth at high spatial, spectral and radiometric resolutions from Earth orbiting satellites. The rate at which the data is collected from these satellites can far exceed the channel capacity of the data downlink. Reducing the data rate to within the channel capacity can often require painful trade-offs in which certain scientific returns are sacrificed for the sake of others. In this paper we model the radiometric version of this form of lossy compression by dropping a specified number of least significant bits from each data pixel and compressing the remaining bits using an appropriate lossless compression technique. We call this approach 'truncation followed by lossless compression' or TLLC. We compare the TLLC approach with applying a lossy compression technique to the data for reducing the data rate to the channel capacity, and demonstrate that each of three different lossy compression techniques (JPEG/DCT, VQ and Model-Based VQ) give a better effective radiometric resolution than TLLC for a given channel rate.

Tilton, James C.↗
NASA NTRS1995

A spatially adaptive spectral re-ordering technique for lossless coding of hyper-spectral images

In this paper, we propose a new approach, applicable to lossless compression of hyper-spectral images, that alleviates some limitations of linear prediction as applied to this problem. According to this approach, an adaptive re-ordering of the spectral components of each pixel is performed prior to prediction and encoding. This re-ordering adaptively exploits, on a pixel-by pixel basis, the presence of inter-band correlations for prediction. Furthermore, the proposed approach takes advantage of spatial correlations, and does not introduce any coding overhead to transmit the order of the spectral bands. This is accomplished by using the assumption that two spatially adjacent pixels are expected to have similar spectral relationships. We thus have a simple technique to exploit spectral and spatial correlations in hyper-spectral data sets, leading to compression performance improvements as compared to our previously reported techniques for lossless compression. We also look at some simple error modeling techniques for further exploiting any structure that remains in the prediction residuals prior to entropy coding.

Memon, Nasir D.↗
NASA NTRS2009

Lossless Astronomical Image Compression and the Effects of Random Noise

In this paper we compare a variety of modern image compression methods on a large sample of astronomical images. We begin by demonstrating from first principles how the amount of noise in the image pixel values sets a theoretical upper limit on the lossless compression ratio of the image. We derive simple procedures for measuring the amount of noise in an image and for quantitatively predicting how much compression will be possible. We then compare the traditional technique of using the GZIP utility to externally compress the image, with a newer technique of dividing the image into tiles, and then compressing and storing each tile in a FITS binary table structure. This tiled-image compression technique offers a choice of other compression algorithms besides GZIP, some of which are much better suited to compressing astronomical images. Our tests on a large sample of images show that the Rice algorithm provides the best combination of speed and compression efficiency. In particular, Rice typically produces 1.5 times greater compression and provides much faster compression speed than GZIP. Floating point images generally contain too much noise to be effectively compressed with any lossless algorithm. We have developed a compression technique which discards some of the useless noise bits by quantizing the pixel values as scaled integers. The integer images can then be compressed by a factor of 4 or more. Our image compression and uncompression utilities (called fpack and funpack) that were used in this study are publicly available from the HEASARC web site.Users may run these stand-alone programs to compress and uncompress their own images.

Pence, William↗
NASA NTRS2010

Algorithm for Lossless Compression of Calibrated Hyperspectral Imagery

A two-stage predictive method was developed for lossless compression of calibrated hyperspectral imagery. The first prediction stage uses a conventional linear predictor intended to exploit spatial and/or spectral dependencies in the data. The compressor tabulates counts of the past values of the difference between this initial prediction and the actual sample value. To form the ultimate predicted value, in the second stage, these counts are combined with an adaptively updated weight function intended to capture information about data regularities introduced by the calibration process. Finally, prediction residuals are losslessly encoded using adaptive arithmetic coding. Algorithms of this type are commonly tested on a readily available collection of images from the Airborne Visible/Infrared Imaging Spectrometer (AVIRIS) hyperspectral imager. On the standard calibrated AVIRIS hyperspectral images that are most widely used for compression benchmarking, the new compressor provides more than 0.5 bits/sample improvement over the previous best compression results. The algorithm has been implemented in Mathematica. The compression algorithm was demonstrated as beneficial on 12-bit calibrated AVIRIS images.

Kiely, Aaron B.↗
NASA NTRS2006

Fast Lossless Compression of Multispectral-Image Data

An algorithm that effects fast lossless compression of multispectral-image data is based on low-complexity, proven adaptive-filtering algorithms. This algorithm is intended for use in compressing multispectral-image data aboard spacecraft for transmission to Earth stations. Variants of this algorithm could be useful for lossless compression of three-dimensional medical imagery and, perhaps, for compressing image data in general.

Klimesh, Matthew↗
NASA NTRS2012

Fast and Adaptive Lossless Onboard Hyperspectral Data Compression System

Modern hyperspectral imaging systems are able to acquire far more data than can be downlinked from a spacecraft. Onboard data compression helps to alleviate this problem, but requires a system capable of power efficiency and high throughput. Software solutions have limited throughput performance and are power-hungry. Dedicated hardware solutions can provide both high throughput and power efficiency, while taking the load off of the main processor. Thus a hardware compression system was developed. The implementation uses a field-programmable gate array (FPGA). The implementation is based on the fast lossless (FL) compression algorithm reported in Fast Lossless Compression of Multispectral-Image Data (NPO-42517), NASA Tech Briefs, Vol. 30, No. 8 (August 2006), page 26, which achieves excellent compression performance and has low complexity. This algorithm performs predictive compression using an adaptive filtering method, and uses adaptive Golomb coding. The implementation also packetizes the coded data. The FL algorithm is well suited for implementation in hardware. In the FPGA implementation, one sample is compressed every clock cycle, which makes for a fast and practical realtime solution for space applications. Benefits of this implementation are: 1) The underlying algorithm achieves a combination of low complexity and compression effectiveness that exceeds that of techniques currently in use. 2) The algorithm requires no training data or other specific information about the nature of the spectral bands for a fixed instrument dynamic range. 3) Hardware acceleration provides a throughput improvement of 10 to 100 times vs. the software implementation. A prototype of the compressor is available in software, but it runs at a speed that does not meet spacecraft requirements. The hardware implementation targets the Xilinx Virtex IV FPGAs, and makes the use of this compressor practical for Earth satellites as well as beyond-Earth missions with hyperspectral instruments.

Aranki, Nazeeh I.↗
DOE OSTI2021

Dynamic time-warping correction for shifts in ultrahigh resolving power ion mobility spectrometry and structures for lossless ion manipulations

Detection of arrival time shifts between ion mobility spectrometry (IMS) separations can limit achievable resolving power (Rp), particularly when multiple separations are summed or averaged, as commonly practiced. Such variations are more apparent in higher Rp measurements, and are particularly evident in long path length traveling wave structures for lossless ion manipulations (SLIM) IMS due to their typically much longer separation times. Here we explore the utility of a data processing approaches employing linear alignment (LA) and nonlinear dynamic time warping (DTW) of IMS separations to correct for variations between separations, such as due to pressure fluctuations. For multipass SLIM IMS separations, where narrow mobility range measurements have arrival times that can extend to several seconds, the LA approach effectively corrected for such variations, and significantly improvement Rp for summed separations. However, LA was much less effective for high Rp broad mobility range separations, such as obtained with multilevel SLIM IMS. Changes in IMS arrival times ions were observed to be correlated with small pressure changes, with approximately 0.6% relative arrival time shifts being common, sufficient to result in a loss of Rp for summed separations. Comparison of the approaches showed DTW alignment performed similarly to LA when used over a narrow mobility range, but was significantly better (providing narrower peaks and higher signal intensities) for wide mobility range data. We found the DTW approach increased Rp by as much as 115% for measurements in which 50 IMS separations over 2 seconds were summed, and leading to a large improvement in effective Rp. We conclude that DTW is superior to LA for ultrahigh resolution broad mobility range SLIM IMS separations, correcting for ion arrival time shifts regardless of the cause. Our tool is publicly available for use with universal ion mobility format (.UIMF) and text (.txt) files.

Data alignment, dynamic time warping, ion mobility↗
DOE OSTI2021

Improving Signal to Noise Ratios in Ion Mobility Spectrometry and Structures for Lossless Ion Manipulations (SLIM) using a High Dynamic Range Analog-to-Digital Converter

Signal digitization is a commonly overlooked part of ion mobility-mass spectrometry (IMS-MS) workflows, yet it is a significant contributor for determining signal-to-noise ratios and MS resolution. Here we report on the integration of a 2 GS/s, 14-bit ADC with a structures for lossless ion manipulations (SLIM)-IMS-MS and compare the performance to a commonly used 8-bit ADC. The 14-bit ADC provided an effective reduction in digitized noise by factor of ~6, owing largely to the use of smaller bit sizes. The low baseline allowed the threshold voltage levels to be set very close to the MCP baseline voltage, allowing for as much signal to be acquired as possible without causing overloading or excessive digitization of MCP baseline noise. Analyses of Agilent tuning mixture ions and a complex mixture of heavy labeled phosphopeptides showed that the 14-bit ADC (compared to the 8-bit ADC) provided a modest signal-to-noise increase (~1.5 to 2-fold) for high intensity ions, such as the Agilent tuning mixture ions and the 2+ and 3+ charge states of many phosphopeptide constituents. However, signal enhancements were as much as 10-fold for low intensity ions, and the 14-bit ADC enabled discernable signal intensities otherwise lost using an 8-bit digitizer. Additionally, the 14-bit ADC required ~14-fold fewer mass spectra to be averaged to produce a mass spectrum with similar S/N as the 8-bit ADC under identical conditions, potentially providing an order of magnitude higher measurement throughput. The high resolution, low baseline, and fast speed of the new 14-bit ADC enables high performance digitization of MS, IMS-MS, and SLIM-IMS-MS spectra, and allows a much fuller picture of analyte profiles in complex mixtures to be acquired.

data acquisition, digitization, ion mobility spect↗
NASA NTRS2005

Low-Complexity Lossless Compression of Hyperspectral Imagery Via Adaptive Filtering

A low-complexity, adaptive predictive technique for lossless compression of hyperspectral data is presented. The technique relies on the sign algorithm from the repertoire of adaptive filtering. The compression effectiveness obtained with the technique is competitive with that of the best of previously described techniques with similar complexity.

lossless data compression↗
NASA NTRS2012

Real-Time Adaptive Lossless Hyperspectral Image Compression using CCSDS on Parallel GPGPU and Multicore Processor Systems

The proposed CCSDS (Consultative Committee for Space Data Systems) Lossless Hyperspectral Image Compression Algorithm was designed to facilitate a fast hardware implementation. This paper analyses that algorithm with regard to available parallelism and describes fast parallel implementations in software for GPGPU and Multicore CPU architectures. We show that careful software implementation, using hardware acceleration in the form of GPGPUs or even just multicore processors, can exceed the performance of existing hardware and software implementations by up to 11x and break the real-time barrier for the first time for a typical test application.

realtime↗