US4707734A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Coarse flaw detector for printed circuit board inspection
Assignee: Optical Radiation Corp
•
Filing: 1985-06-17
•
Granted: 1987-11-17
•
Expires: 2005-06-17
Abstract
Abstract A system for detecting flaws in printed circuit boards. The circuit board is scanned by a video camera to provide a serial stream of bits each indicative of a picture element within a particular scan line. The serial stream of bits is formulated into binary numbers each representative of a contiguous path of picture elements composed of n×n picture elements. Each of these binary numbers are compared with a corresponding one of a set binary numbers stored in memory representative of a perfect master printed circuit board. Failure of the printed circuit board to match the stored master indicates a flaw. The invention also includes means to generate overlapping patches to insure detection of defects which occur in adjacent patches.
Inventors
- 👤 Richard L. Labinger
- 👤 Natale F. Tinnerino
- 👤 Timothy E. Bryant
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 10:47
CPC Classifications
G; G06; G06T; G06T7/00; G06T7/0002; G06T7/0004; G06T7/001; G06V; G06V10/00; G06V10/70; G06V10/74; G06V10/75; G06V10/751; G01; G01N; G01N21/00; G01N21/84; G01N21/88; G01N21/95; G01N21/956; G01N2021/95638; G01N21/95607; G06T2207/00; G06T2207/10; G06T2207/10016; G06T2207/30; G06T2207/30108; G06T2207/30141
Claims Analysis
Total Claims: 15
Claim 1
Independent Claim
98 words
In a system for processing image data on a surface; scanning means for scanning the surface across its length at a plurality of arbitrarily selected scan lines each one of which comprises a plurality of picture elements; said scanning means providing as an output a serial stream of bits for each of said scan lines each bit representative of one of said picture elements in a scan line; means for formulating said serial streams of bits into binary numbers each representative of the reflectance value of a patch of contiguous picture elements composed of n×n picture elements each.
Claim 2
Dependent Claim
98 words
In a system for processing image data on a surface; scanning means for scanning the surface across its length at a plurality of arbitrarily selected scan lines each one of which comprises a plurality of picture elements; said scanning means providing as an output a serial stream of bits for each of said scan lines each bit representative of one of said picture elements in a scan line; means for formulating said serial streams of bits into binary numbers each representative of the reflectance value of a patch of contiguous picture elements composed of n×n picture elements each.
Claim 3
Dependent Claim
74 words
In a system according to claim 1 wherein said means for formulating comprises: first means for rearranging said stream of bits into words of n bits such that the first word comprises the first bit of each group of n scan lines with each successive word comprising the next bit of each group of n scan lines and providing each word of n bits as an output equivalent to a patch of 1×n bits.
Claim 4
Dependent Claim
35 words
In a system according to claim 2 wherein said means for formulating comprises: second means connected to said first means for adding each word of n bits to form patches equivalent to n×n picture elements.
Claim 5
Dependent Claim
192 words
In a system according to claim 1 wherein said first means comprises: memory means comprising n storage registers each capable of storing all the bits in a scan line; address means connected to said memory means for addressing successively the first through last bit positions in each of said storage registers such that a word of n bits is addressed at each bit position of said storage registers; shift register means comprising n shift registers, each having n bit positions; transceiver means connected to said scanning means and between said memory means and said shift register means for shifting the bits in each addressed bit position of said shift registers into respective ones of said shift registers, writing each bit so shifted back into said addressed bit position of each of said storage registers but down by one significant bit position, and inserting the next available bit from said scanning means into the least significant bit position of each addressed bit position of said storage registers whereby when said shift registers are filled said shift register means provides a new n bit word as in an output every time the address changes.
Claim 6
Dependent Claim
192 words
In a system according to claim 3 wherein said first means comprises: memory means comprising n storage registers each capable of storing all the bits in a scan line; address means connected to said memory means for addressing successively the first through last bit positions in each of said storage registers such that a word of n bits is addressed at each bit position of said storage registers; shift register means comprising n shift registers, each having n bit positions; transceiver means connected to said scanning means and between said memory means and said shift register means for shifting the bits in each addressed bit position of said shift registers into respective ones of said shift registers, writing each bit so shifted back into said addressed bit position of each of said storage registers but down by one significant bit position, and inserting the next available bit from said scanning means into the least significant bit position of each addressed bit position of said storage registers whereby when said shift registers are filled said shift register means provides a new n bit word as in a output every time the address changes.
Claim 7
Dependent Claim
108 words
In a system according to claim 1 wherein said means for formulating comprises: pixel clock means providing clock pulses at a predetermined rate; memory means comprising a plurality of storage registers each of said storage registers capable of storing all the bits in a scan line; a like plurality shift register; transceiver means connected between said shift registers and said memory means for shifting the bits at a selected bit position in each of said storage registers to respective ones of said shift registers, writing each bit so shifted back into said selected bit position of each of said storage registers but down by one significant bit position.
Claim 8
Independent Claim
162 words
A system for detecting flaws on a test surface comprising: scanning means for scanning the surface across its length at a plurality of scan lines each one of which comprises a plurality of picture elements; said scanning means providing as an output a serial stream of bits for each of said scan lines each bit representative of one of said picture elements in a scan line; first means connected to said scanning means for formulating said serial streams of bits into binary numbers each representative of a reflectance value of a patch of said test surface composed of contiguous n×n picture elements; memory means storing an image of a referenc surface; second means connected to said memory means for formulating said stored image into binary numbers each representative of a patch of said reference surface composed of contiguous n×n picture elements; means for comparing said binary numbers of corresponding test and reference surfaces for determining whether said test surface contains a flaw.
Claim 9
Independent Claim
162 words
A system for detecting flaws on a test surface comprising: scanning means for scanning the surface across its length at a plurality of scan lines each one of which comprises a plurality of picture elements; said scanning means providing as an output a serial stream of bits for each of said scan lines each bit representative of one of said picture elements in a scan line; first means connected to said scanning means for formulating said serial streams of bits into binary numbers each representative of a reflectance value of a patch of said test surface composed of contiguous n×n picture elements; memory means storing an image of a referenc surface; second means connected to said memory means for formulating said stored image into binary numbers each representative of a patch of said reference surface composed of contiguous n×n picture elements; means for comparing said binary numbers of corresponding test and reference surfaces for determining whether said test surface contains a flaw.
Claim 10
Dependent Claim
36 words
A system according to claim 7 wherein said first and second means each include: delay means providing overlapping of said patches representative of said test surface and overlapping of said patches representative of said reference surface.
Claim 11
Dependent Claim
77 words
A system according to claim 7 wherein said first means, comprises: third means connected to said scanning means for formulating said serial stream of bits into parallel outputs each representative of a word n bits in length with the first word consisting of the first bit in each of n scan lines and each successive word consisting of the next bit in each of said n scan lines repetitively for each group of n scan lines scanned.
Claim 12
Dependent Claim
77 words
A system according to claim 8 wherein said first means, comprises: third means connected to said scanning means for formulating said serial stream of bits into parallel outputs each representative of a word n bits in length with the first word consisting of the first bit in each of n scan lines and each successive word consisting of the next bit in each of said n scan lines repetitively for each group of n scan lines scanned.
Claim 13
Dependent Claim
54 words
A system according to claim 10 wherein said first means further comprises: fourth means connected to said third means for adding each group of n consecutive words of n bits from said third means to provide binary number outputs each representative of a n×n patch of contiguous n×n picture elements of said test surface.
Claim 14
Dependent Claim
37 words
A system according to claim 11 wherein said memory means stores patches equal to n/2×n/2 picture elements; fifth means connected to said memory means for adding patches from said memory to provide patches of n×n picture elements.
Claim 15
Dependent Claim
63 words
A system according to claim 12 further including: subtractor means connected to said fourth and fifth means providing an output equal to the difference between the numbers representative of corresponding patches; comparator means connected to said subtractor means; means providing a threshold to said comparator means whereby said comparator means provides a signal whenever the output from said subtractor means exceeds said threshold.
References Cited (Backward Citations)
US4479145A
Cited
US4510616A
Cited
US4442542A
Cited
US4477946A
Cited
US4500202A
Cited
US4614430A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1990-11-16 | 1991-05-18 | 1991-11-17 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1994-11-16 | 1995-05-18 | 1995-11-17 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1998-11-16 | 1999-05-18 | 1999-11-17 | $7700.00 | Window Closed / Lapsed |