Haosong Gou
Research Subjects
Haosong Gou has a total of 44 co-authors. Here are the top co-authors by number of shared publications:
- Pengfei Du
Xihua University
5 shared publications - Chao Ren
Sichuan University
3 shared publications Gaoyi Zhang
School of Information and Software Engineering, University of Electronic Science and Technology of China, Chengdu, China
3 shared publications- Daosen Zhai
Northwestern Polytechnical University
2 shared publications - Linbo Qing
College of Electronics and Information Engineering, Sichuan University, Chengdu 610065, China
2 shared publications - Wang Tang
College of Electronics and Information Engineering, Sichuan University, Chengdu, China
2 shared publications
Latest Publications
- 12 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 36 (5) , 6542-6557
Progressive Reasoning-Based Group Activity Recognition
Group activity recognition (GAR) plays a crucial role in computer vision, enabling the exploration and comprehension of human behavior patterns. Existing methods mainly focus on dyad-level interactions within a group, but sociological studies have highlighted the importance of individual features, subgroup-level interactions, and overall group structure for understanding group activities. Therefore, we propose a new framework, the progressive group activity reasoning model (PGAR), which models these four aspects for GAR. Initially, we construct a person-person graph (PPG) using individual features to capture dyadic interactions. Subsequently, the PPG is fed into a novel ingredient graph model (Ingredient-GNN) for capturing subgroup-level interactions. Finally, we fuse the dyad-level and subgroup-level interactions with global information of group structure, obtained through an F-Formation modeling module, to form comprehensive representations for GAR. The F-Formation modeling module decouples the group structure into position, orientation, and skeleton graphs, and subsequently performs attribute recoupling at the individual level using the designed Tri-Coupling Transformer to form a global representation of the group structure. Extensive experiments on four public datasets demonstrate that our final model effectively integrates multi-level representations for group activity understanding, with our F-Formation modeling module outperforming comparable methods that rely solely on non-visual data.
- 12 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 36 (5) , 6542-6557
Progressive Reasoning-Based Group Activity Recognition
Group activity recognition (GAR) plays a crucial role in computer vision, enabling the exploration and comprehension of human behavior patterns. Existing methods mainly focus on dyad-level interactions within a group, but sociological studies have highlighted the importance of individual features, subgroup-level interactions, and overall group structure for understanding group activities. Therefore, we propose a new framework, the progressive group activity reasoning model (PGAR), which models these four aspects for GAR. Initially, we construct a person-person graph (PPG) using individual features to capture dyadic interactions. Subsequently, the PPG is fed into a novel ingredient graph model (Ingredient-GNN) for capturing subgroup-level interactions. Finally, we fuse the dyad-level and subgroup-level interactions with global information of group structure, obtained through an F-Formation modeling module, to form comprehensive representations for GAR. The F-Formation modeling module decouples the group structure into position, orientation, and skeleton graphs, and subsequently performs attribute recoupling at the individual level using the designed Tri-Coupling Transformer to form a global representation of the group structure. Extensive experiments on four public datasets demonstrate that our final model effectively integrates multi-level representations for group activity understanding, with our F-Formation modeling module outperforming comparable methods that rely solely on non-visual data.
- 16 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 72 (1) , 361-372
Energy-Efficient Robust Trajectory Optimization, Power Allocation, and User Scheduling for UAV-Based Wireless Networks
As an important consumer electronic product, Unmanned Aerial Vehicle (UAV) can be widely used in the area of wireless communications, e.g., emergency communications, relay transmission, hot-spot support, and so on. However, the current works usually ignore the uncertainty of the users’ position, resulting in invalidity of the designed algorithms especially for ensuring the Quality of Service (QoS) of users. Considering this factor, we formulate a robust optimization problem with joint trajectory optimization, power allocation, and user scheduling to minimize the total energy consumption of UAV. To solve the robust problem, we first reformulate it as a deterministic form based on the Bernstein-type inequality and then design an iterative algorithm based on the block coordinate descent method. For the subproblems in the iterative algorithm, we analyze their characteristics to get the explicit expression of the optimal solutions or design efficient algorithms by sequential convex approximation. Simulation results indicate that our proposed algorithms exhibit good convergence performance and greatly outperform the existing algorithms in terms of energy consumption and QoS guarantee.
- 16 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 72 (1) , 361-372
Energy-Efficient Robust Trajectory Optimization, Power Allocation, and User Scheduling for UAV-Based Wireless Networks
As an important consumer electronic product, Unmanned Aerial Vehicle (UAV) can be widely used in the area of wireless communications, e.g., emergency communications, relay transmission, hot-spot support, and so on. However, the current works usually ignore the uncertainty of the users’ position, resulting in invalidity of the designed algorithms especially for ensuring the Quality of Service (QoS) of users. Considering this factor, we formulate a robust optimization problem with joint trajectory optimization, power allocation, and user scheduling to minimize the total energy consumption of UAV. To solve the robust problem, we first reformulate it as a deterministic form based on the Bernstein-type inequality and then design an iterative algorithm based on the block coordinate descent method. For the subproblems in the iterative algorithm, we analyze their characteristics to get the explicit expression of the optimal solutions or design efficient algorithms by sequential convex approximation. Simulation results indicate that our proposed algorithms exhibit good convergence performance and greatly outperform the existing algorithms in terms of energy consumption and QoS guarantee.
- 11 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 72 (1) , 1672-1684
Energy-Efficient Trajectory Design and Resource Allocation for Multi-Drone-Enabled ISAC in IoT Networks
The multi-UAV-enabled integrated sensing and communication (ISAC) system has emerged as a promising paradigm for jointly supporting wireless connectivity and environmental perception in internet of things (IoT) networks. However, the energy-intensive nature of UAVs’ operations poses significant challenges for the large-scale and long-duration deployments. Thus, we propose an energy-efficient trajectory design and resource allocation algorithm to minimize the weighted sum of UAVs’ communication-sensing energy and propulsion energy subject to the quality of service (QoS) requirements of all users in ISAC IoT networks. To be specific, a comprehensive system model is formulated, encompassing the UAVs’ dynamics, communication and sensing channel models, and QoS of the ground IoT users. Subsequently, this formulated non-convex optimization problem is decomposed into three subproblems: three-dimensional (3D) trajectory planning, power allocation, and users scheduling. Each subproblem is convexified using the successive convex approximation (SCA) and solved efficiently with CVX, while the global coordination is achieved via the alternating optimization. Abundant simulations are conducted to demonstrate that the proposed algorithm achieves an average 35.6% reduction in total energy consumption compared with the benchmark methods, while ensuring all IoT nodes meet the stringent QoS requirements. The proposed algorithm also exhibits the strong scalability, robustness, and low computational complexity, which can improve the performance of the UAV related consumer electronics in IoT networks.
- 11 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 72 (1) , 1672-1684
Energy-Efficient Trajectory Design and Resource Allocation for Multi-Drone-Enabled ISAC in IoT Networks
The multi-UAV-enabled integrated sensing and communication (ISAC) system has emerged as a promising paradigm for jointly supporting wireless connectivity and environmental perception in internet of things (IoT) networks. However, the energy-intensive nature of UAVs’ operations poses significant challenges for the large-scale and long-duration deployments. Thus, we propose an energy-efficient trajectory design and resource allocation algorithm to minimize the weighted sum of UAVs’ communication-sensing energy and propulsion energy subject to the quality of service (QoS) requirements of all users in ISAC IoT networks. To be specific, a comprehensive system model is formulated, encompassing the UAVs’ dynamics, communication and sensing channel models, and QoS of the ground IoT users. Subsequently, this formulated non-convex optimization problem is decomposed into three subproblems: three-dimensional (3D) trajectory planning, power allocation, and users scheduling. Each subproblem is convexified using the successive convex approximation (SCA) and solved efficiently with CVX, while the global coordination is achieved via the alternating optimization. Abundant simulations are conducted to demonstrate that the proposed algorithm achieves an average 35.6% reduction in total energy consumption compared with the benchmark methods, while ensuring all IoT nodes meet the stringent QoS requirements. The proposed algorithm also exhibits the strong scalability, robustness, and low computational complexity, which can improve the performance of the UAV related consumer electronics in IoT networks.
- 6 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 13 (2) , 1873-1887
Where to Go: A Spatial Social Force Graph Neural Network for Predicting Pedestrian Trajectories From Videos With Complex Motion Scenarios
Traditional pedestrian trajectory prediction models focus on spatio–temporal data without proper consideration of individual interactions with the environment, mutual interactions, and contextual information, resulting in low prediction performance in real applications. In this article, we propose a new pedestrian trajectory prediction model called spatial social force graph neural network (SSF-GNN). First, SSF-GNN adopts a gate recurrent unit (GRU) network and a CenterNet network to capture pedestrian trajectory features and environmental features from historical trajectory sequences. Particularly, SSF-GNN can quantify pedestrian interactions and context-awareness information based on social force. Second, SSF-GNN employs a graph neural network to integrate social influence and hidden states of pedestrians. The distance between adjacent trajectory points is approximated by the weighted average summation of pedestrian historical trajectories. Third, SSF-GNN employs a new interaction function between pedestrians by considering the distance between pedestrians, as well as the movement speed of pedestrians in the social force model, to accurately predict trajectories of pedestrians. Extensive experiments are conducted on two famous datasets, and the results demonstrate SSF-GNN’s outperforms the state-of-the-art models, where average displacement error (ADE) is reduced by more than 25.6%, and final displacement error (FDE) is reduced by more than 15.4%. When predicting a pedestrian’s trajectory in the next eight frames of locations, SSF-GNN outperforms other models significantly with an accuracy of 69.71%.
- 6 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 13 (2) , 1873-1887
Where to Go: A Spatial Social Force Graph Neural Network for Predicting Pedestrian Trajectories From Videos With Complex Motion Scenarios
Traditional pedestrian trajectory prediction models focus on spatio–temporal data without proper consideration of individual interactions with the environment, mutual interactions, and contextual information, resulting in low prediction performance in real applications. In this article, we propose a new pedestrian trajectory prediction model called spatial social force graph neural network (SSF-GNN). First, SSF-GNN adopts a gate recurrent unit (GRU) network and a CenterNet network to capture pedestrian trajectory features and environmental features from historical trajectory sequences. Particularly, SSF-GNN can quantify pedestrian interactions and context-awareness information based on social force. Second, SSF-GNN employs a graph neural network to integrate social influence and hidden states of pedestrians. The distance between adjacent trajectory points is approximated by the weighted average summation of pedestrian historical trajectories. Third, SSF-GNN employs a new interaction function between pedestrians by considering the distance between pedestrians, as well as the movement speed of pedestrians in the social force model, to accurately predict trajectories of pedestrians. Extensive experiments are conducted on two famous datasets, and the results demonstrate SSF-GNN’s outperforms the state-of-the-art models, where average displacement error (ADE) is reduced by more than 25.6%, and final displacement error (FDE) is reduced by more than 15.4%. When predicting a pedestrian’s trajectory in the next eight frames of locations, SSF-GNN outperforms other models significantly with an accuracy of 69.71%.
- 24 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 36 (10) , 18448-18462
GBPG-Net: Global Background Prior-Guided Rain and Snow Image Restoration
The aim of image restoration in the presence of rain and snow effects is to eliminate these disturbances while retaining the underlying background structure. Most existing methods tend to directly learn the mapping from corrupted images to clean ones, often resulting in residual rain or snow artifacts and compromised background structures. In this work, both theoretical analysis and experimental findings confirm the robustness of the hue channel in HSV color space to rain and snow disturbances, even when extracted from corrupted images. Motivated by this insight, we propose to leverage the global clean background cues inherent in the hue channel to guide the network in preserving the image background structure and removing interference. To this end, we introduce the global background prior-guided network (GBPG-Net) for restoring rain and snow-affected images, which employs a triangular formation to facilitate continuous interaction and updating of the global background prior (GBP) with the image feature within the GBPG-unit, resulting in improved interference removal and background structure preservation. Specifically, the GBPG-Net incorporates the global clean background prior injector (GCBPI) to inject the GBP into the network. Subsequently, the prior-guided local detail excavation (PGLDE) module, built on GCBPI, further refines interference removal and structure preservation to process local details intricately. Finally, the prior-guided local-global aggregation (PGLGA) module aggregates global background features with local detailed features, enabling the network to better understand the overall content and subtle interference for more accurate reconstruction. Quantitative and qualitative evaluations on synthetic and real datasets demonstrate the effectiveness of the proposed GBPG-Net in deraining and desnowing tasks, highlighting its advantages over existing methods. The code and supplementary documentation are available at https://github.com/liux520/GBPG-Net
- 24 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 36 (10) , 18448-18462
GBPG-Net: Global Background Prior-Guided Rain and Snow Image Restoration
The aim of image restoration in the presence of rain and snow effects is to eliminate these disturbances while retaining the underlying background structure. Most existing methods tend to directly learn the mapping from corrupted images to clean ones, often resulting in residual rain or snow artifacts and compromised background structures. In this work, both theoretical analysis and experimental findings confirm the robustness of the hue channel in HSV color space to rain and snow disturbances, even when extracted from corrupted images. Motivated by this insight, we propose to leverage the global clean background cues inherent in the hue channel to guide the network in preserving the image background structure and removing interference. To this end, we introduce the global background prior-guided network (GBPG-Net) for restoring rain and snow-affected images, which employs a triangular formation to facilitate continuous interaction and updating of the global background prior (GBP) with the image feature within the GBPG-unit, resulting in improved interference removal and background structure preservation. Specifically, the GBPG-Net incorporates the global clean background prior injector (GCBPI) to inject the GBP into the network. Subsequently, the prior-guided local detail excavation (PGLDE) module, built on GCBPI, further refines interference removal and structure preservation to process local details intricately. Finally, the prior-guided local-global aggregation (PGLGA) module aggregates global background features with local detailed features, enabling the network to better understand the overall content and subtle interference for more accurate reconstruction. Quantitative and qualitative evaluations on synthetic and real datasets demonstrate the effectiveness of the proposed GBPG-Net in deraining and desnowing tasks, highlighting its advantages over existing methods. The code and supplementary documentation are available at https://github.com/liux520/GBPG-Net
- 4 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 21 (7) , 5138-5149
Transformer-Style Convolutional Network for Efficient Natural and Industrial Image Superresolution
Single image superresolution (SISR) is a critical task in computer vision with significant applications in both natural and industrial contexts. Although transformer-based approaches for SISR have achieved notable progress due to their exceptional representational capabilities, their quadratic computational complexity poses challenges for deployment on devices with limited resources. Conversely, convolutional networks (ConvNets) are inherently efficient but have difficulty capturing long-range pixel relationships because of their focus on spatial locality. This gives rise to a complementary relationship between the representational power of transformers and the efficiency of ConvNets, both of which are essential for practical applications. Motivated by this, in this article, we introduce TSCN, a novel transformer-style ConvNet. Our analysis highlights the strengths of transformers, including large-range dependencies modeling, two-order features interaction, input self-adaptation, and incorporating advanced components. Based on these insights, we guide the design of ConvNets to fully exploit these characteristics. Specifically, we rethink spatial convolution to enhance the modeling of spatial features and modify the macrostructure of the transformer by replacing self-attention and feed-forward network with the large-range multiorder convolution modulation (LMCM) layer and spatial awareness dynamic feature flow (SADFF) layer. The LMCM integrates reweighting into the large-range convolutional modulation technology, allowing self-adaptive recalibration of input representations using convolutional features as weight matrices and multiorder features interaction. In addition, the SADFF introduces spatial awareness, locality, and dynamic information flow modulation between layers. Experimental results demonstrate that our TSCN outperforms the state-of-the-art method SRFormer on multiple benchmarks by 0.03$\sim$ 0.17 dB, while using fewer parameters and computations.
- 4 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 21 (7) , 5138-5149
Transformer-Style Convolutional Network for Efficient Natural and Industrial Image Superresolution
Single image superresolution (SISR) is a critical task in computer vision with significant applications in both natural and industrial contexts. Although transformer-based approaches for SISR have achieved notable progress due to their exceptional representational capabilities, their quadratic computational complexity poses challenges for deployment on devices with limited resources. Conversely, convolutional networks (ConvNets) are inherently efficient but have difficulty capturing long-range pixel relationships because of their focus on spatial locality. This gives rise to a complementary relationship between the representational power of transformers and the efficiency of ConvNets, both of which are essential for practical applications. Motivated by this, in this article, we introduce TSCN, a novel transformer-style ConvNet. Our analysis highlights the strengths of transformers, including large-range dependencies modeling, two-order features interaction, input self-adaptation, and incorporating advanced components. Based on these insights, we guide the design of ConvNets to fully exploit these characteristics. Specifically, we rethink spatial convolution to enhance the modeling of spatial features and modify the macrostructure of the transformer by replacing self-attention and feed-forward network with the large-range multiorder convolution modulation (LMCM) layer and spatial awareness dynamic feature flow (SADFF) layer. The LMCM integrates reweighting into the large-range convolutional modulation technology, allowing self-adaptive recalibration of input representations using convolutional features as weight matrices and multiorder features interaction. In addition, the SADFF introduces spatial awareness, locality, and dynamic information flow modulation between layers. Experimental results demonstrate that our TSCN outperforms the state-of-the-art method SRFormer on multiple benchmarks by 0.03$\sim$ 0.17 dB, while using fewer parameters and computations.
- 11 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 71 (2) , 3156-3168
A Distributed and Robust Topology Control Scheme for Drone Swarm Networks
Unmanned aerial vehicle (UAV) swarm can be widely used in the area of consumer electronics, e.g., flying display, live broadcast, unmanned logistics, etc. To support the collaboration of multiple UAVs, a connected and robust network topology is essential. This paper investigates the distributed and robust topology control scheme for UAV swarm networks. Firstly, the paper analyzes the logical relationship between critical node, robustness, and k-hop subgraph. Guided by the analysis, this paper proposes a distributed critical node detection algorithm by using the geometrical relationship of neighbors and the khop local topology. For the detected critical nodes, this paper models the k-hop local topology as a simplified block tree and adopts the minimum spanning tree algorithm to search the reinforcement edges. Through node movement, the reinforcement edges are added into the graph (network) and the critical nodes are effectively eliminated. Abundant simulation results indicate that the proposed algorithms can strike a good balance between accuracy and overhead and greatly outperform the classical topology control algorithms especially in large-scale networks. Besides, the simulation study provides some useful design guidance for robust topology control of UAV swarm networks, which can enhance the performance of the UAV related consumer electronics.
- 11 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 71 (2) , 3156-3168
A Distributed and Robust Topology Control Scheme for Drone Swarm Networks
Unmanned aerial vehicle (UAV) swarm can be widely used in the area of consumer electronics, e.g., flying display, live broadcast, unmanned logistics, etc. To support the collaboration of multiple UAVs, a connected and robust network topology is essential. This paper investigates the distributed and robust topology control scheme for UAV swarm networks. Firstly, the paper analyzes the logical relationship between critical node, robustness, and k-hop subgraph. Guided by the analysis, this paper proposes a distributed critical node detection algorithm by using the geometrical relationship of neighbors and the khop local topology. For the detected critical nodes, this paper models the k-hop local topology as a simplified block tree and adopts the minimum spanning tree algorithm to search the reinforcement edges. Through node movement, the reinforcement edges are added into the graph (network) and the critical nodes are effectively eliminated. Abundant simulation results indicate that the proposed algorithms can strike a good balance between accuracy and overhead and greatly outperform the classical topology control algorithms especially in large-scale networks. Besides, the simulation study provides some useful design guidance for robust topology control of UAV swarm networks, which can enhance the performance of the UAV related consumer electronics.
- 29 January 2025
- Published by Springer Nature in Wireless Networks
- Vol. 31 (3) , 2591-2602
Network design for 6 G massive connectivity with aerial networks
- 29 January 2025
- Published by Springer Nature in Wireless Networks
- Vol. 31 (3) , 2591-2602
Network design for 6 G massive connectivity with aerial networks
- 16 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 12 (2) , 750-762
A Scalable Distributed Link Management Method for Massive IoT With Synchronous Message Passing Neural Network
The development of the next generation ubiquitous network has put forward higher requirements for the connection density of communication devices, which has led to a lot of research on link management. However, with the expansion of network scale, the weaknesses of the existing algorithms in computing efficiency, performance, and realizability have become prominent. The emerging graph neural network (GNN) provides a new way to solve this problem. In order to make full use of the broadcast feature of wireless communication, we design a cross-domain distributed GNN structure (named as synchronous message passing neural network (SynMPNN)) combining the measurable index of the actual scene with message passing mechanism. This new GNN structure and the additional input feature dimension (i.e., SINR) work together to provide more comprehensive information for network training. After the initial deployment of the power decision from SynMPNN, we select some links to shut down and others to reduce their transmit power to further improve the system performance and save energy. Simulation results show that our proposed method under distributed execution conditions reaches 83.1% performance of the centralized method. In addition, the discussion on scalability suggests that in order to save training cost, small-scale scenes with the same density can be selected for training in the application of large-scale scenes.
- 16 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 12 (2) , 750-762
A Scalable Distributed Link Management Method for Massive IoT With Synchronous Message Passing Neural Network
The development of the next generation ubiquitous network has put forward higher requirements for the connection density of communication devices, which has led to a lot of research on link management. However, with the expansion of network scale, the weaknesses of the existing algorithms in computing efficiency, performance, and realizability have become prominent. The emerging graph neural network (GNN) provides a new way to solve this problem. In order to make full use of the broadcast feature of wireless communication, we design a cross-domain distributed GNN structure (named as synchronous message passing neural network (SynMPNN)) combining the measurable index of the actual scene with message passing mechanism. This new GNN structure and the additional input feature dimension (i.e., SINR) work together to provide more comprehensive information for network training. After the initial deployment of the power decision from SynMPNN, we select some links to shut down and others to reduce their transmit power to further improve the system performance and save energy. Simulation results show that our proposed method under distributed execution conditions reaches 83.1% performance of the centralized method. In addition, the discussion on scalability suggests that in order to save training cost, small-scale scenes with the same density can be selected for training in the application of large-scale scenes.
- 22 January 2024
- Published by Springer Nature in Cognitive Computation
- Vol. 16 (5) , 2471-2486
A Cognitive Medical Decision Support System for IoT-Based Human-Computer Interface in Pervasive Computing Environment
- 22 January 2024
- Published by Springer Nature in Cognitive Computation
- Vol. 16 (5) , 2471-2486
A Cognitive Medical Decision Support System for IoT-Based Human-Computer Interface in Pervasive Computing Environment