Recursive Least Squares for Near-Lossless Hyperspectral Data Compression

نویسندگان

چکیده

The hyperspectral image compression scheme is a trade-off between the limited hardware resources of on-board platform and ever-growing resolution optical instruments. Predictive coding attracts researchers due to its low computational complexity moderate memory requirements. We propose near-lossless prediction-based that removes spatial spectral redundant information, thereby significantly reducing size images. This predicts target pixel’s value via linear combination previous pixels. weight matrix predictor iteratively updated using recursive least squares filter with loop quantizer. optimal number bands for prediction was analyzed experimentally. results indicate proposed outperforms state-of-the-art methods in terms ratio quality retrieval.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A lossless compression algorithm for hyperspectral data

In this paper, which is an expository account of a lossless compression techniques that have been developed over the course of a sequence of papers and talks, we have sought to identify and bring out the key features of our approach to the efficient compression of hyperspectral satellite data. In particular we provide the motivation for using our approach, which combines the advantages of a clu...

متن کامل

Spectral DPCM for Lossless Compression of 3D Hyperspectral Sounding Data

A spectral linear prediction compression scheme for lossless compression of hyperspectral images is proposed in this paper. Since hyperspectral images have a great deal of correlation from band to band, spectral linear prediction algorithm, which utilizes information from several bands, is very efficient for compression purposes. The proposed algorithm is compared to JPEG-LS and CALIC encoding ...

متن کامل

Lossless Data Compression for Infrared Hyperspectral Sounders - An Overview

Hyperspectral sounding data requires accuracy for useful retrieval of atmospheric temperature, moisture, trace gases, clouds, aerosols and surface properties. Therefore, compression of hyperspectral sounding data is better to be lossless or near lossless. Given the large volume of three-dimensional hyperspectral data that will be generated by the hyperspectral sounders such as AIRS, CrIS, IASI,...

متن کامل

Kernel Recursive Least Squares

We present a non-linear kernel-based version of the Recursive Least Squares (RLS) algorithm. Our Kernel-RLS algorithm performs linear regression in the feature space induced by a Mercer kernel, and can therefore be used to recursively construct the minimum meansquared-error regressor. Sparsity (and therefore regularization) of the solution is achieved by an explicit greedy sparsification proces...

متن کامل

Recursive Least Squares Estimation

We start with estimation of a constant based on several noisy measurements. Suppose we have a resistor but do not know its resistance. So we measure it several times using a cheap (and noisy) multimeter. How do we come up with a good estimate of the resistance based on these noisy measurements? More formally, suppose x = (x1, x2, . . . , xn) T is a constant but unknown vector, and y = (y1, y2, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied sciences

سال: 2022

ISSN: ['2076-3417']

DOI: https://doi.org/10.3390/app12147172