Arrow Research search

Author name cluster

Shaoli Liu

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

3 papers
1 author row

Possible papers

3

EAAI Journal 2025 Journal Article

TopoPIS: Topology-constrained pipe instance segmentation via adaptive curvature convolution

  • Jia Hu
  • Jianhua Liu
  • Shaoli Liu

Precise and fast pipe instance segmentation is a critical component in industrial automatic assembly, facilitating accurate object detection and pose estimation, optimizing and supervising the assembly process. However, this problem is challenging due to topological errors on fine-scale structures caused by the pipes being complex and slender. To address these challenges, we propose a topology-constrained pipe instance segmentation network (TopoPIS) for complex stacking scene to achieve accurate segmentation with topological correctness. To better extract the features of complex and variable morphological pipes, adaptive curvature convolution is introduced to dynamically adapt to the slender pipe structure and capture critical features. To handle topological errors like broken connections, we propose a novel topological constraint loss function based on persistent homology, which greatly improves the topological continuity of the segmentation. Experimental results on real-world and unseen datasets demonstrate that our TopoPIS outperforms other methods regrading segmentation accuracy and topological continuity.

NeurIPS Conference 2021 Conference Paper

Distilling Object Detectors with Feature Richness

  • Du Zhixing
  • Rui Zhang
  • Ming Chang
  • Xishan Zhang
  • Shaoli Liu
  • Tianshi Chen
  • Yunji Chen

In recent years, large-scale deep models have achieved great success, but the huge computational complexity and massive storage requirements make it a great challenge to deploy them in resource-limited devices. As a model compression and acceleration method, knowledge distillation effectively improves the performance of small models by transferring the dark knowledge from the teacher detector. However, most of the existing distillation-based detection methods mainly imitating features near bounding boxes, which suffer from two limitations. First, they ignore the beneficial features outside the bounding boxes. Second, these methods imitate some features which are mistakenly regarded as the background by the teacher detector. To address the above issues, we propose a novel Feature-Richness Score (FRS) method to choose important features that improve generalized detectability during distilling. The proposed method effectively retrieves the important features outside the bounding boxes and removes the detrimental features within the bounding boxes. Extensive experiments show that our methods achieve excellent performance on both anchor-based and anchor-free detectors. For example, RetinaNet with ResNet-50 achieves 39. 7% in mAP on the COCO2017 dataset, which even surpasses the ResNet-101 based teacher detector 38. 9% by 0. 8%. Our implementation is available at https: //github. com/duzhixing/FRS.

AAAI Conference 2020 Conference Paper

DWM: A Decomposable Winograd Method for Convolution Acceleration

  • Di Huang
  • Xishan Zhang
  • Rui Zhang
  • Tian Zhi
  • Deyuan He
  • Jiaming Guo
  • Chang Liu
  • Qi Guo

Winograd’s minimal filtering algorithm has been widely used in Convolutional Neural Networks (CNNs) to reduce the number of multiplications for faster processing. However, it is only effective on convolutions with kernel size as 3x3 and stride as 1, because it suffers from significantly increased FLOPs and numerical accuracy problem for kernel size larger than 3x3 and fails on convolution with stride larger than 1. In this paper, we propose a novel Decomposable Winograd Method (DWM), which breaks through the limitation of original Winograd’s minimal filtering algorithm to a wide and general convolutions. DWM decomposes kernels with large size or large stride to several small kernels with stride as 1 for further applying Winograd method, so that DWM can reduce the number of multiplications while keeping the numerical accuracy. It enables the fast exploring of larger kernel size and larger stride value in CNNs for high performance and accuracy and even the potential for new CNNs. Comparing against the original Winograd, the proposed DWM is able to support all kinds of convolutions with a speedup of ∼2, without affecting the numerical accuracy.

v2026.09.13