Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4969436 | Journal of Visual Communication and Image Representation | 2016 | 19 Pages |
Abstract
Polygonal approximation of a shape boundary can provide a minimalistic representation of the shape. It can also accelerate the processing speed of feature extraction. Our interest is in applying such a method to approximate the boundaries of plankton shapes. A polygonal approximation method based on genetic algorithms has been designed to compactly describe the plankton shapes by polygons. Firstly, two artificial digital curves are used to test the performance of our algorithm. Results are compared with other existing algorithms which show that our algorithm has efficient performance for solving the problem of the polygonal approximation. Secondly, the proposed method is applied to a selection of plankton images under three different approximation levels to a polygonal fit and then five evaluation criteria are applied to determine which approximation level of a particular image is most suitable for describing the shape. The stability and robustness of three approximation levels are also tested.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Vision and Pattern Recognition
Authors
Zonghua Liu, John Watson, Alastair Allen,