首页 | 本学科首页   官方微博 | 高级检索  
     

基于双向极角的植物叶凸包生成算法
引用本文:王晓洁,郑小东. 基于双向极角的植物叶凸包生成算法[J]. 农机化研究, 2009, 31(10)
作者姓名:王晓洁  郑小东
作者单位:1. 郑州大学,机械工程学院,郑州450002
2. 郑州航空工业管理学院,计算机科学与应用系,郑州450015
基金项目:河南省教育厅自然科学研究计划项目 
摘    要:为了描述和提取植物叶的形状特征,需要生成植物叶的凸包.首先,通过图像分割,获得植物叶原始图像的二值图像;其次,利用轮廓跟踪算法,获得植物叶轮廓的简单多边形;最后,利用基于双向极角的卷包裹法,生成植物叶的凸包.该算法计算复杂度为O(Nh).试验表明,算法满足图像旋转不变性要求,适用于多种不同形状的植物叶.

关 键 词:植物叶  凸包  卷包裹法  极角  图像处理

Algorithm of Constructing Convex Hull for Plant Leaf Based on Bidirectional Polar Angle
Wang Xiaojie,Zheng Xiaodong. Algorithm of Constructing Convex Hull for Plant Leaf Based on Bidirectional Polar Angle[J]. Journal of Agricultural Mechanization Research, 2009, 31(10)
Authors:Wang Xiaojie  Zheng Xiaodong
Affiliation:1.School of Mechanical Engineering;Zhengzhou University;Zhengzhou 450002;China;2.Dep.of Computer Science and Application;Zhengzhou Institute of Aeronautical Industry Management;Zhengzhou 450015;China
Abstract:The convex hull of plant leaf needs to be calculated in order to describe and get the shape features of the leaf.After image segmentation the binary image of the crude image of a plant leaf can be got.Then the simple polygon of the contour of the plant leaf can be got with contour tracking algorithm.Finally,the convex hull is constructed for the plant leaf with gift wrapping method based on bidirectional polar angle.The computing complexity of the algorithm is O(Nh).The trial results show the algorithm can ...
Keywords:plant leaf  convex hull  gift wrapping method  polar angle  image processing  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号