Hui Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Hui Li has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Jianfeng Sun
Anhui Normal University, Wuhu, China
3 shared publications - Jingxiang Yu
University of Science and Technology of China
2 shared publications Haoran Duan
University of Science and Technology of China
1 shared publicationJia He
Anhui Tsinglink Information Technology Company Ltd., Hefei, China
1 shared publication- Jingyi Yang
University of Science and Technology of China, Hefei, China
1 shared publication Liepiao Zhang
South China University of Technology, Guangzhou, China
1 shared publication
Latest Publications
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Molecular, Biological, and Multi-Scale Communications
- Vol. 12, 493-503
Information Transmission Through Noisy Chemical Reactions
Chemical reactions serve as fundamental mechanisms for information transmission in biological systems. However, the intrinsic stochasticity of chemical reactions limits the precision with which cells can sense external signals. To quantify this limitation, we develop a probabilistic model for reversible second-order chemical reactions that captures the temporal evolution of reactant and product concentrations. The model is derived from the Chemical Langevin Equation (CLE), and a Gaussian approximation is introduced to enable analytical tractability while preserving accuracy. Building on this framework, we define a chemical reaction channel, derive expressions for mutual information, and analyze its channel capacity. Furthermore, we propose an optimized modulation strategy for this channel, which significantly reduces the symbol error rate compared with conventional equally spaced constellations.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Molecular, Biological, and Multi-Scale Communications
- Vol. 12, 493-503
Information Transmission Through Noisy Chemical Reactions
Chemical reactions serve as fundamental mechanisms for information transmission in biological systems. However, the intrinsic stochasticity of chemical reactions limits the precision with which cells can sense external signals. To quantify this limitation, we develop a probabilistic model for reversible second-order chemical reactions that captures the temporal evolution of reactant and product concentrations. The model is derived from the Chemical Langevin Equation (CLE), and a Gaussian approximation is introduced to enable analytical tractability while preserving accuracy. Building on this framework, we define a chemical reaction channel, derive expressions for mutual information, and analyze its channel capacity. Furthermore, we propose an optimized modulation strategy for this channel, which significantly reduces the symbol error rate compared with conventional equally spaced constellations.
- Open Access
- 22 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 161-162
Channel Modeling for Reflector-Assisted Molecular Communications
- 22 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 161-162
Open AccessChannel Modeling for Reflector-Assisted Molecular Communications
- 10 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 7528-7541
G2V2former: Graph Guided Video Vision Transformer for Face Anti-Spoofing
In videos containing spoofed faces, we may uncover the spoofing evidence based on either photometric or dynamic abnormality, or a combination of both. Prevailing face antispoofing (FAS) approaches generally concentrate on the singleframe scenario; however, purely photometric-driven methods overlook the dynamic spoofing clues that may be exposed over time. This may lead FAS systems to conclude incorrect judgments, especially in cases where it is easily distinguishable in terms of dynamics but challenging to discern in terms of photometrics. To this end, we propose the Graph Guided Video Vision Transformer (G2V2former), which combines faces with facial landmarks for the fusion of photometric and dynamic features. We factorize the attention into space and time and fuse them via a spatiotemporal block. Specifically, we design a novel temporal attention, called Kronecker temporal attention, which has a wider receptive field and is beneficial for capturing dynamic information. Moreover, we leverage the low-semantic motion of facial landmarks to guide the high-semantic change of facial expressions based on the motivation that regions containing landmarks may reveal more dynamic clues. Extensive experiments on nine benchmark datasets demonstrate that our method achieves superior performance under various scenarios. The codes will be released at https://github.com/yjyddq/GVformer.
- 10 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 7528-7541
G2V2former: Graph Guided Video Vision Transformer for Face Anti-Spoofing
In videos containing spoofed faces, we may uncover the spoofing evidence based on either photometric or dynamic abnormality, or a combination of both. Prevailing face antispoofing (FAS) approaches generally concentrate on the singleframe scenario; however, purely photometric-driven methods overlook the dynamic spoofing clues that may be exposed over time. This may lead FAS systems to conclude incorrect judgments, especially in cases where it is easily distinguishable in terms of dynamics but challenging to discern in terms of photometrics. To this end, we propose the Graph Guided Video Vision Transformer (G2V2former), which combines faces with facial landmarks for the fusion of photometric and dynamic features. We factorize the attention into space and time and fuse them via a spatiotemporal block. Specifically, we design a novel temporal attention, called Kronecker temporal attention, which has a wider receptive field and is beneficial for capturing dynamic information. Moreover, we leverage the low-semantic motion of facial landmarks to guide the high-semantic change of facial expressions based on the motivation that regions containing landmarks may reveal more dynamic clues. Extensive experiments on nine benchmark datasets demonstrate that our method achieves superior performance under various scenarios. The codes will be released at https://github.com/yjyddq/GVformer.
- 3 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Nanobioscience
- Vol. 22 (1) , 78-91
Convolutional Codec Implemented by Genetic Circuits for Molecular Communication
Molecular communication (MC), which transmits information through molecules, has emerged as a promising technique to enable communication links between nanomachines. To establish information transmission using molecules, synthetic biology through genetic circuits techniques can be utilized to construct biological components. Recent efforts on genetic circuits have produced many exciting MC systems and generated substantial insights. With basic gene regulatory modules and motifs, researchers are now constructing artificial networks with novel functions that will serve as building blocks in the MC system. In this paper, we investigate the design of genetic circuits to implement the convolutional codec in a diffusion-based MC channel with the concentration shift keying (CSK) transmission scheme. At the receiver, a majority-logic decoder is applied to decode the received symbols. These functions are completely realized in the field of biochemistry through the activation and inhibition of genes and biochemical reactions, rather than through classical electrical circuits. Biochemical simulations are used to verify the feasibility of the system and analyze the impairments caused by diffusion noise and chemical reaction noise of genetic circuits.
- 3 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Nanobioscience
- Vol. 22 (1) , 78-91
Convolutional Codec Implemented by Genetic Circuits for Molecular Communication
Molecular communication (MC), which transmits information through molecules, has emerged as a promising technique to enable communication links between nanomachines. To establish information transmission using molecules, synthetic biology through genetic circuits techniques can be utilized to construct biological components. Recent efforts on genetic circuits have produced many exciting MC systems and generated substantial insights. With basic gene regulatory modules and motifs, researchers are now constructing artificial networks with novel functions that will serve as building blocks in the MC system. In this paper, we investigate the design of genetic circuits to implement the convolutional codec in a diffusion-based MC channel with the concentration shift keying (CSK) transmission scheme. At the receiver, a majority-logic decoder is applied to decode the received symbols. These functions are completely realized in the field of biochemistry through the activation and inhibition of genes and biochemical reactions, rather than through classical electrical circuits. Biochemical simulations are used to verify the feasibility of the system and analyze the impairments caused by diffusion noise and chemical reaction noise of genetic circuits.
- 11 February 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 26 (5) , 1062-1065
Stochastic Gradient Langevin Dynamics for Massive MIMO Detection
In this letter a MIMO detector with low computational complexity is proposed based on Stochastic Gradient Langevin Dynamics (SGLD). The proposed detector estimates the modulated symbols through a non-convex optimization problem which is solved by SGLD based algorithm. For $M$ -ary phase-shift keying ( $M$ -PSK) modulation, the proposed algorithm achieves the performance similar to sphere decoding (SD) in medium-scale MIMO systems, and can be scaled up to massive MIMO systems. Numerical results verify the advantages of the proposed algorithm compared to various existing MIMO detectors. The simulations under the imperfect correlated channel also show the tolerance of the proposed algorithm on channel errors and channel correlations.
- 11 February 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 26 (5) , 1062-1065
Stochastic Gradient Langevin Dynamics for Massive MIMO Detection
In this letter a MIMO detector with low computational complexity is proposed based on Stochastic Gradient Langevin Dynamics (SGLD). The proposed detector estimates the modulated symbols through a non-convex optimization problem which is solved by SGLD based algorithm. For $M$ -ary phase-shift keying ( $M$ -PSK) modulation, the proposed algorithm achieves the performance similar to sphere decoding (SD) in medium-scale MIMO systems, and can be scaled up to massive MIMO systems. Numerical results verify the advantages of the proposed algorithm compared to various existing MIMO detectors. The simulations under the imperfect correlated channel also show the tolerance of the proposed algorithm on channel errors and channel correlations.
- 25 February 2021
- Published by Springer Nature
- p. 492-505
Channel Pruning for Accelerating Convolutional Neural Networks via Wasserstein Metric
- 25 February 2021
- Published by Springer Nature
- p. 492-505
Channel Pruning for Accelerating Convolutional Neural Networks via Wasserstein Metric
- 6 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 24 (12) , 2829-2833
Expected Received Signal in Diffusive Molecular Communication With Finite Binding Receptors
This letter focuses on the diffusive molecular communication system with a reversible reactive receiver. By assuming the receiver is uniformly covered by finite receptors, a new boundary condition is proposed to model the reception reaction. In addition, an iterative approximation method is developed to model the expected received signal in this system. The simulation results verify the effectiveness of the approximation method.
- 6 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 24 (12) , 2829-2833
Expected Received Signal in Diffusive Molecular Communication With Finite Binding Receptors
This letter focuses on the diffusive molecular communication system with a reversible reactive receiver. By assuming the receiver is uniformly covered by finite receptors, a new boundary condition is proposed to model the reception reaction. In addition, an iterative approximation method is developed to model the expected received signal in this system. The simulation results verify the effectiveness of the approximation method.
- Open Access
- 26 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 104380-104393
On the IID Capacity-Achieving Input for Binding Channels With Multiple Ligand Receptors
This paper studies the molecular communication system where the transmitter has limited productivity and the receiver employs ligand-binding receptors. By simplifying the release and propagation process of the information particles, the ligand-binding process is regarded as a binding channel with peak and average constraints and modeled by a finite-state Markov chain. It is proved that the capacity of the constrained independent and identically distributed (IID) binding channel, defined as the IID capacity, is achieved by a discrete input distribution. The sufficient and necessary conditions of an IID input distribution being capacity-achieving is presented. Moreover, an algorithm called modified steepest ascent cutting-plane algorithm is proposed to efficiently compute the IID capacity-achieving distributions. The numerical results show that the IID capacity is a tight lower bound of the capacity for the binding channel.
- 26 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 104380-104393
Open AccessOn the IID Capacity-Achieving Input for Binding Channels With Multiple Ligand Receptors
This paper studies the molecular communication system where the transmitter has limited productivity and the receiver employs ligand-binding receptors. By simplifying the release and propagation process of the information particles, the ligand-binding process is regarded as a binding channel with peak and average constraints and modeled by a finite-state Markov chain. It is proved that the capacity of the constrained independent and identically distributed (IID) binding channel, defined as the IID capacity, is achieved by a discrete input distribution. The sufficient and necessary conditions of an IID input distribution being capacity-achieving is presented. Moreover, an algorithm called modified steepest ascent cutting-plane algorithm is proposed to efficiently compute the IID capacity-achieving distributions. The numerical results show that the IID capacity is a tight lower bound of the capacity for the binding channel.
- Open Access
The Crossover-Distance for ISI-Correcting Decoding of Convolutional Codes in Diffusion-Based Molecular Communications
In diffusion based molecular communication, the intersymbol interference (ISI) is an important reason for system performance degradation, which is caused by the random movement, out-of-order arrival and indistinguishability of the moleclues. In this paper, a new metric called crossover distance is introduced to measure the distance between the received bit sequence and the probably tranmitted bit sequences. A new decoding scheme of conventional codes is proposed based on crossover distance, which can enhance the communication reliability significantly. The theoretic analysis indicates that the proposed decoding algorithm provides an approximately maximal likelihood estimation of the information bits. The numerical results show that compared with uncoded systems and some existing channel codes, the proposed convolutional codes offer good performance with same throughputs.
Open AccessThe Crossover-Distance for ISI-Correcting Decoding of Convolutional Codes in Diffusion-Based Molecular Communications
In diffusion based molecular communication, the intersymbol interference (ISI) is an important reason for system performance degradation, which is caused by the random movement, out-of-order arrival and indistinguishability of the moleclues. In this paper, a new metric called crossover distance is introduced to measure the distance between the received bit sequence and the probably tranmitted bit sequences. A new decoding scheme of conventional codes is proposed based on crossover distance, which can enhance the communication reliability significantly. The theoretic analysis indicates that the proposed decoding algorithm provides an approximately maximal likelihood estimation of the information bits. The numerical results show that compared with uncoded systems and some existing channel codes, the proposed convolutional codes offer good performance with same throughputs.