Algorithm for recognizing the contour of a honeycomb block

TL;DR

This paper presents two algorithms for recognizing honeycomb block contours, addressing limitations of existing OpenCV functions, with one algorithm effectively handling both convex and concave shapes.

Contribution

The paper introduces a novel scanning algorithm using a sliding matrix that accurately detects contours of complex-shaped honeycomb fragments.

Findings

The direct scanning algorithm works well on convex shapes.

The sliding matrix algorithm handles both convex and concave shapes.

The proposed method improves contour recognition accuracy for complex shapes.

Abstract

The article discusses an algorithm for recognizing the contour of fragments of a honeycomb block. The inapplicability of ready-made functions of the OpenCV library is shown. Two proposed algorithms are considered. The direct scanning algorithm finds the extreme white pixels in the binarized image, it works adequately on convex shapes of products, but does not find a contour on concave areas and in cavities of products. To solve this problem, a scanning algorithm using a sliding matrix is proposed, which works correctly on products of any shape.