scholarly journals A method for inspecting the cleanliness of spinneret holes

2020 ◽  
Vol 15 ◽  
pp. 155892502098014
Author(s):  
Xu Zengbo

At present, computer vision system is widely used for the cleanliness inspection for spinneret holes, but it has a high misjudgment rate for many holes with small dirt. In this paper, a method is proposed to improve the accuracy of the cleanliness inspection. The method has four sequential phases. First, the closed contour curve of a standard hole and its curvature are extracted. Based on double-threshold segmentation of the contour curve, line and arc segments are segmented to generate a closed piecewise curve model. Second, the model is fitted to the closed contour curve L1 of the hole to be inspected based on a nonlinear least squares principle, and the distance curve that represents the shortest distance between the closed piecewise curve L2 constructed from the aligned model and L1 is calculated based on the nearest neighbor search algorithm. Third, the dirt detection curve L3 is generated from the distance curve weighted by a blended weighting curve. Final, based on a global threshold combining with unevenness elimination of L3, the cleanliness index is calculated based on the segmentation and location of dirt, and is used to judge whether the hole is qualified or not. The experimental results of four databases demonstrate that, the proposed method provides better performance compared with the traditional method.

Author(s):  
Levon Arsalanyan ◽  
Hayk Danoyan

The Nearest Neighbor search algorithm considered in this paper is well known (Elias algorithm). It uses error-correcting codes and constructs appropriate hash-coding schemas. These schemas preprocess the data in the form of lists. Each list is contained in some sphere, centered at a code-word. The algorithm is considered for the cases of perfect codes, so the spheres and, consequently, the lists do not intersect. As such codes exist for the limited set of parameters, the algorithm is considered for some other generalizations of perfect codes, and then the same data point may be contained in different lists. A formula of time complexity of the algorithm is obtained for these cases, using coset weight structures of the mentioned codes


2008 ◽  
Vol 164 (3) ◽  
pp. 69-77 ◽  
Author(s):  
Shiro Ajioka ◽  
Satoru Tsuge ◽  
Masami Shishibori ◽  
Kenji Kita

2006 ◽  
Vol 126 (3) ◽  
pp. 353-360 ◽  
Author(s):  
Shiro Ajioka ◽  
Satoru Tsuge ◽  
Masami Shishibori ◽  
Kenji Kita

Sign in / Sign up

Export Citation Format

Share Document