Matching for Shape Defect Detection
暂无分享,去创建一个
The problem of defect detection in 2D and 3D shapes is analyzed. A shape is represented by a set of its contour, or surface, points. Mathematically, the problem is formulated as a specific matching of two sets of points, a reference one and a measured one. Modified Hausdorff distance between these two point sets is used to induce the matching. Based on a distance transform, a 2D algorithm is proposed that implements the matching in a computationally efficient way. The method is applied to visual inspection and dimensional measurement of ferrite cores. Alternative approaches to the problem are also discussed.1
[1] Dmitry ChetverikovComputer. Shape Defect Detection in Ferrite Cores , 1997 .
[2] G. Borgefors. Distance transformations in arbitrary dimensions , 1984 .
[3] Dmitry Chetverikov,et al. Fast neighborhood search in planar point sets , 1991, Pattern Recognit. Lett..
[4] Peter J. Rousseeuw,et al. Robust Regression and Outlier Detection , 2005, Wiley Series in Probability and Statistics.