scholarly journals Data Adaptable Sparse Reconstruction for Hyperspectral Image Recovery from Compressed Measurements

2020 ◽  
Vol 9 (3) ◽  
pp. 2569-2576
Keyword(s):  
Image Compression ◽  
Compressive Sensing ◽  
Hyperspectral Image ◽  
Satellite Image ◽  
Research Work ◽  
Reconstruction Algorithm ◽  
Hyperspectral Data ◽  
Sparse Reconstruction ◽  
Total Variation Regularization ◽  
Reconstruction Process

Hyperspectral image compression using compressive sensing technique is very much important in the area of satellite image compression because it can greatly en hance the compression rate. The research work proposes a novel data adaptable sparse reconstruction algorithm for the reconstruction of hyperspectral images from compressive sensing measurements. In the proposed algorithm, compressive sensing technique is used for the compression of HSIs, where Gaussian i.i.d. matrix is used to generate compressive sensing measurements. The algorithm solves the optimization problem containing total variation regularization and data adaptable parameter terms. The regularization terms are added to provide hyperspectral data characteristics as priors into the objective function. The addition of priors helps in convergence of the algorithm into the desired solution. The algorithm alternatively reconstructs the end member matrix and abundance matrix instead of reconstructing the entire HSI at once, thereby reducing the computational complexity at the reconstruction process. To nullify the effect of modelling errors, debiasing is performed

scholarly journals Data Adaptable Sparse Reconstruction for Hyperspectral Image Recovery from Compressed Measurements

2020 ◽  
Vol 9 (3) ◽  
pp. 2569-2576
Keyword(s):  
Image Compression ◽  
Compressive Sensing ◽  
Hyperspectral Image ◽  
Satellite Image ◽  
Research Work ◽  
Reconstruction Algorithm ◽  
Hyperspectral Data ◽  
Sparse Reconstruction ◽  
Total Variation Regularization ◽  
Reconstruction Process

Hyperspectral image compression using compressive sensing technique is very much important in the area of satellite image compression because it can greatly en hance the compression rate. The research work proposes a novel data adaptable sparse reconstruction algorithm for the reconstruction of hyperspectral images from compressive sensing measurements. In the proposed algorithm, compressive sensing technique is used for the compression of HSIs, where Gaussian i.i.d. matrix is used to generate compressive sensing measurements. The algorithm solves the optimization problem containing total variation regularization and data adaptable parameter terms. The regularization terms are added to provide hyperspectral data characteristics as priors into the objective function. The addition of priors helps in convergence of the algorithm into the desired solution. The algorithm alternatively reconstructs the end member matrix and abundance matrix instead of reconstructing the entire HSI at once, thereby reducing the computational complexity at the reconstruction process. To nullify the effect of modelling errors, debiasing is performed.

scholarly journals A Efficient Solution for Classification of Crops using Hyper Spectral Satellite Images

2019 ◽  
Vol 9 (2) ◽  
pp. 5204-5211
Keyword(s):  
Hyperspectral Image ◽  
Satellite Image ◽  
Hyperspectral Data ◽  
Classification Model ◽  
Research Activity ◽  
Research Issues ◽  
Computational Overhead ◽  
Wide Range ◽  
Crop Classification

Crop identification (CI) utilizing hyperspectral pictures/images (HSI) collected from satellite is one of the effective research area considering various agriculture related applications. Wide range of research activity is carried out and modelled in the area of crop recognition (CR) for building efficient model. Correlation filter (CF) is considered to be one of an effective method and are been applied by existing methodologies for identifying similar signal features. Nonetheless, very limited is work is carried out using CF for crop classification using hyperspectral data. Further, effective method is required that bring good tradeoffs between memory and computational overhead. The crop classification model can be improved by combining machine learning (ML) technique with CF. HSI is composed of hundreds of channels with large data dimension that gives entire information of imaging. Thus, using classification model is very useful for real-time application uses. However, the accuracy of classification task is affected as HSI is composed of high number of redundant and correlated feature sets. Along with, induce computational overhead with less benefits using redundant features. Thus, effective band selection, texture analysis, and classification method is required for accurately classifying multiple crops. This paper analyses various existing techniques for identification and classification of crops using satellite imagery detection method. Then, identify the research issues, challenges, and problems of existing model for building efficient techniques for identification and classification of crops using satellite image. Experiment are conducted on standard hyperspectral data. The result attained shows proposed model attain superior classification accuracy when compared with existing hyperspectral image classification model.

scholarly journals Two-dimensional satellite image compression using compressive sensing

2022 ◽  
Vol 12 (1) ◽  
pp. 311
Author(s):  
Gunasheela Keragodu Shivanna ◽  
Haranahalli Shreenivasamurthy Prasantha
Keyword(s):  
Image Compression ◽  
Compressive Sensing ◽  
Satellite Image ◽  
Research Community ◽  
Reconstruction Accuracy ◽  
Promising Technique ◽  
Compression Technique ◽  
Satellite Imaging ◽  
Compression Algorithms ◽  
Ground Station

Compressive sensing is receiving a lot of attention from the image processing research community as a promising technique for image recovery from very few samples. The modality of compressive sensing technique is very useful in the applications where it is not feasible to acquire many samples. It is also prominently useful in satellite imaging applications since it drastically reduces the number of input samples thereby reducing the storage and communication bandwidth required to store and transmit the data into the ground station. In this paper, an interior point-based method is used to recover the entire satellite image from compressive sensing samples. The compression results obtained are compared with the compression results from conventional satellite image compression algorithms. The results demonstrate the increase in reconstruction accuracy as well as higher compression rate in case of compressive sensing-based compression technique.

scholarly journals Texture Based Hyperspectral Image Classification

2014 ◽  
Vol XL-8 ◽  
pp. 793-798 ◽  
Author(s):  
B. Kumar ◽  
O. Dikshit
Keyword(s):  
Spatial Information ◽  
Hyperspectral Image ◽  
Research Work ◽  
Texture Features ◽  
Hyperspectral Data ◽  
Support Vector ◽  
Svm Classifier ◽  
Additional Information ◽  
Geometric Moments ◽  
Classification Framework

This research work presents a supervised classification framework for hyperspectral data that takes into account both spectral and spatial information. Texture analysis is performed to model spatial characteristics that provides additional information, which is used along with rich spectral measurements for better classification of hyperspectral imagery. The moment invariants of an image can derive shape characteristics, elongation, and orientation along its axis. In this investigation second order geometric moments within small window around each pixel are computed which are further used to compute texture features. The textural and spectral features of the image are combined to form a joint feature vector that is used for classification. The experiments are performed on different types of hyperspectral images using multi-class one-vs-one support vector machine (SVM) classifier to evaluate the robustness of the proposed methodology. The results demonstrate that integration of texture features produced statistically significantly better results than spectral classification.

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 Hyperspectral Image Classification with Localized Graph Convolutional Filtering

2021 ◽  
Vol 13 (3) ◽  
pp. 526
Author(s):  
Shengliang Pu ◽  
Yuanfeng Wu ◽  
Xu Sun ◽  
Xiaotong Sun
Keyword(s):  
Hyperspectral Image ◽  
Principal Component ◽  
Representation Learning ◽  
Classification Performance ◽  
Hyperspectral Data ◽  
Spectral Graph Theory ◽  
Feature Reduction ◽  
Graph Representation ◽  
Novel Method ◽  
Local Graph

The nascent graph representation learning has shown superiority for resolving graph data. Compared to conventional convolutional neural networks, graph-based deep learning has the advantages of illustrating class boundaries and modeling feature relationships. Faced with hyperspectral image (HSI) classification, the priority problem might be how to convert hyperspectral data into irregular domains from regular grids. In this regard, we present a novel method that performs the localized graph convolutional filtering on HSIs based on spectral graph theory. First, we conducted principal component analysis (PCA) preprocessing to create localized hyperspectral data cubes with unsupervised feature reduction. These feature cubes combined with localized adjacent matrices were fed into the popular graph convolution network in a standard supervised learning paradigm. Finally, we succeeded in analyzing diversified land covers by considering local graph structure with graph convolutional filtering. Experiments on real hyperspectral datasets demonstrated that the presented method offers promising classification performance compared with other popular competitors.

Research on the application of 3D reconstruction technology in traditional handicraft design

2021 ◽  
pp. 002072092110052
Author(s):  
GuoLong Zhang
Keyword(s):  
Poisson Equation ◽  
Optimization Algorithm ◽  
Three Dimensional ◽  
Reconstruction Algorithm ◽  
Social Production ◽  
Design Constraint ◽  
Reconstruction Process ◽  
Key Steps ◽  
Shielding Design ◽  
Reconstruction Model

The use of computer technology for three-dimensional (3 D) reconstruction is one of the important development directions of social production. The purpose is to find a new method that can be used in traditional handicraft design, and to explore the application of 3 D reconstruction technology in it. Based on the description and analysis of 3 D reconstruction technology, the 3 D reconstruction algorithm based on Poisson equation is analyzed, and the key steps and problems of the method are clarified. Then, by introducing the shielding design constraint, a 3 D reconstruction algorithm based on shielded Poisson equation is proposed. Finally, the performance of two algorithms is compared by reconstructing the 3 D image of rabbit. The results show that: when the depth value of the algorithm is 11, the surface of the rabbit image obtained by the proposed optimization algorithm is smoother, and the details are more delicate and fluent; under different depth values, with the increase of the depth value, the number of vertices and faces of the two algorithms increase, and the optimal depth values of 3 D reconstruction are more than 8. However, the proposed optimization algorithm has more vertices, and performs better in the reconstruction process; the larger the depth value is, the more time and memory are consumed in 3 D reconstruction, so it is necessary to select the appropriate depth value; the shielding parameters of the algorithm have a great impact on the fineness of the reconstruction model. The larger the parameter is, the higher the fineness is. In a word, the proposed 3 D reconstruction algorithm based on shielded Poisson equation has better practicability and superiority.

Sign in / Sign up

Export Citation Format

Share Document