Ke Tan

Ke Tan


Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
13 December 2023 in Computers in Biology and Medicine
Verified
Journal Article
Closed access
ZCZhaomin Chen
Zhaomin Chen
YLYifan Liao
Yifan Liao
XZXingjian Zhou
Xingjian Zhou
WYWenyao Yu
Wenyao Yu
Guodao ZhangGuodao Zhang
Guodao Zhang
KSkeqing shi
keqing shi

31 May 2023 in Micromachines
Verified
Journal Article
Open access
PDF file
YLYong Li
Yong Li
GZGuopei Zeng
Guopei Zeng
LWLuping Wang
Luping Wang
KTKe Tan
Ke Tan
Pedestrian dead reckoning (PDR) is a self-contained positioning technology and has been a significant research topic in recent years. Pedestrian-stride-length estimation is the core part of the PDR system and directly affects the performance of the PDR. The current stride-length-estimation method is difficult to adapt to changes in pedestrian walking speed, which leads to a rapid increase in the error of the PDR. In this paper, a new deep-learning model based on long short-term memory (LSTM) and Transformer, LT-StrideNet, is proposed to estimate pedestrian-stride length. Next, a shank-mounted PDR framework is built based on the proposed stride-length-estimation method. In the PDR framework, the detection of pedestrian stride is achieved by peak detection with a dynamic threshold. An extended Kalman filter (EKF) model is adopted to fuse the gyroscope, accelerometer, and magnetometer. The experimental results show that the proposed stride-length-estimation method can effectively adapt to changes in pedestrian walking speed, and our PDR framework has excellent positioning performance.

1 January 2016
Verified
Conference Paper
Open access
PDF file
KTKe Tan
Ke Tan
YGYuan Gao
Yuan Gao
In the three-dimensional liver reconstruction, in order to decrease shrinkage and make up the lost important details in Laplacian smoothing, we make some improvements to revise the algorithm in this paper.The cost function after Laplacian smoothing process is constructed to make up the lost important details. When the value of cost function is minimum, the result is close to original liver volume. From the results, we can see that volume of the revised algorithm is more closely to the original volume compared with Laplacian smoothing algorithm.