791 research outputs found
Randomized Tensor Ring Decomposition and Its Application to Large-scale Data Reconstruction
Dimensionality reduction is an essential technique for multi-way large-scale
data, i.e., tensor. Tensor ring (TR) decomposition has become popular due to
its high representation ability and flexibility. However, the traditional TR
decomposition algorithms suffer from high computational cost when facing
large-scale data. In this paper, taking advantages of the recently proposed
tensor random projection method, we propose two TR decomposition algorithms. By
employing random projection on every mode of the large-scale tensor, the TR
decomposition can be processed at a much smaller scale. The simulation
experiment shows that the proposed algorithms are times faster than
traditional algorithms without loss of accuracy, and our algorithms show
superior performance in deep learning dataset compression and hyperspectral
image reconstruction experiments compared to other randomized algorithms.Comment: ICASSP submissio
Linear vs Nonlinear Extreme Learning Machine for Spectral-Spatial Classification of Hyperspectral Image
As a new machine learning approach, extreme learning machine (ELM) has
received wide attentions due to its good performances. However, when directly
applied to the hyperspectral image (HSI) classification, the recognition rate
is too low. This is because ELM does not use the spatial information which is
very important for HSI classification. In view of this, this paper proposes a
new framework for spectral-spatial classification of HSI by combining ELM with
loopy belief propagation (LBP). The original ELM is linear, and the nonlinear
ELMs (or Kernel ELMs) are the improvement of linear ELM (LELM). However, based
on lots of experiments and analysis, we found out that the LELM is a better
choice than nonlinear ELM for spectral-spatial classification of HSI.
Furthermore, we exploit the marginal probability distribution that uses the
whole information in the HSI and learn such distribution using the LBP. The
proposed method not only maintain the fast speed of ELM, but also greatly
improves the accuracy of classification. The experimental results in the
well-known HSI data sets, Indian Pines and Pavia University, demonstrate the
good performances of the proposed method.Comment: 13 pages,8 figures,3 tables,articl
Hyperspectral Super-Resolution with Coupled Tucker Approximation: Recoverability and SVD-based algorithms
We propose a novel approach for hyperspectral super-resolution, that is based
on low-rank tensor approximation for a coupled low-rank multilinear (Tucker)
model. We show that the correct recovery holds for a wide range of multilinear
ranks. For coupled tensor approximation, we propose two SVD-based algorithms
that are simple and fast, but with a performance comparable to the
state-of-the-art methods. The approach is applicable to the case of unknown
spatial degradation and to the pansharpening problem.Comment: IEEE Transactions on Signal Processing, Institute of Electrical and
Electronics Engineers, in Pres
- …