ハニカムブロックのエッジ検出におけるコンピュータビジョン手法の逐次処理の応用
Application of sequential processing of computer vision methods for solving the problem of detecting the edges of a honeycomb block
ハニカムブロック画像にハフ変換を適用し、二値化やCannyエッジ検出、骨格化などの前処理を組み合わせて最適な処理順序を実験的に明らかにし、切断位置選定の精度向上を図った研究。
著者: M V Kubrikov, I A Paulin, M V Saramud, A S Kubrikova
分類: cs.CV, cs.RO
原文アブストラクト
The article describes the application of the Hough transform to a honeycomb block image. The problem of cutting a mold from a honeycomb block is described. A number of image transformations are considered to increase the efficiency of the Hough algorithm. A method for obtaining a binary image using a simple threshold, a method for obtaining a binary image using Otsu binarization, and the Canny Edge Detection algorithm are considered. The method of binary skeleton (skeletonization) is considered, in which the skeleton is obtained using 2 main morphological operations: Dilation and Erosion. As a result of a number of experiments, the optimal sequence of processing the original image was revealed, which allows obtaining the coordinates of the maximum number of faces. This result allows one to choose the optimal places for cutting a honeycomb block, which will improve the quality of the resulting shapes.