Yingjing Qian
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
Yingjing Qian has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Renmin Zhang
School of Communication and Electronic Engineering, Jishou University, Jishou, China
10 shared publications - Yun He
School of Communication, Electronic Engineering, Jishou University, Jishou, China
3 shared publications Dajiang He
College of Electrical and Information Engineering Huaihua University Huaihua People's Republic of China
2 shared publications- Hang Gui
School of Communication and Electronic Engineering, Jishou University, China
2 shared publications - Junjie Hu
School of Communication, Electronic Engineering, Jishou University, Jishou, China
2 shared publications - Keding Deng
School of Communication and Electronic Engineering, Jishou University, Jishou, China
2 shared publications
Latest Publications
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Letters
- Vol. 10 (8) , 1-4
AWC-LVI: Robust LiDAR-Visual-Inertial SLAM With Residual-Based Adaptive Weighting Controller in Complex Environments
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Letters
- Vol. 10 (8) , 1-4
AWC-LVI: Robust LiDAR-Visual-Inertial SLAM With Residual-Based Adaptive Weighting Controller in Complex Environments
- 12 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 14 (9) , 2738-2742
Balancing Communication and Sensing Hybrid Beamforming With Rank-1 Optimization for mmWave ISAC Systems
Millimeter-wave (mmWave) integrated sensing and communications (ISAC) with hybrid architecture has been seen as a potential candidate for next generation wireless systems. However, simultaneously achieving high-resolution sensing and high throughout communication under multipath-sensitive signal interference-plus-noise-ratio (SINR) constraints remains challenging. To address this issue, we propose a hybrid beamforming solution with rank-1 optimization for balancing sensing and communication, in which sensing resolution is maximized by minimizing Cramér-Rao bound (CRB) with multi-users’ rate requirement represented by corresponding SINRs. Furthermore, for hybrid beamforming, the aforementioned problem is addressed by jointly designing digital and analog beamformers, where digital beamforming is solved with semi-definite relaxation (SDR) and second-order cone programming (SOCP), and analog beamformer is obtained by employing singular value decomposition (SVD) and successive interference cancellation (SIC), respectively. Simulation results highlight the effectiveness of the proposed algorithm.
- 12 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 14 (9) , 2738-2742
Balancing Communication and Sensing Hybrid Beamforming With Rank-1 Optimization for mmWave ISAC Systems
Millimeter-wave (mmWave) integrated sensing and communications (ISAC) with hybrid architecture has been seen as a potential candidate for next generation wireless systems. However, simultaneously achieving high-resolution sensing and high throughout communication under multipath-sensitive signal interference-plus-noise-ratio (SINR) constraints remains challenging. To address this issue, we propose a hybrid beamforming solution with rank-1 optimization for balancing sensing and communication, in which sensing resolution is maximized by minimizing Cramér-Rao bound (CRB) with multi-users’ rate requirement represented by corresponding SINRs. Furthermore, for hybrid beamforming, the aforementioned problem is addressed by jointly designing digital and analog beamformers, where digital beamforming is solved with semi-definite relaxation (SDR) and second-order cone programming (SOCP), and analog beamformer is obtained by employing singular value decomposition (SVD) and successive interference cancellation (SIC), respectively. Simulation results highlight the effectiveness of the proposed algorithm.
- 1 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Letters
- Vol. 8 (8) , 1-4
Smoke and Fire Detection Based on YOLOv7 With Convolutional Structure Reparameterization and Lightweighting
This letter presents a YOLO-based detection model called DS-YOLO (Diverse Branch Block and SlimNeck), which enables fast and accurate identification of smoke and fire. Firstly, DP-ELAN module in the backbone is constructed based on Diverse Branch Block (DBB) and Partial Convolution (PConv). It is possible to enhance detection capability while reducing the number of parameters. Secondly, utilizing the SlimNeck based on Ghost Shuffle Convolution (GSConv) to reduce model complexity. Finally, we use Normalized Gaussian Wasserstein Distance (NWD) instead of the standard IoU to improve the detection capability for small-sized objects.The experimental results on our custom smoke and fire dataset indicate that the proposed DS-YOLO achieves a mAP of 70.1%, while reducing computational complexity. This represents an 1.3% improvement over the baseline model.
- 1 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Letters
- Vol. 8 (8) , 1-4
Smoke and Fire Detection Based on YOLOv7 With Convolutional Structure Reparameterization and Lightweighting
This letter presents a YOLO-based detection model called DS-YOLO (Diverse Branch Block and SlimNeck), which enables fast and accurate identification of smoke and fire. Firstly, DP-ELAN module in the backbone is constructed based on Diverse Branch Block (DBB) and Partial Convolution (PConv). It is possible to enhance detection capability while reducing the number of parameters. Secondly, utilizing the SlimNeck based on Ghost Shuffle Convolution (GSConv) to reduce model complexity. Finally, we use Normalized Gaussian Wasserstein Distance (NWD) instead of the standard IoU to improve the detection capability for small-sized objects.The experimental results on our custom smoke and fire dataset indicate that the proposed DS-YOLO achieves a mAP of 70.1%, while reducing computational complexity. This represents an 1.3% improvement over the baseline model.
- Open Access
- 21 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 72566-72577
News Recommendation With Word-Related Joint Topic Prediction
As the problem of information overload becomes more severe, it has become increasingly difficult for users to browse news that they are interested in. News recommendation is an effective method to alleviate this problem. In news recommendation, accurately obtaining rich semantic news representations and modeling user’s historical interests are long-standing challenges. Based on these two issues, we propose a News recommendation approach with Word-related joint Topic prediction(NWT). The core of our approach is the topic perceptron and the news encoder that emphasizes word relevance. The topic information and word relevance information are fused through joint training, enhancing the abilities of topic prediction and news representation. In the news encoder, we employ multi-head self-attention network to emphasize word relevance, capturing the semantic relationships between any two words in the news title and enhancing the representation of the news. In the topic perceptron, we use the enhanced word relevance-based news representation as input and learn the topic information in the news by assigning weights to different topics. During joint training, the overall news recommendation module obtains the news topic information. Additionally, the user encoder learns the user’s topic preferences and utilizes attention networks to highlight news articles that are more representative of the user’s interests, thereby acquiring a more accurate user representation. We conduct extensive experiments on the MIND dataset, and the results demonstrate that NWT outperforms most existing baseline methods across various evaluation metrics.
- 21 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 72566-72577
Open AccessNews Recommendation With Word-Related Joint Topic Prediction
As the problem of information overload becomes more severe, it has become increasingly difficult for users to browse news that they are interested in. News recommendation is an effective method to alleviate this problem. In news recommendation, accurately obtaining rich semantic news representations and modeling user’s historical interests are long-standing challenges. Based on these two issues, we propose a News recommendation approach with Word-related joint Topic prediction(NWT). The core of our approach is the topic perceptron and the news encoder that emphasizes word relevance. The topic information and word relevance information are fused through joint training, enhancing the abilities of topic prediction and news representation. In the news encoder, we employ multi-head self-attention network to emphasize word relevance, capturing the semantic relationships between any two words in the news title and enhancing the representation of the news. In the topic perceptron, we use the enhanced word relevance-based news representation as input and learn the topic information in the news by assigning weights to different topics. During joint training, the overall news recommendation module obtains the news topic information. Additionally, the user encoder learns the user’s topic preferences and utilizes attention networks to highlight news articles that are more representative of the user’s interests, thereby acquiring a more accurate user representation. We conduct extensive experiments on the MIND dataset, and the results demonstrate that NWT outperforms most existing baseline methods across various evaluation metrics.
- Open Access
- 8 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 65254-65265
DCGC-YOLO: The Efficient Dual-Channel Bottleneck Structure YOLO Detection Algorithm for Fire Detection
Fast and highly accurate fire detection algorithms are crucial for production and daily life. However, detecting fires in the early stages is challenging due to the lack of distinct features and fixed shapes of flames and smoke. To address this issue, we propose a fire detection algorithm, DCGC(Dual Channel Group Convolution)-YOLO, based on an improved YOLOv5 model. The DCGC-YOLO model introduces a new layer structure and anchor algorithm to optimize original YOLOv5 model. Firstly, we introduce a Cross Stage Partial (CSP) structure with a cascade of large convolutional kernels in the bottleneck layer. This structure increases network’s receptive field, enhances feature extraction capabilities, and employs a channel cleansing mechanism that combines various channels separated by group convolution, promoting information exchange in the channel dimension and enabling better information encoding. Next, we integrate the Effective Squeeze and Extraction (eSE) mechanism into the new layer structure, enhancing the model’s ability for long-range modeling and focusing more on target areas. Finally, we utilize an Intersection over Union (IoU)-based anchor generation algorithm to adjust the anchor sizes on custom fire dataset, enhancing the model’s robustness and improving detection accuracy. Experimental results on our custom fire dataset demonstrate that the proposed DCGC-YOLO algorithm effectively detects targets with mAP of 41.1%, which is 2.9% higher than YOLOv5s, while reducing network parameters and computational complexity. To further validate the effectiveness of our proposed algorithm, we conduct experiments on the COCO2017 dataset. The results show that DCGC-YOLO achieves mAP of 38.9%, demonstrating strong generalization and competitiveness compared to state-of-the-art detectors.
- 8 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 65254-65265
Open AccessDCGC-YOLO: The Efficient Dual-Channel Bottleneck Structure YOLO Detection Algorithm for Fire Detection
Fast and highly accurate fire detection algorithms are crucial for production and daily life. However, detecting fires in the early stages is challenging due to the lack of distinct features and fixed shapes of flames and smoke. To address this issue, we propose a fire detection algorithm, DCGC(Dual Channel Group Convolution)-YOLO, based on an improved YOLOv5 model. The DCGC-YOLO model introduces a new layer structure and anchor algorithm to optimize original YOLOv5 model. Firstly, we introduce a Cross Stage Partial (CSP) structure with a cascade of large convolutional kernels in the bottleneck layer. This structure increases network’s receptive field, enhances feature extraction capabilities, and employs a channel cleansing mechanism that combines various channels separated by group convolution, promoting information exchange in the channel dimension and enabling better information encoding. Next, we integrate the Effective Squeeze and Extraction (eSE) mechanism into the new layer structure, enhancing the model’s ability for long-range modeling and focusing more on target areas. Finally, we utilize an Intersection over Union (IoU)-based anchor generation algorithm to adjust the anchor sizes on custom fire dataset, enhancing the model’s robustness and improving detection accuracy. Experimental results on our custom fire dataset demonstrate that the proposed DCGC-YOLO algorithm effectively detects targets with mAP of 41.1%, which is 2.9% higher than YOLOv5s, while reducing network parameters and computational complexity. To further validate the effectiveness of our proposed algorithm, we conduct experiments on the COCO2017 dataset. The results show that DCGC-YOLO achieves mAP of 38.9%, demonstrating strong generalization and competitiveness compared to state-of-the-art detectors.
- Open Access
- 8 December 2023
- Published by Association for Computing Machinery (ACM)
- p. 155-160
Geometric-Programming-Based Power Allocation Algorithm for Sum-Rate Maximization in Tunnel Construction Communications
With the construction and development of tunnels, the demand for communication in tunnels is gradually increasing. During tunnel construction, some new communication technologies can be adopted to solve the communication pressure in the current tunnel environment. Device-to-Device (D2D) communication is flexible, allowing for connectivity and resource allocation under base station (BS) control. It also facilitates information exchange in the absence of network infrastructure and can serve as a relay, connecting user equipment within network coverage and acting as a gateway to the network. The incorporation of D2D in communication networks offers an effective solution to the issue of limited spectrum resources. However, the utilization of spectrum resources for D2D may lead to interference between users. In this paper, we propose a geometric programming-based power allocation algorithm to maximize the sum data rate of cellular users (CUEs) while guaranteeing the quality of service (QoS) for vehicle to infrastructure (V2I) links and vehicle to vehicle (V2V) links. Initially, the resource allocation is framed as a non-linear programming problem, and the optimal result is derived by exploring within a finite set. Then, the classic Kuhn-Munkres algorithm is used to achieve channel assignment. The numerical results indicate that the proposed algorithm control the interference efficiently between users and enhance the sum data rate of CUEs significantly.
- 8 December 2023
- Published by Association for Computing Machinery (ACM)
- p. 155-160
Open AccessGeometric-Programming-Based Power Allocation Algorithm for Sum-Rate Maximization in Tunnel Construction Communications
With the construction and development of tunnels, the demand for communication in tunnels is gradually increasing. During tunnel construction, some new communication technologies can be adopted to solve the communication pressure in the current tunnel environment. Device-to-Device (D2D) communication is flexible, allowing for connectivity and resource allocation under base station (BS) control. It also facilitates information exchange in the absence of network infrastructure and can serve as a relay, connecting user equipment within network coverage and acting as a gateway to the network. The incorporation of D2D in communication networks offers an effective solution to the issue of limited spectrum resources. However, the utilization of spectrum resources for D2D may lead to interference between users. In this paper, we propose a geometric programming-based power allocation algorithm to maximize the sum data rate of cellular users (CUEs) while guaranteeing the quality of service (QoS) for vehicle to infrastructure (V2I) links and vehicle to vehicle (V2V) links. Initially, the resource allocation is framed as a non-linear programming problem, and the optimal result is derived by exploring within a finite set. Then, the classic Kuhn-Munkres algorithm is used to achieve channel assignment. The numerical results indicate that the proposed algorithm control the interference efficiently between users and enhance the sum data rate of CUEs significantly.
- Open Access
- 8 December 2023
- Published by Association for Computing Machinery (ACM)
- p. 458-464
DG-YOLO: Elevating Smoke-Fire Object Detection with Dual-Channel Grouped Convolution Based on YOLOv5
In the early stages of a fire outbreak, timely and accurate detection is crucial. However, existing target algorithms struggle to meet the real-time and accuracy requirements for fire detection. Addressing this issue, this paper proposes a new fire detection algorithm, DG-YOLO (Double channels and Group convolution), based on the YOLOv5s model. Firstly, the model introduces a novel dual-branch group convolution structure called DGBlock, which cascades large convolutional kernels to increase the network's receptive field. Moreover, it employs group convolution to reduce computational and parameter complexity, effectively enhancing the network's detection capabilities while lowering computational complexity. Secondly, the Effective Squeeze-and-Excitation (ESE) attention mechanism is utilized to boost the network's long-range modeling ability, guiding the network to focus more on relevant features. Experimental results demonstrate that using the DG-YOLO algorithm achieves a detection accuracy (mAP) of 41.9% on a custom fire dataset, an improvement of 2.8% over the original algorithm. To further validate the network's performance, this paper compares four mainstream algorithms on the COCO 2017 dataset, achieving an mAP of 38.6%, a 1.2% improvement over the original algorithm, effectively confirming the algorithm's efficacy.
- 8 December 2023
- Published by Association for Computing Machinery (ACM)
- p. 458-464
Open AccessDG-YOLO: Elevating Smoke-Fire Object Detection with Dual-Channel Grouped Convolution Based on YOLOv5
In the early stages of a fire outbreak, timely and accurate detection is crucial. However, existing target algorithms struggle to meet the real-time and accuracy requirements for fire detection. Addressing this issue, this paper proposes a new fire detection algorithm, DG-YOLO (Double channels and Group convolution), based on the YOLOv5s model. Firstly, the model introduces a novel dual-branch group convolution structure called DGBlock, which cascades large convolutional kernels to increase the network's receptive field. Moreover, it employs group convolution to reduce computational and parameter complexity, effectively enhancing the network's detection capabilities while lowering computational complexity. Secondly, the Effective Squeeze-and-Excitation (ESE) attention mechanism is utilized to boost the network's long-range modeling ability, guiding the network to focus more on relevant features. Experimental results demonstrate that using the DG-YOLO algorithm achieves a detection accuracy (mAP) of 41.9% on a custom fire dataset, an improvement of 2.8% over the original algorithm. To further validate the network's performance, this paper compares four mainstream algorithms on the COCO 2017 dataset, achieving an mAP of 38.6%, a 1.2% improvement over the original algorithm, effectively confirming the algorithm's efficacy.
- Open Access
- 8 December 2023
- Published by Association for Computing Machinery (ACM)
- p. 161-165
Improved Extended-Kalman-Filter Beam Tracking Algorithm for Indoor Sub-THz Communications
In indoor sub-THz communication systems, due to interference, there is often an angle deviation between the transmitted beam and received beam, resulting in a sharp decline in the quality of receiving signal. In order to better cater to the needs of data transmission, this paper first designs beam precoders at the transmitter based on the concepts of successive interference cancellation (SIC) and equivalent channel. Next, considering the advantages of extended Kalman filter (EKF) algorithm in complexity and adaptability, which is suitable for mobile environments. In this article, we further use EKF for tracking and predicting the real and imaginary part of channel gain, the departure angle of beam separately to achieve the design of beam. Subsequently, the influence of factors such as the size of transmitter arrays and variance of angle changes on the proposed algorithm were studied. The simulation results indicate that proposed algorithm can perform beam tracking well and is suitable for practical mobile communication systems, thereby improving the signal quality and stability of mobile communication systems significantly.
- 8 December 2023
- Published by Association for Computing Machinery (ACM)
- p. 161-165
Open AccessImproved Extended-Kalman-Filter Beam Tracking Algorithm for Indoor Sub-THz Communications
In indoor sub-THz communication systems, due to interference, there is often an angle deviation between the transmitted beam and received beam, resulting in a sharp decline in the quality of receiving signal. In order to better cater to the needs of data transmission, this paper first designs beam precoders at the transmitter based on the concepts of successive interference cancellation (SIC) and equivalent channel. Next, considering the advantages of extended Kalman filter (EKF) algorithm in complexity and adaptability, which is suitable for mobile environments. In this article, we further use EKF for tracking and predicting the real and imaginary part of channel gain, the departure angle of beam separately to achieve the design of beam. Subsequently, the influence of factors such as the size of transmitter arrays and variance of angle changes on the proposed algorithm were studied. The simulation results indicate that proposed algorithm can perform beam tracking well and is suitable for practical mobile communication systems, thereby improving the signal quality and stability of mobile communication systems significantly.
- Open Access
- 30 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 93691-93700
Improved SIC-SVD Hybrid Precoding Algorithm for Indoor Sub-THz Systems
Emerging terahertz (THz) communication will become the main way of wireless communication in the future, it will also use hybrid precoding which combines analog and digital hybrid precoding like millimeter wave communication systems, to reduce the system energy consumption. Indoor as a main scenario for communication, to better meet the demands for data transmission. In this paper, an improved hybrid precoding method based on successive interference cancelation and singular value decomposition (SIC-SVD) is proposed for indoor Sub-THz communication system with sub-connected structures. However, the introduction of phase shifters imposes constant modulus constraints, making the problem of hybrid precoding difficult to solve directly. The proposed method first decomposes the optimization problem of achievable rates for the system, based on the special structure of sub-connected, into a series of equivalent sub-problems. The algorithm first designs the analog precoding matrix according to the SIC method, after obtaining the designed analog precoding matrix, the algorithm defines an equivalent channel and employs singular value decomposition (SVD) to obtain the digital precoding matrix. The simulation results show that compared with the existing method based on SIC, the proposed algorithm has slightly higher achievable rate and is closer to the optimal full-digital precoding method. At the same time, this paper also presents a simple analysis of the proposed algorithm for imperfect channel state information (CSI) with different accuracy. Simulation results show that the spectral efficiency is also very near to the perfect CSI case when the accuracy of the CSI is 0.9.
- 30 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 93691-93700
Open AccessImproved SIC-SVD Hybrid Precoding Algorithm for Indoor Sub-THz Systems
Emerging terahertz (THz) communication will become the main way of wireless communication in the future, it will also use hybrid precoding which combines analog and digital hybrid precoding like millimeter wave communication systems, to reduce the system energy consumption. Indoor as a main scenario for communication, to better meet the demands for data transmission. In this paper, an improved hybrid precoding method based on successive interference cancelation and singular value decomposition (SIC-SVD) is proposed for indoor Sub-THz communication system with sub-connected structures. However, the introduction of phase shifters imposes constant modulus constraints, making the problem of hybrid precoding difficult to solve directly. The proposed method first decomposes the optimization problem of achievable rates for the system, based on the special structure of sub-connected, into a series of equivalent sub-problems. The algorithm first designs the analog precoding matrix according to the SIC method, after obtaining the designed analog precoding matrix, the algorithm defines an equivalent channel and employs singular value decomposition (SVD) to obtain the digital precoding matrix. The simulation results show that compared with the existing method based on SIC, the proposed algorithm has slightly higher achievable rate and is closer to the optimal full-digital precoding method. At the same time, this paper also presents a simple analysis of the proposed algorithm for imperfect channel state information (CSI) with different accuracy. Simulation results show that the spectral efficiency is also very near to the perfect CSI case when the accuracy of the CSI is 0.9.
- Open Access
- 10 February 2022
- Published by Wiley in International Journal of Digital Multimedia Broadcasting
- Vol. 2022, 1-12
Hybrid Beamforming Grouping Sum-Rate Maximization Algorithm for Multiuser mmWave Massive MIMO Systems
For multiuser millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) systems, the key factor that causes the system sum-rate to change is its interference plus noise, corresponding to the number of base station (BS) antennas and signal-to-noise ratio (SNR) variation causing the system sum-rate changes, which in turn affects the user’s communication quality. Based on this, this paper proposes an improved low-complexity hybrid beamforming grouping sum-rate maximization (HBG-SRM) algorithm to achieve system sum-rate maximization under the premise that both BS and user side use hybrid beamforming architecture and the channel state information (CSI) of the downlink channel is perfect. The algorithm first predefines a relevant threshold value, which is used to group multiusers; then, the user uses the maximum likelihood (ML) criterion to identify the optimal beam and estimate its beamforming gain within each group, and finally, the user compares all the candidate optimal beam gains between each group to confirm the optimal beamforming vector. The simulation results also verify the superiority of the proposed algorithm’s sum-rate over other algorithms.
- 10 February 2022
- Published by Wiley in International Journal of Digital Multimedia Broadcasting
- Vol. 2022, 1-12
Open AccessHybrid Beamforming Grouping Sum-Rate Maximization Algorithm for Multiuser mmWave Massive MIMO Systems
For multiuser millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) systems, the key factor that causes the system sum-rate to change is its interference plus noise, corresponding to the number of base station (BS) antennas and signal-to-noise ratio (SNR) variation causing the system sum-rate changes, which in turn affects the user’s communication quality. Based on this, this paper proposes an improved low-complexity hybrid beamforming grouping sum-rate maximization (HBG-SRM) algorithm to achieve system sum-rate maximization under the premise that both BS and user side use hybrid beamforming architecture and the channel state information (CSI) of the downlink channel is perfect. The algorithm first predefines a relevant threshold value, which is used to group multiusers; then, the user uses the maximum likelihood (ML) criterion to identify the optimal beam and estimate its beamforming gain within each group, and finally, the user compares all the candidate optimal beam gains between each group to confirm the optimal beamforming vector. The simulation results also verify the superiority of the proposed algorithm’s sum-rate over other algorithms.