山东科学 ›› 2024, Vol. 37 ›› Issue (2): 65-73.doi: 10.3976/j.issn.1002-4026.20230133

• 光纤与光子传感技术 • 上一篇    下一篇

复杂背景下的结构光条纹中心提取算法研究

高秋玲1(), 成巍1, 李文龙1, 戈海龙1, 侯兴强1, 宋汝晖1, 魏佳洁1, 贾天烁1, 蔡馨燕2,*()   

  1. 1.齐鲁工业大学(山东省科学院) 山东省科学院激光研究所,山东 济南 250104
    2.山东省科学技术情报研究院,山东 济南 250101
  • 收稿日期:2023-09-08 出版日期:2024-04-20 发布日期:2024-04-09
  • 通信作者: *蔡馨燕,副研究员。E-mail: 191523972@qq.com
  • 作者简介:高秋玲(1998—),女,硕士研究生,研究方向为三维重构和检测。E-mail:gqling1025@163.com
  • 基金资助:
    山东省重大科技创新工程(2022CXGC020205);齐鲁工业大学(山东省科学院)—威海市产学研协同创新基金项目(2022CXY-05);山东省科技型中小企业能力提升项目(2023TSGC0357)

Centerline extraction algorithm of structured light streak in a complex background

GAO Qiuling1(), CHENG Wei1, LI Wenlong1, GE Hailong1, HOU Xingqiang1, SONG Ruhui1, WEI Jiajie1, JIA Tianshuo1, CAI Xinyan2,*()   

  1. 1. Laser Institute,Qilu University of Technology (Shandong Academy of Sciences), Jinan 250104, China
    2. Shandong Institute of Scientific and Technical Information, Jinan 250101, China
  • Received:2023-09-08 Online:2024-04-20 Published:2024-04-09

摘要:

线结构光三维扫描建模系统中最关键的一步是提取光条中心线,但环境中各种因素的干扰给中心线提取带来困难。针对线结构光条纹图像存在光斑干扰、光强分布不均、光条宽度差别大、背景复杂等多种问题,提出解决方案。首先采用Otsu对结构光图像二值化;其次采用改进DBSCAN(density-based spatial clustering of applications with noise)算法保留核心点,去除边界点和噪声点;最后将核心点作为输入,构建图数据结构,采用适用于线结构光条纹图像的最短路径搜索算法得到光条中心线。实验结果表明,该算法运行时间在150 ms以内,误差在0.2 像素以内,并适用于多种复杂环境,满足实时性、准确性和稳定性的要求。

关键词: 复杂背景, 线结构光, 中心线提取, DBSCAN算法, 最短路径

Abstract:

The most critical step in a line-structured light three-dimensional scan modeling system is to extract the centerline of the light stripe, but the interference of various environmental factors makes this extraction difficult. Several problems exists in a line-structured light streak image issues such as light spot interference, uneven distribution of light intensity, large differences in the width of the light bars, and complex background. This paper proposed a solution to overcome these problems. First, the structured light image is binarized using the Otsu method. Then, the improved density-based spatial clustering of applications with nose (DBSCAN) algorithm is used to retain the core points and remove the boundary and noise points. Finally, the core points are used as inputs to construct the graph data structure, and the shortest path search algorithm that fits the line-structured light streak image is used to obtain the center-line of the light streak. The experimental results show that the algorithm of this paper runs within 150 ms and the error is within 0.2 pixels. Moreover, this algorithm is applicable to various complex environments, meeting the requirements of real-time calculations, accuracy, and stability.

Key words: complex background, line-structured light, centerline extraction, DBSCAN algorithm, shortest path

中图分类号: 

  • TN249