Abstract

Printed Circuit Board (PCB) was the basic carrier for a large number of components in electronic devices. The quality of PCB will directly affect the performance of electronic devices, so it is crucial to conduct defect detection during PCB assembly. Traditional defect detection methods are inefficient and costly, thus failing to satisfy the requirements of large-scale PCB inspection at this stage. Three-dimensional reconstruction has the advantages of non-contact and fast, and is gradually applied to PCB defect detection, but the general point cloud generation method is difficult to identify defects highly correlated with components, which is easy to produce missed detection. The Iterative Closet Point (ICP) point cloud alignment optimization method proposed in this paper can effectively identify such height defects. Firstly, the point cloud is matched in a two-by-two alignment, and the third piece is aligned on the basis of the completion of the first two pieces of matching, and so on. Then the duplicate points are removed to ensure the 3D morphological features of the point cloud while effectively filtering out the redundant point cloud data points, and finally the non-overlapping parts are superimposed to optimize the point cloud model. The experimental results show that the average alignment error of the algorithm in this paper is less than 0.05% on the PCB board, which can be better applied to detect defects in the PCB assembly process.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.