فشرده سازی تصاویر ابرطیفی با استفاده از برازش خم، بازه‌بندی و هموارسازی

تصاویر ابرطیفی به دلیل اکتساب همزمان داده ها در بیش از صدها باند طیفی باریک و نزدیک به هم ، همبستگی بین باندی و حجم بسیار بالایی دارند لذا نیاز به فشرده سازی دارند. یکی از روشهای با اتلاف روش مبتنی بر برازش خم است که از امضای طیفی تصویر به جهت کاهش ویژگی استفاده می کند و نتایج بسیار خوبی را در مقابل با روش های قبلی مانند pca به همراه داشته است، اما در فشرده سازی با استفاده از این روش، منحنی امضای طیفی تقریب زده شده در برخی نقاط دارای اعوجاج است که در این مقاله سعی شده تا با استفاده از پیدا کردن نقاط دارای اعوجاج و بازه بندی امضای طیفی و برازش خم روی هر بازه و یا استفاده از یک فیلتر هموار ساز savitsky–golay و یا با ترکیب هر دو پیشنهاد، اعوجاج را از بین برده و نیز میزان psnr را افزایش داد تا کیفیت تصویر باز یابی شده به تصویر اصلی خیلی نزدیک گردد.

hyperspectral data compression by using subintervals curve fitting, and smoothing filter

hyperspectral images due to simultaneous acquisition of data in more than hundreds narrow and close spectral bands, have a very high correlation bandwidth. hence, in order to store in less storage space, higher transmission speed and less bandwidth, they need compression. various lossless and lossy methods for compression are exist, that can be in the spatial domain or in the spectrum domain. but, regard to the importance of spectral information of hyperspectral images in remote sensing, this compression should be done by this condition that the spectral information of this kind of images is well preserved. compression methods can be based on either the predictive function or using of a codebook, to compress information. data compression can also be done based on transformation coding, which these transformations can be cosine functions (dcts), wavelet functions (dwts), or principal component analysis (pcas). of course, pca-based compression is one of the most effective ways to eliminate image correlations and reduce their volume. another extension is the method of using curve fitting, which is applied exclusively to compress hyperspectral images due to its effect on the image spectrum. this method uses the spectral signature of the each pixel of image to reduce the feature by finding the closest approximation function to express the curve and storing its coefficients as a new feature for reconstruction compressed data. by replacing these coefficients in the equation of approximation, spectrum reflection curve for each pixel can be reconstructed. this method has very good results in comparison with previous methods such as pca, but in compression using this method, the src curve has been approximated in some points with distortion. in this paper, we tried to eliminate these distortions, by finding points which have distortion and breakdown the scr. on the other hand, by using the savitsky-golay smoothing filter we can also reduce distortion and increase the psnr. another way to eliminate or reduce this distortion described in this article is as follow: at the first the spectral signature of each pixel of the intended data is smoothed by a savitsky-golay smoothing filter and then by using a particular method is divided into adjoining adjacent spaces and then a curve is plotted for each slice of data. by choosing the best degree and window length for smoothing and selecting the best degree of numerator and denominator of function, the coefficients of the selected rational function are considered as new features of the image. by using the proposed method, in addition to eliminating the distortion, the psnr level is became much higher and the reconstructed image quality is very close to the original image.