首页> 外文会议>International Conference on Advanced Electronic Materials, Computers and Software Engineering >Recognition and Location of Persimmons Based on K-Means and Epipolar Constraint SIFT Matching Algorithm
【24h】

Recognition and Location of Persimmons Based on K-Means and Epipolar Constraint SIFT Matching Algorithm

机译:基于K均值和极线约束SIFT匹配算法的柿子识别与定位

获取原文

摘要

Aiming at the requirements of intelligent persimmon picking operations, this paper designs a recognition and positioning system for persimmon picking robots. The system uses the H component under the HSV model to preprocess the image, uses K-means clustering algorithm for segmentation, and successfully extracts fruit targets after subsequent morphology and desiccation processing. In order to extract the three-dimensional coordinates of the fruit, the images obtained by the left and right cameras after calibration are matched using the SIFT algorithm. Finally, the distance is solved by the similar triangle principle. After testing, the sample image cluster center is 2, the number of iterations is 200, and the working range is 200mm ~ 800mm. The recognition success rate is about 90%, and the positioning error is ^±15mm, which can fully meet the needs of picking robot operations.
机译:针对智能柿子采摘作业的要求,设计了一种柿子采摘机器人的识别与定位系统。该系统使用HSV模型下的H分量对图像进行预处理,使用K-means聚类算法进行分割,并在随后的形态学和干燥处理后成功地提取了水果目标。为了提取水果的三维坐标,使用SIFT算法对校准后由左右摄像头获得的图像进行匹配。最后,通过类似的三角原理求解距离。经测试,样本图像聚类中心为2,迭代次数为200,工作范围为200mm〜800mm。识别成功率约为90%,定位误差为^±15mm,完全可以满足拣货机器人操作的需要。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号