Lingli Yu

dblp:89/7767 · DBLP profile ↗
← Back
16ranked-venue papers
8as first author
10since 2021 · last 2025
0000-0002-3690-8569ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 14 · 6 first-author · 10 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author
YearPublicationVenuePosition
2025 A two-stage point elimination with salient fusion features for point cloud registration
Baifan Chen, Zeshun Zhou, Limei Liu, Lingli Yu, Xushi Li
Eng. Appl. Artif. Intell.4
2025 R-Net: Recursive decoder with edge refinement network for salient object detection
Hui Wang 0069, Yuqian Zhao 0001, Fan Zhang 0106, Gui Gui, Lingli Yu, Baifan Chen, Miao Liao, Chunhua Yang 0001, Weihua Gui 0001
Expert Syst. Appl.5
2025 Multi-scale spatio-temporal memory network for semi-supervised video object segmentation
Hui Wang 0069, Yuqian Zhao 0001, Fan Zhang 0106, Lingli Yu, Chunhua Yang 0001
Neurocomputing4
2025 TPDC: Point Cloud Completion by Triangular Pyramid Features and Divide-and-Conquer in Complex Environments
abstract
Point cloud completion recovers the complete point clouds from partial ones, providing numerous point cloud information for downstream tasks such as 3-D reconstruction and target detection. However, previous methods usually suffer from unstructured prediction of points in local regions and the discrete nature of the point cloud. To resolve these problems, we propose a point cloud completion network called TPDC. Representing the point cloud as a set of unordered features of points with local geometric information, we devise a Triangular Pyramid Extractor (TPE), using the simplest 3-D structure-a triangular pyramid-to convert the point cloud to a sequence of local geometric information. Our insight of revealing local geometric information in a complex environment is to design a Divide-and-Conquer Splitting Module in a Divide-and-Conquer Splitting Decoder (DCSD) to learn point-splitting patterns that can fit local regions the best. This module employs the Divide-and-Conquer approach to parallelly handle tasks related to fitting ground-truth values to base points and predicting the displacement of split points. This approach aims to make the base points align more closely with the ground-truth values while also forecasting the displacement of split points relative to the base points. Furthermore, we propose a more realistic and challenging benchmark, ShapeNetMask, with more random point cloud input, more complex random item occlusion, and more realistic random environmental perturbations. The results show that our method outperforms both widely used benchmarks as well as the new benchmark.
Baifan Chen, Xiaotian Lv, Yuqian Zhao 0001, Lingli Yu
IEEE Trans. Neural Networks Learn. Syst.4
2024 Few-shot classification with intra-class co-salient learning and holistic metric
Baifan Chen, Ruyi Zhu, Lingli Yu
Neural Comput. Appl.3
2023 Cooperative offensive decision-making for soccer robots based on bi-channel Q-value evaluation MADDPG
Lingli Yu, Shuxin Huo
Eng. Appl. Artif. Intell.1
2023 Hybrid attention-oriented experience replay for deep reinforcement learning and its application to a multi-robot cooperative hunting problem
Lingli Yu, Shuxin Huo, Zhengjiu Wang
Neurocomputing1
2023 TSDTVOS: Target-guided spatiotemporal dual-stream transformers for video object segmentation
Yuqian Zhao 0001, Fan Zhang 0106, Biao Luo 0001, Lingli Yu, Baifan Chen, Chunhua Yang 0001, Weihua Gui 0001
Neurocomputing5
2023 Multi-scale discriminant representation for generic palmprint recognition
Lingli Yu
Neural Comput. Appl.1
2022 Occlusion tolerant object recognition using visual memory selection model
Mingyue Jin, Lingli Yu
Appl. Intell.2
2020 Multi-channel biomimetic visual transformation for object feature extraction and recognition of complex scenes
Lingli Yu, Mingyue Jin
Appl. Intell.1
2019 Traffic sign detection based on visual co-saliency in complex scenes
Lingli Yu, Xumei Xia
Appl. Intell.1
2019 Affine invariant fusion feature extraction based on geometry descriptor and BIT for object recognition
abstract
It is difficult to recognise an image with affine transformation due to viewing angle anddistance variations. Therefore, affine invariant feature extraction is avaluable technology in the field of image recognition. Inspired by bio‐visualmechanism, an affine invariant for object recognition method based on a fusionfeature framework is proposed in this study, which employs geometry descriptorand double biologically inspired transformation (DBIT). First, a shape featureof interest detector is adopted to detect contour features. Then, the areaestimation of affine region detector is utilised to construct area ratio featurevectors. Second, an orientation edge detector is built to highlight the edges ofdifferent directions. On this basis, local space frequency detector is adoptedto measure the spatial frequency at each direction and interval, which convertsthe output map into DBIT feature vectors. A weighted fusion strategy isperformed based on Pearson correlation distance to fuse the geometry feature andDBIT feature. Some tests for Alphanumeric, Coil‐100 MPEG‐7, Mixed NationalInstitute of Standards and Technology (MNIST) and Olivetti Research Laboratoryface images database (ORL) database remain highly stable recognition accuracy,even when the shear factor is between −0.5 and + 0.5. The experiment resultsshow the authors’ proposed approach has a nice performance in featureinvariance, selectivity and recognition accuracy.
Lingli Yu, Xumei Xia
IET Image Process.1
2019 Double biologically inspired transform network for robust palmprint recognition
Xiancheng Zhou, Lingli Yu, Lizhi Shen, Shaoqian Yu
Neurocomputing3
2017 Bionic RSTN invariant feature extraction method for image recognition and its application
abstract
It is significant to extract rotation, scaling, translation, and noise (RSTN) invariant features inspired by biological vision for image recognition. A bionic RSTN‐invariant feature extraction are proposed. This extraction process comprises two stages. In the first stage, a novel orientation edge detection is designed based on a filter‐to‐filter scheme. Gabor filters, a bottom filter, smoothen an image by simulating biological vision. Bipolar filters, a top filter, detect the horizontal and vertical direction orientation edge by simulating vision cortex response. After obtaining the orientation edge of the image, an interval detector is executed by a spatial frequency of different direction and distance. Then, the interval detection results are transformed into pixels of the orientation‐interval feature map. RSTN invariant features are generated through the repetition of orientation edge detection and interval detection. Several experimental results demonstrate that RSTN‐invariant features have striking robustness, and capable to classify RSTN images. Finally, bionic invariant features are practiced in traffic sign recognition.
Lingli Yu, Haichu Chen
IET Image Process.1
2016 A Dynamic Local Path Planning Method for Outdoor Robot Based on Characteristics Extraction of Laser Rangefinder and Extended Support Vector Machine
abstract
For dynamic path planning problem under unstructured environment, firstly, successive edge following and least squares method (SEF-LSM) is adopted to extract environment characteristics of laser rangefinder data, and SEF-LSM with logical reasoning (SEF-LSM-LR) is proposed for dynamic obstacles characteristics detection. Furthermore, the perpendicularity (PERP) algorithm is utilized to identify dynamic vehicle, according to the perpendicularity attribute of vehicle. Secondly, all the laser rangefinder scanning points are marked as negative ([Formula: see text]) or positive ([Formula: see text]1), and the scanning points of one dynamic obstacle are marked as the same label. Thirdly, extended support vector machine (ESVM) is designed for outdoor robot local path planning under unstructured environment, which consider the practical start-goal position and heading constraints, robot kinematic constraint, and curvature constraint, moreover, the emergency obstacle is regarded as disturbances during planning processing. Finally, the optimal path is chosen by the shortest distance evaluation function. Lots of outdoor simulations show that the proposed method solve the dynamic planning problem under unstructured environment, and their effectiveness performance are verified for outdoor robot path planning.
Lingli Yu
Int. J. Pattern Recognit. Artif. Intell.1