一种快速提取植物叶片最小外接矩形的算法  

Fast Algorithm for Extracting Minimum Enclosing Rectangle of Plant Leaves

作　　者：李洋[1] 李岳阳[1] 

机构地区：[1]江南大学物联网工程学院,江苏无锡214122

出　　处：《江南大学学报（自然科学版）》2015年第3期273-277,共5页Joural of Jiangnan University (Natural Science Edition)　

基　　金：国家自然科学基金项目(61170119);中央高校基本科研业务费专项基金项目(JUSRP211A38)

摘　　要：为了提高提取植物叶片最小外接矩形的计算效率与精确度,提出一种快速提取植物叶片最小外接矩形的算法。该算法首先使用Canny算子提取叶片轮廓,然后使用基于平面扫描法的Graham算法构造叶片轮廓凸包,最后提取叶片最小外接矩形。仿真实验结果表明:在Flavia植物叶片数据库中进行测试,该算法优于旋转法、顶点链码法。In order to improve the extraction efficiency and accuracy,a fast algorithm is proposed to extract the minimum enclosing rectangle （MER） of plant leaves. Using the canny edge detection operator to extract the contour of leaves,the Graham algorithm based on the fiat plane scanning is applied to construct the convex hull of the leaf contour,the MER is extracted. The effectiveness of the proposed algorithm is verified by using the Flavia plant leaf database and the experimental results show that it is better than the rotation algorithm and vertex chain code algorithm.

关 键 词：图像处理 最小外接矩形 Graham算法 

分 类 号：TP751[自动化与计算机技术—检测技术与自动化装置]