Sheng Liu

Sheng Liu

Auto-generated profile, based on publicly available information

Sheng Liu

School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu, China

Research Focus & Metrics

Academic Career Length

28Years (1999-Present)

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

Representative Publications

View All Publications
4 September 2024 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
SLSheng Liu
Sheng Liu
Xi-Le ZhaoXi-Le Zhao
Xi-Le Zhao
JLJinsong Leng
Jinsong Leng
BLBen-Zheng Li
Ben-Zheng Li
JYJinghua Yang
Jinghua Yang
XCXinyu Chen
Xinyu Chen
Recently, tensor singular value decomposition (t- SVD), based on the tensor-tensor product (t-product), has become a powerful tool for processing third-order tensor data. However, constrained by the fact that the basic element is the fiber (i.e., vector) in the t-product, higher-order tensor data (i.e., order d > 3) are usually unfolded into third-order tensors to satisfy the classical t-product setting, which leads to the destroying of high-dimensional structure. By revisiting the basic element in the t-product, we suggest a generalized t-product called elementbased tensor-tensor product (elt-product) as an alternative of the classic t-product, where the basic element is a ( d - 2)th-order tensor instead of a vector. The benefit of the elt-product is that it can better preserve high-dimensional structures and that it can explore more complex interactions via higher-order convolution instead of first-order convolution in classic t-product. Starting from the elt-product, we develop new tensor-SVD and low-rank tensor metrics (e.g., rank and nuclear norm). Equipped with the suggested metrics, we present a tensor completion model for high-order tensor data and prove the exact recovery guarantees. To harness the resulting nonconvex optimization problem, we apply an alternating direction method of the multiplier (ADMM) algorithm with a theoretical convergence guarantee. Extensive experimental results on the simulated and real-world data (color videos, light-field images, light-field videos, and traffic data) demonstrate the superiority of the proposed model against the state-of-the-art baseline models.

18 September 2023 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
SLSheng Liu
Sheng Liu
JLJinsong Leng
Jinsong Leng
Xi-Le ZhaoXi-Le Zhao
Xi-Le Zhao
HZHaijin Zeng
Haijin Zeng
YWYao Wang
Yao Wang
JYJinghua Yang
Jinghua Yang
Recently, transform-based tensor nuclear norm (TNN) methods have received increasing attention as a powerful tool for multi-dimensional visual data (color images, videos, and multispectral images, etc.) recovery. Especially, the redundant transform-based TNN achieves satisfactory recovery results, where the redundant transform along spectral mode can remarkably enhance the low-rankness of tensors. However, it suffers from expensive computational cost induced by the redundant transform. In this paper, we propose a learnable spatial-spectral transform-based TNN model for multi-dimensional visual data recovery, which not only enjoys better low-rankness capability but also allows us to design fast algorithms accompanying it. More specifically, we first project the large-scale original tensor to the small-scale intrinsic tensor via the learnable semi-orthogonal transforms along the spatial modes. Here, the semi-orthogonal transforms, serving as the key building block, can boost the spatial low-rankness and lead to a small-scale problem, which paves the way for designing fast algorithms. Secondly, to further boost the low-rankness, we apply the learnable redundant transform along the spectral mode to the small-scale intrinsic tensor. To tackle the proposed model, we apply an efficient proximal alternating minimization-based algorithm, which enjoys a theoretical convergence guarantee. Extensive experimental results on real-world data (color images, videos, and multispectral images) demonstrate that the proposed method outperforms state-of-the-art competitors in terms of evaluation metrics and running time.

17 May 2023 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
HZHaijin Zeng
Haijin Zeng
SHShaoguang Huang
Shaoguang Huang
YCYongyong Chen
Yongyong Chen
SLSheng Liu
Sheng Liu
HLHiep Luong
Hiep Luong
WPWilfried Philips
Wilfried Philips
In this article, we propose a novel bilayer low-rankness measure and two models based on it to recover a low-rank (LR) tensor. The global low rankness of underlying tensor is first encoded by LR matrix factorizations (MFs) to the all-mode matricizations, which can exploit multiorientational spectral low rankness. Presumably, the factor matrices of all-mode decomposition are LR, since local low-rankness property exists in within-mode correlation. In the decomposed subspace, to describe the refined local LR structures of factor/subspace, a new low-rankness insight of subspace: a double nuclear norm scheme is designed to explore the so-called second-layer low rankness. By simultaneously representing the bilayer low rankness of the all modes of the underlying tensor, the proposed methods aim to model multiorientational correlations for arbitrary $N$ -way ( $N\geq3$ ) tensors. A block successive upper-bound minimization (BSUM) algorithm is designed to solve the optimization problem. Subsequence convergence of our algorithms can be established, and the iterates generated by our algorithms converge to the coordinatewise minimizers in some mild conditions. Experiments on several types of public datasets show that our algorithm can recover a variety of LR tensors from significantly fewer samples than its counterparts.

14 July 2025 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
SLSheng Liu
Sheng Liu
Xi-Le ZhaoXi-Le Zhao
Xi-Le Zhao
HZHao Zhang
Hao Zhang
Recently, tensor decompositions have received significant attention for processing multi-dimensional signals, especially representative by the block-term decomposition (BTD) family and the tensor network decomposition (TND) family. However, these two families have long been isolated from each other, with their respective wisdom neither inspiring nor benefiting each other. To address this dilemma, we propose a block tensor ring decomposition (BTRD), which decomposes an Nth-order tensor into a sum of outer products between basic vector factors and the (N − 1)th-order coefficient tensors, which are further represented using a tensor ring. The benefit of the BTRD is that it can better explore outer multiple components structure of the tensor and inner tensor topology of each component. To examine the potential of the proposed BTRD, we apply it to a low-rank tensor completion model as a representative task and prove a theoretical generalization error bound which provides a theoretical perspective to support the advantages of the proposed model for higher-order tensors. To address the resulting optimization problem, we apply an efficient proximal alternating minimization (PAM)-based algorithm with a theoretical convergence guarantee. Extensive experimental results on real-world signal data (color videos and light field images) demonstrate the superiority of the proposed model against the state-of-the-art baseline models.

14 November 1999
Verified
Conference Paper
Closed access
PDF file
BGBrandon W. Gordon
Brandon W. Gordon
SLSheng Liu
Sheng Liu
HAHaruhiko H. Asada
Haruhiko H. Asada
Physical systems are often most systematically modeled using a mixed set of Differential and Algebraic Equations (DAEs). However, high index DAE systems which possess identically singular algebraic constraints can present a number of problems in simulation and control. A key difficulty with these systems is that they are not expressed in an explicit state space representation. This paper describes a new modeling approach based on singularly perturbed sliding manifolds for developing state space realizations of high index DAE systems. The new method is illustrated for a model of a two phase flow heat exchanger.

25 September 2025 in Applied Mathematics Letters
Verified
Journal Article
Closed access
SLSheng Liu
Sheng Liu
XZXi-Le Zhao
Xi-Le Zhao
QJQin Jiang
Qin Jiang