Abstract
The known K-means clustering, flood-filling, and thinning algorithms are used to find coordinates of contacts in PCB images. Images of different types and colors are considered. The clustering algorithm is used to reduce the number of colors, to get uniform colors in the PCB image. The thinning algorithm is used to build skeletons and find pixels of contacts. The flood-fill algorithm is used to mark and separate chains, defect connectivity, and metal defects. Different subtraction operations are applied to original, transformed, and distributed cumulative histogram images.
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 callDisclaimer: 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.
