Band Ordering in Lossless Compression of Multispectral Images

In this paper, we consider a model of lossless image compression in which each band of a multispectral image is coded using a prediction function involving values from a previously coded band of the compression, and examine how the ordering of the bands affects the achievable compression. We present an efficient algorithm for computing the optimal band ordering for a multispectral image. This algorithm has time complexity O(n2) for an n-band image, while the naive algorithm takes time &#x03A9(n!). A slight variant of the optimal ordering problem that is motivated by some practical concerns is shown to be NP-hard, and hence, computationally infeasible, in all cases except for the most trivial possibility. In addition, we report on our experimental findings using the algorithms designed in this paper applied to real multispectral satellite data. The results show that the techniques described here hold great promise for application to real-world compression needs

Application of permutations to lossless compression of multispectral thematic mapper images

The goal of data compression is to find shorter representa- tions for any given data. In a data storage application, this is done in order to save storage space on an auxiliary device or, in the case of a communication scenario, to increase channel throughput. Because re- motely sensed data require tremendous amounts of transmission and storage space, it is essential to find good algorithms that utilize the spa- tial and spectral characteristics of these data to compress them. A new technique is presented that uses a spectral and spatial correlation to create orderly data for the compression of multispectral remote sensing data, such as those acquired by the Landsat Thematic Mapper (TM) sensor system. The method described simply compresses one of the bands using the standard Joint Photographic Expert Group (JPEG) com- pression, and then orders the next band’s data with respect to the pre- vious sorting permutation. Then, the move-to-front coding technique is used to lower the source entropy before actually encoding the data. Ow- ing to the correlation between visible bands of TM images, it was ob- served that this method yields tremendous gain on these bands (on an average 0.3 to 0.5 bits/pixel compared with lossless JPEG) and can be successfully used for multispectral images where the spectral distances between bands are close

Adaptive multispectral GPU accelerated architecture for Earth Observation satellites

In recent years the growth in quantity, diversity and capability of Earth Observation (EO) satellites, has enabled increase’s in the achievable payload data dimensionality and volume. However, the lack of equivalent advancement in downlink technology has resulted in the development of an onboard data bottleneck. This bottleneck must be alleviated in order for EO satellites to continue to efficiently provide high quality and increasing quantities of payload data. This research explores the selection and implementation of state-of-the-art multidimensional image compression algorithms and proposes a new onboard data processing architecture, to help alleviate the bottleneck and increase the data throughput of the platform. The proposed new system is based upon a backplane architecture to provide scalability with different satellite platform sizes and varying mission’s objectives. The heterogeneous nature of the architecture allows benefits of both Field Programmable Gate Array (FPGA) and Graphical Processing Unit (GPU) hardware to be leveraged for maximised data processing throughput

Lossless compression of hyperspectral images

Band ordering and the prediction scheme are the two major aspects of hyperspectral imaging which have been studied to improve the performance of the compression system. In the prediction module, we propose spatio-spectral prediction methods. Two non-linear spectral prediction methods have been proposed in this thesis. NPHI (Non-linear Prediction for Hyperspectral Images) is based on a band look-ahead technique wherein a reference band is included in the prediction of pixels in the current band. The prediction technique estimates the variation between the contexts of the two bands to modify the weights computed in the reference band to predict the pixels in the current band. EPHI (Edge-based Prediction for Hyperspectral Images) is the modified NPHI technique wherein an edge-based analysis is used to classify the pixels into edges and non-edges in order to perform the prediction of the pixel in the current band. Three ordering methods have been proposed in this thesis. The first ordering method computes the local and global features in each band to group the bands. The bands in each group are ordered by estimating the compression ratios achieved between the entire band in the group and then ordering them using Kruskal\u27s algorithm. The other two methods of ordering compute the compression ratios between b-neighbors in performing the band ordering

High-Level Synthesis of a Single/Multi-Band Optical and SAR Image Compression and Encryption Hardware Accelerator

Transmitting images from earth observation satellites to ground is a major challenge, and a compression/encryption stage is actually mandatory. Development of hardware accelerators is highly recommended, both to relieve the software from such demanding task, and to improve performance, aiming at quasi-real-time data processing. To this end, we discuss the design, development, deployment and test of a FPGA-based accelerator, featuring a lossless and lossy (near-lossless) compression, including the data encryption too. Its architecture is well suited for different image types, including single- and multi-band optical and SAR images and can be fully run-time configurable. Measured performance showed a throughput of 10 Msamples/s, in agreement with related state-of-the-art works, focused on lossless compression only

Multiband and Lossless Compression of Hyperspectral Images

Hyperspectral images are widely used in several real-life applications. In this paper, we investigate on the compression of hyperspectral images by considering different aspects, including the optimization of the computational complexity in order to allow implementations on limited hardware (i.e., hyperspectral sensors, etc.). We present an approach that relies on a three-dimensional predictive structure. Our predictive structure, 3D-MBLP, uses one or more previous bands as references to exploit the redundancies among the third dimension. The achieved results are comparable, and often better, with respect to the other state-of-art lossless compression techniques for hyperspectral images

The 1995 Science Information Management and Data Compression Workshop

This document is the proceedings from the 'Science Information Management and Data Compression Workshop,' which was held on October 26-27, 1995, at the NASA Goddard Space Flight Center, Greenbelt, Maryland. The Workshop explored promising computational approaches for handling the collection, ingestion, archival, and retrieval of large quantities of data in future Earth and space science missions. It consisted of fourteen presentations covering a range of information management and data compression approaches that are being or have been integrated into actual or prototypical Earth or space science data information systems, or that hold promise for such an application. The Workshop was organized by James C. Tilton and Robert F. Cromp of the NASA Goddard Space Flight Center

Approximate trigonometric expansions with applications to signal decomposition and coding

Signal representation and data coding for multi-dimensional signals have recently received considerable attention due to their importance to several modern technologies. Many useful contributions have been reported that employ wavelets and transform methods. For signal representation, it is always desired that a signal be represented using minimum number of parameters. The transform efficiency and ease of its implementation are to a large extent mutually incompatible. If a stationary process is not periodic, then the coefficients of its Fourier expansion are not uncorrelated. With the exception of periodic signals the expansion of such a process as a superposition of exponentials, particularly in the study of linear systems, needs no elaboration. In this research, stationary and non-periodic signals are represented using approximate trigonometric expansions. These expansions have a user-defined parameter which can be used for making the transformation a signal decomposition tool. It is shown that fast implementation of these expansions is possible using wavelets. These approximate trigonometric expansions are applied to multidimensional signals in a constrained environment where dominant coefficients of the expansion are retained and insignificant ones are set to zero. The signal is then reconstructed using these limited set of coefficients, thus leading to compression. Sample results for representing multidimensional signals are given to illustrate the efficiency of the proposed method. It is verified that for a given number of coefficients, the proposed technique yields higher signal to noise ratio than conventional techniques employing the discrete cosine transform technique

Data compression in remote sensing applications

A survey of current data compression techniques which are being used to reduce the amount of data in remote sensing applications is provided. The survey aspect is far from complete, reflecting the substantial activity in this area. The purpose of the survey is more to exemplify the different approaches being taken rather than to provide an exhaustive list of the various proposed approaches