基于全卷积网络与凹点搜索的重叠葡萄分割算法
DOI:
CSTR:
作者:
作者单位:

(陕西科技大学 机电工程学院,西安 710021)

作者简介:

卢军 (1961-),男,教授,研究方向为机器视觉与 工业机器人技术.

通讯作者:

中图分类号:

基金项目:

陕西省科技厅工业攻关基金项目(2016GY-049)资助项目 (陕西科技大学 机电工程学院,西安 710021)


Overlapping grape segmentation algorithm based on full convolutional network and concave point search
Author:
Affiliation:

(College of Mechanical and Electrical Engineering,Shaanxi University of Science &Technology,Xi′an 710021,China)

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    为解决自然环境下重叠葡萄难以分离的问题,提 出了一种基于改进的FCN全卷积网络 和凹点搜索的重叠葡萄分割方法。主要步骤如下:第一,对重叠葡萄图像进行H分量提取,然 后通过改进的FCN全卷积网络得到二值图,对二值图进行质心位置求解和轮廓凸包检测;第 二,根据矢量夹角最大法进行单串葡萄轴线检测,分离前的轮廓凸包与二值图像相减得到凹 区域,然后根据轴线做对称凸包筛选出分割凹点所在的凹区域;第三,建立重叠葡萄分界线 几何计算模型,再根据最短距离进行分割凹点搜索。此外,对采集的400幅重叠葡萄图像进 行验证,平均分割标准误差为4.03,检测成功率为92.5%,算法消耗时间 为0.40 s,为采摘机器人提供了一种新 的重叠葡萄分割方法。

    Abstract:

    To solve the problem that overlapping grape is difficult to separate in natural environment,a method of overlapping grape segmentation based on impr oved FCN and concave point search was proposed.The main steps are as follows:F irst,a comparative analysis of different color spaces and different color chann els was conducted for the collected summer black overlapping grape images.It wa s found the contrast between the target and the background was large in the H co mponent under the HSV color space,so the H component was extracted from the ove rlapping grape images.The H component of the overlapping grape was input into t he convolutional multiscale fusion FCN to obtain the binary graph,and then the centroid of the overlapping grape was solved and the contour convex hull was det ected.Second,axis of a single bunch of grapes was detected according to the ma ximum angle of the vector.The concave region was obtained by subtracting the bi nary image from the convex hull of the contour before separation.Symmetrical co nvex hull was made according to the axis,and then the concave region containing segmented concave points was obtained.Third,the geometric calculation model o f overlapping grape boundary was established,the contour of the selected concav e region was traversed,and then the segmented concave point was searched accord ing to the shortest distance.In addition,the 400overlapping grape images were verified,the average standard segmentation error was 4.03,the detection success r ate was 92.5%,and the algorithm consumed time of 0.40~0.59s.Compared with the existing methods,the accuracy of overlapping grape segmentation in this paper w as not easily affected by the details of contour inflection points,and the accu racy of recognition was improved.It provided a new overlapping grape segmentati on method for picking robot.

    参考文献
    相似文献
    引证文献
引用本文

雷旺雄,卢军.基于全卷积网络与凹点搜索的重叠葡萄分割算法[J].光电子激光,2021,32(3):231~240

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2020-10-15
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期: 2021-03-11
  • 出版日期:
文章二维码