Harris vertex extraction method and system for honeycomb regularity detection
A regularity and honeycomb technology, which is applied in the Harris vertex extraction method and system field of honeycomb regularity detection, can solve the problems of cumbersome steps and long time-consuming, and achieve the effect of high detection accuracy
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0057] A Harris vertex extraction method for honeycomb regularity detection, the method is to identify and process the image of a designated honeycomb product, and judge the quality level of the honeycomb product through analysis; the method sequence includes the following steps: acquiring images, image processing, Vertex extraction and morphological analysis; the step "acquiring images" includes taking images and computer-reading images; the step "morphological analysis" is based on "image processing" to analyze and calculate the degree of deformation of the tested cellular product;
[0058] Said step "image processing" includes noise reduction filtering, balanced grayscale, binarization, skeletonization and burr filtering; said step "balanced grayscale" is to use image processing methods to further balance the grayscale of the cellular image; said step "Skeletonization" is to use a line with a pixel value of 1 as a line segment with a line width of 1 pixel to draw a skeleton ...
Embodiment 2
[0061] It is basically the same as "method embodiment 1", the difference is: the step "balancing the gray scale" is to first obtain the filtered image by median filtering, and then perform the opening operation on the filtered image to obtain the opening operation image, and use the filtering image The top-hat transformation of the image is performed by subtracting the open operation image to reduce the impact of uneven illumination and further optimize the grayscale quality of the image.
Embodiment 3,4
[0063] They are basically the same as "method embodiments 1 and 2", except that the step "glitch filtering" is based on the skeleton diagram, and the pixel point with pixel value = 1 is used as the center point, clockwise or counterclockwise Count the number of times of change of the pixel value of its eight neighbor pixels, if the number of changes is 2, then this point is a glitch endpoint, and the pixel value of this point is set to 0, and traverse all pixel points with pixel value=1; with the above method Based on the processed skeleton diagram, the above operations are repeated cyclically until there is no burr endpoint in a certain cycle period.
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


