Computer and Modernization ›› 2016, Vol. 0 ›› Issue (2): 58-61.doi: 10.3969/j.issn.1006-2475.2016.02.013

Previous Articles     Next Articles

Algorithm for Minimum Bounding Rectangle of Fast Extracting Leaves

  

  1. College of Science, Hunan Agriculture University, Changsha 410128, China
  • Received:2015-10-10 Online:2016-03-02 Published:2016-03-03

Abstract: Geometric feature such as rectangle degree, which is a crucial foundation for image classification and recognition. Extracting 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 initial 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 minimum 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