Jiahao Shen

Jiahao Shen

Auto-generated profile, based on publicly available information

Jiahao Shen

State Key Laboratory of Virtual Reality Technology and Systems, School of Computer Science and Engineering, Beihang University, Beijing, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 March 2023 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
shuai wangshuai wang
shuai wang
HSHao Sheng
Hao Sheng
Yang ZhangYang Zhang
Yang Zhang
DYDa Yang
Da Yang
JSJiahao Shen
Jiahao Shen
RCRongshan Chen
Rongshan Chen
The rapid increase in the volume of video data generated from edges in the Industrial Internet of Things, opens up new possibilities for enhancing the application of video service. Multicamera multiobject tracking (MCMT) has always been a fundamental task in video surveillance or traffic control. However, the traditional MCMT methods are limited by the communication bottleneck and computation resources of the centralized curator, and suffer from security and privacy issues. In this article, we first design multicamera multihypothesis tracking (MC-MHT) framework to achieve real-time tracking performance among edge cameras. The complex association of objects is described by multiskip trees. The tracking task is well distributed to each camera. Then, we integrate multicamera tracking chain into MC-MHT to ensure security and trust. The state transition of targets in multicamera is illustrated from the perspective of blockchain transactions. The transactions are validated by an integrated tracking consensus to counter Byzantine behavior. Numerical results derived from real-world scenarios and CAMPUS dataset show that the proposed method achieves real-time performance (24–36 FPs) and 79.0–82.4 MOTA indicator, as well as reduces identity switch errors about 71% under Byzantine attack.

11 September 2023 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
Tao ZhangTao Zhang
Tao Zhang
Changqiao XuChangqiao Xu
Changqiao Xu
JSJiahao Shen
Jiahao Shen
XKXiaohui Kuang
Xiaohui Kuang
LGLuigi Alfredo Grieco
Luigi Alfredo Grieco
With the explosive growth of Internet traffic, large sensitive and valuable information is at risk of cyber attacks, which are mostly preceded by network reconnaissance. A moving target defense technique called host address mutation (HAM) helps facing network reconnaissance. However, there still exist several fundamental problems in HAM: 1) current approaches cannot be self-adaptive to adversarial strategies. 2) network state is time-varying because each host decides whether to mutate IP address. 3) most methods mainly focus on enhancing security, but ignore the survivability of existing connections. In this paper, an Intelligence-Driven Host Address Mutation (ID-HAM) scheme is proposed to address aforementioned challenges. We firstly model a Markov decision process (MDP) to describe the mutation process, and design a seamless mutation mechanism. Secondly, to remove infeasible actions from the action space of MDP, we formulate address-to-host assignments as a constrained satisfaction problem. Thirdly, we design an advantage actor-critic algorithm for HAM, which aims to learn from scanning behaviors. Finally, security analysis and extensive simulations highlight the effectiveness of ID-HAM. Compared with state-of-the-art solutions, ID-HAM can decrease maximum 25% times of scanning hits while only influencing communication slightly. We also implemented a proof-of-concept prototype system to conduct experiments with multiple scanning tools.

14 December 2023 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
JSJiahao Shen
Jiahao Shen
HSHao Sheng
Hao Sheng
shuai wangshuai wang
shuai wang
RCRuixuan Cong
Ruixuan Cong
DYDa Yang
Da Yang
Yang ZhangYang Zhang
Yang Zhang
With the development of smart cities, video surveillance has become more prevalent in urban areas. The rapid growth of data brings challenges to video processing and analysis. Multi-object tracking (MOT), one of the most fundamental tasks in computer vision, has a wide range of applications and development prospects. MOT aims to locate multiple objects and maintain their unique identities by analyzing the video frame by frame. Most existing MOT frameworks are deployed in centralized systems, which are convenient for management but have problems such as weak algorithm adaptability, limited system scalability, and poor data security. In this paper, we propose a distributed MOT algorithm based on multi-agent reinforcement learning (DMARL-Tracker), which formulates MOT as a Markov decision process (MDP). Each object adjusts its tracking strategy during interactions with the environment. The benchmark results on MOT17 and MOT20 prove that our proposed algorithm achieves state-of-the-art (SOTA) performance. Based on this, we further integrate DMARL-Tracker into the blockchain and propose a blockchain-based collaborative MOT framework. All nodes collaborate and share information through the blockchain, achieving adaptation in different complex scenarios while ensuring data security. The simulation results show that our framework achieves good performance in terms of tracking and resource consumption.

20 October 2023 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
HSHao Sheng
Hao Sheng
shuai wangshuai wang
shuai wang
HCHaobo Chen
Haobo Chen
DYDa Yang
Da Yang
YHYang Huang
Yang Huang
WKWei Ke
Wei Ke
Vehicle Re-Identification (ReID) aims to find images of the same vehicle from different videos. It remains a challenging task in the video analysis field due to the huge appearance discrepancy of the same vehicle in cross-view matching and the subtle difference of different similar vehicles in same-view matching. In this paper, we propose a Co-occurrence Attention Net (CAN) to deal with these two challenges. Specifically, CAN consists of two branches, a main branch and an aware branch. The main branch is in charge of extracting global features that are consistent in most views. This feature encodes holistic information such as color and pose, however, it can not handle cross/same-view hard cases, as shown in Fig.1. Therefore, the aware branch is designed to focus on the local details and viewpoint information, which can become an important complement for those hard cases. Considering that the positions of local areas such as wheels and logos change with the viewpoint, Aware Attention Module is introduced to find the hidden relationship among local areas and seamlessly combine the viewpoint information simultaneously. Then, CAN is trained by a partition-and-reunion-based loss, which can narrow the intra-class distance and increase the inter-class distance. Further, an adaptive co-occurrence view emphasize strategy is adopted to fully utilize the learned features. Experimental results on three widely used datasets including VeRi-776, VehicleID and VERI-Wild demonstrate the effectiveness of our method and competitive performance with other state-of-the-art methods.

19 August 2019 in IEEE Transactions on Broadcasting
Verified
Journal Article
Closed access
Shujie YangShujie Yang
Shujie Yang
Changqiao XuChangqiao Xu
Changqiao Xu
LZLujie Zhong
Lujie Zhong
JSJiahao Shen
Jiahao Shen
GMGabriel-Miro Muntean
Gabriel-Miro Muntean
Quality of Experience (QoE) reflects end users' overall experience and feeling with network services, but needs support in terms of end-to-end Quality of Service (QoS). Segment routing (SR) as a new routing paradigm can provide good end-to-end QoS guarantee, making traditional multimedia traffic routing more efficient and scalable. In this paper, we address two problems related to the new SR mechanism: enabling fine-grained end-to-end QoS routing under a complex network environment and constructing the multicast routing tree with branch node load balancing. To solve these problems, an Inaccurate information-based QoE-driven Routing algorithm (IQdR) and a Branch-aware Multicast Tree (BaMT) algorithm were proposed. Simulation test results that have compared the performance of our proposed solution against that of other algorithms show that the previous works were outperformed. Additionally, the results also show that our multicast architecture improves the scalability of the network in terms of the number of flows.

26 December 2023 in IEEE Transactions on Intelligent Vehicles
Verified
Journal Article
Closed access
shuai wangshuai wang
shuai wang
DYDa Yang
Da Yang
HSHao Sheng
Hao Sheng
JSJiahao Shen
Jiahao Shen
Yang ZhangYang Zhang
Yang Zhang
WKWei Ke
Wei Ke
Vehicle re-identification (ReID) is a hot topic in intelligent city surveillance. With the development of smart cameras and vehicular edge computing (VEC), numerous media data has opened up new possibilities for enhancing the applications of vehicle ReID. However, traditional vehicle re-identification systems face the following challenges: 1) it is difficult to recognize the identities of the vehicles in various views and similar appearance, 2) the current system is hard to be extended to large-scale of cameras in a low-trust VEC environment. To solve these problems, we propose a Blockchain-based Collaborative Vehicle ReID (BCV-ReID) system in this paper. It contains two core parts including Viewpoint-identity Query Net (VQNet) and VehicleChain (VChain). By utilizing the viewpoint information and local details simultaneously, VQNet can distinguish the vehicle identities in various cross-camera scenes. It employs viewpoint queries and spatial self-attention to learn the inherent correlation of the vehicle parts, enhancing the ability to distinguish vehicles among various viewpoints. Then, we integrate VChain with VQNet to realize a collaborative vehicle ReID system. The ReID task is illustrated from the perspective of blockchain transactions. All transactions are validated by a deeply integrated ReID consensus to counter potential malicious attacks. Experiments show that the proposed method achieves comparable results in three famous ReID datasets, as well as outstanding performance in real applications.