Qibin Zhao

Qibin Zhao


Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2016 in Foundations and Trends in Machine Learning
Verified
Journal Article
Open access
PDF file
ACAndrzej Cichocki
Andrzej Cichocki
NLNamgil Lee
Namgil Lee
IOIvan Oseledets
Ivan Oseledets
APAnh-Huy Phan
Anh-Huy Phan
QZQibin Zhao
Qibin Zhao
DMDanilo Mandic
Danilo Mandic
Publishers of Foundations and Trends, making research accessible

29 September 2020 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
Wei HeWei He
Wei He
QYQuanming Yao
Quanming Yao
CLChao Li
Chao Li
Naoto YokoyaNaoto Yokoya
Naoto Yokoya
QZQibin Zhao
Qibin Zhao
Liangpei ZhangLiangpei Zhang
Liangpei Zhang
Non-local low-rank tensor approximation has been developed as a state-of-the-art method for hyperspectral image (HSI) restoration, which includes the tasks of denoising, compressed HSI reconstruction and inpainting. Unfortunately, while its restoration performance benefits from more spectral bands, its runtime also substantially increases. In this paper, we claim that the HSI lies in a global spectral low-rank subspace, and the spectral subspaces of each full band patch group should lie in this global low-rank subspace. This motivates us to propose a unified paradigm combining the spatial and spectral properties for HSI restoration. The proposed paradigm enjoys performance superiority from the non-local spatial denoising and light computation complexity from the low-rank orthogonal basis exploration. An efficient alternating minimization algorithm with rank adaptation is developed. It is done by first solving a fidelity term-related problem for the update of a latent input image, and then learning a low-dimensional orthogonal basis and the related reduced image from the latent input image. Subsequently, non-local low-rank denoising is developed to refine the reduced image and orthogonal basis iteratively. Finally, the experiments on HSI denoising, compressed reconstruction, and inpainting tasks, with both simulated and real datasets, demonstrate its superiority with respect to state-of-the-art HSI restoration methods.

30 May 2017 in Foundations and Trends® in Machine Learning
Verified
Journal Article
Closed access
PDF file
ACAndrzej Cichocki
Andrzej Cichocki
APAnh-Huy Phan
Anh-Huy Phan
QZQibin Zhao
Qibin Zhao
NLNamgil Lee
Namgil Lee
IOIvan Oseledets
Ivan Oseledets
DMDanilo Mandic
Danilo Mandic
Part 2 of this monograph builds on the introduction to tensor networks and their operations presented in Part 1. It focuses on tensor network models for super-compressed higher-order representation of data/parameters and related cost functions, while providing an outline of their applications in machine learning and data analytics. A particular emphasis is on the tensor train (TT) and Hierarchical Tucker (HT) decompositions, and their physically meaningful interpretations which reflect the scalability of the tensor network approach. Through a graphical approach, we also elucidate how, by virtue of the underlying low-rank tensor approximations and sophisticated contractions of core tensors, tensor networks have the ability to perform distributed computations on otherwise prohibitively large volumes of data/parameters, thereby alleviating or even eliminating the curse of dimensionality. The usefulness of this concept is illustrated over a number of applied areas, including generalized regression and classification (support tensor machines, canonical correlation analysis, higher order partial least squares), generalized eigenvalue decomposition, Riemannian optimization, and in the optimization of deep neural networks. Part 1 and Part 2 of this work can be used either as stand-alone separate texts, or indeed as a conjoint comprehensive review of the exciting field of low-rank tensor networks and tensor decompositions.

23 July 2019 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
Wei HeWei He
Wei He
Naoto YokoyaNaoto Yokoya
Naoto Yokoya
LYLonghao Yuan
Longhao Yuan
QZQibin Zhao
Qibin Zhao
Time-series remote sensing (RS) images are often corrupted by various types of missing information such as dead pixels, clouds, and cloud shadows that significantly influence the subsequent applications. In this paper, we introduce a new low-rank tensor decomposition model, termed tensor ring (TR) decomposition, to the analysis of RS data sets and propose a TR completion method for the missing information reconstruction. The proposed TR completion model has the ability to utilize the low-rank property of time-series RS images from different dimensions. To further explore the smoothness of the RS image spatial information, total-variation regularization is also incorporated into the TR completion model. The proposed model is efficiently solved using two algorithms, the augmented Lagrange multiplier (ALM) and the alternating least square (ALS) methods. The simulated and real-data experiments show superior performance compared to other state-of-the-art low-rank related algorithms.

29 November 2012 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Open access
QZQibin Zhao
Qibin Zhao
Cesar F. CaiafaCesar F. Caiafa
Cesar F. Caiafa
DMDanilo P. Mandic
Danilo P. Mandic
ZCZenas C. Chao
Zenas C. Chao
YNYasuo Nagasaka
Yasuo Nagasaka
ACAndrzej Cichocki
Andrzej Cichocki
A new generalized multilinear regression model, termed the higher order partial least squares (HOPLS), is introduced with the aim to predict a tensor (multiway array) Y from a tensor X through projecting the data onto the latent space and performing regression on the corresponding latent variables. HOPLS differs substantially from other regression models in that it explains the data by a sum of orthogonal Tucker tensors, while the number of orthogonal loadings serves as a parameter to control model complexity and prevent overfitting. The low-dimensional latent space is optimized sequentially via a deflation operation, yielding the best joint subspace approximation for both X and Y. Instead of decomposing X and Y individually, higher order singular value decomposition on a newly defined generalized cross-covariance tensor is employed to optimize the orthogonal loadings. A systematic comparison on both synthetic data and real-world decoding of 3D movement trajectories from electrocorticogram signals demonstrate the advantages of HOPLS over the existing methods in terms of better predictive ability, suitability to handle small sample sizes, and robustness to noise.

13 April 2018 in IEEE Transactions on Neural Systems and Rehabilitation Engineering
Verified
Journal Article
Closed access
YZYangsong Zhang
Yangsong Zhang
DGDaqing Guo
Daqing Guo
FLFali Li
Fali Li
EYErWei Yin
ErWei Yin
YZYu Zhang
Yu Zhang
PXPeng Xu
Peng Xu
Goal: A new method for steady-state visual evoked potentials (SSVEPs) frequency recognition is proposed to enhance the performance of SSVEP-based brain-computer interface (BCI). Methods: Correlated component analysis (CORCA) is introduced, which originally was designed to find linear combinations of electrodes that are consistent across subjects and maximally correlated between them. We propose a CORCA algorithm to learn spatial filters with multiple blocks of individual training data for SSVEP-based BCI scenario. The spatial filters are used to remove background noises by combining the multichannel EEG signals. We conduct a comparison between the proposed CORCA-based and the task-related component analysis (TRCA) based methods using a 40-class SSVEP benchmark dataset recorded from 35 subjects. Results: Our experimental study validates the efficiency of the CORCA-based method, and the extensive comparison results indicate that the CORCAbased method significantly outperforms the TRCA-based method. Conclusion and Significance: Superior performance demonstrates that the proposed method holds the promising potential to achieve satisfactory performance for SSVEP-based BCI with a large number of targets.