Preprint Article Version 2 Preserved in Portico This version is not peer-reviewed

An Efficient Preprocessing Algorithm for Image-based Plant Phenotyping

Version 1 : Received: 13 April 2018 / Approved: 16 April 2018 / Online: 16 April 2018 (11:42:27 CEST)
Version 2 : Received: 20 April 2018 / Approved: 24 April 2018 / Online: 24 April 2018 (17:02:18 CEST)

How to cite: Attari, H.; Ghafari-Beranghar, A. An Efficient Preprocessing Algorithm for Image-based Plant Phenotyping. Preprints 2018, 2018040209. https://doi.org/10.20944/preprints201804.0209.v2 Attari, H.; Ghafari-Beranghar, A. An Efficient Preprocessing Algorithm for Image-based Plant Phenotyping. Preprints 2018, 2018040209. https://doi.org/10.20944/preprints201804.0209.v2

Abstract

Plants are such important keys of biological part of our environment, supply the human life and creatures. Understanding how the plant’s functions react with our surroundings, helps us better to make plant growth and development of food products. It means the plant phenotyping gives us bio information which needs some tools to reach the plant knowledge. Imaging tools is one of the phenotyping solutions which consists of imaging hardware such as the camera and image analysis software analyses the plant images changings such as plant growth rates. In this paper, we proposed a preprocessing algorithm to eliminate the noise and separate foreground from the background which results the plant image to help the plant image segmentation. The preprocessing is one of important levels has effect on better image segmentation and finally better plant’s image labeling and analysis. Our proposed algorithm is focused on removing noise such as converting the color space, applying the filters and local adaptive binarization step such as Niblack. Finally, we evaluate our algorithm with other algorithms by testing a variety of binarization methods.

Keywords

plant phenotyping; noise filtering; binarization; accuracy evaluation; connected components

Subject

Computer Science and Mathematics, Data Structures, Algorithms and Complexity

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.