INTERCONNECT VERIFICATION USING SERIAL NEIGHBORHOOD PROCESSORS

Abstract: A serial data image processing system is described whereby interconnect artwork for electronic component manufacturing is scanned by a lxn CCD image pickup element and converted into serial digital data. The serial digital data representing the original image is processed by a programmable serial image processor to detect flaws in the original image artwork. The serial data digital image processor is comprised of a plurality of pipe elements, the configuration of which can be arranged for parallel or serial processing. Each pipe element contains a plurality of 4x5 pixel neighborhood array processing blocks, each of which can be programmed to perform one of a number of neighborhood image enhancement techniques. The 4x5 pixel neighborhood provides single-pass thinning and trimming algorithms which in turn allows for more efficient processing to be performed in the serial pipeline combination of a plurality of transformation neighborhoods.

Description: INTERCONNECT VERIFICATION USING SERIAL NEIGHBORHOOD PROCESSORS Background of the Invention The present invention relates generally to the field of digital image enhancement and image processing. More particularly, this invention relates to programmable serial neighborhood transformation pro¬ cessing systems. Prior art serial neighborhood image pro¬ cessors enhance visual images in digital fashion using various algorithms operating on pixels representing the original image. These image processors first divide the original image into an array of pixels and a digi¬ tal value is assigned to each pixel based on a lumi¬ nance scale. The number of pixels for a given area and the range of the luminance scale for each pixel deter¬ mines the spatial and amplitude resolution for the image processor. The process of converting the origi¬ nal image into a digital representation of the image is done using any device with serial data image conver¬ sion. For serial neighborhood transformation pro¬ cessors, the entire image is raster scanned a single line at a time and the serial raster data is fed through an n x m neighborhood of pixels. The serial data representing the original image is transformed using the n x m neighborhood to perform pattern matching and pattern analysis. The center of the n x m neighborhood is used as the transformation point from the neighborhood and a transformation takes place based on the surrounding pixels in the neighborhood. Image processors are used for a wide variety of sciences including military applications, weather forecasting, automated materials handling, and a host is well suited to digital image processing technology is that of manufacturing defect detection on artwork and layers of printed wiring boards (unpopulated printed circuit boards), hybrid circuits and integrated circuit masks. These last applications use image pro¬ cessing techniques to detect manufacturing defects in the pattern or artwork used for fabricating electronic circuit modules or for detecting flaws in the manufac¬ tured circuits. The integrity of these patterns is crucial to the proper operation of the end product and is typically found to be a large percentage of the overall cost of producing electronic circuits and com¬ ponents. Typical manufacturing defects found on P.7B's or wafer masks are mouse bites, pinholes, opens, shorts, cracks, misalignment errors and various other types of problems typically occurring in wiring pat¬ terns. The aforementioned terms are terms of art that cause particular types of faults in the electronic com¬ ponents which manifest themselves in various ways. Often several distinct failure detection techniques are required to indicate and isolate the manufacturing defect. Many of the aforementioned manufacturing defects, however, can be detected and isolated by digi¬ tal image processing techniques by visually scanning the product during manufacturing. Some of the aforementioned manu acturing defects typically found on PC boards or wafer masks have been postulated to be detectabale using various neighborhood transformation algorithms as described mathematically in an article authored by Jon R. Mandeville found in the IBM Journal of Research and Development, Vol. 29, No. 1, January 1985, pp. 73-86. Various image enhancement algorithms using specific image processing primitives (neighborhood transfor¬ mations) are described in the article, such as expan- sion, contraction, thinning and trimming. These image processing primitives when combined for use in feature detection algorithms can be used to identify and locate various faults in artwork. However, the thinning and trimming primitives require several stages of the tra¬ ditional 3x3 neighborhood transforms, resulting in extensive hardware overhead that can be avoided with the present invention. The present invention improves upon the prior art by combining the use of an extended neighborhood of pixels to achieve single stage thinning and trimming with a more efficient architecture, resulting in lower- cost real time image processing. The present invention relates generally to the improvement of serial neigh¬ borhood transformation processors and is not intended to be limited to the particular application of electro¬ nic PWB fault detection. Summary of the Invention The present invention provides .an improved binary serial data digital image processing system in which a 1 X n CCD light detection element scans and digitizes an image into a serial stream of binary pixel elements which are processed by a programmable neigh¬ borhood serial image processing system for the enhan¬ cement of the original image and/or the detection of manufacturing flaws. The system can be programmed to perform image processing algorithms in parallel based on a plurality of programmable neighborhood image pro¬ cessing primitives. The image processing system per¬ forms these image enhancement techniques at real time speed on the serial pixel data. A plurality of neigh¬ borhood processing stages (programmable to perform a plurality of image processing primitives) are arranged in a serial fashion to perform a variety of image pro¬ cessing algorithms on the serial pixel image data. The number and type of algorithms that can be performed are user configurable. Another feature of the present invention is an extended nxm neighborhood transformation processor whereby thinning and trimming primitives are performed in a single neighborhood stage. The single pass thinning and trimming primitives are implemented using a plurality of matching templates and restriction templates which detect valid thinning and trimming con¬ ditions on the pixel data image. Although in the preferred embodiment the pre¬ sent invention is applied to the detection of errors in electronic artwork, it will be appreciated by those skilled in the art that the present invention is appli¬ cable to many types of image enhancement applications that use binary serial data image processing neigh¬ borhood transformations. Brief Description of the Drawings In the drawings , FIGURE 1 is a detailed block diagram of the image processing system showing the plurality of pipe elements and feature detectors. FIGURE 2 is a detailed block diagram describing an individual pipe element with the 16 neighborhood transformation stages. FIGURE 3 shows a detailed description of a single neighborhood transformation stage used in a pipe element. FIGURE 4 shows a detailed description of the expansion and contraction algorithms used in the pre¬ sent invention. FIGURE 5 shows a detailed description of the thinning templates and thinning restriction templates used in implementing the one-pass thinning algorithm of the present invention. FIGURE 6 shows a detailed description of the trimming templates and the trimming restriction tem¬ plates used implementing the one-pass trimming algo¬ rithm of the present invention. FIGURE 7 shows a number of T-join templates which correspond to the feature detect templates used in the 3x3 subset of the 4x5 serial neighborhood trans¬ formation processor. FIGURE 8 shows a number of B-join templates which correspond to the feature detect templates used in the 3x3 subset of the 4x5 serial neighborhood trans¬ formation processor. Detailed Description of the Preferred Embodiment In the preferred embodiment of the present invention, a CCD image detection device is arranged as a lx4096-bit scanning head with the printed wiring boards (P B's) passing thereunder. The CCD detection circuit converts the image into a lx4096-pixel scan line for each period of time that the electronic com¬ ponent artwork is stepped past the CCD image detection device. Each of the 4,096 pixels is assigned an 8-bit gray scale luminance code based on its light reflec¬ tivity. Each 8-bit code for each corresponding pixel in the 1x4096 scan line is serially shifted to a threshold detection circuit. The threshold detection circuit converts the 8-bit code for each pixel into a 1-bit code corresponding to whether the original reflectivity of the pixel on the scanned image lies above or below a given threshold. The threshold corre¬ sponds to whether the original pixel had scanned, for example, a portion of a metal pattern, or had scanned a portion of non-iaetalized substrate. Figure 1 is a detailed block diagram of the image processing system. The CCD image analog pixel data is serially fed pixel by pixel from the 1 x 4,096 pixel scan detection circuit 300 to the image processor board along data path 301. The CCD analog data is con¬ verted to 8-bit grey-scale digital format by the analog to digital converter circuit 316. The 8-bit grey-scale serial data 317 is transformed by threshold detector 302 into a 1-bit serial data passed along 1-bit data path 303. The threshold level is user programmable and can be set to any level on the luminance grey-scale. 1-bit serial data 303 is then placed on a dedicated line on data bus 304 for use by pipe elements 305a through 305p. It will be appreciated by those skilled in the art that although in the preferred embodiment disclosed here the image data source is from a real¬ time CCD scanner, the image data may be sourced by other types of scanners and from stored images fixed in memory. In the preferred embodiment, the image pro¬ cessor contains sixteen pipe elements for processing the serial image data. These pipe elements 305a-305p take data from data bus 304, and pipe elements 305a-3051 return data back to data bus 304 (shown in Figure 1 as lying both above and below the pipe elements for clarity). Four pipe elements 305m-305p among the group of sixteen pipe elements have dedicated outputs con- nected to feature detectors 313, 312, 311, 310, respec¬ tively. In particular, pipe element 305p is connected to feature detector 310; pipe element 305o is connected to feature detector 311; pipe element 305n is connected to feature detector 312; and pipe element 305m is con¬ nected to feature detector 313. The feature detectors are special types of pipe elements designed to locate specific pixel configurations in the scanned image. In the present preferred embodiment, the limit of four feature detectors limits this system to four pipelines operating in parallel at any given time, although those skilled in the art will quickly recognize that this number can be increased or decreased. Ail of the pipe elements in the image pro¬ cessor system are programmable in their transformation functions and their interconnect, and are identical in their construction. For example, pipe element 305a may receive camera data from data bus 304 and place the transformed image back onto data bus 304, where the transformed data may be selected by pipe element 305p. In this fashion, multiple pipe elements can be cascaded to perform complex image transformations. Each pipe element is assigned a dedicated data line on the data bus in the preferred embodiment. Hence, the output of pipeline 305a would be to a dedicated line (not shown) and if pipeline 305p were to take the output data from pipeline 305a, it would select the dedicated data bus line corresponding to pipe element 305a. Pipe elements 305m through 305p do not have dedicated data lines on the data bus 304 since their outputs go directly to the feature detectors. In addition, the data bus contains a dedicated data line corresponding to the CCD camera data input from line 303. The configuration of these image processing pipe elements 305 is programmable by the user through the use of control commands. Control information is down-loaded along the data bus 304 to the individual pipe elements from the control logic 316. In the pre¬ ferred embodiment of the present invention, 16 pipe elements are provided which can be arranged as parallel processors processing the same data simultaneously and performing separate functions; or the pipe elements may be arranged in any combination of serial processors performing image enhancement transformations on the serial data after another processor has completed its processing of the serial data. The flexibility of the arrangements of pipe elements provides for the ability to perform complex image enhancement techniques at high speeds with up to four complete cascaded pipelines. A detailed block diagram of an individual pipe element is shown in Figure 2. Each pipe element con¬ tains a plurality of 4x5 pixel array processing stages (401, 417, 418, etc.). Each of these processing stages is fully programmable to perform one of a number of digital image processing enhancement algorithms. The algorithms are based on the neighborhood concept of modifying digital pixel data based on the pixel value of the several pixel neighbors. Each programmable pixel array processing stage can perform an image enhancement primitive only once on the serial data as it passes through the pixel neighborhood stage. Each pipe element in the preferred embodiment contains a series of sixteen programmable pixel array processing stages arranged in a serial order. Each 4x5 pixel processing stage can per¬ form the following digital image processing primitives: 1) 8-neighbor contract; 2) 4-neighbor contract; 3) 8-neighbor expand; 4) 4-neighbor expand; 5) 1-pass thin; 6) 1-pass trim; 7) single pixel remove; 8) single pixel save; and 9) no operation (NOP). The contract, expand, single pixel remove and single pixel save functions only require a 3x3 pixel array to perform indicated function; however, the thin and trim functions require a 4x5 pixel array, as described in detail below. Each of the neighborhood stages shown in Figure 2 are independently programmable. The first neighborhood stage 401 can be programmed to perform any one of the aforementioned image processing primitives by loading control register 402 with the appropriate control data. The control data is sent to the various control registers for the transformation stages through the data bus 403, via the control register selector 404. The data bus doubles as both data bus and instruction bus at different time frames. Once the various stages are programmed to operate in their predetermined fashion, the data bus is dedicated to transferring pixel data only. In programming mode, the data bus transfers the control information to the control register selector 404, which in turn selectively loads all of the control registers for a single pipe element. Control registers 402, 405, 406, 407 and others can be programmed to any one of the image transformations or they can be programmed to simply pass data unaltered. The data selected for processing by the pipe element is selected by the data multiplexers 408 and 409 under control of control registers 410 and 411 respec¬ tively. The multiplexers 408, 409 take their respective data off data bus 403 which may come from either the camera data source or from any one of the other pipe elements attached to dedicated lines on the data bus. One-bit ALU 412 under control of control register 413 can be programmed to perform any one of four operations on the incoming data. Data multiplexer 408 taking data from one data source and multiplexer 409 taking data from another data source can either have the data com¬ bined, subtracted, exclusive ORed or inverted by ALU 412. In addition to the aforementioned functions of the ALU, data from a single source may be inverted or passed unaltered through ALU 412 for use by the various stages . The data is synchronized throughout the system by use of a DATA-VALID bus 421. The DATA-VALID signals correspond to the time that the data was originally scanned. Selector 420 selects the appropriate DATA- VALID line corresponding to the data line selected by selector 409 on the data bus 403 and is controlled by the same control register 411. The nature of the DATA-VALID signal is a flag indicating the beginning and end of one scan line. Data passing through the stages experience a delay of several clock cycles due to the inherent nature of a serial neighborhood processor. This process will be described in detail later where an individual neighborhood is described. To provide for proper coordination of data flowing through the pipe elements, the DATA-VALID bus 421 is used for synchro¬ nizing control. DATA-VALID signals passing through the system suffer the same delay as the data when passing through the pipe elements such that the DATA-VALID signals and the data stay in concert throughout the system. The pass ladder 415 is used to coordinate the data with the DATA-VALID signals by delaying the DATA-VALID signals by the same amount of delay experienced by the data passing through the transfor¬ mation stages . Memory data bus 414 and memory address bus 416 are used to store the portion of the scan lines that are not being operated on by the various stages at the par- ticular transformation time. This data is written into and read out of the stages in serial fashion according to the nature of the raster scan of the image. The memory (not shown) is comprised of industry standard memory chips arranged for high-speed serial access. The data is written at fixed memory locations and the addresses are cycled to read and write the data. The data output of the first transformation stage 401 drives the input to the second stage 417 from the center of interest of the 4x5 neighborhood found in the first stage. In a like fashion, the output of the second stage 417 drives the input to the third stage 418 from the center of interest of the 4x5 pixel neigh¬ borhood. The output of the last stage 419 in the pipe element also is derived from the center of interest of the 4x5 pixel neighborhood. The output of the sixteenth or last stage of the pipe element is returned to the data bus for use by other pipe elements or is sent to a dedicated entity detector if this particular pipe ele¬ ment was so dedicated. Figure 3 is a detailed description of a single transformation stage of a pipe element. The 4x5 pixel array 500 is shown in the upper left of the diagram. Each block in the 4x5 pixel array represents a 1-bit register for holding a single pixel. Three of the lines in the 4-line by 5-column pixel array have a 4091-bit serial shift register or memory attached in series. The serial pixel data enters the pixel array processing block in the line 1, column 1 location (labeled Bl ) and is shifted to the line 1, column 2 pixel location (labeled B2). The serial pixel data is shifted along the line and the output of the line 1, column 5 (B5) pixel is loaded into the first 4,091-bit shift register or memory 501 attached thereto. The output of the first 4,091-bit shift register or memory 501 is serially shifted into the line 2, column 1 location (B6) of the pixel array 500. Lines 2 and 3 also have a 4,091-bit serial shift register or memory (502 and 503 respec¬ tively) attached for holding the serially shifted pixel data. The output of the line 3 shift register 503 is passed to the line 4, column 1 pixel position (B16). The line 4, column 5 pixel position (B20) shifts the serial pixel data out where it is discarded. In an alternate embodiment, the present inven¬ tion may be implemented with the transformation stages of each 4x5 pixel neighborhood having the serial shift registers take their data from the first pixel location in each line. In this embodiment, the serial shift registers would be 4,095 bits long and -would contain nearly one complete scan line. The shift registers would continue to feed the 4x5 neighborhood on the first pixel locations in each line and take the data from each pixel location on that line. In this embodiment, loca¬ tion Bl of transformation neighborhood 500 would receive the input pixel data and would drive both location B2 and scan delay line 501. In a like fashion, pixel loca¬ tion B6 would receive its data from scan delay line 501 and drive both pixel location B7 and scan delay line 502. The output of locations B5, B10, B15 and B19 on transformation neighborhood 500 would all be discarded. The center of the neighborhood for the algorithm, that is, the pixel of interest, is located at line 3, column 3 (B13). This location (B13) serves as the output of this stage for the relative point in the next stage. The output is modified according to the image processing primitive programmed for the present pixel array processing stage. The modified value of the pixel of interest is then shifted into the next pixel array processing stage in the pipe element. Each programmable 4x5 pixel array processing block is iden¬ tical to the aforementioned. The serial pixel data is passed on from pixel array processing stage to pixel array processing stage until the data exits the pipe element. The data exiting the pipe element is placed on the data bus on a dedicated line where it can be passed under program control to another pipe element. Data exiting pipe elements 305m through 305p is passed to the respective dedicated feature detectors 310 through 315. The raster scan digital representation of the original image is stepped pixel by pixel through the pixel array neighborhood 500 shown in Figure 3 according to the data path described above. The pixel data is stepped through the neighborhood 500 under synchronous control of a clock (not shown). Between clocking pulses with all pixel data at rest, the pixel array processing block performs an image transformation on the pixel neighborhood according to the transformation type programmed into control register 504. Control register 504 within a single stage corresponds to the control registers 402, 405, 406, 407, etc., shown in Figure 2. The transformation logic shown in Figure 3 is comprised of seven separate decision trees. The thin decision tree 505 operates in parallel with the trim decision tree 506, the expand decision tree 507, the contract decision tree 508, the pixel remove decision tree 509, the pixel save decision tree 510, and the NOP (no operation) decision tree 511. All the aforemen¬ tioned decision trees receive the 20 pixel values from the neighborhood and perform a logical decision on whether to modify the output from the pixel value found in the center of interest of the neighborhood. All seven decision trees make their decision based on their hardwired logic structure, but only one of the decisions may be used. The primitive output select 512, under - control of the control register 504, selects one of the seven decision tree outputs for passing the modified or unmodified pixel data of the center of interest on to the next stage or on to the data bus. As the data passes through the processing block stage from input to output, it can be seen in Figure 3 that the relative pixel data from one stage to the next is delayed by an amount equal to 2-line plus 3-pixels. The signal line shown on the right side of Figure 5 synchronizes the scan lines as they are passed through the neighborhood stages. This signal line pre- ^ sents a DAT -VALID signal which is synchronized to the beginning and the end of the scan line data. This signal flows through the pipe elements of the image pro¬ cessor in parallel with the pixel data and corresponds to the PASS LADDER 415 shown in Figure 2. Since the DATA-VALID signal and the pixel data must remain synchronized throughout the processing stages, each stage in the pipe element provides for an appropriate amount of synchronizing delay to keep the clock signal and the pixel data in synchronization. Hence, the delay block 513 delays the DATA-VALID signal by an amount of time corresponding to a 3-pixel delay suffered by the data. As a result, the next stage in the pipe element receives the serial pixel data and the clock signal in perfect synchronization delayed by a 3-pixel amount. In an alternate embodiment, the serial shift registers are connected to the 'pixels in the first column of the pixel array neighborhood. The shift registers in this embodiment would be 4,095 bits wide with 4 of the bits of each line residing simultaneously in the shift register and in the neighborhood. For this embodiment, delay block 513 would still delay the DATA-VALID signal by 3 pixels. The one-scan delay line shift registers 501, 502 and 503 shown in Figure 3 are in the preferred embo¬ diment implemented in commercially available memory chips. The data in the memory chips does not actually shift or change positions, as in a traditional shift register, but stays in a stationary position while the address lines scan through the memory. The memories 501, 502 and 503 are shown in Figure 3 enclosed in the dashed line labeled 514, since they are normally not found as a part of the image processing stages shown in Figure 2. The memory data bus 414 shown in Figure 2 represents the passing of data from the neighborhood 500 to the memory groups 514. Memory data bus 414 corresponds to the data lines exiting neighborhood 500 from the right and entering neighborhood 500 from the left shown in Figure 3. The memory group 514 is sequen¬ tially addressed by counters which are continually clocked in synchronization with the pixel data flowing through the stages. The counters step through the memory addresses to continually read and write the pixel data. As is well known to those skilled in the digital arts, the memory address counters all operate in synchronization with the pixel data by means of global synchronization clocks (not shown). All operations of this machine are synchronized by these clocks, including the stepping of pixel data through neighborhood 500. The primitives that the neighborhood trans¬ formation processor performs are shown in Figures 4, 5 and 6. The NOP primitive is not shown because it is intuitively obvious that no transformation takes place and the data is merely passed through. Figure 4 shows the expand, contract, pixel remove and pixel save primi- tives. The implementation of these primitives is accomplished using digital logic which collects the relevant pixel value signals from the neighborhood and performs a logical decision, as shown in Figure 3. For example, to implement the 4-expand algorithm shown in Figure 4, one would logically OR neighborhood positions B8, B12, B14, B18, and the center of the neighborhood, B13 of processing neighborhood 500 in Figure 3. If the center of the neighborhood is a logi¬ cal 1 or any of the aforementioned surrounding pixels are at a logical 1, the 4-expand result would be a logi¬ cal 1. The logic decision trees shown in Figure 3 are hence implemented in digital logic with the trees wired in a dedicated fashion to the neighborhood positions required to perform that algorithm. Figure 5 shows the 1-pass thin primitive. In analyzing the structure of an object in an image, it is often necessary to represent and characterize the object in a compact and approximate representation. The 1-pass thin algorithm is used for reducing binary line drawings into sets of skeletons which represent the original pat¬ tern. Thinning is a shrinking operation which deletes from an object boundary all pixels, the removal of which does not disturb the general configuration and connec¬ tivity. It also guarantees that the final connected skeleton does not change or vanish even if the process continues for many iterations. There are eight basic thinning templates defined for the 1-pass thinning algorithm, and two restriction templates. The thinning templates are used for deleting boundary pixels while the restriction templates are used for preventing dele¬ tions of pixels if connectivity is broken. The thinning templates are shown in Figure 5 and labeled Tl through T8. The thinning restriction templates are shown labeled Rl and R2. Any pattern that matches one of the thinning templates and does not match a thinning restriction will have its center pixel set to zero. The entire set of thinning templates are applied simulta¬ neously to the image. The trimming templates are shown in Figure 6 and ' consist of ten trimming templates labeled Til through T20, and two trimming restriction templates labeled R3 and R4. Trimming templates are used to reduce the noisy picture and trim off single-bit appen- . dages from images. This results in a cleaner picture. However, the trimming templates as used also require trimming restriction templates. If trimming were used continuously, the object being trimmed would converge to a single pixel since the very ends would continue to be trimmed. To prevent this from happening the trimming restriction templates on a 4x5 neighborhood are used to detect a valid edge of an image and prevent the trim from taking place. After the image data has been processed by the pipe elements in the pipelines, the data is passed to feature detectors to locate certain features of interest. The feature detectors shown in Figure 1 operate in a similar fashion to the serial neighborhood transformation processors in that a transformation neighborhood identical to the type shown in Figure 3 is used to detect specific configurations of pixels indi¬ cating specific types of features. The main type of features that are used in image processing are T-joins and B-joins which can be detected by using a 3x3 neigh¬ borhood shown in the dark line surrounding B7, B8, B9, B12, B13, B14, B17, B18 and B19 in Figure 3. T-joins come in many varieties and are characterized by a single thin line attaching to another thin line, as shown in Figure 7. The lines may attach to one another at any angle and from any direction. The basic T-joins would be lines approaching other lines from the eight basic compass directions that can be represented by a 3x3 pixel neighborhood. Several T-join templates that are used in the feature detector are shown in Figure 7. The list of T-joins shown in Figure 7 is not exhaustive. Those skilled in the art will recognize that many variations and permutations on these T-joins are possible. Several B-join feature detect templates are shown in Figure 8 and are characterized by single lines approaching a block of pixels. This list of templates is also not exhaustive since many variations and per¬ mutations are possible, as those skilled in the art will readily recognize. The detection of any one of the aforementioned features is flagged by the feature detec¬ tor and the information is placed on the output bus by the feature detectors of each image processing pipeline. All of the forementioned transformation algo¬ rithms are used to modify digital pixel images to put them into a form which can be analyzed efficiently. For example, in the preferred embodiment of the present invention wherein the images being analyzed represent P B's or PCB layers, the images are analyzed to detect flaws and faults. A simple example of a technique to detect shorts between adjacent electrically conducting lines would be to successively thin and trim the electrical interconnect lines until nothing but a skele¬ ton remains. Then by using the feature detector shown in Figure 1 and applying the feature detect templates of Figures 7 and 8, any connections between the electrical conductors could be detected. Another example of the application of the pre- sent invention to verifying PV 7 B's or PCB layers is to measure minimum spacing distances between the electrical conductors. This can be done by successively expanding the image a fixed number of times, which corresponds to the minimum spacing allowed between the conductors. Any conductors that would violate this minimum spacing rule would, on expansion, connect. The next step in this flaw detection algorithm would be to successively thin and trim the resulting expanded image until it is thinned down to its skeleton. Once again, a feature detector can be used to detect connections between the adjacent electrical conductors which would indicate a violation of the minimum spacing rule. The aforementioned algorithms for detecting flaws in the interconnect can be accomplished by the present invention by programming the individual trans¬ formation stages within a pipe element to accomplish the successive trims, thins, expands and contracts necessary to implement the algorithm. In addition, several algorithms can be implemented and operated in parallel by programming the configuration of the pipe elements to accomplish the desired algorithm. Although specific logic configurations and electrical configurations have been illustrated and described for the embodiment of the present invention set forth herein, it will be appreciated by those of ordinary skill in the art that any conventional logic or electrical arrangements which are calculated to achieve the same purpose may be substituted for the specific configurations shown. Thus, although conventional LSI and MSI logic is generally preferred due to its availa¬ bility and speed, the logic described herein may be implemented through the use of conventional components or it may be all combined to a greater or lesser degree in a fewer number of VLSI components. In addition, it will be readily appreciated by those of ordinary skill in the art that although positive logic conventions have been here employed, negative logic conventions may be alternatively utilized where a 1-level corresponds to a lower voltage than a 0-level. Additionally, although specific logic components and associated conditions necessary for the operation of this system have been mentioned in order to describe the preferred embodiment of the present invention, complimentary logic con¬ figurations similar to those mentioned may alternatively be employed such as the substitution of NOR-type logic for NAND-t pe logic without any deviation from the con¬ cepts of the invention disclosed. Also, microprocessor, microcontroller or PAL control may readily be substi¬ tuted for hardwired control, and vice versa, without departing from the spirit or scope of the present inven¬ tion. While the present invention has been described in connection with the preferred embodiment thereof, it will be understood that many modifications will be readily apparent to those of ordinary skill in the art, and this application is intended to cover any adapta¬ tions or variations thereof. Therefore, it is mani¬ festly intended that this invention be limited only by the claims and the equivalents thereof.

Claims: HAT IS CLAIMED IS: 1. An image processing apparatus comprising: a data bus means for receiving and sourcing a plurality of serial bit streams of digital data repre¬ senting images; image source means for generating an original serial bit stream of digital data representing a scanned image and connected to said data bus means; a plurality of processing elements arranged for parallel processing, each having input means connected to said data bus means for receiving said serial bit streams and each having output means for sourcing a pro¬ cessed serial bit stream each being attached to one of said data bus means and an image output means; each of said processing elements comprising: select means attached to said input means for selecting one of said serial bit streams of said data bus means; a plurality of serial neighborhood processing stages arranged as as cascade, the first of which being attached to said select means and the last of which being attached to said output means, each of which having memory capable of storing a plurality of said digital data; stage control means attached to said select means for causing said select means to select one of said plurality of serial bit streams from said data bus means; said stage control means further attached to each of said, serial neighborhood pro¬ cessing stages for selecting one of a plurality of image transformation algorithms to be performed upon said digital data of said serial bit streams 2. The apparatus according to claim 1 wherein said image output means includes an feature detect means for detecting specific image configurations within said serial bit streams. 3. The apparatus according to claim 1 wherein each of said serial neighborhood processing stages includes: an n-line by m-column array of shift registers con¬ nected for shifting said digital data of said serial bit streams along each of said lines; a plurality of serial shift memories connected to said n-line by m-column array for transferring said digital data of said serial bit streams from one line to the next; digital logic means attached to said n-line by m- colu n array for receiving said digital data of said serial bit stream and for performing a transformation upon said digital data based upon matching templates; and output selection means attached to said digital logic means for selecting one of a plurality of trans¬ formation algorithms. 4. The apparatus according to claim 3 wherein said digital logic means includes thinning templates and thinning restrictions concurrently applied to said digi¬ tal data of said serial bit streams to produce a single- pass thin transformation. 5. The apparatus according to claim 3 wherein said digital logic means includes trimming templates and trimming restrictions concurrently applied to said digi¬ tal data of said serial bit streams to produce a single- pass trim transformation. 6. A serial neighborhood transformation stage compri¬ sing: data input means for receiving a serial bit stream of digital data representing pixels of a two-dimensional raster-scanned image; an n-line by m-column matrix of shift registers operable for holding a subset of said digital data of said serial bit stream and having an assigned center of interest; template means connected to said matrix for performing a logical decision based upon the values con¬ tained in said matrix for determining when a valid condition exists for transforming said center of interest; restriction means connected to said matrix and said template means for preventing said template means from operating if connectivity within the two-dimensional raster-scanned image would be broken by said template; and data output means connected to said center of interest of said matrix for presenting transformed data. 7. The apparatus according to claim 6 wherein said template means further operates to thin the two- dimensional raster-scanned image by removing excess digital data surrounding a skeletal representation of the original image. 8. The apparatus according to claim 6 wherein said template means further operates to trim excess digital data from the two-dimensional raster-scanned image. 9. A method of processing serial image data, the steps comprising: (a) raster-scanning an image to be processed; (b) converting the scanned image into a serial bit stream of digital pixel data; (c) passing said pixel data through an n by m pixel matrix arranged in a row/column array such that said matrix contains a portion of the digital pixel data representative of the original image; (d) thinning the digital representation of the original image by removing selected pixel data from said matrix by applying thinning templates to the serial data passing through the matrix to remove excess pixels without breaking the skeletal connectivity of the origi¬ nal image; (e) outputting said processed serial pixel data and detecting entities contained within the serial pixel data corresponding to desired features located in the original image.

Inventors: CHIN ROLAND T, IVERSON DAVID R, MCPHEARSON MATTHEW, STOVER DAN, CHIN, ROLAND, T., IVERSON, DAVID, R., MCPHEARSON, MATTHEW, STOVER, DAN
Applicants: APPLIED VISION SYSTEMS INC, APPLIED VISION SYSTEMS, INC.
Application year: 1988
Main classification: G06F15
IPC codes: G01N21, G06T1, G06T5