Hyperspectral image compression using hybrid transform with different wavelet-based transform coding

2019 ◽  
Vol 18 (01) ◽  
pp. 1941008 ◽  
Author(s):  
R. Nagendran ◽  
A. Vasuki
Keyword(s):  
Spatial Data ◽  
Hyperspectral Image ◽  
Spatial Dimension ◽  
Image Resolution ◽  
Hyperspectral Images ◽  
Experimental Result ◽  
Spectral Bands ◽  
Karhunen Loeve Transform ◽  
Hyperspectral Image Compression ◽  
Integer Wavelet

Hyperspectral image resolution offers limited spectral bands within a continual spectral spectrum, creating one of the spectra of most pixels inside the sequence which contains huge volume of data. Data transmission and storage is a challenging task. Compression of hyperspectral images are inevitable. This work proposes a Hyperspectral Image (HSI) compression using Hybrid Transform. First the HSI is decomposed into 1D and it is clustered and tiled. Each cluster is applied with Integer Karhunen–Loeve Transform (IKLT) and as such it is applied for whole image to get IKLT bands in spectral dimension. Then IKLT bands are applied with Integer Wavelet Transform (IDWT) to decorrelate the spatial data in spatial dimension. The combination of IKLT and IDWT is known as Hybrid transform. Second, the decorrelated wavelet coefficients are applied to Spatial-oriention Tree Wavelet (STW), Wavelet Difference Reduction (WDR) and Adaptively Scanned Wavelet Difference Reduction (ASWDR). The experimental result shows STW algorithm using Hybrid Transform gives better PSNR (db) and bits per pixel per band (bpppb) for hyperspectral images. The comparison between STW, WDR and ASWDR with Hybrid Transform for Indian Pines, Salinas, Botswana, Botswana and KSC images is experimented.

Evaluating the Potential of Clonal Selection Optimization Algorithm to Hyperspectral Image Feature Selection

2012 ◽  
Vol 500 ◽  
pp. 799-805 ◽  
Author(s):  
Farhad Samadzadegan ◽  
Shahin Rahmatollahi Namin ◽  
Mohammad Ali Rajabi
Keyword(s):  
Feature Selection ◽  
Optimization Algorithm ◽  
Hyperspectral Image ◽  
Clonal Selection ◽  
Fitness Function ◽  
Hyperspectral Images ◽  
Image Feature ◽  
Spectral Bands ◽  
Selection Algorithms ◽  
Selection Of

The great number of captured near spectral bands in hyperspectral images causes the curse of dimensionality problem and results in low classification accuracy. The feature selection algorithms try to overcome this problem by limiting the input space dimensions of classification for hyperspectral images. In this paper, immune clonal selection optimization algorithm is used for feature selection. Also one of the fastest Artificial Immune classification algorithms is used to compute fitness function of the feature selection. The comparison of the feature selection results with genetic algorithm shows the clonal selection’s higher performance to solve selection of features.

Fast Hyperspectral Image Encoder Based on Supervised Multimodal Scheme

2020 ◽  
pp. 2150007
Author(s):  
Leila Akrour ◽  
Soltane Ameur ◽  
Mourad Lahdir ◽  
Régis Fournier ◽  
Amine Nait Ali
Keyword(s):  
Wavelet Transform ◽  
Hyperspectral Image ◽  
Rate Distortion ◽  
Image Data ◽  
Hyperspectral Images ◽  
High Dimensional ◽  
3D Wavelet Transform ◽  
Data Volume ◽  
Hyperspectral Image Compression ◽  
Multimodal Method

Many compression methods, lossy or lossless, were developed for 3D hyperspectral images, and various standards have emerged and applied to these amounts of data in order to achieve the best rate-distortion performance. However, high-dimensional data volume of hyperspectal images is problematic for compression and decompression time. Nowadays, fast compression and especially fast decompression algorithms are of primary importance in image data applications. In this case, we present a lossy hyperspectral image compression based on supervised multimodal scheme in order to improve the compression results. The supervised multimodal method is used to reduce the amount of data before their compression with the 3D-SPIHT encoder based on 3D wavelet transform. The performance of the Supervised Multimodal Compression (SMC-3D-SPIHT encoder) has been evaluated on AVIRIS hyperspectral images. Experimental results indicate that the proposed algorithm provides very promising performance at low bit-rates while reducing the encoding/decoding time.

scholarly journals Unsupervised Clustering for Hyperspectral Images

Symmetry ◽  
2020 ◽  
Vol 12 (2) ◽  
pp. 277 ◽  
Author(s):  
Laura Bilius ◽  
Stefan Pentiuc
Keyword(s):  
Hyperspectral Image ◽  
Hyperspectral Data ◽  
Hyperspectral Images ◽  
Data Sets ◽  
Hyperspectral Image Classification ◽  
Spectral Bands ◽  
Long Time ◽  
Parafac Decomposition ◽  
Classification Time

Hyperspectral images are becoming a valuable tool much used in agriculture, mineralogy, and so on. The challenge is to successfully classify the materials founded in the field relevant for different applications. Due to a large amount of data corresponding to a big number of spectral bands, the classification programs require a long time to analyze and classify the data. The purpose is to find a better method for reducing the classification time. We exploit various algorithms on real hyperspectral data sets to find out which algorithm is more effective. This paper presents a comparison of unsupervised hyperspectral image classification such as K-means, Hierarchical clustering, and Parafac decomposition, which allows the performance of the model reduction and feature extraction. The results showed that the method useful for big data is the classification of data after Parafac Decomposition.

scholarly journals Weighted Group Sparsity-Constrained Tensor Factorization for Hyperspectral Unmixing

2022 ◽  
Vol 14 (2) ◽  
pp. 383
Author(s):  
Xinxi Feng ◽  
Le Han ◽  
Le Dong
Keyword(s):  
Hyperspectral Image ◽  
Spatial Dimension ◽  
Tensor Factorization ◽  
Group Sparsity ◽  
Sparse Regularization ◽  
Hyperspectral Unmixing ◽  
Spectral Bands ◽  
Alternating Direction ◽  
Tv Regularization ◽  
Mixed Pixels

Recently, unmixing methods based on nonnegative tensor factorization have played an important role in the decomposition of hyperspectral mixed pixels. According to the spatial prior knowledge, there are many regularizations designed to improve the performance of unmixing algorithms, such as the total variation (TV) regularization. However, these methods mostly ignore the similar characteristics among different spectral bands. To solve this problem, this paper proposes a group sparse regularization that uses the weighted constraint of the L2,1 norm, which can not only explore the similar characteristics of the hyperspectral image in the spectral dimension, but also keep the data smooth characteristics in the spatial dimension. In summary, a non-negative tensor factorization framework based on weighted group sparsity constraint is proposed for hyperspectral images. In addition, an effective alternating direction method of multipliers (ADMM) algorithm is used to solve the algorithm proposed in this paper. Compared with the existing popular methods, experiments conducted on three real datasets fully demonstrate the effectiveness and advancement of the proposed method.

scholarly journals Large-scale hyperspectral image compression via sparse representations based on online learning

2018 ◽  
Vol 28 (1) ◽  
pp. 197-207 ◽  
Author(s):  
İrem Ülkü ◽  
Ersin Kizgut
Keyword(s):  
Large Scale ◽  
Hyperspectral Image ◽  
Optimization Algorithms ◽  
Hyperspectral Images ◽  
Learning Method ◽  
Compression Performance ◽  
Online Dictionary Learning ◽  
The One ◽  
Hyperspectral Image Compression ◽  
First Time

AbstractIn this study, proximity based optimization algorithms are used for lossy compression of hyperspectral images that are inherently large scale. This is the first time that such proximity based optimization algorithms are implemented with an online dictionary learning method. Compression performances are compared with the one obtained by various sparse representation algorithms. As a result, proximity based optimization algorithms are listed among the three best ones in terms of compression performance values for all hyperspectral images. Additionally, the applicability of anomaly detection is tested on the reconstructed images.

scholarly journals A 3D-2D Convolutional Neural Network and Transfer Learning for Hyperspectral Image Classification

2021 ◽  
Vol 2021 ◽  
pp. 1-19
Author(s):  
Douglas Omwenga Nyabuga ◽  
Jinling Song ◽  
Guohua Liu ◽  
Michael Adjeisah
Keyword(s):  
Neural Network ◽  
Convolutional Neural Network ◽  
Image Classification ◽  
Transfer Learning ◽  
Spatial Data ◽  
Spatial Information ◽  
Hyperspectral Image ◽  
Experimental Result ◽  
Computational Time ◽  
Hyperspectral Image Classification

As one of the fast evolution of remote sensing and spectral imagery techniques, hyperspectral image (HSI) classification has attracted considerable attention in various fields, including land survey, resource monitoring, and among others. Nonetheless, due to a lack of distinctiveness in the hyperspectral pixels of separate classes, there is a recurrent inseparability obstacle in the primary space. Additionally, an open challenge stems from examining efficient techniques that can speedily classify and interpret the spectral-spatial data bands within a more precise computational time. Hence, in this work, we propose a 3D-2D convolutional neural network and transfer learning model where the early layers of the model exploit 3D convolutions to modeling spectral-spatial information. On top of it are 2D convolutional layers to handle semantic abstraction mainly. Toward simplicity and a highly modularized network for image classification, we leverage the ResNeXt-50 block for our model. Furthermore, improving the separability among classes and balance of the interclass and intraclass criteria, we engaged principal component analysis (PCA) for the best orthogonal vectors for representing information from HSIs before feeding to the network. The experimental result shows that our model can efficiently improve the hyperspectral imagery classification, including an instantaneous representation of the spectral-spatial information. Our model evaluation on five publicly available hyperspectral datasets, Indian Pines (IP), Pavia University Scene (PU), Salinas Scene (SA), Botswana (BS), and Kennedy Space Center (KSC), was performed with a high classification accuracy of 99.85%, 99.98%, 100%, 99.82%, and 99.71%, respectively. Quantitative results demonstrated that it outperformed several state-of-the-arts (SOTA), deep neural network-based approaches, and standard classifiers. Thus, it has provided more insight into hyperspectral image classification.

scholarly journals Performance Impact of Parameter Tuning on the CCSDS-123.0-B-2 Low-Complexity Lossless and Near-Lossless Multispectral and Hyperspectral Image Compression Standard

2019 ◽  
Vol 11 (11) ◽  
pp. 1390 ◽  
Author(s):  
Ian Blanes ◽  
Aaron Kiely ◽  
Miguel Hernández-Cabronero ◽  
Joan Serra-Sagristà
Keyword(s):  
Image Compression ◽  
Hyperspectral Image ◽  
Lossless Compression ◽  
Parameter Tuning ◽  
Low Complexity ◽  
Performance Impact ◽  
Depth Level ◽  
Spectral Bands ◽  
Image Characteristics ◽  
Hyperspectral Image Compression

This article studies the performance impact related to different parameter choices for the new CCSDS-123.0-B-2 Low-Complexity Lossless and Near-Lossless Multispectral and Hyperspectral Image Compression standard. This standard supersedes CCSDS-123.0-B-1 and extends it by incorporating a new near-lossless compression capability, as well as other new features. This article studies the coding performance impact of different choices for the principal parameters of the new extensions, in addition to reviewing related parameter choices for existing features. Experimental results include data from 16 different instruments with varying detector types, image dimensions, number of spectral bands, bit depth, level of noise, level of calibration, and other image characteristics. Guidelines are provided on how to adjust the parameters in relation to their coding performance impact.

scholarly journals Cluster-Wise Weighted NMF for Hyperspectral Images Unmixing with Imbalanced Data

2021 ◽  
Vol 13 (2) ◽  
pp. 268
Author(s):  
Xiaochen Lv ◽  
Wenhong Wang ◽  
Hongfu Liu
Keyword(s):  
Spatial Information ◽  
Hyperspectral Image ◽  
Imbalanced Data ◽  
Reconstruction Error ◽  
Hyperspectral Data ◽  
Weight Matrix ◽  
Hyperspectral Images ◽  
Mixed Data ◽  
Sparsity Constraints ◽  
Additional Constraints

Hyperspectral unmixing is an important technique for analyzing remote sensing images which aims to obtain a collection of endmembers and their corresponding abundances. In recent years, non-negative matrix factorization (NMF) has received extensive attention due to its good adaptability for mixed data with different degrees. The majority of existing NMF-based unmixing methods are developed by incorporating additional constraints into the standard NMF based on the spectral and spatial information of hyperspectral images. However, they neglect to exploit the nature of imbalanced pixels included in the data, which may cause the pixels mixed with imbalanced endmembers to be ignored, and thus the imbalanced endmembers generally cannot be accurately estimated due to the statistical property of NMF. To exploit the information of imbalanced samples in hyperspectral data during the unmixing procedure, in this paper, a cluster-wise weighted NMF (CW-NMF) method for the unmixing of hyperspectral images with imbalanced data is proposed. Specifically, based on the result of clustering conducted on the hyperspectral image, we construct a weight matrix and introduce it into the model of standard NMF. The proposed weight matrix can provide an appropriate weight value to the reconstruction error between each original pixel and the reconstructed pixel in the unmixing procedure. In this way, the adverse effect of imbalanced samples on the statistical accuracy of NMF is expected to be reduced by assigning larger weight values to the pixels concerning imbalanced endmembers and giving smaller weight values to the pixels mixed by majority endmembers. Besides, we extend the proposed CW-NMF by introducing the sparsity constraints of abundance and graph-based regularization, respectively. The experimental results on both synthetic and real hyperspectral data have been reported, and the effectiveness of our proposed methods has been demonstrated by comparing them with several state-of-the-art methods.

scholarly journals Leveraging colour-based pseudo-labels to supervise saliency detection in hyperspectral image datasets

2021 ◽  
Author(s):  
Annalisa Appice ◽  
Angelo Cannarile ◽  
Antonella Falini ◽  
Donato Malerba ◽  
Francesca Mazzia ◽  
...  
Keyword(s):  
Visual Attention ◽  
Hyperspectral Image ◽  
Saliency Detection ◽  
Hyperspectral Images ◽  
Spectral Information ◽  
Imaging Analysis ◽  
Analysis Task ◽  
Visual Attention Mechanism ◽  
Land Use Monitoring ◽  
Research Resources

AbstractSaliency detection mimics the natural visual attention mechanism that identifies an imagery region to be salient when it attracts visual attention more than the background. This image analysis task covers many important applications in several fields such as military science, ocean research, resources exploration, disaster and land-use monitoring tasks. Despite hundreds of models have been proposed for saliency detection in colour images, there is still a large room for improving saliency detection performances in hyperspectral imaging analysis. In the present study, an ensemble learning methodology for saliency detection in hyperspectral imagery datasets is presented. It enhances saliency assignments yielded through a robust colour-based technique with new saliency information extracted by taking advantage of the abundance of spectral information on multiple hyperspectral images. The experiments performed with the proposed methodology provide encouraging results, also compared to several competitors.

scholarly journals Detecting Bacterial Biofilms Using Fluorescence Hyperspectral Imaging and Various Discriminant Analyses

Sensors ◽  
2021 ◽  
Vol 21 (6) ◽  
pp. 2213
Author(s):  
Ahyeong Lee ◽  
Saetbyeol Park ◽  
Jinyoung Yoo ◽  
Jungsook Kang ◽  
Jongguk Lim ◽  
...  
Keyword(s):  
Discriminant Analysis ◽  
Hyperspectral Imaging ◽  
Food Processing ◽  
Nearest Neighbor ◽  
Hyperspectral Image ◽  
Uv Light ◽  
Hyperspectral Images ◽  
K Nearest Neighbor ◽  
E Coli ◽  
Discriminant Analyses

Biofilms formed on the surface of agro-food processing facilities can cause food poisoning by providing an environment in which bacteria can be cultured. Therefore, hygiene management through initial detection is important. This study aimed to assess the feasibility of detecting Escherichia coli (E. coli) and Salmonella typhimurium (S. typhimurium) on the surface of food processing facilities by using fluorescence hyperspectral imaging. E. coli and S. typhimurium were cultured on high-density polyethylene and stainless steel coupons, which are the main materials used in food processing facilities. We obtained fluorescence hyperspectral images for the range of 420–730 nm by emitting UV light from a 365 nm UV light source. The images were used to perform discriminant analyses (linear discriminant analysis, k-nearest neighbor analysis, and partial-least squares discriminant analysis) to identify and classify coupons on which bacteria could be cultured. The discriminant performances of specificity and sensitivity for E. coli (1–4 log CFU·cm−2) and S. typhimurium (1–6 log CFU·cm−2) were over 90% for most machine learning models used, and the highest performances were generally obtained from the k-nearest neighbor (k-NN) model. The application of the learning model to the hyperspectral image confirmed that the biofilm detection was well performed. This result indicates the possibility of rapidly inspecting biofilms using fluorescence hyperspectral images.

Sign in / Sign up

Export Citation Format

Share Document