计算机与现代化Issue(2)：58-61,4.DOI:10.3969/j.issn.1006-2475.2016.02.013
一种快速提取植物叶片最小外接矩形算法
Algorithm for Minimum Bounding Rectangle of Fast Extracting Leaves
向元平 1何燕平 1危郁林 1梁欢 1郭本初1
作者信息
- 1. 湖南农业大学理学院,湖南 长沙 410128
- 折叠
摘要
Abstract
Geometric feature such as rectangle degree , which is a crucial foundation for image classification and recognition .Ex-tracting minimum bounding rectangle is of important value .A new algorithm of minimum bounding rectangle of fast extracting plant leaves was studied in this paper .First, image was scanned from horizontal direction and vertical direction to extract the ini -tial bounding rectangle .Horizontal axis and vertical axis were defined through the center of initial bounding rectangle .Then, with the main axis rotated and moved , four boundaries and a new bounding rectangle were obtained .Compared with the area , the min-imum bounding rectangle was extracted .The effectiveness of this algorithm is verified by using Flavia plant leaves database .The results show that minimum bounding rectangle can be quickly found .关键词
最小外接矩形/初始外接矩形/中心点/主轴旋转Key words
minimum bounding rectangle/initial rectangle/central point/rotating axis分类
信息技术与安全科学引用本文复制引用
向元平,何燕平,危郁林,梁欢,郭本初..一种快速提取植物叶片最小外接矩形算法[J].计算机与现代化,2016,(2):58-61,4.
