Keli Hu

Dr. Keli Hu

orcid

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
23 June 2022 in Computers in Biology and Medicine
Verified
Journal Article
Closed access
KHKeli Hu
Keli Hu
LZLiping Zhao
Liping Zhao
SFSheng Feng
Sheng Feng
SZShengdong Zhang
Shengdong Zhang
QZQianwei Zhou
Qianwei Zhou
YGYanhui Guo
Yanhui Guo

26 August 2015 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
YZYunlong Zhan
Yunlong Zhan
YGYuzhang Gu
Yuzhang Gu
KHKui Huang
Kui Huang
CZCheng Zhang
Cheng Zhang
KHKeli Hu
Keli Hu
Stereo matching is a challenging problem, and high-accuracy stereo matching is still required in various computer vision applications, e.g., 3-D scanning, autonomous navigation, and 3-D reconstruction. Therefore, we present a novel image-guided stereo matching algorithm, which employs the efficient combined matching cost and multistep disparity refinement, to improve the accuracy of existing local stereo matching algorithms. Different from all the other methods, we introduce a guidance image for the whole algorithm. This filter-based guidance image is generated by extracting the enhanced information from the raw stereo image. The combined matching cost consists of the novel double-RGB gradient, the improved lightweight census transform, and the image color. This cost measurement is robust against image noise and textureless regions in computing the matching cost. Furthermore, a new systemic multistep refinement process, which includes outlier classification, four-direction propagation, leftmost propagation, and an exponential step filter, is proposed to remove the outliers in the raw disparity map. Experiments on the Middlebury benchmark demonstrate our algorithm's superior performance that it ranks first among the 158 submitted algorithms. Moreover, the proposed method is also robust on the 30 Middlebury data sets and the real-world Karlsruhe Institute of Technology and Toyota Technological Institute benchmark.

24 February 2017 in Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
Verified
Journal Article
Open access
PDF file
KHKeli Hu
Keli Hu
JYJun Ye
Jun Ye
EFEn Fan
En Fan
SSShigen Shen
Shigen Shen
LHLongjun Huang
Longjun Huang
JPJiatian Pi
Jiatian Pi
Although appearance based trackers have been greatly improved in the last decade, they are still struggling with some challenges like occlusion, blur, fast motion, deformation, etc. As known, occlusion is still one of the soundness challenges for visual tracking. Other challenges are also not fully resolved for the existed trackers. In this work, we focus on tackling the latter problem in both color and depth domains. Neutrosophic set (NS) is as a new branch of philosophy for dealing with incomplete, indeterminate and inconsistent information. In this paper, we utilize the single valued neutrosophic set (SVNS), which is a subclass of NS, to build a robust tracker. First, the color and depth histogram are employed as the appearance features, and both features are represented in the SVNS domain via three membership functions T , I , and F . Second, the single valued neutrosophic cross-entropy measure is utilized for fusing the color and depth information. Finally, a novel SVNS based MeanShift tracker is proposed. Applied to the video sequences without serious occlusion in the Princeton RGBD Tracking dataset, the performance of our method was compared with those by the state-of-the-art trackers. The results revealed that our method outperforms these trackers when dealing with challenging factors like blur, fast motion, deformation, illumination variation, and camera jitter.

10 May 2023 in Computers in Biology and Medicine
Verified
Journal Article
Closed access
KHKeli Hu
Keli Hu
WCWenping Chen
Wenping Chen
YSYuanZe Sun
YuanZe Sun
XHXiaozhao Hu
Xiaozhao Hu
QZQianwei Zhou
Qianwei Zhou
ZZZirui Zheng
Zirui Zheng

6 January 2020 in IEEE Access
Verified
Journal Article
Open access
HYHongye Yang
Hongye Yang
YGYuzhang Gu
Yuzhang Gu
JZJianchao Zhu
Jianchao Zhu
KHKeli Hu
Keli Hu
XZXiaolin Zhang
Xiaolin Zhang
Skeleton-based human action recognition has become an active research area in recent years. The key to this task is to fully explore both spatial and temporal features. Recently, GCN-based methods modeling the human body skeletons as spatial-temporal graphs, have achieved remarkable performances. However, most GCN-based methods use a fixed adjacency matrix defined by the dataset, which can only capture the structural information provided by joints directly connected through bones and ignore the dependencies between distant joints that are not connected. In addition, such a fixed adjacency matrix used in all layers leads to the network failing to extract multi-level semantic features. In this paper we propose a pseudo graph convolutional network with temporal and channel-wise attention (PGCN-TCA) to solve this problem. The fixed normalized adjacent matrix is substituted with a learnable matrix. In this way, the matrix can learn the dependencies between connected joints and joints that are not physically connected. At the same time, learnable matrices in different layers can help the network capture multi-level features in spatial domain. Moreover, Since frames and input channels that contain outstanding characteristics play significant roles in distinguishing the action from others, we propose a mixed temporal and channel-wise attention. Our method achieves comparable performances to state-of-the-art methods on NTU-RGB+D and HDM05 datasets.

1 September 2017 in Information
Verified
Journal Article
Open access
PDF file
CFChangxing Fan
Changxing Fan
KHKeli Hu
Keli Hu
KHKeli Hu
Keli Hu
JYJun Ye
Jun Ye
Linguistic neutrosophic numbers (LNN) is presented by Fang and Ye in 2017, which can describe the truth, falsity, and indeterminacy linguistic information independently. In this paper, the LNN and the Bonferroni mean operator are merged together to propose a LNN normalized weighted Bonferroni mean (LNNNWBM) operator and a LNN normalized weighted geometric Bonferroni mean (LNNNWGBM) operator and the properties of these two operators are proved. Further, multi-attribute group decision methods are introduced based on the proposed LNNNWBM and LNNNWGBM operators, and then an example is provided to demonstrate the application and validity of the proposed methods. In addition, in order to consider the effect of the parameters p and q on the decision results, different pairs of parameter values are employed to verify the decision results.