Liangchen Hu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Liangchen Hu has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Zhenlei Dai
School of Computer and Information, Anhui Normal University, Wuhu, China
9 shared publications - Wensheng Zhang
Nanjing University of Science and Technology
7 shared publications - Huahao Shou
Zhejiang University of Technology
6 shared publications - Yonglong Luo
Anhui Normal University
5 shared publications - Biao Jie
Anhui Normal University
3 shared publications - Shiaofen Fang
Department of Biomedical Engineering and Informatics, Indiana University Indianapolis, Indianapolis, IN, 46202, U.S.
3 shared publications
Latest Publications
- 27 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 2852-2865
Privacy-Preserving and Collusion-Resistant Data Query Scheme for Vehicular Platoons
Data queries play a crucial role in the vehicular platoon, enabling vehicles to obtain traffic information about surrounding road conditions and personalized entertainment information services. However, data query requests from vehicles may expose the vehicle owner’s personal attributes and habits. Although several schemes can address these issues, they are incapable of countering collusion attacks between the coordinating vehicle and roadside units (RSUs). To solve this problem, in this paper we propose a privacy-preserving and collusion-resistant data query scheme, named PCDQ. Specifically, PCDQ uses the Paillier encryption and Chinese Remainder Theorem to protect the query privacy of vehicle owners, allowing the RSU to recover individual data query requests without associating them with the original vehicles. Next, the parameter update mechanism in PCDQ prevents the coordinating vehicle from obtaining the corresponding mapping information between vehicles and query parameters, thereby resisting collusion attacks between the coordinating vehicle and RSUs. In addition, identity-based signcryption is used to ensure secure parameter distribution among vehicles, and the batch verification enables efficient authentication of query requests. Detailed security proofs and analysis demonstrate that PCDQ satisfies multiple security properties, including resistance to collusion attacks and replay attacks, unlinkability, confidentiality, and authentication and data integrity. Experimental results show that, compared to existing solutions, PCDQ performs better in terms of computation overhead, communication overhead, and network performance.
- 27 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 2852-2865
Privacy-Preserving and Collusion-Resistant Data Query Scheme for Vehicular Platoons
Data queries play a crucial role in the vehicular platoon, enabling vehicles to obtain traffic information about surrounding road conditions and personalized entertainment information services. However, data query requests from vehicles may expose the vehicle owner’s personal attributes and habits. Although several schemes can address these issues, they are incapable of countering collusion attacks between the coordinating vehicle and roadside units (RSUs). To solve this problem, in this paper we propose a privacy-preserving and collusion-resistant data query scheme, named PCDQ. Specifically, PCDQ uses the Paillier encryption and Chinese Remainder Theorem to protect the query privacy of vehicle owners, allowing the RSU to recover individual data query requests without associating them with the original vehicles. Next, the parameter update mechanism in PCDQ prevents the coordinating vehicle from obtaining the corresponding mapping information between vehicles and query parameters, thereby resisting collusion attacks between the coordinating vehicle and RSUs. In addition, identity-based signcryption is used to ensure secure parameter distribution among vehicles, and the batch verification enables efficient authentication of query requests. Detailed security proofs and analysis demonstrate that PCDQ satisfies multiple security properties, including resistance to collusion attacks and replay attacks, unlinkability, confidentiality, and authentication and data integrity. Experimental results show that, compared to existing solutions, PCDQ performs better in terms of computation overhead, communication overhead, and network performance.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (17) , 1
OAMHSC: Towards One-Step Multi-View Clustering via Class-Aware Spectral Embedding on Adaptive Hypergraphs
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (17) , 1
OAMHSC: Towards One-Step Multi-View Clustering via Class-Aware Spectral Embedding on Adaptive Hypergraphs
- Open Access
Neighborhood-Adaptive Generalized Linear Graph Embedding with Latent Pattern Mining
Graph embedding has been widely applied in areas such as network analysis, social network mining, recommendation systems, and bioinformatics. However, current graph construction methods often require the prior definition of neighborhood size, limiting the effective revelation of potential structural correlations in the data. Additionally, graph embedding methods using linear projection heavily rely on a singular pattern mining approach, resulting in relative weaknesses in adapting to different scenarios. To address these challenges, we propose a novel model, Neighborhood-Adaptive Generalized Linear Graph Embedding (NGLGE), grounded in latent pattern mining. This model introduces an adaptive graph learning method tailored to the neighborhood, effectively revealing intrinsic data correlations. Simultaneously, leveraging a reconstructed low-rank representation and imposing $\ell_{2,0}$ norm constraint on the projection matrix allows for flexible exploration of additional pattern information. Besides, an efficient iterative solving algorithm is derived for the proposed model. Comparative evaluations on datasets from diverse scenarios demonstrate the superior performance of our model compared to state-of-the-art methods.Open AccessNeighborhood-Adaptive Generalized Linear Graph Embedding with Latent Pattern Mining
Graph embedding has been widely applied in areas such as network analysis, social network mining, recommendation systems, and bioinformatics. However, current graph construction methods often require the prior definition of neighborhood size, limiting the effective revelation of potential structural correlations in the data. Additionally, graph embedding methods using linear projection heavily rely on a singular pattern mining approach, resulting in relative weaknesses in adapting to different scenarios. To address these challenges, we propose a novel model, Neighborhood-Adaptive Generalized Linear Graph Embedding (NGLGE), grounded in latent pattern mining. This model introduces an adaptive graph learning method tailored to the neighborhood, effectively revealing intrinsic data correlations. Simultaneously, leveraging a reconstructed low-rank representation and imposing $\ell_{2,0}$ norm constraint on the projection matrix allows for flexible exploration of additional pattern information. Besides, an efficient iterative solving algorithm is derived for the proposed model. Comparative evaluations on datasets from diverse scenarios demonstrate the superior performance of our model compared to state-of-the-art methods. - 20 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Journal
- Vol. 25 (9) , 16455-16467
Dynamic Sparse Graph Learning Jointly With Projective Graph Embedding for Image Feature Extraction
In the context of advancing industrial automation, sensor-generated image data often exhibit high dimensionality and complexity, presenting challenges for effective feature extraction. Especially when sensors are deployed in complex and dynamic environments, image data can be affected by various factors, leading to increased noise and thus impacting the performance of feature extraction. To tackle these issues, this paper introduces a method combining the dynamic sparse graph learning jointly with projective graph embedding for feature extraction from sensor images. Initially, sparse representation learning constructs similarity graphs among the data, pruning unnecessary connections to retain the most pertinent features. Then, projective graph embedding maps the image data into a lower-dimensional space, achieving a more concise and discriminative feature representation. These two primary modules in our model form an optimized closed loop, achieving overall optimality. The integrated approach effectively reveals the local manifold structure within the data. Experimental results indicate significant performance enhancements compared to several state-of-the-art methods across multiple benchmark datasets.
- 20 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Journal
- Vol. 25 (9) , 16455-16467
Dynamic Sparse Graph Learning Jointly With Projective Graph Embedding for Image Feature Extraction
In the context of advancing industrial automation, sensor-generated image data often exhibit high dimensionality and complexity, presenting challenges for effective feature extraction. Especially when sensors are deployed in complex and dynamic environments, image data can be affected by various factors, leading to increased noise and thus impacting the performance of feature extraction. To tackle these issues, this paper introduces a method combining the dynamic sparse graph learning jointly with projective graph embedding for feature extraction from sensor images. Initially, sparse representation learning constructs similarity graphs among the data, pruning unnecessary connections to retain the most pertinent features. Then, projective graph embedding maps the image data into a lower-dimensional space, achieving a more concise and discriminative feature representation. These two primary modules in our model form an optimized closed loop, achieving overall optimality. The integrated approach effectively reveals the local manifold structure within the data. Experimental results indicate significant performance enhancements compared to several state-of-the-art methods across multiple benchmark datasets.
- 18 October 2024
- Published by Elsevier in Neural Networks
- Vol. 181, 106814
Robust generalized PCA for enhancing discriminability and recoverability
- 18 October 2024
- Published by Elsevier in Neural Networks
- Vol. 181, 106814
Robust generalized PCA for enhancing discriminability and recoverability
- 2 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 34 (10) , 9326-9340
Block Diagonal Graph Embedded Discriminative Regression for Image Representation
Linear regression, a widely-used method in representation learning, initially faced limitations in incorporating structural information within the regression space. Existing models designed to extract structural insights often prioritize the proximity of data points in feature space, while overlooking crucial interdependencies and co-occurrences among them. In response to the challenges posed by the inherent limitations, we introduce a novel representation learning model based on linear regression. This model seamlessly integrates three essential modules: flexible regression learning, graph embedding learning, and embedded block-diagonal self-representation learning. The collaborative functioning of these modules establishes a closed optimization loop. The self-representation matrix directly captures the latent graph structure across the entire data domain, without the need for setting additional parameters such as the neighborhood scale of the graph. Concurrently, it facilitates flexible regression learning by uncovering latent structural patterns. Experimental results on multiple benchmark datasets demonstrate the superiority of our approach over state-of-the-art methods, providing a more comprehensive solution for representation learning.
- 2 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 34 (10) , 9326-9340
Block Diagonal Graph Embedded Discriminative Regression for Image Representation
Linear regression, a widely-used method in representation learning, initially faced limitations in incorporating structural information within the regression space. Existing models designed to extract structural insights often prioritize the proximity of data points in feature space, while overlooking crucial interdependencies and co-occurrences among them. In response to the challenges posed by the inherent limitations, we introduce a novel representation learning model based on linear regression. This model seamlessly integrates three essential modules: flexible regression learning, graph embedding learning, and embedded block-diagonal self-representation learning. The collaborative functioning of these modules establishes a closed optimization loop. The self-representation matrix directly captures the latent graph structure across the entire data domain, without the need for setting additional parameters such as the neighborhood scale of the graph. Concurrently, it facilitates flexible regression learning by uncovering latent structural patterns. Experimental results on multiple benchmark datasets demonstrate the superiority of our approach over state-of-the-art methods, providing a more comprehensive solution for representation learning.
- Open Access
- 1 March 2023
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 2449 (1) , 012031
Single Intersection Traffic Light Control by Multi-agent Reinforcement Learning
Deep reinforcement learning is a data-driven method, which is very promising for alleviating traffic congestion through intelligent control of traffic lights. In this paper, the traffic signal of an intersection is divided into four independent phases and then controlled by deep Q-network (DQN) models respectively. Models can receive observations from their own angle of view, i.e., north-south straight, north-south left turn, east-west straight, east-west left turn, instead of extracting features from the whole scene. We suppose that it is beneficial for learning better policy if agents could sense the environment more precisely. DQN models are jointly trained under the revised QMIX framework to promote coordination capability. For decentralized execution, traffic lights of the phase with the highest Q-value will turn green. The experiments are done under SUMO, the results demonstrate that our method obtains higher reward and lower delay compared to controlling the holistic cycle by using a single DQN model.
- 1 March 2023
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 2449 (1) , 012031
Open AccessSingle Intersection Traffic Light Control by Multi-agent Reinforcement Learning
Deep reinforcement learning is a data-driven method, which is very promising for alleviating traffic congestion through intelligent control of traffic lights. In this paper, the traffic signal of an intersection is divided into four independent phases and then controlled by deep Q-network (DQN) models respectively. Models can receive observations from their own angle of view, i.e., north-south straight, north-south left turn, east-west straight, east-west left turn, instead of extracting features from the whole scene. We suppose that it is beneficial for learning better policy if agents could sense the environment more precisely. DQN models are jointly trained under the revised QMIX framework to promote coordination capability. For decentralized execution, traffic lights of the phase with the highest Q-value will turn green. The experiments are done under SUMO, the results demonstrate that our method obtains higher reward and lower delay compared to controlling the holistic cycle by using a single DQN model.
- Open Access
- 12 October 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (20) , 3766
Progressive Iterative Approximation of Non-Uniform Cubic B-Spline Curves and Surfaces via Successive Over-Relaxation Iteration
Geometric iteration (GI) is one of the most efficient curve- or surface-fitting techniques in recent years, which is famous for its remarkable geometric significance. In essence, GI can be thought of as the sum of iterative methods for solving systems of linear equations, such as progressive iterative approximation (PIA) which relies on the theory of Richardson iteration. Thus, when the curve- or surface-fitting error is at a desired level, we want to have as few iterations as possible to improve efficiency when dealing with large data sets. Based on the idea of successive over-relaxation (SOR) iteration, we formulate a faster PIA curve and surface interpolation scheme using classical non-uniform cubic B-splines, named SOR-PIA. The genetic algorithm is utilized to estimate the best approximate relaxation factor of SOR-PIA. Similar to standard PIA, SOR-PIA can also be regarded as a process in which the control points move in one direction, but it can greatly reduce the number of iterations in the iterative process with the same fitting accuracy. By comparing with the standard PIA and WPIA algorithms, the effectiveness of the SOR-PIA iterative interpolation algorithm can be verified.
- 12 October 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (20) , 3766
Open AccessProgressive Iterative Approximation of Non-Uniform Cubic B-Spline Curves and Surfaces via Successive Over-Relaxation Iteration
Geometric iteration (GI) is one of the most efficient curve- or surface-fitting techniques in recent years, which is famous for its remarkable geometric significance. In essence, GI can be thought of as the sum of iterative methods for solving systems of linear equations, such as progressive iterative approximation (PIA) which relies on the theory of Richardson iteration. Thus, when the curve- or surface-fitting error is at a desired level, we want to have as few iterations as possible to improve efficiency when dealing with large data sets. Based on the idea of successive over-relaxation (SOR) iteration, we formulate a faster PIA curve and surface interpolation scheme using classical non-uniform cubic B-splines, named SOR-PIA. The genetic algorithm is utilized to estimate the best approximate relaxation factor of SOR-PIA. Similar to standard PIA, SOR-PIA can also be regarded as a process in which the control points move in one direction, but it can greatly reduce the number of iterations in the iterative process with the same fitting accuracy. By comparing with the standard PIA and WPIA algorithms, the effectiveness of the SOR-PIA iterative interpolation algorithm can be verified.
- 10 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 33 (1) , 74-87
Class-Oriented Self-Learning Graph Embedding for Image Compact Representation
As one of the learning ways for inducing efficient image compact representation, graph embedding (GE) based manifold learning has been widely developed over the last two decades. Good graph embedding depends on the construction of graphs concerning intra-class compactness and inter-class separability, which are crucial indicators of the effectiveness of a model in generating discriminative features. Unsupervised approaches are designed to reveal the data structure information from a local or global perspective, but the resulting compact representation often has poorly inter-class margins due to the lack of label information. Moreover, supervised techniques only consider enhancing the adjacency affinity within classes, but exclude the affinity of different classes, resulting in inadequate capture of marginal structures between different class distributions. To overcome these issues, we propose a learning framework that implements Class-Oriented Self-Learning Graph Embedding (COSLGE), in which we achieve a flexible low-dimensional compact representation by imposing an adaptive graph learning process across the entire data while examining the inter-class separability of low-dimensional embedding by jointly learning a linear classifier. Besides, our framework can be easily extended to semi-supervised scenarios. Extensive experiments on several widely-used benchmark databases demonstrate the effectiveness of the proposed method in comparison to some state-of-the-art approaches.
- 10 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 33 (1) , 74-87
Class-Oriented Self-Learning Graph Embedding for Image Compact Representation
As one of the learning ways for inducing efficient image compact representation, graph embedding (GE) based manifold learning has been widely developed over the last two decades. Good graph embedding depends on the construction of graphs concerning intra-class compactness and inter-class separability, which are crucial indicators of the effectiveness of a model in generating discriminative features. Unsupervised approaches are designed to reveal the data structure information from a local or global perspective, but the resulting compact representation often has poorly inter-class margins due to the lack of label information. Moreover, supervised techniques only consider enhancing the adjacency affinity within classes, but exclude the affinity of different classes, resulting in inadequate capture of marginal structures between different class distributions. To overcome these issues, we propose a learning framework that implements Class-Oriented Self-Learning Graph Embedding (COSLGE), in which we achieve a flexible low-dimensional compact representation by imposing an adaptive graph learning process across the entire data while examining the inter-class separability of low-dimensional embedding by jointly learning a linear classifier. Besides, our framework can be easily extended to semi-supervised scenarios. Extensive experiments on several widely-used benchmark databases demonstrate the effectiveness of the proposed method in comparison to some state-of-the-art approaches.