VIDEO IMAGING SYSTEM

Abstract: A dynamic image representation system comprising apparatus (10) for sensing a dynamic scene and apparatus for providing a pixel count reduced dynamic digital representation of the scene having pixel count reductions in portions of the scene not fulfilling predetermined spatial criteria and pixel count reductions in portions of the scene not undergoing change within predetermined temporal criteria.

Description: VIDEO IMAGING SYSTEM FIELD OF INVENTION The present invention relates to video imaging systems generally and more particularly to video imaging systems which are image content responsive. BACKGROUND OF THE INVENTION Various types of video imaging systems are presently known and various techniques have been proposed for enhancement of video images and reduction of the bit content thereof. Video imaging systems typically incorporate video cameras with image transmission, processing, storage, and display subsystems. These systems, some of which are described in Computer Vision, by Ballard and Brown, are designed to enhance images and to analyze them such that a computer, or other processing device, can perform other operations using information found in the image. The amount of data required to fully describe an image is quite large and various techniques to reduce the volume of data necessary, either for image transmission or for image storage or for both, have been developed in recent years. Chapter 5 of Digital Picture Processing, by A. Rosenfeld and A. Kak, discusses some of these techniques, such as transform compression techniques, which commonly achieve a 1:15 reduction in the amount of data necessary to fully describe an image. In order to display or process the compressed image, it must be expanded by an appropriate inverse operation; the exact inverse operation depends on the method of compression. Most such techniques are designed to be "lossless" in the sense that the expanded image is equal, or almost equal, to the original image before compression. Other common techniques to enhance image transmission are decomposition techniques where the original image is decomposed into a hierarchy of images, known as "pyramidal" techniques. U.S. Patent 4, 6j-\,125 to Carlson et al discloses an enhancement technique based on convolving and decimating an original high resolution image into a hierarchy of component images in which each component image comprises one octave of the spatial frequencies found in the original image and is of a higher resolution than the previous component. Another pyramidal technique decimates an original image, producing a series of images with decreasing levels of resolution, where each image has half as many pixels along each row and half as many rows as the previous image. The technique then arranges the decimated images in order of increasing resolution, producing a description of the image useful for transmission. The lowest resolution decimated image is transmitted first followed by the higher resolution images. At the receiving end, the image is reconstructed in stages where initially the lowest resolution image is displayed and subsequently, as pixels from the higher resolution images arrive, they are integrated into the image. Such a pyramidal scheme is known as a Progressive Resolution scheme and it has also been applied to storage and retrieval systems. Bit reduction in the transmission of moving images, such as in live video applications , is achieved by only transmitting the changes which occur from frame to frame. To do so, a first image is transmitted. Subsequently, successive frames are compared and any differences are extracted and transmitted. The receiving end maintains image storage and the received differences are added to the storage to produce an updated image. U.S. Patent 4,716,462 to Wargo et al discloses a motion detector used to control video signal processing and functionality which operates as described hereinabove. An additional motion detector, produced as an integrated circuit, is disclosed in a publication entitled "A Correlating Optical Motion Detector" by John E. Tanner and Carver Mead of California Institue of Technology, Pasadena, CA, published in the proceedings of the MIT Conference on Advanced Research in VLSI, 1984, pp. * 57-64. The detector derives the spatio-temporal derivative of the image at the very focal plane of the image sensor and produces an image consisting of the temporal differences only. The prior art discloses many methods and systems for reducing the bit content of images and series of images; however, none of the methods incorporates the fact that not every portion of an image contains information useful to the system user. By selecting only the high information content portion of an image, or series of images, the amount of data necessary to describe an image such that a user can recognize it is significantly reduced. Such a method, alone or in conjunction with the reduction methods disclosed in the prior art, has many advantages over the prior art and is the object of the present invention. SUMMARY OF THE INVENTION The present invention seeks to provide a novel image content responsive system for image acquisition, processing, storage and retrieval, transmission and display. There is thus provided in accordance with a preferred embodiment of the present invention a dynamic image representation system comprising apparatus for sensing a dynamic scene and apparatus for providing a pixel count reduced dynamic digital representation of the scene having pixel count reductions in portions of the scene not fulfilling predetermined spatial criteria and pixel count reductions in portions of the scene not undergoing change within predetermined temporal criteria. There is additionally provided in accordance with a preferred embodiment of the invention an image transmission system including apparatus for acquiring an image including apparatus for providing a digital image representation having a reduced information bit content, apparatus for transmitting the reduced information bit content digital image representation over a communications link, apparatus for receiving the reduced information bit content digital image representation over the communications link and apparatus for interpolating the received reduced information bit content digital image representation to provide a visible digital image representation. In accordance with a preferred embodiment of the invention, the reduced bit content digital image representation comprises an initial low bit content digital image representation and a plurality of subsequent low bit content additions to the initial representation for enhancing the image quality thereof. Further in accordance with the preceding embodiment, the apparatus for interpolating is operative to provide an initial display based on the initial digital image representation and subsequently to modify the initial display based on the plurality of additions. In accordance with one embodiment of the invention, the apparatus for interpolating is operative for enhancing the resolution of the display in accordance with the plurality of additions. In accordance with a preferred embodiment of the invention, the apparatus for acquiring includes apparatus for identifying temporal variations in the image and the apparatus for transmitting is operative to transmit an initial digital image representation and thereafter information representing temporal variations in the scene. In accordance with one embodiment of the invention, the apparatus for acquiring includes a raster scanning camera, a frame buffer and an encoder. Preferably the raster scanning camera acquires full resolution images. In accordance with the above embodiment, preferably the encoder reduces the full resolution images to a hierarchy of lower resolution images wherein the lowest resolution image is retained in its entirety and the remaining higher resolution images contain areas of the image containing high information content. According to an alternative embodiment of the invention, the apparatus for acquiring includes a camera for acquiring reduced information bit content images and a camera controller to direct the acquisition of the reduced information bit content images. In the foregoing embodiment, preferably the camera controller initially directs the camera for acquiring reduced infor-mation bit content images to acquire a low resolution image. Preferably in accordance with the foregoing embodiment, the camera controller analyzes the low resolution image for high information content areas and directs the camera for acquiring reduced information bit content images to acquire the high information areas at a higher resolution. The present invention seeks to provide a complete image content responsive system, comprising image acquisition, processing, storage and retrieval, transmission and display elements, that transmits or store a reduced image representation which, nevertheless, retains the high information content level areas of the original image and thus, enables quick recognition of the features of the original image once the reduced image representation is expanded upon display. The reduced image representation preferably is formed according to the following steps: 1) a hierarchy of different resolution images is created; 2) at each level of resolution, features of the image which are potentially 'interesting' are identified, where 'interesting* is defined by the system user; and 3) the resulting 'interesting' features at higher resolutions, as well as the lowest resolution image, are combined together, typically from the lowest resolution to the highest resolution. The result is a pixel count reduced non-spatially consecutive representation for transmission, processing and storage, herein referred to as the pixel count reduced representation, containing only the most 'interesting' information. As such, the pixel count reduced representation is lossy, although the information lost is relatively insignificant to the understanding of the image. The pixel count reduced representation is advantageous for image storage, for image processing and for image data transmission. BRIEF DESCRIPTION OF DRAWINGS The present invention will be understood and appreciated more fully from the following detailed description, taken in conjunction with the drawings in which; Fig. 1 is a block diagram illustration of an image content responsive image acquisition, processing, transmission, storage/retrieval and display system constructed and operative in accordance with a preferred embodiment of the present •invention; Fig. 2 is a block diagram illustration of an image acquisition unit useful in the system of Fig. 1; Fig. 3 is a block diagram illustration of the structure and operation of an image encoder for producing pixel count reduced dynamic digital representations of images useful in the image acquisition unit of Fig. 2; Fig. 4 is a block diagram illustration of an alternative embodiment of an image acquisition unit useful in the system of Fig. 1; Figs. 5A, 5B, 5C and 5D are block diagram illustrations of alternative embodiments of an image acquisition unit for extracting temporal variations useful in the system of Fig. 1; Figs. 6A and 6B are electronic circuit diagrams of image reconstructors useful in the system of Fig. 1; Figs. 7 and 7B are electronic circuit diagrams of elements of the encoder of .Fig. 3; Fig. 8A is an electronic circuit diagram of a combiner for creating the pixel count reduced representation useful in the image acquisition unit of Fig. 3; Fig. 8B is a state diagram of a controller for the combiner of Fig. 8A; Fig. 9 is a state diagram of the logic of a coordinate generator useful in the image acquisition unit of Fig. 4; Fig. 9B is an electronic circuit diagram for implementing a logic pattern similar to that of Fig. 9 ; Fig. 1Q is a block diagram of an alternate embodiment of the coordinate generator of Fig. 4; Figs. 11A and 11B are electronic circuit diagram of alternate embodiments of image reconstructors for images with temporal variations useful in the system of Fig. 1; and Figs. 12A through 12L are illustrations of an image as it passes through the system of Fig. 1. DETAILED DESCRIPTION OF PREFERRED EMBODIMENT Reference is now made to Fig. 1, a block diagram illustration of a preferred embodiment of the system. The system comprises an image content responsive image acquisition unit 10 which acquires a dynamic image in such a manner as to produce an image content responsive pixel count reduced digital representation of the image, a signal transmitter 14, such as a modem, which transmits the pixel count reduced image representation as a series of pixels, an optional processing unit 1 for performing image processing on the pixel count reduced image representation, a vision computer for computer vision applications, and a communications link 17, typically a limited-bandwidth communication medium. The system also comprises a signal receiver 18, such as a modem, to receive the signal transmitted by transmitter 14 over communications link 17, an image storage and retrieval system 19, such as a personal computer, and an image reconstructor 20 which interpolates the pixel count reduced image representation and transforms it into an approximation of the original image. An optional additional processing unit 21 may be included for performing additional processing on the received pixel count reduced image representation. A display unit 22 , typically a conventional raster-scan display device, such as a CRT display, may be provided for displaying the reconstructed image. It will be appreciated that the system of Fig. 1 can operate in a number of ways. For example, image acquisition unit 10 can additionally extract temporal variations by identifying the locations in a series of images where changes have occurred and producing from them a pixel count reduced representation of the series of images as a series of changes. This option may operate if a particular application requires time-varying information, such as in videotelephone or teleconferencing. The processing units 15 and 21 may operate if the image requires some form of enhancement, either before or after transmission or storage/retrieval, or if for a particular computer vision application, the vision computer 16 requires preprocessing of the image where one example of preprocessing is feature extraction. The pixel count reduced representation may be transmitted via the transmission elements 14, 17, and 18, or it may be stored and retrieved via unit 19• According to a preferred embodiment of the present invention, shown in Fig. 2, image content responsive image acquisition unit 10 comprises a raster scan imager 24, such as a CCD camera, such as the WV-CD22 from Panasonic, an A/D converter 26, a frame buffer 28 , such as a matrix of static or dynamic RAM chips, and an encoder 3Q- T e raster scan imager 24 and the A/D converter 26 together produce a digital raster scan image, although other image generation systems, such as synthetic or "computer graphics" images, or a previously processed, acquired or stored image, can be used. Frame buffer 28 stores the full resolution digital image thus produced. Image encoder 30 encodes images into the pixel count reduced representation according to a set of operations described hereinbelow. Reference is now made to Fig. 3 which describes the structure and operation of a preferred embodiment of the encoder 30. An order N image I, that is, an (N x N) image, is optionally filtered to reduce aliasing through an order N low-pass filter 32, such as a linear convolver whose convolution kernel is typically a 3*3 matrix whose every element contains 1/9- Such a •convolution kernel produces a new image where the value of each pixel in the new image is the average of the values, in the previous image, of its 8 neighbors and itself. Such a convolver may comprise an off-the-shelf, special purpose VLSI chip, such as Zoran ZR33481 or ZR33881 Digital Filter Chips and some additional components, for example, delay lines and delay buffers, such as described in Zoran Technical Note No. Z.T.N. 03 entitled "Real Time Spatial Filtering with a Zoran DFP", ' the teaching of which is incorporated herein by reference. Subsequently, the image is decimated, in a decimator 3-h , where decimation of an order N image I produces an order N/2 image I< j _ by selecting every other pixel from every other row. Decimator 34, shown in Fig. 7A, typically comprises a digital gate 35 to select a pixel, a latch 37 to enable a pixel intensity to be included in the decimated image, if and only if the gate 35 is open, and control circuitry, such as flip-flops, to repeatedly open and close the gate 35- The process of optional low-pass filtering and decimation, described above, is repeated a predetermined number of times, typically 2 times as shown in Fig. 3. using low-pass filters 36 and 40 and decimators 38 and 42. It will be appreciated that the operation of the three low-pass filters 32, 36 and 40 is equivalent; only the order of the operator and its physical position changes. The same holds true for decimators 34, 38, and 42. The result of the low-pass filtering and decimation is a predetermined number of decimated images where each decimated image 1^ is of a lower resolution than the previous one and where k indicates the number of decimations performed to produce 1^. It will be appreciated that the lower the resolution of the image, the higher its decimation level is. Once the predetermined number of decimations have been performed, the encoder 30 reaches a detection stage where an image processing operator, such as an edge detector 46, typically comprising a convolver similar to the convolver of the low-pass filters 32, 36 and 40, operates on the lowest resolution image, la in this example. Any operator which can be implemented and which detects some desired feature in an image can be applied in place of, or in addition to, the edge detector 46. Possible choices for operators may include point processors, such as lookup tables for the detection of certain intensity levels, neighborhood processors, such as convolvers for operations such as edge detection, morphological operators, histogram processors, such as the L64250 from LSI Logic, or various transforms, such as the Hough transform for the detection αxf straight lines, such as the L64250 from LSI Logic. Operators to detect other desired features, such as texture, color, or motion can also be implemented, as well as more complex operations comprising multiple operation steps. The detection stage ends with a thresholder 48, typically built from one comparator, which typically -transforms the processed image into a binary image. It will be appreciated that more than one comparators can comprise thresholder 48. The binary image ED, thus produced, is of the same order as decimated image l . For the example of an encoder 30 with edge detectors 32, 36 and 40, the pixels of E contain values of r l' if the corresponding pixels in l belongs to edges and the remaining pixels of Eo contain values of '0'. Eo is expanded, by a factor-2 expander , to produce binary image Vo of order twice the order of Eo. Factor-2 expander 50 reproduces each pixel value e χ y of E four times, copying it to pixels 2x,2y, 2x+l,2y, 2x,2y+l, and 2x+l,2y+l of Vo , thus performing approximately the reverse operation of decimator 42. It will be appreciated that the pixel in the upper left corner of the image is typically defined as pixel 0,0. A simple factor-2 expander 0 is shown in Fig. 7B and comprises a selector 51, such as the 74LS157 from Texas Instruments, a storage unit 53, such as a FIFO buffer, a row counter 55, and a frequency multiplier 57, which typically increases the clock time to 2 times as fast. According to a preferred embodiment, the factor-2 expander 50 operates as follows. A row of pixel intensities is received by the selector 51 as well as being stored, in the order it is received, into storage unit 53- Selector 51 also accepts input from the storage unit 53, but only upon receiving a signal to do so from the row counter 55- pixel clock signal, indicating the coordinate positions of the row of pixel intensities in E , is also received, by the frequency multiplier 57, which produces two clock pulses, or coordinate positions, for every pixel which is received by the selector 51. Thus, each pixel in a row is produced twice. Upon finishing a row of pixel intensities, as typically indicated by a line sync indication on the pixel clock signal, the row counter 55 increases its count by one and the selector 51 selects the input from the storage unit 53* The process repeats again. For every pixel received by selector 51, the frequency multiplier 57 produces two clock pulses, thus reproducing a second row of pixels identical to the first row. Each pixel is thus reproduced 4 times. A dilator 52, such as SNAP from DataCube Inc of Peabody Massachusetts USA, dilates V , producing Wo, of the same order as Vo. For each continuous segment of pixels with values ' 1' , dilator changes the values of the pixels in a ring around the segment to ' 1 ' , thus increasing the size of each segment by one pixel in each direction. Wider dilations are also possible. A masker 54, masks 12 by Wo to produce masked image M2 , an image of the same order as l . The masker 44 comprises a digital many-bit two-to-one selector, such as the 74LS157 from Texas Instruments, which, according to a binary control signal, produces either one input or the other at the output. According to a preferred embodiment of the invention, the two input signals are ∑2 and a constant null value, and the binary control signal is Wo. Thus, pixel x,y will contain the value I χ y of 12 if and only if v v .. of Wo, as the control signal, is '!' . Otherwise, pixel x,y contains a null value, which is not necessarily '0' . Operators 56-62, similar to edge detector 46 * thresholder 48, factor-2 expander 50, and dilator 2, but of higher orders, operate on M2 to produce W2. A masker 64, similar to masker 4, but of higher order, masks 1^ by 2, yielding masked image M j _. The process is repeated as many times as is necessary, typically one more time with operators 66-74, to produce MQ, the masked version of the original image I. Acco_εding to a preferred embodiment of the invention, a combiner 76 receives the lowest resolution image, l , and the non-null values of the masked images, M2 through MQ, and produces a single stream of pixels, the pixel count reduced representation, which is preceded by a header code to indicate the beginning of an image representation. In the pixel count reduced representation, each pixel is defined as a triplet consisting of the value of the pixel identified, or tagged, by its coordinates in the original image. An alternative embodiment of the invention produces a higher order tuple which comprises, in addition to the elements of the triplet described hereinabove, additional information about the pixel, such as the decimation level k. According to a preferred embodiment of the invention shown in Figs. 8A and 8B, the combiner 76 typically comprises k + 1, FIFO buffers 78, 80, 82 and 84 of various sizes, where in the current example, k is equal to 3 and where each FIFO buffer has associated therewith a pair of x and y counters 85 and 86, 87 and 88, 89 and 90 or 91 and 92. In addition, combiner 76 typically comprises a controller 93, whose state-diagram is described hereinbelow, and a selector 94, such as the 74LS157 from Texas Instruments. Decimated image lo is stored in FIFO buffer 78 in raster-scan order due to the fact that it is a full matrix. At a signal from the controller 93, the counters 85 and 86 are reset to 0 and FIFO buffer 78 begins releasing intensities of lo. At the same time, the controller 93 signals the selector 94 to begin accepting the triplets (x,y,Io). At each clock time, the counters are stepped forward, together with the intensities of lo, such that for each successive pixel in the same row, the x counter 85 is increased by 8 and every time a new row begins, as is predetermined in hardware, the y counter 86 is increased by 8. It will be appreciated that the counters are counting modulo 8 since decimated image lo is the result of three successive decimations (ie 8 times smaller) and since the coordinate position of the x,y pixel of lo in a full resolution image is 8x,8y. The selector 4 receives, at each time step, an x coordinate value from counter 85, a y coordinate value from counter 86, and an intensity from FIFO buffer 78, and it produces the triplet in the order, x value, y value, intensity. When the y counter 86 reaches its maximum value, it sends a signal to the controller 93, indicating the end of the lo values. The controller then sends two signals, one to the selector 94 indicating that data from the l lines should no longer be accepted and that data from the M2 lines should be, and one to reset the counters 87 and 88. The counters 87 and 88 operate and are . . connected similarly to counters 85 and 86; however, they count modulo 4. The values of the counters 87 and 88 are increased as each element of M2 arrives. If the pixel received is not null valued, as checked by comparator 95, the values of the counters and the current intensity value are stored in FIFO buffer 80. Otherwise, nothing is stored and the succeeding element of M2 is received. When FIFO buffer 80 receives a read signal from the controller 93, it sends to selector 94 the triplets stored in it, in the order they were entered. FIFO buffer 80 indicates to controller 93 its current status and, upon an indication of being empty, controller 93 switches selector 94 to accepting data from the M^ lines. Combiner 76 processes M^ in a manner similar to its processing of M2; following the processing of M^, it processes MQ, and following MQ it produces a header code and then returns to the beginning and processes lo. Fig. 8B shows a five-state state diagram for controller 93- At reset or power-up, the controller is at state 5. Once lo arrives, as indicated by a standard video control signal such as the horizontal and vertical sync and the pixel clock, the controller 93 switches to state 1 where it generates the control signals to indicate to selector 94 to select lo and its X and Y coordinates. Once lo is complete, as typically signaled by the carry signal of the Y counter, the controller switches to state 2 where it issues a series of clocked READ signals to the FIFO buffer 80 and control signals to the selector 94 to select M2 and its X and Y coordinates. When the M2 memory is emptied, an EMPTY signal is received by the controller, causing it to switch to state 3• In state 3 M i produced and in state 4 M is produced, in a manner similar to the description for M 2 • When the controller reaches state 5. a reduced-frame completion signal is generated and the controller waits for the new frame to start and for lo to arrive. Thus, the pixel count reduced representation is produced. It will be appreciated that, should higher order tuples be required, the controller 93 will produce the desired information and send it to the selector 94 to be included in the tuple. For example, should the decimation level be required, the controller 93 will calculate it based upon the image being received by the selector 4. This is indicated in Fig. 8A by a dashed line from the controller 93 to the selector 94. It will be appreciated that combiner 76 can produce a pixel count reduced representation comprising a stream of windows, rather than a stream of pixels. The window-based pixel count reduced representation, similarly to the pixel-based representation, begins with a header code to indicate the start of a pixel count reduced description. The first window typically comprises the complete lo which contains no null values and which serves as the lowest resolution background for I r . Each additional window comprises a complete rectangular area, ■ within any of the masked images, M2 through M Q , which contains no null valued pixels. A one pixel rectangular area is acceptable and series of them are used to define a one-pixel wide diagonal line. The coordinate tagging of each individual pixel is replaced by a single tag for the entire window comprising a set of coordinates of the upper-left corner, x u ι,y u ι» length, 1, and an height, h, of the window, and a decimation level k denoting the masked ' image, M^, from which the window was taken. Following the window tag is a stream of the values of the pixels in the window organized in row-major form, that is, the first 1 values belong to the first row, the second 1 values belong to the second row, etc, for h rows. The pixel count reduced representation thus produced comprises differing levels of resolution, with the areas containing the most 'interesting' information described at high resolution and the less 'interesting' areas described at lower levels of resolution, where 'interesting' is defined by the system user. The hierarchy of levels of resolution is known as a pyramidal resolutions scheme and it will be appreciated that alternate pyramidal schemes can replace the one described hereinabove. An alternate embodiment of the image content responsive image acquisition unit 10, shown in Figure 4, comprises a real¬ time image content responsive camera controller 100 controlling an image content responsive camera 102 comprising an Intelligent Scan image sensor 103. The combination of camera 102 and image sensor 103 is disclosed in European patent application 88HI33O.2, the teaching of which is incorporated by reference, and is commonly owned by the owners of the present application. The actively controlled image acquisition unit 10 identifies 'interesting' features in an image, typically first acquired at the lowest resolution possible, and utilizes the results to direct the Intelligent Scan image sensor 103 to acquire the interesting areas of the image which require the next higher resolution. The process is repeated until the highest resolution is reached, at which point a new image, at the lowest resolution, is acquired. The pixel count reduced representation is typically built in a manner similar to that of encoder 30. This embodiment of unit 10 differs from that of the previous embodiment, discussed hereinabove and illustrated in Figs. 2 and 3, in three fundamental ways: 1) the acquisition system creates the pixel count reduced representation in the process of acquiring the image, whereas the previous embodiment first acquires the entire image and only afterwards encodes it into the pixel count reduced representation; 2) the acquisition begins with the lowest resolution image and adds to it sections of the image of increasingly higher resolution, thus, never needing to acquire the entire image as does the previous embodiment; and 3) the acquisition system operates at a higher frame rate since it does not need to acquire the entire image. In addition, according to a preferred embodiment of the invention, the low resolution image is acquired in a manner different from that of the encoder, as described hereinbelow. The camera 102 receives from controller 100 the coordinates at which an intensity value is desired. A decimation level k is also typically included with the coordinate value, to ensure consistency within the system, although camera 102 does not require it. The camera 102 acquires the intensity value at the requested coordinates I„ ,. and returns it, along with its coordinates x,y and the present decimation level k, to controller 100. The tagged pixel is part of the pixel count reduced image representation, and as such, is also the output of the acquisition system. Controller 100 typically comprises a pixel count reduced edge detector 104, such as a convolver for the pixel count reduced format as described in Israel Patent Application 87310, filed August 2, 1988, the teaching of which is incorporated herein by reference, a series of comparators 106 to convert the results of edge detector 104 into a binary format, a pixel count reduced dilator 108, such as described in Israel patent application 87310, a 1-selector 110 to select only those pixels with a non-null value, a coordinate generator 112 to generate the coordinates to be sent to the camera 102, and a FIFO memory 116, such as the IDT7201A from Integrated Device Technology of Santa Clara, California, to store the coordinates generated by the coordinate generator 112 and to send them, one at a time, to the camera 102. The image processing operator, the edge detector 104 in this embodiment, detects desired features in the image. To do so, it stores the incoming tagged pixels until the entirety of pixels necessary to perform the indicated operation, as taught in Israel Patent Application 87310. The tagged pixel for whom the operation is performed is sent to the comparators 106 which then compare the pixel intensity to a threshold, or series of thresholds . If the pixel intensity is above the threshold for a single comparator, or within a range defined by two thresholds, the comparators 106 produce a ' 1' value. Otherwise, they produce a '0' value. Thus, the comparators 106 convert the pixel intensity to a binary value. It will be appreciated that, as in the previous embodiment, the image processing operators chosen depend on the definition of a desired feature and are as detailed for encoder 30. The result of the image processing operations followed by the dilator 108 are binary tagged pixels indicating the coordinates of the chosen feature. As mentioned hereinabove, 1-selector 110 eliminates null-valued pixels and only sends to coordinate generator 112 1- valued pixels. For each pixel reaching the coordinate generator 112, four pixel coordinates, to be acquired at the next highest resolution (i.e. the next lowest decimation level), are generated. The coordinate generator 112, typically comprising a Programmable Array Logic (PAL) chip 113, operates according to the state diagram of Fig. 9A. The coordinate generator 112, before any pixel intensities have been acquired, begins in state 6 and generates and sends to the output a complete set of triplets for the low resolution image, typically with a decimation level k equal to 3 and with coordinate values in increments of 8, covering the entire field of view of the image sensor 103. The coordinate generator 112 proceeds to state 7 and generates and sends to the output a dummy triplet, (T,T,3), known as a trailer, whose purpose is to mark the end of a decimation level. The generator 112 proceeds to state 1 and waits for triplets to arrive from the 1-selector. When a triplet (x,y,k) arrives with k greater than 0, the coordinate generator steps through states 2=5, generating four triplets whose pixel coordinates are (x+p,y+q) where both p and q take on the values of 0 and 2 lc-1. The decimation level k for each triplet is decreased by 1, denoting the next highest resolution. The trailer arrives after all the triplets at a given level have been processed and is not processed in the manner of the other triplets. If the decimation level k is greater than 0, the trailer is sent to the output with its final component, that of the decimation level, reduced by 1. If, however, the decimation level k of the trailer is 0, marking the end of the triplets to be acquired at the highest resolution or, in other words, indicating that all the necessary information in image has been acquired, the coordinate generator 112 returns to state 6 and begins the process of acquiring the succeeding image by generating a set of triplets for the low resolution image. An electronic circuit which embodies the state diagram of Fig. 9A is shown in Fig. 9B. It comprises a programmable controller 115, such as a PAL chip, whose program listing is given in Annex AA, three selectors 117, 119, and 121, two adders 123 and 125, a subtracter 127. and three comparators 129, 131 and 133. The circuit of Fig. 9B operates as follows. A triplet (x,y,k) arrives and each element is compared, by the comparators 129, 131 and 133, to the expected values of the trailer triplet (T,T,0). The resulting values, XET, YET and DGZ, respectively, are sent to the programmable controller 115 which checks whether or not the trailer has arrived. If the trailer has arrived and its decimation level k is not 0 (ie DGZ > 0) then the programmable controller 115 remains in state 1 but instructs the selector 117, 119 and 121 to output the trailer (T,T,k-l). If the trailer has arrived and its decimation level k is zero, the programmable controller 115 proceeds to state 6 and enables an X counter 135 and a Y counter 137 for N/8 steps each, where N is the order of the original image. In addition, the programmable controller 115 instructs the selectors 117, 119 and 121 to output the values of the X and Y counters 135 and 137 as well as the value 3, producing the triplet (x,y,3) . Subsequently, the programmable controller 115 proceeds to state 7 where the selectors 117, 119 and 121 are instructed to output the trailer (T,T,3). The programmable controller 115 then proceeds to state 1. If, in state 1, a non-trailer tuple arrives with k greater than 0, the programmable controller 115 steps through states 2-5, instructing the selectors 117, 119 and 121 to output the triplets (x+p,y+q,k-l) as described hereinabove, and returns to state " 1. An alternative embodiment * of the coordinate generator 112, shown in Fig. 10, enables external control over the generation of the , pixel count reduced representation. The present embodiment of the coordinate generator 112 typically comprises a frame buffer 118 and a comparator 120, in addition to the PAL chip 113 of the previous embodiment. Frame buffer 118 stores in each x,y position a number L Λ „,„_y specifying the minimum level of decimation (indicating the maximum resolution) which is allowed for the pixel residing at the respective coordinate position. Frame buffer 118 accepts external input from an external processor, such as a personal computer, defining the elements Lχ ,y It will be appreciated that the external updating occurs only after the first low resolution image has been acquired. Thus, the present embodiment begins at state 6 and generates the low resolution matrix of coordinates, moves to state 7 and generates the trailer, and only thereafter allows the 2.7. external processor to affect its operation. According to the alternate embodiment, the coordinate generator 112 operates as follows. For each incoming triplet (x,y,k), L v ., is retrieved and is compared by means of comparator Λ » J 120 with the decimation level k of the triplet. If L„ ,. is less than or equal to k, then the triplet is accepted and is sent to the PAL chip 113 where it is operated upon as described hereinabove. Otherwise, the triplet is discarded. Regardless of the embodiment of the coordinate generator 112, the four triplets produced by the coordinate generator 112 are sent to a FIFO buffer 116 to be stored there until the previously stored coordinates, produced from previous inputs to the coordinate generator 112, are released. Consequently, the four triplets are received by the camera 102, one at a time, and are used to define the next coordinates of the image to be acquired. An additional embodiment of the image acquisition unit 10 acquires a set of images of a moving scene and extracts the temporal variations for efficient storage and transmission. The embodiments described hereinabove are modified slightly to incorporate motion detection as follows and as shown in Figs. 5A- 5D. One embodiment of the temporal variations extraction method of image acquisition unit 10 is shown in Fig. 5A and comprises a raster-scan method camera, referenced 150, a read-modify-write frame buffer 1 which initially contains all null values, a subtracter 1 4, and an image encoder 156. Raster- scan camera 150 produces a full resolution current image l t , where t denotes the present time, and the frame buffer 152 stores the previous full resolution image, I^...^. During the read subcycle of the memory cycle, the value of ^ -1 at ^ e latest location x,y, according to the raster-scan format, is read out of the frame buffer 154 and subtracted from the value of the latest element in the raster- scan of I fc . It will be appreciated that the two values share the same coordinate location x,y. During the write subcycle, the value of the element of I t is written into the x,y location of frame buffer 154. The differences Dt are sent to encoder 156 which is similar to encoder 30 but without edge detectors 46, 56 and 66. In place of the edge .detection, encoder 156 typically has a single comparator, typically based on absolute intensity levels, to determine when the difference level is large enough to indicate the location of 'interesting' changes in the image. An alternate embodiment of the temporal variations extraction method of image acquisition unit 10 which encodes only the largest differences is shown in Fig. 5B. This embodiment of unit 10 comprises the raster-scan camera 150, the subtracter 154 and the encoder 156, as in the previous embodiment, as well as two frame buffers 158 and 160 which initially contain null values. As per the previous embodiment, the current image I t is simultaneously subtracted from the image stored in frame buffer l60 while being stored into frame buffer 158. As per the previous embodiment, the full resolution image of differences is encoded by encoder 156 as described hereinabove; however, according to the present embodiment, the combiner of the encoder produces the images in the reverse order, that is, it produces the pixel count reduced representation with the highest resolution masked image, typically MQ, first, followed by the lower resolution masked images and with the lowest resolution image lo last. To do this, the controller 93 logic mus be changed as follows. The controller must wait until all of the masked images have been produced and then it must select them and the low resolution image lo in the order described hereinabove. Thus, in the situation of the transmission of the pixel count reduced representation, the largest differences are transmitted first. According to the present embodiment, as each triplet is transmitted, its coordinates are sent to the frame buffers 158 and l6θ and the corresponding pixel from frame buffer 158 is copied into frame buffer 160. A transmission medium is typically fairly slow and it is to be expected that within one frame time, typically 30 milliseconds, the entire pixel count reduced representation will not be transmitted; however, this embodiment ensures that, at least, the largest differences are transmitted. Upon finishing the scan of image I t , a signal is sent from the camera 150 to the encoder 156 and, as soon as data from the new image arrives at the encoder 156, it stops producing the pixel count reduced representation. Thus, the subtraction is now between the new image I t+ ι and whatever is stored in frame buffer l6θ, typically most of the previous image I t but containing information from earlier images also. In each image location x,y where a difference existed but was not transmitted, the old value is retained in frame buffer 160, as mentioned hereinabove. If movements continue in the image, then the difference between the old value at x,y and the current value will increase such that, eventually, the difference is large enough to be positioned early enough in the pixel count reduced representation to be transmitted. A third embodiment of the temporal variations extraction method of image acquisition unit 10 is shown in Fig. 5C. This embodiment typically comprises the same elements and the same initial values as per the previous embodiment; however, the output is a stream of the latest intensity values of the pixels at which movement occurred, rather than the differences at those pixels. To create such an output, as per the previous embodiment, the current image I t is subtracted from the image stored in frame buffer 160 and the difference is sent to an encoder 162. Encoder 162 operates on the image of differences as per the second embodiment with the exception that it produces only the coordinate positions of the pixel count reduced representation. As per the previous embodiment, the coordinates produced are sent as control signals to the frame buffers 158 and 160 and the intensity value of I^ at the x,y location in frame buffer 158 is copied into frame buffer l6θ. In addition, in the present embodiment, the intensity value of I fc is combined with the coordinate values and thus, a pixel count reduced representation of the latest image intensities is produced. However, as per the previous embodiment, transmission is stopped shortly after the camera begins acquiring a new image. A fourth embodiment of the temporal variations extraction method of image acquisition unit 10 is shown in Fig. D. This embodiment is similar to that of the first embodiment in that it transmits the entire image of differences; however, it utilizes, with no modifications, the image content responsive camera 102 and camera controller 100 to acquire the images. The resultant pixel count reduced representation, which has incorporated in it the 'interesting' features in the image, is stored in a frame buffer 164, capable of storing a full resolution image and initially containing null values, as follows. The intensity value I v ,, of the triplet (x,y,I_- „) is stored at position x,y in FIFO frame buffer 164, writing over the value that was previously there. Before storing, the L „ of a pixel in the pixel count reduced representation is subtracted, in subtracter 154, from the value it will overwrite in frame buffer 164. Three types of differences are produced. If both the I„ „ and the stored value are non-null values, the difference is computed. If the stored value is a null value, then I Λ v ,y.. is presented as the difference value. If the stored value is a non-null value and no value is generated by the camera 102, then the difference value produced depends on the type of interpolating done at the receiving end, as described hereinbelow, and is either a null value, for a zero-order updating interpolator, or an instruction to the camera controller 100 to produce an actual reading of the pixel intensity at some later time. In either case, the pixel intensity is nullified in the frame buffer 164. The difference produced by the subtracter 154 is combined with the coordinate values produced from the controller 100, thus producing the output of this embodiment of unit 10. Alternately, as noted in the dashed lines of Fig. 5 , the differences can control which pixels, stored in frame buffer 164, combined with the coordinate values, are produced as the output. The differences, without any thresholding, can so control the output since the camera-controller system 100 operates at high speed, thus producing few differences between images, and any differences thus produced are, by definition, the important ones. Periodically, the FIFO frame buffer 164 flushes out the locations which have not been updated since the last flushing. A fifth embodiment of the temporal variations extraction method of image acquisition unit 10 incorporates a sensor cell 165 designed by John E. Tanner and Carver Mead, as discussed in the Background of the Invention, the referenced publication of which is incorporated herein by reference, into the image acquisition unit 10. The image sensor 166, as described in European Patent Application 88111330.2, contains an array of sensor cells for detecting light impinging upon it and a system for selectively reading the information stored in the cells. According to the present embodiment of the invention, image sensor 166 comprises an array of sensor cells I65 and thus, acquires and stores the difference image according to the directions it receives from a controller 168, similar to controller 100 except that the image processing element is not an edge detector 104 but an absolute intensity thresholding device. As per previous embodiments of the invention, the output is a stream of tagged pixels of the image of differences. Pixel count reduced representations are organized in a manner which is conducive to efficient storage and to communication where slow transmission is common. Thus, transmitter 14 can transmit them in real time over communication link 17 to be received by receiver 18. Image reconstructor 20 receives the pixel count reduced representations from receiver 18 and rebuilds them, displaying the resulting image on display 22. A preferred embodiment of the image reconstructor 20 utilizes a zero-order interpolative reconstruction to produce the reconstructed pixel image B, an approximation of the original image I, from its pixel count reduced representation A. The method is as follows. If a pixel is present in A, it is copied directly into its corresponding pixel in B. All other pixels in B correspond to areas of the original image I which did not contain 'interesting' information and therefore, need to be interpolated from their neighbors which were stored in A. Formally stated, if the set of i,j coordinates of all the pixels in A is IJ, then the x,y pixel of B assumes the value of pixel m,n of A where m,n is a member of IJ and achieves the minimum of ((x-i) ___ + (y-j) ?) over all i,j in IJ. This zero-order interpolation is tantamount to a sample-and-hold process in two spatial dimensions. According to a preferred embodiment of the present invention, the abovementioned reconstruction method is implemented in hardware, as shown in Fig. 6A. A neighborhood generator (NG) , referenced 3©0, receives a pixel of the pixel count reduced representation, referenced 302 , as the triplet (i,j,a π - _•.). NG 300 will generate a sequence of coordinates x,y constituting a neighborhood around i,j of predetermined size D. The coordinates x,y are generated according to concentric circles centered around i,j and in order of increasing distance d Λ „, y„ from i,j • According to a preferred embodiment of the invention, d„ „ is the Euclidian distance between i,j and x,y. According to an alternate embodiment of the invention, d„ „ is a grid distance, computed according to d χ y * = |x-i| + |y"~j| - Another embodiment of the invention generates x,y coordinates along squares around the input pixel, such as x=i+d i„c , y or , y„ while y ranges from j+d χ^y to -d Xjy and y=j+d χ>y or y=j-d χ while x ranges from i+d A v »J,r r to i-d ■ „ Λ ,J„' . d Λ „»J_., is fixed for the entire square 'circle' and only increases from 'circle' to • circle' . For each x,y thus generated, a frame buffer 304, such as a matrix of RAM chips, is accessed during the read subcycle of a read-modify-write memory cycle, and a value r„ ,., the stored χ ,y value at the x,y position of the frame buffer, is retrieved. The value r„ „ is the distance from coordinates x,y to the coordinates of the input pixel which last determined the intensity value at x,y. A comparator 306 compares d Λ„. , y,. to r Λ „» y,.. If d Λ „» j,- is less than or equal to rx„, j v , then the following activities occur: 1) The input value a.- .- is stored in a frame buffer 308 at position x,y t establishing a new pixel value for the interpolated image at that position; 2) The distance d Λ„. , y„. is stored in frame buffer 304 at position x,y during the write subcycle of the read-modify-write cycle, establishing the modified distance for that pixel; and 3) A controller 310 sets an 'update' flag. If dx„, y,, is greater than rA„, y„, none of the three activities described hereinabove occur. Controller 310 saves the current distance d χ „ , y„ in a register. Every time a new distance and x,y pair are generated, the controller 310 compares the new d„ Λ , y,. with the currently stored one. If dx„, y, 7 grows by 1, the controller 310 examines the 'update' flag and performs the following steps: 1) If the flag is clear, indicating that for the previous d i„c , y,. no update of frame buffers 304 and 308 occurred, the whole process can be aborted, and the process has finished for the current a- , .- . The controller 310 resets itself and NG 300 waits for the next input pixel 302 to arrive; or 2) If the flag is set, indicating that at least one update took place for the previous dx v ,y .. , the 'update' flag is reset and the new d χ replaces the old one in controller 310 's register . The controller 310 thus insures that updating proceeds while there exist pixels which are closer to the current input pixel 302 than to any previous ones. However, the updating process terminates when the neighborhood around the input pixel 302 has been completely updated. The neighborhood size D is incorporated in order to increase the efficiency of the interpolation process. The limit D is most important during the early stages of the interpolation process since at that point, the frame buffers 304 and 308 are mostly empty and the early pixels will, if not contained, interpolate onto wide areas which are likely to be overlaid with later pixels. According to a preferred embodiment of. the invention, D is defined as 2 m , where m one less than the lowest decimation level. A video controller 31 accesses frame buffer 308, which holds the interpolated image B concurrently with its being updated. In order to concurrently display the interpolated image B, produced in a non-spatially consecutive manner, video controller 31 comprises counters to generate the raster-scan order row and column addresses of the most recently interpolated image and a video generator, such as ZNA 134J from Ferranti of Commack, New York, for generating vertical and horizontal sync signals for the display 22 . The video controller 312 thus displays first an interpolation of the lowest resolution of the image and subsequently improving the reproduced image with the higher resolution 'interesting' features. An embodiment of the zero-order hold image reconstructor 20 as an electronic circuit board comprising PAL chips from Texas Instruments as well as other chips from Texas Instruments, is shown in Fig. 6B. The image reconstructor 20, in this embodiment, comprises four major elements, an interface 313 to a processor, such as an IBM PC, a controller 314, a data path 316, and a video controller 320. The video controller 320 is an interface to display 22 and operates every other clock time, after image reconstructor 20 has interpolated the input signal. The operation of the circuit board begins through the interface 313 as an input triplet (i,j,a n - , J π -) is downloaded to it from the processor. Interface 313 writes the i, j, and intensity a, , values into X-CARD COUNT, Y-CARD COUNT, and VALUE PORT, respectively, where X-CARD COUNT and Y-CARD COUNT are typically counters, such as the 20X8, and VALUE PORT typically comprises an 8-bit register, such as the 20R8. VALUE PORT typically has a synchronous clear line for initialization purposes. As such, the interface 313 performs the operation of unit 302 of Fig. 6A. In addition, it checks the read status of the present embodiment of interpolator 20 and produces another set of values as soon as the interpolator 20 is ready for it. Interface 313 is incorporated into chips U34 and U35- The controller 314 typically comprises three PAL chips, typically the 16R4 with a 10 nsec clock, and performs the operations of the controller 310 and the neighborhood generator 300. Control chip U13, the main controller, controls the other two chips, thus exerting control over the entire image reconstructor 20. The array logic incorporated into control chip U13 is included in Annex A. Coordinate chip Ul4 produces the coordinates in the neighborhood of the current pixel i,j such that at every read or write stage the proper address is available. The neighborhood is typically defined as a square spiral beginning at the pixel position directly above the current pixel; thus the coordinates of the neighborhood elements are calculated as follows: move up one square from the current pixel, move right one square, move down two squares, move over two squares, move up three squares, etc. Coordinate chip Ul4 performs the operations of neighborhood, generator 300 its array logic is included in Annex B. Initialization chip U15 clears display 22 and initializes a frame buffer R-buffer, such as chips 1120-22 built from the 7187, to the maximum radius D. D is defined in hardware by the positioning of a dip switch, SW1, attached to a counter R- count. R-buffer performs the same operation as frame buffer 304, specifically, it stores the distance of each pixel in the frame to the most recently available input pixel closest to it. Data path 316 typically comprises a memory, typically built from two static RAM frame buffers, R-buffer and I-buffer, 64K x 8 and 64K x 3 blocks respectively, two counters R-count and 2R-count, instantiated as chips U10 and Ul6, VALUE PORT, and a write-disable system, built into chip U19. I-buffer, similar to frame buffer 308, stores the current state of interpolated image B and is instantiated in chips U23-U30. R-buffer operates as mentioned hereinabove. Fig. 6B(2) shows the connections of both R-buffer and I-buffer in more detail. R-count and 2R-count produce the neighborhood spiral as follows. R-count counts R, the number of squares in the spiral, up to a maximum D as defined in hardware. R-count ncreases by 1 when the square is finished and the next square is begun. The array logic for R-count is included in Annex D. 2R-count counts the number of pixels per side of the current square of radius R and as such, counts modulo 2R - 1. For example, if R is equivalent to 3, 2R-count counts modulo 5« 2R-count announces to coordinate chip Ul4 when a side of the square. The array logic for 2R-count is included in Annex E. The write disable system disables the writing into either of I-buffer or R-buffer when an input pixel is too close to the edge of the image. For example, for input pixel coordinates x=200,y=253, y will grow and reach 255, the outer edge of a 2 6 x 2 6 pixel image. Should y be allowed to continue growing, it would reach y=0, etc., which is the other side of the image. This is undesirable and the write disable system ensures that, as a pixel is interpolated, it is never interpolated into an unacceptable area, such as outside of the frame of the image. The array logic for WRITE DISABLE is included in Annex F. The video controller 3 0 produces synchronization pulses to be sent to display 20, to a D/A chip and to counters, Y-VIDEO COUNT and X-VIDEO COUNT. X-VIDEO COUNT and Y-VIDEO COUNT indicate the location in I-buffer that the video controller 320 will read, and as such, count in a raster-scan order. For each clock cycle during which the video controller 320 operates, it reads the entirety of elements of I-buffer, thus producing on the display 22 the most current version of the reconstructed image B. Using either of the reconstruction embodiments described hereinabove, an approximation B of the original image is displayed to a viewer on display 22. However, it is often desirable to display original image I rather than its approximation B. Such a situation exists for images retrieved from storage and for video-telephones. In such a situation, the original image I is necessary, but the viewer does not wish to wait for the entire image to be displayed before recognizing it and responding to it. The pixel count reduced representation, with modifications, is ideally suited for display in the abovementioned situations since pixels are allocated earlier to 'interesting' areas of the image ensuring that the viewer quickly has a recognizable approximation of the image. The modifications ensure that, over time, the original image I is displayed in its entirety. The modifications necessary to display the original image I in its entirety typically comprise incorporating an additional controller 324, comprising a frame buffer 326, into the encoder 30 of image acquisition unit 10 to operate as follows. A minimal, pixel count reduced representation, of the kind described hereinabove, is first produced and a '1' is stored in the locations of the frame buffer 326 corresponding to each pixel of the minimal representation. The additional controller 324 then reduces the threshold level of the thresholder utilized in the chosen embodiment of image acquisition unit 10 to allow more pixels to be incorporated in the representation. The additional controller 324 checks each pixel of the thus generated representation, via a comparator 325, and incorporates only those pixels for whom a null value was stored in frame buffer 326. Additional controller 324 then stores a '1' in the locations of frame buffer 326 corresponding to the pixels thus incorporated. The process continues until all the pixels of the original image have been acquired, producing an image content responsive sequence of the pixels of the original image. According to a preferred embodiment of the invention, the original image is reproduced, after transmission over communications link 17, or from storage, via either of the reconstruction methods discussed hereinabove. In the early stages of the image reconstruction, most pixels are interpolated over large areas, constrained only by the D limit. Due to the spatial responsiveness of the image acquisition method, after less than 10# of the pixels have been displayed, the reproduced image resembles the original image enough to allow a quick identification of the image. As the process continues and an increasing number of pixels are received, the interpolated pixels are replaced by actual, received ones, resulting in a final image which is the original image I. For images which additionally undergo temporal variations extraction, the methods described hereinabove for reproducing an image, with some slight modifications, also reproduce a series of images containing movement as described hereinbelow. Reference is now made to Fig. 11 which illustrates two alternate methods of reconstructing a series of images containing movement. According to a preferred embodiment of the interpolator 20 useful for reconstructing images containing movement, interpolator 20 typically comprises a read-modify-write frame buffer, referenced 350 and initially containing null values, an adder 352, and a display controller 356, typically comprised of counters for the generation of row and column addresses in raster-scan order and a video generator, such as ZNA 134J from Ferranti of Commack, NY, for the generation of vertical and horizontal sync signals. The input signal is a stream of tagged difference pixels, the pixel count reduced representation of an image of differences. The x,y coordinates of each new tagged difference pixel are sent as control signals to the frame buffer 350 which extracts the x,y pixel intensity I *„,y„ and sends it to adder 352. Adder 352 adds I •.Λ.. , y „ to Dt_Λ , y v , the difference value at x,y, to create the updated version of I A „, y„ which is then stored in the x,y location of frame buffer 350- Display controller 356 simultaneously displays, in raster-scan order, the entire contents of frame buffer 350- Due to the constantly changing elements stored in frame buffer 350, a moving image is displayed on display 20. This embodiment of interpolator 20 is typically combined with the first, second, fourth and fifth embodiments of the image acquisition unit 10 for temporal variations extraction. An alternate embodiment of interpolator 20 for motion reconstruction, • which decreases the effect of pixels with age by checking their time stamps and is known as a zero-order updating interpolator, is shown in Fig. lib. The circuit is similar to that of Fig. 6A, the zero-order hold interpolator, with the addition of a third frame buffer 360, a clock 362 for generating time stamps t, two multipliers 3 4 and 366 and an adder 3 8 whose only output is the most significant bit, denoting, in a two's-complement system, whether or not the result is negative. It will be appreciated that the elements of the circuit which remain the same as in Fig. 6B are numbered as they were in that figure. This modified zero-order interpolator operates as follows. A triplet (i,j,a_> _ ) is received, where a..- _•. is the value at a location in a new image where there was a large difference from the previous image. The Neighborhood Generator (NG) 300 generates a neighborhood around i,j, as well as the distance d„x, y,,, as described hereinabove. Frame buffer 304 stores the distances r_. ,y which are the distances from the coordinates x,y generated by the NG 300 to the coordinates of the input pixel which last determined the intensity value at x,y. Frame buffer 308 stores the current intensity values for all pixels and frame buffer 3 0 stores the time stamps tx v ,y„ denoting the clock time at which the intensity I-„ *** . , y„ was last stored into frame buffer 308. A g *"** 'iven neighborhood pixel x,y will assume the value of the input pixel intensity a, 1 - , J,. if and only if the following relationship holds true. Q *< r x,y ~ d x,y> + P *^ " t*,y> < Θ where Q and P are the values, typically close to 1.0, of the multipliers 368 and 366, respectively, and the adder 368 performs the addition and the comparison. If the relationship is true and a negative result is output from adder 368, intensity a.- ,- and time stamp t are input into frame buffers 308 and 360, respectively, at location x,y. Otherwise, no updating occurs. This embodiment ensures that all pixels are updated as they get older and is useful for the third and fourth embodiments of the image acquisition unit 10 for temporal variations. Reference is now made to Figs. 12A - 12L, a series of images, which detail the processing- of an image as it proceeds through the system of Fig. 1 as well as compare the pixel count reduced representation with a standard raster scan bit reduction technique. Fig. 12A is the original image which shows a woman wearing a hat of feathers standing in front of a fairly non¬ descript background. Fig. 12B is a bit mapping of the locations of the pixels which are chosen for a three level decimation pixel count reduced representation, such as described hereinabove. The areas of lowest concentration indicates the low resolution image lo and, it should be noted, are concentrated mainly in the background areas. The pixels belonging to M2 mark the interesting features in the background, as well as parts of the face and hat. Pixels belonging to M^ , being the dark grey areas of the figure, are concentrated along the edges of the woman's face, body and hat. Finally, the black areas of the figure indicate the highest decimation level, belonging to M^, and are near the pupils, along the edges of the hat and in the feathers of the hat. It will be appreciated that, even from the bit mapping of the pixel count reduced representation, the basic elements of the image are visible. Fig. 12C is an illustration of the pixel count reduced representation itself, in image form. The pixels shown have the intensity values corresponding to the location they are in. The black areas are pixels which do not- belong to the pixel count reduced representation and as such, do not have any intensity values. Once again it is possible to see the basic elements of the image. Fig. 12D shows a reconstruction of 1 . 5% of the entirety of pixels in the image, when reduced via either the raster scan technique and utilizing only every 8th pixel in both directions, or according to the teaching of the present invention and reproducing only the lowest resolution image portion of the pixel count reduced representation. Figs. 12E and 12F show reconstructions of 2 . 8% of the entirety of pixels in the image, where Fig. 12E is from a reduction via the raster scan method, which utilizes only every 6th pixel in both directions and where Fig. 12F is from the first 2 . 8% of the pixel count reduced representation. It will be appreciated that Fig. 12F more clearly defines the area around the eyes and along the edges of the hat. Figs. 12G and 12H are similar to Figs. 12E and 12F but with 6.25# of the image reproduced. In the case of Fig. 12G, the raster scan reduced image, the raster scan utilized every fourth pixel. Once again, the reproduction of the pixel reduced count representation produces more definition, specifically in the areas around the eyes, nose and mouth, along the edges of the hat and among the feathers of the hat. Figs. 121 and 12J are similar to Figs. 12E and 12F but with 11# of the image reproduced. In the case of Fig. 121, every third pixel was utilized. Although the image in Fig. 121 is perfectly recognizable, the image in Fig. 12J is better defined. Figs. 12K and 12L show a reproduction of the image using 25% of the pixels in the image, where, for the raster-scan reduction, every second pixel was incorporated. Fig. 12L, the reproduction of the pixel count reduced representation, has much better defined edges. It will be appreciated by persons skilled in the art that the- present invention is not limited by what has been particularly shown and described hereinabove. Rather the scope of the present invention is defined only by the claims which follow: ANNEX AA ~\ 7 #define xsel xsi xs2 #define ysel ysi ys2 #define TX xsl=1 xs2=l #define TY ysl=1 ys2=l #define DM1 ds=0 #define D3 ds=1 #define XX xsl =0 xs2=0 #define YY ysl =0 ys2=0 #define X2 xsl =0 xs2= l #define Y2 ysl =0 ys2= l #define CX xsl = 1 xs2=ø #define CY ysl =1 ys2=0 program eg { fsm main { inputs: xet yet dgz rst; outputs: xsel ysel ds ; reset on rst to six; one: if (xet & yet &. !dgz) then goto six else if (xet & yet & dgz) then goto one [TX TY DM1] else if (dgz) then goto two [XX YY DM1] two: assert [X2 YY DM1] ; three: assert [XX Y2 DM1] ; four: goto one [X2 Y2 DM1] ; six: assert [CX CY D3] ; fork sfsm matrix; join sfsm matrix; seven: assert [TX TY D3] ; } fsm matrix { inputs: rst ; reset on rst to start; start: for (i=0,i<256,i+=8) { one: fork sfsm row; join sfsm row; } } fsm row { inputs: rst; outputs: cnt; reset on rst to start; start: for (i=0,i<256;i+=8) one: assert [cnt]; } SUBSTITUTE SHEET Name CONTROLLER; ANNEX A Partno pall6R4; Date 27/08/88; Revision 04; Designer YELLIN DANNY; company technion; Assembly Λ ΛΛ Location U13; DEVICE P16R4; /******************************************************************/ /* */ /* THE CONTROLLER STATE MACHINE */ /* */ /******************************************************************/ /* */ /****************************************************************** /** Inputs **/ /* RISING EDGE 20 MHZ */ /* ACTIVE HIGH */ /* ***ACTIVE LOW *** */ /* ACTIVE HIGH */ /* ACTIVE HIGH */ /* *** ACTIVE LOW *** */ /* *** ACTIVE LOW *** */ /** ACTIVE LOW = BEGIN TO INIT MACH */ /* » 0" FOR OUTPUT ENEBLE */ /* */ /* " */ * ** O Olult't-pTYuITtf-.sS **. /* - !WR */ /* = !ENE ADD-MACHINE = !ENE 2R /* = !R RESET */ /* = TOP = CLR VALUE = ACTIVE HIGH * NCI = !Q0 & IQ1 & !Q2 & Q3 ; NC2 = RESET & !Q3 NC3 = Q0 & Q3 # Ql & Q3 OUT4= Q0 & Q3 Q0.D = 1RESET # Q0 & Q3 & !END # Q2 & Q3 & 'START # Q0 & !Q3 & !WR_FIN # Q0 δ !Q3 & 1START # !Q0 & !Q3 δ !rR ; SUBSTITUTE SHEET Ql.D - NC2 & ( QO & WR_FIN & START # !Q0 & rR ) Q2.D - RESET & ( QO & Q3 & END # Q2 & Q3 & START # NCI & R_TC # NCI & !EOP ) Q3.D = IRESET # NC3 # Q2 & Q3 & START # NCI & ( R_TC # !EOP ) # QO & !Q3 & WR FIN & START # !Q0 & !Q3 & rR SUBSTITUTE Srffi Name ADDRESS STATE MACHINE; Partno pall6R4; Date 10/08/88; Revision 02; Designer YELLIN DANNY; company technion; Assembly XXXXX; Location U14; DEVICE P16R4; /******************************************************************/ /* */ /* THE ADDRESS STATE MACHINE */ /* */ ******************************************************************/ /* */ /******************************************************************/ /** Inputs **/ /* FALLING EDGE 20 MHZ */ /* ACTIVE WHEN ENE='0 r */ /* RESETS THE ADD MACHINE = ACTIVE LOW */ /* TC OF 2*R COUNTER */ /* "0" FOR OUTPUT ENEBLE */ /* . */ /* */ /** Outputs **/ = ENE - XCOUNTER */ = ENE - YCOUNTER */ = X - UP */ = Y - UP */ = ACTIVE HIGH = COMES FROM ADD MACHINE IT ALLOWES OE TO EOP FF & IT ALLOWES R-ENE NCI = !START # Ql & Q3 & ENE RESET_2R = !Q0 S !Q1 OE_ENE * = Q0 S !Q3 ; Q0.D = (Q2 δ !Q3 # Ql δ !Q2) δ !ENE & TC_2R # !Q1 δ Q2 δ !ENE δ !TC_2R # Q0 δ !Q3 δ !ENE δ !TC_2R # NCI # !Q1 δ Q2 δ ENE # Q0 δ !Q3 δ ENE ; - ENE ) # IQI & Q2 s , ENE & TC ^ R g * 22 δ | Q3 & ENE # - Q l & Q2 & £NE . - TC - 2R Q 3.D = NCI # Q2 & I 3 & , ENE δ TC_2R # IQI & Q2 & , ENE δ .'TC 2R # * Q 1 & Q2 δ ENE SUBSTITUTE SHEET Name INITIALIZATION MACHINE; ANNEX C Partno pall6R4; Date 28/09/88 ; Revision 04; Designer YELLIN DANNY; company technion; Assembly XXXXX; Location U15; DEVICE P16R4; /******************************************************************/ /* */ /-* THIS MACHINE INITIALIZE THE MACHINE TO FB (X, Y) = *** 0 RB=7 */ /* */ /******************************************************************/ /* */ /******************************************************************/ /** Inputs **/ /* FALLING EDGE 20 MHZ */ /* = RESET TO CONT = ACTIVE LOW */ /* *** = ACTIVE LOW *** */ /* *** __. ACTIVE LOW *** */ /* = ACTIVE HIGH */ /* */ /* */ /* "0" FOR OUTPUT ENEBLE */ /* */ /* */ /** Outputs **/ INCI 1Q0 */ IQI */ IQ2 */ IQ3 */ IEND THIS IS ALSO THE IOE OF THE INIT MACHINE P n 12 */ IOE_ADD_MACH ; /* THIS IS THE IOE OF THE ADD MACHINE */ SUBSTITUTE SHEET /** LOGIC EQUATIONS **/ END = IQ3 ; /* END = IOE OF THIS MACHINE (initialization machin OE_ADD_MACH = IEND NCI = IQO δ Ql δ IQ2 δ IQ3 # QO δ Ql δ Q2 & IQ3 δ (TC_Y # !TC_Y δ IY7) # IQO δ IQI δ IQ2 δ IQ3 ; - QO.D - BEGIN δ ( QO δ Ql δ IQ2 δ IQ3 & !WR_FIN # IQO δ Ql δ IQ2 δ IQ3 # QO δ Ql δ Q2 δ IQ3 δ (TC_Y # ITC_Y δ I 7) # IQO δ IQI δ IQ2 δ IQ3 ) Ql.D = IBEGIN # QO δ Ql δ 1Q2 δ IQ3 δ WR_FIN δ ( TC_X # ITC_X δ 1X7 ) # QO δ Ql δ IQ2 δ IQ3 δ !WR_FIN # NCI ; Q2.D = BEGIN & IQO δ IQI δ IQ2 δ IQ3 Q3.D = BEGIN δ ( QO δ Ql δ Q2 δ IQ3 δ ITC Y δ Y7 # IQO δ IQI δ IQ2 δ Q3 ); SUBSTITUTE SHEET Date 06/09/88; Revision 03; Designer YELLIN DANNY; Company technion; Assembly XXXXX; Location U10 ; DEVICE P20R6; /A*****************************************************************/ /* */ /* R COUNTER FOR HARDWARE ZOH */ /* */ /******************************************************************/ /* WITH END FF */ /******************************************************************/ /** Inputs **/ /** Outputs ' **7 /* */ /* " */ /* - */ /* TC = "1" WHEN Q[0..2]=D[0..2] */ /* REGISTERED END TO THE CONTROLLER*/ Logic Equations **/ 1Q0.D = I ( IRESET # IQO δ ENE δ ITOP # /* COUNT */ Q0 δ IENE δ ITOP # /* NO ENE */ TOP ) /* TOP = LOAD TO Q[0..2]=lll */ !Q1.D = I ( ENE δ RESET δ ITOP δ ( IQI δ Q0 # Ql δ IQO ) # /* COUNT */ IENE δ RESET δ ITOP δ Ql # /* NO ENE*/ TOP δ RESET ) ; IQ2.D = !( ENE δ RESET δ ITOP δ (Ql δ Q0 δ IQ2 # Q2 δ I (Ql δ Q0)) # /* COUNT */ IENE δ RESET δ ITOP δ Q2 # TOP δ RESET ) SUBSTITUTE SHET !TC.D = I ( I (QO $ DO) δ 1 (Ql $ Dl) δ ■! (Q2 , $ D2) ) ; /* ONE CLOCK AFTER Q[0..2]=D[0..2] TC EQUELES 1 ( TC=1 ) */ IENDTOCONT.D = IENDFROMINIT ; SUBSTITUTE SHEET ANNEX E Name 2RC0UNT; Partno pal20R6; Date 15/08/88; Revision 05; Designer YELLIN DANNY; Company technion; Assembly ΛΛΛΛΛ Location U16; DEVICE P20R6; /******************************************************************/ /* */ /* 2*R DOWN COUNTER (MOD 2*R) WITH LOAD δ.TC */ /* */ /******************************************************************/ /* WITH EOP FF */ /******************************************************************/ **. THESE ARE THE INPUTS CONECTED TO 2*R COUNT ************/ CLK /* RISING EDGE */ RESET /* "! » FOR RESET COUNT */ DO /* */ Dl /* */ D2 /* */ ENE /* "0" FOR COUNT ENABLE = ADD-MACHINE ENABLE = ACTIVE LOW */ THESE ARE THE INPUTS CONECTED TO EOP FF ************/ = EOPSET /* = IWR-TO-MEM = ACTIVE LOW */ **■ = EOPRESET /* = RESET 2R = PIN 2 OF THIS CHIP */ = OE_ENE /* SHOULD BE CONECTED TO PIN 12 AT THE ADDR - MACHINE = (active high) */ Pin 13 - IEOPOE /* "0" FOR OUTPUT ENE =(active low)*/ Pin 12 - GND /* */ Pin 24 - VCC /* */ /** Outputs **/ /********* THESE ARE THE OUTPUTS CONECTED TO 2*R COUNT ************/ /* */ /* */ /* */ /* */ /* TC=1 WHEN Q[0..3]=0001 */ UTS CONECTED TO EOP FF ************/ /* = EOP - ACTIVE LOW */ /* ACTIVE LOW NC */ * OES * /** Logic Equations **/ ENE_R.D = QO δ IQI δ Q2 δ Q3 δ OE_ENE δ IENE TO_OE = ENE_R TC = IQO δ Ql δ Q2 δ Q3 QO.D = IRESET δ ( TC δ IENE # /* LOAD */ ITC δ IENE δ IQO # /* DOWN */ ENE & QO ) /* HOLD */ Ql.D - /* LOAD */ δ IQO) # (Ql δ QO) ) # /* DOWN */ Q2.D = RESET # TC δ IENE δ ID1 # /* LOAD */ ITC δ IENE δ (IQ3 δ IQ2 δ Ql δ QO # Q2 δ (IQO # IQI) /* DOWN */ # Q3 δ IQ2 δ Ql δ QO ) # ENE δ Q2 Q3.D - RESET # TC δ IENE δ ID2 # /* LOAD */ ITC δ IENE δ I ( IQ3 δ ( IQ2 # IQI # IQO ) ) # /* DOWN */ ENE δ Q3 NOWRITE.D = IEOPRESET δ ( IEOPSET # EOPSET δ NOWRITE ) /* EOPRESET OVERRIDES EOPSET ***/ /******************************************************************/ /* OE FF & LOGIC */ /* WR DISABLE FF & LOGIC */ /* - */ /******************************************************************/ /* */ /** Inputs **, CLK /* FALLING EDGE 20 MHZ */ CP10 /* */ CPS */ X7 */ Y7 */ LOADX */ LOAD */ X6 */ Y6 */ END /* FROM INIT MACHINE (wr-dis=0 until end=l) IOE /* "o » FOR OUTPUT ENEBLE (allwayes active) GND /* */ VCC /* */ '** Outputs **, /* */ /* */ /******* ACTIVE LO W *********/ /** LOGIC EQUATIONS **/ OE_VTDEO.D = ICP10 δ !CP5 ' # CP10 δ CP5 OE_CARD.D - ICP5 δ CP10 # CP5 δ ICP10 XMSB.D = ILOADX δ X7 # LOADX δ XMSB YMSB.D - ILOADY δ Y7 # LOADY δ YMSB WR DIS = END δ ( ( XMSB $ X7 ) δ ( XMSB $ X6 ) # ( YMSB $ Y7 ) δ ( YMSB $ Y6 ) ) ame ; Partno pal20R6; ANNEX G Date " 28/09/88;. Revision 03; Designer YELLIN DANNY; Company technion; Assembly XXXXX; Location U35; DEVICE P20R6; /★♦★★A*************************************************************/ /* */ /* DECODES THE ADDRESS δ PRODUCES THE RESET,LOADXY,START SIGNALS */ /* PRODUCES THE READY SIGNAL */ /★★A***************************************************************/ /* */ /******************************************************************/ **/ CLK /* CP-20 RISING EDGE */ Al A2 A3 A4 A5 Aβ A7 A8 A9 IORD AEN IOWR IDLE /** = RESET R - Q2 -(active low) **/ IOE /** allwayes on (active low) **/ GND /* ' */ VCC /* */ /** OUTPUTS **/ /** ACTIVE LOW - ADD H300-301 **/ /** ACTIVE LOW - ADD H303-302 **/ /** ACTIVE LOW = ADD H305-304 **/ /** ACTIVE LOW = ADD H306-307 **/ /** ACTIVE HIGH OE=ADD H308-309 **/ /** Logic Equations **/ RESET.D = IAEN δ IIOWR & A9 δ A8 δ IA7 δ IA6 δ IA5 & IA4 δ IA3 δ IA2 δ IA1 ; LOADX.D= IAEN δ IIOWR δ A9 & A8 & !A7 & IA6 δ IA5 δ !A4 δ IA3 δ IA2 δ Al # IAEN δ IIOWR δ A9 δ A8 δ IA7 δ 1A6 δ IA5 δ IA4 δ IA3 δ !A2 δ IA1 L0ADY „ D= IAEN δ II0WR δ A9 δ A8 δ IA7 δ IA6 δ 1A5 δ IA4 δ IA3 δ A2 δ IA1 # IAEN δ IIOWR δ A9 δ A8 δ !A7 δ IA6 δ IA5 δ !A4 δ !A3 δ !A2 δ 1A1 ; START.D = IAEN δ IIOWR δ A9 δ A8 δ IA7 δ !A6 δ IA5 δ I A4 δ IA3 δ A A22 δδ Al READY - i IDLE READY.OE = IAEN δ IIORD δ A9 δ A8 δ IA7 δ IA6 δ !A5 δ IA4 δ A3 1A2 δ !A1 SUBSTITUTE SHEET ANNEX H /****************************************************************** /* */ /* HORIZENTAL X COUNTER FOR FRAME GRABER • */ /* */ /******************************************************************/ /* Allowable Target Device Types: */ /******************************************************************/ /* RISING EDGE = 5MHZ . /* "0" FOR RESET COUNT = LINE DRIVE /* IN PICTURE ARRAY = "1","0" = HOLD = Q FROM T FF */ /* = MIX VIDEO BLANK "0" = HOLD */ /* "0" FOR OUTPUT ENE = OE-VIDEO */ /* */ /* */ *** THE COUNTER COUNTS TO 255 AND THEN STOPS ****** */ /** Outputs **/ /* */ /* */ /* */ /* */ /* */ /* */ /* */ /* */ /* USE INDIDE ONLY */ STITUTE SHEET -62- /** Logic Equations **/ IQO.D - RESET + IQO /* HOLD */ :+: IRCO δ IRESET ; /* COUNT */ I Ql .D = RESET + IQI /* HOLD */ : + : IRCO δ IRESET £ QO ; /* COUNT */ 1Q2.D - RESET + I Q2 /* HOLD */ :+: IRCO δ I RESET δ QO δ Ql; /* COUNT */ IQ3.D = RESET + IQ3 /* HOLD */ :+: IRCO δ IRESET δ QO δ Ql δ Q2; /* COUNT */ IQ4.D = RESET + IQ4 /* HOLD */ :+: IRCO δ IRESET δ QO δ Ql δ Q2 δ Q3; /* COUNT */ !Q5.D = RESET + IQ5 /* HOLD */ :+: IRCO δ IRESET δ QO δ Ql δ Q2 δ Q3 δ Q4; /* COUNT IQ6.D = RESET + IQ6 /* HOLD */ :+: IRCO δ IRESET δ QO δ Ql δ Q2 δ Q3 δ Q4 δ Q5; /* COUNT */ IQ7.D = RESET + IQ7 /* HOLD */ :+: IRCO δ IRESET δ QO δ Ql δ Q2 δ Q3 δ Q4 δ Q5 δ Q6; /* COUNT RCO = QO δ Ql δ Q2 δ Q3 δ Q4 δ Q5 δ Q6 δ Q7 /* HOLD ON "11111111" * + 1MVB /* MVB =0 HOLD */ + IINPIC; /* INPIC =0 HOLD */ SUBSTITUTE SHEET Name VERTICAL_COUNTER; Partno pal20x8 ; Date 10/08/88 ; Revision 02 ;. Designer micha NISANI; Company tecnion; Assembly XXXXX; Location U7; DEVICE P20X8; „ /******************************************************************/ /* */ /* VERTIVAL COUNTER FOR FRAME GRABER */ * /* */ /******************************************************************/ /* Allowable Target Device Types: */ ******************************************************************/ $DEFINE # ' /* OR */ $DEFINE :+: $ /* XOR */ /** Inputs **/ /* LINE DRIVE */ /* "0"=LOAD = FIELED DRIVE */ /* */ /* */ /* */ /* */ /* */ /* */ /* */ /* */ TO 255-25 ********★*/ /* "0" FOR OUTPUT ENE */ /* */ /* */ /** Outputs **/ /* */ /* */ /* */ /* */ /* */ /* */ /* */ /* */ /* ACTIVE LOW */ /** Logic Equations **/ IJ20 . D = • Ql . D = U I TE SHEET € 4 " IQ2.D ** = LOAD δ ID2 /* LOAD */ + ILOAD δ IQ2 /* HOLD */ :+: ILOAD δ QO δ Ql /* u */ ΪQ3.D = LOAD δ ID3 /* LOAD */ + ILOAD δ IQ3 /* HOLD */ :+: ILOAD δ QO δ Ql δ Q2 /* u */ IQ4.D = LOAD δ ID4 /* LOAD */ + ILOAD δ IQ4 /* HOLD */ :+: ILOAD δ QO δ Ql δ Q2 δ Q3 /* UP */ IQ5.D - LOAD δ ID5 /* LOAD */ + ILOAD δ IQ5 /* HOLD */ :+: ILOAD δ QO δ Ql δ Q2 δ Q3 δ Q4 ; /* UP */ IQ6.D = LOAD δ ID6 /* LOAD */ + ILOAD δ IQ6 /* HOLD */ :+: ILOAD δ QO δ Ql δ Q2 δ Q3 δ Q4 δ Q5 ; /* UP */ I . Q7.D = LOAD δ ID7 • /* LOAD */ + ILOAD δ IQ7 /* HOLD */ :+: ILOAD δ QO δ Ql δ Q2 δ Q3 δ Q4 δ Q5 δ Q6 . ; /* UP */ RCO - I LOAD δ QO δ Ql δ Q2 δ Q3 δ Q4 δ Q5 δ Q6 δ Q7; SffiEX SflflflBβfc ANNEX J Name COMPERATOR; Partno pall6L8; Date 24/07/88; Revision 01; Designer YELLIN DANNY; Company technion; Assembly ΛAA Location ΛAΛΛ p DEVICE P16L8; ******************************************************************/ /.* */ / ■ * THIS PAL COMPARES R-REG TO RB(X,Y) */ /* */ ******************************************************************/ /* OUTPUT = ' 0 ' IF B < A */ /******************************************************************/ '** Inputs **. /* FROM U5 */ ,/** Outputs **/ 3Pin 18 = BSMALLERA ./ * * * * Logic Equations **/ UBSMALLERA = I ( IA2 δ B2 # ( I (A2 $ B2) δ IA1 δ Bl ) # I (A2 $ B2) δ I (Al $ Bl) δ I ( A0 δ !B0 ) ) ; SUBSTITUTE % Name FREQUENCY DIVIDER; ANNEX K Part no pall 6R4 ; Date 18/09/88; Revision 04; Designer YELLIN DANNY; company technion; Assembly XXXXX; Location U18; DEVICE P16R4; /******************************************************************/ /* */ /* FREQUENCY DIVIDER */ /* */ /******************************************************************/ /* WITH LATCH D TO A FF */ /* WR δ WR-TO-WR_FIN-FF LOGIC */ /****************************************************************** /** Inputs **/ /*- RISING EDGE 20 MHZ */ /* ACTIVE LOW */ /* FROM CONT ( active low ) */ /* FROM U19 ( active low ) */ /* "0" FOR OUTPUT ENEBLE (allwayes active /* */ /* */ /* MEMORY WRITE */ /* CONECTES TO WR_FIN D-FF */ /* */ /* */ /* */ /* ACTIVE HIGH */ /** LOGIC EQUATIONS **/ MEMWR = WR_DIS δ IWR δ CP5 δ ICP10 δ IOE_CARD ; TO_WR_FIN - CP5 δ ICP10 δ IWR δ !OE_CARD CP10.D = ICP10 CP5.D - ICP10 δ CP5 # CP10 δ ICP5 CP2_5.D= CP5 δ CP10 δ ICP2_5 # CP2_5 δ !( CP5 δ CP10 ) ; LATCH DTOA.D = ICP5 δ ICP10 SUBSTITUTE SHEEI ANNEX L /******************************************************************/ /* */ /* X δ Y COUNTER FOR HARDWARE ZOH */ /*. */ /******************************************************************/ /* Allowable Target Device Types: */ /******************************************************************/ */ */ */ */ */ */ */ */ */ ' */ */ */ */ */ */ */ */ */ */ */ */ */ */ /** Logic Equations **/ IQO .D - ILOAD δ IDO /* LOAD */ + • ■ LOAD δ IQO /* HOLD */ : +: LOAD δ UD δ ENE /* UP */ + LOAD δ IUD δ ENE; /* DOWEN */ IQ1.D = ILOAD δ 1-D1 /* LOAD */ + LOAD δ !Q1 /* HOLD */ :+: LOAD δ UD δ ENE δ QO /* UP */ + LOAD δ lϋD δ ENE δ IQO; /* DOWEN */ IQ2.D = ILOAD δ ID2 /* LOAD */ + LOAD δ IQ2 /* HOLD */ :+: LOAD δ UD δ ENE δ QO δ Ql /* UP */ + LOAD δ IUD δ ENE δ IQO δ IQI; /* DOWEN */ IQ3.D = ILOAD δ ID3 /* LOAD */ + LOAD δ IQ3 /* HOLD */ :+: LOAD δ UD δ ENE δ QO δ Ql δ Q2 /* UP */ + LOAD δ IUD δ ENE δ IQO δ IQI δ IQ2; /* DOWEN */ IQ4.D = ILOAD δ ID4 /* LOAD */ + LOAD δ IQ4 /* HOLD */ :+: LOAD δ UD δ ENE δ QO δ Ql δ Q2 δ Q3 /* UP */ + LOAD δ IUD δ ENE δ IQO δ IQI δ IQ2 δ IQ3; /* DOWEN */ IQ5.D = ILOAD δ ID5 /* LOAD */ + LOAD δ IQ5 /* HOLD */ :+: LOAD δ UD δ ENE δ QO δ Ql δ Q2 δ Q3 δ Q4 /* UP */ + LOAD δ IUD δ ' ENE δ IQO δ IQI δ IQ2 δ IQ3 δ IQ4; /* DOWEN */ IQ6.D = ILOAD δ ID6 /* LOAD */ + LOAD δ IQ6 /* HOLD */ :+: LOAD δ UD δ ENE δ QO δ Ql δ Q2 δ Q3 δ Q4 δ Q5 /* UP */ + LOAD δ IUD δ ENE δ IQO δ IQI δ IQ2 δ IQ3 δ IQ4 δ IQ5; /* DOWEN IQ7.D = ILOAD δ ID7 /* LOAD */ + LOAD δ IQ7 /* HOLD */ :+: LOAD δ UD δ ENE δ QO δ Ql δ Q2 δ Q3 δ Q4 δ Q5 δ Q6 /* UP */ + LOAD δ IUD δ ENE δ IQO δ.IQl δ IQ2 δ IQ3 δ IQ4 δ IQ5 δ IQ6; /* CX IQO δ IQI δ IQ2 δ IQ3 δ IQ4 δ IQ5 δ IQ6 δ IQ7 + QO δ Ql δ Q2 δ Q3 δ Q4 δ Q5 δ Q6 δ Q7; SUBSTITUTE SHEET ANNEX M DEVICE P20R8; /******************************************************************/ /* */ /* I/O PORT FOR THE VALUE */ /* */ /******************************************************************/ /* */ /******************************************************************/ /** Inputs **/ /* RISING EDGE */ /* "0" FOR LOAD VALUE */ /* */ /* */ /* */ /* */ /* */ /* */ /* */ /* . */ /* "1" FOR CLEAR */ /* "0" FOR OUTPUT ENEBLE */ /* */ /* */ /** Outputs **/ Pin 22 Q0 /* */ Pin 21 Ql /* */ Pin 20 Q2 /* */ Pin 19 Q3 /* */ Pin 18 Q4 /* */ Pin 17 Q5 /* */ Pin 16 Q6 /* */ Pin 15 Q7 /* */ /** Logic Equations **/ IQ0.D = I ( ICLR δ ( ILOAD δ DO # LOAD δ Q0 ) ) IQ1.D = I ( ICLR δ ( ILOAD δ Dl # LOAD δ Ql ) ) IQ2.D = I ( ICLR δ ( ILOAD δ D2 # LOAD δ Q2 ) ) IQ3.D = I ( ICLR δ ( ILOAD δ D3 # LOAD δ Q3 ) ) UBSTITUTE SHEET IQ4.D = I ( ICLR δ ( ILOAD δ D4 f LOAD δ Q4 ) ) ; IQ5.D = I ( ICLR δ ( ILOAD δ D5 # LOAD δ Q5 ) ) ; IQ6.D = I ( ICLR δ ( 'LOAD δ D6 # LOAD δ Q6 ) ) ; IQ7.D = !( ICLR δ ( ILOAD δ D7 # LOAD δ Q7 ) ) ; BST1TUTE SHEET

Claims: C L A I M S 1. A dynamic image representation system comprising: means for sensing a dynamic scene; and means receiving an output from said means for sensing, for providing a pixel count reduced dynamic digital representation of the scene having pixel count reductions in portions of the scene not fulfilling predetermined spatial criteria and pixel count reductions in portions of the scene not undergoing change within predetermined temporal criteria. 2. An image transmission system comprising: means, for acquiring an image including means for providing a digital image representation thereof having a reduced information bit content achieved by pixel count reduction; means for transmitting said reduced information bit content digital image representation over a communications link; means for receiving the reduced information bit content digital image representation over said communications link; and means for interpolating the received reduced information bit content digital image representation to provide a visible image representation. 3. An image storage and retrieval system comprising; means for acquiring an image including means for providing a digital image representation having a reduced information bit content achieved by pixel count reduction; means for storing said reduced information bit content digital image representation; means for retrieving the reduced information bit content digital image representation from said storage means; and means for interpolating the retrieved reduced information bit content digital image representation to provide a visible image representation. . An image transmission system according to claim 1 and wherein said means for acquiring and encoding include means for identifying temporal variations in said image and wherein said means for transmitting is operative to transmit baseline digital image representation information and thereafter information representing temporal variations in said image. 5. An image transmission system according to claim 1 and wherein said means for acquiring and encoding include a raster- scan based camera, a frame buffer and an encoder. 6. An image transmission system according to claim 5 and wherein said raster-scan based camera acquires full resolution images . 7. An image transmission system according to claims 1, , and 6 and wherein said encoder reduces said full resolution images to a hierarchy of lower resolution images wherein the lowest resolution image is retained in its entirety and the remaining higher resolution images contain only those areas of the image containing high information content. 8. An image representation system according to claim 7 and wherein said full resolution image is encoded in its entirety by first producing said hierarchy of lower resolution images, followed by lowering a threshold level thereby allowing more pixels to be included in said reduced pixel count representation, and only including those pixels not previously included in said reduced pixel count representation until the entirety of pixels in the full resolution image are included. 9. An image representation system according to claim 7 and wherein said areas of the image containing high information content are determined by detection of the presence of edges around said areas. 10. An image representation system according to claim 7 and wherein said areas of the image containing high information content are determined by detection of the presence of straight lines around said areas. 11. An image representation system according to claim 1 and wherein said reduced representation consists of a stream of data comprising tagged pixels which comprise the x and y image coordinates of each pixel existing in said hierarchy of images and an intensity value at said pixel. 12. An image transmission system according to claim 1 and wherein said means for acquiring and encoding include a camera for acquiring reduced information bit content images and a camera controller to direct the acquisition of said reduced information bit content images. 13. An image transmission system according to claim 12 and wherein said camera for acquiring reduced information bit content images includes an image sensor for sensing light. 14. An image transmission system according to claim 12 and wherein said camera controller initially directs said camera for acquiring reduced information bit content images to acquire a low resolution image. 15. An image transmission system according to claims 7 and 1 and wherein said camera controller analyzes said low resolution image for high information content areas and wherein said camera controller directs said camera for acquiring reduced information bit content images to acquire said high information areas at a higher resolution. 16. An image representation system according to claims 11 and 15 and wherein said camera for acquiring reduced information bit content images produces said stream of data. 17. An image representation system according to claim 1 and wherein said pixel count reduced representation of said scene undergoing change within predetermined temporal criteria comprises an encoded image of differences between two consecutive images. 18. An image representation system according to claim 1 and wherein said pixel count reduced representation comprises only important differences between a currently acquired image and a stored image and wherein said important differences are hierarchically organized from the most important difference to the least important difference. 19. An image transmission system according to claim 18 and wherein elements of said pixel count reduced representation are transmitted until a new image is acquired and wherein said stored image is updated with said elements of said pixel count reduced representation until said new image is acquired. 20. An image transmission system according to claim 1 and wherein said pixel count reduced representation comprises elements of the most current image at which the differences between said current image and a stored image are large enough to be significant and wherein said differences are organized from largest to smallest. ά 21. An image transmission system according to claims 1, and 13- 16 and wherein said pixel count representation comprises an encoded image of differences between two consecutive images. 22. An image transmission system according to claim 21 and wherein said pixel count reduced representation comprises elements of the most current image at which the differences between said current image and a stored image are large enough to be significant and wherein said differences are organized from largest to smallest. 23. An image transmission system according to claim 13 and wherein said camera for acquiring reduced information pixel count content images includes an image sensor for sensing motion and wherein said image sensor for sensing motion produces an image of -differences. 24. An image transmission system according to claim 23 and wherein said pixel count representation is based on intensities in said image of differences. 25« An image transmission system according to claim 2 and wherein said means for interpolating said received pixel count reduced representation utilize a zero-order hold reconstruction method. 26. An image transmission system according to claim 2 and any one of claims 17. 18 and 24 and wherein said means for receiving include a frame buffer. 27. An image transmission system according to claim 26 and wherein said frame buffer stores an already transmitted image and wherein elements of said image of differences are summed with corresponding elements stored in said frame buffer and said sum is stored in the corresponding location in said frame buffer, thereby producing an updated stored image. 28. An image transmission system according to claim 27 and wherein said updated image is displayed on a display device. 9. An image transmission system according to claims 2, 20 and 22 and wherein said means for interpolating include means for providing a time-stamped reconstruction method.

Inventors: GINOSSAR RAN, HILSENRATH OLIVER, ZEEVI YEHOSHUA Y, GINOSSAR, RAN, HILSENRATH, OLIVER, ZEEVI, YEHOSHUA, Y.
Applicants: GINOSSAR RAN, ZEEVI YEHOSHUA Y, GINOSSAR, RAN, ZEEVI, YEHOSHUA, Y.
Application year: 1990
Main classification: H04N7
IPC codes: H04N7