# Counting touching wheat grains in images based on elliptical approximation

## TL;DR

This paper presents a new algorithm for accurately counting and identifying touching wheat grains in images using elliptical approximation.

## Contribution

The novel approach combines concave point search with elliptical contour approximation to improve grain segmentation accuracy.

## Key findings

- The proposed algorithm outperforms traditional methods like the watershed algorithm in identifying touching grains.
- Elliptical approximation improves accuracy but increases computational time significantly.
- The method is effective but becomes slower with more grains and complex contours.

## Abstract

The number of grains of a cereal plant characterizes its yield, while grain size and shape are closely related to its weight. To estimate the number of grains, their shape and size, digital image analysis is now generally used. The grains in such images may be completely separated, touching or densely packed. In the first case, the simplest binarization/segmentation algorithms, such as the watershed algorithm, can achieve high accuracy in segmentation and counting grains in an image. However, in the case of touching grains, simple machine vision algorithms may lead to inaccuracies in determining the contours of individual grains. Therefore, methods for accurately determining the contours of individual grains when they are in contact are relevant. One approach is based on the search for pixels of the grain contact area, in particular, by identification of concave points on the grain contour boundary. However, some grains may have chips, depressions and bulges, which leads to the identification of the corner points that do not correspond to the grain contact region. Additional data processing is required to avoid these errors. In this paper, we propose an algorithm for the identification of wheat grains in an image and determine their boundaries in the case when they are touching. The algorithm is based on using a modification of the concave point search algorithm and utilizes a method of assigning contour boundary pixels to a single grain based on approximation of grain contours by ellipses. We have shown that the proposed algorithm can identify grains in the image more accurately compared to the algorithm without such approximation and the watershed algorithm. However, the time cost for such an algorithm is significant and grows rapidly with increasing number of grains and contours including multiple grains.