A new parallel algorithm for corner detection on object contour is presented in the paper. In this algorithm whenever a point (pixel) is scanned, the k direction codes between the two sides of the point, which is on t...A new parallel algorithm for corner detection on object contour is presented in the paper. In this algorithm whenever a point (pixel) is scanned, the k direction codes between the two sides of the point, which is on the edge of an object, are obtained by k-step forward and backward boundary tracking. A comer is determined by the sum of the difference between the two weighted code chains. Note that the whole chain code sequence or boundary of an object is not necessary to be extracted at all in this algorithm, and the corners are obtained immediately once the image is scanned, furthermore, what humans perceive as corners can be detected and localized by this algorithm.展开更多
With the increasing necessities for reliable printed circuit board(PCB) product, there has been a considerable demand for high speed and high precision vision positioning system. To locate a rectangular lead component...With the increasing necessities for reliable printed circuit board(PCB) product, there has been a considerable demand for high speed and high precision vision positioning system. To locate a rectangular lead component with high accuracy and reliability, a new visual positioning method was introduced. Considering the limitations of Ghosal sub-pixel edge detection algorithm, an improved algorithm was proposed, in which Harris corner features were used to coarsely detect the edge points and Zernike moments were adopted to accurately detect the edge points. Besides, two formulas were developed to determine the edge intersections whose sub-pixel coordinates were calculated with bilinear interpolation and conjugate gradient method. The last experimental results show that the proposed method can detect the deflection and offset, and the detection errors are less than 0.04° and 0.02 pixels.展开更多
文摘A new parallel algorithm for corner detection on object contour is presented in the paper. In this algorithm whenever a point (pixel) is scanned, the k direction codes between the two sides of the point, which is on the edge of an object, are obtained by k-step forward and backward boundary tracking. A comer is determined by the sum of the difference between the two weighted code chains. Note that the whole chain code sequence or boundary of an object is not necessary to be extracted at all in this algorithm, and the corners are obtained immediately once the image is scanned, furthermore, what humans perceive as corners can be detected and localized by this algorithm.
基金Project(51175242)supported by the National Natural Science Foundation of ChinaProject(BA2012031)supported by the Jiangsu Province Science and Technology Foundation of China
文摘With the increasing necessities for reliable printed circuit board(PCB) product, there has been a considerable demand for high speed and high precision vision positioning system. To locate a rectangular lead component with high accuracy and reliability, a new visual positioning method was introduced. Considering the limitations of Ghosal sub-pixel edge detection algorithm, an improved algorithm was proposed, in which Harris corner features were used to coarsely detect the edge points and Zernike moments were adopted to accurately detect the edge points. Besides, two formulas were developed to determine the edge intersections whose sub-pixel coordinates were calculated with bilinear interpolation and conjugate gradient method. The last experimental results show that the proposed method can detect the deflection and offset, and the detection errors are less than 0.04° and 0.02 pixels.
