Patent Publication Number: US-2004051030-A1

Title: Method and apparatus for acquiring images from a multiple axis imaging system

Description:
[0001] This invention relates generally to multiple axis imaging systems. More specifically, the invention relates to a method and apparatus for acquiring images from an array of optical imaging elements and corresponding detectors, particularly a miniature microscope array comprising a plurality of magnifying optical imaging elements and corresponding detectors arranged in a two-dimensional array.  
       BACKGROUND OF THE INVENTION  
       [0002] Light microscopes are commonly used in biological and biochemical analysis. Such microscopes produce an image of an object corresponding to the field of view of the microscope&#39;s imaging lens system. The image may be captured by a detector and stored in a computer for further analysis.  
       [0003] A recent innovation in such imaging is the miniature microscope array (“MMA”). In such an array, a plurality of miniature imaging elements having respective optical axes and magnifications whose absolute value is greater than one are arranged in a two-dimensional array for producing respective enlarged images of respective objects or portions of a single object. For imaging a single object or specimen, the plurality of imaging elements together function in the manner of a single microscope by forming respective partial images of the object that are subsequently concatenated to form a whole image (hereinafter “array microscope”). Alternatively, the individual imaging elements may be used to wholly image, respectively, corresponding disparate objects or specimens supported by a common slide or carriage to function as an array of microscopes (hereinafter “microscope array”).  
       [0004] In an MMA, the array of the imaging elements (hereinafter “imaging array”) are ordered in rows and columns, the rows of elements extending in a first dimension across an object while the object is translated in a second dimension past the fields of view of the individual imaging elements in the array, to create respective column strips of data corresponding to each miniature imaging element. These data are acquired so as to produce an image of the object or objects viewed by the MMA. In an MMA, the image size is larger than the lateral field of view of the imaging elements. In addition, the imaging elements are ordinarily diametrically larger than the lateral field of view. Both of these characteristics, alone or together, create a requirement for the MMA that is not readily apparent. That is, the images produced by adjacent imaging elements in the array cannot correspond to contiguous objects or regions of an object. For example, if the diameters of the imaging elements are larger than their fields of view by a factor of ten, or the magnification of the imaging elements is one-to-ten, and if there are two imaging elements forming a first row of the imaging array packed tightly together, the two imaging elements can image only two regions across the object that are only one-tenth the lateral extent of the object and are widely separated from one another.  
       [0005] Looking at the lateral fields of view of the imaging elements as dividing the object into segments, because the diameters of the imaging elements are larger than the segments by a factor of ten, it is only possible to image every tenth segment across the object with the first row of the imaging array. For example, the first row of the imaging array can be used to image the first and the eleventh segments of the first row across the object, or the second and the twelfth segments of the first row across the object, and so on. However, it is not possible to image the first and, for example, the ninth segments of the first row across the object with a single row of the imaging elements because the imaging elements are too large to pack closely enough together.  
       [0006] Thus, assuming the first row of the MMA is provided to image the first and eleventh segments of a given row across the object, a second row of the MMA must be provided to image the second and twelfth segments of the first row across the object, and the object is thereafter moved to align the first row across the object with this second row of the MMA after the first and eleventh segments have been scanned. Similarly, the object is thereafter moved to align the first row across the object with a third row of the MMA which is provided to image the third and thirteenth segments of the first row across the object, and so on, until all twenty segments of the first row across the object are imaged. Therefore, in this explanatory example, imaging one row across the object requires a two-dimensional imaging array comprising ten rows of two imaging elements each in the MMA. In practice, an imaging array that can image the entire area of a standard 20 mm by 50 mm microscopy slide has about 80 imaging elements arranged, for example, in ten rows of eight imaging elements.  
       [0007] It can be seen that when an object is scanned by an MMA, the time frames during which data are acquired from spatially contiguous regions of the object are not temporally contiguous. This often requires reorganization or recording of the data produced by the detectors of the imaging elements to create an image of the object. In the specific case of an array microscope, data acquired from the imaging elements during a particular time frame must be reorganized and stitched together so that data from contiguous regions of the object can be displayed contiguously.  
       [0008] In addition to the afore-described data organization problem that is inherent to an imaging array where the spacing between imaging elements exceeds the fields of view thereof, a similar problem is caused by the detector technology that is suitable for capturing images produced by the imaging elements. Ordinarily, a linear array of detecting elements arranged in the row direction of the array is associated with each imaging element to capture the image produced thereby in one, row dimension. In this case, as the object is advanced with respect to the array during scanning, one-dimensional images are captured by each row during sequential time frames and later read out one pixel at a time in the column direction of the imaging array. Current technology such as CMOS detector arrays allow parallel readout of each line but, as a practical matter, the pixel data in the array is transmitted and processed serially either in the row or column direction, one row or column at a time. Consequently, data from non-contiguous pixels, or sets of pixels, are interlaced with one another. Moreover, this is so even if two-dimensional arrays of detecting elements are associated with each imaging element so that each time frame represents multiple pixels in the column direction of the imaging array.  
       [0009] Thus, while an MMA inherently provides the outstanding advantage of greatly decreasing the time required for acquiring an image due to the parallel processing performed by the plurality of imaging elements in the array, it may be appreciated that to reconstruct the image requires a substantial amount of buffering, reorganization and, typically, stitching of data. In addition, it is often desirable to process the data further, for example, to correct the gain and offset of the data, and to sharpen the image.  
       [0010] Several patents address stitching together data from a plurality of linear detector arrays arranged laterally with respect to an object to produce data representing one row or line across the object in an optical scanner. The fundamental problem addressed is to account for errors in mechanical alignment of the linear arrays. U.S. Pat. No. 4,149,090 and U.S. Pat. No. 4,734,787 address this problem by arranging alternate linear arrays so that they are offset in the scan direction and overlap one another, so that two time frames of scanning are needed to create a full-width row of scan data. The overlapping pixel data are then operated on to stitch together one line, thereby aligning the data laterally. Similarly, U.S. Pat. No. 4,734,787 proposes to stitch data from a plurality of linear detector arrays and associated imaging optics that have laterally overlapping fields of view, and to delay data acquired during earlier time frames corresponding to a line so as to compensate for misalignment in the scan direction. However, there is no recognition in any of these references of the data reorganization problem that is inherent in an ordered array scanner that has either a high numerical aperture or a magnification whose absolute value is greater than one. Nor is there recognition of the problem of creating an image from a stream of interlaced data from non-contiguous object regions.  
       [0011] To capture and process image data from a camera, one known method is to couple the camera via a data-link to a data acquisition circuit which stores the data onto hard disk drives as it streams from the camera. Bacus et al., U.S. Pat. Nos. 6,101,265, 6,226,392, and 6,272,235 provide examples of this method applied to a single-axis microscope. A host computer, such as a personal computer, is connected via an interface bus to the data acquisition circuit, and retrieves the data after it is stored for further manipulation and processing to permit viewing.  
       [0012] In addition to the failure of this strategy to take advantage of the inherently superior data throughput provided by an MMA, the time required to store the data on the hard drive and retrieve the data for reorganization and image processing is highly undesirable, especially in applications such as telepathology, where the time between image acquisition and display should be as close to immediate as possible. For example, about 20-25 minutes may be required to obtain and process a complete high resolution image of a standard 20 mm by 50 mm microscopy slide.  
       [0013] The very large amount of data produced by an MMA only exacerbates this temporal problem. Moreover, since the MMA architecture inherently provides for fast acquisition of data, it is particularly undesirable to burden the MMA with the overhead associated with intermediately storing image data on hard drives before completing the processing necessary for viewing the image. In that regard, in the MMA the time required to reorganize and otherwise process the data for viewing, including, for example, correcting the data for differences in sensor offset and gain, is about five times that required to obtain the data from the sensors. Accordingly, to save time when imaging with MMA&#39;s, much larger memory and other computer resources need to be allocated using the standard method for transmitting images.  
       [0014] Accordingly, there is an unfilled need for a method and apparatus for acquiring images from a multiple-axis imaging system such as an MMA that permits reorganizing and processing image data for storage or transmission to a display device in a form suitable for display as fast as the data is acquired.  
       SUMMARY OF THE INVENTION  
       [0015] The present invention meets the challenge of providing a method and apparatus for acquiring images from a multiple-axis imaging system, particularly an MMA, by providing a data processing device for receiving image data as it is read out of an imaging array, reordering or reorganizing the data, and otherwise processing it, for storage in memory or transmission for display. The imaging system scans an object with an array of imaging elements having corresponding detectors for capturing the images produced thereby. Temporally contiguous data acquired from the array necessarily corresponds to non-contiguous regions of the object being scanned. According to a reorganization aspect of the invention, the data processor reorganizes or reorders the data so that the data order corresponds to spatial locations of the respective object regions. Thus, the data may be transmitted in correct order for display of an image of the entire object, or may be mapped to a memory for rapid access and display of the image. Image processing may also take place prior to transmission or storage of the data.  
       [0016] According to a data compression aspect of the invention, the data processor compresses all or selected portions of the data to increase the speed of transmission of the data. Preferably, 8×8 pixel “tiles” of the data are aligned according to the aforementioned reorganization aspect and compressed for transmission to or storage in a host computer. The host computer simply aligns the tiles rather than each pixel in the tiles, decreasing substantially the computer&#39;s workload. This can be done before or after the decompression required for viewing the image.  
       [0017] According to another aspect of the invention, processing may be divided among a number of different processors, including a number of parallel processors, a pre-processor, a post-processor, and a personal computer (“PC”). The reorganization memory mapping, and compression aspects of the invention may be employed together or separately, and may be employed with any number of processors to proportion the total work load in order to achieve higher processing speed, lower cost, or both.  
       [0018] Accordingly, it is a principal object of the present invention to provide a novel method and apparatus for acquiring images from a multiple-axis imaging system.  
       [0019] It is another object of the present invention to provide a novel method and apparatus for acquiring images from an MMA.  
       [0020] It is a further object of the present invention to provide a novel method and apparatus for acquiring images from an array microscope.  
       [0021] It is yet another object of the present invention to provide a novel method and apparatus for reducing the time required for displaying an image captured by a multiple-axis imaging system.  
       [0022] It is yet a further object of the present invention to reduce the required storage capacity for an image produced by a multiple-axis imaging system.  
       [0023] It is another object of the present invention to provide a novel method and apparatus for reducing the time required to transmit an image produced by a multiple-axis imaging system from one location to another.  
       [0024] The foregoing and other objectives, features and advantages of the invention will be more readily understood upon consideration of the following detailed description of the invention, taken in conjunction with the accompanying drawings. 
     
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
     [0025]FIG. 1 is a pictorial view of a miniature microscope array (“MMA”).  
     [0026]FIG. 2 is a schematic diagram illustrating principles of imaging an object with a portion of the imaging array of an MMA, showing the object in a first relative position with respect to the imaging array.  
     [0027]FIG. 3 is a schematic diagram of the object and a portion of the imaging array shown in FIG. 2 along with another portion of the imaging array, showing the object in a second relative position with respect to the array.  
     [0028]FIG. 4 is a schematic diagram of the object and portion of the imaging array shown in FIG. 3 along with yet another portion of the imaging array, showing the object in a third relative position with respect to the array.  
     [0029]FIG. 5A is a schematic diagram of the imaging array of FIG. 4 and another object for imaging with the imaging array.  
     [0030]FIG. 5B is a schematic diagram of one of the imaging elements of FIG. 4, shown with a linear detector array.  
     [0031]FIG. 6A is a schematic diagram of the imaging array of FIG. 5 shown with pixel detecting elements.  
     [0032]FIG. 6B is a data stream output from the imaging array of FIG. 6A according to a memory mapping aspect of the present invention.  
     [0033]FIG. 6C is a schematic diagram of an object scanned by the imaging array of FIG. 6A, showing physical locations on the object corresponding to the data in the data stream of FIG. 6B.  
     [0034]FIG. 6D is a schematic diagram of a memory for mapping the data of FIG. 6B according to the physical locations of FIG. 6C.  
     [0035]FIG. 6E is a schematic diagram showing a memory mapping of the data of FIG. 6B to the memory of FIG. 6D.  
     [0036]FIG. 7A is an exemplary matrix of image data organized according to the principles of the present invention.  
     [0037]FIG. 7B is an output stream of the data of FIG. 7A.  
     [0038]FIG. 8A is an exemplary memory map for storing the data of FIG. 7A according to the present invention.  
     [0039]FIG. 8B is an output stream of the data accessed from the memory of FIG. 8A.  
     [0040]FIG. 9 is an exemplary method for transmitting images from an MMA according to an aligning aspect of the present invention.  
     [0041]FIG. 10 is a block diagram of a hardware system for transmitting images from an MMA according to the present invention, comprising an external DSP unit and associated RAM for use with a host computer.  
     [0042]FIG. 11 is a block diagram of an alternative hardware system for transmitting images from an MMA according to the present invention, wherein the DSP unit and RAM of FIG. 6 is onboard the host computer.  
     [0043]FIG. 12 is a block diagram of yet another alternative hardware system for transmitting images from an MMA according to the present invention, wherein the DSP and RAM of FIG. 6 comprises a plurality of parallel portions for parallel processing.  
     [0044]FIG. 13 is a block diagram of still another alternative hardware system for transmitting images from an MMA according to the present invention, including an FPGA processor and a data compression chip.  
     [0045]FIG. 14 is a block diagram of a further alternative hardware system for transmitting images from an MMA according to the present invention, including a pre-processor and a post-processor. 
    
    
     DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS  
     [0046] The present invention relates generally to multiple axis imaging systems.  
     [0047] The Basic MMA  
     [0048] A recent development in the area of multiple axis imaging systems is the MMA, which is particularly useful to pathologists, who need to quickly scan and image entire tissue or fluid samples in order to find and scrutinize pathologies that may be present in only a very small portion of the sample. For this purpose, individual imaging elements of MMAs are closely packed and have a high numerical aperture. This enables the capture of high-resolution microscopic images of the entire sample in a short period of time by scanning the specimen with the array. The present invention particularly provides for decreasing this time. While described in the context of an MMA, and particularly an MMA used to image a plurality of regions of one object and referred to herein as an array microscope, the invention may be used in any multiple axis imaging system in which its features and benefits may be desired.  
     [0049] An exemplary MMA  10  is shown in FIG. 1. The MMA  10  comprises an imaging array  9  comprising a plurality of individual imaging elements  12 . Each imaging element  12  may comprise a number of optical sub-elements, such as the sub-elements  14 ,  16 ,  18  and  20 . In this example, the sub-elements  14 ,  16  and  18  are lenses and the sub-element  20  is an imaging device, such as a CMOS array. More or fewer optical sub-elements may be employed in the imaging elements. The optical sub-elements are typically mounted on a support  22  so that each imaging element  12  defines an optical imaging axis OA 12  for that imaging element.  
     [0050] According to the standard image processing methods discussed above, the MMA  10  would typically be provided with a detector interface  24  for connecting the microscope to a data acquisition board (“DAQ”)  25  which provides an interface for receiving the image data produced by the detectors  20  of the imaging elements  12 . Also according to the standard image processing methods provided in the prior art, this data would typically be streamed onto hard drives  27  or computer memory. A computer  26  interfaces with the DAQ to retrieve the data and process the data so that it can be usefully viewed.  
     [0051] An object to be viewed is placed on a stage or carriage  28  which is moved with respect to the MMA so as to be scanned by the imaging array  9 . The array would typically be equipped with a linear motor  30  for moving the imaging elements axially to achieve focus.  
     [0052] The MMA  10  also includes an illumination system (not shown) which may be a trans-illumination or epi-illumination system.  
     [0053] Overview of the Description and Reference Information  
     [0054] A discussion of the problem that results from the need to transfer data from the MMA, and their solutions is hereafter provided. FIGS.  2 - 4  illustrate that the more than one row of imaging elements is generally required to image a single row across an object to be imaged. In FIG. 5A, a six element imaging array is presented to show how the MMA scans the object. The discussion concerning FIG. 5A shows how data is acquired by the imaging array, which introduces the fundamental problem to which the invention is directed. FIGS.  5 B- 6 E are provided for illustrating first the basic problem, and then a subsidiary problem that is similar to the basic problem but results from a different cause. A generalized imaging array is also presented along with a generalized transmitted data stream. To facilitate understanding, the following terms are referenced in that discussion with the indicated notation:  
               TABLE 1                          Six element imaging array example                                     Row of imaging array   n           Column of imaging array   m           Segments (on object)   a, b, c, d, e, f           Physical locations (of segments)   La, Lb, Lc, Ld, Le, Lf           Imaging elements   12a, 12b, 12c, 12d, 12e, 12f           Detectors   15a, 15b, 15c, 15d, 15e, 15f           Data (gross, for each detector)   Da, Db, Dc, Dd, De, Df                 Pixel detecting elements (z pixels per detector)                             Detector 15a:   p 1a , p 2a , . . . p za             Detector 15b:   p 1b , p 2b , . . . p zb             Detector 15c:   p 1c , p 2c , . . . p zc             Detector 15d:   p 1d , p 2d , . . . p zd             Detector 15e:   p 1e , p 2e , . . . p ze             Detector 15f:   p 1f , p 2f , . . . p zf                   Pixel data points (fine data for each pixel)                             Detector 15a:   Dp 1a , Dp 2a , . . .Dp za             Detector 15b:   Dp 1b , Dp 2b , . . . Dp zb             Detector 15c:   Dp 1c , Dp 2c , . . . Dp zc             Detector 15d:   Dp 1d , Dp 2d , . . . Dp zd             Detector 15e:   Dp 1e , Dp 2e , . . . Dp ze             Detector 15f:   Dp 1f , Dp 2f , . . . Dp zf                   Individual physical points (location on object corresponding to each pixel       detecting element)                             Detector 15a:   Lp 1a , Lp 2a , . . . Lp za             Detector 15b:   Lp 1b , Lp 2b , . . . Lp zb             Detector 15c:   Lp 1c , Lp 2c , . . . Lp zc             Detector 15d:   Lp 1d , Lp 2d , . . . Lp zd             Detector 15e:   Lp 1e , Lp 2e , . . . Lp ze             Detector 15f:   Lp 1f , Lp 2f , . . . Lp zf                   Memory locations (corresponding to physical locations of segments)                             Location La   Ma           Location Lb   Mb           Location Lc   Mc           Location Ld   Md           Location Le   Me           Location Lf   Mf                 Individual memory locations (memory locations corresponding to physical       locations on object corresponding to individual pixels)                             Ma   Mp 1a , Mp 2a , . . . Mp za             Mb   Mp 1b , Mp 2b , . . . Mp zb             Mc   Mp 1c , Mp 2c , . . . Mp zc             Md   Mp 1d , Mp 2d , . . . Mp zd             Me   Mp 1e , Mp 2e , . . . Mp ze             Mf   Mp 1f , Mp 2f , . . . Mp zf                           Frame index    k           (k may be added as a last index to any data or memory element)                             Generalized imaging array                                     Row of imaging array   n           Column of imaging array   m           Q   m • n           Detectors   1, 2, . . . Q                 Pixel detecting elements (z pixels per detector) (NOTE: first index = # of       pixel, second index = # of imaging element)                         p 11 , p 12 , . . . p 1Q             p 21 , p 22 , . . . p 2Q             p z1 , p z2 , . . . p zQ                   Data (NOTE: first index = # of pixel, second index # of imaging element,       third index = # of frame)                         Dp 11k , Dp 12k , . . . Dp 1Qk             Dp 21k , Dp 22k , . . . Dp 2Qk             Dp z1k , Dp z2k , . . . Dp zQk                   Tile (exemplary) (NOTE: first index = # of pixel, second index = # of       imaging element)                         Dp 11 , Dp 12 , . . . Dp 1Q             Dp 21 , Dp 22 , . . . Dp 2Q             Dp z1 , Dp z2 , . . . DP zQ                           Frame index    k           (k may be added as a last index to any data or memory element)                      
 
     [0055] Geometry of The Basic Imaging Array in an MMA  
     [0056] Turning now to FIG. 2, an example of a method for acquiring data from the MMA  10  is described to show that a two-dimensional array of imaging elements is required to image a single object row “r” across an object  46  in an array microscope embodiment of the invention. In the example given, the object row “r” comprises the four equal-length linear segments a 1 , b 1 , c 1 , and d 1 . While the example illustrates a principle of data acquisition according to the present invention, it is highly simplified to facilitate understanding and does not represent a preferred embodiment of a method for data acquisition according to the present invention.  
     [0057] To image the linear segment a 1 , a single imaging element  12   a   1  shown in plan view is centered thereon as shown. The imaging element  12   a   1  is larger than the segment a 1  to provide a high numerical aperture; in the example shown, the imaging elements have a diameter that is 3 times the length of the corresponding linear segment; however, this ratio may be any that is desired. Packing a second imaging element  12   d   1  as closely as possible to the imaging element  12   a   1  along the axis of the object row “r” permits imaging the linear segment d 1 . However, the segments b 1  and c 1  cannot be imaged.  
     [0058]FIG. 3 shows the object  46  having been translated with respect to the imaging elements in the scan direction indicated by the arrow relative to its position in FIG. 2. This translation brings the linear segment b 1  into view of an imaging element  12   b   1  centered thereon as shown; however, the linear segment c 1  still cannot be imaged.  
     [0059] Turning to FIG. 4, the same object  46  is shown translated once again in the scan direction indicated by the arrow. This translation brings the segment c 1  into view of an imaging element  12   c   1  centered thereon. It is apparent in FIG. 4 that the two-dimensional imaging array  9  defined by imaging elements  12   a   1 ,  12   b   1 ,  12   c   1 , and  12   d   1  is required to image the four segments a 1 , b 1 , c 1 , and d 1  of the object row “r.” Other imaging elements  12   e   1  and  12   f   1  corresponding to segments not shown are illustrated in FIG. 4 (in dotted line) to make the arrayed arrangement of the imaging elements more clear.  
     [0060] The imaging array  9  defined by the imaging elements  12   a   1 ,  12   b   1 ,  12   c   1 ,  12   d   1 ,  12   e   1 , and  12   f   1  can be described as having m columns, where m=2 in this example, and n rows, where n=3 in this example. For example, the imaging elements  12   a   1  and  12   d   1  may be identified as forming the first row of the array, the imaging elements  12   b   1  and  12   e   1  may be identified as forming the second row of the array, and the imaging elements  12   c   1  and  12   f   1  may be identified as forming the third row of the array. Also, the imaging elements  12   a   1 ,  12   b   1 , and  12   c   1  may be identified as forming the first column of the array and the imaging elements  12   d   1 ,  12   e   1 , and  12   f   1  may be identified as forming the second column of the array.  
     [0061] The rows and columns of the imaging array do not need to be perpendicular to each other, so that the imaging elements of each row (or column) are staggered with respect to the imaging elements of the preceding and subsequent rows (or columns). Preferably, the rows (or columns) are perpendicular to the scanning direction but this is not necessary either, it being understood that where the rows (or columns) are not perpendicular to the scanning direction, compensating correction of the acquired geometry may be required. It should also be noted that the selection of which of two dimensions is associated with a row and which is associated with a column is completely arbitrary.  
     [0062] Simplified Example of Scanning with the Basic Imaging Array in an Array Microscope  
     [0063] Turning to FIG. 5A, the imaging array  9  of FIGS.  2 - 4  is shown with an object  46   a  having six object rows r 1 , r 2 , r 3 , r 4 , r 5 , and r 6  of four linear segments each to be imaged. Like FIGS.  2 - 4 , FIG. 5A depicts a highly simplified situation to facilitate understanding of basic principles. The linear segments define four object columns a, b, c, and d. The array  9  has n=3 rows of imaging elements  12  as shown in FIG. 4. The object  46   a  is moved relative to the array  9  in the scan direction indicated by the arrow.  
     [0064] At a time t=1, when the row r 1  across the object is aligned with the row n=1 of the array  9 , the segments a 1  and d 1  are imaged as described above by the imaging elements  12   a  and  12   d . At a next time t=2, when the row r 1  is aligned with the row n=2 of the array  9 , the segment b 1  is imaged by the imaging element  12   b  as described above. Also at the same time t=2, the imaging elements  12   a  and  12   d  image the segments a 2  and d 2  of the next row r 2 .  
     [0065] At a next time t=3, when the row r 1  is aligned with the row n=3 of the array  9 , the segment c 1  is imaged by the imaging element  12   c  as described above. Also at the same time, the imaging element  12   b  images the segment b 2  of the row r 2 , and the imaging elements  12   a  and  12   d  image the segments a 3  and d 3  of the row r 3.    
     [0066] At a next time t=4, the row r 1  has passed the array  9  and the row r 4  is aligned with the row n=1 of the array  9 . At this time, segments a 4  and d 4  are imaged by the elements  12   a  and  12   d , the segment b 3  is imaged by the element  12   b , and the segment c 2  is imaged by the element  12   c.    
     [0067] It can be seen by extension of the description above that the data for the six rows is obtained in the following order:  
                               TABLE 2                          t = 1:   a 1             d 1         t = 2:   a 2     b 1         d 2         t = 3:   a 3     b 2     c 1     d 3         t = 4:   a 4     b 3     c 2     d 4         t = 5:   a 5     b 4     c 3     d 5         t = 6:   a 6     b 5     c 4     d 6         t = 7:       b 6     c 5         t = 8:           c 6                    
 
     [0068] Scanning with the Basic Imaging Array at High Resolution  
     [0069] In practice, preferably, the optical resolution of the imaging elements  12  is about 0.5 microns. The desired scan width is achieved by providing a sufficient number of rows in the imaging array. Due to the size of the imaging elements, the rows of elements must be spaced apart essentially the same distances as the columns. To achieve a resolution of 0.5 microns, the optical elements would typically have a diameter and spacing of about 15 mm. Therefore the area of imaging elements must also be spaced about 15 mm apart, so as to obtain the same resolution in the scanning direction as along the row. This requires on the order of 3000 “frames” or row images to be taken between the rows n=1 and n=2 of the array  9  described above. With 3000 additional object rows between each two rows of the array  9 , spaced Δ units apart, and where the scanning velocity is assumed to be “v”, the image data in Table 2 for the same 8 units of time would be supplemented as shown below:  
                                   TABLE 3                          t = 1:       a 1             d 1             t = 1 + Δ/v:   a 1+Δ             d 1+Δ             . . . .   . . . .           . . . .           t = 1 + 3000Δ/v:   a 1+3000Δ             d 1+3000Δ         t = 2:       a 2     b 1         d 2             t = 2 + Δ/v:   a 2+Δ     b 1+Δ         d 2+Δ             . . . .   . . . .   . . . .       . . . .           t = 2 + 3000Δ/v:   a 2+3000Δ     b 1+3000Δ         d 2+3000Δ         t = 3:       a 3     b 2     c 1     d 3             t = 3 + Δ/v:   a 3+Δ     b 2+Δ     c 1+Δ     d 3+Δ             . . . .   . . . .   . . . .   . . . .   . . . .           t = 3 + 3000Δ/v:   a 3+3000Δ     b 2+3000Δ     c 1+3000Δ     d 3+3000Δ         t = 4:       a 4     b 3     c 2     d 4             t = 4 + Δ/v:   a 4+Δ     b 3+Δ     c 2+Δ     d 4+Δ             . . . .   . . . .   . . . .   . . . .   . . . .           t = 4 + 3000Δ/v:   a 4+3000Δ     b 3+3000Δ     c 2+3000Δ     d 4+3000Δ         t = 5:       a 5     b 4     c 3     d 5             t = 5 + Δ/v:   a 5+Δ     b 4+Δ     c 3+Δ     d 5+Δ             . . . .   . . . .   . . . .   . . . .   . . . .           t = 5 + 3000Δ/v:   a 5+3000Δ     b 4+3000Δ     c 3+3000Δ     d 5+3000Δ         t = 6:       a 6       b5     c 4     d 6             t = 6 + A/v:   a 6+Δ     b 5+Δ     c 4+Δ     d 6+Δ                 . . . .   . . . .   . . . .   . . . .           t = 6 + 3000Δ/v:   a 6+3000Δ     b 5+3000Δ     c 4+3000Δ     d 6+3000Δ         t = 7:           b 6     c 5             t = 7 + Δ/v:       b 6+Δ     c 5+Δ             . . . .       . . . .   . . . .           t = 7 + 3000Δ/v:       b 6+3000Δ     c 5+3000Δ         t = 8:               c 6             t = 8 + Δ/v:           c 6+Δ             . . . .           . . . .           t = 8 + 3000Δ/v:           c 6+3000Δ                    
 
     [0070] The Fundamental Problem  
     [0071] As for Table 2, each column in Table 3 represents a contiguous strip of such data, where the different times represent “frames” of the data. It is apparent from both Tables 2 and 3 that data corresponding to contiguous segments of the object are not contiguous in time. Therefore, if the data are captured in the order they are generated, they must be reorganized to form an image. Put more generally, the data generated in object space of the imaging elements must be reordered to match the corresponding regions in image space determined by the spatial relationship of the imaging element. As can be seen by the examples provided, this problem is inherent in the geometry of the MMA. Reorganization can be done after storing all of the data representing the object until after scanning is complete; however, this method inherently lengthens the time between when the data are acquired and when the data may be displayed. As explained above, this is highly undesirable, especially in the context of the MMA.  
     [0072] A Secondary Problem  
     [0073] A secondary problem that is similar in nature to the afore-described fundamental problem arises due to the nature of the types of devices used for imaging. Referring to FIG. 5B, an exemplary one of the imaging elements  12   a  is shown along with a corresponding linear detector array  15   a . The detector  15   a  includes a number of pixel detecting elements p 1a , p 2a , p 3a , p za . Each pixel detecting element collects optical information at the resolution of the MMA. More particularly, all of the pixel detecting elements p za , . . . p zf  are preferably provided as a single two-dimensional array. To read image data from such an array as embodied in current technology, acquired image data is transferred row-by-row (or column-by-column) through a single row (or column). As other photo detector technologies may be developed making available different orders of data output, it should be understood that any such technology may be used in the present invention, so that the data output order may vary in any predetermined manner from what is described herein.  
     [0074] Turning to FIG. 6A, the imaging array  9  of FIG. 5A is shown with corresponding detectors  15 . Considering the detectors  15  to form a two-dimensional array, data is typically read out from the pixel detecting elements “p” in the following order: p 1a , p 1b , p 1c , p 2a , p 2b , p 2c , . . . p za , p zb , p zc , p 1d , p 1e , p 1f , p 2d , p 2e , p 2f , . . . p zd , p ze , p zf , for the example of row-by-row transfer in the two-dimensional array.  
     [0075] As can therefore be seen, due to the currently available technologies, the data from individual pixels within this detector array of an imaging element are read out of adjacent detector arrays in interlaced fashion. More specifically, in the preferred embodiment data from corresponding pixel detecting elements in one column are read out consecutively, and each such column of data is read out consecutively, so that the data from pixel detecting elements of different detector arrays are interlaced in a serial data stream.  
     [0076] Therefore, just as in the fundamental problem, where data taken from the respective imaging elements as a whole is streamed (see again Tables 2 and 3) so that data corresponding to contiguous segments of the object are not contiguous in time, the same type of problem exists as a result of the transmission of data from the detectors  15 . Particularly, for each segment, data is streamed from the detectors  15  so that data corresponding to pixels of the segment that are contiguous in time are not contiguous in space. Therefore, for this additional reason as well, if the data are streamed in the order they are received, they must be reorganized for viewing.  
     [0077] Microscope Array  
     [0078] As mentioned above, the examples provided pertain to an array microscope embodiment of the MMA  10 . However, a similar data-scrambling problem exists for a microscope array. Particularly, regardless of the order in which the image data is read from the imaging array during a single frame, there will in general be image data acquired by the imaging elements for one frame that must be interlaced with image data acquired by the same imaging elements in the next frame. Fundamentally, the data scrambling problem exists whenever an imaging array outputs image data in an order that differs from the order in which the data were acquired.  
     [0079] Memory Mapping Solution  
     [0080] To solve the aforementioned problems according to a first, memory mapping aspect of the invention, data are streamed from the imaging elements in the disorganized order in which they are acquired. While disorganized in the sense that the data are not necessarily in an order that facilitates viewing, the order of the data is predetermined by the manner the data are streamed, such as described above in connection with FIG. 6A. Any other predetermined order may be chosen.  
     [0081] Referring to FIGS.  6 A- 6 E, image data from the imaging array  9  shown in FIG. 5A is streamed from the array. The imaging array comprises imaging elements  12   a ,  12   b ,  12   c ,  12   d ,  12   e  and  12   f , along with their corresponding detectors  15   a ,  15   b ,  15   c ,  15   d ,  15   e  and  15   f  such as shown in FIG. 5B. The detector  15   a  includes corresponding pixel detecting elements (not shown) p 1a , p 2a , p 3a , p za , the detector  15   b  includes corresponding pixel detecting elements p 1b , p 2b , p 3b , . . . p zb , and so on, arrayed as shown in FIG. 5B.  
     [0082] The imaging elements image respective segments a k , b k , c k , d k , e k , and f k , of an object (or objects)  46   a  (FIG. 5A), where k represents frames corresponding to unit relative movements of the imaging array  9  with respect to the object. Relative movement between the imaging array  9  and the object is typically at a constant velocity; however, this is not essential to the invention.  
     [0083] The imaging array  9  is moved relative to the object  46   a  in the direction of the arrow “A” shown in FIG. 6C to obtain image data D output as shown in FIG. 6B. The image data D correspond to the imaging elements  12   a - f ; particularly Da k , Db k , Dc k , Dd k , De k , and Df k , which in turn correspond to the physical locations La k , Lb k , Lc k , Ld k , Le k , and Lf k , respectively, generally referred to herein as “L.” More particularly, each datum D for a given imaging element  12  includes individual pixel data points corresponding to each of the pixel detecting elements of the detector of the imaging element. Accordingly, the datum Da k includes individual pixel data points Dp 1ak , Dp 2ak , . . . , Dp zak , the datum Db k  includes individual pixel data points Dp 1bk , Dp 2bk , . . . , Dp zbk , and so on. Generally, data acquired at the same time do not correspond to physically adjacent locations on the object  46   a , because the corresponding imaging elements are disposed in different rows “n” of the imaging array.  
     [0084] Turning to FIG. 6B, the data may be output as a data stream  70 , in the order shown, or in any predetermined order. Generally, however, the order is sequential.  
     [0085]FIG. 6C indicates the physical locations L of the segments La k , Lb k , Lc k , Ld k , Le k , and Lf k  on the object  46   a . More particularly, each physical location L for a given segment includes individual physical points corresponding to each of the pixel detecting elements of the detector of the corresponding imaging element. Accordingly, the physical location La k  includes individual physical points Lp 1ak , Lp 2ak , . . . , Lp zak , the physical location Lb k  includes individual physical points Lp 1bk , Lp 2bk , . . . , Lp zbk , and so on.  
     [0086] Now turning to FIG. 6D, a random access memory  50  is provided for storing the image data D. The memory  50  is provided with corresponding memory locations M, particularly Ma k , Mb k , Mc k , Md k , Me k , and Mf k . More particularly, each memory location M for a given segment a, b, c, d, e and f includes individual memory locations corresponding to each of the individual pixel data points. Accordingly, the memory location Ma k  includes individual memory locations Mp 1ak , Mp 2ak , Mp zak , the memory location Mb k  includes individual memory locations Mp 1bk , Mp 2bk , . . . , Mp zbk , and so on. The memory  50  would in practice have a much larger memory capacity for storing data preferably providing a 0.5 micron resolution over a 20 mm×50 mm microscopy slide.  
     [0087] According to the memory mapping aspect of invention, the memory locations “M” of the memory  50 , particularly the individual memory locations thereof, are organized to correspond physically with the physical locations “L,” particularly the individual physical points thereof, meaning that data in “adjacent” memory locations correspond to adjacent fields of view of the object. For purposes herein, “adjacent” memory locations are locations in memory that may be addressed consecutively. Typically, the memory locations are physically adjacent one another in the memory as well, so that simply reading (or writing to) a row or a column from the memory automatically addresses the adjacent memory locations consecutively, however, the memory be otherwise organized so that memory locations may be physically separated from one another while retaining the ability to provide consecutively ordered outputs.  
     [0088] A signal processor  54 , such as a digital signal processor (“DSP”), field programmable gate array (“FPGA”), programmable logic array (“PLA”) or other suitable electronic device is programmed to anticipate the order in which data will be received, and to reorganize the data by storing the data associated with particular physical locations a k , b k , c k , d k , e k , and f k  on the object into the corresponding memory locations Ma k , Mb k , Mc k , Md k , Me k , Mf k . More particularly, the signal processor  54  preferably stores the data associated with individual points Lp 1a1 , Lp 1b1 , . . . , Lp 1f1 , Lp 2a1 , Lp 2b1 , . . . , Lp 2f1 , . . . Lp za1 , Lp zb1 , . . . Lp zf1 , respectively, in a first frame k=1 into the corresponding individual memory locations Mp 1a1 , Mp 1b1 , . . . , Mp 1f1 , Mp 2a1 , Mp 2b1 , . . . , Mp 2f1 , . . . Mp za1 , Mp zb1 , . . . Mp zf1 . Similarly, the signal processor  54  stores the data associated with individual points Lp 1a2 , Lp 1b2 , . . . , Lp 1f2 , Lp 2a2 , Lp 2b2 , . . . , Lp 2f2 , . . . Lp za2 , Lp zb2 , . . . Lp zf2 , respectively, in a second frame k=2 into the corresponding individual memory locations Mp 1a2 , Mp 1b2 , . . . , Mp 1f2 , Mp 2a2 , Mp 2b2 , . . . , Mp 2f2 , . . . Mp za2 , Mp zb2 , . . . Mp zf2 , and so on.  
     [0089]FIG. 6E shows the data stream  70  corresponding to this example mapped into a memory  50  by the signal processor  54 . While a complete memory mapping is indicated in this example, memory mapping according to the present invention may be carried out only partially to any desired extent.  
     [0090] Data in the memory  50  shown in FIG. 6D corresponds physically to the locations on the object  46   a  from whence the data came. Accordingly, if the data are output from the memory  50  in any order in which adjacent memory locations are read sequentially, the data may be displayed in the order received to produce a viewable image. For example, the data may be read row-by-row (or column-by-column), where, within each row, the data are read column-by-column (or row-by-row), producing a simple raster scan output that facilitates display. The memory  50  is electronically addressable to provide for fast storage and retrieval.  
     [0091] A more general example of data flow produced by the imaging array  9  is illustrated in FIG. 7B, that arises from an imaging array  9  producing a matrix of imaging data as shown in FIG. 7A. Where there were n=3 rows of m=2 imaging elements per row in FIG. 6A, all six of the imaging elements were needed to image just one row across the object  46   a.    
     [0092] Generally, the m·n matrix provides a sufficient number of rows “n” such that more than one row across the object may be imaged at one time, to provide the advantage of increasing scanning throughput. Again, the subscript “k” references the data corresponding to a particular frame. The individual pixel data points described above are omitted for clarity.  
     [0093] Referring to FIG. 7A, the imaging array  9  (FIG. 1) outputs “k” frames of imaging data “D nmk ” In turn, each imaging datum D nmk  includes individual pixel data points D p  that are interlaced with the individual pixel data points for the other imaging data as explained previously, all of which are omitted in FIG. 7A for clarity. However, FIG. 7B shows a data stream  71  that includes the individual pixel data points for each imaging datum, where Q=m·n=the total number of imaging elements  12 . The data are preferably streamed in the order shown in FIG. 7B; however, the data may be streamed in any predetermined order. Generally, however, the order is sequential.  
     [0094] Aligning Solution  
     [0095] To solve the aforementioned problems according to a second, aligning aspect of the invention, the data are reorganized by aligning the columns of data in time.  
     [0096] Solving the Fundamental Problem  
     [0097] To provide a simplified example of the concept, referring back to the simplified model given in Table 2 and assuming that the data corresponding to the imaging element  12   c  is taken immediately, the data corresponding to the imaging element  12   b  is delayed one unit of time (from t=1 to t=2), and the data corresponding to the imaging elements  12   a  and  12   d  is delayed two units of time (from t=1 to t=3) to align the data in all the columns. The result of this alignment is shown below:  
                               TABLE 4                          t = 1:                       t = 2:       t = 3:   a 1     b 1     c 1     d 1         t = 4:   a 2     b 2     c 2     d 2         t = 5:   a 3     b 3     c 3     d 3         t = 6:   a 4     b 4     c 4     d 4         t = 7:   a 5     b 5     c 5     d 5         t = 8:   a 6     b 6     c 6     d 6                    
 
     [0098] The column strips of data a, b, c, and d are now aligned with each other, so that all the image data corresponding to a single object row is made available at the same time. The alignment requires in this example storing two frames of image data corresponding to t=1 and t=2. For the data in Table 3, the alignment similarly requires storing 6000 frames of image data corresponding to t=1 through t=2+3000Δ/v. Although the particular delays obtained in Tables 2 and 3 are specific to the example given, it is recognized to be generally the case that object image data can be aligned as in Table 4 by delaying different column strips of data by appropriate amounts.  
     [0099] The number of frames that are stored for this alignment can be determined from the example given to be generally equal to the number of rows of the imaging array minus one. In general, if the size of the imaging elements is “n” times the size of their fields of view, the imaging array may have as few as “n” rows of imaging elements, so the number of frames stored for alignment may be as small as n−1. A much smaller memory space is therefore required according to the present invention than would be required to store all of the data corresponding to scanning the entire image. This makes it feasible to use more expensive, faster memory to save imaging time.  
     [0100] Data still must be streamed from the imaging array and organized for viewing. It may be noted, however, that the afore-described alignment also reorganized the data as well. According to a preferred embodiment of the invention then, the data may simply be read serially to preserve the order of adjacent column segments a, b, c, and d. For example, data from the frame t=3 in Table 4 may be read in the order a 1 , b 1 , c 1 , and d 1  (or the reverse), and data from the frame t=4 may follow in the order a 2 , b 2 , c 2 , and d 2  (or the reverse). This produces a simple raster scan output that facilitates display.  
     [0101] Solving the Secondary Problem—Generalized Imaging Array  
     [0102] As mentioned previously, the pixel data is streamed from a two-dimensional imaging array in a particular order. Image data for each frame “k” may be read from the array by a processor, such as a DSP, FPGA, or PLA, which may buffer the data in a memory  50  as shown in FIG. 8A. The data in FIG. 8A comprises the generalized data stream  72  of FIG. 7B, showing individual pixel data points for the multiple frames “k.” 
     [0103] Referring back to FIG. 6A, it may be noted that each pixel detecting element p for each imaging element  12  produces a contiguous strip of individual pixel data points as the object  46   a  is being scanned. For example, the pixel detecting element p 11  (the first element of the first detector), which corresponds to the pixel detecting element p 1a  in FIG. 6A, produces the data circled in FIG. 8A for each frame “k.” This tile of data is referred to herein as Dp 11  dropping the index for “k,” so that the tile corresponds to evolution of the output of the pixel detecting element p 11  over the entirety of “k” frames. FIG. 8B shows the tile Dp 1  presented as a data stream  73 .  
     [0104] Such strip is aligned precisely along the scanning direction as described above in the simplified example of Tables 1 and 3. With reference to FIG. 6A, the tile Dp 11  (from the first pixel detecting element of the first imaging element) corresponds to data from the pixel detecting element p 1a , the strips Dp 12  (from the first pixel detecting element of the second imaging element) corresponds to data from the pixel detecting element p 1b , the strips Dp 13  (from the first pixel detecting element of the third imaging element) corresponds to data from the pixel detecting element p 1c , and so on, until reaching the strips Dp 16 , which corresponds to data from the pixel detecting element p 1f .  
     [0105] The strip Dp 12  (Dp 1b  in FIG. 6A) is aligned with the strip Dp 11  (Dp la  in FIG. 6A), and the strip Dp 13  (Dp 1c  in FIG. 6A) is aligned with the strip Dp 11  and Dp 12  as described above. However, since there are only n=3 rows of imaging elements in FIG. 6A, the tile Dp 14  (Dp ld  in FIG. 6A) is already aligned with the tile Dp 11 , because it is on the same row. Similarly, the tile Dp 15  (Dp 1e  in FIG. 6A) is already aligned with the tile Dp 12 , and the tile Dp 16  (Dp 1f  in FIG. 6A) is already aligned with the tile Dp 13 . Accordingly, the “Q” columns in FIG. 8A are grouped, for alignment purposes, in “m” blocks of “n” columns. Generally, for data ordered as provided above, there are “m” blocks of “n” columns Q, wherein alignment is carried out within each block by delaying the column (Q+j) by “j” frames “k,” where j ranges from 1 to “n.” 
     [0106] Methods for aligning data provided in some other order may be determined using the same principles illustrated by the present example. The tiles may be aligned “on the fly,” or stored for subsequent alignment such as in the memory  50 .  
     [0107] The strips, or columnar strips of data, correspond to columnarly contiguous physical locations on the object being scanned. However, alternative strips of data according to the present invention may be taken from the memory  50  or obtained “on the fly” with or without storing the data in the memory  50 . The strips preferably tile the object  46   a , but adjacent strips may correspond to locations on the object  46   a  that are not contiguous without departing from the principles of the invention.  
     [0108] Turning to FIG. 9, alignment may be carried out alternatively by buffering the data of Table 2 and streaming the data multiple times as shown to a processor  55 , such as a DSP, FPGA, or PLA. The data a, b, c, and d of Table 2, corresponding to a selected row or line of the corresponding imaging elements  12   a ,  12   b ,  12   c  and  12   d , is selected by the processor  55  for further streaming to a display device.  
     [0109] In a similar manner to that described above for the memory mapping aspect of the invention, the reorganized data may in addition or in the alternative be stored in a memory  50  as it is produced so that data in adjacent memory locations in the memory correspond to adjacent fields of view of the object. Moreover, at least some of the advantages provided by the present invention may be obtained by providing a separate step of reorganization in combination with a partial or incomplete step of alignment.  
     [0110] Basic System Hardware  
     [0111] Turning to FIG. 10, a block diagram of system hardware  30  for transmitting image data from an MMA  31  according to the present invention is shown. The microscope  31  transmits image data via a high speed link  32  such as may be controlled by software marketed under the trademark CAMERALINK by Umax Data Systems, Inc. of Taiwan to a high speed processor  34 , such as a DSP or PLA. The processor processes the image data such as described above to reorganize the data in a form that facilitates viewing and stores the reorganized data in a high speed random access memory (“RAM”)  36  such as dynamic semiconductor memory. The RAM  36  may also be used by the processor to store frames for alignment, or this may be done in a separate cache memory onboard the processor. A host computer  38 , which may be a PC interacting with the processor through an interface such as a USB, may be provided as a display device. Alternatively, the processor may be used to drive a display device directly. While a digital signal processor coupled to high speed RAM is preferred for the purpose described, any signal processing circuit, device or system may be employed with any memory storage element or device without departing from the principles of the invention.  
     [0112] Alternative Basic System Hardware  
     [0113] Turning to FIG. 11, an alternative embodiment  33  to the system  30  described above employs a processor  34  that is internal to the host computer  38 . The processor in this embodiment communicates via an internal bus to the ALU of the computer, such as through a Peripheral Component Interconnect (PCI). The memory  36  is preferably also onboard the computer as shown, but it may be provided as a peripheral device if desired.  
     [0114] As mentioned above in connection with FIG. 1, each imaging element  12  includes a linear array of detectors. The data output from the detectors must typically be corrected for deviations in such performance parameters as gain and offset. The high speed processor  34  is able to provide, in addition to the capability to align the data as required or desired, the capability to perform such corrections as well.  
     [0115] Returning to the discussion regarding transmission of the data of Table 3, data corresponding to a number of frames may also be read out in parallel. For example, data from the frame t=3 in Table 2 may be read out as described above to one processor at the same time that data from the frame t=4 is read out to another, parallel processor.  
     [0116] Parallel Processing  
     [0117] Turning to FIG. 12 a block diagram of a parallel processing system  40  for transmitting image data from the MMA  31  according to this aspect of the present invention is shown. The processor  34  and RAM  36  elements of FIG. 12 are provided as a plurality of parallel portions. Particularly, the processor  34  comprises the parallel processor portions DSP 1 , DSP 2 , . . . DSP k , to receive and process, respectively row data 1, 2, . . . k transmitted from the microscope  31  in parallel. Similarly, the RAM  36  comprises the parallel memory portions RAM 1 , RAM 2 , . . . RAM k , to store the data reorganized by the respective processor portions. Image data transmitted from the microscope  31  may be distributed to the parallel processor portions according to any desired alternative parallel processing scheme.  
     [0118] Such parallel processing provides one strategy for dividing the computational workload associated with obtaining an image among greater amounts of hardware. Each processor portion may be less capable and therefore provide decreased cost as compared to a single processor, wherein the parallelism may compensate for this reduction in individual performance to provide no loss in speed. Alternatively, parallel processing with high performance processor portions may be employed to greatly increase speed.  
     [0119] Data Division and Compression  
     [0120] As mentioned above, the present invention may provide a separate step of reorganization in combination with a partial or incomplete step of alignment. For example, according to another aspect of the invention, alignment may be carried out in a local area of the entire image, rather than the entire image itself.  
     [0121] The data shown in Tables 2, 3 or 4 represent a two-dimensional array of data. The data-rate of the data streaming from the imaging elements may be reduced by grouping this data into two-dimensional tiles. Referring to FIG. 13, a data compressor  55 , such as a JPEG hardware compressor or algorithm, or any other data compression hardware or software presently available or available in the future, may be used to compress the tiles and transmit the tiles to a host computer as blocks of data. In a preferred embodiment of the invention, a pre-processor  54 , here an FPGA, buffers eight lines from each row of imaging elements  12  and once this amount of data is accumulated, groups the data in 8·8 tiles, the dimensions being typically determined by the compressor.  
     [0122] Preferably, a post-processor  56 , here a DSP, aligns the data within each tile according to the aforementioned alignment aspect of the invention or performs additional operations such as gain and offset correction for each pixel location on the detector. Subsequently, the tiles are input to the data compressor  55  for transmission to a host computer such as a PC. This provides an increase in the throughput of transmission of about a factor of ten.  
     [0123] In addition, the host computer need only align the tiles together, rather than the 64 data points within each tile, as a result of the processing provided by the processors  54  and  56 , resulting in a 64-fold reduction in the host computer&#39;s work load. Accordingly, a lower speed processor may be used to align the data within a tile and send the data to another lower speed processor used to stitch together the tiles and store the stitched tiles in an onboard memory  56 , so that no additional processing will be required to view the image upon retrieval of the image from the memory  56 .  
     [0124] Where the host computer is a PC, this is a sufficient reduction to permit the PC to complete the alignment “on the fly.” As with parallel processing, digital compression according to the present invention provides a strategy for dividing the computational overhead associated with obtaining an image among a number of processors. In this example, some of the workload has been distributed to the PC, which, otherwise, would not be fully utilized.  
     [0125] As another alternative, FIG. 14 shows a pre-processor  60 , here a PLA, which pre-organizes data received from the imaging array  9 , and transmits the pre-organized data to a post-processor  62 , which may be a DSP, which completes reorganization of the data for viewing. In this example, the DSP is coupled to a memory  64  and provides reorganized image data to a PC through a high-speed link  66 . The pre-processor may align the data to any desired partial extent while the post-processor continues to realign the data to any desired extent, storing the data in the memory and providing the data to the PC. The post-processor may fully complete the realignment, storing and providing an image that is ready for viewing to the PC, or the PC may be used as a further post-processing device.  
     [0126] Any of the aforementioned strategies may be used alone or in combination, to varying degrees, to optimally distribute the data processing required among the data processing circuits or systems available so that an image produced by the imaging elements may be transmitted therefrom in a form that is either ready for viewing without further processing, or that can be processed at a viewing station substantially as fast as the data is received, so that the image can be viewed in real time.  
     [0127] Data Correction and Compensation  
     [0128] In addition to the data reorganization required for viewing a stream of data output from an MMA, the MMA also preferably includes compensation for manufacturing variances in the optical axes of the imaging elements of the imaging array. In a preferred embodiment, a detector array that spans the entire width of the array of imaging elements is used, each imaging element along a row of the array of imaging elements employing a section of the detector array. Consequently, in contrast to prior art scanning systems, such as that disclosed by U.S. Pat. No. 5,144,448, there is no need to compensate for mechanical misalignment of discrete detector arrays associated with each imaging element. However, there is a need to compensate for the entirely different problem of misalignment of the optical axis of the imaging elements which can cause image offset at the detector array. Such compensation is preferably accomplished by providing an overlap in the image fields of view of the imaging elements responsible for imaging contiguous segments of the object or objects being imaged.  
     [0129] Along with correction for gain and offset and image geometry as mentioned above, the image data are preferably also processed to eliminate this overlap for viewing the image. Any known method may be employed for this purpose, such as calibrating the MMA for this overlap and determining the appropriate locations of detectors in the imaging elements to be assembled for viewing. For example, for correcting an overlap between the detectors of two row-adjacent (or column-adjacent) imaging elements, a starting pixel element of the detectors defining a starting point of the detector for pixel elements that are not overlapped may be determined for each of the detectors by calibration. The ending point of the detector for the non-overlapping pixel elements of each detector may be determined separately by calibration or as a predetermined number of pixels from the starting pixel. As a result of respective determinations to select, or de-select, certain pixel elements of the detectors, selection of the remaining, relevant data for ultimate viewing may be accomplished in various ways. For example, all the data may be transmitted to a host computer wherein only the selected data is processed or displayed, or the data to be disregarded may be eliminated prior to transmission, or data can be read out of the detector selectively.  
     [0130] While some specific embodiments of a method and apparatus for transmitting images from an MMA have been shown and described, other embodiments according with the principles of the invention may be used to the same or similar advantage. It should be understood in particular that the memory mapping aspect of the invention may be employed without employing the aligning aspect, and vice versa, and that either or both may be employed in conjunction with the additional aspects discussed above.  
     [0131] The terms and expressions which have been employed in the foregoing specification are used therein as terms of description and not of limitation, and there is no intention, in the use of such terms and expressions, to exclude equivalents of the features shown and described or portions thereof, it being recognized that the scope of the invention is defined and limited only by the claims that follow: