Yicong He
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yicong He has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Badong Chen
Xi’an Jiaotong University
8 shared publications - Shiyuan Wang
Southwest University
6 shared publications - Fei Wang
Xi’an Jiaotong University
5 shared publications - George Atia
University of Central Florida
4 shared publications Fei Wang
2 shared publications- Jiuwen Cao
Hangzhou Dianzi University
2 shared publications
Latest Publications
- 25 March 2025
- Published by Elsevier in Neural Networks
- Vol. 188, 107417
An information-theoretic approach for heterogeneous differentiable causal discovery
- 25 March 2025
- Published by Elsevier in Neural Networks
- Vol. 188, 107417
An information-theoretic approach for heterogeneous differentiable causal discovery
- 11 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 35 (5) , 4493-4505
Scalable and Robust Tensor Ring Decomposition for Large-Scale Data With Missing Data and Outliers
Tensor ring (TR) decomposition demonstrates superior performance in handling high-order tensors. However, traditional TR-based decomposition algorithms face limitations in real-world applications due to large data sizes, missing entries, and outlier corruption. To address these challenges, we propose a scalable and robust TR decomposition algorithm for large-scale tensor data that effectively handles missing entries and gross corruptions. Our method introduces a novel auto-weighted scaled steepest descent approach that adaptively identifies outliers and completes missing entries during decomposition. Additionally, leveraging the tensor ring decomposition model, we develop a Fast Gram Matrix Computation (FGMC) technique and a Randomized Subtensor Sketching (RStS) strategy, significantly reducing storage and computational complexity. Experimental results demonstrate that the proposed method outperforms existing TR decomposition and tensor completion methods.
- 11 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 35 (5) , 4493-4505
Scalable and Robust Tensor Ring Decomposition for Large-Scale Data With Missing Data and Outliers
Tensor ring (TR) decomposition demonstrates superior performance in handling high-order tensors. However, traditional TR-based decomposition algorithms face limitations in real-world applications due to large data sizes, missing entries, and outlier corruption. To address these challenges, we propose a scalable and robust TR decomposition algorithm for large-scale tensor data that effectively handles missing entries and gross corruptions. Our method introduces a novel auto-weighted scaled steepest descent approach that adaptively identifies outliers and completes missing entries during decomposition. Additionally, leveraging the tensor ring decomposition model, we develop a Fast Gram Matrix Computation (FGMC) technique and a Randomized Subtensor Sketching (RStS) strategy, significantly reducing storage and computational complexity. Experimental results demonstrate that the proposed method outperforms existing TR decomposition and tensor completion methods.
- 6 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 35 (10) , 14603-14617
Robust Low-Tubal-Rank Tensor Completion Based on Tensor Factorization and Maximum Correntopy Criterion
The goal of tensor completion is to recover a tensor from a subset of its entries, often by exploiting its low-rank property. Among several useful definitions of tensor rank, the low tubal rank was shown to give a valuable characterization of the inherent low-rank structure of a tensor. While some low-tubal-rank tensor completion algorithms with favorable performance have been recently proposed, these algorithms utilize second-order statistics to measure the error residual, which may not work well when the observed entries contain large outliers. In this article, we propose a new objective function for low-tubal-rank tensor completion, which uses correntropy as the error measure to mitigate the effect of the outliers. To efficiently optimize the proposed objective, we leverage a half-quadratic minimization technique whereby the optimization is transformed to a weighted low-tubal-rank tensor factorization problem. Subsequently, we propose two simple and efficient algorithms to obtain the solution and provide their convergence and complexity analysis. Numerical results using both synthetic and real data demonstrate the robust and superior performance of the proposed algorithms.
- 6 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 35 (10) , 14603-14617
Robust Low-Tubal-Rank Tensor Completion Based on Tensor Factorization and Maximum Correntopy Criterion
The goal of tensor completion is to recover a tensor from a subset of its entries, often by exploiting its low-rank property. Among several useful definitions of tensor rank, the low tubal rank was shown to give a valuable characterization of the inherent low-rank structure of a tensor. While some low-tubal-rank tensor completion algorithms with favorable performance have been recently proposed, these algorithms utilize second-order statistics to measure the error residual, which may not work well when the observed entries contain large outliers. In this article, we propose a new objective function for low-tubal-rank tensor completion, which uses correntropy as the error measure to mitigate the effect of the outliers. To efficiently optimize the proposed objective, we leverage a half-quadratic minimization technique whereby the optimization is transformed to a weighted low-tubal-rank tensor factorization problem. Subsequently, we propose two simple and efficient algorithms to obtain the solution and provide their convergence and complexity analysis. Numerical results using both synthetic and real data demonstrate the robust and superior performance of the proposed algorithms.
- 5 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 54 (1) , 136-149
Coarse to Fine Two-Stage Approach to Robust Tensor Completion of Visual Data
Tensor completion is the problem of estimating the missing values of high-order data from partially observed entries. Data corruption due to prevailing outliers poses major challenges to traditional tensor completion algorithms, which catalyzed the development of robust algorithms that alleviate the effect of outliers. However, existing robust methods largely presume that the corruption is sparse, which may not hold in practice. In this article, we develop a two-stage robust tensor completion approach to deal with tensor completion of visual data with a large amount of gross corruption. A novel coarse-to-fine framework is proposed which uses a global coarse completion result to guide a local patch refinement process. To efficiently mitigate the effect of a large number of outliers on tensor recovery, we develop a new M-estimator-based robust tensor ring recovery method which can adaptively identify the outliers and alleviate their negative effect in the optimization. The experimental results demonstrate the superior performance of the proposed approach over state-of-the-art robust algorithms for tensor completion.
- 5 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 54 (1) , 136-149
Coarse to Fine Two-Stage Approach to Robust Tensor Completion of Visual Data
Tensor completion is the problem of estimating the missing values of high-order data from partially observed entries. Data corruption due to prevailing outliers poses major challenges to traditional tensor completion algorithms, which catalyzed the development of robust algorithms that alleviate the effect of outliers. However, existing robust methods largely presume that the corruption is sparse, which may not hold in practice. In this article, we develop a two-stage robust tensor completion approach to deal with tensor completion of visual data with a large amount of gross corruption. A novel coarse-to-fine framework is proposed which uses a global coarse completion result to guide a local patch refinement process. To efficiently mitigate the effect of a large number of outliers on tensor recovery, we develop a new M-estimator-based robust tensor ring recovery method which can adaptively identify the outliers and alleviate their negative effect in the optimization. The experimental results demonstrate the superior performance of the proposed approach over state-of-the-art robust algorithms for tensor completion.
- 13 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 32 (12) , 8312-8326
Patch Tracking-Based Streaming Tensor Ring Completion for Visual Data Recovery
Tensor completion aims to recover the missing entries of a partially observed tensor by exploiting its low-rank structure, and has been applied to visual data recovery. In applications where the data arrives sequentially such as streaming video completion, the missing entries of the tensor need to be dynamically recovered in a streaming fashion. Traditional streaming tensor completion algorithms treat the entire visual data as a tensor, which may not work satisfactorily when there is a big change in the tensor subspace along the temporal dimension, such as due to strong motion across the video frames. In this paper, we develop a novel patch tracking-based streaming tensor ring completion framework for visual data recovery. Given a newly incoming frame, small patches are tracked from the previous frame. Meanwhile, for each tracked patch, a patch tensor is constructed by stacking similar patches from the new frame. Patch tensors are then completed using a streaming tensor ring completion algorithm, and the incoming frame is recovered using the completed patch tensors. We propose a new patch tracking strategy that can accurately and efficiently track the patches with missing data. Further, a new streaming tensor ring completion algorithm is proposed which can efficiently and accurately update the latent core tensors and complete the missing entries of the patch tensors. Extensive experimental results demonstrate the superior performance of the proposed algorithms compared with both batch and streaming state-of-the-art tensor completion methods.
- 13 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 32 (12) , 8312-8326
Patch Tracking-Based Streaming Tensor Ring Completion for Visual Data Recovery
Tensor completion aims to recover the missing entries of a partially observed tensor by exploiting its low-rank structure, and has been applied to visual data recovery. In applications where the data arrives sequentially such as streaming video completion, the missing entries of the tensor need to be dynamically recovered in a streaming fashion. Traditional streaming tensor completion algorithms treat the entire visual data as a tensor, which may not work satisfactorily when there is a big change in the tensor subspace along the temporal dimension, such as due to strong motion across the video frames. In this paper, we develop a novel patch tracking-based streaming tensor ring completion framework for visual data recovery. Given a newly incoming frame, small patches are tracked from the previous frame. Meanwhile, for each tracked patch, a patch tensor is constructed by stacking similar patches from the new frame. Patch tensors are then completed using a streaming tensor ring completion algorithm, and the incoming frame is recovered using the completed patch tensors. We propose a new patch tracking strategy that can accurately and efficiently track the patches with missing data. Further, a new streaming tensor ring completion algorithm is proposed which can efficiently and accurately update the latent core tensors and complete the missing entries of the patch tensors. Extensive experimental results demonstrate the superior performance of the proposed algorithms compared with both batch and streaming state-of-the-art tensor completion methods.
- 1 November 2020
- Published by Elsevier in Signal Processing
- Vol. 176
Diffusion adaptation framework for compressive sensing reconstruction
- 1 November 2020
- Published by Elsevier in Signal Processing
- Vol. 176
Diffusion adaptation framework for compressive sensing reconstruction
- 8 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 68, 181-195
Robust Matrix Completion via Maximum Correntropy Criterion and Half-Quadratic Optimization
- 8 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 68, 181-195
Robust Matrix Completion via Maximum Correntropy Criterion and Half-Quadratic Optimization
- 1 April 2019
- Published by Elsevier in Information Sciences
- Vol. 480, 381-402
Maximum correntropy adaptation approach for robust compressive sensing reconstruction
- 1 April 2019
- Published by Elsevier in Information Sciences
- Vol. 480, 381-402
Maximum correntropy adaptation approach for robust compressive sensing reconstruction
- 6 July 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 66 (2) , 307-311
Maximum Total Correntropy Diffusion Adaptation Over Networks With Noisy Links
Distributed estimation over networks draws much attraction in recent years. In many situations, due to imperfect information communication among nodes, the performance of traditional diffusion adaptive algorithms such as the diffusion least mean squares (DLMS) may degrade. To deal with this problem, several modified DLMS algorithms have been proposed. However, these DLMS based algorithms still suffer from biased estimation and are not robust against impulsive link noise. In this paper, we focus on improving the performance of diffusion adaptation with noisy links from two aspects: accuracy and robustness. A new algorithm called diffusion maximum total correntropy (DMTC) is proposed. The new algorithm is theoretically unbiased in Gaussian noise, and can efficiently handle the link noise in the presence of large outliers. The adaptive combination rule is applied to further improve the performance. The stability analysis of the proposed algorithm is given. Simulation results show that the DMTC algorithm can achieve good performance in both Gaussian and non-Gaussian noise environments.
- 6 July 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 66 (2) , 307-311
Maximum Total Correntropy Diffusion Adaptation Over Networks With Noisy Links
Distributed estimation over networks draws much attraction in recent years. In many situations, due to imperfect information communication among nodes, the performance of traditional diffusion adaptive algorithms such as the diffusion least mean squares (DLMS) may degrade. To deal with this problem, several modified DLMS algorithms have been proposed. However, these DLMS based algorithms still suffer from biased estimation and are not robust against impulsive link noise. In this paper, we focus on improving the performance of diffusion adaptation with noisy links from two aspects: accuracy and robustness. A new algorithm called diffusion maximum total correntropy (DMTC) is proposed. The new algorithm is theoretically unbiased in Gaussian noise, and can efficiently handle the link noise in the presence of large outliers. The adaptive combination rule is applied to further improve the performance. The stability analysis of the proposed algorithm is given. Simulation results show that the DMTC algorithm can achieve good performance in both Gaussian and non-Gaussian noise environments.
- Open Access
Diffusion Adaptation Framework for Compressive Sensing Reconstruction
Compressive sensing(CS) has drawn much attention in recent years due to its low sampling rate as well as high recovery accuracy. As an important procedure, reconstructing a sparse signal from few measurement data has been intensively studied. Many reconstruction algorithms have been proposed and shown good reconstruction performance. However, when dealing with large-scale sparse signal reconstruction problem, the storage requirement will be high, and many algorithms also suffer from high computational cost. In this paper, we propose a novel diffusion adaptation framework for CS reconstruction, where the reconstruction is performed in a distributed network. The data of measurement matrix are partitioned into small parts and are stored in each node, which assigns the storage load in a decentralized manner. The local information interaction provides the reconstruction ability. Then, a simple and efficient gradient-descend based diffusion algorithm has been proposed to collaboratively recover the sparse signal over network. The convergence of the proposed algorithm is analyzed. To further increase the convergence speed, a mini-batch based diffusion algorithm is also proposed. Simulation results show that the proposed algorithms can achieve good reconstruction accuracy as well as fast convergence speed.
Open AccessDiffusion Adaptation Framework for Compressive Sensing Reconstruction
Compressive sensing(CS) has drawn much attention in recent years due to its low sampling rate as well as high recovery accuracy. As an important procedure, reconstructing a sparse signal from few measurement data has been intensively studied. Many reconstruction algorithms have been proposed and shown good reconstruction performance. However, when dealing with large-scale sparse signal reconstruction problem, the storage requirement will be high, and many algorithms also suffer from high computational cost. In this paper, we propose a novel diffusion adaptation framework for CS reconstruction, where the reconstruction is performed in a distributed network. The data of measurement matrix are partitioned into small parts and are stored in each node, which assigns the storage load in a decentralized manner. The local information interaction provides the reconstruction ability. Then, a simple and efficient gradient-descend based diffusion algorithm has been proposed to collaboratively recover the sparse signal over network. The convergence of the proposed algorithm is analyzed. To further increase the convergence speed, a mini-batch based diffusion algorithm is also proposed. Simulation results show that the proposed algorithms can achieve good reconstruction accuracy as well as fast convergence speed.