Target-driven selection of lossy hyperspectral image compression ratios

Field-programmable gate arrays (FPGAs) offer promising tools for real-time on-board hyperspectral image (HSI) processing due to its higher computational speed and better reconfigurability. In this paper, the spectral matching target detection algorithm, namely adaptive coherence estimator (ACE), is implemented based on FPGA. The flow background statistics are used to calculate the background covariance matrix, and the Sherman-Morrison method is further used to process the covariance matrix inversion. The finally calculated results should separate targets from the whole pixels by a selected threshold. Evaluation of several hyperspectral data shows that the system has a higher speed than the traditional 3.60GHz CPU (about 77.74 times) without losing accuracy.

Target detection is a key issue in processing hyperspectral images (HSIs). Spectral-identification-based algorithms are sensitive to spectral variability and noise in acquisition. In most cases, both the target spatial distributions and the spectral signatures are unknown, so each pixel is separately tested and appears as a target when it significantly differs from the background. In this paper, we propose two algorithms to improve the signal-to-noise ratio (SNR) of hyperspectral data, leading to detectors that are robust to noise. These algorithms consist in integrating adaptive spatial/spectral filtering into the adaptive matched filter and adaptive coherence estimator. Considering the HSIs as tensor data, our approach introduces a data representation involving multidimensional processing. It combines the advantages of spatial and spectral information using an alternating least square algorithm. To estimate the signal subspace dimension in each spatial mode, we extend the Akaike information criterion, and we develop an iterative algorithm for spectral-mode rank estimation. We demonstrate the interest of integrating the quadtree decomposition to perform an adaptive 3-D filtering and thereby preserve the local image characteristics. This leads to a significant improvement in terms of denoised tensor SNR and, consequently, in terms of detection probability. The performance of our method is exemplified using simulated and real-world HYperspectral Digital Imagery Collection Experiment images.

Hyperspectral sensors are able to provide information that is useful for many different applications. However, the huge amounts of data collected by these sensors are not exempt of drawbacks, especially in remote sensing environments where the hyperspectral images are collected on-board satellites and need to be transferred to the earth’s surface. In this situation, an efficient compression of the hyperspectral images is mandatory in order to save bandwidth and storage space. Lossless compression algorithms have been traditionally preferred, in order to preserve all the information present in the hyperspectral cube for scientific purposes, despite their limited compression ratio. Nevertheless, the increment in the data-rate of the new-generation sensors is making more critical the necessity of obtaining higher compression ratios, making it necessary to use lossy compression techniques. A new transform-based lossy compression algorithm, namely Lossy Compression Algorithm for Hyperspectral Image Systems (HyperLCA), is proposed in this manuscript. This compressor has been developed for achieving high compression ratios with a good compression performance at a reasonable computational burden. An extensive amount of experiments have been performed in order to evaluate the goodness of the proposed HyperLCA compressor using different calibrated and uncalibrated hyperspectral images from the AVIRIS and Hyperion sensors. The results provided by the proposed HyperLCA compressor have been evaluated and compared against those produced by the most relevant state-of-the-art compression solutions. The theoretical and experimental evidence indicates that the proposed algorithm represents an excellent option for lossy compressing hyperspectral images, especially for applications where the available computational resources are limited, such as on-board scenarios.

Target detection (TD) is a major task in hyperspectral image (HSI) processing which, due to the high spectral resolution, requires dealing with the curse of dimensionality. The integrated feature extraction and selection is a well-known solution for dimensionality reduction of HSIs. In this study, a new method is presented to improve the performance of TD algorithms based on principal component analysis (PCA) feature space. In this method, using the implantation of the target spectrum (TS) in the HSI and following the simulated targets in the PCA feature space, the best principal components (PCs) are selected. Then, using the mixing and unmixing coefficients of the PCs, a new TS and a new image in the PCA feature space are created. Afterwards, using the new spectrum of the target, the TD algorithm is run on the new HSI. The performance of the proposed method is compared to nine counterpart algorithms on Hymap and Hyperion HSI. All the comparisons are performed using adaptive coherence estimator (ACE) TD algorithm. Experimental results illustrate that the proposed method, compared to its counterparts, yields superior performance based on the false alarm rate (FAR) measure. It gives an average FAR value of about 16, which is approximately 9% better than that of its best counterparts.

<p>The projection into 2030 of the climate data volume increase brings an important challenge to the climate science community. This is particularly true for the CMIP7 that is projected to need about an Exabyte of storage capacity. Error-bounded lossy compression is explored as a potential solution to the above problem by different climate research teams. Several lossy compression schemes have been proposed leveraging different forms of decorrelation (transforms, prediction, HoSVD, DNN), quantization (linear, non-linear, vector), and encoding (dictionary-based, variable length, etc.) algorithms. Our experience with different applications shows that the compression methods often need to be customized and optimized to fit the specificities of the datasets to compress and the user requirements on the compression quality, ratio, and throughput. However, none of the existing lossy compression software for scientific data has been designed to be customizable. To address this issue, we developed SZ3, an innovative customizable, modular compression framework. SZ3 is a full C++ refactoring of SZ2 enabling the specialization, addition, or removal of each stage of the lossy compression pipeline to fit the specific characteristics of the datasets to compress and the use-case requirements. This extreme flexibility allows adapting SZ3 to many different use-cases, from ultra-high compression for visualization to ultra-high-speed compression between the CPU (or GPU) and the memory. Thanks to its unique set of features: customization, high compression ratio, high compression throughput, and excellent accuracy preservation, SZ3 won a 2021 R&D100 award. In this presentation, we present SZ3 and a new data prediction-based decorrelation method that significantly improves the compression ratios for climate datasets over the state-of-the-art lossy compressors, while preserving the same data accuracy. Experiments based on CESM datasets show that SZ3 can lead to up to 300% higher compression ratios than SZ2 with the same compression error bound and similar compression throughput.</p>

To review the literature on lossy compression in dental radiography and to discuss the importance and suitability of the methodology used for evaluation of image compression. A search of Medline (from 1966 to October 2004) was undertaken with the search expression "(Radiography, dental) and compression". Inclusion criterion was that the reference should be evaluating the effect of lossy image compression on diagnostic accuracy. For all included studies, information in relation to mode of image acquisition, image content, image compression, image display, and method of image evaluation was extracted. 12 out of 32 papers were included in the review. The design of these 12 studies was found to vary considerably. Parameters used to express the degree of information loss (DIL) were either or both compression ratio (CR) and compression level (CL). The highest acceptable CR reported in the studies ranged from 3.6% to 15.4%. Furthermore, different CR values were proposed even for the same diagnostic task, for example, for caries diagnosis CR ranged from 6.2% to 11.1%. Lossy image compression can be used in clinical radiology if it does not conflict with national law. However, the acceptable DIL is difficult to express and standardize. CR is probably not suitable to express DIL, because it is image content dependent. CL is also probably not suitable to express DIL because of the lack of compression software standardization.

Hyperspectral image compression has become increasingly important in data exploitation because of enormous data volumes and high redundancy provided by hundreds of contiguous spectral channels. Since a hyperspectral image can be viewed as a 3-dimensional (3D) image cube, many efforts have been devoted to extending 2D image compression techniques to perform 3D image compression on hyperspectral image cubes. Unfortunately, some major issues generally encountered in hyperspectral data exploitation at low or very low-bit rate compression, for example, subpixels and mixed pixels which do not occur in traditional pure pixel-based image compression are often overlooked in such a 2D-to-3D compression. Accordingly, a direct application of 2D-to-3D compression techniques to hyperspectral image cubes without taking precaution may result in significant loss of crucial spectral information provided by subtle substances such as small objects, anomalies during low bit-rate lossy compression. This paper takes a rather different view by investigating lossy hyperspectral compression from a perspective of exploring spectral information, referred to as exploitation-based lossy compression and further develops spectral/spatial hyperspectral image compression to effectively preserve crucial and vital spectral information of objects which are generally missed by commonly used mean-squared error (MSE) or signal-to-noise ratio (SNR)-based compression techniques when lossy compression is performed at low bit rates. In order to demonstrate advantages of the proposed spectral/spatial compression approach applications of subpixel target detection and mixed pixel analysis are used for experiments for performance evaluation.

Convolution Neural Network based lossy compression of hyperspectral images

Hyperspectral (HS) images (HSI) provide a vast amount of spatial and spectral information based on the high dimensionality of the pixels in a wide range of wavelengths. A HS image usually requires massive storage capacity, which demands high compression rates to save space with preservation of data integrity. HS image can be deemed as three dimensional data cube where different wavelengths (W) form the third dimension along with X and Y dimensions. To get a better compression result, spatial redundancy of HS images can be exploited using different coders along X, Y, or W direction. This article focuses on taking maximum advantage of HS images redundancy by rearranging HS image into different 3D data cubes and proposes a directionlet based compression scheme constituted the optimal compression plane (OCP) for adaptive best approximation of geometric matrix. The OCP, calculated by the spectral correlation, is used to the prediction and determination of which reconstructed plane can reach higher compression rates while minimizing data loss of hyperspectral data. Moreover, we also rearrange the 3D data cube into different 2D image planes and investigate the compression ratio using different coders. The schema can be used for both lossless and lossy compression. Our experimental results show that the new framework optimizes the performance of the compression using a number of coding methods (inclusive of lossless/lossy HEVC, motion JPEG, JPG2K, and JPEG) for HSIs with different visual content.KeywordsHyperspectral imageslossless compressionoptimal compression plane (OCP)

Target detection is one of the most important applications utilizing the rich spectral information from hyperspectral imaging systems. Data fusion algorithms applied on hyperspectral datasets address the inherent spatial-spectral resolution tradeoff in these imaging systems by combining spectral information from hyperspectral data with spatial information from hi-res panchromatic or multispectral images (e.g., hi-res RGB). This paper presents the first attempt at using an iterative target implantation technique as a modification to Wald's protocol to assess the performance of data fusion algorithms in target detection tasks. More specifically, this paper looks at how the sharpening process localizes and discriminates the subpixel target from its background, and characterizes an image-wide detectability of any single subpixel target independent of location in the image. We used NNDi use as our pansharpener to perform HRPAN+LRHSI data fusion and the adaptive coherence estimator (ACE) as our target detector. Results show that our methodology is effective at assessing (1) how the sharpening process enhances target-background separability within any 5x5 window anywhere on the image and (2) how the sharpening process enhances the detectability of a single subpixel target over the entire hyperspectral image.

Detecting and identifying targets or objects that are present inhyperspectral ground images are of great interest. Applicationsinclude land and environmental monitoring, mining, military, civilsearch-and-rescue operations, and so on. We propose and analyze anextremely simple and efficient idea for template matching based on$l_1$ minimization. The designed algorithm can be applied inhyperspectral classification and target detection. Synthetic imagedata and real hyperspectral image (HSI) data are used to assess theperformance, with comparisons to other approaches, e.g. spectralangle map (SAM), adaptive coherence estimator (ACE),generalized-likelihood ratio test (GLRT) and matched filter. Wedemonstrate that this algorithm achieves excellent results with bothhigh speed and accuracy by using Bregman iteration.

A paradigm shift in modern-day warfare, spectral designing and signature management has gained prominence in the defence industry. From a target detection perspective, various national military establishments are making efforts to develop sensors, signature management, and survivability of their own military platforms. Most targets of strategic importance are found camouflaged in tactical environments. Hyperspectral imaging (HSI) is increasingly used in defence applications at various information levels. Acquisition of spectral signatures of adversaries and discriminating between actual and decoy targets is vital for deployment in meeting time-sensitive intelligence needs. We have developed a novel spectral target detection approach, integrating radiative transfer modelling (RTM), a non-linear spectral mixture model, and a reference spectral library database, to discriminate real and decoy targets of military interest. We acquired spectral signatures of various strategically important artificial as well as natural materials and developed a forward spectral mixture modelling based approach to engineer spectral signatures, which we name the primary decoy signature database (PDSD), conforming to real landscapes. The spatial variability and environmental interference of all the targets are modelled with respect to geometric and atmospheric conditions using RTM. The proposed approach is experimentally implemented for target detection in a HySIS hyperspectral satellite imagery acquired over defence terrain in the Indo-China Himalayan region, conforming to various scenarios of target-material optical perspective. The results suggest operational promise of spectral signature design and engineering for differentiating real and decoy targets using HSI.

The ability to accurately detect a target of interest in a hyperspectral imagery (HSI) is largely dependent on the spatial and spectral resolution. While hyperspectral imaging provides high spectral resolution, the spatial resolution is mostly dependent on the optics and distance from the target. Many times the target of interest does not occupy a full pixel and thus is concealed within a pixel, i.e. the target signature is mixed with other constituent material signatures within the field of view of that pixel. Extraction of spectral signatures of constituent materials from a mixed pixel can assist in the detection of the target of interest. Hyperspectral unmixing is a process to identify the constituent materials and estimate the corresponding abundances from the mixture. In this paper, a framework based on non-negative matrix factorization (NMF) is presented, which is utilized to extract the spectral signature and fractional abundance of human skin in a scene. The NMF technique is employed in a supervised manner such that the spectral bases of each constituent are computed first, and then these bases are applied to the mixed pixel. Experiments using synthetic and real data demonstrate that the proposed algorithm provides an effective supervised technique for hyperspectral unmixing of skin signatures.

Pan-sharpening - fusing the spatial and spectral information between panchromatic (PAN) and multispectral (MSI) or hyperspectral (HSI) imagery of a common scene is a hot topic in remote sensing due to a wide range of applications such as target detection, vegetation monitoring, and subsurface detection (e.g. landmines), among others. However, the focus of panchromatic sharpening is generally placed on visual quality of the resulting image and image-wide summary spectral accuracy metrics. Here we are interested in radiometrically accurate panchromatic sharpening of hyperspectral imagery with particular emphasis on spectral algorithm performance. Four pansharpening algorithms are applied to hyperspectral imagery and evaluated for spectral/radiometric fidelity. Two datasets from SHARE2012 were used: one which features rural scene elements and one which features an urban scene. Target detection was also performed to evaluate algorithm sharpening performance. We find that although visually the performance of the four algorithms were roughly similar, they differ in spectral/radiometric fidelity as well as performance in ACE target detection.

Lossy compression of hyperspectral and ultraspectral images is traditionally performed using 3D transform coding. This approach yields good performance, but the complexity and memory requirements make it unsuitable for onboard compression. In this paper we propose a low-complexity lossy compression scheme based on prediction, quantization and rate-distortion optimization. The scheme employs coset codes coupled with the newconcept of “informed quantization”, and requires no entropy coding. The performance of the resulting algorithm is competitive with that of state-of-the-art 3D transform coding schemes, but the complexity is immensely lower, making it suitable for onboard compression at high throughputs.