Jiahui Chen

Jiahui Chen

Auto-generated profile, based on publicly available information

Jiahui Chen

Beihang University

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
19 November 2018 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
HSHao Sheng
Hao Sheng
Yang ZhangYang Zhang
Yang Zhang
JCJiahui Chen
Jiahui Chen
ZXZhang Xiong
Zhang Xiong
Jun ZhangJun Zhang
Jun Zhang
Tracking-by-detection is one of the most popular approaches for tracking multiple objects in which the detector plays an important role. Sometimes detector failures caused by occlusions or various poses are unavoidable and lead to tracking failure. To cope with this problem, we construct a heterogeneous association graph that fuses high-level detections and low-level image evidence for target association. Compared with other methods of using low-level information, our proposed Heterogeneous Association Fusion(HAF) tracker is less sensitive to particular parameters and is easier to extend and implement. We use the fused association graph to build track trees for HAF and solve them by the multiple hypotheses tracking (MHT) framework, which has been proven competitive by introducing efficient pruning strategies. In addition, a novel idea of adaptive weights is proposed to analyze the contribution between motion and appearance. We also evaluate our results on the MOT challenge benchmarks and achieve state-of-the-art results on the MOT Challenge 2017.

13 November 2018 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Open access
HSHao Sheng
Hao Sheng
JCJiahui Chen
Jiahui Chen
Yang ZhangYang Zhang
Yang Zhang
WKWei Ke
Wei Ke
ZXZhang Xiong
Zhang Xiong
JYJingyi Yu
Jingyi Yu
This paper proposes a novel iterative maximum weighted independent set(MWIS) algorithm for multiple hypothesis tracking(MHT) in a tracking-by-detection framework. MHT converts the tracking problem into a series of MWIS problems across the tracking time. Previous works solve these NP-hard MWIS problems independently without the use of any prior information from each frame, and they ignore the relevance between adjacent frames. In this work, we iteratively solve the MWIS problems by using the MWIS solution from the previous frame rather than solving the problem from scratch each time. First, we define five hypothesis categories and hypothesis transfer model, which explicitly describes the hypothesis relationship between adjacent frames. We also propose a polynomial-time approximation algorithm for the MWIS problem in MHT. In addition to that, we present a confident short tracklet generation method and incorporate tracklet-level association into MHT, which further improve the computational efficiency. Our experiments on both MOT16 and MOT17 benchmarks show that our tracker outperforms all the previously published tracking algorithms on both MOT16 and MOT17 benchmarks. Lastly, we demonstrate that the polynomial-time approximate tracker reaches nearly the same tracking performance.

1 May 2014
Verified
Conference Paper
Closed access
YHYan Huang
Yan Huang
HSHao Sheng
Hao Sheng
JCJiahui Chen
Jiahui Chen
This paper proposes a novel method for the timely selection of a shortest travel time route for drivers. The problem is formulated as a path planning problem: traffic congestion avoidance in an urban traffic network using multi-source traffic information. The key idea is to compute the travel time for each road section and to dynamically select the fastest path according to the traffic. We collect traffic information from the Internet and combine this current information with historical data for path planning. This information defines traffic hotspots that could produce traffic jams on the road. An improved traffic impedance model is used for calculating the road travel time in this paper according to the traffic conditions. The improved impedance model needs to import the impact level of traffic hotspots, so we also proposed a novel time-space influence model for calculating the hotspots impedance level on the road. In order to obtain the final path, we update the operation on the queue in the SPFA algorithm for dynamic routing on stochastic traffic network. Experiments on the real scenario using Google map for navigation for drivers demonstrate a shortest travel time path effectively.


19 October 2020 in arXiv
Verified
Preprint
Open access
PDF file
KWKe Wang
Ke Wang
Youlong WuYoulong Wu
Youlong Wu
SCShujie Cao
Shujie Cao
JCJiahui Chen
Jiahui Chen
In this paper, we consider a cache-aided relay network, where a single server consisting of a library of N files connects with K1 relays through a shared noiseless link, and each relay connects with K2 users through a shared noiseless link. Each relay and user are equipped with a cache memory of M1 and M2 files, respectively. We propose a centralized and a decentralized coded caching scheme that exploit the spared transmission time resource by allowing concurrent transmission between the two layers. It is shown that both caching schemes are approximately optimal, and greatly reduce the transmission delay compared to the previously known caching schemes. Surprisingly, we show that when the relay's caching size is equal to a threshold that is strictly smaller than N (e.g. M1=0.382N under the decentralized setup and (K1-1)N/K1 under the centralized setup, when K1=2), our schemes achieve the same delay as if each relay had access to the full library. To our best knowledge, this is the first result showing that even the caching size is strictly smaller than the library's size, increasing the caching size is wasteful in reducing the transmission latency.

12 August 2018
Verified
Book Chapter
Closed access
PDF file
CLChao Li
Chao Li
KQKun Qian
Kun Qian
JCJiahui Chen
Jiahui Chen
GXGuangtao Xue
Guangtao Xue
HSHao Sheng
Hao Sheng
WKWei Ke
Wei Ke