scholarly journals SLRL4D: Joint Restoration of Subspace Low-Rank Learning and Non-Local 4-D Transform Filtering for Hyperspectral Image

2020 ◽  
Vol 12 (18) ◽  
pp. 2979
Author(s):  
Le Sun ◽  
Chengxun He ◽  
Yuhui Zheng ◽  
Songze Tang
Keyword(s):  
Hyperspectral Image ◽  
Dimensional Subspace ◽  
Low Rank ◽  
Spatial Correlations ◽  
Self Similarity ◽  
Multiple Datasets ◽  
Alternating Direction ◽  
Non Local ◽  
Low Dimensional ◽  
Spatial Redundancy

During the process of signal sampling and digital imaging, hyperspectral images (HSI) inevitably suffer from the contamination of mixed noises. The fidelity and efficiency of subsequent applications are considerably reduced along with this degradation. Recently, as a formidable implement for image processing, low-rank regularization has been widely extended to the restoration of HSI. Meanwhile, further exploration of the non-local self-similarity of low-rank images are proven useful in exploiting the spatial redundancy of HSI. Better preservation of spatial-spectral features is achieved under both low-rank and non-local regularizations. However, existing methods generally regularize the original space of HSI, the exploration of the intrinsic properties in subspace, which leads to better denoising performance, is relatively rare. To address these challenges, a joint method of subspace low-rank learning and non-local 4-d transform filtering, named SLRL4D, is put forward for HSI restoration. Technically, the original HSI is projected into a low-dimensional subspace. Then, both spectral and spatial correlations are explored simultaneously by imposing low-rank learning and non-local 4-d transform filtering on the subspace. The alternating direction method of multipliers-based algorithm is designed to solve the formulated convex signal-noise isolation problem. Finally, experiments on multiple datasets are conducted to illustrate the accuracy and efficiency of SLRL4D.

scholarly journals Hyperspectral Image Denoising via Combined Non-Local Self-Similarity and Local Low-Rank Regularization

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 50190-50208 ◽  
Author(s):  
Haijin Zeng ◽  
Xiaozhen Xie ◽  
Wenfeng Kong ◽  
Shuang Cui ◽  
Jifeng Ning
Keyword(s):  
Image Denoising ◽  
Hyperspectral Image ◽  
Low Rank ◽  
Self Similarity ◽  
Non Local

scholarly journals Superpixel Spectral Unmixing for Hyperspectral Image Superresolution Using a Coupled Encoder-Decoder Network

2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Shao-lei Zhang ◽  
Guang-yuan Fu ◽  
Hong-qiao Wang ◽  
Yu-qing Zhao
Keyword(s):  
Hyperspectral Image ◽  
Visual Quality ◽  
Spectral Unmixing ◽  
The Other ◽  
Hyperspectral Images ◽  
Low Rank ◽  
Spectral Information ◽  
Multispectral Images ◽  
Self Similarity ◽  
Rank Constraint

In this paper, we propose a novel hyperspectral image superresolution method based on superpixel spectral unmixing using a coupled encoder-decoder network. The hyperspectral image and multispectral images are fused to generate high-resolution hyperspectral images through the spectral unmixing framework with low-rank constraint. Specifically, the endmember and abundance information is extracted via a coupled encoder-decoder network integrating the priori for unmixing. The coupled network consists of two encoders and one shared decoder, where spectral information is preserved through the encoder. The multispectral image is clustered into superpixels to explore self-similarity, and then, the superpixels are unmixed to obtain an abundance matrix. By imposing a low-rank constraint on the abundance matrix, we further improve the superresolution performance. Experiments on the CAVE and Harvard datasets indicate that our superresolution method outperforms the other compared methods in terms of quantitative evaluation and visual quality.

Low-rank tensor completion via combined non-local self-similarity and low-rank regularization

2019 ◽  
Vol 367 ◽  
pp. 1-12 ◽  
Author(s):  
Xiao-Tong Li ◽  
Xi-Le Zhao ◽  
Tai-Xiang Jiang ◽  
Yu-Bang Zheng ◽  
Teng-Yu Ji ◽  
...  
Keyword(s):  
Low Rank ◽  
Tensor Completion ◽  
Self Similarity ◽  
Rank Tensor ◽  
Non Local

scholarly journals Sparse Unmixing for Hyperspectral Image with Nonlocal Low-Rank Prior

2019 ◽  
Vol 11 (24) ◽  
pp. 2897 ◽  
Author(s):  
Yuhui Zheng ◽  
Feiyang Wu ◽  
Hiuk Jae Shim ◽  
Le Sun
Keyword(s):  
Mixed Model ◽  
Linear Mixed Model ◽  
Spatial Information ◽  
Hyperspectral Image ◽  
Simulated Data ◽  
Hyperspectral Data ◽  
Low Rank ◽  
Data Sets ◽  
Self Similarity ◽  
Model Framework

Hyperspectral unmixing is a key preprocessing technique for hyperspectral image analysis. To further improve the unmixing performance, in this paper, a nonlocal low-rank prior associated with spatial smoothness and spectral collaborative sparsity are integrated together for unmixing the hyperspectral data. The proposed method is based on a fact that hyperspectral images have self-similarity in nonlocal sense and smoothness in local sense. To explore the spatial self-similarity, nonlocal cubic patches are grouped together to compose a low-rank matrix. Then, based on the linear mixed model framework, the nuclear norm is constrained to the abundance matrix of these similar patches to enforce low-rank property. In addition, the local spatial information and spectral characteristic are also taken into account by introducing TV regularization and collaborative sparse terms, respectively. Finally, the results of the experiments on two simulated data sets and two real data sets show that the proposed algorithm produces better performance than other state-of-the-art algorithms.

scholarly journals Weighted Schatten p-Norm Low Rank Error Constraint for Image Denoising

Entropy ◽  
2021 ◽  
Vol 23 (2) ◽  
pp. 158
Author(s):  
Jiucheng Xu ◽  
Yihao Cheng ◽  
Yuanyuan Ma
Keyword(s):  
Image Denoising ◽  
Block Matching ◽  
Low Rank ◽  
Self Similarity ◽  
Data Set ◽  
Noisy Images ◽  
Norm Minimization ◽  
Rank Matrix ◽  
Non Local ◽  
Low Rank Matrix

Traditional image denoising algorithms obtain prior information from noisy images that are directly based on low rank matrix restoration, which pays little attention to the nonlocal self-similarity errors between clear images and noisy images. This paper proposes a new image denoising algorithm based on low rank matrix restoration in order to solve this problem. The proposed algorithm introduces the non-local self-similarity error between the clear image and noisy image into the weighted Schatten p-norm minimization model using the non-local self-similarity of the image. In addition, the low rank error is constrained by using Schatten p-norm to obtain a better low rank matrix in order to improve the performance of the image denoising algorithm. The results demonstrate that, on the classic data set, when comparing with block matching 3D filtering (BM3D), weighted nuclear norm minimization (WNNM), weighted Schatten p-norm minimization (WSNM), and FFDNet, the proposed algorithm achieves a higher peak signal-to-noise ratio, better denoising effect, and visual effects with improved robustness and generalization.

scholarly journals Multichannel Color Image Denoising via Weighted Schatten p-norm Minimization

2020 ◽  
Author(s):  
Xinjian Huang ◽  
Bo Du ◽  
Weiwei Liu
Keyword(s):  
Image Denoising ◽  
Color Image ◽  
Low Rank ◽  
Norm Minimization ◽  
Alternating Direction ◽  
Rank Matrix ◽  
Color Image Denoising ◽  
Non Local ◽  
Comparison Algorithms ◽  
Low Rank Matrix

The R, G and B channels of a color image generally have different noise statistical properties or noise strengths. It is thus problematic to apply grayscale image denoising algorithms to color image denoising. In this paper, based on the non-local self-similarity of an image and the different noise strength across each channel, we propose a MultiChannel Weighted Schatten p-Norm Minimization (MCWSNM) model for RGB color image denoising. More specifically, considering a small local RGB patch in a noisy image, we first find its nonlocal similar cubic patches in a search window with an appropriate size. These similar cubic patches are then vectorized and grouped to construct a noisy low-rank matrix, which can be recovered using the Schatten p-norm minimization framework. Moreover, a weight matrix is introduced to balance each channel’s contribution to the final denoising results. The proposed MCWSNM can be solved via the alternating direction method of multipliers. Convergence property of the proposed method are also theoretically analyzed . Experiments conducted on both synthetic and real noisy color image datasets demonstrate highly competitive denoising performance, outperforming comparison algorithms, including several methods based on neural networks.

TSLRLN: Tensor subspace low-rank learning with non-local prior for hyperspectral image mixed denoising

2021 ◽  
Vol 184 ◽  
pp. 108060
Author(s):  
Chengxun He ◽  
Le Sun ◽  
Wei Huang ◽  
Jianwei Zhang ◽  
Yuhui Zheng ◽  
...  
Keyword(s):  
Hyperspectral Image ◽  
Low Rank ◽  
Non Local ◽  
Tensor Subspace

Robust subspace clustering based on latent low rank representation with non-negative sparse Laplacian constraints

2021 ◽  
pp. 1-15
Author(s):  
Zhixuan xu ◽  
Caikou Chen ◽  
Guojiang Han ◽  
Jun Gao
Keyword(s):  
State Of The Art ◽  
Subspace Clustering ◽  
Dimensional Subspace ◽  
Low Rank ◽  
Dimensional Structure ◽  
Clustering Methods ◽  
Benchmark Datasets ◽  
Handwritten Digit ◽  
Low Rank Representation ◽  
Low Dimensional

As a successful improvement on Low Rank Representation (LRR), Latent Low Rank Representation (LatLRR) has been one of the state-of-the-art models for subspace clustering due to the capability of discovering the low dimensional subspace structures of data, especially when the data samples are insufficient and/or extremely corrupted. However, the LatLRR method does not consider the nonlinear geometric structures within data, which leads to the loss of the locality information among data in the learning phase. Moreover, the coefficients of the learnt representation matrix can be negative, which lack the interpretability. To solve the above drawbacks of LatLRR, this paper introduces Laplacian, sparsity and non-negativity to LatLRR model and proposes a novel subspace clustering method, termed latent low rank representation with non-negative, sparse and laplacian constraints (NNSLLatLRR), in which we jointly take into account non-negativity, sparsity and laplacian properties of the learnt representation. As a result, the NNSLLatLRR can not only capture the global low dimensional structure and intrinsic non-linear geometric information of the data, but also enhance the interpretability of the learnt representation. Extensive experiments on two face benchmark datasets and a handwritten digit dataset show that our proposed method outperforms existing state-of-the-art subspace clustering methods.

Sign in / Sign up

Export Citation Format

Share Document