Yanli Liu

Dr. Yanli Liu

Shanghai Dianji University
+1
orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
13 November 2018 in Sensors
Verified
Journal Article
Open access
PDF file
YLYanli Liu
Yanli Liu
HZHeng Zhang
Heng Zhang
HGHanlei Guo
Hanlei Guo
Neal XiongNeal Xiong
Neal Xiong
RGB-D cameras offer both color and depth images of the surrounding environment, making them an attractive option for robotic and vision applications. This work introduces the BRISK_D algorithm, which efficiently combines Features from Accelerated Segment Test (FAST) and Binary Robust Invariant Scalable Keypoints (BRISK) methods. In the BRISK_D algorithm, the keypoints are detected by the FAST algorithm and the location of the keypoint is refined in the scale and the space. The scale factor of the keypoint is directly computed with the depth information of the image. In the experiment, we have made a detailed comparative analysis of the three algorithms SURF, BRISK and BRISK_D from the aspects of scaling, rotation, perspective and blur. The BRISK_D algorithm combines depth information and has good algorithm performance.

14 February 2025 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
HZHeng Zhang
Heng Zhang
YPYang Peng
Yang Peng
YLYanli Liu
Yanli Liu

1 January 2013 in The Scientific World Journal
Verified
Journal Article
Open access
PDF file
YLYanli Liu
Yanli Liu
XFXiaoping Fan
Xiaoping Fan
HZHeng Zhang
Heng Zhang
In recent years, the research on single‐robot simultaneous localization and mapping (SLAM) has made a great success. However, multirobot SLAM faces many challenging problems, including unknown robot poses, unshared map, and unstable communication. In this paper, a map merging algorithm based on virtual robot motion is proposed for multi‐robot SLAM. The thinning algorithm is used to construct the skeleton of the grid map’s empty area, and a mobile robot is simulated in one map. The simulated data is used as information sources in the other map to do partial map Monte Carlo localization; if localization succeeds, the relative pose hypotheses between the two maps can be computed easily. We verify these hypotheses using the rendezvous technique and use them as initial values to optimize the estimation by a heuristic random search algorithm.

20 April 2024 in Applied Soft Computing
Verified
Journal Article
Closed access
PYPeilin Yang
Peilin Yang
YXYinyuan Xiao
Yinyuan Xiao
WZWenguang Zheng
Wenguang Zheng
YLYanli Liu
Yanli Liu
CHChing-Hsien Hsu
Ching-Hsien Hsu

11 October 2023 in Engineering Applications of Artificial Intelligence
Verified
Journal Article
Closed access
RWRuixu Wu
Ruixu Wu
XWXianbin Wen
Xianbin Wen
LYLiming Yuan
Liming Yuan
HXHaixia Xu
Haixia Xu
YLYanli Liu
Yanli Liu

14 July 2016 in Journal of Sensors
Verified
Journal Article
Open access
PDF file
HZHeng Zhang
Heng Zhang
ZWZhenqiang Wen
Zhenqiang Wen
YLYanli Liu
Yanli Liu
GXGang Xu
Gang Xu
This paper looks into the fundamental problem in computer vision: edge detection. We propose a new edge detector using structured random forests as the classifier, which can make full use of RGB-D image information from Kinect. Before classification, the adaptive bilateral filter is used for the denoising processing of the depth image. As data sources, information of 13 channels from RGB-D image is computed. In order to train the random forest classifier, the approximation measurement of the information gain is used. All the structured labels at a given node are mapped to a discrete set of labels using the Principal Component Analysis (PCA) method. NYUD2 dataset is used to train our structured random forests. The random forest algorithm is used to classify the RGB-D image information for extracting the edge of the image. In addition to the proposed methodology, the quantitative comparisons of different algorithms are presented. The results of the experiments demonstrate the significant improvements of our algorithm over the state of the art.