A multi-core processor is used in a portable device that has first and second image sensors spaced from each other for capturing images of a scene from slightly different perspectives. The multi-core processor has a first image sensor interface for receiving data from the image sensor, a second image sensor interface for receiving data from the second image sensor, multiple processing units and, the four processing units and the first and second sensor interfaces being integrated onto a single chip. The processing units are configured to simultaneously process the data from the first and second image interfaces to generate stereoscopic image data.

Patent
   9083830
Priority
Jul 15 1997
Filed
Sep 15 2012
Issued
Jul 14 2015
Expiry
Aug 26 2018

TERM.DISCL.
Extension
47 days
Assg.orig
Entity
unknown
0
1992
EXPIRED
17. A processor, comprising:
an image sensor interface configured to receive image data from an image sensor with adjustable focal length for sensing a scene;
an instruction input interface configured to receive a signal based on a pattern; and
multiple processing units configured to:
receive the image data from the image sensor interface,
perform multi-point auto-focus on the image data, which includes dividing the image data into regions, determining an image sharpness metric for each of the regions, and determining, for each region, an optimal focal length for the region when the image sharpness metric for the region is above a fixed threshold,
decode the signal into image processing instructions, and
process the image data based on executing the image processing instructions.
1. An electronic device, comprising:
an image sensor with adjustable focal length for sensing a scene; and
a processor including multiple processing units, an image sensor interface, and an instruction input interface;
wherein the image sensor interface is configured to provide the multiple processing units with image data from the image sensor, and
wherein the multiple processing units are configured to:
perform multi-point auto-focus on the image data, which includes dividing the image data into regions, determining an image sharpness metric for each of the regions, and determining, for each region, an optimal focal length for the region when the image sharpness metric for the region is above a fixed threshold, and
process the image data based on executing image processing instructions, wherein the instruction input interface is configured to receive a signal based on a pattern, wherein the processor is configured to decode the signal into the image processing instructions.
2. The electronic device according to claim 1, wherein the multiple processing units divide the image data into three regions arranged horizontally.
3. The electronic device according to claim 1, wherein the processor is configured to detect faces using hue and local feature analysis.
4. The electronic device according to claim 1, further comprising a color display for viewing an image captured by the image sensor, wherein the processor further includes a display interface for transmitting processed data from the multiple processing units to the color display.
5. The electronic device according to claim 4, wherein each of the multiple processing units has at least one address generator for the processed data.
6. The electronic device according to claim 1, wherein each of the multiple processing units has RAM (random access memory) for microcode written to the RAM for operative control of the processing unit.
7. The electronic device according to claim 6, further comprising a central processing unit for writing the microcode to the RAM in each of the multiple processing units.
8. The electronic device according to claim 7, further comprising a keyboard interface for user input of instructions to the central processing unit such that the central processing unit rewrites the microcode in the RAM within each of the multiple processing units.
9. The electronic device according to claim 1, wherein the processor further comprises a crossbar switch for interconnecting each of the multiple processing units.
10. The electronic device according to claim 1, wherein the processor further comprises an input FIFO (first in, first out) and an output FIFO, the input FIFO being configured for receiving data from the image sensor interface and inputting the data to the multiple processing units, and the output FIFO being configured for receiving data processed by the multiple processing units to be read by other components of the electronic device.
11. The electronic device according to claim 10, wherein the processor further comprises a data bus connecting the processing unit to the input FIFO and the output FIFO.
12. The electronic device according to claim 10, wherein the processor further comprises a data cache to store the data processed by the multiple processing units until required by the other components of the electronic device.
13. The electronic device according to claim 1, wherein the processor is configured to perform one or more processing tasks selected from:
rotating the image data from the image sensor interface;
color converting the image data from the image sensor interface; and
dithering the image data from the image sensor interface.
14. The electronic device according to claim 1, further comprising a USB port for communication between the electronic device and an external device, wherein the processor further includes a USB interface.
15. The electronic device according to claim 1, wherein the multiple processing units are configured to operate using 1.5V power supply.
16. The electronic device according to claim 1, wherein determining the optimal focal length for a first region comprises performing a gradient descent based on the image sharpness metric for the first region.
18. The processor according to claim 17, wherein the multiple processing units divide the scene into three regions arranged horizontally.
19. The processor according to claim 17, wherein determining the optimal focal length for a first region comprises performing a gradient descent based on the image sharpness metric for the first region.

The present application is a Continuation of U.S. application Ser. No. 13/104,021 filed May 10, 2011, which is a Continuation of U.S. application Ser. No. 12/758,730 filed Apr. 12, 2010, issued Jun. 14, 2011 as U.S. Pat. No. 7,961,249, which is a continuation of U.S. application Ser. No. 11/045,442 filed Jan. 31, 2005, issued Apr. 20, 2010 as U.S. Pat. No. 7,701,506, which is a continuation of U.S. application Ser. No. 09/112,786 filed on Jul. 10, 1998, issued Apr. 12, 2005 as U.S. Pat. No. 6,879,341. Each of the above identified patents and applications is hereby incorporated herein by reference in its entirety. With respect to the present application, any disclaimer of claim scope made in the parent application or any predecessor or related application is hereby rescinded.

The present invention relates to digital image processing and in particular discloses Camera System Containing a VLIW Vector Processor.

Further the present invention relates to an image processing method and apparatus and, in particular, discloses a Digital Instant Camera with Image Processing Capability.

The present invention further relates to the field of digital camera technology and, particularly, discloses a digital camera having an integral color printer.

Traditional camera technology has for many years relied upon the provision of an optical processing system which relies on a negative of an image which is projected onto a photosensitive film which is subsequently chemically processed so as to “fix” the film and to allow for positive prints to be produced which reproduce the original image. Such an image processing technology, although it has become a standard, can be unduly complex, as expensive and difficult technologies are involved in full color processing of images. Recently, digital cameras have become available. These cameras normally rely upon the utilization of a charged coupled device (CCD) to sense a particular image. The camera normally includes storage media for the storage of the sensed scenes in addition to a connector for the transfer of images to a computer device for subsequent manipulation and printing out.

Such devices are generally inconvenient in that all images must be stored by the camera and printed out at some later stage. Hence, the camera must have sufficient storage capabilities for the storing of multiple images and, additionally, the user of the camera must have access to a subsequent computer system for the downloading of the images and printing out by a computer printer or the like.

Further, digital camera devices have only limited on board processing capabilities which can only perform limited manipulation of sensed image. The main function of the on board processing capability is to store the sensed image. As it may be desirable to carry out extensive modification of an image, the capabilities of such digital camera devices are considered inadequate.

The present invention relates to the provision of a digital camera system having significant on-board computational capabilities for the manipulation of images.

In accordance with a first aspect of the present invention, there is provided a digital camera system comprising a sensing means for sensing an image; modification means for modifying the sensed image in accordance with modification instructions input into the camera; and an output means for outputting the modified image; wherein the modification means includes a series of processing elements arranged around a central crossbar switch. Preferably, the processing elements include an Arithmetic Logic Unit (ALU) acting under the control of a microcode store wherein the microcode store comprises a writeable control store. The processing elements can include an internal input and output FIFO for storing pixel data utilized by the processing elements and the modification means is interconnected to a read and write FIFO for reading and writing pixel data of images to the modification means.

Each of the processing elements can be arranged in a ring and each element is also separately connected to its nearest neighbours. The ALU accepts a series of inputs interconnected via an internal crossbar switch to a series of core processing units within the ALU and includes a number of internal registers for the storage of temporary data. The core processing units can include at least one of a multiplier, an adder and a barrel shifter.

The processing elements are further connected to a common data bus for the transfer of pixel data to the processing elements and the data bus is interconnected to a data cache which acts as an intermediate cache between the processing elements and a memory store for storing the images.

Notwithstanding any other forms that may fall within the scope of the present invention, preferred forms of the invention will now be described, by way of example only, with reference to the accompanying drawings in which:

FIG. 1 illustrates an Artcam device constructed in accordance with the preferred embodiment;

FIG. 2 is a schematic block diagram of the main Artcam electronic components;

FIG. 2A is a schematic block diagram of the main Artcam components, including an array of capacitive sensors for actuation by an actuating formation on a printing cartridge;

FIG. 3 is a schematic block diagram of the Artcam Central Processor;

FIG. 3(a) illustrates the VLIW Vector Processor in more detail;

FIG. 3A is a schematic block diagram of the Artcam Central Processor incorporating an interface for the array of capacitive sensors;

FIG. 4 illustrates the Processing Unit in more detail;

FIG. 5 illustrates the ALU 188 in more detail;

FIG. 6 illustrates the In block in more detail;

FIG. 7 illustrates the Out block in more detail;

FIG. 8 illustrates the Registers block in more detail;

FIG. 9 illustrates the Crossbar1 in more detail;

FIG. 10 illustrates the Crossbar2 in more detail;

FIG. 11 illustrates the read process block in more detail;

FIG. 12 illustrates the read process block in more detail;

FIG. 13 illustrates the barrel shifter block in more detail;

FIG. 14 illustrates the adder/logic block in more detail;

FIG. 15 illustrates the multiply block in more detail;

FIG. 16 illustrates the I/O address generator block in more detail;

FIG. 17 illustrates a pixel storage format;

FIG. 18 illustrates a sequential read iterator process;

FIG. 19 illustrates a box read iterator process;

FIG. 20 illustrates a box write iterator process;

FIG. 21 illustrates the vertical strip read/write iterator process;

FIG. 22 illustrates the vertical strip read/write iterator process;

FIG. 23 illustrates the generate sequential process;

FIG. 24 illustrates the generate sequential process;

FIG. 25 illustrates the generate vertical strip process;

FIG. 26 illustrates the generate vertical strip process;

FIG. 27 illustrates a pixel data configuration;

FIG. 28 illustrates a pixel processing process;

FIG. 29 illustrates a schematic block diagram of the display controller;

FIG. 30 illustrates the CCD image organization;

FIG. 31 illustrates the storage format for a logical image;

FIG. 32 illustrates the internal image memory storage format;

FIG. 33 illustrates the image pyramid storage format;

FIG. 34 illustrates a time line of the process of sampling an Artcard;

FIG. 35 illustrates the super sampling process;

FIG. 36 illustrates the process of reading a rotated Artcard;

FIG. 37 illustrates a flow chart of the steps necessary to decode an Artcard;

FIG. 38 illustrates an enlargement of the left hand corner of a single Artcard;

FIG. 39 illustrates a single target for detection;

FIG. 40 illustrates the method utilised to detect targets;

FIG. 41 illustrates the method of calculating the distance between two targets;

FIG. 42 illustrates the process of centroid drift;

FIG. 43 shows one form of centroid lookup table;

FIG. 44 illustrates the centroid updating process;

FIG. 45 illustrates a delta processing lookup table utilised in the preferred embodiment;

FIG. 46 illustrates the process of unscrambling Artcard data;

FIG. 47 illustrates a magnified view of a series of dots;

FIG. 48 illustrates the data surface of a dot card;

FIG. 49 illustrates schematically the layout of a single datablock;

FIG. 50 illustrates a single datablock;

FIG. 51 and FIG. 52 illustrate magnified views of portions of the datablock of FIG. 50;

FIG. 53 illustrates a single target structure;

FIG. 54 illustrates the target structure of a datablock;

FIG. 55 illustrates the positional relationship of targets relative to border clocking regions of a data region;

FIG. 56 illustrates the orientation columns of a datablock;

FIG. 57 illustrates the array of dots of a datablock;

FIG. 58 illustrates schematically the structure of data for Reed-Solomon encoding;

FIG. 59 illustrates an example Reed-Solomon encoding;

FIG. 60 illustrates the Reed-Solomon encoding process;

FIG. 61 illustrates the layout of encoded data within a datablock;

FIG. 62 illustrates the sampling process in sampling an alternative Artcard;

FIG. 63 illustrates, in exaggerated form, an example of sampling a rotated alternative Artcard;

FIG. 64 illustrates the scanning process;

FIG. 65 illustrates the likely scanning distribution of the scanning process;

FIG. 66 illustrates the relationship between probability of symbol errors and Reed-Solomon block errors;

FIG. 67 illustrates a flow chart of the decoding process;

FIG. 68 illustrates a process utilization diagram of the decoding process;

FIG. 69 illustrates the dataflow steps in decoding;

FIG. 70 illustrates the reading process in more detail;

FIG. 71 illustrates the process of detection of the start of an alternative Artcard in more detail;

FIG. 72 illustrates the extraction of bit data process in more detail;

FIG. 73 illustrates the segmentation process utilized in the decoding process;

FIG. 74 illustrates the decoding process of finding targets in more detail;

FIG. 75 illustrates the data structures utilized in locating targets;

FIG. 76 illustrates the Lancos 3 function structure;

FIG. 77 illustrates an enlarged portion of a datablock illustrating the clockmark and border region;

FIG. 78 illustrates the processing steps in decoding a bit image;

FIG. 79 illustrates the dataflow steps in decoding a bit image;

FIG. 80 illustrates the descrambling process of the preferred embodiment;

FIG. 81 illustrates one form of implementation of the convolver;

FIG. 82 illustrates a convolution process;

FIG. 83 illustrates the compositing process;

FIG. 84 illustrates the regular compositing process in more detail;

FIG. 85 illustrates the process of warping using a warp map;

FIG. 86 illustrates the warping bi-linear interpolation process;

FIG. 87 illustrates the process of span calculation;

FIG. 88 illustrates the basic span calculation process;

FIG. 89 illustrates one form of detail implementation of the span calculation process;

FIG. 90 illustrates the process of reading image pyramid levels;

FIG. 91 illustrates using the pyramid table for bilinear interpolation;

FIG. 92 illustrates the histogram collection process;

FIG. 93 illustrates the color transform process;

FIG. 94 illustrates the color conversion process;

FIG. 95 illustrates the color space conversion process in more detail;

FIG. 96 illustrates the process of calculating an input coordinate;

FIG. 97 illustrates the process of compositing with feedback;

FIG. 98 illustrates the generalized scaling process;

FIG. 99 illustrates the scale in X scaling process;

FIG. 100 illustrates the scale in Y scaling process;

FIG. 101 illustrates the tessellation process;

FIG. 102 illustrates the sub-pixel translation process;

FIG. 103 illustrates the compositing process;

FIG. 104 illustrates the process of compositing with feedback;

FIG. 105 illustrates the process of tiling with color from the input image;

FIG. 106 illustrates the process of tiling with feedback;

FIG. 107 illustrates the process of tiling with texture replacement;

FIG. 108 illustrates the process of tiling with color from the input image;

FIG. 109 illustrates the process of applying a texture without feedback;

FIG. 110 illustrates the process of applying a texture with feedback;

FIG. 111 illustrates the process of rotation of CCD pixels;

FIG. 112 illustrates the process of interpolation of Green subpixels;

FIG. 113 illustrates the process of interpolation of Blue subpixels;

FIG. 114 illustrates the process of interpolation of Red subpixels;

FIG. 115 illustrates the process of CCD pixel interpolation with 0 degree rotation for odd pixel lines;

FIG. 116 illustrates the process of CCD pixel interpolation with 0 degree rotation for even pixel lines;

FIG. 117 illustrates the process of color conversion to Lab color space;

FIG. 118 illustrates the logical layout of a single printhead;

FIG. 119 illustrates the structure of the printhead interface;

FIG. 120 illustrates the process of rotation of a Lab image;

FIG. 121 illustrates the format of a pixel of the printed image;

FIG. 122 illustrates the dithering process;

FIG. 123 illustrates the process of generating an 8 bit dot output;

FIG. 124 illustrates a perspective view of the card reader;

FIG. 125 illustrates an exploded perspective of a card reader;

FIG. 126 illustrates a close up view of the Artcard reader;

FIG. 127 illustrates a layout of the software/hardware modules of the overall Artcam application;

FIG. 128 illustrates a layout of the software/hardware modules of the Camera Manager;

FIG. 129 illustrates a layout of the software/hardware modules of the Image Processing Manager;

FIG. 130 illustrates a layout of the software/hardware modules of the Printer Manager;

FIG. 131 illustrates a layout of the software/hardware modules of the Image Processing Manager;

FIG. 132 illustrates a layout of the software/hardware modules of the File Manager;

The digital image processing camera system constructed in accordance with the preferred embodiment is as illustrated in FIG. 1. The camera unit 1 includes means for the insertion of an integral print roll (not shown). The camera unit 1 can include an area image sensor 2 which sensors an image 3 for captured by the camera. Optionally, the second area image sensor can be provided to also image the scene 3 and to optionally provide for the production of stereographic output effects.

The camera 1 can include an optional color display 5 for the display of the image being sensed by the sensor 2. When a simple image is being displayed on the display 5, the button 6 can be depressed resulting in the printed image 8 being output by the camera unit 1. A series of cards, herein after known as “Artcards” 9 contain, on one surface encoded information and on the other surface, contain an image distorted by the particular effect produced by the Artcard 9. The Artcard 9 is inserted in an Artcard reader 10 in the side of camera 1 and, upon insertion, results in output image 8 being distorted in the same manner as the distortion appearing on the surface of Artcard 9. Hence, by means of this simple user interface a user wishing to produce a particular effect can insert one of many Artcards 9 into the Artcard reader 10 and utilize button 19 to take a picture of the image 3 resulting in a corresponding distorted output image 8.

The camera unit 1 can also include a number of other control button 13, 14 in addition to a simple LCD output display 15 for the display of informative information including the number of printouts left on the internal print roll on the camera unit. Additionally, different output formats can be controlled by CHP switch 17.

Turning now to FIG. 2, there is illustrated a schematic view of the internal hardware of the camera unit 1. The internal hardware is based around an Artcam central processor unit (ACP) 31.

Artcam Central Processor 31

The Artcam central processor 31 provides many functions which form the ‘heart’ of the system. The ACP 31 is preferably implemented as a complex, high speed, CMOS system on-a-chip. Utilising standard cell design with some full custom regions is recommended. Fabrication on a 0.25 micron CMOS process will provide the density and speed required, along with a reasonably small die area.

The functions provided by the ACP 31 include:

1. Control and digitization of the area image sensor 2. A 3D stereoscopic version of the ACP requires two area image sensor interfaces with a second optional image sensor 4 being provided for stereoscopic effects.

2. Area image sensor compensation, reformatting, and image enhancement.

3. Memory interface and management to a memory store 33.

4. Interface, control, and analog to digital conversion of an Artcard reader linear image sensor 34 which is provided for the reading of data from the Artcards 9.

5. Extraction of the raw Artcard data from the digitized and encoded Artcard image.

6. Reed-Solomon error detection and correction of the Artcard encoded data. The encoded surface of the Artcard 9 includes information on how to process an image to produce the effects displayed on the image distorted surface of the Artcard 9. This information is in the form of a script, hereinafter known as a “Vark script”. The Vark script is utilised by an interpreter running within the ACP 31 to produce the desired effect.

7. Interpretation of the Vark script on the Artcard 9.

8. Performing image processing operations as specified by the Vark script.

9. Controlling various motors for the paper transport 36, zoom lens 38, autofocus 39 and Artcard driver 37.

10. Controlling a guillotine actuator 40 for the operation of a guillotine 41 for the cutting of photographs 8 from print roll 42.

11. Half-toning of the image data for printing.

12. Providing the print data to a print-head 44 at the appropriate times.

13. Controlling the print head 44.

14. Controlling the ink pressure feed to print-head 44.

15. Controlling optional flash unit 56.

16. Reading and acting on various sensors in the camera, including camera orientation sensor 46, autofocus 47 and Artcard insertion sensor 49.

17. Reading and acting on the user interface buttons 6, 13, 14.

18. Controlling the status display 15.

19. Providing viewfinder and preview images to the color display 5.

20. Control of the system power consumption, including the ACP power consumption via power management circuit 51.

21. Providing external communications 52 to general purpose computers (using part USB).

22. Reading and storing information in a printing roll authentication chip 53.

23. Reading and storing information in a camera authentication chip 54.

24. Communicating with an optional mini-keyboard 57 for text modification.

Quartz Crystal 58

A quartz crystal 58 is used as a frequency reference for the system clock. As the system clock is very high, the ACP 31 includes a phase locked loop clock circuit to increase the frequency derived from the crystal 58.

Image Sensing

Area Image Sensor 2

The area image sensor 2 converts an image through its lens into an electrical signal. It can either be a charge coupled device (CCD) or an active pixel sensor (APS)CMOS image sector. At present, available CCD's normally have a higher image quality, however, there is currently much development occurring in CMOS imagers. CMOS imagers are eventually expected to be substantially cheaper than CCD's have smaller pixel areas, and be able to incorporate drive circuitry and signal processing. They can also be made in CMOS fabs, which are transitioning to 12″ wafers. CCD's are usually built in 6″ wafer fabs, and economics may not allow a conversion to 12″ fabs. Therefore, the difference in fabrication cost between CCD's and CMOS imagers is likely to increase, progressively favoring CMOS imagers. However, at present, a CCD is probably the best option.

The Artcam unit will produce suitable results with a 1,500×1,000 area image sensor. However, smaller sensors, such as 750×500, will be adequate for many markets. The Artcam is less sensitive to image sensor resolution than are conventional digital cameras. This is because many of the styles contained on Artcards 9 process the image in such a way as to obscure the lack of resolution. For example, if the image is distorted to simulate the effect of being converted to an impressionistic painting, low source image resolution can be used with minimal effect. Further examples for which low resolution input images will typically not be noticed include image warps which produce high distorted images, multiple miniature copies of the of the image (eg. passport photos), textural processing such as bump mapping for a base relief metal look, and photo-compositing into structured scenes.

This tolerance of low resolution image sensors may be a significant factor in reducing the manufacturing cost of an Artcam unit 1 camera. An Artcam with a low cost 750×500 image sensor will often produce superior results to a conventional digital camera with a much more expensive 1,500×1,000 image sensor.

Optional Stereoscopic 3D Image Sensor 4

The 3D versions of the Artcam unit 1 have an additional image sensor 4, for stereoscopic operation. This image sensor is identical to the main image sensor. The circuitry to drive the optional image sensor may be included as a standard part of the ACP chip 31 to reduce incremental design cost. Alternatively, a separate 3D Artcam ACP can be designed. This option will reduce the manufacturing cost of a mainstream single sensor Artcam.

Print Roll Authentication Chip 53

A small chip 53 is included in each print roll 42. This chip replaced the functions of the bar code, optical sensor and wheel, and ISO/ASA sensor on other forms of camera film units such as Advanced Photo Systems film cartridges.

The authentication chip also provides other features:

1. The storage of data rather than that which is mechanically and optically sensed from APS rolls

2. A remaining media length indication, accurate to high resolution.

3. Authentication Information to prevent inferior clone print roll copies.

The authentication chip 53 contains 1024 bits of Flash memory, of which 128 bits is an authentication key, and 512 bits is the authentication information. Also included is an encryption circuit to ensure that the authentication key cannot be accessed directly.

Print-Head 44

The Artcam unit 1 can utilize any color print technology which is small enough, low enough power, fast enough, high enough quality, and low enough cost, and is compatible with the print roll. Relevant printheads will be specifically discussed hereinafter.

The specifications of the ink jet head are:

Image type Bi-level, dithered
Color CMY Process Color
Resolution 1600 dpi
Print head length ‘Page-width’ (100 mm)
Print speed 2 seconds per photo

Optional Ink Pressure Controller (not Shown)

The function of the ink pressure controller depends upon the type of ink jet print head 44 incorporated in the Artcam. For some types of ink jet, the use of an ink pressure controller can be eliminated, as the ink pressure is simply atmospheric pressure. Other types of print head require a regulated positive ink pressure. In this case, the in pressure controller consists of a pump and pressure transducer.

Other print heads may require an ultrasonic transducer to cause regular oscillations in the ink pressure, typically at frequencies around 100 KHz. In the case, the ACP 31 controls the frequency phase and amplitude of these oscillations.

Paper Transport Motor 36

The paper transport motor 36 moves the paper from within the print roll 42 past the print head at a relatively constant rate. The motor 36 is a miniature motor geared down to an appropriate speed to drive rollers which move the paper. A high quality motor and mechanical gears are required to achieve high image quality, as mechanical rumble or other vibrations will affect the printed dot row spacing.

Paper Transport Motor Driver 60

The motor driver 60 is a small circuit which amplifies the digital motor control signals from the APC 31 to levels suitable for driving the motor 36.

Paper Pull Sensor

A paper pull sensor 50 detects a user's attempt to pull a photo from the camera unit during the printing process. The APC 31 reads this sensor 50, and activates the guillotine 41 if the condition occurs. The paper pull sensor 50 is incorporated to make the camera more ‘foolproof’ in operation. Were the user to pull the paper out forcefully during printing, the print mechanism 44 or print roll 42 may (in extreme cases) be damaged. Since it is acceptable to pull out the ‘pod’ from a Polaroid type camera before it is fully ejected, the public has been ‘trained’ to do this. Therefore, they are unlikely to heed printed instructions not to pull the paper.

The Artcam preferably restarts the photo print process after the guillotine 41 has cut the paper after pull sensing.

The pull sensor can be implemented as a strain gauge sensor, or as an optical sensor detecting a small plastic flag which is deflected by the torque that occurs on the paper drive rollers when the paper is pulled. The latter implementation is recommendation for low cost.

Paper Guillotine Actuator 40

The paper guillotine actuator 40 is a small actuator which causes the guillotine 41 to cut the paper either at the end of a photograph, or when the paper pull sensor 50 is activated.

The guillotine actuator 40 is a small circuit which amplifies a guillotine control signal from the APC tot the level required by the actuator 41.

Artcard 9

The Artcard 9 is a program storage medium for the Artcam unit. As noted previously, the programs are in the form of Vark scripts. Vark is a powerful image processing language especially developed for the Artcam unit. Each Artcard 9 contains one Vark script, and thereby defines one image processing style.

Preferably, the VARK language is highly image processing specific. By being highly image processing specific, the amount of storage required to store the details on the card are substantially reduced. Further, the ease with which new programs can be created, including enhanced effects, is also substantially increased. Preferably, the language includes facilities for handling many image processing functions including image warping via a warp map, convolution, color lookup tables, posterizing an image, adding noise to an image, image enhancement filters, painting algorithms, brush jittering and manipulation edge detection filters, tiling, illumination via light sources, bump maps, text, face detection and object detection attributes, fonts, including three dimensional fonts, and arbitrary complexity pre-rendered icons. Further details of the operation of the Vark language interpreter are contained hereinafter.

Hence, by utilizing the language constructs as defined by the created language, new affects on arbitrary images can be created and constructed for inexpensive storage on Artcard and subsequent distribution to camera owners. Further, on one surface of the card can be provided an example illustrating the effect that a particular VARK script, stored on the other surface of the card, will have on an arbitrary captured image.

By utilizing such a system, camera technology can be distributed without a great fear of obsolescence in that, provided a VARK interpreter is incorporated in the camera device, a device independent scenario is provided whereby the underlying technology can be completely varied over time. Further, the VARK scripts can be updated as new filters are created and distributed in an inexpensive manner, such as via simple cards for card reading.

The Artcard 9 is a piece of thin white plastic with the same format as a credit card (86 mm long by 54 mm wide). The Artcard is printed on both sides using a high resolution ink jet printer. The inkjet printer technology is assumed to be the same as that used in the Artcam, with 1600 dpi (63 dpmm) resolution. A major feature of the Artcard 9 is low manufacturing cost. Artcards can be manufactured at high speeds as a wide web of plastic film. The plastic web is coated on both sides with a hydrophilic dye fixing layer. The web is printed simultaneously on both sides using a ‘pagewidth’ color ink jet printer. The web is then cut and punched into individual cards. On one face of the card is printed a human readable representation of the effect the Artcard 9 will have on the sensed image. This can be simply a standard image which has been processed using the Vark script stored on the back face of the card.

On the back face of the card is printed an array of dots which can be decoded into the Vark script that defines the image processing sequence. The print area is 80 mm×50 mm, giving a total of 15,876,000 dots. This array of dots could represent at least 1.89 Mbytes of data. To achieve high reliability, extensive error detection and correction is incorporated in the array of dots. This allows a substantial portion of the card to be defaced, worn, creased, or dirty with no effect on data integrity. The data coding used is Reed-Solomon coding, with half of the data devoted to error correction. This allows the storage of 967 Kbytes of error corrected data on each Artcard 9.

Linear Image Sensor 34

The Artcard linear sensor 34 converts the aforementioned Artcard data image to electrical signals. As with the area image sensor 2, 4, the linear image sensor can be fabricated using either CCD or APS CMOS technology. The active length of the image sensor 34 is 50 mm, equal to the width of the data array on the Artcard 9. To satisfy Nyquist's sampling theorem, the resolution of the linear image sensor 34 must be at least twice the highest spatial frequency of the Artcard optical image reaching the image sensor. In practice, data detection is easier if the image sensor resolution is substantially above this. A resolution of 4800 dpi (189 dpmm) is chosen, giving a total of 9,450 pixels. This resolution requires a pixel sensor pitch of 5.3 μm. This can readily be achieved by using four staggered rows of 20 μm pixel sensors.

The linear image sensor is mounted in a special package which includes a LED 65 to illuminate the Artcard 9 via a light-pipe (not shown).

The Artcard reader light-pipe can be a molded light-pipe which has several function:

1. It diffuses the light from the LED over the width of the card using total internal reflection facets.

2. It focuses the light onto a 16 μm wide strip of the Artcard 9 using an integrated cylindrical lens.

3. It focuses light reflected from the Artcard onto the linear image sensor pixels using a molded array of microlenses.

The operation of the Artcard reader is explained further hereinafter.

Artcard Reader Motor 37

The Artcard reader motor propels the Artcard past the linear image sensor 34 at a relatively constant rate. As it may not be cost effective to include extreme precision mechanical components in the Artcard reader, the motor 37 is a standard miniature motor geared down to an appropriate speed to drive a pair of rollers which move the Artcard 9. The speed variations, rumble, and other vibrations will affect the raw image data as circuitry within the APC 31 includes extensive compensation for these effects to reliably read the Artcard data.

The motor 37 is driven in reverse when the Artcard is to be ejected.

Artcard Motor Driver 61

The Artcard motor driver 61 is a small circuit which amplifies the digital motor control signals from the APC 31 to levels suitable for driving the motor 37.

Card Insertion Sensor 49

The card insertion sensor 49 is an optical sensor which detects the presence of a card as it is being inserted in the card reader 34. Upon a signal from this sensor 49, the APC 31 initiates the card reading process, including the activation of the Artcard reader motor 37.

Card Eject Button 16

A card eject button 16 (FIG. 1) is used by the user to eject the current Artcard, so that another Artcard can be inserted. The APC 31 detects the pressing of the button, and reverses the Artcard reader motor 37 to eject the card.

Card Status Indicator 66

A card status indicator 66 is provided to signal the user as to the status of the Artcard reading process. This can be a standard bi-color (red/green) LED. When the card is successfully read, and data integrity has been verified, the LED lights up green continually. If the card is faulty, then the LED lights up red.

If the camera is powered from a 1.5 V instead of 3V battery, then the power supply voltage is less than the forward voltage drop of the greed LED, and the LED will not light. In this case, red LEDs can be used, or the LED can be powered from a voltage pump which also powers other circuits in the Artcam which require higher voltage.

64 Mbit DRAM 33

To perform the wide variety of image processing effects, the camera utilizes 8 Mbytes of memory 33. This can be provided by a single 64 Mbit memory chip. Of course, with changing memory technology increased Dram storage sizes may be substituted.

High speed access to the memory chip is required. This can be achieved by using a Rambus DRAM (burst access rate of 500 Mbytes per second) or chips using the new open standards such as double data rate (DDR) SDRAM or Synclink DRAM.

Camera Authentication Chip

The camera authentication chip 54 is identical to the print roll authentication chip 53, except that it has different information stored in it. The camera authentication chip 54 has three main purposes:

1. To provide a secure means of comparing authentication codes with the print roll authentication chip;

2. To provide storage for manufacturing information, such as the serial number of the camera;

3. To provide a small amount of non-volatile memory for storage of user information.

Displays

The Artcam includes an optional color display 5 and small status display 15. Lowest cost consumer cameras may include a color image display, such as a small TFT LCD 5 similar to those found on some digital cameras and camcorders. The color display 5 is a major cost element of these versions of Artcam, and the display 5 plus back light are a major power consumption drain.

Status Display 15

The status display 15 is a small passive segment based LCD, similar to those currently provided on silver halide and digital cameras. Its main function is to show the number of prints remaining in the print roll 42 and icons for various standard camera features, such as flash and battery status.

Color Display 5

The color display 5 is a full motion image display which operates as a viewfinder, as a verification of the image to be printed, and as a user interface display. The cost of the display 5 is approximately proportional to its area, so large displays (say 4″ diagonal) unit will be restricted to expensive versions of the Artcam unit. Smaller displays, such as color camcorder viewfinder TFT's at around 1″, may be effective for mid-range Artcams.

Zoom Lens (not Shown)

The Artcam can include a zoom lens. This can be a standard electronically controlled zoom lens, identical to one which would be used on a standard electronic camera, and similar to pocket camera zoom lenses. A referred version of the Artcam unit may include standard interchangeable 35 mm SLR lenses.

Autofocus Motor 39

The autofocus motor 39 changes the focus of the zoom lens. The motor is a miniature motor geared down to an appropriate speed to drive the autofocus mechanism.

Autofocus Motor Driver 63

The autofocus motor driver 63 is a small circuit which amplifies the digital motor control signals from the APC 31 to levels suitable for driving the motor 39.

Zoom Motor 38

The zoom motor 38 moves the zoom front lenses in and out. The motor is a miniature motor geared down to an appropriate speed to drive the zoom mechanism.

Zoom Motor Driver 62

The zoom motor driver 62 is a small circuit which amplifies the digital motor control signals from the APC 31 to levels suitable for driving the motor.

Communications

The ACP 31 contains a universal serial bus (USB) interface 52 for communication with personal computers. Not all Artcam models are intended to include the USB connector. However, the silicon area required for a USB circuit 52 is small, so the interface can be included in the standard ACP.

Optional Keyboard 57

The Artcam unit may include an optional miniature keyboard 57 for customizing text specified by the Artcard. Any text appearing in an Artcard image may be editable, even if it is in a complex metallic 3D font. The miniature keyboard includes a single line alphanumeric LCD to display the original text and edited text. The keyboard may be a standard accessory.

The ACP 31 contains a serial communications circuit for transferring data to and from the miniature keyboard.

Power Supply

The Artcam unit uses a battery 48. Depending upon the Artcam options, this is either a 3V Lithium cell, 1.5 V AA alkaline cells, or other battery arrangement.

Power Management Unit 51

Power consumption is an important design constraint in the Artcam. It is desirable that either standard camera batteries (such as 3V lithium batters) or standard AA or AAA alkaline cells can be used. While the electronic complexity of the Artcam unit is dramatically higher than 35 mm photographic cameras, the power consumption need not be commensurately higher. Power in the Artcam can be carefully managed with all unit being turned off when not in use.

The most significant current drains are the ACP 31, the area image sensors 2,4, the printer 44 various motors, the flash unit 56, and the optional color display 5 dealing with each part separately:

1. ACP: If fabricated using 0.25 μm CMOS, and running on 1.5V, the ACP power consumption can be quite low. Clocks to various parts of the ACP chip can be quite low. Clocks to various parts of the ACP chip can be turned off when not in use, virtually eliminating standby current consumption. The ACP will only fully used for approximately 4 seconds for each photograph printed.

2. Area image sensor: power is only supplied to the area image sensor when the user has their finger on the button.

3. The printer power is only supplied to the printer when actually printing. This is for around 2 seconds for each photograph. Even so, suitably lower power consumption printing should be used.

4. The motors required in the Artcam are all low power miniature motors, and are typically only activated for a few seconds per photo.

5. The flash unit 45 is only used for some photographs. Its power consumption can readily be provided by a 3V lithium battery for a reasonably battery life.

6. The optional color display 5 is a major current drain for two reasons: it must be on for the whole time that the camera is in use, and a backlight will be required if a liquid crystal display is used. Cameras which incorporate a color display will require a larger battery to achieve acceptable batter life.

Flash Unit 56

The flash unit 56 can be a standard miniature electronic flash for consumer cameras.

Overview of the ACP 31

FIG. 3 illustrates the Artcam Central Processor (ACP) 31 in more detail. The Artcam Central Processor provides all of the processing power for Artcam. It is designed for a 0.25 micron CMOS process, with approximately 1.5 million transistors and an area of around 50 mm2. The ACP 31 is a complex design, but design effort can be reduced by the use of datapath compilation techniques, macrocells, and IP cores. The ACP 31 contains:

The RISC CPU, Direct RAMbus interface 81, CMOS sensor interface 83 and USB serial interface 52 can be vendor supplied cores. The ACP 31 is intended to run at a clock speed of 200 MHz on 3V externally and 1.5V internally to minimize power consumption. The CPU core needs only to run at 100 MHz. The following two block diagrams give two views of the ACP 31:

An example Artcam showing a high-level view of the ACP 31 connected to the rest of the Artcam hardware.

Image Access

As stated previously, the DRAM Interface 81 is responsible for interfacing between other client portions of the ACP chip and the RAMBUS DRAM. In effect, each module within the DRAM Interface is an address generator.

There are three logical types of images manipulated by the ACP. They are:

These images are typically different in color space, resolution, and the output & input color spaces which can vary from camera to camera. For example, a CCD image on a low-end camera may be a different resolution, or have different color characteristics from that used in a high-end camera. However all internal image formats are the same format in terms of color space across all cameras.

In addition, the three image types can vary with respect to which direction is ‘up’. The physical orientation of the camera causes the notion of a portrait or landscape image, and this must be maintained throughout processing. For this reason, the internal image is always oriented correctly, and rotation is performed on images obtained from the CCD and during the print operation.

CPU Core (CPU) 72

The ACP 31 incorporates a 32 bit RISC CPU 72 to run the Vark image processing language interpreter and to perform Artcam's general operating system duties. A wide variety of CPU cores are suitable: it can be any processor core with sufficient processing power to perform the required core calculations and control functions fast enough to met consumer expectations. Examples of suitable cores are: MIPS R4000 core from LSI Logic, StrongARM core. There is no need to maintain instruction set continuity between different Artcam models. Artcard compatibility is maintained irrespective of future processor advances and changes, because the Vark interpreter is simply re-compiled for each new instruction set. The ACP 31 architecture is therefore also free to evolve. Different ACP 31 chip designs may be fabricated by different manufacturers, without requiring to license or port the CPU core. This device independence avoids the chip vendor lock-in such as has occurred in the PC market with Intel. The CPU operates at 100 MHz, with a single cycle time of 10 ns. It must be fast enough to run the Vark interpreter, although the VLIW Vector Processor 74 is responsible for most of the time-critical operations.

Program Cache 72

Although the program code is stored in on-chip Flash memory 70, it is unlikely that well packed Flash memory 70 will be able to operate at the 10 ns cycle time required by the CPU. Consequently a small cache is required for good performance. 16 cache lines of 32 bytes each are sufficient, for a total of 512 bytes. The program cache 72 is defined in the chapter entitled Program cache 72.

Data Cache 76

A small data cache 76 is required for good performance. This requirement is mostly due to the use of a RAMbus DRAM, which can provide high-speed data in bursts, but is inefficient for single byte accesses. The CPU has access to a memory caching system that allows flexible manipulation of CPU data cache 76 sizes. A minimum of 16 cache lines (512 bytes) is recommended for good performance.

CPU Memory Model

An Artcam's CPU memory model consists of a 32 MB area. It consists of 8 MB of physical RDRAM off-chip in the base model of Artcam, with provision for up to 16 MB of off-chip memory. There is a 4 MB Flash memory 70 on the ACP 31 for program storage, and finally a 4 MB address space mapped to the various registers and controls of the ACP 31. The memory map then, for an Artcam is as follows:

Contents Size
Base Artcam DRAM 8 MB
Extended DRAM 8 MB
Program memory (on ACP 31 in Flash memory 70) 4 MB
Reserved for extension of program memory 4 MB
ACP 31 registers and memory-mapped I/O 4 MB
Reserved 4 MB
TOTAL 32 MB 

A straightforward way of decoding addresses is to use address bits 23-24:

The ACP 31 contains a 4 Mbyte Flash memory 70 for storing the Artcam program. It is envisaged that Flash memory 70 will have denser packing coefficients than masked ROM, and allows for greater flexibility for testing camera program code. The downside of the Flash memory 70 is the access time, which is unlikely to be fast enough for the 100 MHz operating speed (10 ns cycle time) of the CPU. A fast Program Instruction cache 77 therefore acts as the interface between the CPU and the slower Flash memory 70.

Program Cache 72

A small cache is required for good CPU performance. This requirement is due to the slow speed Flash memory 70 which stores the Program code. 16 cache lines of 32 bytes each are sufficient, for a total of 512 bytes. The Program cache 72 is a read only cache. The data used by CPU programs comes through the CPU Memory Decoder 68 and if the address is in DRAM, through the general Data cache 76. The separation allows the CPU to operate independently of the VLIW Vector Processor 74. If the data requirements are low for a given process, it can consequently operate completely out of cache.

Finally, the Program cache 72 can be read as data by the CPU rather than purely as program instructions. This allows tables, microcode for the VLIW etc to be loaded from the Flash memory 70. Addresses with bit 24 set and bit 23 clear are satisfied from the Program cache 72.

CPU Memory Decoder 68

The CPU Memory Decoder 68 is a simple decoder for satisfying CPU data accesses. The Decoder translates data addresses into internal ACP register accesses over the internal low speed bus, and therefore allows for memory mapped I/O of ACP registers. The CPU Memory Decoder 68 only interprets addresses that have bit 24 set and bit 23 clear. There is no caching in the CPU Memory Decoder 68.

DRAM Interface 81

The DRAM used by the Artcam is a single channel 64 Mbit (8 MB) RAMbus RDRAM operating at 1.6 GB/sec. RDRAM accesses are by a single channel (16-bit data path) controller. The RDRAM also has several useful operating modes for low power operation. Although the Rambus specification describes a system with random 32 byte transfers as capable of achieving a greater than 95% efficiency, this is not true if only part of the 32 bytes are used. Two reads followed by two writes to the same device yields over 86% efficiency. The primary latency is required for bus turn-around going from a Write to a Read, and since there is a Delayed Write mechanism, efficiency can be further improved. With regards to writes, Write Masks allow specific subsets of bytes to be written to. These write masks would be set via internal cache “dirty bits”. The upshot of the Rambus Direct RDRAM is a throughput of >1 GB/sec is easily achievable, and with multiple reads for every write (most processes) combined with intelligent algorithms making good use of 32 byte transfer knowledge, transfer rates of >1.3 GB/sec are expected. Every 10 ns, 16 bytes can be transferred to or from the core.

Data Cache 76

The ACP 31 contains a dedicated CPU instruction cache 77 and a general data cache 76. The Data cache 76 handles all DRAM requests (reads and writes of data) from the CPU, the VLIW Vector Processor 74, and the Display Controller 88. These requests may have very different profiles in terms of memory usage and algorithmic timing requirements. For example, a VLIW process may be processing an image in linear memory, and lookup a value in a table for each value in the image. There is little need to cache much of the image, but it may be desirable to cache the entire lookup table so that no real memory access is required. Because of these differing requirements, the Data cache 76 allows for an intelligent definition of caching.

Although the Rambus DRAM interface 81 is capable of very high-speed memory access (an average throughput of 32 bytes in 25 ns), it is not efficient dealing with single byte requests. In order to reduce effective memory latency, the ACP 31 contains 128 cache lines. Each cache line is 32 bytes wide. Thus the total amount of data cache 76 is 4096 bytes (4 KB). The 128 cache lines are configured into 16 programmable-sized groups. Each of the 16 groups must be a contiguous set of cache lines. The CPU is responsible for determining how many cache lines to allocate to each group. Within each group cache lines are filled according to a simple Least Recently Used algorithm. In terms of CPU data requests, the Data cache 76 handles memory access requests that have address bit 24 clear. If bit 24 is clear, the address is in the lower 16 MB range, and hence can be satisfied from DRAM and the Data cache 76. In most cases the DRAM will only be 8 MB, but 16 MB is allocated to cater for a higher memory model Artcam. If bit 24 is set, the address is ignored by the Data cache 76.

All CPU data requests are satisfied from Cache Group 0. A minimum of 16 cache lines is recommended for good CPU performance, although the CPU can assign any number of cache lines (except none) to Cache Group 0. The remaining Cache Groups (1 to 15) are allocated according to the current requirements. This could mean allocation to a VLIW Vector Processor 74 program or the Display Controller 88. For example, a 256 byte lookup table required to be permanently available would require 8 cache lines. Writing out a sequential image would only require 2-4 cache lines (depending on the size of record being generated and whether write requests are being Write Delayed for a significant number of cycles). Associated with each cache line byte is a dirty bit, used for creating a Write Mask when writing memory to DRAM. Associated with each cache line is another dirty bit, which indicates whether any of the cache line bytes has been written to (and therefore the cache line must be written back to DRAM before it can be reused). Note that it is possible for two different Cache Groups to be accessing the same address in memory and to get out of sync. The VLIW program writer is responsible to ensure that this is not an issue. It could be perfectly reasonable, for example, to have a Cache Group responsible for reading an image, and another Cache Group responsible for writing the changed image back to memory again. If the images are read or written sequentially there may be advantages in allocating cache lines in this manner. A total of 8 buses 182 connect the VLIW Vector Processor 74 to the Data cache 76. Each bus is connected to an I/O Address Generator. (There are 2 I/O Address Generators 189, 190 per Processing Unit 178, and there are 4 Processing Units in the VLIW Vector Processor 74. The total number of buses is therefore 8.)

In any given cycle, in addition to a single 32 bit (4 byte) access to the CPU's cache group (Group 0), 4 simultaneous accesses of 16 bits (2 bytes) to remaining cache groups are permitted on the 8 VLIW Vector Processor 74 buses. The Data cache 76 is responsible for fairly processing the requests. On a given cycle, no more than 1 request to a specific Cache Group will be processed. Given that there are 8 Address Generators 189, 190 in the VLIW Vector Processor 74, each one of these has the potential to refer to an individual Cache Group. However it is possible and occasionally reasonable for 2 or more Address Generators 189, 190 to access the same Cache Group. The CPU is responsible for ensuring that the Cache Groups have been allocated the correct number of cache lines, and that the various Address Generators 189, 190 in the VLIW Vector Processor 74 reference the specific Cache Groups correctly.

The Data cache 76 as described allows for the Display Controller 88 and VLIW Vector Processor 74 to be active simultaneously. If the operation of these two components were deemed to never occur simultaneously, a total 9 Cache Groups would suffice. The CPU would use Cache Group 0, and the VLIW Vector Processor 74 and the Display Controller 88 would share the remaining 8 Cache Groups, requiring only 3 bits (rather than 4) to define which Cache Group would satisfy a particular request.

JTAG Interface 85

A standard JTAG (Joint Test Action Group) Interface is included in the ACP 31 for testing purposes. Due to the complexity of the chip, a variety of testing techniques are required, including BIST (Built In Self Test) and functional block isolation. An overhead of 10% in chip area is assumed for overall chip testing circuitry. The test circuitry is beyond the scope of this document.

Serial Interfaces

USB Serial Port Interface 52

This is a standard USB serial port, which is connected to the internal chip low speed bus, thereby allowing the CPU to control it.

Keyboard Interface 65

This is a standard low-speed serial port, which is connected to the internal chip low speed bus, thereby allowing the CPU to control it. It is designed to be optionally connected to a keyboard to allow simple data input to customize prints.

Authentication Chip Serial Interfaces 64

These are 2 standard low-speed serial ports, which are connected to the internal chip low speed bus, thereby allowing the CPU to control them. The reason for having 2 ports is to connect to both the on-camera Authentication chip, and to the print-roll Authentication chip using separate lines. Only using 1 line may make it possible for a clone print-roll manufacturer to design a chip which, instead of generating an authentication code, tricks the camera into using the code generated by the authentication chip in the camera.

Parallel Interface 67

The parallel interface connects the ACP 31 to individual static electrical signals. The CPU is able to control each of these connections as memory-mapped I/O via the low speed bus The following table is a list of connections to the parallel interface:

Connection Direction Pins
Paper transport stepper motor Out 4
Artcard stepper motor Out 4
Zoom stepper motor Out 4
Guillotine motor Out 1
Flash trigger Out 1
Status LCD segment drivers Out 7
Status LCD common drivers Out 4
Artcard illumination LED Out 1
Artcard status LED (red/green) In 2
Artcard sensor In 1
Paper pull sensor In 1
Orientation sensor In 2
Buttons In 4
TOTAL 36

VLIW Input and Output FIFOs 78, 79

The VLIW Input and Output FIFOs are 8 bit wide FIFOs used for communicating between processes and the VLIW Vector Processor 74. Both FIFOs are under the control of the VLIW Vector Processor 74, but can be cleared and queried (e.g. for status) etc by the CPU.

VLIW Input FIFO 78

A client writes 8-bit data to the VLIW Input FIFO 78 in order to have the data processed by the VLIW Vector Processor 74. Clients include the Image Sensor Interface, Artcard Interface, and CPU. Each of these processes is able to offload processing by simply writing the data to the FIFO, and letting the VLIW Vector Processor 74 do all the hard work. An example of the use of a client's use of the VLIW Input FIFO 78 is the Image Sensor Interface (ISI 83). The ISI 83 takes data from the Image Sensor and writes it to the FIFO. A VLIW process takes it from the FIFO, transforming it into the correct image data format, and writing it out to DRAM. The ISI 83 becomes much simpler as a result.

VLIW Output FIFO 79

The VLIW Vector Processor 74 writes 8-bit data to the VLIW Output FIFO 79 where clients can read it. Clients include the Print Head Interface and the CPU. Both of these clients is able to offload processing by simply reading the already processed data from the FIFO, and letting the VLIW Vector Processor 74 do all the hard work. The CPU can also be interrupted whenever data is placed into the VLIW Output FIFO 79, allowing it to only process the data as it becomes available rather than polling the FIFO continuously. An example of the use of a client's use of the VLIW Output FIFO 79 is the Print Head Interface (PHI 62). A VLIW process takes an image, rotates it to the correct orientation, color converts it, and dithers the resulting image according to the print head requirements. The PHI 62 reads the dithered formatted 8-bit data from the VLIW Output FIFO 79 and simply passes it on to the Print Head external to the ACP 31. The PHI 62 becomes much simpler as a result.

VLIW Vector Processor 74

To achieve the high processing requirements of Artcam, the ACP 31 contains a VLIW (Very Long Instruction Word) Vector Processor. The VLIW processor is a set of 4 identical Processing Units (PU e.g 178) working in parallel, connected by a crossbar switch 183. Each PU e.g 178 can perform four 8-bit multiplications, eight 8-bit additions, three 32-bit additions, I/O processing, and various logical operations in each cycle. The PUs e.g 178 are microcoded, and each has two Address Generators 189, 190 to allow full use of available cycles for data processing. The four PUs e.g 178 are normally synchronized to provide a tightly interacting VLIW processor. Clocking at 200 MHz, the VLIW Vector Processor 74 runs at 12 Gops (12 billion operations per second). Instructions are tuned for image processing functions such as warping, artistic brushing, complex synthetic illumination, color transforms, image filtering, and compositing. These are accelerated by two orders of magnitude over desktop computers.

As shown in more detail in FIG. 3(a), the VLIW Vector Processor 74 is 4 PUs e.g 178 connected by a crossbar switch 183 such that each PU e.g 178 provides two inputs to, and takes two outputs from, the crossbar switch 183. Two common registers form a control and synchronization mechanism for the PUs e.g 178. 8 Cache buses 182 allow connectivity to DRAM via the Data cache 76, with 2 buses going to each PU e.g 178 (1 bus per I/O Address Generator).

Each PU e.g 178 consists of an ALU 188 (containing a number of registers & some arithmetic logic for processing data), some microcode RAM 196, and connections to the outside world (including other ALUs). A local PU state machine runs in microcode and is the means by which the PU e.g 178 is controlled. Each PU e.g 178 contains two I/O Address Generators 189, 190 controlling data flow between DRAM (via the Data cache 76) and the ALU 188 (via Input FIFO and Output FIFO). The address generator is able to read and write data (specifically images in a variety of formats) as well as tables and simulated FIFOs in DRAM. The formats are customizable under software control, but are not microcoded. Data taken from the Data cache 76 is transferred to the ALU 188 via the 16-bit wide Input FIFO. Output data is written to the 16-bit wide Output FIFO and from there to the Data cache 76. Finally, all PUs e.g 178 share a single 8-bit wide VLIW Input FIFO 78 and a single 8-bit wide VLIW Output FIFO 79. The low speed data bus connection allows the CPU to read and write registers in the PU e.g 178, update microcode, as well as the common registers shared by all PUs e.g 178 in the VLIW Vector Processor 74. Turning now to FIG. 4, a closer detail of the internals of a single PU e.g 178 can be seen, with components and control signals detailed in subsequent hereinafter:

Microcode

Each PU e.g 178 contains a microcode RAM 196 to hold the program for that particular PU e.g 178. Rather than have the microcode in ROM, the microcode is in RAM, with the CPU responsible for loading it up. For the same space on chip, this tradeoff reduces the maximum size of any one function to the size of the RAM, but allows an unlimited number of functions to be written in microcode. Functions implemented using microcode include Vark acceleration, Artcard reading, and Printing. The VLIW Vector Processor 74 scheme has several advantages for the case of the ACP 31:

Size and Content

The CPU loaded microcode RAM 196 for controlling each PU e.g 178 is 128 words, with each word being 96 bits wide. A summary of the microcode size for control of various units of the PU e.g 178 is listed in the following table:

Process Block Size (bits)
Status Output 3
Branching (microcode control) 11
In 8
Out 6
Registers 7
Read 10
Write 6
Barrel Shifter 12
Adder/Logical 14
Multiply/Interpolate 19
TOTAL 96

With 128 instruction words, the total microcode RAM 196 per PU e.g 178 is 12,288 bits, or 1.5 KB exactly. Since the VLIW Vector Processor 74 consists of 4 identical PUs e.g 178 this equates to 6,144 bytes, exactly 6 KB. Some of the bits in a microcode word are directly used as control bits, while others are decoded. See the various unit descriptions that detail the interpretation of each of the bits of the microcode word.

Synchronization Between PUs e.g 178

Each PU e.g 178 contains a 4 bit Synchronization Register 197. It is a mask used to determine which PUs e.g 178 work together, and has one bit set for each of the corresponding PUs e.g 178 that are functioning as a single process. For example, if all of the PUs e.g 178 were functioning as a single process, each of the 4 Synchronization Register 197s would have all 4 bits set. If there were two asynchronous processes of 2 PUs e.g 178 each, two of the PUs e.g 178 would have 2 bits set in their Synchronization Register 197s (corresponding to themselves), and the other two would have the other 2 bits set in their Synchronization Register 197s (corresponding to themselves).

The Synchronization Register 197 is used in two basic ways:

The CPU is responsible for loading the microcode RAM 196 and loading the execution address for the first instruction (usually 0). When the CPU starts executing microcode, it begins at the specified address.

Execution of microcode only occurs when all the bits of the Synchronization Register 197 are also set in the Common Synchronization Register 197. The CPU therefore sets up all the PUs e.g 178 and then starts or stops processes with a single write to the Common Synchronization Register 197.

This synchronization scheme allows multiple processes to be running asynchronously on the PUs e.g 178, being stopped and started as processes rather than one PU e.g 178 at a time.

Suspending Execution within a Process

In a given cycle, a PU e.g 178 may need to read from or write to a FIFO (based on the opcode of the current microcode instruction). If the FIFO is empty on a read request, or full on a write request, the FIFO request cannot be completed. The PU e.g 178 will therefore assert its SuspendProcess control signal 198. The SuspendProcess signals from all PUs e.g 178 are fed back to all the PUs e.g 178. The Synchronization Register 197 is ANDed with the 4 SuspendProcess bits, and if the result is non-zero, none of the PU e.g 178's register WriteEnables or FIFO strobes will be set. Consequently none of the PUs e.g 178 that form the same process group as the PU e.g 178 that was unable to complete its task will have their registers or FIFOs updated during that cycle. This simple technique keeps a given process group in synchronization. Each subsequent cycle the PU e.g 178's state machine will attempt to re-execute the microcode instruction at the same address, and will continue to do so until successful. Of course the Common Synchronization Register 197 can be written to by the CPU to stop the entire process if necessary. This synchronization scheme allows any combinations of PUs e.g 178 to work together, each group only affecting its co-workers with regards to suspension due to data not being ready for reading or writing.

Control and Branching

During each cycle, each of the four basic input and calculation units within a PU e.g 178's ALU 188 (Read, Adder/Logic, Multiply/Interpolate, and Barrel Shifter) produces two status bits: a Zero flag and a Negative flag indicating whether the result of the operation during that cycle was 0 or negative. Each cycle one of those 4 status bits is chosen by microcode instructions to be output from the PU e.g 178. The 4 status bits (1 per PU e.g 178's ALU 188) are combined into a 4 bit Common Status Register 200. During the next cycle, each PU e.g 178's microcode program can select one of the bits from the Common Status Register 200, and branch to another microcode address dependant on the value of the status bit.

Status Bit

Each PU e.g 178's ALU 188 contains a number of input and calculation units. Each unit produces 2 status bits—a negative flag and a zero flag. One of these status bits is output from the PU e.g 178 when a particular unit asserts the value on the 1-bit tri-state status bit bus. The single status bit is output from the PU e.g 178, and then combined with the other PU e.g 178 status bits to update the Common Status Register 200. The microcode for determining the output status bit takes the following form:

# Bits Description
2 Select unit whose status bit is to be output
00 = Adder unit
01 = Multiply/Logic unit
10 = Barrel Shift unit
11 = Reader unit
1 0 = Zero flag
1 = Negative flag
3 TOTAL

Within the ALU 188, the 2-bit Select Processor Block value is decoded into four 1-bit enable bits, with a different enable bit sent to each processor unit block. The status select bit (choosing Zero or Negative) is passed into all units to determine which bit is to be output onto the status bit bus.

Branching Within Microcode

Each PU e.g 178 contains a 7 bit Program Counter (PC) that holds the current microcode address being executed. Normal program execution is linear, moving from address N in one cycle to address N+1 in the next cycle. Every cycle however, a microcode program has the ability to branch to a different location, or to test a status bit from the Common Status Register 200 and branch. The microcode for determining the next execution address takes the following form:

# Bits Description
2 00 = NOP (PC = PC + 1)
01 = Branch always
10 = Branch if status bit clear
11 = Branch if status bit set
2 Select status bit from status word
7 Address to branch to (absolute address,
00-7F)
11 TOTAL

ALU 188

FIG. 5 illustrates the ALU 188 in more detail. Inside the ALU 188 are a number of specialized processing blocks, controlled by a microcode program. The specialized processing blocks include:

Four specialized 32 bit registers hold the results of the 4 main processing blocks:

In addition there are two internal crossbar switches 213m 214 for data transport. The various process blocks are further expanded in the following sections, together with the microcode definitions that pertain to each block. Note that the microcode is decoded within a block to provide the control signals to the various units within.

Data Transfers Between PUs e.g 178

Each PU e.g 178 is able to exchange data via the external crossbar. A PU e.g 178 takes two inputs and outputs two values to the external crossbar. In this way two operands for processing can be obtained in a single cycle, but cannot be actually used in an operation until the following cycle.

In 207

This block is illustrated in FIG. 6 and contains two registers, In1 and In2 that accept data from the external crossbar. The registers can be loaded each cycle, or can remain unchanged. The selection bits for choosing from among the 8 inputs are output to the external crossbar switch 183. The microcode takes the following form:

# Bits Description
1 0 = NOP
1 = Load In1 from crossbar
3 Select Input 1 from external crossbar
1 0 = NOP
1 = Load In2 from crossbar
3 Select Input 2 from external crossbar
8 TOTAL

Out 208

Complementing In is Out 208. The Out block is illustrated in more detail in FIG. 7. Out contains two registers, Out1 and Out2, both of which are output to the external crossbar each cycle for use by other PUs e.g 178. The Write unit is also able to write one of Out1 or Out2 to one of the output FIFOs attached to the ALU 188. Finally, both registers are available as inputs to Crossbar1 213, which therefore makes the register values available as inputs to other units within the ALU 188. Each cycle either of the two registers can be updated according to microcode selection. The data loaded into the specified register can be one of D0-D3 (selected from Crossbar1 213) one of M, L, S, and R (selected from Crossbar2 214), one of 2 programmable constants, or the fixed values 0 or 1. The microcode for Out takes the following form:

# Bits Description
1 0 = NOP
1 = Load Register
1 Select Register to load [Out1 or Out2]
4 Select input
[In1, In2, Out1, Out2, D0, D1, D2, D3, M, L, S, R, K1, K2, 0, 1]
6 TOTAL

Local Registers and Data Transfers within ALU 188

As noted previously, the ALU 188 contains four specialized 32-bit registers to hold the results of the 4 main processing blocks:

The CPU has direct access to these registers, and other units can select them as inputs via Crossbar2 214. Sometimes it is necessary to delay an operation for one or more cycles. The Registers block contains four 32-bit registers D0-D3 to hold temporary variables during processing. Each cycle one of the registers can be updated, while all the registers are output for other units to use via Crossbar1 213 (which also includes In1, In2, Out1 and Out2). The CPU has direct access to these registers. The data loaded into the specified register can be one of D0-D3 (selected from Crossbar1 213) one of M, L, S, and R (selected from Crossbar2 214), one of 2 programmable constants, or the fixed values 0 or 1. The Registers block 215 is illustrated in more detail in FIG. 8. The microcode for Registers takes the following form:

# Bits Description
1 0 = NOP
1 = Load Register
2 Select Register to load [D0-D3]
4 Select input
[In1, In2, Out1, Out2, D0, D1, D2, D3, M, L, S, R, K1, K2, 0, 1]
7 TOTAL

Crossbar1 213

Crossbar1 213 is illustrated in more detail in FIG. 9. Crossbar1 213 is used to select from inputs In1, In2, Out1, Out2, D0-D3. 7 outputs are generated from Crossbar1 213: 3 to the Multiply/Interpolate Unit, 2 to the Adder Unit, 1 to the Registers unit and 1 to the Out unit. The control signals for Crossbar1 213 come from the various units that use the Crossbar inputs. There is no specific microcode that is separate for Crossbar1 213.

Crossbar2 214

Crossbar2 214 is illustrated in more detail in FIG. 10. Crossbar2 214 is used to select from the general ALU 188 registers M, L, S and R. 6 outputs are generated from Crossbar1 213: 2 to the Multiply/Interpolate Unit, 2 to the Adder Unit, 1 to the Registers unit and 1 to the Out unit. The control signals for Crossbar2 214 come from the various units that use the Crossbar inputs. There is no specific microcode that is separate for Crossbar2 214.

Data Transfers Between PUs e.g 178 and DRAM or External Processes

Returning to FIG. 4, PUs e.g 178 share data with each other directly via the external crossbar. They also transfer data to and from external processes as well as DRAM. Each PU e.g 178 has 2 I/O Address Generators 189, 190 for transferring data to and from DRAM. A PU e.g 178 can send data to DRAM via an I/O Address Generator's Output FIFO e.g. 186, or accept data from DRAM via an I/O Address Generator's Input FIFO 187. These FIFOs are local to the PU e.g 178. There is also a mechanism for transferring data to and from external processes in the form of a common VLIW Input FIFO 78 and a common VLIW Output FIFO 79, shared between all ALUs. The VLIW Input and Output FIFOs are only 8 bits wide, and are used for printing, Artcard reading, transferring data to the CPU etc. The local Input and Output FIFOs are 16 bits wide.

Read

The Read process block 202 of FIG. 5 is responsible for updating the ALU 188's R register 209, which represents the external input data to a VLIW microcoded process. Each cycle the Read Unit is able to read from either the common VLIW Input FIFO 78 (8 bits) or one of two local Input FIFOs (16 bits). A 32-bit value is generated, and then all or part of that data is transferred to the R register 209. The process can be seen in FIG. 11. The microcode for Read is described in the following table. Note that the interpretations of some bit patterns are deliberately chosen to aid decoding.

# Bits Description
2 00 = NOP
01 = Read from VLIW Input FIFO 78
10 = Read from Local FIFO 1
11 = Read from Local FIFO 2
1 How many significant bits
0 = 8 bits (pad with 0 or sign extend)
1 = 16 bits (only valid for Local FIFO reads)
1 0 = Treat data as unsigned (pad with 0)
1 = Treat data as signed (sign extend when reading
from FIFO)r
2 How much to shift data left by:
00 = 0 bits (no change)
01 = 8 bits
10 = 16 bits
11 = 24 bits
4 Which bytes of R to update (hi to lo order byte)
Each of the 4 bits represents 1 byte WriteEnable on R
10 TOTAL

Write

The Write process block is able to write to either the common VLIW Output FIFO 79 or one of the two local Output FIFOs each cycle. Note that since only 1 FIFO is written to in a given cycle, only one 16-bit value is output to all FIFOs, with the low 8 bits going to the VLIW Output FIFO 79. The microcode controls which of the FIFOs gates in the value. The process of data selection can be seen in more detail in FIG. 12. The source values Out1 and Out2 come from the Out block. They are simply two registers. The microcode for Write takes the following form:

# Bits Description
2 00 = NOP
01 = Write VLIW Output FIFO 79
10 = Write local Output FIFO 1
11 = Write local Output FIFO 2
1 Select Output Value [Out1 or Out2]
3 Select part of Output Value to write (32 bits = 4 bytes ABCD)
000 = 0D
001 = 0D
010 = 0B
011 = 0A
100 = CD
101 = BC
110 = AB
111 = 0
6 TOTAL

Computational Blocks

Each ALU 188 has two computational process blocks, namely an Adder/Logic process block 204, and a Multiply/Interpolate process block 205. In addition there is a Barrel Shifter block to provide help to these computational blocks. Registers from the Registers block 215 can be used for temporary storage during pipelined operations.

Barrel Shifter

The Barrel Shifter process block 206 is shown in more detail in FIG. 13 and takes its input from the output of Adder/Logic or Multiply/Interpolate process blocks or the previous cycle's results from those blocks (ALU registers L and M). The 32 bits selected are barrel shifted an arbitrary number of bits in either direction (with sign extension as necessary), and output to the ALU 188's S register 209. The microcode for the Barrel Shift process block is described in the following table. Note that the interpretations of some bit patterns are deliberately chosen to aid decoding.

# Bits Description
3 000 = NOP
001 = Shift Left (unsigned)
010 = Reserved
011 = Shift Left (signed)
100 = Shift right (unsigned, no rounding)
101 = Shift right (unsigned, with rounding)
110 = Shift right (signed, no rounding)
111 = Shift right (signed, with rounding)
2 Select Input to barrel shift:
00 = Multiply/Interpolate result
01 = M
10 = Adder/Logic result
11 = L
5 # bits to shift
1 Ceiling of 255
1 Floor of 0 (signed data)
12 TOTAL

Adder/Logic 204

The Adder/Logic process block is shown in more detail in FIG. 14 and is designed for simple 32-bit addition/subtraction, comparisons, and logical operations. In a single cycle a single addition, comparison, or logical operation can be performed, with the result stored in the ALU 188's L register 209. There are two primary operands, A and B, which are selected from either of the two crossbars or from the 4 constant registers. One crossbar selection allows the results of the previous cycle's arithmetic operation to be used while the second provides access to operands previously calculated by this or another ALU 188. The CPU is the only unit that has write access to the four constants (K1-K4). In cases where an operation such as (A+B)×4 is desired, the direct output from the adder can be used as input to the Barrel Shifter, and can thus be shifted left 2 places without needing to be latched into the L register 209 first. The output from the adder can also be made available to the multiply unit for a multiply-accumulate operation. The microcode for the Adder/Logic process block is described in the following table. The interpretations of some bit patterns are deliberately chosen to aid decoding. Microcode bit interpretation for Adder/Logic unit

#
Bits Description
4 0000 = A + B (carry in = 0)
0001 = A + B (carry in = carry out of previous operation)
0010 = A + B + 1 (carry in = 1)
0011 = A + 1 (increments A)
0100 = A − B − 1 (carry in = 0)
0101 = A − B (carry in = carry out of previous operation)
0110 = A − B (carry in = 1)
0111 = A − 1 (decrements A)
1000 = NOP
1001 = ABS(A − B)
1010 = MIN(A, B)
1011 = MAX(A, B)
1100 = A AND B (both A & B can be inverted, see below)
1101 = A OR B (both A & B can be inverted, see below)
1110 = A XOR B (both A & B can be inverted, see below)
1111 = A (A can be inverted, see below)
1 If logical operation:
0 = A = A
1 = A = NOT(A)
If Adder operation:
0 = A is unsigned
1 = A is signed
1 If logical operation:
0 = B = B
1 = B = NOT(B)
If Adder operation
0 = B is unsigned
1 = B is signed
4 Select A
[In1, In2, Out1, Out2, D0, D1, D2, D3, M, L, S, R, K1, K2, K3, K4]
4 Select B
[In1, In2, Out1, Out2, D0, D1, D2, D3, M, L, S, R, K1, K2, K3, K4]
14 TOTAL

Multiply/Interpolate 205

The Multiply/Interpolate process block is shown in more detail in FIG. 15 and is a set of four 8×8 interpolator units that are capable of performing four individual 8×8 interpolates per cycle, or can be combined to perform a single 16×16 multiply. This gives the possibility to perform up to 4 linear interpolations, a single bi-linear interpolation, or half of a tri-linear interpolation in a single cycle. The result of the interpolations or multiplication is stored in the ALU 188's M register 209. There are two primary operands, A and B, which are selected from any of the general registers in the ALU 188 or from four programmable constants internal to the Multiply/Interpolate process block. Each interpolator block functions as a simple 8 bit interpolator [result=A+(B−A)f] or as a simple 8×8 multiply [result=A*B]. When the operation is interpolation, A and B are treated as four 8 bit numbers A0 thru A3 (A0 is the low order byte), and B0 thru B3. Agen, Bgen, and Fgen are responsible for ordering the inputs to the Interpolate units so that they match the operation being performed. For example, to perform bilinear interpolation, each of the 4 values must be multiplied by a different factor & the result summed, while a 16×16 bit multiplication requires the factors to be 0. The microcode for the Adder/Logic process block is described in the following table. Note that the interpretations of some bit patterns are deliberately chosen to aid decoding.

# Bits Description
4 0000 = (A10 * B10) + V
0001 = (A0 * B0) + (A1 * B1) + V
0010 = (A10 * B10) − V
0011 = V − (A10 * B10)
0100 = Interpolate A0, B0 by f0
0101 = Interpolate A0, B0 by f0, A1, B1 by f1
0110 = Interpolate A0, B0 by f0, A1, B1 by f1, A2, B2 by f2
0111 = Interpolate A0, B0 by f0, A1, B1 by f1, A2, B2 by f2, A3,
B3 by f3
1000 = Interpolate 16 bits stage 1 [M = A10 * f10]
1001 = Interpolate 16 bits stage 2 [M = M + (A10 * f10)]
1010 = Tri-linear interpolate A by f stage 1
[M = A0f0 + A1f1 + A2f2 + A3f3]
1011 = Tri-linear interpolate A by f stage 2
[M = M + A0f0 + A1f1 + A2f2 + A3f3]
1100 = Bi-linear interpolate A by f stage 1 [M = A0f0 + A1f1]
1101 = Bi-linear interpolate A by f stage 2 [M = M + A0f0 +
A1f1]
1110 = Bi-linear interpolate A by f complete
[M = A0f0 + A1f1 + A2f2 + A3f3]
1111 = NOP
4 Select A [In1, In2, Out1, Out2, D0, D1, D2, D3, M, L, S, R, K1,
K2, K3, K4]
4 Select B [In1, In2, Out1, Out2, D0, D1, D2, D3, M, L, S, R, K1,
K2, K3, K4]
If
Mult:
4 Select V [In1, In2, Out1, Out2, D0, D1, D2, D3, K1, K2, K3, K4,
Adder result, M, 0, 1]
1 Treat A as signed
1 Treat B as signed
1 Treat V as signed
If
Interp:
4 Select basis for f
[In1, In2, Out1, Out2, D0, D1, D2, D3, K1, K2, K3, K4, X, X,
X, X]
1 Select interpolation f generation from P1 or P2
Pn is interpreted as # fractional bits in f
If Pn = 0, f is range 0 . . . 255 representing 0. . . 1
2 Reserved
19  TOTAL

The same 4 bits are used for the selection of V and f, although the last 4 options for V don't generally make sense as f values. Interpolating with a factor of 1 or 0 is pointless, and the previous multiplication or current result is unlikely to be a meaningful value for f.

I/O Address Generators 189, 190

The I/O Address Generators are shown in more detail in FIG. 16. A VLIW process does not access DRAM directly. Access is via 2 I/O Address Generators 189, 190, each with its own Input and Output FIFO. A PU e.g 178 reads data from one of two local Input FIFOs, and writes data to one of two local Output FIFOs. Each I/O Address Generator is responsible for reading data from DRAM and placing it into its Input FIFO, where it can be read by the PU e.g 178, and is responsible for taking the data from its Output FIFO (placed there by the PU e.g 178) and writing it to DRAM. The I/O Address Generator is a state machine responsible for generating addresses and control for data retrieval and storage in DRAM via the Data cache 76. It is customizable under CPU software control, but cannot be microcoded. The address generator produces addresses in two broad categories:

Each of the I/O Address Generators 189, 190 has its own bus connection to the Data cache 76, making 2 bus connections per PU e.g 178, and a total of 8 buses over the entire VLIW Vector Processor 74. The Data cache 76 is able to service 4 of the maximum 8 requests from the 4 PUs e.g 178 each cycle. The Input and Output FIFOs are 8 entry deep 16-bit wide FIFOs. The various types of address generation (Image Iterators and Table I/O) are described in the subsequent sections.

Registers

The I/O Address Generator has a set of registers for that are used to control address generation. The addressing mode also determines how the data is formatted and sent into the local Input FIFO, and how data is interpreted from the local Output FIFO. The CPU is able to access the registers of the I/O Address Generator via the low speed bus. The first set of registers define the housekeeping parameters for the I/O Generator:

Register Name # bits Description
Reset 0 A write to this register halts any operations,
and writes 0s to all the data registers of the
I/O Generator. The input and output
FIFOs are not cleared.
Go 0 A write to this register restarts the counters
according to the current setup. For example,
if the I/O Generator is a Read Iterator,
and the Iterator is currently halfway through
the image, a write to Go will cause the
reading to begin at the start of the image
again. While the I/O Generator is
performing, the Active bit of the
Status register will be set.
Halt 0 A write to this register stops any current
activity and clears the Active bit of the Status
register. If the Active bit is already cleared,
writing to this register has no effect.
Continue 0 A write to this register continues the I/O
Generator from the current setup. Counters
are not reset, and FIFOs are not cleared.
A write to this register while the I/O Generator
is active has no effect.
ClearFIFOsOnGo 1 0 = Don't clear FIFOs on a write to the Go bit.
1 = Do clear FIFOs on a write to the Go bit.
Status 8 Status flags

The Status Register has the Following Values

Register Name # bits Description
Active 1 0 = Currently inactive
1 = Currently active
Reserved 7

Caching

Several registers are used to control the caching mechanism, specifying which cache group to use for inputs, outputs etc. See the section on the Data cache 76 for more information about cache groups.

Register Name # bits Description
CacheGroup1 4 Defines cache group to read data from
CacheGroup2 4 Defines which cache group to write data to, and
in the case of the ImagePyramidLookup I/O
mode, defines the cache to use for reading
the Level Information Table.

Image Iterators=Sequential Automatic Access to Pixels

The primary image pixel access method for software and hardware algorithms is via Image Iterators. Image iterators perform all of the addressing and access to the caches of the pixels within an image channel and read, write or read & write pixels for their client. Read Iterators read pixels in a specific order for their clients, and Write Iterators write pixels in a specific order for their clients. Clients of Iterators read pixels from the local Input FIFO or write pixels via the local Output FIFO. Read Image Iterators read through an image in a specific order, placing the pixel data into the local Input FIFO. Every time a client reads a pixel from the Input FIFO, the Read Iterator places the next pixel from the image (via the Data cache 76) into the FIFO.

Write Image Iterators write pixels in a specific order to write out the entire image. Clients write pixels to the Output FIFO that is in turn read by the Write Image Iterator and written to DRAM via the Data cache 76.

Typically a VLIW process will have its input tied to a Read Iterator, and output tied to a corresponding Write Iterator. From the PU e.g 178 microcode program's perspective, the FIFO is the effective interface to DRAM. The actual method of carrying out the storage (apart from the logical ordering of the data) is not of concern. Although the FIFO is perceived to be effectively unlimited in length, in practice the FIFO is of limited length, and there can be delays storing and retrieving data, especially if several memory accesses are competing. A variety of Image Iterators exist to cope with the most common addressing requirements of image processing algorithms. In most cases there is a corresponding Write Iterator for each Read Iterator. The different Iterators are listed in the following table:

Read Iterators Write Iterators
Sequential Read Sequential Write
Box Read
Vertical Strip Read Vertical Strip Write

The 4 Bit Address Mode Register is Used to Determine the Iterator Type:

Bit # Address Mode
3 0 = This addressing mode is an Iterator
2 to 0 Iterator Mode
001 = Sequential Iterator
010 = Box [read only]
100 = Vertical Strip
remaining bit patterns are reserved

The Access Specific Registers are Used as Follows:

Register Name LocalName Description
AccessSpecific1 Flags Flags used for reading and writing
AccessSpecific2 XBoxSize Determines the size in X of Box Read.
Valid values are 3, 5, and 7.
AccessSpecific3 YBoxSize Determines the size in Y of Box Read.
Valid values are 3, 5, and 7.
AccessSpecific4 BoxOffset Offset between one pixel center and the
next during a Box Read only.
Usual value is 1, but other useful values
include 2, 4, 8 . . . See Box Read for
more details.

The Flags register (AccessSpecific1) contains a number of flags used to determine factors affecting the reading and writing of data. The Flags register has the following composition:

Label #bits Description
ReadEnable 1 Read data from DRAM
WriteEnable 1 Write data to DRAM [not valid for Box mode]
PassX 1 Pass X (pixel) ordinate back to Input FIFO
PassY 1 Pass Y (row) ordinate back to Input FIFO
Loop 1 0 = Do not loop through data
1 = Loop through data
Reserved 11 Must be 0

Notes on ReadEnable and WriteEnable:

FIG. 17 illustrates the pixel data format. The simplest Image Iterators are the Sequential Read Iterator and corresponding Sequential Write Iterator. The Sequential Read Iterator presents the pixels from a channel one line at a time from top to bottom, and within a line, pixels are presented left to right. The padding bytes are not presented to the client. It is most useful for algorithms that must perform some process on each pixel from an image but don't care about the order of the pixels being processed, or want the data specifically in this order. Complementing the Sequential Read Iterator is the Sequential Write Iterator. Clients write pixels to the Output FIFO. A Sequential Write Iterator subsequently writes out a valid image using appropriate caching and appropriate padding bytes. Each Sequential Iterator requires access to 2 cache lines. When reading, while 32 pixels are presented from one cache line, the other cache line can be loaded from memory. When writing, while 32 pixels are being filled up in one cache line, the other can be being written to memory. A process that performs an operation on each pixel of an image independently would typically use a Sequential Read Iterator to obtain pixels, and a Sequential Write Iterator to write the new pixel values to their corresponding locations within the destination image. Such a process is shown in FIG. 18.

In most cases, the source and destination images are different, and are represented by 2 I/O Address Generators 189, 190. However it can be valid to have the source image and destination image to be the same, since a given input pixel is not read more than once. In that case, then the same Iterator can be used for both input and output, with both the ReadEnable and WriteEnable registers set appropriately. For maximum efficiency, 2 different cache groups should be used—one for reading and the other for writing. If data is being created by a VLIW process to be written via a Sequential Write Iterator, the PassX and PassY flags can be used to generate coordinates that are then passed down the Input FIFO. The VLIW process can use these coordinates and create the output data appropriately.

Box Read Iterator

The Box Read Iterator is used to present pixels in an order most useful for performing operations such as general-purpose filters and convolve. The Iterator presents pixel values in a square box around the sequentially read pixels. The box is limited to being 1, 3, 5, or 7 pixels wide in X and Y (set XBoxSize and YBoxSize—they must be the same value or 1 in one dimension and 3, 5, or 7 in the other). The process is shown in FIG. 19:

BoxOffset: This special purpose register is used to determine a sub-sampling in terms of which input pixels will be used as the center of the box. The usual value is 1, which means that each pixel is used as the center of the box. The value “2” would be useful in scaling an image down by 4:1 as in the case of building an image pyramid. Using pixel addresses from the previous diagram, the box would be centered on pixel 0, then 2, 8, and 10. The Box Read Iterator requires access to a maximum of 14 (2×7) cache lines. While pixels are presented from one set of 7 lines, the other cache lines can be loaded from memory.

Box Write Iterator

There is no corresponding Box Write Iterator, since the duplication of pixels is only required on input. A process that uses the Box Read Iterator for input would most likely use the Sequential Write Iterator for output since they are in sync. A good example is the convolver, where N input pixels are read to calculate 1 output pixel. The process flow is as illustrated in FIG. 20. The source and destination images should not occupy the same memory when using a Box Read Iterator, as subsequent lines of an image require the original (not newly calculated) values.

Vertical-Strip Read and Write Iterators

In some instances it is necessary to write an image in output pixel order, but there is no knowledge about the direction of coherence in input pixels in relation to output pixels. An example of this is rotation. If an image is rotated 90 degrees, and we process the output pixels horizontally, there is a complete loss of cache coherence. On the other hand, if we process the output image one cache line's width of pixels at a time and then advance to the next line (rather than advance to the next cache-line's worth of pixels on the same line), we will gain cache coherence for our input image pixels. It can also be the case that there is known ‘block’ coherence in the input pixels (such as color coherence), in which case the read governs the processing order, and the write, to be synchronized, must follow the same pixel order.

The order of pixels presented as input (Vertical-Strip Read), or expected for output (Vertical—Strip Write) is the same. The order is pixels 0 to 31 from line 0, then pixels 0 to 31 of line 1 etc for all lines of the image, then pixels 32 to 63 of line 0, pixels 32 to 63 of line 1 etc. In the final vertical strip there may not be exactly 32 pixels wide. In this case only the actual pixels in the image are presented or expected as input. This process is illustrated in FIG. 21.

process that requires only a Vertical-Strip Write Iterator will typically have a way of mapping input pixel coordinates given an output pixel coordinate. It would access the input image pixels according to this mapping, and coherence is determined by having sufficient cache lines on the ‘random-access’ reader for the input image. The coordinates will typically be generated by setting the PassX and PassY flags on the VerticalStripWrite Iterator, as shown in the process overview illustrated in FIG. 22.

It is not meaningful to pair a Write Iterator with a Sequential Read Iterator or a Box read Iterator, but a Vertical-Strip Write Iterator does give significant improvements in performance when there is a non trivial mapping between input and output coordinates.

It can be meaningful to pair a Vertical Strip Read Iterator and Vertical Strip Write Iterator. In this case it is possible to assign both to a single ALU 188 if input and output images are the same. If coordinates are required, a further Iterator must be used with PassX and PassY flags set. The Vertical Strip Read/Write Iterator presents pixels to the Input FIFO, and accepts output pixels from the Output FIFO. Appropriate padding bytes will be inserted on the write. Input and output require a minimum of 2 cache lines each for good performance.

Table I/O Addressing Modes

It is often necessary to lookup values in a table (such as an image). Table I/O addressing modes provide this functionality, requiring the client to place the index/es into the Output FIFO. The I/O Address Generator then processes the index/es, looks up the data appropriately, and returns the looked-up values in the Input FIFO for subsequent processing by the VLIW client.

1D, 2D and 3D tables are supported, with particular modes targeted at interpolation. To reduce complexity on the VLIW client side, the index values are treated as fixed-point numbers, with AccessSpecific registers defining the fixed point and therefore which bits should be treated as the integer portion of the index. Data formats are restricted forms of the general Image Characteristics in that the PixelOffset register is ignored, the data is assumed to be contiguous within a row, and can only be 8 or 16 bits (1 or 2 bytes) per data element. The 4 bit Address Mode Register is used to determine the I/O type:

Bit # Address Mode
3 1 = This addressing mode is Table I/O
2 to 0 000 = 1D Direct Lookup
001 = 1D Interpolate (linear)
010 = DRAM FIFO
011 = Reserved
100 = 2D Interpolate (bi-linear)
101 = Reserved
110 = 3D Interpolate (tri-linear)
111 = Image Pyramid Lookup

The access specific registers are:

Register Name LocalName #bits Description
AccessSpecific1 Flags 8 General flags for reading
and writing. See below for
more information.
AccessSpecific2 FractX 8 Number of fractional bits in
X index
AccessSpecific3 FractY 8 Number of fractional bits in
Y index
AccessSpecific4 FractZ 8 Number of fractional bits in
(low 8 bits/next 12 Z index
or 24 bits)) ZOffset 12 or 24 See below

FractX, FractY, and FractZ are used to generate addresses based on indexes, and interpret the format of the index in terms of significant bits and integer/fractional components. The various parameters are only defined as required by the number of dimensions in the table being indexed. A 1D table only needs FractX, a 2D table requires FractX and FractY. Each Fract_value consists of the number of fractional bits in the corresponding index. For example, an X index may be in the format 5:3. This would indicate 5 bits of integer, and 3 bits of fraction. FractX would therefore be set to 3. A simple 1D lookup could have the format 8:0, i.e. no fractional component at all. FractX would therefore be 0. ZOffset is only required for 3D lookup and takes on two different interpretations. It is described more fully in the 3D-table lookup section. The Flags register (AccessSpecific1) contains a number of flags used to determine factors affecting the reading (and in one case, writing) of data. The Flags register has the following composition:

Label #bits Description
ReadEnable 1 Read data from DRAM
WriteEnable 1 Write data to DRAM [only valid for 1D direct
lookup]
DataSize 1 0 = 8 bit data
1 = 16 bit data
Reserved 5 Must be 0

With the exception of the 1D Direct Lookup and DRAM FIFO, all Table I/O modes only support reading, and not writing. Therefore the ReadEnable bit will be set and the WriteEnable bit will be clear for all I/O modes other than these two modes. The 1D Direct Lookup supports 3 modes:

The different modes are described in the 1D Direct Lookup section below. The DRAM FIFO mode supports only 1 mode:

A direct lookup is a simple indexing into a 1 dimensional lookup table. Clients can choose between 3 access modes by setting appropriate bits in the Flags register:

A client passes the fixed-point index X into the Output FIFO, and the 8 or 16-bit value at Table[Int(X)] is returned in the Input FIFO. The fractional component of the index is completely ignored. If the index is out of bounds, the DuplicateEdge flag determines whether the edge pixel or ConstantPixel is returned. The address generation is straightforward:

The 8 or 16-bit data value at the resultant address is placed into the Input FIFO. Address generation takes 1 cycle, and transferring the requested data from the cache to the Output FIFO also takes 1 cycle (assuming a cache hit). For example, assume we are looking up values in a 256-entry table, where each entry is 16 bits, and the index is a 12 bit fixed-point format of 8:4. FractX should be 4, and DataSize 1. When an index is passed to the lookup, we shift right 4 bits, then add the result shifted left 1 bit to ImageStart.

Write Only

A client passes the fixed-point index X into the Output FIFO followed by the 8 or 16-bit value that is to be written to the specified location in the table. A complete transfer takes a minimum of 2 cycles. 1 cycle for address generation, and 1 cycle to transfer the data from the FIFO to DRAM. There can be an arbitrary number of cycles between a VLIW process placing the index into the FIFO and placing the value to be written into the FIFO. Address generation occurs in the same way as Read Only mode, but instead of the data being read from the address, the data from the Output FIFO is written to the address. If the address is outside the table range, the data is removed from the FIFO but not written to DRAM.

Read-Modify-Write

A client passes the fixed-point index X into the Output FIFO, and the 8 or 16-bit value at Table[Int(X)] is returned in the Input FIFO. The next value placed into the Output FIFO is then written to Table[Int(X)], replacing the value that had been returned earlier. The general processing loop then, is that a process reads from a location, modifies the value, and writes it back. The overall time is 4 cycles:

There is no specific read/write mode where a client passes in a flag saying “read from X” or “write to X”. Clients can simulate a “read from X” by writing the original value, and a “write to X” by simply ignoring the returned value. However such use of the mode is not encouraged since each action consumes a minimum of 3 cycles (the modify is not required) and 2 data accesses instead of 1 access as provided by the specific Read and Write modes.

Interpolate Table

This is the same as a Direct Lookup in Read mode except that two values are returned for a given fixed-point index X instead of one. The values returned are Table[Int(X)], and Table[Int(X)+1]. If either index is out of bounds the DuplicateEdge flag determines whether the edge pixel or ConstantPixel is returned. Address generation is the same as Direct Lookup, with the exception that the second address is simply Address1+1 or 2 depending on 8 or 16 bit data. Transferring the requested data to the Output FIFO takes 2 cycles (assuming a cache hit), although two 8-bit values may actually be returned from the cache to the Address Generator in a single 16-bit fetch.

DRAM FIFO

A special case of a read/write 1D table is a DRAM FIFO. It is often necessary to have a simulated FIFO of a given length using DRAM and associated caches. With a DRAM FIFO, clients do not index explicitly into the table, but write to the Output FIFO as if it was one end of a FIFO and read from the Input FIFO as if it was the other end of the same logical FIFO. 2 counters keep track of input and output positions in the simulated FIFO, and cache to DRAM as needed. Clients need to set both ReadEnable and WriteEnable bits in the Flags register.

An example use of a DRAM FIFO is keeping a single line history of some value. The initial history is written before processing begins. As the general process goes through a line, the previous line's value is retrieved from the FIFO, and this line's value is placed into the FIFO (this line will be the previous line when we process the next line). So long as input and outputs match each other on average, the Output FIFO should always be full. Consequently there is effectively no access delay for this kind of FIFO (unless the total FIFO length is very small—say 3 or 4 bytes, but that would defeat the purpose of the FIFO).

2 Dimensional Tables

Direct Lookup

A 2 dimensional direct lookup is not supported. Since all cases of 2D lookups are expected to be accessed for bi-linear interpolation, a special bi-linear lookup has been implemented.

Bi-Linear Lookup

This kind of lookup is necessary for bi-linear interpolation of data from a 2D table. Given fixed-point X and Y coordinates (placed into the Output FIFO in the order Y, X), 4 values are returned after lookup. The values (in order) are:

The order of values returned gives the best cache coherence. If the data is 8-bit, 2 values are returned each cycle over 2 cycles with the low order byte being the first data element. If the data is 16-bit, the 4 values are returned in 4 cycles, 1 entry per cycle. Address generation takes 2 cycles. The first cycle has the index (Y) barrel-shifted right FractY bits being multiplied by RowOffset, with the result added to ImageStart. The second cycle shifts the X index right by FractX bits, and then either the result (in the case of 8 bit data) or the result shifted left 1 bit (in the case of 16 bit data) is added to the result from the first cycle. This gives us address Adr=address of Table[Int(X), Int(Y)]:

Adr = ImageStart + ShiftRight ( Y , FractY ) * RowOffset ) + ShiftRight ( X , FractX )

We keep a copy of Adr in AdrOld for use fetching subsequent entries.

The following 2 tables show the method of address calculation for 8 and 16 bit data sizes:

Cycle Calculation while fetching 2 × 8-bit data entries from Adr
1 Adr = Adr + RowOffset
2 <preparing next lookup>

Calculation while fetching
Cycle 1 × 16-bit data entry from Adr
1 Adr = Adr + 2
2 Adr = AdrOld + RowOffset
3 Adr = Adr + 2
4 <preparing next lookup>

In both cases, the first cycle of address generation can overlap the insertion of the X index into the FIFO, so the effective timing can be as low as 1 cycle for address generation, and 4 cycles of return data. If the generation of indexes is 2 steps ahead of the results, then there is no effective address generation time, and the data is simply produced at the appropriate rate (2 or 4 cycles per set).

3 Dimensional Lookup

Direct Lookup

Since all cases of 2D lookups are expected to be accessed for tri-linear interpolation, two special tri-linear lookups have been implemented. The first is a straightforward lookup table, while the second is for tri-linear interpolation from an Image Pyramid.

Tri-Linear Lookup

This type of lookup is useful for 3D tables of data, such as color conversion tables. The standard image parameters define a single XY plane of the data—i.e. each plane consists of ImageHeight rows, each row containing RowOffset bytes. In most circumstances, assuming contiguous planes, one XY plane will be ImageHeight×RowOffset bytes after another. Rather than assume or calculate this offset, the software via the CPU must provide it in the form of a 12-bit ZOffset register. In this form of lookup, given 3 fixed-point indexes in the order Z, Y, X, 8 values are returned in order from the lookup table:

The order of values returned gives the best cache coherence. If the data is 8-bit, 2 values are returned each cycle over 4 cycles with the low order byte being the first data element. If the data is 16-bit, the 4 values are returned in 8 cycles, 1 entry per cycle. Address generation takes 3 cycles. The first cycle has the index (Z) barrel-shifted right FractZ bits being multiplied by the 12-bit ZOffset and added to ImageStart. The second cycle has the index (Y) barrel-shifted right FractY bits being multiplied by RowOffset, with the result added to the result of the previous cycle. The second cycle shifts the X index right by FractX bits, and then either the result (in the case of 8 bit data) or the result shifted left 1 bit (in the case of 16 bit data) is added to the result from the second cycle. This gives us address Adr=address of Table[Int(X), Int(Y), Int(Z)]:

Adr = ImageStart + ( ShiftRight ( Z , FractZ ) * ZOffset ) + ( ShiftRight ( Y , FractY ) * RowOffset ) + ShiftRight ( X , FractX )

We keep a copy of Adr in AdrOld for use fetching subsequent entries.

The following 2 tables show the method of address calculation for 8 and 16 bit data sizes:

Cycle Calculation while fetching 2 × 8-bit data entries from Adr
1 Adr = Adr + RowOffset
2 Adr = AdrOld + ZOffset
3 Adr = Adr + RowOffset
4 <preparing next lookup>

Cycle Calculation while fetching 1 × 16-bit data entries from Adr
1 Adr = Adr + 2
2 Adr = AdrOld + RowOffset
3 Adr = Adr + 2
4 Adr, AdrOld = AdrOld + Zoffset
5 Adr = Adr + 2
6 Adr = AdrOld + RowOffset
7 Adr = Adr + 2
8 <preparing next lookup>

In both cases, the cycles of address generation can overlap the insertion of the indexes into the FIFO, so the effective timing for a single one-off lookup can be as low as 1 cycle for address generation, and 4 cycles of return data. If the generation of indexes is 2 steps ahead of the results, then there is no effective address generation time, and the data is simply produced at the appropriate rate (4 or 8 cycles per set).

Image Pyramid Lookup

During brushing, tiling, and warping it is necessary to compute the average color of a particular area in an image. Rather than calculate the value for each area given, these functions make use of an image pyramid. The description and construction of an image pyramid is detailed in the section on Internal Image Formats in the DRAM interface 81 chapter of this document. This section is concerned with a method of addressing given pixels in the pyramid in terms of 3 fixed-point indexes ordered: level (Z), Y, and X. Note that Image Pyramid lookup assumes 8 bit data entries, so the DataSize flag is completely ignored. After specification of Z, Y, and X, the following 8 pixels are returned via the Input FIFO:

The 8 pixels are returned as 4×16 bit entries, with X and X+1 entries combined hi/lo. For example, if the scaled (X, Y) coordinate was (10.4, 12.7) the first 4 pixels returned would be: (10, 12), (11, 12), (10, 13) and (11, 13). When a coordinate is outside the valid range, clients have the choice of edge pixel duplication or returning of a constant color value via the DuplicateEdgePixels and ConstantPixel registers (only the low 8 bits are used). When the Image Pyramid has been constructed, there is a simple mapping from level 0 coordinates to level Z coordinates. The method is simply to shift the X or Y coordinate right by Z bits. This must be done in addition to the number of bits already shifted to retrieve the integer portion of the coordinate (i.e. shifting right FractX and FractY bits for X and Y ordinates respectively). To find the ImageStart and RowOffset value for a given level of the image pyramid, the 24-bit ZOffset register is used as a pointer to a Level Information Table. The table is an array of records, each representing a given level of the pyramid, ordered by level number. Each record consists of a 16-bit offset ZOffset from ImageStart to that level of the pyramid (64-byte aligned address as lower 6 bits of the offset are not present), and a 12 bit ZRowOffset for that level. Element 0 of the table would contain a ZOffset of 0, and a ZRowOffset equal to the general register RowOffset, as it simply points to the full sized image. The ZOffset value at element N of the table should be added to ImageStart to yield the effective ImageStart of level N of the image pyramid. The RowOffset value in element N of the table contains the RowOffset value for level N. The software running on the CPU must set up the table appropriately before using this addressing mode. The actual address generation is outlined here in a cycle by cycle description:

Load From
Cycle Register Address Other Operations
0 ZAdr = ShiftRight(Z, FractZ) + ZOffset
ZInt = ShiftRight(Z, FractZ)
1 ZOffset Zadr ZAdr += 2
YInt = ShiftRight(Y, FractY)
2 ZRowOffset ZAdr ZAdr += 2
YInt = ShiftRight(YInt, ZInt)
Adr = ZOffset + ImageStart
3 ZOffset ZAdr ZAdr += 2
Adr += ZrowOffset * YInt
XInt = ShiftRight(X, FractX)
4 ZAdr ZAdr Adr += ShiftRight(XInt, ZInt)
ZOffset += ShiftRight(XInt, 1)
5 FIFO Adr Adr += ZrowOffset
ZOffset += ImageStart
6 FIFO Adr Adr = (ZAdr * ShiftRight(Yint, 1)) +
ZOffset
7 FIFO Adr Adr += Zadr
8 FIFO Adr <Cycle 0 for next retrieval>

The address generation as described can be achieved using a single Barrel Shifter, 2 adders, and a single 16×16 multiply/add unit yielding 24 bits. Although some cycles have 2 shifts, they are either the same shift value (i.e. the output of the Barrel Shifter is used two times) or the shift is 1 bit, and can be hard wired. The following internal registers are required: ZAdr, Adr, ZInt, YInt, XInt, ZRowOffset, and ZlmageStart. The_Int registers only need to be 8 bits maximum, while the others can be up to 24 bits. Since this access method only reads from, and does not write to image pyramids, the CacheGroup2 is used to lookup the Image Pyramid Address Table (via ZAdr). CacheGroup1 is used for lookups to the image pyramid itself (via Adr). The address table is around 22 entries (depending on original image size), each of 4 bytes. Therefore 3 or 4 cache lines should be allocated to CacheGroup2, while as many cache lines as possible should be allocated to CacheGroup1. The timing is 8 cycles for returning a set of data, assuming that Cycle 8 and Cycle 0 overlap in operation—i.e. the next request's Cycle 0 occurs during Cycle 8. This is acceptable since Cycle 0 has no memory access, and Cycle 8 has no specific operations.

Generation of Coordinates using VLIW Vector Processor 74

Some functions that are linked to Write Iterators require the X and/or Y coordinates of the current pixel being processed in part of the processing pipeline. Particular processing may also need to take place at the end of each row, or column being processed. In most cases, the PassX and PassY flags should be sufficient to completely generate all coordinates. However, if there are special requirements, the following functions can be used. The calculation can be spread over a number of ALUs, for a single cycle generation, or be in a single ALU 188 for a multi-cycle generation.

Generate Sequential [X, Y]

When a process is processing pixels in sequential order according to the Sequential Read Iterator (or generating pixels and writing them out to a Sequential Write Iterator), the following process can be used to generate X, Y coordinates instead of PassX/PassY flags as shown in FIG. 23. The coordinate generator counts up to ImageWidth in the X ordinate, and once per ImageWidth pixels increments the Y ordinate. The actual process is illustrated in FIG. 24, where the following constants are set by software:

Constant Value
K1 ImageWidth
K2 ImageHeight (optional)

The following registers are used to hold temporary variables:

Variable Value
Reg1 X (starts at 0 each line)
Reg2 Y (starts at 0)

The requirements are summarized as follows:

Requirements *+ + R K LU Iterators
General 0 ¾ 2 ½ 0 0
TOTAL 0 ¾ 2 ½ 0 0

Generate Vertical Strip [X, Y]

When a process is processing pixels in order to write them to a Vertical Strip Write Iterator, and for some reason cannot use the PassX/PassY flags, the process as illustrated in FIG. 25 can be used to generate X, Y coordinates. The coordinate generator simply counts up to ImageWidth in the X ordinate, and once per ImageWidth pixels increments the Y ordinate. The actual process is illustrated in FIG. 26, where the following constants are set by software:

Constant Value
K1 32
K2 ImageWidth
K3 ImageHeight

The following registers are used to hold temporary variables:

Variable Value
Reg1 StartX (starts at 0, and is incremented by 32 once per vertical
strip)
Reg2 X
Reg3 EndX (starts at 32 and is incremented by 32 to a maximum of
ImageWidth) once per vertical strip)
Reg4 Y

The requirements are summarized as follows:

Requirements *+ + R K LU Iterators
General 0 4 4 3 0 0
TOTAL 0 4 4 3 0 0

The calculations that occur once per vertical strip (2 additions, one of which has an associated MIN) are not included in the general timing statistics because they are not really part of the per pixel timing. However they do need to be taken into account for the programming of the microcode for the particular function.

Image Sensor Interface (ISI 83)

The Image Sensor Interface (ISI 83) takes data from the CMOS Image Sensor and makes it available for storage in DRAM. The image sensor has an aspect ratio of 3:2, with a typical resolution of 750×500 samples, yielding 375K (8 bits per pixel). Each 2×2 pixel block has the configuration as shown in FIG. 27. The ISI 83 is a state machine that sends control information to the Image Sensor, including frame sync pulses and pixel clock pulses in order to read the image. Pixels are read from the image sensor and placed into the VLIW Input FIFO 78. The VLIW is then able to process and/or store the pixels. This is illustrated further in FIG. 28. The ISI 83 is used in conjunction with a VLIW program that stores the sensed Photo Image in DRAM. Processing occurs in 2 steps:

If the rotation is 0 degrees, then step 1 merely writes the Photo Image out to the final Photo Image location and step 2 is not performed. If the rotation is other than 0 degrees, the image is written out to a temporary area (for example into the Print Image memory area), and then rotated during step 2 into the final Photo Image location. Step 1 is very simple microcode, taking data from the VLIW Input FIFO 78 and writing it to a Sequential Write Iterator. Step 2's rotation is accomplished by using the accelerated Vark Affine Transform function. The processing is performed in 2 steps in order to reduce design complexity and to re-use the Vark affine transform rotate logic already required for images. This is acceptable since both steps are completed in approximately 0.03 seconds, a time imperceptible to the operator of the Artcam. Even so, the read process is sensor speed bound, taking 0.02 seconds to read the full frame, and approximately 0.01 seconds to rotate the image.

The orientation is important for converting between the sensed Photo Image and the internal format image, since the relative positioning of R, G, and B pixels changes with orientation. The processed image may also have to be rotated during the Print process in order to be in the correct orientation for printing. The 3D model of the Artcam has 2 image sensors, with their inputs multiplexed to a single ISI 83 (different microcode, but same ACP 31). Since each sensor is a frame store, both images can be taken simultaneously, and then transferred to memory one at a time.

Display Controller 88

When the “Take” button on an Artcam is half depressed, the TFT will display the current image from the image sensor (converted via a simple VLIW process). Once the Take button is fully depressed, the Taken Image is displayed. When the user presses the Print button and image processing begins, the TFT is turned off. Once the image has been printed the TFT is turned on again. The Display Controller 88 is used in those Artcam models that incorporate a flat panel display. An example display is a TFT LCD of resolution 240×160 pixels. The structure of the Display Controller 88 isl illustrated in FIG. 29. The Display Controller 88 State Machine contains registers that control the timing of the Sync Generation, where the display image is to be taken from (in DRAM via the Data cache 76 via a specific Cache Group), and whether the TFT should be active or not (via TFT Enable) at the moment. The CPU can write to these registers via the low speed bus. Displaying a 240×160 pixel image on an RGB TFT requires 3 components per pixel. The image taken from DRAM is displayed via 3 DACs, one for each of the R, G, and B output signals. At an image refresh rate of 30 frames per second (60 fields per second) the Display Controller 88 requires data transfer rates of:
240×160×3×30=3.5 MB per second

This data rate is low compared to the rest of the system. However it is high enough to cause VLIW programs to slow down during the intensive image processing. The general principles of TFT operation should reflect this.

Image Data Formats

As stated previously, the DRAM Interface 81 is responsible for interfacing between other client portions of the ACP chip and the RAMBUS DRAM. In effect, each module within the DRAM Interface is an address generator.

There are three logical types of images manipulated by the ACP. They are:

These images are typically different in color space, resolution, and the output & input color spaces which can vary from camera to camera. For example, a CCD image on a low-end camera may be a different resolution, or have different color characteristics from that used in a high-end camera. However all internal image formats are the same format in terms of color space across all cameras.

In addition, the three image types can vary with respect to which direction is ‘up’. The physical orientation of the camera causes the notion of a portrait or landscape image, and this must be maintained throughout processing. For this reason, the internal image is always oriented correctly, and rotation is performed on images obtained from the CCD and during the print operation.

CCD Image Organization

Although many different CCD image sensors could be utilised, it will be assumed that the CCD itself is a 750×500 image sensor, yielding 375,000 bytes (8 bits per pixel). Each 2×2 pixel block having the configuration as depicted in FIG. 30.

A CCD Image as stored in DRAM has consecutive pixels with a given line contiguous in memory. Each line is stored one after the other. The image sensor Interface 83 is responsible for taking data from the CCD and storing it in the DRAM correctly oriented. Thus a CCD image with rotation 0 degrees has its first line G, R, G, R, G, R . . . and its second line as B, G, B, G, B, G . . . . If the CCD image should be portrait, rotated 90 degrees, the first line will be R, G, R, G, R, G and the second line G, B, G, B, G, B . . . etc.

Pixels are stored in an interleaved fashion since all color components are required in order to convert to the internal image format.

It should be noted that the ACP 31 makes no assumptions about the CCD pixel format, since the actual CCDs for imaging may vary from Artcam to Artcam, and over time. All processing that takes place via the hardware is controlled by major microcode in an attempt to extend the usefulness of the ACP 31.

Internal Image Organization

Internal images typically consist of a number of channels. Vark images can include, but are not limited to:

L, a and b correspond to components of the Lab color space, α is a matte channel (used for compositing), and Δ is a bump-map channel (used during brushing, tiling and illuminating).

The VLIW processor 74 requires images to be organized in a planar configuration. Thus a Lab image would be stored as 3 separate blocks of memory:

one block for the L channel,

one block for the a channel, and

one block for the b channel

Within each channel block, pixels are stored contiguously for a given row (plus some optional padding bytes), and rows are stored one after the other.

Turning to FIG. 31 there is illustrated an example form of storage of a logical image 100. The logical image 100 is stored in a planar fashion having L 101, a 102 and b 103 color components stored one after another. Alternatively, the logical image 100 can be stored in a compressed format having an uncompressed L component 101 and compressed A and B components 105, 106.

Turning to FIG. 32, the pixels of for line n 110 are stored together before the pixels of for line and n+1 (111). With the image being stored in contiguous memory within a single channel.

In the 8 MB-memory model, the final Print Image after all processing is finished, needs to be compressed in the chrominance channels. Compression of chrominance channels can be 4:1, causing an overall compression of 12:6, or 2:1.

Other than the final Print Image, images in the Artcam are typically not compressed. Because of memory constraints, software may choose to compress the final Print Image in the chrominance channels by scaling each of these channels by 2:1. If this has been done, the PRINT Vark function call utilised to print an image must be told to treat the specified chrominance channels as compressed. The PRINT function is the only function that knows how to deal with compressed chrominance, and even so, it only deals with a fixed 2:1 compression ratio.

Although it is possible to compress an image and then operate on the compressed image to create the final print image, it is not recommended due to a loss in resolution. In addition, an image should only be compressed once—as the final stage before printout. While one compression is virtually undetectable, multiple compressions may cause substantial image degradation.

Clip image Organization

Clip images stored on Artcards have no explicit support by the ACP 31. Software is responsible for taking any images from the current Artcard and organizing the data into a form known by the ACP. If images are stored compressed on an Artcard, software is responsible for decompressing them, as there is no specific hardware support for decompression of Artcard images.

Image Pyramid Organization

During brushing, tiling, and warping processes utilised to manipulate an image it is often necessary to compute the average color of a particular area in an image. Rather than calculate the value for each area given, these functions make use of an image pyramid. As illustrated in FIG. 33, an image pyramid is effectively a multi-resolutionpixel-map. The original image 115 is a 1:1 representation. Low-pass filtering and sub-sampling by 2:1 in each dimension produces an image ¼ the original size 116. This process continues until the entire image is represented by a single pixel. An image pyramid is constructed from an original internal format image, and consumes ⅓ of the size taken up by the original image (¼+ 1/16+ 1/64+ . . . ). For an original image of 1500×1000 the corresponding image pyramid is approximately ½ MB. An image pyramid is constructed by a specific Vark function, and is used as a parameter to other Vark functions.

Print Image Organization

The entire processed image is required at the same time in order to print it. However the Print Image output can comprise a CMY dithered image and is only a transient image format, used within the Print Image functionality. However, it should be noted that color conversion will need to take place from the internal color space to the print color space. In addition, color conversion can be tuned to be different for different print rolls in the camera with different ink characteristics e.g. Sepia output can be accomplished by using a specific sepia toning Artcard, or by using a sepia tone print-roll (so all Artcards will work in sepia tone).

Color Spaces

As noted previously there are 3 color spaces used in the Artcam, corresponding to the different image types.

The ACP has no direct knowledge of specific color spaces. Instead, it relies on client color space conversion tables to convert between CCD, internal, and printer color spaces:

CCD:RGB

Internal:Lab

Printer:CMY

Removing the color space conversion from the ACP 31 allows:

The Artcard Interface (AI) takes data from the linear image Sensor while an Artcard is passing under it, and makes that data available for storage in DRAM. The image sensor produces 11,000 8-bit samples per scanline, sampling the Artcard at 4800 dpi. The AI is a state machine that sends control information to the linear sensor, including LineSync pulses and PixelClock pulses in order to read the image. Pixels are read from the linear sensor and placed into the VLIW Input FIFO 78. The VLIW is then able to process and/or store the pixels. The AI has only a few registers:

Register Name Description
NumPixels The number of pixels in a sensor line (approx 11,000)
Status The Print Head Interface's Status Register
PixelsRemaining The number of bytes remaining in the current line
Actions
Reset A write to this register resets the AI, stops any
scanning, and loads all registers with 0.
Scan A write to this register with a non-zero value sets the
Scanning bit of the Status register, and causes the
Artcard Interface Scan cycle to start.
A write to this register with 0 stops the scanning
process and clears the Scanning bit
in the Status register.
The Scan cycle causes the AI to transfer NumPixels
bytes from the sensor to the VLIW Input FIFO 78,
producing the PixelClock signals appropriately.
Upon completion of NumPixels bytes, a LineSync
pulse is given and the Scan cycle restarts.
The PixelsRemaining register holds the number of
pixels remaining to be read on the current scanline.

Note that the CPU should clear the VLIW Input FIFO 78 before initiating a Scan. The Status register has bit interpretations as follows:

Bit Name Bits Description
Scanning 1 If set, the AI is currently scanning, with the number of
pixels remaining to be transferred from the current line
recorded in PixelsRemaining.
If clear, the AI is not currently scanning, so is not
transferring pixels to the VLIW Input FIFO 78.

Artcard Interface (AI) 87

The Artcard Interface (AI) 87 is responsible for taking an Artcard image from the Artcard Reader 34, and decoding it into the original data (usually a Vark script). Specifically, the AI 87 accepts signals from the Artcard scanner linear CCD 34, detects the bit pattern printed on the card, and converts the bit pattern into the original data, correcting read errors.

With no Artcard 9 inserted, the image printed from an Artcam is simply the sensed Photo Image cleaned up by any standard image processing routines. The Artcard 9 is the means by which users are able to modify a photo before printing it out. By the simple task of inserting a specific Artcard 9 into an Artcam, a user is able to define complex image processing to be performed on the Photo Image. With no Artcard inserted the Photo Image is processed in a standard way to create the Print Image. When a single Artcard 9 is inserted into the Artcam, that Artcard's effect is applied to the Photo Image to generate the Print Image.

When the Artcard 9 is removed (ejected), the printed image reverts to the Photo Image processed in a standard way. When the user presses the button to eject an Artcard, an event is placed in the event queue maintained by the operating system running on the Artcam Central Processor 31. When the event is processed (for example after the current Print has occurred), the following things occur:

If the current Artcard is valid, then the Print Image is marked as invalid and a ‘Process Standard’ event is placed in the event queue. When the event is eventually processed it will perform the standard image processing operations on the Photo Image to produce the Print Image. The motor is started to eject the Artcard and a time-specific ‘Stop-Motor’ Event is added to the event queue.

Inserting an Artcard

When a user inserts an Artcard 9, the Artcard Sensor 49 detects it notifying the ACP72. This results in the software inserting an ‘Artcard Inserted’ event into the event queue. When the event is processed several things occur:

The current Artcard is marked as invalid (as opposed to ‘none’).

The Print Image is marked as invalid.

The Artcard motor 37 is started up to load the Artcard

The Artcard Interface 87 is instructed to read the Artcard

The Artcard Interface 87 accepts signals from the Artcard scanner linear CCD 34, detects the bit pattern printed on the card, and corrects errors in the detected bit pattern, producing a valid Artcard data block in DRAM.

Reading Data from the Artcard CCD—General Considerations

As illustrated in FIG. 34, the Data Card reading process has 4 phases operated while the pixel data is read from the card. The phases are as follows:

Phase 1. Detect data area on Artcard

Phase 2. Detect bit pattern from Artcard based on CCD pixels, and write as bytes.

Phase 3. Descramble and XOR the byte-pattern

Phase 4. Decode data (Reed-Solomon decode)

As illustrated in FIG. 35, the Artcard 9 must be sampled at least at double the printed resolution to satisfy Nyquist's Theorem. In practice it is better to sample at a higher rate than this. Preferably, the pixels are sampled 230 at 3 times the resolution of a printed dot in each dimension, requiring 9 pixels to define a single dot. Thus if the resolution of the Artcard 9 is 1600 dpi, and the resolution of the sensor 34 is 4800 dpi, then using a 50 mm CCD image sensor results in 9450 pixels per column. Therefore if we require 2 MB of dot data (at 9 pixels per dot) then this requires 2 MB*8*9/9450=15,978 columns=approximately 16,000 columns. Of course if a dot is not exactly aligned with the sampling CCD the worst and most likely case is that a dot will be sensed over a 16 pixel area (4×4) 231.

An Artcard 9 may be slightly warped due to heat damage, slightly rotated (up to, say 1 degree) due to differences in insertion into an Artcard reader, and can have slight differences in true data rate due to fluctuations in the speed of the reader motor 37. These changes will cause columns of data from the card not to be read as corresponding columns of pixel data. As illustrated in FIG. 36, a 1 degree rotation in the Artcard 9 can cause the pixels from a column on the card to be read as pixels across 166 columns:

Finally, the Artcard 9 should be read in a reasonable amount of time with respect to the human operator. The data on the Artcard covers most of the Artcard surface, so timing concerns can be limited to the Artcard data itself. A reading time of 1.5 seconds is adequate for Artcard reading.

The Artcard should be loaded in 1.5 seconds. Therefore all 16,000 columns of pixel data must be read from the CCD 34 in 1.5 second, i.e. 10,667 columns per second. Therefore the time available to read one column is 1/10667 seconds, or 93,747 ns. Pixel data can be written to the DRAM one column at a time, completely independently from any processes that are reading the pixel data.

The time to write one column of data (9450/2 bytes since the reading can be 4 bits per pixel giving 2×4 bit pixels per byte) to DRAM is reduced by using 8 cache lines. If 4 lines were written out at one time, the 4 banks can be written to independently, and thus overlap latency reduced. Thus the 4725 bytes can be written in 11,840 ns (4725/128*320 ns). Thus the time taken to write a given column's data to DRAM uses just under 13% of the available bandwidth.

Decoding an Artcard

A simple look at the data sizes shows the impossibility of fitting the process into the 8 MB of memory 33 if the entire Artcard pixel data (140 MB if each bit is read as a 3×3 array) as read by the linear CCD 34 is kept. For this reason, the reading of the linear CCD, decoding of the bitmap, and the un-bitmap process should take place in real-time (while the Artcard 9 is traveling past the linear CCD 34), and these processes must effectively work without having entire data stores available.

When an Artcard 9 is inserted, the old stored Print Image and any expanded Photo Image becomes invalid. The new Artcard 9 can contain directions for creating a new image based on the currently captured Photo Image. The old Print Image is invalid, and the area holding expanded Photo Image data and image pyramid is invalid, leaving more than 5 MB that can be used as scratch memory during the read process. Strictly speaking, the 1 MB area where the Artcard raw data is to be written can also be used as scratch data during the Artcard read process as long as by the time the final Reed-Solomon decode is to occur, that 1 MB area is free again. The reading process described here does not make use of the extra 1 MB area (except as a final destination for the data).

It should also be noted that the unscrambling process requires two sets of 2 MB areas of memory since unscrambling cannot occur in place. Fortunately the 5 MB scratch area contains enough space for this process.

Turning now to FIG. 37, there is shown a flowchart 220 of the steps necessary to decode the Artcard data. These steps include reading in the Artcard 221, decoding the read data to produce corresponding encoded XORed scrambled bitmap data 223. Next a checkerboard XOR is applied to the data to produces encoded scrambled data 224. This data is then unscrambled 227 to produce data 225 before this data is subjected to Reed-Solomon decoding to produce the original raw data 226. Alternatively, unscrambling and XOR process can take place together, not requiring a separate pass of the data. Each of the above steps is discussed in further detail hereinafter. As noted previously with reference to FIG. 37, the Artcard Interface, therefore, has 4 phases, the first 2 of which are time-critical, and must take place while pixel data is being read from the CCD:

Phase 1. Detect data area on Artcard

Phase 2. Detect bit pattern from Artcard based on CCD pixels, and write as bytes.

Phase 3. Descramble and XOR the byte-pattern

Phase 4. Decode data (Reed-Solomon decode)

The four phases are described in more detail as follows:

Phase 1. As the Artcard 9 moves past the CCD 34 the AI must detect the start of the data area by robustly detecting special targets on the Artcard to the left of the data area. If these cannot be detected, the card is marked as invalid. The detection must occur in real-time, while the Artcard 9 is moving past the CCD 34.

If necessary, rotation invariance can be provided. In this case, the targets are repeated on the right side of the Artcard, but relative to the bottom right corner instead of the top corner. In this way the targets end up in the correct orientation if the card is inserted the “wrong” way. Phase 3 below can be altered to detect the orientation of the data, and account for the potential rotation.

Phase 2. Once the data area has been determined, the main read process begins, placing pixel data from the CCD into an ‘Artcard data window’, detecting bits from this window, assembling the detected bits into bytes, and constructing a byte-image in DRAM. This must all be done while the Artcard is moving past the CCD.

Phase 3. Once all the pixels have been read from the Artcard data area, the Artcard motor 37 can be stopped, and the byte image descrambled and XORed. Although not requiring real-time performance, the process should be fast enough not to annoy the human operator. The process must take 2 MB of scrambled bit-image and write the unscrambled/XORed bit-image to a separate 2 MB image.

Phase 4. The final phase in the Artcard read process is the Reed-Solomon decoding process, where the 2 MB bit-image is decoded into a 1 MB valid Artcard data area. Again, while not requiring real-time performance it is still necessary to decode quickly with regard to the human operator. If the decode process is valid, the card is marked as valid. If the decode failed, any duplicates of data in the bit-image are attempted to be decoded, a process that is repeated until success or until there are no more duplicate images of the data in the bit image.

The four phase process described requires 4.5 MB of DRAM. 2 MB is reserved for Phase 2 output, and 0.5 MB is reserved for scratch data during phases 1 and 2. The remaining 2 MB of space can hold over 440 columns at 4725 byes per column. In practice, the pixel data being read is a few columns ahead of the phase 1 algorithm, and in the worst case, about 180 columns behind phase 2, comfortably inside the 440 column limit.

A description of the actual operation of each phase will now be provided in greater detail.

Phase 1—Detect data area on Artcard

This phase is concerned with robustly detecting the left-hand side of the data area on the Artcard 9. Accurate detection of the data area is achieved by accurate detection of special targets printed on the left side of the card. These targets are especially designed to be easy to detect even if rotated up to 1 degree.

Turning to FIG. 38, there is shown an enlargement of the left hand side of an Artcard 9. The side of the card is divided into 16 bands, 239 with a target eg. 241 located at the center of each band. The bands are logical in that there is no line drawn to separate bands. Turning to FIG. 39, there is shown a single target 241. The target 241, is a printed black square containing a single white dot. The idea is to detect firstly as many targets 241 as possible, and then to join at least 8 of the detected white-dot locations into a single logical straight line. If this can be done, the start of the data area 243 is a fixed distance from this logical line. If it cannot be done, then the card is rejected as invalid.

As shown in FIG. 38, the height of the card 9 is 3150 dots. A target (Target0) 241 is placed a fixed distance of 24 dots away from the top left corner 244 of the data area so that it falls well within the first of 16 equal sized regions 239 of 192 dots (576 pixels) with no target in the final pixel region of the card. The target 241 must be big enough to be easy to detect, yet be small enough not to go outside the height of the region if the card is rotated 1 degree. A suitable size for the target is a 31×31 dot (93×93 sensed pixels) black square 241 with the white dot 242.

At the worst rotation of 1 degree, a 1 column shift occurs every 57 pixels. Therefore in a 590 pixel sized band, we cannot place any part of our symbol in the top or bottom 12 pixels or so of the band or they could be detected in the wrong band at CCD read time if the card is worst case rotated.

Therefore, if the black part of the rectangle is 57 pixels high (19 dots) we can be sure that at least 9.5 black pixels will be read in the same column by the CCD (worst case is half the pixels are in one column and half in the next). To be sure of reading at least 10 black dots in the same column, we must have a height of 20 dots. To give room for erroneous detection on the edge of the start of the black dots, we increase the number of dots to 31, giving us 15 on either side of the white dot at the target's local coordinate (15, 15). 31 dots is 91 pixels, which at most suffers a 3 pixel shift in column, easily within the 576 pixel band.

Thus each target is a block of 31×31 dots (93×93 pixels) each with the composition:

15 columns of 31 black dots each (45 pixel width columns of 93 pixels).

1 column of 15 black dots (45 pixels) followed by 1 white dot (3 pixels) and then a further 15 black dots (45 pixels)

15 columns of 31 black dots each (45 pixel width columns of 93 pixels)

Detect Targets

Targets are detected by reading columns of pixels, one column at a time rather than by detecting dots. It is necessary to look within a given band for a number of columns consisting of large numbers of contiguous black pixels to build up the left side of a target. Next, it is expected to see a white region in the center of further black columns, and finally the black columns to the left of the target center.

Eight cache lines are required for good cache performance on the reading of the pixels. Each logical read fills 4 cache lines via 4 sub-reads while the other 4 cache-lines are being used. This effectively uses up 13% of the available DRAM bandwidth.

As illustrated in FIG. 40, the detection mechanism FIFO for detecting the targets uses a filter 245, run-length encoder 246, and a FIFO 247 that requires special wiring of the top 3 elements (S1, S2, and S3) for random access.

The columns of input pixels are processed one at a time until either all the targets are found, or until a specified number of columns have been processed. To process a column, the pixels are read from DRAM, passed through a filter 245 to detect a 0 or 1, and then run length encoded 246. The bit value and the number of contiguous bits of the same value are placed in FIFO 247. Each entry of the FIFO 249 is in 8 bits, 7 bits 250 to hold the run-length, and 1 bit 249 to hold the value of the bit detected.

The run-length encoder 246 only encodes contiguous pixels within a 576 pixel (192 dot) region.

The top 3 elements in the FIFO 247 can be accessed 252 in any random order. The run lengths (in pixels) of these entries are filtered into 3 values: short, medium, and long in accordance with the following table:

Short Used to detect white dot. RunLength < 16
Medium Used to detect runs of black above or 16 <= RunLength < 48
below the white dot in the center of the
target.
Long Used to detect run lengths of black to RunLength >= 48
the left and right of the center dot in the
target.

Looking at the top three entries in the FIFO 247 there are 3 specific cases of interest:

Case 1 S1 = white long We have detected a black column of the
S2 = black long target to the left of or to the right of the
S3 = white white center dot.
medium/long
Case 2 S1 = white long If we've been processing a series of
S2 = black medium columns of Case 1s, then we have
S3 = white short probably detected the white dot in this
Previous 8 columns column. We know that the next entry will
were Case 1 be black (or it would have been included
in the white S3 entry), but the number of
black pixels is in question. Need to verify
by checking after the next FIFO advance
(see Case 3).
Case 3 Prev = Case 2 We have detected part of the white dot.
S3 = black med We expect around 3 of these, and then
some more columns of Case 1.

Preferably, the following information per region band is kept:

TargetDetected  1 bit
BlackDetectCount  4 bits
WhiteDetectCount  3 bits
PrevColumnStartPixel 15 bits
TargetColumn ordinate 16 bits (15:1)
TargetRow ordinate 16 bits (15:1)
TOTAL  7 bytes (rounded to 8 bytes for easy addressing)

Given a total of 7 bytes. It makes address generation easier if the total is assumed to be 8 bytes. Thus 16 entries requires 16*8=128 bytes, which fits in 4 cache lines. The address range should be inside the scratch 0.5 MB DRAM area since other phases make use of the remaining 4 MB data area.

When beginning to process a given pixel column, the register value S2StartPixel 254 is reset to 0. As entries in the FIFO advance from S2 to S1, they are also added 255 to the existing S2StartPixel value, giving the exact pixel position of the run currently defined in S2. Looking at each of the 3 cases of interest in the FIFO, S2StartPixel can be used to determine the start of the black area of a target (Cases 1 and 2), and also the start of the white dot in the center of the target (Case 3). An algorithm for processing columns can be as follows:

1 TargetDetected[0-15] := 0
BlackDetectCount[0-15] := 0
WhiteDetectCount[0-15] := 0
TargetRow[0-15] := 0
TargetColumn[0-15] := 0
PrevColStartPixel[0-15] := 0
CurrentColumn := 0
2 Do ProcessColumn
3 CurrentColumn++
4 If (CurrentColumn <= LastValidColumn)
Goto 2

The steps involved in the processing a column (Process Column) are as follows:

1 S2StartPixel := 0
FIFO := 0
BlackDetectCount := 0
WhiteDetectCount := 0
ThisColumnDetected := FALSE
PrevCaseWasCase2 := FALSE
2 If (! TargetDetected[Target]) & (! ColumnDetected[Target])
 ProcessCases
EndIf
3 PrevCaseWasCase2 := Case=2
4 Advance FIFO

The processing for each of the 3 (Process Cases) cases is as follows:

Case 1:

BlackDetectCount[target] < 8 Δ := ABS(S2StartPixel −
OR PrevColStartPixel[Target])
WhiteDetectCount[Target] = 0 If (0<=Δ< 2)
 BlackDetectCount[Target]++
 (max value =8)
Else
 BlackDetectCount[Target] := 1
 WhiteDetectCount[Target] := 0
EndIf
PrevColStartPixel[Target] :=
S2StartPixel
ColumnDetected[Target] := TRUE
BitDetected = 1
BlackDetectCount[target] >= 8 PrevColStartPixel[Target] :=
WhiteDetectCount[Target] != 0 S2StartPixel
ColumnDetected[Target] := TRUE
BitDetected = 1
TargetDetected[Target] := TRUE
TargetColumn[Target] :=
CurrentColumn − 8 −
(WhiteDetectCount[Target]/2)

Case 2:

No special processing is recorded except for setting the ‘PrevCaseWasCase2’ flag for identifying Case 3 (see Step 3 of processing a column described above)

Case 3:

PrevCaseWasCase2 = TRUE If (WhiteDetectCount[Target] < 2)
BlackDetectCount[Target] >= 8  TargetRow[Target] =
WhiteDetectCount=1 S2StartPixel + (S2RunLength/2)
EndIf
Δ := ABS(S2StartPixel −
PrevColStartPixel[Target])
If (0<=Δ< 2)
 WhiteDetectCount[Target]++
Else
 WhiteDetectCount[Target] := 1
EndIf
PrevColStartPixel[Target] :=
S2StartPixel
ThisColumnDetected := TRUE
BitDetected = 0

At the end of processing a given column, a comparison is made of the current column to the maximum number of columns for target detection. If the number of columns allowed has been exceeded, then it is necessary to check how many targets have been found. If fewer than 8 have been found, the card is considered invalid.

Process Targets

After the targets have been detected, they should be processed. All the targets may be available or merely some of them. Some targets may also have been erroneously detected.

This phase of processing is to determine a mathematical line that passes through the center of as many targets as possible. The more targets that the line passes through, the more confident the target position has been found. The limit is set to be 8 targets. If a line passes through at least 8 targets, then it is taken to be the right one.

It is all right to take a brute-force but straightforward approach since there is the time to do so (see below), and lowering complexity makes testing easier. It is necessary to determine the line between targets 0 and 1 (if both targets are considered valid) and then determine how many targets fall on this line. Then we determine the line between targets 0 and 2, and repeat the process. Eventually we do the same for the line between targets 1 and 2, 1 and 3 etc. and finally for the line between targets 14 and 15. Assuming all the targets have been found, we need to perform 15+14+13+ . . . =90 sets of calculations (with each set of calculations requiring 16 tests=1440 actual calculations), and choose the line which has the maximum number of targets found along the line. The algorithm for target location can be as follows:

TargetA := 0
MaxFound := 0
BestLine := 0
While (TargetA < 15)
If (TargetA is Valid)
TargetB:= TargetA + 1
While (TargetB<= 15)
If (TargetB is valid)
CurrentLine := line between TargetA and TargetB
TargetC := 0;
While (TargetC <= 15)
If (TargetC valid AND TargetC on line AB)
TargetsHit++
EndIf
If (TargetsHit > MaxFound)
MaxFound := TargetsHit
BestLine := CurrentLine
EndIf
TargetC++
EndWhile
EndIf
TargetB ++
EndWhile
EndIf
TargetA++
EndWhile
If (MaxFound < 8)
Card is Invalid
Else
Store expected centroids for rows based on BestLine
EndIf

As illustrated in FIG. 34, in the algorithm above, to determine a CurrentLine 260 from Target A 261 and target B, it is necessary to calculate Δrow (264) & Δcolumn (263) between targets 261, 262, and the location of Target A. It is then possible to move from Target 0 to Target 1 etc. by adding Δrow and Δcolumn. The found (if actually found) location of target N can be compared to the calculated expected position of Target N on the line, and if it falls within the tolerance, then Target N is determined to be on the line.

To calculate Δrow & Δcolumn:
Grow=(rowTargetA−rowTargetB)/(B−A)
Δcolumn=(columnTargetA−columnTargetB)/(B−A)

Then we calculate the position of Target0:
row=rowTargetA−(A*Δrow)
column=columnTargetA−(A*Δcolumn)

And compare (row, column) against the actual rowTarget0 and columnTarget0. To move from one expected target to the next (e.g. from Target0 to Target1), we simply add Δrow and Δcolumn to row and column respectively. To check if each target is on the line, we must calculate the expected position of Target0 and then perform one add and one comparison for each target ordinate.

At the end of comparing all 16 targets against a maximum of 90 lines, the result is the best line through the valid targets. If that line passes through at least 8 targets (i.e. MaxFound >=8), it can be said that enough targets have been found to form a line, and thus the card can be processed. If the best line passes through fewer than 8, then the card is considered invalid.

The resulting algorithm takes 180 divides to calculate Δrow and Δcolumn, 180 multiply/adds to calculate target0 position, and then 2880 adds/comparisons. The time we have to perform this processing is the time taken to read 36 columns of pixel data=3,374,892 ns. Not even accounting for the fact that an add takes less time than a divide, it is necessary to perform 3240 mathematical operations in 3,374,892 ns. That gives approximately 1040 ns per operation, or 104 cycles. The CPU can therefore safely perform the entire processing of targets, reducing complexity of design.

Update Centroids Based on Data Edge Border and Clockmarks

Step 0: Locate the Data Area

From Target 0 (241 of FIG. 38) it is a predetermined fixed distance in rows and columns to the top left border 244 of the data area, and then a further 1 dot column to the vertical clock marks 276. So we use TargetA, Δrow and Δcolumn found in the previous stage (Δrow and Δcolumn refer to distances between targets) to calculate the centroid or expected location for Target0 as described previously.

Since the fixed pixel offset from Target0 to the data area is related to the distance between targets (192 dots between targets, and 24 dots between Target0 and the data area 243), simply add Δrow/8 to Target0's centroid column coordinate (aspect ratio of dots is 1:1). Thus the top co-ordinate can be defined as:
(columnDotColumnTop=columnTarget0+(Δrow/8)
(rowDotcolumnTop=rowTarget0+(Δcolumn/8)

Next Δrow and Δcolumn are updated to give the number of pixels between dots in a single column (instead of between targets) by dividing them by the number of dots between targets:
Δrow=Δrow/192
Δcolumn=Δcolumn/192

We also set the currentColumn register (see Phase 2) to be −1 so that after step 2, when phase 2 begins, the currentColumn register will increment from −1 to 0.

Step 1: Write Out the Initial Centroid Deltas (Δ) and Bit History

This simply involves writing setup information required for Phase 2.

This can be achieved by writing 0 s to all the Δrow and Δcolumn entries for each row, and a bit history. The bit history is actually an expected bit history since it is known that to the left of the clock mark column 276 is a border column 277, and before that, a white area. The bit history therefore is 011, 010, 011, 010 etc.

Step 2: Update the Centroids Based on Actual Pixels Read.

The bit history is set up in Step 1 according to the expected clock marks and data border. The actual centroids for each dot row can now be more accurately set (they were initially 0) by comparing the expected data against the actual pixel values. The centroid updating mechanism is achieved by simply performing step 3 of Phase 2.

Phase 2—Detect Bit Pattern from Artcard Based on Pixels Read, and Write as Bytes.

Since a dot from the Artcard 9 requires a minimum of 9 sensed pixels over 3 columns to be represented, there is little point in performing dot detection calculations every sensed pixel column. It is better to average the time required for processing over the average dot occurrence, and thus make the most of the available processing time. This allows processing of a column of dots from an Artcard 9 in the time it takes to read 3 columns of data from the Artcard. Although the most likely case is that it takes 4 columns to represent a dot, the 4th column will be the last column of one dot and the first column of a next dot. Processing should therefore be limited to only 3 columns.

As the pixels from the CCD are written to the DRAM in 13% of the time available, 83% of the time is available for processing of 1 column of dots i.e. 83% of (93,747*3)=83% of 281,241 ns=233,430 ns.

In the available time, it is necessary to detect 3150 dots, and write their bit values into the raw data area of memory. The processing therefore requires the following steps:

For each column of dots on the Artcard:

Step 0: Advance to the next dot column

Step 1: Detect the top and bottom of an Artcard dot column (check clock marks)

Step 2: Process the dot column, detecting bits and storing them appropriately

Step 3: Update the centroids

Since we are processing the Artcard's logical dot columns, and these may shift over 165 pixels, the worst case is that we cannot process the first column until at least 165 columns have been read into DRAM. Phase 2 would therefore finish the same amount of time after the read process had terminated. The worst case time is: 165*93,747 ns=15,468,255 ns or 0.015 seconds.

Step 0: Advance to the Next Dot Column

In order to advance to the next column of dots we add Δrow and Δcolumn to the dotColumnTop to give us the centroid of the dot at the top of the column. The first time we do this, we are currently at the clock marks column 276 to the left of the bit image data area, and so we advance to the first column of data. Since Δrow and Δcolumn refer to distance between dots within a column, to move between dot columns it is necessary to add Δrow to columndotColumnTop and Δcolumn to rowdotColumnTop.

To keep track of what column number is being processed, the column number is recorded in a register called CurrentColumn. Every time the sensor advances to the next dot column it is necessary to increment the CurrentColumn register. The first time it is incremented, it is incremented from −1 to 0 (see Step 0 Phase 1). The CurrentColumn register determines when to terminate the read process (when reaching maxColumns), and also is used to advance the DataOut Pointer to the next column of byte information once all 8 bits have been written to the byte (once every 8 dot columns). The lower 3 bits determine what bit we're up to within the current byte. It will be the same bit being written for the whole column.

Step 1: Detect the Top and Bottom of an Artcard Dot Column.

In order to process a dot column from an Artcard, it is necessary to detect the top and bottom of a column. The column should form a straight line between the top and bottom of the column (except for local warping etc.). Initially dotColumnTop points to the clock mark column 276. We simply toggle the expected value, write it out into the bit history, and move on to step 2, whose first task will be to add the Δrow and Δcolumn values to dotColumnTop to arrive at the first data dot of the column.

Step 2: Process an Artcard's Dot Column

Given the centroids of the top and bottom of a column in pixel coordinates the column should form a straight line between them, with possible minor variances due to warping etc.

Assuming the processing is to start at the top of a column (at the top centroid coordinate) and move down to the bottom of the column, subsequent expected dot centroids are given as:
rownext=row+Δrow
columnnext=column+Δcolumn

This gives us the address of the expected centroid for the next dot of the column. However to account for local warping and error we add another Δrow and Δcolumn based on the last time we found the dot in a given row. In this way we can account for small drifts that accumulate into a maximum drift of some percentage from the straight line joining the top of the column to the bottom.

We therefore keep 2 values for each row, but store them in separate tables since the row history is used in step 3 of this phase.

For each row we need to read a Δrow and Δcolumn to determine the change to the centroid. The read process takes 5% of the bandwidth and 2 cache lines:
76*(3150/32)+2*3150=13,824 ns=5% of bandwidth

Once the centroid has been determined, the pixels around the centroid need to be examined to detect the status of the dot and hence the value of the bit. In the worst case a dot covers a 4×4 pixel area. However, thanks to the fact that we are sampling at 3 times the resolution of the dot, the number of pixels required to detect the status of the dot and hence the bit value is much less than this. We only require access to 3 columns of pixel columns at any one time.

In the worst case of pixel drift due to a 1% rotation, centroids will shift 1 column every 57 pixel rows, but since a dot is 3 pixels in diameter, a given column will be valid for 171 pixel rows (3*57). As a byte contains 2 pixels, the number of bytes valid in each buffered read (4 cache lines) will be a worst case of 86 (out of 128 read).

Once the bit has been detected it must be written out to DRAM. We store the bits from 8 columns as a set of contiguous bytes to minimize DRAM delay. Since all the bits from a given dot column will correspond to the next bit position in a data byte, we can read the old value for the byte, shift and OR in the new bit, and write the byte back. The read/shift&OR/write process requires 2 cache lines.

We need to read and write the bit history for the given row as we update it. We only require 3 bits of history per row, allowing the storage of 2 rows of history in a single byte. The read/shift&OR/write process requires 2 cache lines.

The total bandwidth required for the bit detection and storage is summarized in the following table:

Read centroid Δ 5%
Read 3 columns of pixel data 19%
Read/Write detected bits into byte buffer 10%
Read/Write bit history 5%
TOTAL 39%

Detecting a Dot

The process of detecting the value of a dot (and hence the value of a bit) given a centroid is accomplished by examining 3 pixel values and getting the result from a lookup table. The process is fairly simple and is illustrated in FIG. 42. A dot 290 has a radius of about 1.5 pixels. Therefore the pixel 291 that holds the centroid, regardless of the actual position of the centroid within that pixel, should be 100% of the dot's value. If the centroid is exactly in the center of the pixel 291, then the pixels above 292 & below 293 the centroid's pixel, as well as the pixels to the left 294 & right 295 of the centroid's pixel will contain a majority of the dot's value. The further a centroid is away from the exact center of the pixel 295, the more likely that more than the center pixel will have 100% coverage by the dot.

Although FIG. 42 only shows centroids differing to the left and below the center, the same relationship obviously holds for centroids above and to the right of center. center. In Case 1, the centroid is exactly in the center of the middle pixel 295. The center pixel 295 is completely covered by the dot, and the pixels above, below, left, and right are also well covered by the dot. In Case 2, the centroid is to the left of the center of the middle pixel 291. The center pixel is still completely covered by the dot, and the pixel 294 to the left of the center is now completely covered by the dot. The pixels above 292 and below 293 are still well covered. In Case 3, the centroid is below the center of the middle pixel 291. The center pixel 291 is still completely covered by the dot 291, and the pixel below center is now completely covered by the dot. The pixels left 294 and right 295 of center are still well covered. In Case 4, the centroid is left and below the center of the middle pixel. The center pixel 291 is still completely covered by the dot, and both the pixel to the left of center 294 and the pixel below center 293 are completely covered by the dot.

The algorithm for updating the centroid uses the distance of the centroid from the center of the middle pixel 291 in order to select 3 representative pixels and thus decide the value of the dot:

Pixel 1: the pixel containing the centroid

Pixel 2: the pixel to the left of Pixel 1 if the centroid's X coordinate (column value) is <½, otherwise the pixel to the right of Pixel 1.

Pixel 3: the pixel above pixel 1 if the centroid's Y coordinate (row value) is <½, otherwise the pixel below Pixel 1.

As shown in FIG. 43, the value of each pixel is output to a pre-calculated lookup table 301. The 3 pixels are fed into a 12-bit lookup table, which outputs a single bit indicating the value of the dot—on or off. The lookup table 301 is constructed at chip definition time, and can be compiled into about 500 gates. The lookup table can be a simple threshold table, with the exception that the center pixel (Pixel 1) is weighted more heavily.

Step 3: Update the Centroid Δs for Each Row in the Column

The idea of the Δs processing is to use the previous bit history to generate a ‘perfect’ dot at the expected centroid location for each row in a current column. The actual pixels (from the CCD) are compared with the expected ‘perfect’ pixels. If the two match, then the actual centroid location must be exactly in the expected position, so the centroid Δs must be valid and not need updating. Otherwise a process of changing the centroid Δs needs to occur in order to best fit the expected centroid location to the actual data. The new centroid Δs will be used for processing the dot in the next column.

Updating the centroid Δs is done as a subsequent process from Step 2 for the following reasons:

to reduce complexity in design, so that it can be performed as Step 2 of Phase 1 there is enough bandwidth remaining to allow it to allow reuse of DRAM buffers, and

to ensure that all the data required for centroid updating is available at the start of the process without special pipelining.

The centroid Δ are processed as Δcolumn Δrow respectively to reduce complexity.

Although a given dot is 3 pixels in diameter, it is likely to occur in a 4×4 pixel area. However the edge of one dot will as a result be in the same pixel as the edge of the next dot. For this reason, centroid updating requires more than simply the information about a given single dot.

FIG. 44 shows a single dot 310 from the previous column with a given centroid 311. In this example, the dot 310 extend Δ over 4 pixel columns 312-315 and in fact, part of the previous dot column's dot (coordinate=(Prevcolumn, Current Row)) has entered the current column for the dot on the current row. If the dot in the current row and column was white, we would expect the rightmost pixel column 314 from the previous dot column to be a low value, since there is only the dot information from the previous column's dot (the current column's dot is white). From this we can see that the higher the pixel value is in this pixel column 315, the more the centroid should be to the right Of course, if the dot to the right was also black, we cannot adjust the centroid as we cannot get information sub-pixel. The same can be said for the dots to the left, above and below the dot at dot coordinates (PrevColumn, CurrentRow).

From this we can say that a maximum of 5 pixel columns and rows are required. It is possible to simplify the situation by taking the cases of row and column centroid Δs separately, treating them as the same problem, only rotated 90 degrees.

Taking the horizontal case first, it is necessary to change the column centroid Δs if the expected pixels don't match the detected pixels. From the bit history, the value of the bits found for the Current Row in the current dot column, the previous dot column, and the (previous-1)th dot column are known. The expected centroid location is also known. Using these two pieces of information, it is possible to generate a 20 bit expected bit pattern should the read be ‘perfect’. The 20 bit bit-pattern represents the expected Δ values for each of the 5 pixels across the horizontal dimension. The first nibble would represent the rightmost pixel of the leftmost dot. The next 3 nibbles represent the 3 pixels across the center of the dot 310 from the previous column, and the last nibble would be the leftmost pixel 317 of the rightmost dot (from the current column).

If the expected centroid is in the center of the pixel, we would expect a 20 bit pattern based on the following table:

Bit history Expected pixels
000 00000
001 0000D
010 0DFD0
011 0DFDD
100 D0000
101 D000D
110 DDFD0
111 DDFDD

The pixels to the left and right of the center dot are either 0 or D depending on whether the bit was a 0 or 1 respectively. The center three pixels are either 000 or DFD depending on whether the bit was a 0 or 1 respectively. These values are based on the physical area taken by a dot for a given pixel. Depending on the distance of the centroid from the exact center of the pixel, we would expect data shifted slightly, which really only affects the pixels either side of the center pixel. Since there are 16 possibilities, it is possible to divide the distance from the center by 16 and use that amount to shift the expected pixels.

Once the 20 bit 5 pixel expected value has been determined it can be compared against the actual pixels read. This can proceed by subtracting the expected pixels from the actual pixels read on a pixel by pixel basis, and finally adding the differences together to obtain a distance from the expected A values.

FIG. 45 illustrates one form of implementation of the above algorithm which includes a look up table 320 which receives the bit history 322 and central fractional component 323 and outputs 324 the corresponding 20 bit number which is subtracted 321 from the central pixel input 326 to produce a pixel difference 327.

This process is carried out for the expected centroid and once for a shift of the centroid left and right by 1 amount in Δcolumn. The centroid with the smallest difference from the actual pixels is considered to be the ‘winner’ and the Δcolumn updated accordingly (which hopefully is ‘no change’). As a result, a Δcolumn cannot change by more than 1 each dot column.

The process is repeated for the vertical pixels, and Δrow is consequentially updated.

There is a large amount of scope here for parallelism. Depending on the rate of the clock chosen for the ACP unit 31 these units can be placed in series (and thus the testing of 3 different A could occur in consecutive clock cycles), or in parallel where all 3 can be tested simultaneously. If the clock rate is fast enough, there is less need for parallelism.

Bandwidth Utilization

It is necessary to read the old Δ of the Δs, and to write them out again. This takes 10% of the bandwidth:
2*(76(3150/32)+2*3150)=27,648 ns=10% of bandwidth

It is necessary to read the bit history for the given row as we update its Δs. Each byte contains 2 row's bit histories, thus taking 2.5% of the bandwidth:
76((3150/2)/32)+2*(3150/2)=4,085 ns=2.5% of bandwidth

In the worst case of pixel drift due to a 1% rotation, centroids will shift 1 column every 57 pixel rows, but since a dot is 3 pixels in diameter, a given pixel column will be valid for 171 pixel rows (3*57). As a byte contains 2 pixels, the number of bytes valid in cached reads will be a worst case of 86 (out of 128 read). The worst case timing for 5 columns is therefore 31% bandwidth.
5*(((9450/(128*2))*320)*128/86)=88,112 ns=31% of bandwidth.

The total bandwidth required for the updating the centroid Δ is summarised in the following table:

Read/Write centroid Δ 10%
Read bit history 2.5% 
Read 5 columns of pixel data 31%
TOTAL 43.5%  

Memory Usage for Phase 2:

The 2 MB bit-image DRAM area is read from and written to during phase 2 processing. the 2 MB pixel-data DRAM area is read.

The 0.5 MB scratch DRAM area is used for storing row data, namely:

Centroid array 24 bits (16:8) * 2 * 3150 = 18,900 byes
Bit History array 3 bits * 3150 entries (2 per byte) = 1575 bytes

Phase 3—Unscramble and XOR the raw data

Returning to FIG. 37, the next step in decoding is to unscramble and XOR the raw data. The 2 MB byte image, as taken from the Artcard, is in a scrambled XORed form. It must be unscrambled and re-XORed to retrieve the bit image necessary for the Reed Solomon decoder in phase 4.

Turning to FIG. 46, the unscrambling process 330 takes a 2 MB scrambled byte image 331 and writes an unscrambled 2 MB image 332. The process cannot reasonably be performed in-place, so 2 sets of 2 MB areas are utilised. The scrambled data 331 is in symbol block order arranged in a 16×16 array, with symbol block 0 (334) having all the symbol 0's from all the code words in random order. Symbol block 1 has all the symbol 1's from all the code words in random order etc. Since there are only 255 symbols, the 256th symbol block is currently unused.

A linear feedback shift register is used to determine the relationship between the position within a symbol block eg. 334 and what code word eg. 355 it came from. This works as long as the same seed is used when generating the original Artcard images. The XOR of bytes from alternative source lines with 0xAA and 0x55 respectively is effectively free (in time) since the bottleneck of time is waiting for the DRAM to be ready to read/write to non-sequential addresses.

The timing of the unscrambling XOR process is effectively 2 MB of random byte-reads, and 2 MB of random byte-writes i.e. 2*(2 MB*76 ns+2 MB*2 ns)=327,155,712 ns or approximately 0.33 seconds. This timing assumes no caching.

Phase 4—Reed Solomon Decode

This phase is a loop, iterating through copies of the data in the bit image, passing them to the Reed-Solomon decode module until either a successful decode is made or until there are no more copies to attempt decode from.

The Reed-Solomon decoder used can be the VLIW processor, suitably programmed or, alternatively, a separate hardwired core such as LSI Logic's L64712. The L64712 has a throughput of 50 Mbits per second (around 6.25 MB per second), so the time may be bound by the speed of the Reed-Solomon decoder rather than the 2 MB read and 1 MB write memory access time (500 MB/sec for sequential accesses). The time taken in the worst case is thus 2/6.25 s=approximately 0.32 seconds. Of course, other artcard formats are possible.

Phase 5 Running the Vark script

The overall time taken to read the Artcard 9 and decode it is therefore approximately 2.15 seconds. The apparent delay to the user is actually only 0.65 seconds (the total of Phases 3 and 4), since the Artcard stops moving after 1.5 seconds.

Once the Artcard is loaded, the Artvark script must be interpreted, Rather than run the script immediately, the script is only run upon the pressing of the ‘Print’ button 13 (FIG. 1). The taken to run the script will vary depending on the complexity of the script, and must be taken into account for the perceived delay between pressing the print button and the actual print button and the actual printing.

As noted previously, the VLIW processor 74 is a digital processing system that accelerates computationally expensive Vark functions. The balance of functions performed in software by the CPU core 72, and in hardware by the VLIW processor 74 will be implementation dependent. The goal of the VLIW processor 74 is to assist all Artcard styles to execute in a time that does not seem too slow to the user. As CPUs become faster and more powerful, the number of functions requiring hardware acceleration becomes less and less. The VLIW processor has a microcoded ALU sub-system that allows general hardware speed up of the following time-critical functions.

1) Image access mechanisms for general software processing

2) Image convolver.

3) Data driven image warper

4) Image scaling

5) Image tessellation

6) Affine transform

7) Image compositor

8) Color space transform

9) Histogram collector

10) Illumination of the Image

11) Brush stamper

12) Histogram collector

13) CCD image to internal image conversion

14) Construction of image pyramids (used by warper & for brushing)

The following table summarizes the time taken for each Vark operation if implemented in the ALU model. The method of implementing the function using the ALU model is described hereinafter.

1500 * 1000 image
Operation Speed of Operation 1 channel 3 channels
Image composite 1 cycle per output 0.015 s 0.045 s
pixel
Image convolve k/3 cycles per
output pixel
(k = kernel size)
3 × 3 convolve 0.045 s 0.135 s
5 × 5 convolve 0.125 s 0.375 s
7 × 7 convolve 0.245 s 0.735 s
Image warp 8 cycles per pixel 0.120 s 0.360 s
Histogram collect 2 cycles per pixel 0.030 s 0.090 s
Image Tessellate ⅓ cycle per pixel 0.005 s 0.015 s
Image sub-pixel 1 cycle per
Translate output pixel
Color lookup replace ½ cycle per pixel 0.008 s 0.023
Color space transform 8 cycles per pixel 0.120 s 0.360 s
Convert CCD image 4 cycles per output  0.06 s  0.18 s
to internal image pixel
(including color
convert & scale)
Construct image 1 cycle per input 0.015 s 0.045 s
pyramid pixel
Scale Maximum of: 0.015 s 0.045 s
2 cycles per input (minimum) (minimum)
pixel
2 cycles per output
pixel
2 cycles per output
pixel (scaled in X
only)
Affine transform 2 cycles per  0.03 s  0.09 s
output pixel
Brush rotate/translate ?
and composite
Tile Image 4-8 cycles per 0.015 s to 0.060 s to
output pixel 0.030 s 0.120 s
to for 4
channels
(Lab,
texture)
Illuminate image Cycles per pixel
Ambient only ½ 0.008 s 0.023 s
Directional light  1 0.015 s 0.045 s
Directional (bm)  6  0.09 s  0.27 s
Omni light  6  0.09 s  0.27 s
Omni (bm)  9 0.137 s  0.41 s
Spotlight  9 0.137 s  0.41 s
Spotlight (bm) 12  0.18 s  0.54 s
(bm) = bumpmap

For example, to convert a CCD image, collect histogram & perform lookup-color replacement (for image enhancement) takes: 9+2+0.5 cycles per pixel, or 11.5 cycles. For a 1500×1000 image that is 172,500,000, or approximately 0.2 seconds per component, or 0.6 seconds for all 3 components. Add a simple warp, and the total comes to 0.6+0.36, almost 1 second.

Image Convolver

A convolve is a weighted average around a center pixel. The average may be a simple sum, a sum of absolute values, the absolute value of a sum, or sums truncated at 0.

The image convolver is a general-purpose convolver, allowing a variety of functions to be implemented by varying the values within a variable-sized coefficient kernel. The kernel sizes supported are 3×3, 5×5 and 7×7 only.

Turning now to FIG. 82, there is illustrated 340 an example of the convolution process. The pixel component values fed into the convolver process 341 come from a Box Read Iterator 342. The Iterator 342 provides the image data row by row, and within each row, pixel by pixel. The output from the convolver 341 is sent to a Sequential Write Iterator 344, which stores the resultant image in a valid image format.

A Coefficient Kernel 346 is a lookup table in DRAM. The kernel is arranged with coefficients in the same order as the Box Read Iterator 342. Each coefficient entry is 8 bits. A simple Sequential Read Iterator can be used to index into the kernel 346 and thus provide the coefficients. It simulates an image with ImageWidth equal to the kernel size, and a Loop option is set so that the kernel would continuously be provided.

One form of implementation of the convolve process on an ALU unit is as illustrated in FIG. 81. The following constants are set by software:

Constant Value
K1 Kernel size (9, 25, or 49)

The control logic is used to count down the number of multiply/adds per pixel. When the count (accumulated in Latch2) reaches 0, the control signal generated is used to write out the current convolve value (from Latch1) and to reset the count. In this way, one control logic block can be used for a number of parallel convolve streams.

Each cycle the multiply ALU can perform one multiply/add to incorporate the appropriate part of a pixel. The number of cycles taken to sum up all the values is therefore the number of entries in the kernel. Since this is compute bound, it is appropriate to divide the image into multiple sections and process them in parallel on different ALU units.

On a 7×7 kernel, the time taken for each pixel is 49 cycles, or 490 ns. Since each cache line holds 32 pixels, the time available for memory access is 12,740 ns. ((32−7+1)×490 ns). The time taken to read 7 cache lines and write 1 is worse case 1,120 ns (8*140 ns, all accesses to same DRAM bank). Consequently it is possible to process up to 10 pixels in parallel given unlimited resources. Given a limited number of ALUs it is possible to do at best 4 in parallel. The time taken to therefore perform the convolution using a 7×7 kernel is 0.18375 seconds (1500*1000*490 ns/4=183,750,000 ns).

On a 5×5 kernel, the time taken for each pixel is 25 cycles, or 250 ns. Since each cache line holds 32 pixels, the time available for memory access is 7,000 ns. ((32−5+1)×250 ns). The time taken to read 5 cache lines and write 1 is worse case 840 ns (6*140 ns, all accesses to same DRAM bank). Consequently it is possible to process up to 7 pixels in parallel given unlimited resources. Given a limited number of ALUs it is possible to do at best 4. The time taken to therefore perform the convolution using a 5×5 kernel is 0.09375 seconds (1500*1000*250 ns/4=93,750,000 ns).

On a 3×3 kernel, the time taken for each pixel is 9 cycles, or 90 ns. Since each cache line holds 32 pixels, the time available for memory access is 2,700 ns. ((32-3+1)×90 ns). The time taken to read 3 cache lines and write 1 is worse case 560 ns (4*140 ns, all accesses to same DRAM bank). Consequently it is possible to process up to 4 pixels in parallel given unlimited resources. Given a limited number of ALUs and Read/Write Iterators it is possible to do at best 4. The time taken to therefore perform the convolution using a 3×3 kernel is 0.03375 seconds (1500*1000*90 ns/4=33,750,000 ns).

Consequently each output pixel takes kernelsize/3 cycles to compute. The actual timings are summarised in the following table:

Time taken to Time to process Time to Process
calculate output 1 channel at 3 channels at
Kernel size pixel 1500 × 1000 1500 × 1000
3 × 3 (9) 3 cycles 0.045 seconds 0.135 seconds
5 × 5 (25) 8⅓ cycles 0.125 seconds 0.375 seconds
7 × 7 (49) 16⅓ cycles 0.245 seconds 0.735 seconds

Image Compositor

Compositing is to add a foreground image to a background image using a matte or a channel to govern the appropriate proportions of background and foreground in the final image. Two styles of compositing are preferably supported, regular compositing and associated compositing. The rules for the two styles are:

Regular composite: new Value=Foreground+(Background−Foreground) a

Associated composite: new value=Foreground+(1−a) Background

The difference then, is that with associated compositing, the foreground has been pre-multiplied with the matte, while in regular compositing it has not. An example of the compositing process is as illustrated in FIG. 83.

The alpha channel has values from 0 to 255 corresponding to the range 0 to 1.

Regular Composite

A regular composite is implemented as:
Foreground+(Background−Foreground)*α/255

The division by X/255 is approximated by 257X/65536. An implementation of the compositing process is shown in more detail in FIG. 84, where the following constant is set by software:

Constant Value
K1 257

Since 4 Iterators are required, the composite process takes 1 cycle per pixel, with a utilization of only half of the ALUs. The composite process is only run on a single channel. To composite a 3-channel image with another, the compositor must be run 3 times, once for each channel.

The time taken to composite a full size single channel is 0.015 s (1500*1000*1*10 ns), or 0.045 s to composite all 3 channels.

To approximate a divide by 255 it is possible to multiply by 257 and then divide by 65536. It can also be achieved by a single add (256*x+x) and ignoring (except for rounding purposes) the final 16 bits of the result.

As shown in FIG. 42, the compositor process requires 3 Sequential Read Iterators 351-353 and 1 Sequential Write Iterator 355, and is implemented as microcode using a Adder ALU in conjunction with a multiplier ALU. Composite time is 1 cycle (10 ns) per-pixel. Different microcode is required for associated and regular compositing, although the average time per pixel composite is the same.

The composite process is only run on a single channel. To composite one 3-channel image with another, the compositor must be run 3 times, once for each channel. As the a channel is the same for each composite, it must be read each time. However it should be noted that to transfer (read or write) 4×32 byte cache-lines in the best case takes 320 ns. The pipeline gives an average of 1 cycle per pixel composite, taking 32 cycles or 320 ns (at 100 MHz) to composite the 32 pixels, so the a channel is effectively read for free. An entire channel can therefore be composited in:
1500/32*1000*320 ns=15,040,000 ns=0.015 seconds.

The time taken to composite a full size 3 channel image is therefore 0.045 seconds.

Construct Image Pyramid

Several functions, such as warping, tiling and brushing, require the average value of a given area of pixels. Rather than calculate the value for each area given, these functions preferably make use of an image pyramid. As illustrated previously in FIG. 33, an image pyramid 360 is effectively a multi-resolution pixelmap. The original image is a 1:1 representation. Sub-sampling by 2:1 in each dimension produces an image ¼ the original size. This process continues until the entire image is represented by a single pixel.

An image pyramid is constructed from an original image, and consumes ⅓ of the size taken up by the original image (¼+ 1/16+ 1/64+ . . . ). For an original image of 1500×1000 the corresponding image pyramid is approximately ½ MB

The image pyramid can be constructed via a 3×3 convolve performed on 1 in 4 input image pixels advancing the center of the convolve kernel by 2 pixels each dimension. A 3×3 convolve results in higher accuracy than simply averaging 4 pixels, and has the added advantage that coordinates on different pyramid levels differ only by shifting 1 bit per level.

The construction of an entire pyramid relies on a software loop that calls the pyramid level construction function once for each level of the pyramid.

The timing to produce 1 level of the pyramid is 9/4*¼ of the resolution of the input image since we are generating an image ¼ of the size of the original. Thus for a 1500×1000 image:

Timing to produce level 1 of pyramid=9/4*750*500=843,750 cycles

Timing to produce level 2 of pyramid=9/4*375*250=210,938 cycles

Timing to produce level 3 of pyramid=9/4*188*125=52,735 cycles

Etc.

The total time is ¾ cycle per original image pixel (image pyramid is ⅓ of original image size, and each pixel takes 9/4 cycles to be calculated, i.e. ⅓* 9/4=¾). In the case of a 1500×1000 image is 1,125,000 cycles (at 100 MHz), or 0.011 seconds. This timing is for a single color channel, 3 color channels require 0.034 seconds processing time.

General Data Driven Image Warper

The ACP 31 is able to carry out image warping manipulations of the input image. The principles of image warping are well-known in theory. One thorough text book reference on the process of warping is “Digital Image Warping” by George Wolberg published in 1990 by the IEEE Computer Society Press, Los Alamitos, Calif. The warping process utilizes a warp map which forms part of the data fed in via Artcard 9. The warp map can be arbitrarily dimensioned in accordance with requirements and provides information of a mapping of input pixels to output pixels. Unfortunately, the utilization of arbitrarily sized warp maps presents a number of problems which must be solved by the image warper.

Turning to FIG. 85, a warp map 365, having dimensions A×B comprises array values of a certain magnitude (for example 8 bit values from 0-255) which set out the coordinate of a theoretical input image which maps to the corresponding “theoretical” output image having the same array coordinate indices. Unfortunately, any output image eg. 366 will have its own dimensions CxD which may further be totally different from an input image which may have its own dimensions ExF. Hence, it is necessary to facilitate the remapping of the warp map 365 so that it can be utilised for output image 366 to determine, for each output pixel, the corresponding area or region of the input image 367 from which the output pixel color data is to be constructed. For each output pixel in output image 366 it is necessary to first determine a corresponding warp map value from warp map 365. This may include the need to bilinearly interpolate the surrounding warp map values when an output image pixel maps to a fractional position within warp map table 365. The result of this process will give the location of an input image pixel in a “theoretical” image which will be dimensioned by the size of each data value within the warp map 365. These values must be re-scaled so as to map the theoretical image to the corresponding actual input image 367.

In order to determine the actual value and output image pixel should take so as to avoid aliasing effects, adjacent output image pixels should be examined to determine a region of input image pixels 367 which will contribute to the final output image pixel value. In this respect, the image pyramid is utilised as will become more apparent hereinafter.

The image warper performs several tasks in order to warp an image.

As noted previously, in a data driven warp, there is the need for a warp map that describes, for each output pixel, the center of a corresponding input image map. Instead of having a single warp map as previously described, containing interleaved x and y value information, it is possible to treat the X and Y coordinates as separate channels.

Consequently, preferably there are two warp maps: an X warp map showing the warping of X coordinates, and a Y warp map, showing the warping of the Y coordinates. As noted previously, the warp map 365 can have a different spatial resolution than the image they being scaled (for example a 32×32 warp-map 365 may adequately describe a warp for a 1500×1000 image 366). In addition, the warp maps can be represented by 8 or 16 bit values that correspond to the size of the image being warped.

There are several steps involved in producing points in the input image space from a given warp map:

1. Determining the corresponding position in the warp map for the output pixel

2. Fetch the values from the warp map for the next step (this can require scaling in the resolution domain if the warp map is only 8 bit values)

3. Bi-linear interpolation of the warp map to determine the actual value

4. Scaling the value to correspond to the input image domain

The first step can be accomplished by multiplying the current X/Y coordinate in the output image by a scale factor (which can be different in X & Y). For example, if the output image was 1500×1000, and the warp map was 150×100, we scale both X & Y by 1/10.

Fetching the values from the warp map requires access to 2 Lookup tables. One Lookup table indexes into the X warp-map, and the other indexes into the Y warp-map. The lookup table either reads 8 or 16 bit entries from the lookup table, but always returns 16 bit values (clearing the high 8 bits if the original values are only 8 bits).

The next step in the pipeline is to bi-linearly interpolate the looked-up warp map values.

Finally the result from the bi-linear interpolation is scaled to place it in the same domain as the image to be warped. Thus, if the warp map range was 0-255, we scale X by 1500/255, and Y by 1000/255.

The interpolation process is as illustrated in FIG. 86 with the following constants set by software:

Constant Value
K1 Xscale (scales 0-ImageWidth to 0-WarpmapWidth)
K2 Yscale (scales 0-ImageHeight to 0-WarpmapHeight)
K3 XrangeScale (scales warpmap range (eg 0-255) to
0-ImageWidth)
K4 YrangeScale (scales warpmap range (eg 0-255) to
0-ImageHeight)

The following lookup table is used:

Lookup Size Details
LU1 and WarpmapWidth × Warpmap lookup.
LU2 WarpmapHeight Given [X, Y] the 4 entries required for
bi-linear interpolation are returned. Even if
entries are only 8 bit, they are returned as
16 bit (high 8 bits 0). Transfer time is 4
entries at 2 bytes per entry. Total time is
8 cycles as 2 lookups are used.

Span Calculation

The points from the warp map 365 locate centers of pixel regions in the input image 367. The distance between input image pixels of adjacent output image pixels will indicate the size of the regions, and this distance can be approximated via a span calculation.

Turning to FIG. 87, for a given current point in the warp map P1, the previous point on the same line is called P0, and the previous line's point at the same position is called P2. We determine the absolute distance in X & Y between P1 and P0, and between P1 and P2. The maximum distance in X or Y becomes the span which will be a square approximation of the actual shape.

Preferably, the points are processed in a vertical strip output order, P0 is the previous point on the same line within a strip, and when P1 is the first point on line within a strip, then P0 refers to the last point in the previous strip's corresponding line. P2 is the previous line's point in the same strip, so it can be kept in a 32-entry history buffer. The basic of the calculate span process are as illustrated in FIG. 88 with the details of the process as illustrated in FIG. 89.

The following DRAM FIFO is used:

Lookup Size Details
FIFO1 8 ImageWidth bytes. P2 history/lookup (both X & Y in same
[ImageWidth × 2 FIFO)
entries at 32 bits per P1 is put into the FIFO and taken out
entry] again at the same pixel on the following
row as P2. Transfer time is 4 cycles
(2 × 32 bits, with 1 cycle per 16 bits)

Since a 32 bit precision span history is kept, in the case of a 1500 pixel wide image being warped 12,000 bytes temporary storage is required.

Calculation of the span 364 uses 2 Adder ALUs (1 for span calculation, 1 for looping and counting for P0 and P2 histories) takes 7 cycles as follows:

Cycle Action
1 A = ABS(P1x − P2x)
Store P1x in P2x history
2 B = ABS(P1x − P0x)
Store P1x in P0x history
3 A = MAX(A, B)
4 B = ABS(P1y − P2y)
Store P1y in P2y history
5 A = MAX(A, B)
6 B = ABS(P1y − P0y)
Store P1y in P0y history
7 A = MAX(A, B)

The history buffers 365, 366 are cached DRAM. The ‘Previous Line’ (for P2 history) buffer 366 is 32 entries of span-precision. The ‘Previous Point’ (for P0 history). Buffer 365 requires 1 register that is used most of the time (for calculation of points 1 to 31 of a line in a strip), and a DRAM buffered set of history values to be used in the calculation of point 0 in a strip's line.

32 bit precision in span history requires 4 cache lines to hold P2 history, and 2 for P0 history. P0's history is only written and read out once every 8 lines of 32 pixels to a temporary storage space of (ImageHeight*4) bytes. Thus a 1500 pixel high image being warped requires 6000 bytes temporary storage, and a total of 6 cache lines.

Tri-Linear Interpolation

Having determined the center and span of the area from the input image to be averaged, the final part of the warp process is to determine the value of the output pixel. Since a single output pixel could theoretically be represented by the entire input image, it is potentially too time-consuming to actually read and average the specific area of the input image contributing to the output pixel. Instead, it is possible to approximate the pixel value by using an image pyramid of the input image.

If the span is 1 or less, it is necessary only to read the original image's pixels around the given coordinate, and perform bi-linear interpolation. If the span is greater than 1, we must read two appropriate levels of the image pyramid and perform tri-linear interpolation. Performing linear interpolation between two levels of the image pyramid is not strictly correct, but gives acceptable results (it errs on the side of blurring the resultant image).

Turning to FIG. 90, generally speaking, for a given span ‘s’, it is necessary to read image pyramid levels given by ln2s (370) and ln2s+1 (371). Ln2s is simply decoding the highest set bit of s. We must bi-linear interpolate to determine the value for the pixel value on each of the two levels 370,371 of the pyramid, and then interpolate between levels.

As shown in FIG. 91, it is necessary to first interpolate in X and Y for each pyramid level before interpolating between the pyramid levels to obtain a final output value 373.

The image pyramid address mode issued to generate addresses for pixel coordinates at (x, y) on pyramid level s & s+1. Each level of the image pyramid contains pixels sequential in x. Hence, reads in x are likely to be cache hits.

Reasonable cache coherence can be obtained as local regions in the output image are typically locally coherent in the input image (perhaps at a different scale however, but coherent within the scale). Since it is not possible to know the relationship between the input and output images, we ensure that output pixels are written in a vertical strip (via a Vertical-Strip Iterator) in order to best make use of cache coherence.

Tri-linear interpolation can be completed in as few as 2 cycles on average using 4 multiply ALUs and all 4 adder ALUs as a pipeline and assuming no memory access required. But since all the interpolation values are derived from the image pyramids, interpolation speed is completely dependent on cache coherence (not to mention the other units are busy doing warp-map scaling and span calculations). As many cache lines as possible should therefore be available to the image-pyramid reading. The best speed will be 8 cycles, using 2 Multiply ALUs.

The output pixels are written out to the DRAM via a Vertical-Strip Write Iterator that uses 2 cache lines. The speed is therefore limited to a minimum of 8 cycles per output pixel. If the scaling of the warp map requires 8 or fewer cycles, then the overall speed will be unchanged. Otherwise the throughput is the time taken to scale the warp map. In most cases the warp map will be scaled up to match the size of the photo.

Assuming a warp map that requires 8 or fewer cycles per pixel to scale, the time taken to convert a single color component of image is therefore 0.12 s (1500*1000*8 cycles*10 ns per cycle).

Histogram Collector

The histogram collector is a microcode program that takes an image channel as input, and produces a histogram as output. Each of a channel's pixels has a value in the range 0-255. Consequently there are 256 entries in the histogram table, each entry 32 bits—large enough to contain a count of an entire 1500×1000 image.

As shown in FIG. 92, since the histogram represents a summary of the entire image, a Sequential Read Iterator 378 is sufficient for the input. The histogram itself can be completely cached, requiring 32 cache lines (1K).

The microcode has two passes: an initialization pass which sets all the counts to zero, and then a “count” stage that increments the appropriate counter for each pixel read from the image. The first stage requires the Address Unit and a single Adder ALU, with the address of the histogram table 377 for initialising.

Relative
Microcode Address Unit
Address A = Base address of histogram Adder Unit 1
0 Write 0 to Out1 = A
A + (Adder1.Out1 << 2) A = A − 1
BNZ 0
1 Rest of processing Rest of processing

The second stage processes the actual pixels from the image, and uses 4 Adder ALUs:

Adder 1 Adder 2 Adder 3 Adder 4 Address Unit
1 A = 0 A = −1
2 Out1 = A A = A = A = A + 1 Out1 = Read 4 bytes
BZ 2 A = pixel Adder1.Out1 Adr.Out1 from: (A +
Z = pixel − (Adder1.Out1 << 2))
Adder1.Out1
3 Out1 = A Out1 = A Out1 = A Write Adder4.Out1
A = to: (A + (Adder2.
Adder3.Out1 Out << 2)
4 Write Adder4.Out1
to: (A + (Adder2.
Out << 2)
Flush caches

The Zero flag from Adder2 cycle 2 is used to stay at microcode address 2 for as long as the input pixel is the same. When it changes, the new count is written out in microcode address 3, and processing resumes at microcode address 2. Microcode address 4 is used at the end, when there are no more pixels to be read.

Stage 1 takes 256 cycles, or 2560 ns. Stage 2 varies according to the values of the pixels. The worst case time for lookup table replacement is 2 cycles per image pixel if every pixel is not the same as its neighbor. The time taken for a single color lookup is 0.03 s (1500×1000×2 cycle per pixel×10 ns per cycle=30,000,000 ns). The time taken for 3 color components is 3 times this amount, or 0.09 s.

Color Transform

Color transformation is achieved in two main ways:

As illustrated in FIG. 86, one of the simplest ways to transform the color of a pixel is to encode an arbitrarily complex transform function into a lookup table 380. The component color value of the pixel is used to lookup 381 the new component value of the pixel. For each pixel read from a Sequential Read Iterator, its new value is read from the New Color Table 380, and written to a Sequential Write Iterator 383. The input image can be processed simultaneously in two halves to make effective use of memory bandwidth. The following lookup table is used:

Lookup Size Details
LU1 256 entries Replacement[X]
8 bits per entry Table indexed by the 8 highest significant
bits of X. Resultant 8 bits treated as fixed
point 0:8

The total process requires 2 Sequential Read Iterators and 2 Sequential Write iterators. The 2 New Color Tables require 8 cache lines each to hold the 256 bytes (256 entries of 1 byte).

The average time for lookup table replacement is therefore ½ cycle per image pixel. The time taken for a single color lookup is 0.0075 s (1500×1000×½ cycle per pixel×10 ns per cycle=7,500,000 ns). The time taken for 3 color components is 3 times this amount, or 0.0225 s. Each color component has to be processed one after the other under control of software.

Color Space Conversion

Color Space conversion is only required when moving between color spaces. The CCD images are captured in RGB color space, and printing occurs in CMY color space, while clients of the ACP 31 likely process images in the Lab color space. All of the input color space channels are typically required as input to determine each output channel's component value. Thus the logical process is as illustrated 385 in FIG. 94.

Simply, conversion between Lab, RGB, and CMY is fairly straightforward. However the individual color profile of a particular device can vary considerably. Consequently, to allow future CCDs, inks, and printers, the ACP 31 performs color space conversion by means of tri-linear interpolation from color space conversion lookup tables.

Color coherence tends to be area based rather than line based. To aid cache coherence during tri-linear interpolation lookups, it is best to process an image in vertical strips. Thus the read 386-388 and write 389 iterators would be Vertical-Strip Iterators.

Tri-Linear Color Space Conversion

For each output color component, a single 3D table mapping the input color space to the output color component is required. For example, to convert CCD images from RGB to Lab, 3 tables calibrated to the physical characteristics of the CCD are required:

To convert from Lab to CMY, 3 tables calibrated to the physical characteristics of the ink/printer are required:

The 8-bit input color components are treated as fixed-point numbers (3:5) in order to index into the conversion tables. The 3 bits of integer give the index, and the 5 bits of fraction are used for interpolation. Since 3 bits gives 8 values, 3 dimensions gives 512 entries (8×8×8). The size of each entry is 1 byte, requiring 512 bytes per table.

The Convert Color Space process can therefore be implemented as shown in FIG. 95 and the following lookup table is used:

Lookup Size Details
LU1 8 × 8 × 8 entries Convert[X, Y, Z]
512 entries Table indexed by the 3 highest bits of
8 bits per entry X, Y, and Z. 8 entries returned from
Tri-linear index address unit Resultant 8 bits
treated as fixed point 8:0 Transfer time is
8 entries at 1 byte per entry

Tri-linear interpolation returns interpolation between 8 values. Each 8 bit value takes 1 cycle to be returned from the lookup, for a total of 8 cycles. The tri-linear interpolation also takes 8 cycles when 2 Multiply ALUs are used per cycle. General tri-linear interpolation information is given in the ALU section of this document. The 512 bytes for the lookup table fits in 16 cache lines.

The time taken to convert a single color component of image is therefore 0.105 s (1500*1000*7 cycles*10 ns per cycle). To convert 3 components takes 0.415 s. Fortunately, the color space conversion for printout takes place on the fly during printout itself, so is not a perceived delay.

If color components are converted separately, they must not overwrite their input color space components since all color components from the input color space are required for converting each component.

Since only 1 multiply unit is used to perform the interpolation, it is alternatively possible to do the entire Lab->CMY conversion as a single pass. This would require 3 Vertical-Strip Read Iterators, 3 Vertical-Strip Write Iterators, and access to 3 conversion tables simultaneously. In that case, it is possible to write back onto the input image and thus use no extra memory. However, access to 3 conversion tables equals ⅓ of the caching for each, that could lead to high latency for the overall process.

Affine Transform

Prior to compositing an image with a photo, it may be necessary to rotate, scale and translate it. If the image is only being translated, it can be faster to use a direct sub-pixel translation function. However, rotation, scale-up and translation can all be incorporated into a single affine transform.

A general affine transform can be included as an accelerated function. Affine transforms are limited to 2D, and if scaling down, input images should be pre-scaled via the Scale function. Having a general affine transform function allows an output image to be constructed one block at a time, and can reduce the time taken to perform a number of transformations on an image since all can be applied at the same time.

A transformation matrix needs to be supplied by the client—the matrix should be the inverse matrix of the transformation desired i.e. applying the matrix to the output pixel coordinate will give the input coordinate.

A 2D matrix is usually represented as a 3×3 array:

[ a b 0 c d 0 e f 1 ]

Since the 3rd column is always[0, 0, 1] clients do not need to specify it. Clients instead specify a, b, c, d, e, and f.

Given a coordinate in the output image (x, y) whose top left pixel coordinate is given as (0, 0), the input coordinate is specified by: (ax+cy+e, bx+dy+f). Once the input coordinate is determined, the input image is sampled to arrive at the pixel value. Bi-linear interpolation of input image pixels is used to determine the value of the pixel at the calculated coordinate. Since affine transforms preserve parallel lines, images are processed in output vertical strips of 32 pixels wide for best average input image cache coherence.

Three Multiply ALUs are required to perform the bi-linear interpolation in 2 cycles. Multiply ALUs 1 and 2 do linear interpolation in X for lines Y and Y+1 respectively, and Multiply ALU 3 does linear interpolation in Y between the values output by Multiply ALUs 1 and 2.

As we move to the right across an output line in X, 2 Adder ALUs calculate the actual input image coordinates by adding ‘a’ to the current X value, and ‘b’ to the current Y value respectively. When we advance to the next line (either the next line in a vertical strip after processing a maximum of 32 pixels, or to the first line in a new vertical strip) we update X and Y to pre-calculated start coordinate values constants for the given block

The process for calculating an input coordinate is given in FIG. 96 where the following constants are set by software:

Calculate Pixel

Once we have the input image coordinates, the input image must be sampled. A lookup table is used to return the values at the specified coordinates in readiness for bilinear interpolation. The basic process is as indicated in FIG. 97 and the following lookup table is used:

Lookup Size Details
LU1 Image Bilinear Image lookup [X, Y]
width by Table indexed by the integer part of X and Y.
Image 4 entries returned from Bilinear index address unit,
height 2 per cycle.
8 bits per Each 8 bit entry treated as fixed point 8:0
entry Transfer time is 2 cycles (2 16 bit entries in FIFO
hold the 4 8 bit entries)

The affine transform requires all 4 Multiply Units and all 4 Adder ALUs, and with good cache coherence can perform an affine transform with an average of 2 cycles per output pixel. This timing assumes good cache coherence, which is true for non-skewed images. Worst case timings are severely skewed images, which meaningful Vark scripts are unlikely to contain.

The time taken to transform a 128×128 image is therefore 0.00033 seconds (32,768 cycles). If this is a clip image with 4 channels (including a channel), the total time taken is 0.00131 seconds (131,072 cycles).

A Vertical-Strip Write Iterator is required to output the pixels. No Read Iterator is required. However, since the affine transform accelerator is bound by time taken to access input image pixels, as many cache lines as possible should be allocated to the read of pixels from the input image. At least 32 should be available, and preferably 64 or more.

Scaling

Scaling is essentially a re-sampling of an image. Scale up of an image can be performed using the Affine Transform function. Generalized scaling of an image, including scale down, is performed by the hardware accelerated Scale function. Scaling is performed independently in X and Y, so different scale factors can be used in each dimension.

The generalized scale unit must match the Affine Transform scale function in terms of registration. The generalized scaling process is as illustrated in FIG. 98. The scale in X is accomplished by Fant's re-sampling algorithm as illustrated in FIG. 99.

Where the following constants are set by software:

Constant Value
K1 Number of input pixels that contribute to an output pixel in X
K2 1/K1

The following registers are used to hold temporary variables:

Variable Value
Latch1 Amount of input pixel remaining unused
(starts at 1 and decrements)
Latch2 Amount of input pixels remaining to contribute to current
output pixel (starts at K1 and decrements)
Latch3 Next pixel (in X)
Latch4 Current pixel
Latch5 Accumulator for output pixel (unscaled)
Latch6 Pixel Scaled in X (output)

The Scale in Y process is illustrated in FIG. 100 and is also accomplished by a slightly altered version of Fant's re-sampling algorithm to account for processing in order of X pixels.

Where the following constants are set by software:

Constant Value
K1 Number of input pixels that contribute to an output pixel in Y
K2 1/K1

The following registers are used to hold temporary variables:

Variable Value
Latch1 Amount of input pixel remaining unused
(starts at 1 and decrements)
Latch2 Amount of input pixels remaining to contribute to current
output pixel (starts at K1 and decrements)
Latch3 Next pixel (in Y)
Latch4 Current pixel
Latch5 Pixel Scaled in Y (output)

The following DRAM FIFOs are used:

Lookup Size Details
FIFO1 ImageWidthOUT entries 1 row of image pixels already
8 bits per entry scaled in X
1 cycle transfer time
FIFO2 ImageWidthOUT entries 1 row of image pixels already
16 bits per entry scaled in X
2 cycles transfer time
(1 byte per cycle)

Tessellate Image

Tessellation of an image is a form of tiling. It involves copying a specially designed “tile” multiple times horizontally and vertically into a second (usually larger) image space. When tessellated, the small tile forms a seamless picture. One example of this is a small tile of a section of a brick wall. It is designed so that when tessellated, it forms a full brick wall. Note that there is no scaling or sub-pixel translation involved in tessellation.

The most cache-coherent way to perform tessellation is to output the image sequentially line by line, and to repeat the same line of the input image for the duration of the line. When we finish the line, the input image must also advance to the next line (and repeat it multiple times across the output line).

An overview of the tessellation function is illustrated 390 in FIG. 101. The Sequential Read Iterator 392 is set up to continuously read a single line of the input tile (StartLine would be 0 and EndLine would be 1). Each input pixel is written to all 3 of the Write Iterators 393-395. A counter 397 in an Adder ALU counts down the number of pixels in an output line, terminating the sequence at the end of the line.

At the end of processing a line, a small software routine updates the Sequential Read Iterator's StartLine and EndLine registers before restarting the microcode and the Sequential Read Iterator (which clears the FIFO and repeats line 2 of the tile). The Write Iterators 393-395 are not updated, and simply keep on writing out to their respective parts of the output image. The net effect is that the tile has one line repeated across an output line, and then the tile is repeated vertically too.

This process does not fully use the memory bandwidth since we get good cache coherence in the input image, but it does allow the tessellation to function with tiles of any size. The process uses 1 Adder ALU. If the 3 Write Iterators 393-395 each write to ⅓ of the image (breaking the image on tile sized boundaries), then the entire tessellation process takes place at an average speed of ⅓ cycle per output image pixel. For an image of 1500×1000, this equates to 0.005 seconds (5,000,000 ns).

Sub-Pixel Translator

Before compositing an image with a background, it may be necessary to translate it by a sub-pixel amount in both X and Y. Sub-pixel transforms can increase an image's size by 1 pixel in each dimension. The value of the region outside the image can be client determined, such as a constant value (e.g. black), or edge pixel replication. Typically it will be better to use black.

The sub-pixel translation process is as illustrated in FIG. 102. Sub-pixel translation in a given dimension is defined by:
Pixelout=Pixelin*(1−Translation)+Pixelin-1*Translation

It can also be represented as a form of interpolation:
Pixelout=Pixelin-1+(Pixelin−Pixelin-1)*Translation

Implementation of a single (on average) cycle interpolation engine using a single Multiply ALU and a single Adder ALU in conjunction is straightforward. Sub-pixel translation in both X & Y requires 2 interpolation engines.

In order to sub-pixel translate in Y, 2 Sequential Read Iterators 400, 401 are required (one is reading a line ahead of the other from the same image), and a single Sequential Write Iterator 403 is required.

The first interpolation engine (interpolation in Y) accepts pairs of data from 2 streams, and linearly interpolates between them. The second interpolation engine (interpolation in X) accepts its data as a single 1 dimensional stream and linearly interpolates between values. Both engines interpolate in 1 cycle on average.

Each interpolation engine 405, 406 is capable of performing the sub-pixel translation in 1 cycle per output pixel on average. The overall time is therefore 1 cycle per output pixel, with requirements of 2 Multiply ALUs and 2 Adder ALUs.

The time taken to output 32 pixels from the sub-pixel translate function is on average 320 ns (32 cycles). This is enough time for 4 full cache-line accesses to DRAM, so the use of 3 Sequential Iterators is well within timing limits.

The total time taken to sub-pixel translate an image is therefore 1 cycle per pixel of the output image. A typical image to be sub-pixel translated is a tile of size 128*128. The output image size is 129*129. The process takes 129*129*10 ns=166,410 ns.

The Image Tiler function also makes use of the sub-pixel translation algorithm, but does not require the writing out of the sub-pixel-translated data, but rather processes it further.

Image Tiler

The high level algorithm for tiling an image is carried out in software. Once the placement of the tile has been determined, the appropriate colored tile must be composited. The actual compositing of each tile onto an image is carried out in hardware via the microcoded ALUs. Compositing a tile involves both a texture application and a color application to a background image. In some cases it is desirable to compare the actual amount of texture added to the background in relation to the intended amount of texture, and use this to scale the color being applied. In these cases the texture must be applied first.

Since color application functionality and texture application functionality are somewhat independent, they are separated into sub-functions.

The number of cycles per 4-channel tile composite for the different texture styles and coloring styles is summarized in the following table:

Constant Pixel
color color
Replace texture 4 4.75
25% background + tile texture 4 4.75
Average height algorithm 5 5.75
Average height algorithm with feedback 5.75 6.5

Tile Coloring and Compositing

A tile is set to have either a constant color (for the whole tile), or takes each pixel value from an input image. Both of these cases may also have feedback from a texturing stage to scale the opacity (similar to thinning paint).

The steps for the 4 cases can be summarised as:

Each of the 4 cases is treated separately, in order to minimize the time taken to perform the function. The summary of time per color compositing style for a single color channel is described in the following table:

Feedback from
No feedback texture
from texture (cycles per
Tiling color style (cycles per pixel) pixel)
Tile has constant color per pixel 1 2
Tile has per pixel color from 1.25 2
input image

Constant Color

In this case, the tile has a constant color, determined by software. While the ACP 31 is placing down one tile, the software can be determining the placement and coloring of the next tile.

The color of the tile can be determined by bi-linear interpolation into a scaled version of the image being tiled. The scaled version of the image can be created and stored in place of the image pyramid, and needs only to be performed once per entire tile operation. If the tile size is 128×128, then the image can be scaled down by 128:1 in each dimension.

Without Feedback

When there is no feedback from the texturing of a tile, the tile is simply placed at the specified coordinates. The tile color is used for each pixel's color, and the opacity for the composite comes from the tile's sub-pixel translated opacity channel. In this case color channels and the texture channel can be processed completely independently between tiling passes.

The overview of the process is illustrated in FIG. 103. Sub-pixel translation 410 of a tile can be accomplished using 2 Multiply ALUs and 2 Adder ALUs in an average time of 1 cycle per output pixel. The output from the sub-pixel translation is the mask to be used in compositing 411 the constant tile color 412 with the background image from background sequential Read Iterator.

Compositing can be performed using 1 Multiply ALU and 1 Adder ALU in an average time of 1 cycle per composite. Requirements are therefore 3 Multiply ALUs and 3 Adder ALUs. 4 Sequential Iterators 413-416 are required, taking 320 ns to read or write their contents. With an average number of cycles of 1 per pixel to sub-pixel translate and composite, there is sufficient time to read and write the buffers.

With Feedback

When there is feedback from the texturing of a tile, the tile is placed at the specified coordinates. The tile color is used for each pixel's color, and the opacity for the composite comes from the tile's sub-pixel translated opacity channel scaled by the feedback parameter. Thus the texture values must be calculated before the color value is applied.

The overview of the process is illustrated in FIG. 97. Sub-pixel translation of a tile can be accomplished using 2 Multiply ALUs and 2 Adder ALUs in an average time of 1 cycle per output pixel. The output from the sub-pixel translation is the mask to be scaled according to the feedback read from the Feedback Sequential Read Iterator 420. The feedback is passed it to a Scaler (1 Multiply ALU) 421.

Compositing 422 can be performed using 1 Multiply ALU and 1 Adder ALU in an average time of 1 cycle per composite. Requirements are therefore 4 Multiply ALUs and all 4 Adder ALUs. Although the entire process can be accomplished in 1 cycle on average, the bottleneck is the memory access, since 5 Sequential Iterators are required. With sufficient buffering, the average time is 1.25 cycles per pixel.

Color from Input Image

One way of coloring pixels in a tile is to take the color from pixels in an input image. Again, there are two possibilities for compositing: with and without feedback from the texturing.

Without Feedback

In this case, the tile color simply comes from the relative pixel in the input image. The opacity for compositing comes from the tile's opacity channel sub-pixel shifted.

The overview of the process is illustrated in FIG. 105. Sub-pixel translation 425 of a tile can be accomplished using 2 Multiply ALUs and 2 Adder ALUs in an average time of 1 cycle per output pixel. The output from the sub-pixel translation is the mask to be used in compositing 426 the tile's pixel color (read from the input image 428) with the background image 429.

Compositing 426 can be performed using 1 Multiply ALU and 1 Adder ALU in an average time of 1 cycle per composite. Requirements are therefore 3 Multiply ALUs and 3 Adder ALUs. Although the entire process can be accomplished in 1 cycle on average, the bottleneck is the memory access, since 5 Sequential Iterators are required. With sufficient buffering, the average time is 1.25 cycles per pixel.

With Feedback

In this case, the tile color still comes from the relative pixel in the input image, but the opacity for compositing is affected by the relative amount of texture height actually applied during the texturing pass. This process is as illustrated in FIG. 106.

Sub-pixel translation 431 of a tile can be accomplished using 2 Multiply ALUs and 2 Adder ALUs in an average time of 1 cycle per output pixel. The output from the sub-pixel translation is the mask to be scaled 431 according to the feedback read from the Feedback Sequential Read Iterator 432. The feedback is passed to a Scaler (1 Multiply ALU) 431.

Compositing 434 can be performed using 1 Multiply ALU and 1 Adder ALU in an average time of 1 cycle per composite.

Requirements are therefore all 4 Multiply ALUs and 3 Adder ALUs. Although the entire process can be accomplished in 1 cycle on average, the bottleneck is the memory access, since 6 Sequential Iterators are required. With sufficient buffering, the average time is 1.5 cycles per pixel.

Tile Texturing

Each tile has a surface texture defined by its texture channel. The texture must be sub-pixel translated and then applied to the output image. There are 3 styles of texture compositing:

In addition, the Average height algorithm can save feedback parameters for color compositing.

The time taken per texture compositing style is summarised in the following table:

Cycles per pixel Cycles per pixel
(no feedback from (feedback from
Tiling color style texture) texture)
Replace texture 1
25% background + tile 1
texture value
Average height algorithm 2 2

Replace Texture

In this instance, the texture from the tile replaces the texture channel of the image, as illustrated in FIG. 107. Sub-pixel translation 436 of a tile's texture can be accomplished using 2 Multiply ALUs and 2 Adder ALUs in an average time of 1 cycle per output pixel. The output from this sub-pixel translation is fed directly to the Sequential Write Iterator 437.

The time taken for replace texture compositing is 1 cycle per pixel. There is no feedback, since 100% of the texture value is always applied to the background. There is therefore no requirement for processing the channels in any particular order.

25% Background+Tile's Texture

In this instance, the texture from the tile is added to 25% of the existing texture value. The new value must be greater than or equal to the original value. In addition, the new texture value must be clipped at 255 since the texture channel is only 8 bits. The process utilised is illustrated in FIG. 108.

Sub-pixel translation 440 of a tile's texture can be accomplished using 2 Multiply ALUs and 2 Adder ALUs in an average time of 1 cycle per output pixel. The output from this sub-pixel translation 440 is fed to an adder 441 where it is added to ¼ 442 of the background texture value. Min and Max functions 444 are provided by the 2 adders not used for sub-pixel translation and the output written to a Sequential Write Iterator 445.

The time taken for this style of texture compositing is 1 cycle per pixel. There is no feedback, since 100% of the texture value is considered to have been applied to the background (even if clipping at 255 occurred). There is therefore no requirement for processing the channels in any particular order.

Average Height Algorithm

In this texture application algorithm, the average height under the tile is computed, and each pixel's height is compared to the average height. If the pixel's height is less than the average, the stroke height is added to the background height. If the pixel's height is greater than or equal to the average, then the stroke height is added to the average height. Thus background peaks thin the stroke. The height is constrained to increase by a minimum amount to prevent the background from thinning the stroke application to 0 (the minimum amount can be 0 however). The height is also clipped at 255 due to the 8-bit resolution of the texture channel.

There can be feedback of the difference in texture applied versus the expected amount applied. The feedback amount can be used as a scale factor in the application of the tile's color.

In both cases, the average texture is provided by software, calculated by performing a bi-level interpolation on a scaled version of the texture map. Software determines the next tile's average texture height while the current tile is being applied. Software must also provide the minimum thickness for addition, which is typically constant for the entire tiling process.

Without Feedback

With no feedback, the texture is simply applied to the background texture, as shown in FIG. 109.

4 Sequential Iterators are required, which means that if the process can be pipelined for 1 cycle, the memory is fast enough to keep up.

Sub-pixel translation 450 of a tile's texture can be accomplished using 2 Multiply ALUs and 2 Adder ALUs in an average time of 1 cycle per output pixel. Each Min & Max function 451,452 requires a separate Adder ALU in order to complete the entire operation in 1 cycle. Since 2 are already used by the sub-pixel translation of the texture, there are not enough remaining for a 1 cycle average time.

The average time for processing 1 pixel's texture is therefore 2 cycles. Note that there is no feedback, and hence the color channel order of compositing is irrelevant.

With Feedback

This is conceptually the same as the case without feedback, except that in addition to the standard processing of the texture application algorithm, it is necessary to also record the proportion of the texture actually applied. The proportion can be used as a scale factor for subsequent compositing of the tile's color onto the background image. A flow diagram is illustrated in FIG. 110 and the following lookup table is used:

Lookup Size Details
LU1 256 entries 1/N
16 bits per entry Table indexed by N (range 0-255)
Resultant 16 bits treated as fixed point 0:16

Each of the 256 entries in the software provided 1/N table 460 is 16 bits, thus requiring 16 cache lines to hold continuously.

Sub-pixel translation 461 of a tile's texture can be accomplished using 2 Multiply ALUs and 2 Adder ALUs in an average time of 1 cycle per output pixel. Each Min 462 & Max 463 function requires a separate Adder ALU in order to complete the entire operation in 1 cycle. Since 2 are already used by the sub-pixel translation of the texture, there are not enough remaining for a 1 cycle average time.

The average time for processing 1 pixel's texture is therefore 2 cycles. Sufficient space must be allocated for the feedback data area (a tile sized image channel). The texture must be applied before the tile's color is applied, since the feedback is used in scaling the tile's opacity.

CCD Image Interpolator

Images obtained from the CCD via the ISI 83 (FIG. 3) are 750×500 pixels. When the image is captured via the ISI, the orientation of the camera is used to rotate the pixels by 0, 90, 180, or 270 degrees so that the top of the image corresponds to ‘up’. Since every pixel only has an R, G, or B color component (rather than all 3), the fact that these have been rotated must be taken into account when interpreting the pixel values. Depending on the orientation of the camera, each 2×2 pixel block has one of the configurations illustrated in FIG. 111:

Several processes need to be performed on the CCD captured image in order to transform it into a useful form for processing:

The entire channel of an image is required to be available at the same time in order to allow warping. In a low memory model (8 MB), there is only enough space to hold a single channel at full resolution as a temporary object. Thus the color conversion is to a single color channel. The limiting factor on the process is the color conversion, as it involves tri-linear interpolation from RGB to the internal color space, a process that takes 0.026 ns per channel (750×500×7 cycles per pixel×1 0 ns per cycle=26,250,000 ns).

It is important to perform the color conversion before scaling of the internal color space image as this reduces the number of pixels scaled (and hence the overall process time) by a factor of 4.

The requirements for all of the transformations may not fit in the ALU scheme. The transformations are therefore broken into two phases:

Phase 1: Up-Interpolation of Low-Sample Rate Color Components in Ccd Image (Interpreting Correct Orientation of Pixels)

Color Conversion from RGB to the Internal Color Space

Writing Out the Image in a Planar Format

Phase 2: Scaling of the Internal Space Image from 750×500 to 1500×1000

Separating out the scale function implies that the small color converted image must be in memory at the same time as the large one. The output from Phase 1 (0.5 MB) can be safely written to the memory area usually kept for the image pyramid (1 MB). The output from Phase 2 can be the general expanded CCD image. Separation of the scaling also allows the scaling to be accomplished by the Affine Transform, and also allows for a different CCD resolution that may not be a simple 1:2 expansion.

Phase 1: Up-interpolation of low-sample rate color components.

Each of the 3 color components (R, G, and B) needs to be up interpolated in order for color conversion to take place for a given pixel. We have 7 cycles to perform the interpolation per pixel since the color conversion takes 7 cycles.

Interpolation of G is straightforward and is illustrated in FIG. 112. Depending on orientation, the actual pixel value G alternates between odd pixels on odd lines & even pixels on even lines, and odd pixels on even lines & even pixels on odd lines. In both cases, linear interpolation is all that is required. Interpolation of R and B components as illustrated in FIG. 113 and FIG. 113, is more complicated, since in the horizontal and vertical directions, as can be seen from the diagrams, access to 3 rows of pixels simultaneously is required, so 3 Sequential Read Iterators are required, each one offset by a single row. In addition, we have access to the previous pixel on the same row via a latch for each row.

Each pixel therefore contains one component from the CCD, and the other 2 up-interpolated. When one component is being bi-linearly interpolated, the other is being linearly interpolated. Since the interpolation factor is a constant 0.5, interpolation can be calculated by an add and a shift 1 bit right (in 1 cycle), and bi-linear interpolation of factor 0.5 can be calculated by 3 adds and a shift 2 bits right (3 cycles). The total number of cycles required is therefore 4, using a single multiply ALU.

FIG. 115 illustrates the case for rotation 0 even line even pixel (EL, EP), and odd line odd pixel (OL, OP) and FIG. 116 illustrates the case for rotation 0 even line odd pixel (EL, OP), and odd line even pixel (OL, EP). The other rotations are simply different forms of these two expressions.

Color Conversion

Color space conversion from RGB to Lab is achieved using the same method as that described in the general Color Space Convert function, a process that takes 8 cycles per pixel. Phase 1 processing can be described with reference to FIG. 117.

The up-interpolate of the RGB takes 4 cycles (1 Multiply ALU), but the conversion of the color space takes 8 cycles per pixel (2 Multiply ALUs) due to the lookup transfer time.

Phase 2

Scaling the Image

This phase is concerned with up-interpolating the image from the CCD resolution (750×500) to the working photo resolution (1500×1000). Scaling is accomplished by running the Affine transform with a scale of 1:2. The timing of a general affine transform is 2 cycles per output pixel, which in this case means an elapsed scaling time of 0.03 seconds.

Print Head 44

FIG. 153 illustrates the logical layout of a single print Head which logically consists of 8 segments, each printing bi-level cyan, magenta, and yellow onto a portion of the page.

Loading a Segment for Printing

Before anything can be printed, each of the 8 segments in the Print Head must be loaded with 6 rows of data corresponding to the following relative rows in the final output image:

Row 0=Line N, Yellow, even dots 0, 2, 4, 6, 8, . . . .

Row 1=Line N+8, Yellow, odd dots 1, 3, 5, 7, . . . .

Row 2=Line N+10, Magenta, even dots 0, 2, 4, 6, 8, . . . .

Row 3=Line N+18, Magenta, odd dots 1, 3, 5, 7, . . . .

Row 4=Line N+20, Cyan, even dots 0, 2, 4, 6, 8, . . . .

Row 5=Line N+28, Cyan, odd dots 1, 3, 5, 7, . . . .

Each of the segments prints dots over different parts of the page. Each segment prints 750 dots of one color, 375 even dots on one row, and 375 odd dots on another. The 8 segments have dots corresponding to positions:

Segment First dot Last dot
0 0 749
1 750 1499
2 1500 2249
3 2250 2999
4 3000 3749
5 3750 4499
6 4500 5249
7 5250 5999

Each dot is represented in the Print Head segment by a single bit. The data must be loaded 1 bit at a time by placing the data on the segment's BitValue pin, and clocked in to a shift register in the segment according to a BitClock. Since the data is loaded into a shift register, the order of loading bits must be correct. Data can be clocked in to the Print Head at a maximum rate of 10 MHz.

Once all the bits have been loaded, they must be transferred in parallel to the Print Head output buffer, ready for printing. The transfer is accomplished by a single pulse on the segment's ParallelXferClock pin.

Controlling the Print

In order to conserve power, not all the dots of the Print Head have to be printed simultaneously. A set of control lines enables the printing of specific dots. An external controller, such as the ACP, can change the number of dots printed at once, as well as the duration of the print pulse in accordance with speed and/or power requirements.

Each segment has 5 NozzleSelect lines, which are decoded to select 32 sets of nozzles per row. Since each row has 375 nozzles, each set contains 12 nozzles. There are also 2 BankEnable lines, one for each of the odd and even rows of color. Finally, each segment has 3 ColorEnable lines, one for each of C, M, and Y colors. A pulse on one of the ColorEnable lines causes the specified nozzles of the color's specified rows to be printed. A pulse is typically about 2 s in duration.

If all the segments are controlled by the same set of NozzleSelect, BankEnable and ColorEnable lines (wired externally to the print head), the following is true:

If both odd and even banks print simultaneously (both BankEnable bits are set), 24 nozzles fire simultaneously per segment, 192 nozzles in all, consuming 5.7 Watts.

If odd and even banks print independently, only 12 nozzles fire simultaneously per segment, 96 in all, consuming 2.85 Watts.

Print Head Interface 62

The Print Head Interface 62 connects the ACP to the Print Head, providing both data and appropriate signals to the external Print Head. The Print Head Interface 62 works in conjunction with both a VLIW processor 74 and a software algorithm running on the CPU in order to print a photo in approximately 2 seconds.

An overview of the inputs and outputs to the Print Head Interface is shown in FIG. 119. The Address and Data Buses are used by the CPU to address the various registers in the Print Head Interface. A single BitClock output line connects to all 8 segments on the print head. The 8 DataBits lines lead one to each segment, and are clocked in to the 8 segments on the print head simultaneously (on a BitClock pulse). For example, dot 0 is transferred to segment0, dot 750 is transferred to segment1, dot 1500 to segment2 etc. simultaneously.

The VLIW Output FIFO contains the dithered bi-level C, M, and Y 6000×9000 resolution print image in the correct order for output to the 8 DataBits. The ParallelXferClock is connected to each of the 8 segments on the print head, so that on a single pulse, all segments transfer their bits at the same time. Finally, the NozzleSelect, BankEnable and ColorEnable lines are connected to each of the 8 segments, allowing the Print Head Interface to control the duration of the C, M, and Y drop pulses as well as how many drops are printed with each pulse. Registers in the Print Head Interface allow the specification of pulse durations between 0 and 6 μs, with a typical duration of 2 μs.

Printing an Image

There are 2 phases that must occur before an image is in the hand of the Artcam user:

Preparation of an image only needs to be performed once. Printing the image can be performed as many times as desired.

Prepare the Image

Preparing an image for printing involves:

At the end of image preparation, a 4.5 MB correctly oriented 1000×1500 CMY image is ready to be printed.

Convert Photo Image to Print Image

The conversion of a Photo Image into a Print Image requires the execution of a Vark script to perform image processing. The script is either a default image enhancement script or a Vark script taken from the currently inserted Artcard. The Vark script is executed via the CPU, accelerated by functions performed by the VLIW Vector Processor.

Rotate the Print Image

The image in memory is originally oriented to be top upwards. This allows for straightforward Vark processing. Before the image is printed, it must be aligned with the print roll's orientation. The re-alignment only needs to be done once. Subsequent Prints of a Print Image will already have been rotated appropriately.

The transformation to be applied is simply the inverse of that applied during capture from the CCD when the user pressed the “Image Capture” button on the Artcam. If the original rotation was 0, then no transformation needs to take place. If the original rotation was +90 degrees, then the rotation before printing needs to be −90 degrees (same as 270 degrees). The method used to apply the rotation is the Vark accelerated Affine Transform function. The Affine Transform engine can be called to rotate each color channel independently. Note that the color channels cannot be rotated in place. Instead, they can make use of the space previously used for the expanded single channel (1.5 MB).

FIG. 120 shows an example of rotation of a Lab image where the a and b channels are compressed 4:1. The L channel is rotated into the space no longer required (the single channel area), then the a channel can be rotated into the space left vacant by L, and finally the b channel can be rotated. The total time to rotate the 3 channels is 0.09 seconds. It is an acceptable period of time to elapse before the first print image. Subsequent prints do not incur this overhead.

Up Interpolate and Color Convert

The Lab image must be converted to CMY before printing. Different processing occurs depending on whether the a and b channels of the Lab image is compressed. If the Lab image is compressed, the a and b channels must be decompressed before the color conversion occurs. If the Lab image is not compressed, the color conversion is the only necessary step. The Lab image must be up interpolated (if the a and b channels are compressed) and converted into a CMY image. A single VLIW process combining scale and color transform can be used.

The method used to perform the color conversion is the Vark accelerated Color Convert function. The Affine Transform engine can be called to rotate each color channel independently. The color channels cannot be rotated in place. Instead, they can make use of the space previously used for the expanded single channel (1.5 MB).

Print the Image

Printing an image is concerned with taking a correctly oriented 1000×1500 CMY image, and generating data and signals to be sent to the external Print Head. The process involves the CPU working in conjunction with a VLIW process and the Print Head Interface.

The resolution of the image in the Artcam is 1000×1500. The printed image has a resolution of 6000×9000 dots, which makes for a very straightforward relationship: 1 pixel=6×6=36 dots. As shown in FIG. 121 since each dot is 16.6 μm, the 6×6 dot square is 100 μm square. Since each of the dots is bi-level, the output must be dithered.

The image should be printed in approximately 2 seconds. For 9000 rows of dots this implies a time of 222 μs time between printing each row. The Print Head Interface must generate the 6000 dots in this time, an average of 37 ns per dot. However, each dot comprises 3 colors, so the Print Head Interface must generate each color component in approximately 12 ns, or 1 clock cycle of the ACP (10 ns at 100 MHz). One VLIW process is responsible for calculating the next line of 6000 dots to be printed. The odd and even C, M, and Y dots are generated by dithering input from 6 different 1000×1500 CMY image lines. The second VLIW process is responsible for taking the previously calculated line of 6000 dots, and correctly generating the 8 bits of data for the 8 segments to be transferred by the Print Head Interface to the Print Head in a single transfer.

A CPU process updates registers in the fist VLIW process 3 times per print line (once per color component=27000 times in 2 seconds0, and in the 2nd VLIW process once every print line (9000 times in 2 seconds). The CPU works one line ahead of the VLIW process in order to do this.

Finally, the Print Head Interface takes the 8 bit data from the VLIW Output FIFO, and outputs it unchanged to the Print Head, producing the BitClock signals appropriately. Once all the data has been transferred a ParallelXferClock signal is generated to load the data for the next print line. In conjunction with transferring the data to the Print Head, a separate timer is generating the signals for the different print cycles of the Print Head using the NozzleSelect, ColorEnable, and BankEnable lines a specified by Print Head Interface internal registers.

The CPU also controls the various motors and guillotine via the parallel interface during the print process.

Generate C, M, and Y Dots

The input to this process is a 1000×1500 CMY image correctly oriented for printing. The image is not compressed in any way. As illustrated in FIG. 122, a VLIW microcode program takes the CMY image, and generates the C, M, and Y pixels required by the Print Head Interface to be dithered.

The process is run 3 times, once for each of the 3 color components. The process consists of 2 sub-processes run in parallel—one for producing even dots, and the other for producing odd dots. Each sub-process takes one pixel from the input image, and produces 3 output dots (since one pixel=6 output dots, and each sub-process is concerned with either even or odd dots). Thus one output dot is generated each cycle, but an input pixel is only read once every 3 cycles.

The original dither cell is a 64×64 cell, with each entry 8 bits. This original cell is divided into an odd cell and an even cell, so that each is still 64 high, but only 32 entries wide. The even dither cell contains original dither cell pixels 0, 2, 4 etc., while the odd contains original dither cell pixels 1, 3, 5 etc. Since a dither cell repeats across a line, a single 32 byte line of each of the 2 dither cells is required during an entire line, and can therefore be completely cached. The odd and even lines of a single process line are staggered 8 dot lines apart, so it is convenient to rotate the odd dither cell's lines by 8 lines. Therefore the same offset into both odd and even dither cells can be used. Consequently the even dither cell's line corresponds to the even entries of line L in the original dither cell, and the even dither cell's line corresponds to the odd entries of line L+8 in the original dither cell.

The process is run 3 times, once for each of the color components. The CPU software routine must ensure that the Sequential Read Iterators for odd and even lines are pointing to the correct image lines corresponding to the print heads. For example, to produce one set of 18,000 dots (3 sets of 6000 dots):

Subsequent sets of input image lines are:

The dither cell data however, does not need to be updated for each color component. The dither cell for the 3 colors becomes the same, but offset by 2 dot lines for each component.

The Dithered Output is written to a Sequential Write Iterator, with odd and even dithered dots written to 2 separate outputs. The same two Write Iterators are used for all 3 color components, so that they are contiguous within the break-up of odd and even dots.

While one set of dots is being generated for a print line, the previously generated set of dots is being merged by a second VLIW process as described in the next section.

Generate Merged 8 bit Dot Output

This process, as illustrated in FIG. 123, takes a single line of dithered dots and generates the 8 bit data stream for output to the Print Head Interface via the VLIW Output FIFO. The process requires the entire line to have been prepared, since it requires semi-random access to most of the dithered line at once. The following constant is set by software:

Constant Value
K1 375

The Sequential Read Iterators point to the line of previously generated dots, with the Iterator registers set up to limit access to a single color component. The distance between subsequent pixels is 375, and the distance between one line and the next is given to be 1 byte. Consequently 8 entries are read for each “line”. A single “line” corresponds to the 8 bits to be loaded on the print head. The total number of “lines” in the image is set to be 375. With at least 8 cache lines assigned to the Sequential Read Iterator, complete cache coherence is maintained. Instead of counting the 8 bits, 8 Microcode steps count implicitly.

The generation process first reads all the entries from the even dots, combining 8 entries into a single byte which is then output to the VLIW Output FIFO. Once all 3000 even dots have been read, the 3000 odd dots are read and processed. A software routine must update the address of the dots in the odd and even Sequential Read Iterators once per color component, which equates to 3 times per line. The two VLIW processes require all 8 ALUs and the VLIW Output FIFO. As long as the CPU is able to update the registers as described in the two processes, the VLIW processor can generate the dithered image dots fast enough to keep up with the printer.

Data Card Reader

FIG. 124, there is illustrated on form of card reader 500 which allows for the insertion of Artcards 9 for reading. FIG. 123 shows an exploded perspective of the reader of FIG. 124. Cardreader is interconnected to a computer system and includes a CCD reading mechanism 35. The cardreader includes pinch rollers 506, 507 for pinching an inserted Artcard 9. One of the roller e.g. 506 is driven by an Artcard motor 37 for the advancement of the card 9 between the two rollers 506 and 507 at a uniformed speed. The Artcard 9 is passed over a series of LED lights 512 which are encased within a clear plastic mould 514 having a semi circular cross section. The cross section focuses the light from the LEDs eg 512 onto the surface of the card 9 as it passes by the LEDs 512. From the surface it is reflected to a high resolution linear CCD 34 which is constructed to a resolution of approximately 480 dpi. The surface of the Artcard 9 is encoded to the level of approximately 1600 dpi hence, the linear CCD 34 supersamples the Artcard surface with an approximately three times multiplier. The Artcard 9 is further driven at a speed such that the linear CCD 34 is able to supersample in the direction of Artcard movement at a rate of approximately 4800 readings per inch. The scanned Artcard CCD data is forwarded from the Artcard reader to ACP 31 for processing. A sensor 49, which can comprise a light sensor acts to detect of the presence of the card 13.

The CCD reader includes a bottom substrate 516, a top substrate 514 which comprises a transparent molded plastic. In between the two substrates is inserted the linear CCD array 34 which comprises a thin long linear CCD array constructed by means of semi-conductor manufacturing processes.

Turning to FIG. 125, there is illustrated a side perspective view, partly in section, of an example construction of the CCD reader unit. The series of LEDs eg. 512 are operated to emit light when a card 9 is passing across the surface of the CCD reader 34. The emitted light is transmitted through a portion of the top substrate 523. The substrate includes a portion eg. 529 having a curved circumference so as to focus light emitted from LED 512 to a point eg. 532 on the surface of the card 9. The focused light is reflected from the point 532 towards the CCD array 34. A series of microlenses eg. 534, shown in exaggerated form, are formed on the surface of the top substrate 523. The microlenses 523 act to focus light received across the surface to the focused down to a point 536 which corresponds to point on the surface of the CCD reader 34 for sensing of light falling on the light sensing portion of the CCD array 34.

A number of refinements of the above arrangement are possible. For example, the sensing devices on the linear CCD 34 may be staggered. The corresponding microlenses 34 can also be correspondingly formed as to focus light into a staggered series of spots so as to correspond to the staggered CCD sensors.

To assist reading, the data surface area of the Artcard 9 is modulated with a checkerboard pattern as previously discussed with reference to FIG. 38. Other forms of high frequency modulation may be possible however.

It will be evident that an Artcard printer can be provided as for the printing out of data on storage Artcard. Hence, the Artcard system can be utilized as a general form of information distribution outside of the Artcam device. An Artcard printer can prints out Artcards on high quality print surfaces and multiple Artcards can be printed on same sheets and later separated. On a second surface of the Artcard 9 can be printed information relating to the files etc. stored on the Artcard 9 for subsequent storage.

Hence, the Artcard system allows for a simplified form of storage which is suitable for use in place of other forms of storage such as CD ROMs, magnetic disks etc. The Artcards 9 can also be mass produced and thereby produced in a substantially inexpensive form for redistribution.

Software Modules—Artcam Application 902

The Artcam Application implements the high-level functionality of the Artcam device. This normally involves capturing an image, applying an artistic effect to the image, and then printing the image. In a camera-oriented Artcam device, the image is captured via the Camera Manager 903. In a printer-oriented Artcam device, the image is captured via the Network Manager 904, perhaps as the result of the image being “squirted” by another device.

Artistic effects are found within the unified file system managed by the File Manager 905. An artistic effect consist of a script file and a set of resources. The script is interpreted and applied to the image via the Image Processing Manager 906. Scripts are normally shipped on ArtCards known as Artcards. By default the application uses the script contained on the currently mounted Artcard.

The image is printed via the Printer Manager 908.

When the Artcam device starts up, the bootstrap process starts the various manager processes before starting the application. This allows the application to immediately request services from the various managers when it starts.

On initialization the application 902 registers itself as the handler for the events listed below. When it receives an event, it performs the action described in the table.

User
interface
event Action
Lock Focus Perform any automatic pre-capture setup via the Camera
Manager. This includes auto-focussing, auto-adjusting
exposure, and charging the flash. This is normally initiated
by the user pressing the Take button halfway.
Take Capture an image via the Camera Manager.
Self-Timer Capture an image in self-timed mode via the Camera
Manager.
Flash Mode Update the Camera Manager to use the next flash mode.
Update the Status Display to show the new flash mode.
Print Print the current image via the Printer Manager. Apply an
artistic effect to the image via the Image Processing
Manager if there is a current script. Update the remaining
prints count on the Status Display (see Print Roll Inserted
below).
Hold Apply an artistic effect to the current image via the Image
Processing Manager if there is a current script, but don't
print the image.
Eject Eject the currently inserted ArtCards via the File Manager.
ArtCards
Print Roll Calculate the number of prints remaining based on the Print
Inserted Manager's remaining media length and the Camera
Manager's aspect ratio. Update the remaining prints count
on the Status display.
Print Roll Update the Status Display to indicate there is no print roll
Removed present.

Where the camera includes a display, the application also constructs a graphical user interface via the User Interface Manager 910 which allows the user to edit the current date and time, and other editable camera parameters. The application saves all persistent parameters in flash memory.

Real-Time Microkernel 911

The Real-Time Microkernel schedules processes preemptively on the basis of interrupts and process priority. It provides integrated inter-process communication and timer services, as these are closely tied to process scheduling. All other operating system functions are implemented outside the microkernel.

Camera Manager 903

The Camera Manager provides image capture services. It controls the camera hardware embedded in the Artcam. It provides an abstract camera control interface which allows camera parameters to be queried and set, and images captured. This abstract interface decouples the application from details of camera implementation. The Camera Manager utilizes the following input/output parameters and commands:

output parameters domains
focus range real, real
zoom range real, real
aperture range real, real
shutter speed range real, real

input parameters domains
focus real
zoom real
aperture real
shutter speed real
aspect ratio classic, HDTV, panoramic
focus control mode multi-point auto, single-point auto, manual
exposure control mode auto, aperture priority, shutter priority, manual
flash mode auto, auto with red-eye removal, fill, off
view scene mode on, off

commands return value domains
Lock Focus none
Self-Timed Capture Raw Image
Capture Image Raw Image

The Camera Manager runs as an asynchronous event-driven process. It contains a set of linked state machines, one for each asynchronous operation. These include auto focussing, charging the flash, counting down the self-timer, and capturing the image. On initialization the Camera Manager sets the camera hardware to a known state. This includes setting a normal focal distance and retracting the zoom. The software structure of the Camera Manager is illustrated in FIG. 128. The software components are described in the following subsections:

Lock Focus 913

Lock Focus automatically adjusts focus and exposure for the current scene, and enables the flash if necessary, depending on the focus control mode, exposure control mode and flash mode. Lock Focus is normally initiated in response to the user pressing the Take button halfway. It is part of the normal image capture sequence, but may be separated in time from the actual capture of the image, if the user holds the take button halfway depressed. This allows the user to do spot focusing and spot metering.

Capture Image 914

Capture Image captures an image of the current scene. It lights a red-eye lamp if the flash mode includes red-eye removal, controls the shutter, triggers the flash if enabled, and senses the image through the image sensor. It determines the orientation of the camera, and hence the captured image, so that the image can be properly oriented during later image processing. It also determines the presence of camera motion during image capture, to trigger deblurring during later image processing.

Self-Timed Capture 915

Self-Timed Capture captures an image of the current scene after counting down a 20 s timer. It gives the user feedback during the countdown via the self-timer LED. During the first 15 s it can light the LED. During the last 5 s it flashes the LED.

View Scene 917

View Scene periodically senses the current scene through the image sensor and displays it on the color LCD, giving the user an LCD-based viewfinder.

Auto Focus 918

Auto Focus changes the focal length until selected regions of the image are sufficiently sharp to signify that they are in focus. It assumes the regions are in focus if an image sharpness metric derived from specified regions of the image sensor is above a fixed threshold. It finds the optimal focal length by performing a gradient descent on the derivative of sharpness by focal length, changing direction and stepsize as required. If the focus control mode is multi point auto, then three regions are used, arranged horizontally across the field of view. If the focus control mode is single-point auto, then one region is used, in the center of the field of view. Auto Focus works within the available focal length range as indicated by the focus controller. In fixed-focus devices it is therefore effectively disabled.

Auto Flash 919

Auto Flash determines if scene lighting is dim enough to require the flash. It assumes the lighting is dim enough if the scene lighting is below a fixed threshold. The scene lighting is obtained from the lighting sensor, which derives a lighting metric from a central region of the image sensor. If the flash is required, then it charges the flash.

Auto Exposure 920

The combination of scene lighting, aperture, and shutter speed determine the exposure of the captured image. The desired exposure is a fixed value. If the exposure control mode is auto, Auto Exposure determines a combined aperture and shutter speed which yields the desired exposure for the given scene lighting. If the exposure control mode is aperture priority, Auto Exposure determines a shutter speed which yields the desired exposure for the given scene lighting and current aperture. If the exposure control mode is shutter priority, Auto Exposure determines an aperture which yields the desired exposure for the given scene lighting and current shutter speed. The scene lighting is obtained from the lighting sensor, which derives a lighting metric from a central region of the image sensor.

Auto Exposure works within the available aperture range and shutter speed range as indicated by the aperture controller and shutter speed controller. The shutter speed controller and shutter controller hide the absence of a mechanical shutter in most Artcam devices.

If the flash is enabled, either manually or by Auto Flash, then the effective shutter speed is the duration of the flash, which is typically in the range 1/1000 s to 1/10000 s.

Image Processing Manager 906 (FIG. 127)

The Image Processing Manager provides image processing and artistic effects services. It utilises the VLIW Vector Processor embedded in the Artcam to perform high-speed image processing. The Image Processing Manager contains an interpreter for scripts written in the Vark image processing language. An artistic effect therefore consists of a Vark script file and related resources such as fonts, clip images etc. The software structure of the Image Processing Manager is illustrated in more detail in FIG. 129 and include the following modules:

Convert and Enhance Image 921

The Image Processing Manager performs image processing in the device-independent CIE LAB color space, at a resolution which suits the reproduction capabilities of the Artcam printer hardware. The captured image is first enhanced by filtering out noise. It is optionally processed to remove motion-induced blur. The image is then converted from its device-dependent RGB color space to the CIE LAB color space. It is also rotated to undo the effect of any camera rotation at the time of image capture, and scaled to the working image resolution. The image is further enhanced by scaling its dynamic range to the available dynamic range.

Detect Faces 923

Faces are detected in the captured image based on hue and local feature analysis. The list of detected face regions is used by the Vark script for applying face-specific effects such as warping and positioning speech balloons.

Vark Image Processing Language Interpreter 924

Vark consists of a general-purpose programming language with a rich set of image processing extensions. It provides a range of primitive data types (integer, real, boolean, character), a range of aggregate data types for constructing more complex types (array, string, record), a rich set of arithmetic and relational operators, conditional and iterative control flow (if-then-else, while-do), and recursive functions and procedures. It also provides a range of image-processing data types (image, clip image, matte, color, color lookup table, palette, dither matrix, convolution kernel, etc.), graphics data types (font, text, path), a set of image-processing functions (color transformations, compositing, filtering, spatial transformations and warping, illumination, text setting and rendering), and a set of higher-level artistic functions (tiling, painting and stroking).

A Vark program is portable in two senses. Because it is interpreted, it is independent of the CPU and image processing engines of its host. Because it uses a device-independent model space and a device-independent color space, it is independent of the input color characteristics and resolution of the host input device, and the output color characteristics and resolution of the host output device.

The Vark Interpreter 924 parses the source statements which make up the Vark script and produces a parse tree which represents the semantics of the script. Nodes in the parse tree correspond to statements, expressions, sub-expressions, variables and constants in the program. The root node corresponds to the main procedure statement list.

The interpreter executes the program by executing the root statement in the parse tree. Each node of the parse tree asks its children to evaluate or execute themselves appropriately. An if statement node, for example, has three children—a condition expression node, a then statement node, and an else statement node. The if statement asks the condition expression node to evaluate itself, and depending on the boolean value returned asks the then statement or the else statement to execute itself. It knows nothing about the actual condition expression or the actual statements.

While operations on most data types are executed during execution of the parse tree, operations on image data types are deferred until after execution of the parse tree. This allows imaging operations to be optimized so that only those intermediate pixels which contribute to the final image are computed. It also allows the final image to be computed in multiple passes by spatial subdivision, to reduce the amount of memory required.

During execution of the parse tree, each imaging function simply returns an imaging graph—a graph whose nodes are imaging operators and whose leaves are images—constructed with its corresponding imaging operator as the root and its image parameters as the root's children. The image parameters are of course themselves image graphs. Thus each successive imaging function returns a deeper imaging graph.

After execution of the parse tree, an imaging graph is obtained which corresponds to the final image. This imaging graph is then executed in a depth-first manner (like any expression tree), with the following two optimizations: (1) only those pixels which contribute to the final image are computed at a given node, and (2) the children of a node are executed in the order which minimizes the amount of memory required. The imaging operators in the imaging graph are executed in the optimized order to produce the final image. Compute-intensive imaging operators are accelerated using the VLIW Processor embedded in the Artcam device. If the amount of memory required to execute the imaging graph exceeds available memory, then the final image region is subdivided until the required memory no longer exceeds available memory.

For a well-constructed Vark program the first optimization is unlikely to provide much benefit per se. However, if the final image region is subdivided, then the optimization is likely to provide considerable benefit. It is precisely this optimization, then, that allows subdivision to be used as an effective technique for reducing memory requirements. One of the consequences of deferred execution of imaging operations is that program control flow cannot depend on image content, since image content is not known during parse tree execution. In practice this is not a severe restriction, but nonetheless must be borne in mind during language design.

The notion of deferred execution (or lazy evaluation) of imaging operations is described by Guibas and Stolfi (Guibas, L. J., and J. Stolfi, “A Language for Bitmap Manipulation”, ACM Transactions on Graphics, Vol. 1, No. 3, July 1982, pp. 191-214). They likewise construct an imaging graph during the execution of a program, and during subsequent graph evaluation propagate the result region backwards to avoid computing pixels which do not contribute to the final image. Shantzis additionally propagates regions of available pixels forwards during imaging graph evaluation (Shantzis, M. A., “A Model for Efficient and Flexible Image Computing”, Computer Graphics Proceedings, Annual Conference Series, 1994, pp. 147-154). The Vark Interpreter uses the more sophisticated multi-pass bi-directional region propagation scheme described by Cameron (Cameron, S., “Efficient Bounds in Constructive Solid Geometry”, IEEE Computer Graphics & Applications, Vol. 11, No. 3, May 1991, pp. 68-74). The optimization of execution order to minimise memory usage is due to Shantzis, but is based on standard compiler theory (Aho, A. V., R. Sethi, and J. D. Ullman, “Generating Code from DAGs”, in Compilers: Principles, Techniques, and Tools, Addison-Wesley, 1986, pp. 557-567). The Vark Interpreter uses a more sophisticated scheme than Shantzis, however, to support variable-sized image buffers. The subdivision of the result region in conjunction with region propagation to reduce memory usage is also due to Shantzis.

Printer Manager 908 (FIG. 127)

The Printer Manager provides image printing services. It controls the Ink Jet printer hardware embedded in the Artcam. It provides an abstract printer control interface which allows printer parameters to be queried and set, and images printed. This abstract interface decouples the application from details of printer implementation and includes the following variables:

output parameters domains
media is present bool
media has fixed page size bool
media width real
remaining media length real
fixed page size real, real

input parameters domains
page size real, real

commands return value domains
Print Image none

output events
invalid media
media exhausted
media inserted
media removed

The Printer Manager runs as an asynchronous event-driven process. It contains a set of linked state machines, one for each asynchronous operation. These include printing the image and auto mounting the print roll. The software structure of the Printer Manager is illustrated in FIG. 130. The software components are described in the following description:

Print Image 930

Print Image prints the supplied image. It uses the VLIW Processor to prepare the image for printing. This includes converting the image color space to device-specific CMY and producing half-toned bi-level data in the format expected by the print head.

Between prints, the paper is retracted to the lip of the print roll to allow print roll removal, and the nozzles can be capped to prevent ink leakage and drying. Before actual printing starts, therefore, the nozzles are uncapped and cleared, and the paper is advanced to the print head. Printing itself consists of transferring line data from the VLIW processor, printing the line data, and advancing the paper, until the image is completely printed. After printing is complete, the paper is cut with the guillotine and retracted to the print roll, and the nozzles are capped. The remaining media length is then updated in the print roll.

Auto Mount Print Roll 131

Auto Mount Print Roll responds to the insertion and removal of the print roll. It generates print roll insertion and removal events which are handled by the application and used to update the status display. The print roll is authenticated according to a protocol between the authentication chip embedded in the print roll and the authentication chip embedded in Artcam. If the print roll fails authentication then it is rejected. Various information is extracted from the print roll. Paper and ink characteristics are used during the printing process. The remaining media length and the fixed page size of the media, if any, are published by the Print Manager and are used by the application.

User Interface Manager 910 (FIG. 127)

The User Interface Manager is illustrated in more detail if FIG. 131 and provides user interface management services. It consists of a Physical User Interface Manager 911, which controls status display and input hardware, and a Graphical User Interface Manager 912, which manages a virtual graphical user interface on the color display. The User Interface Manager translates virtual and physical inputs into events. Each event is placed in the event queue of the process registered for that event.

File Manager 905 (FIG. 128)

The File Manager provides file management services. It provides a unified hierarchical file system within which the file systems of all mounted volumes appear. The primary removable storage medium used in the Artcam is the ArtCards. A ArtCards is printed at high resolution with blocks of bi-level dots which directly representserror-tolerant Reed-Solomon-encoded binary data. The block structure supports append and append-rewrite in suitable read-write ArtCards devices (not initially used in Artcam). At a higher level a ArtCards can contain an extended append-rewriteable ISO9660 CD-ROM file system. The software structure of the File Manager, and the ArtCards Device Controller in particular, can be as illustrated in FIG. 132.

Network Manager 904 (FIG. 128)

The Network Manager provides “appliance” networking services across various interfaces including infra-red (IrDA) and universal serial bus (USB). This allows the Artcam to share captured images, and receive images for printing.

Clock Manager 907 (FIG. 128)

The Clock Manager provides date and time-of-day clock services. It utilises the battery-backed real-time clock embedded in the Artcam, and controls it to the extent that it automatically adjusts for clock drift, based on auto-calibration carried out when the user sets the time.

Power Management

When the system is idle it enters a quiescent power state during which only periodic scanning for input events occurs. Input events include the press of a button or the insertion of a ArtCards. As soon as an input event is detected the Artcam device re-enters an active power state. The system then handles the input event in the usual way.

Even when the system is in an active power state, the hardware associated with individual modules is typically in a quiescent power state. This reduces overall power consumption, and allows particularly draining hardware components such as the printer's paper cutting guillotine to monopolise the power source when they are operating. A camera-oriented Artcam device is, by default, in image capture mode. This means that the camera is active, and other modules, such as the printer, are quiescent. This means that when non-camera functions are initiated, the application must explicitly suspend the camera module. Other modules naturally suspend themselves when they become idle.

Silverbrook, Kia

Patent Priority Assignee Title
Patent Priority Assignee Title
1960667,
2506035,
3223409,
3518417,
3573437,
3663801,
3701098,
3731062,
3735350,
3737629,
3748939,
3760162,
3774014,
3778541,
3843132,
3852572,
3857019,
3866217,
3893173,
3896691,
3914877,
3916420,
3943563, Mar 17 1969 System and method for recording and reproducing video information on a card
3946398, Jun 29 1970 KONISHIROKU PHOTO INDUSTRY COMPANY LTD A CORP OF JAPAN Method and apparatus for recording with writing fluids and drop projection means therefor
3956756, Aug 26 1970 CAMBRIDGE CONSULTANTS LIMITED, A BRITISH COMPANY Pattern printing apparatus
3967286, Dec 28 1973 Facit Aktiebolag Ink supply arrangement for ink jet printers
3970803, Jan 11 1973 CBS Inc. Printed sound track system
3971065, Mar 05 1975 Eastman Kodak Company Color imaging array
4000239, Dec 13 1971 Teijin Limited Process for spinning naphthalate polyester fibers
4034845, Oct 07 1974 Ferag AG Apparatus for stacking printed products continuously arriving from conveyor means, especially products arriving in an imbricated formation
4045802, Jul 29 1975 Ricoh Company, Ltd. Ink ejection printing apparatus comprising automatically actuated ejection orifice cap
4048617, Jul 03 1975 SIEMENS-NIXDORF INFORMATION SYSTEMS, INC , A CORP OF MA Retrace data elimination
4074324, Jul 14 1975 Instant electronic camera
4088981, Nov 12 1975 Citibank N.A. Automated data entry and display system
4092654, Sep 13 1976 Encoding system
4161749, Mar 30 1978 Polaroid Corporation Printer for producing print of an electronically recorded image
4172641, Oct 15 1976 ADDRESSOGRAPH FARRINGTON INC , Phototypesetter
4173401, May 15 1978 Eastman Kodak Company Apparatus for displaying alphanumeric information coded on a film cartridge
4177514, Jul 21 1976 GENERAL DYNAMICS DEFENSE SYSTEMS, INC Graph architecture information processing system
4181940, Feb 28 1978 Micron Technology, Inc Multiprocessor for providing fault isolation test upon itself
4200867, Apr 03 1978 Microsoft Corporation System and method for painting images by synthetic color signal generation and control
4213694, Oct 04 1976 International Business Machines Corporation Copy production machines
4224628, Aug 31 1978 GTE Valeron Corporation General purpose combined alphanumeric/graphics printer
4234214, Aug 16 1978 Governor & Company of the Bank of England Document carrying a legible code, and method and apparatus for producing same
4244006, Jul 18 1975 Nippon Hoso Kyokai; Canon Kabushiki Kaisha Control device for television camera
4253476, Mar 08 1974 Tobacco filter and method of removing impurities from tobacco smoke
4258387, Oct 17 1979 LEMELSON Video telephone
4262284, Jun 26 1978 Self-monitoring seal
4262301, Mar 30 1978 Polaroid Corporation Electronic imaging camera
4270853, Mar 21 1979 West Electric Company, Ltd. Sound-recording instant-printing film and camera therefor
4275413, Mar 30 1978 DAINIPPON SCREEN SEIZO KABUSHIKI KAISHA, 1-1 TENJIN-KITAMACHI, TERANOUCHI-AGARU 4-CHOME, HORIKAWA-DORI, KAMIGYO-KU, KYOTO-SHI,JAPAN A CORP OF JAPAN Linear interpolator for color correction
4282535, Nov 17 1978 INKJET SYSTEMS GMBH & CO KG Circuit arrangement for the operation of recording nozzles in ink mosaic recording devices
4317138, Feb 11 1980 EXXON ENTERPRISES Method and apparatus for facsimile sheet handling
4342051, Apr 27 1979 Matsushita Electric Industrial Company, Limited Method of and system for reproducing or transmitting half-tone images
4372694, Jan 18 1980 Ing. C. Olivetti & Co., S.p.A. Electronic pocket calculator
4383458, Mar 05 1980 Dainippon Screen Seizo Kabushiki Kaisha Film cutter
4384272, Oct 06 1979 Minolta Camera Kabushiki Kaisha Image reading apparatus
4394730, Dec 04 1975 Tokyo Shibaura Denki Kabushiki Kaisha Multi-processor system employing job-swapping between different priority processors
4402150, May 11 1981 Polaroid Corporation Verification device
4414316, Sep 05 1980 REXAM INDUSTRIES CORP Composite lenticular screen sheet
4429320, Sep 21 1979 Canon Kabushiki Kaisha Ink jet recording apparatus
4429938, Jan 06 1982 THOMAS & BETTS INTERNATIONAL, INC , A CORP OF DELAWARE Locking device for interfitting members
4434503, Jul 31 1979 Minolta Camera Kabushiki Kaisha Image information output apparatus
4436439, Aug 27 1980 Epson Corporation; Kabushiki Kaisha Suwa Seikosha Small printer
4454517, May 29 1981 Tokyo Shibaura Denki Kabushiki Kaisha Printing apparatus with coacting printer head movement and paper advancement
4455609, Sep 17 1980 Nippon Electric Co., Ltd. Apparatus for realtime fast reconstruction and display of dose distribution
4463359, Apr 02 1979 Canon Kabushiki Kaisha Droplet generating method and apparatus thereof
4463362, Jun 07 1982 NCR Corporation Ink control baffle plates for ink jet printer
4472038, Dec 26 1980 Fuji Photo Film Co., Ltd. Photographic camera
4488563, Apr 29 1982 Mitsubishi Acetate Co., Ltd.; Mitsubishi Rayon Co., Ltd. Filter plug
4494862, Sep 30 1980 Minolta Camera Kabushiki Kaisha Computerized information processing system equipped with copying apparatus
4494864, Dec 27 1977 The Three Dimensional Photography Corp. Apparatus for stereoscopic photography
4500183, May 02 1980 Olympus Optical Co., Ltd. Film cassette and a photographing device using the same
4500919, May 04 1982 Massachusetts Institute of Technology Color reproduction system
4511907, Oct 19 1982 NEC Corporation Color ink-jet printer
4518235, Feb 06 1984 James D., Sorg Collapsible disposable camera
4521014, Sep 30 1982 Video game including user visual image
4523235, Jan 11 1982 Ricoh Company, LTD Electronic microcopier apparatus
4528575, Dec 30 1980 Fujitsu Limited Ink jet printing head
4531740, Jun 22 1983 Cynex Manufacturing Corporation Remote control system for a video computer game
4534142, Jun 30 1980 Roof covering
4544184, Jul 07 1983 Freund Precision, Inc. Tamper-proof identification card and identification system
4546434, Oct 03 1979 Method for designing apparel
4550967, Dec 14 1981 AMPHENOL CORPORATION, A CORP OF DE Electrical connector member
4558326, Sep 07 1982 Konishiroku Photo Industry Co., Ltd. Purging system for ink jet recording apparatus
4567529, Oct 26 1983 Baxter International Inc Image sensor
4574351, Mar 03 1983 International Business Machines Corporation Apparatus for compressing and buffering data
4580721, Feb 12 1981 IMPERIAL CHEMICAL INDUSTRIES PLC, MILLBANK, LONDON S W 1 ENGLAND, A CORP OF GREAT BRITAIN Fluid container
4581710, May 24 1982 International Business Machines (IBM) Method of editing dot pattern data for character and/or image representations
4591900, Mar 14 1983 RCA Corporation Encoding pattern for single chip CCD camera processing scheme
4592938, Mar 25 1985 Mobil Oil Corporation Method of producing an internally reinforced thermoplastic film and film and articles produced therefrom
4596039, Dec 30 1983 International Business Machines Corporation Method for converting an image from a run end or run length representation to a bit map
4632585, Mar 14 1984 Kabushiki Kaisha Toshiba; KABUSHIKI KAISHA TOSHIBA A CORP OF JAPAN Image forming apparatus
4639738, Apr 12 1985 Eastman Kodak Company Ink level detection system for ink jet printing apparatus
4639769, Apr 01 1985 Eastman Kodak Company Modifying color digital images
4640529, Sep 16 1985 Flexible non-distortable handcraft sheet material and method of applying printed designs thereto
4641980, Oct 02 1984 Fujitsu Limited Printer with pivotable print head attached to medium carrier moveable through a casing opening
4652935, Mar 04 1985 Kokusai Denshin Denwa Kabushiki Kaisha Graded facsimile image signal coding system
4665556, Feb 09 1983 HITACHI, LTD , 6, KANDA SURUGADAI 4-CHOME, CHIYODA-KU, TOKYO, JAPAN Image signal processor
4667208, Nov 01 1984 Hitachi, Ltd. Control system for a color printer
4672453, Jul 10 1984 NEC Corporation Contact type image sensor and driving method therefor
4681430, Aug 27 1986 AVAGO TECHNOLOGIES GENERAL IP SINGAPORE PTE LTD ; AVAGO TECHNOLOGIES GENERAL IP PTE LTD Method for focusing projection printer
4683477, Aug 29 1986 Eastman Kodak Company Ink jet print head
4688105, May 10 1985 Video recording system
4689642, Mar 30 1984 Canon Kabushiki Kaisha Ink-jet recording head with an elastic ink tank in a sealed casing held at a partial vacuum and having a breakable seal
4689683, Mar 18 1986 Computerized studio for motion picture film and television production
4692394, Feb 27 1981 Lasercard Corporation Method of forming a personal information card
4703332, Nov 14 1985 Ing. C. Olivetti & C., S.p.A. Ink jet print head and printer
4706130, Aug 08 1983 Canon Kabushiki Kaisha Image recording apparatus utilizing light emitting diodes with pixel shape correction
4707713, Oct 19 1981 Canon Kabushiki Kaisha Image recording apparatus
4710873, Jul 06 1982 Marvin Glass & Associates Liquidating Trust Video game incorporating digitized images of being into game graphics
4724307, Apr 29 1986 GTECH Rhode Island Corporation Marked card reader
4724395, Aug 05 1985 POLAROID CORPORATION FMR OEP IMAGING OPERATING CORP Median filter for reconstructing missing color samples
4727245, Oct 14 1986 Mars, Inc.; MARS, INCORPORATED, A CORP OF DE Portable data scanner with removable modular printer
4728978, Mar 07 1986 Minolta Camera Kabushiki Kaisha Photographic camera
4734565, Oct 12 1983 Lasercard Corporation Read-only optical card and system
4734713, Apr 26 1985 Kabushiki Kaisha Sato Thermal printer
4740269, Oct 11 1985 OESTERREICHISCHE NATIONALBLANK Process and apparatus for applying authenticating coding to value-carrying paper
4741327, Apr 30 1986 Olympus Optical Co., Ltd. Endoscope having bent circuit board
4745544, Dec 12 1985 Texas Instruments Incorporated Master/slave sequencing processor with forced I/O
4746920, Mar 28 1986 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Method and apparatus for clock management
4754487, May 27 1986 Image Recall Systems, Inc. Picture storage and retrieval system for various limited storage mediums
4762986, Mar 06 1987 Canon Kabushiki Kaisha Automatic focussing system including in-focus position prediction means
4763153, Mar 11 1986 Minolta Camera Kabushiki Kaisha Control device for use in a camera system
4769764, Aug 11 1986 Modular computer system with portable travel unit
4771295, Jul 01 1986 Hewlett-Packard Company Thermal ink jet pen body construction having improved ink storage and feed capability
4771342, May 01 1985 EMF Partners, Ltd. Method and apparatus for enhancing video-recorded images to film grade quality
4783700, Jun 10 1986 Canon Kabushiki Kaisha Image sensor unit and image reading apparatus having the unit
4783823, Sep 16 1985 OMRON TATEISI ELECTRONICS CO Card identifying method and apparatus
4786820, Dec 14 1984 Canon Kabushiki Kaisha Apparatus for parallel-processing image data
4788563, May 19 1986 Canon Kabushiki Kaisha Recording apparatus
4791443, Jun 12 1987 Eastman Kodak Company Photographic processor with auxiliary power supply
4796038, Jul 24 1985 Applied Materials, Inc Laser pattern generation apparatus
4796087, May 29 1986 FRANCE TELECOM S A Process for coding by transformation for the transmission of picture signals
4804831, Oct 30 1985 Canon Kabushiki Kaisha Focus detecting apparatus independent of object image contrast
4809345, Apr 30 1982 Hitachi, Ltd. Method of and apparatus for enlarging/reducing two-dimensional images
4819395, Dec 26 1985 ASAHI GLASS MATEX CO , LTD Textile reinforced structural components
4821208, Jun 18 1986 Intel Corporation Display processors accommodating the description of color pixels in variable-length codes
4829324, Dec 23 1987 Xerox Corporation Large array thermal ink jet printhead
4833599, Apr 20 1987 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Hierarchical priority branch handling for parallel execution in a parallel processor
4835388, Apr 07 1987 SAINT-GOBAIN CERAMICS & PLASTICS INC Thermoluminescence dosimetry card reader heating assembly
4837628, Jul 14 1986 Kabushiki Kaisha Toshiba Electronic still camera for recording still picture on memory card with mode selecting shutter release
4841375, May 29 1986 Kabushiki Kaisha Toshiba Image-resolution conversion apparatus for converting a pixel-density of image data
4845767, Dec 16 1985 Matsushita Electric Industrial Co., Ltd. Image signal processor
4845770, Nov 20 1986 OKI ELECTRIC INDUSTRY CO , LTD Method and apparatus for processing embossed card
4853967, Jun 29 1984 International Business Machines Corporation Method for automatic optical inspection analysis of integrated circuits
4860375, Mar 10 1986 WACHOVIA BANK, NATIONAL High speed cellular processing system
4861031, Sep 28 1987 Card wrestling game
4862208, Feb 14 1985 Canon Kabushiki Kaisha Information transmitting device for camera
4864494, Mar 21 1986 COMPUTERIZED DATA SYSTEMS FOR MANUFACTURING, INC , CDSM A CORP OF AZ Software usage authorization system with key for decrypting/re-encrypting/re-transmitting moving target security codes from protected software
4868676, Mar 19 1986 Shapr Kabushiki Kaisha Manual copying apparatus
4875048, Aug 28 1987 Hitachi, Ltd. Two-step parallel analog to digital converter
4875074, Apr 01 1987 Brother Kogyo Kabushiki Kaisha Image recording apparatus
4875173, Apr 16 1985 Minolta Camera Kabushiki Kaisha Image enlarging method and device
4882702, Mar 31 1986 Allen-Bradley Company, Inc. Programmable controller with I/O expansion module located in one of I/O module positions for communication with outside I/O modules
4887161, May 28 1987 FUJIFILM Corporation Memory cartridge and digital electronic still video camera in which said memory cartridge is freely loadable/unloadable
4890832, Oct 13 1982 Sharp Kabushiki Kaisha Compact electronic apparatus with removable processing units
4896029, Apr 08 1988 United Parcel Service of America, Inc.; United Parcel Service of America, Inc Polygonal information encoding article, process and system
4897719, Mar 19 1987 VIDEO PERCEPTION, INC Image pre-processing sub-system
4897724, Jun 06 1988 U S PHILIPS CORPORATION Apparatus and method for reproducing digitized video pictures, with inclined plane error restoration
4902880, Sep 30 1988 PERIPHERAL DYNAMICS INC , A CORP OF PA Card reader system and method with printing and verification capability
4903132, Sep 26 1987 Mitsubishi Denki Kabushiki Kaisha Electronic still camera with slow-in, fast out memory addressing
4904100, Dec 05 1988 Eastman Kodak Company Cartridge and printer system for using roll print media
4905029, Sep 28 1988 Audio still camera system
4914452, May 08 1987 Ricoh Company, LTD Ink sheet/recording paper cassette
4937676, Feb 10 1989 POLAROID CORPORATION FMR OEP IMAGING OPERATING CORP Electronic camera system with detachable printer
4942470, Jul 20 1984 NEC Corporation Real time processor for video signals
4943820, Oct 13 1989 Portable camera support
4947262, Jun 11 1986 Casio Computer Co., Ltd. Hand-held manually sweeping printing apparatus
4949189, May 02 1989 Eastman Kodak Company Two-sided document scanning apparatus
4949391, Sep 26 1986 EVEREX TI CORPORATION, A CA CORP Adaptive image acquisition system
4952967, Oct 27 1987 Canon Kabushiki Kaisha Timer-assisted photographing mode control device for camera
4954910, Oct 02 1987 Canon Kabushiki Kaisha Recorder displaying recording sheet quantity available on remaining web sheet supply
4956656, Nov 14 1984 Minolta Camera Kabushiki Kaisha Control device for use in a camera having a consecutive picture taking mode and a single picture taking mode
4961088, Apr 20 1989 Xerox Corporation Monitor/warranty system for electrostatographic reproducing machines using replaceable cartridges
4964066, Sep 05 1986 Sharp Kabushiki Kaisha Device for editing and displaying data recorded on specialized sheets or records
4965596, Feb 09 1988 Canon Kabushiki Kaisha Ink jet recording apparatus with waste ink distribution paths to plural cartridges
4975969, Oct 22 1987 TAL, PETER, Method and apparatus for uniquely identifying individuals by particular physical characteristics and security system utilizing the same
4977459, Jun 23 1988 Canon Kabushiki Kaisha Ink-jet recording apparatus with mechanism for automatically regulating a recording head
4979838, Sep 16 1988 NCR Corporation Receipt cutting mechanism for dot matrix printer
4980856, Oct 20 1986 Brother Kogyo Kabushiki Kaisha IC memory cartridge and a method for providing external IC memory cartridges to an electronic device extending end-to-end
4983996, Sep 02 1988 Casio Computer Co., Ltd. Data recording apparatus for still camera
4985848, Sep 14 1987 GDE SYSTEMS, INC High speed image processing system using separate data processor and address generator
4987030, Oct 07 1987 TORAY INDUSTRIES, INC High-tenacity conjugated fiber and process for preparation thereof
4990005, Oct 30 1987 Brother Kogyo Kabushiki Kaisha Printer that prints a table of information about printing effects using the selected printing effects
4991205, Mar 10 1978 Personal identification system and method
4993405, May 15 1989 Olympus Optical Co., Ltd. Imaging apparatus
4999647, Dec 28 1989 Eastman Kodak Company Synchronous stimulation for long array continuous ink jet printer
5005998, Nov 06 1987 Victor Company of Japan, LTD Cartridge for a printer system
5006929, Sep 25 1989 Rai Radiotelevisione Italiana Method for encoding and transmitting video signals as overall motion vectors and local motion vectors
5009626, Apr 04 1986 Human lifelike dolls, mannequins and humanoids and pet animal dolls and methods of individualizing and personalizing same
5012349, Oct 06 1986 Method and portable device for detection, storage and for eventual processing and reproduction of graphic symbols appearing on any type of carrier
5016037, May 25 1984 Minolta Camera Co., Ltd. Flash photographing system
5016112, Aug 23 1988 Sony Corporation Combined video recorder and camera with superimposition of video and data
5018072, Aug 18 1987 Hitachi, Ltd. Optically readable mail system with general and receiver specific information
5020926, Jun 08 1990 Sejus Corporation Printer mounting arrangement
5021892, Sep 30 1986 Sharp Kabushiki Kaisha Image processing device of multifunctional type
5026042, Jan 22 1990 Xerox Corporation Sheet feeder for copiers and printers
5028409, Mar 23 1987 BIG THREE MERCHANT GASES & EQUIPMENT, A CORP OF TX Method and apparatus for recovering sulfur from gases containing hydrogen sulfide
5028997, Jul 20 1989 Elbex Video Kabushiki Kaisha Television camera apparatus
5031049, May 25 1984 Canon Kabushiki Kaisha Automatic object image follow-up device
5032922, Jul 02 1990 Xerox Corporation Platen accessory for portable copier
5035325, Jul 18 1989 Dai Nippon Insatsu Kabushiki Kaisha Cassette for thermal transfer printing film
5035929, Jun 13 1989 Dimensional Images, Inc. Three dimensional picture
5036472, Dec 08 1988 FIRST PACIFIC EQUITY, INC Computer controlled machine for vending personalized products or the like
5040006, Apr 27 1987 Canon Kabushiki Kaisha Camera
5043561, Sep 28 1988 Kabushiki Kaisha Toshiba Fare collection system using a boarding ticket and additional money card
5043748, Nov 16 1987 Canon Kabushiki Kaisha Recording apparatus
5049898, Mar 20 1989 Hewlett-Packard Company Printhead having memory element
5051838, Jun 22 1988 FUJIFILM Corporation Portable electronic copying machine
5053814, Dec 24 1986 Minolta Camera Kabushiki Kaisha Image forming apparatus
5055997, Jan 13 1988 U.S. Philips Corporation System with plurality of processing elememts each generates respective instruction based upon portions of individual word received from a crossbar switch
5058856, May 08 1991 Agilent Technologies Inc Thermally-actuated microminiature valve
5065170, Jun 22 1990 Xerox Corporation Ink jet printer having a staggered array printhead
5067713, Mar 29 1990 TECHNICAL SYSTEMS, CORP , A OH CORP Coded playing cards and apparatus for dealing a set of cards
5081575, Nov 06 1987 WOLFE, HOWARD MR ; IMPERIALE, PETER G MR ; LONERGAN, WILLIAM MR ; NORTHERN TRUST COMPANY AS TRUSTEE FOR THE BENEFIT OF ALLIED CORPORATION MASTER PENSION TRUST; NORTHERN TRUST COMPANY, AS TRUSTEE FOR THE BENEFIT OF ALLIED CORPORATION; HARVEY, CURRAN V , MR ; DONDERO, STEPHEN, MR ; LONG, ROBERT MR ; BRILL, ROBERT MR Highly parallel computer architecture employing crossbar switch with selectable pipeline delay
5091966, Jul 31 1990 XEROX CORPORATION, STAMFORD, CT, A CORP OF NY Adaptive scaling for decoding spatially periodic self-clocking glyph shape codes
5097282, Feb 06 1987 Minolta Camera Kabushiki Kaisha Automatic focusing apparatus
5097285, Jun 03 1987 Nikon Corporation Camera with self-timer
5101096, Oct 14 1988 Hitachi, Ltd. Optical recording sheet and method and apparatus for reproducing the same
5103311, Jan 11 1988 IPG Electronics 503 Limited Data processing module and video processing system incorporating same
5107100, Jan 25 1982 SYMBOL TECHNOLOGIES, INC , A CORP OF DELAWARE Portable scanner with on-board keyboard, display, transceiver and printer
5107276, Jul 03 1989 Xerox Corporation Thermal ink jet printhead with constant operating temperature
5107290, Jun 06 1989 Canon Kabushiki Kaisha Camera
5111288, Mar 02 1988 Honeywell International, Inc Surveillance camera system
5111419, Mar 28 1988 HIMPP K S Electronic filters, signal conversion apparatus, hearing aids and methods
5115888, Feb 04 1991 FUJITSU FRONTECH NORTH AMERICA INC Self-serve checkout system
5119115, Jul 13 1989 Ing. C. Olivetti & C. S.p.A. Thermal ink jet print head with removable ink cartridge
5119179, Sep 19 1989 Kabushiki Kaisha Toshiba Video signal processing circuit for extracting a chroma signal from a luminous signal
5121139, Apr 29 1991 Xerox Corporation Compact ink jet printer having a drum drive mechanism
5121209, Oct 01 1990 RCA Licensing Corporation Sharpness control for a television image
5121349, Aug 01 1989 MITSUBISHI DENKI KABUSHIKI KAISHA, A CORP OF JAPAN Digital noise generator
5124692, Apr 13 1990 Eastman Kodak Company Method and apparatus for providing rotation of digital image data
5132798, Mar 30 1988 Canon Kabushiki Kaisha Special effect apparatus with power control
5134495, Nov 07 1990 Hewlett-Packard Company Resolution transforming raster-based imaging system
5135095, Dec 12 1986 Skidata AG Portable hand device for machine processing of data carried on a data carrier
5138459, Nov 20 1990 ST CLAIR INTELLECTUAL PROPERTY CONSULTANTS, INC Electronic still video camera with direct personal computer (PC) compatible digital format output
5144340, Mar 10 1989 Minolta Camera Kabushiki Kaisha Inkjet printer with an electric curtain force
5144423, Dec 11 1990 AMERICAN TELEPHONE AND TELEGRAPH COMPANY, A CORP OF NY HDTV encoder with forward estimation and constant rate motion vectors
5146328, Jul 18 1990 Fuji Xerox Corporation, Ltd. Color signal network system
5146592, Sep 14 1987 GDE SYSTEMS, INC High speed image processing computer with overlapping windows-div
5148288, Aug 29 1990 Savitar, Inc. Standardized color calibration of electronic imagery
5148534, Nov 05 1986 CISCO TECHNOLOGY, INC , A CORPORATION OF CALIFORNIA Hardware cartridge representing verifiable, use-once authorization
5151726, May 09 1988 Canon Kabushiki Kaisha Camera or printer capable of automatically changing print size
5153532, May 24 1989 Honeywell Inc.; HONEYWELL INC , A CORP OF DE Noise generator using combined outputs of two pseudo-random sequence generators
5153738, May 20 1991 Xerox Corporation Scanner with single source mechanical power
5154956, Jan 11 1990 WESTFIELD COATED PRODUCTS, INC Non-curling pressure-sensitive adhesive labels with release liners
5155502, Jan 13 1989 Canon Kabushiki Kaisha Ink-jet cartridge
5160577, Jul 30 1991 XCEROX CORPORATION Method of fabricating an aperture plate for a roof-shooter type printhead
5160943, Aug 12 1988 ESSELTE METO INTERNATIONAL PRODUKTION GMBH Printing systems
5160945, May 10 1991 Xerox Corporation Pagewidth thermal ink jet printhead
5161037, Oct 10 1990 Fuji Xerox Corporation, Ltd. Image processing system and method for processing documents in accordance with a job control sheet
5163762, Aug 09 1989 Brother Kogyo Kabushiki Kaisha Driving circuit for solenoid head of a printer
5164827, Aug 22 1991 SENSORMATIC ELECTRONICS, LLC Surveillance system with master camera control of slave cameras
5164831, Mar 15 1990 Eastman Kodak Company Electronic still camera providing multi-format storage of full and reduced resolution images
5172423, Sep 14 1990 Crosfield Electronics Ltd. Methods and apparatus for defining contours in colored images
5175808, Sep 12 1989 Pixar Method and apparatus for non-affine image warping
5179389, Jan 28 1989 Canon Kabushiki Kaisha Ink jet recording with head driving condition regulation
5179936, Oct 23 1984 ZILA PHARMACEUTICALS, INC Disposable speculum with membrane bonding ring
5181254, Dec 14 1990 Northrop Grumman Systems Corporation Method for automatically identifying targets in sonar images
5182548, Jan 10 1990 Open Invention Network, LLC Method and apparatus for painting on a computer
5184169, Apr 19 1990 FUJIFILM Corporation Photography mode input systems
5184907, Nov 06 1986 Sharp Kabushiki Kaisha Portable printer for printing on a flat sheet
5189520, Feb 26 1990 Sony Corporation Video camera modular accessory apparatus
5189529, Dec 14 1988 Fuji Xerox Co., Ltd. Reduction/enlargement processing system for an image processing apparatus
5191640, Dec 26 1990 Xerox Corporation Method for optimal discrete rendering of images
5191647, Aug 30 1985 Minolta Camera Kabushiki Kaisha Image data processing system
5200598, Jun 29 1988 DATASTRIP LIMITED Optical reader
5204944, Jul 28 1989 TRUSTEES OF COLUMBIA UNIVERSITY IN THE CITY OF NEW YORK, THE Separable image warping methods and systems using spatial lookup tables
5206919, May 30 1990 Sony United Kingdom Limited Image signal processing with digital filtering to minimize aliasing caused by image manipulation
5208610, Jul 31 1991 Hewlett-Packard Company Pen carriage for an ink-jet printer
5212021, Feb 21 1992 GILLETTE COMPANY, THE Energy pack and individual battery cell cartridge
5216490, Jan 13 1988 CHARLES STARK DRAPER LABORATORY, INC , THE Bridge electrodes for microelectromechanical devices
5220352, Oct 29 1990 Minolta Camera Kabushiki Kaisha Thermal transfer recording device
5220400, Jun 01 1990 Texas Instruments Incorporated; TEXAS INSTRUMENTS INCORPORATED, A CORP OF DE Container inspection system
5221833, Dec 27 1991 Xerox Corporation; XEROX CORPORATION A CORPORATION OF NY Methods and means for reducing bit error rates in reading self-clocking glyph codes
5222229, Mar 13 1989 International Business Machines Multiprocessor system having synchronization control mechanism
5224179, Dec 20 1988 AT&T Bell Laboratories Image skeletonization method
5225294, Jun 16 1992 EK GROUP, CONSISTING OF ALFRED ESSES, SAM ESSES, ISAAC KHODARI, AND JOSEPH KHODARI Non-rechargeable battery pack
5226125, Nov 17 1989 TEXAS INSTRUMENTS INCORPORATED, A CORP OF DE Switch matrix having integrated crosspoint logic and method of operation
5230027, Sep 05 1990 NEC Corporation Image processor and automated optical inspection system using the same
5231455, Aug 17 1992 Phoenix Precision Graphics, Inc.; PHOENIX PRECISION GRAPHICS Air jet cleaner for one pump color imager
5235428, Feb 21 1990 Sony Corporation Auto-focus system for video camera
5235686, Feb 24 1987 Texas Instruments Incorporated Computer system having mixed macrocode and microcode
5237402, Jul 30 1991 Senshin Capital, LLC Digital image processing circuitry
5237686, May 10 1989 Mitsubishi Denki Kabushiki Kaisha Multiprocessor type time varying image encoding system and image processor with memory bus control table for arbitration priority
5239292, Oct 04 1988 Crosfield Electronics Ltd. Computer graphics system electronically simulating painting on canvas
5240238, Oct 25 1991 Samsung Electronics Co., Ltd. Cassette used for electrophotographic process engine
5241165, Feb 27 1981 Lasercard Corporation Erasable optical wallet-size data card
5241372, Nov 30 1990 Sony Corporation Video image processing apparatus including convolution filter means to process pixels of a video image by a set of parameter coefficients
5243174, Mar 05 1991 RIVERSIDE BAN Method and apparatus for generating gift certificates
5243370, Aug 30 1988 Camera stabilizer
5243381, Jan 04 1993 Xerox Corporation Method for compiling multiple jobs with job reference sheets
5245365, Feb 28 1990 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Ink-jet printer with user replaceable printing system cartridge
5247611, Sep 15 1989 Eclipsys Corporation Spreadsheet cell having multiple data fields
5260735, Nov 19 1986 Minolta Camera Kabushiki Kaisha Camera system
5265033, Sep 23 1991 FIVE 2 SOLUTIONS LIMITED LIABILITY COMPANY ATM/POS based electronic mail system
5266781, Aug 15 1991 DATACARD CORPORATION A CORPORATION OF DE Modular card processing system
5267021, Apr 03 1992 The Trustees of Columbia University in the City of New York Multiresolution digital television broadcast system
5267334, May 24 1991 Apple Inc Encoding/decoding moving images with forward and backward keyframes for forward and reverse display
5270808, Aug 03 1990 Canon Kabushiki Kaisha Color image processing with adjustment of computed recording color to match original color
5275877, Aug 10 1989 Edison Polymer Innovation Corporation Self reinforced thermoplastic composite laminate
5276472, Nov 19 1991 Eastman Kodak Company Photographic film still camera system with audio recording
5276521, Jul 30 1990 Olympus Optical Co., Ltd. Solid state imaging device having a constant pixel integrating period and blooming resistance
5278608, May 19 1992 Eastman Kodak Company Electronically printed depth photography system with improved viewing range
5280160, Feb 27 1987 Canon Kabushiki Kaisha Recording and reproducing method and apparatus compensating for predicted deviation based on detected relative skewing of recording medium
5280620, Dec 16 1988 U.S. Philips Corporation Coupling network for a data processor, including a series connection of a cross-bar switch and an array of silos
5282044, Oct 18 1990 FUJIFILM Corporation Camera shake correction system
5282051, Jul 29 1991 Xerox Corporation Apparatus and method for performing resolution conversion on image data with auto correlation
5288980, Jun 25 1992 Kingsley Library Equipment Company Library check out/check in system
5288986, Sep 17 1992 Motorola, Inc. Binary code matrix having data and parity bits
5291227, May 17 1991 Ricoh Company, Ltd. Ink jet printer having improved paper transport mechanism
5291243, Feb 05 1993 Xerox Corporation System for electronically printing plural-color tamper-resistant documents
5294782, Sep 27 1991 Khyber Technologies Corporation Integrated portable device for point of sale transactions
5297217, Aug 06 1991 Eastman Kodak Company Tile-oriented technique for collectively performing image rotation scaling and digital halftone screening
5297289, Oct 31 1989 Rockwell International Corporation System which cooperatively uses a systolic array processor and auxiliary processor for pixel signal enhancement
5300958, Feb 28 1992 Hewlett-Packard Company Method and apparatus for automatically cleaning the printhead of a thermal inkjet cartridge
5300976, Apr 17 1992 GOLDSTAR CO , LTD Movie camera system having view finding and projecting operations
5301043, Oct 11 1989 Fuji Photo Film Co., Ltd. Image reading apparatus in which an original image is automatically fed to a turntable
5307470, Nov 25 1988 NEC Corporation Microcomputer having EEPROM provided with detector for detecting data write request issued before data write operation responsive to preceding data write request is completed
5315316, Oct 29 1991 Hewlett-Packard Company Method and apparatus for summing temperature changes to detect ink flow
5317146, Nov 18 1991 Oki Electric Industry Co., Ltd. Read head incorporating an image pick-up function
5318370, Nov 17 1992 BRADY WORLDWIDE, INC Cartridge with data memory system and method regarding same
5319462, Feb 28 1990 Sanyo Electric Co., Ltd. Automatic focusing apparatus for automatically adjusting focus in response to video signal by fuzzy inference
5322594, Jul 20 1993 Xerox Corporation Manufacture of a one piece full width ink jet printing bar
5323203, Apr 21 1989 Olympus Optical Co., Ltd. Wireless remote control apparatus for camera
5325493, Mar 12 1990 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P System for distributing command/data packets tagged by their unit identifier for parallel processing by a ready processing unit and recombination
5327260, Nov 28 1991 Ricoh Company, Ltd. Image processing apparatus for smoothing edges of image
5328281, Apr 10 1990 Seiko Epson Corporation Recording medium feed mechanism for a printer and method of medium feed control
5334920, Jun 07 1991 Canon Kabushiki Kaisha Recording apparatus
5335170, Sep 04 1992 COMTEC INFORMATION SYSTEMS, INC Modular system for inventory control
5336004, Aug 20 1990 SEIKO PRECISION INC Dot printer
5336874, Feb 22 1991 ALPS Electric Co., Ltd. Bar code reader with error detection and decode control
5337361, Jan 05 1990 Symbol Technologies, Inc. Record with encoded data
5339102, Nov 12 1992 SAMSUNG ELECTRONICS CO , LTD Capping carriage for ink jet printer maintenance station
5339170, Dec 31 1991 XEROX CORPORATION A CORP OF NEW YORK Image processing system and method employing hybrid filtering to provide improved reconstruction of continuous tone images from halftone screen-structured images
5339396, Nov 18 1987 Hitachi, Ltd. Interconnection network and crossbar switch for the same
5343031, Apr 06 1992 Teiryo Sangyo Co., Ltd. Method of decoding a two-dimensional code symbol mark
5343309, Aug 12 1992 Xerox Corporation Image processing system and method employing adaptive filtering to provide improved reconstruction of continuous tone images from halftone images including those without a screen structure
5343386, Aug 21 1989 ATLUS CO , LTD Apparatus for making electronically-produced postcards and method of operating same
5344248, Apr 24 1990 Esselte Meto International Produktions GmbH Framework for portable printers
5345288, Feb 14 1990 Asahi Kogaku Kabushiki Kaisha Electronically controlled camera with automatic release mode and interval time setting
5345505, Mar 04 1991 Coding system for a data signal
5347403, Sep 20 1991 Fuji Photo Film Co., Ltd. Apparatus and method for recording and reading information
5351071, Sep 08 1989 HITACHI PRINTING SOLUTIONS, LTD Thermal printer
5351095, Aug 29 1989 Thomson Consumer Electronics Method and device for estimating and hierarchically coding the motion of sequences of images
5356971, Oct 11 1991 BASF NOF COATINGS CO , LTD ; NOF Corporation Thermosetting powder coating material
5359387, Jul 06 1992 Eastman Kodak Company Photographic process utilizing combined print and order form
5361366, Dec 26 1989 Hitachi, Ltd. Computer equipped with serial bus-connected plural processor units providing internal communications
5363134, May 20 1992 Hewlett-Packard Company Integrated circuit printhead for an ink jet printer including an integrated identification circuit
5363209, Nov 05 1993 Xerox Corporation Image-dependent sharpness enhancement
5363212, May 14 1991 Fuji Xerox Co., Ltd. Marker dot detecting device for color image recording apparatus
5365312, Jul 25 1988 Eastman Kodak Company Arrangement for printer equipment for monitoring reservoirs that contain printing medium
5369261, Feb 12 1992 COLORCORDE UNLIMITED CORP Multi-color information encoding system
5373322, Jun 30 1993 Intellectual Ventures Fund 83 LLC Apparatus and method for adaptively interpolating a full color image utilizing chrominance gradients
5374995, Mar 22 1993 Eastman Kodak Company Method and apparatus for enhancing sharpness of a sequence of images subject to continuous zoom
5376561, Dec 31 1990 KOPIN CORPORATION, A DE CORP High density electronic circuit modules
5381172, Dec 07 1990 Canon Kabushiki Kaisha Ink jet head cartridge, ink tank cartridge using degradeable plastic as part of construction or package thereof and ink jet apparatus having fitting part for the cartridges
5384609, May 02 1989 Canon Kabushiki Kaisha Integrated camera-tripod system
5384899, Apr 16 1991 KODAK I L, LTD Apparatus and method for emulating a substrate
5392365, Dec 23 1991 Eastman Kodak Company Apparatus for detecting text edges in digital image processing
5393152, Aug 26 1992 Brother Kogyo Kabushiki Kaisha Printing device having opening and shutting mechanism
5396286, Jun 09 1992 Sony Corporation Video signal processing apparatus
5398063, Nov 09 1990 Olympus Optical Co., Ltd. Focusing position detecting device incorporated in a microscope
5398131, Aug 13 1992 Stereoscopic hardcopy methods
5398315, Dec 30 1992 North American Philips Corporation Multi-processor video display apparatus
5399850, Dec 26 1991 Kyocera Corporation Document reading apparatus, having a body unit for holding apparatus components
5402527, Apr 23 1993 Xerox Corporation Apparatus and method for determining the page description language in which a print job is written
5404460, Jan 28 1994 ST Wireless SA Method for configuring multiple identical serial I/O devices to unique addresses through a serial bus
5408669, Feb 07 1992 Dell USA, L.P. Computer system for sensing a cable-connected peripheral and for supplying power thereto
5408746, Apr 30 1993 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Datum formation for improved alignment of multiple nozzle members in a printer
5410620, Aug 02 1989 Teiryo Sangyo Co., Ltd. Digital data reader of digital data recording sheet
5412197, Jan 29 1993 United Parcel Service of America, Inc. Method and apparatus for decoding bar code symbols using gradient signals
5412402, Aug 31 1990 QUANTEL LIMITED, A CORPORATION OF GREAT BRITAIN Electronic graphic systems
5412410, Jan 04 1993 Xerox Corporation Ink jet printhead for continuous tone and text printing
5414529, May 14 1991 Fuji Xerox Co., Ltd. Image combining in image processing apparatus
5418565, Feb 15 1994 Intellectual Ventures Fund 83 LLC CFA compatible resolution reduction in a single sensor electronic camera
5418585, Jan 14 1994 Eastman Kodak Company Method and apparatus for preventing unauthorized recycling of single-use camera and permitting authorized reuse of the camera
5419543, Jul 22 1992 TOKYO ELECTRIC CO , LTD Paper feeding apparatus for printer
5420409, Oct 18 1993 Welch Allyn Data Collection, Inc Bar code scanner providing aural feedback
5420607, Sep 02 1992 Electronic paintbrush and color palette
5420635, Aug 30 1991 FUJIFILM Corporation Video camera, imaging method using video camera, method of operating video camera, image processing apparatus and method, and solid-state electronic imaging device
5420697, Feb 22 1993 DOCUPORT JERSEY LIMITED Portable facsimile/thermal printer utilizing a multi-purpose single roller
5420940, Jun 16 1992 L-3 Communications Corporation CGSI pipeline performance improvement
5426762, Jun 24 1985 Nintendo Co., Ltd. System for determining a truth of software in an information processing apparatus
5428423, Nov 26 1991 Photographic printed cards and apparatus and method of making same
5430518, Oct 09 1991 Asahi Kogaku Kogyo Kabushiki Kaisha Remote control camera
5430525, Nov 30 1990 Canon Kabushiki Kaisha Image processing apparatus
5430861, Dec 11 1984 Computer using optically encoded virtual memory
5432577, Feb 14 1990 Hoya Corporation Electronically controlled camera with interval time setting
5432896, Jan 31 1991 RESEARCH ENGINEERS, INC Watercolor simulation in computer graphics
5432914, May 22 1990 Goldstar Co., Ltd. Scanner interface system for transferring data to main and secondary processing units
5434618, Jun 07 1993 FUJIFILM Corporation Electronic still camera operable with a removably mounted storage medium
5434621, Oct 09 1992 SAMSUNG ELECTRONICS CO , LTD Object tracking method for automatic zooming and the apparatus therefor
5436657, Jul 08 1993 Ricoh Company, LTD Electronic still camera for recording and regenerating image data and sound data
5438359, Sep 16 1992 Hoya Corporation Electronic camera system using IC memory card
5438430, Sep 25 1992 Xerox Corporation Paper user interface for image manipulations such as cut and paste
5438431, May 21 1992 ECOLE POLYTECHNIQUE FEDERALE LAUSANNE Method and apparatus for generating digital halftone images using a rotated dispersed dither matrix
5441251, Apr 19 1991 FUJIFILM Corporation Sheet article containing cassette and system
5442188, Apr 22 1992 GOULD INSTRUMENT SYSTEMS, INC Strip chart recorder paper attribute detector and monitor
5442387, Jun 17 1991 Xerox Corporation Apparatus for supplying phase change ink to an ink jet printer
5442567, Apr 30 1993 Apparatus and method for electronically dispensing personalized greeting cards and gifts
5443320, May 21 1992 International Business Machines Corp Information processing system with printing function
5444230, Nov 30 1993 Minnesota Mining and Manufacturing Company Solid state optical reader with bi-directional protocol
5444468, Nov 29 1990 Canon Kabushiki Kaisha Image forming apparatus with means for correcting image density unevenness
5444543, May 27 1992 Ricoh Company, Ltd. Method and apparatus for detecting a closed-loop area of an image
5448280, Nov 30 1992 Tohoku Ricoh Co., Ltd. Rewriteable card, printing apparatus for printing the card and a method of judging the life of the same
5450365, May 20 1993 FUJIFILM Corporation Memory card control device
5452033, Jun 06 1994 Eastman Kodak Company Single use photographic film package and camera
5456539, May 25 1993 DUPLEX PRINTER, INC Printer with dual opposing printheads
5457515, May 10 1993 NATIONAL GRAPHICS, INC Method for forming a graphic image web
5457554, Apr 26 1993 Reveo Inc; Reveo, Inc 3-D printing technology based on selective reflecting polarizing media
5459819, Sep 24 1993 Eastman Kodak Company System for custom imprinting a variety of articles with images obtained from a variety of different sources
5461440, Feb 10 1993 Olympus Optical Co., Ltd. Photographing image correction system
5462375, May 17 1993 OKI ELECTRIC INDUSTRY CO , LTD Printer and data processing apparatus having printing unit
5463470, Oct 09 1991 FUJIFILM Corporation Methods of collecting photometric image data and determining light exposure by extracting feature image data from an original image
5465163, Mar 18 1991 CANON KABUSHIKI KAISHA - A CORP OF JAPAN Image processing method and apparatus for processing oversized original images and for synthesizing multiple images
5465213, Jul 27 1990 BAEBLER, BRUCE W ; 213 PARTNERS, LLC System and method of manufacturing a single book copy
5466918, Oct 29 1993 Intellectual Ventures Fund 83 LLC Method and apparatus for image compression, storage, and retrieval on magnetic transaction cards
5467118, Dec 21 1993 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Ink cartridge for a hard copy printing or plotting apparatus
5469211, Mar 29 1990 Sony Corporation Video camera
5471324, Apr 05 1994 Xerox Corporation Color printer calibration with improved color mapping linearity
5471592, Nov 17 1989 Texas Instruments Incorporated Multi-processor with crossbar link of processors and memories and method of operation
5472143, Sep 29 1992 BOEHRINGER INGELHEIM INTERNATIONAL GHBH Atomising nozzle and filter and spray generation device
5473352, Jun 24 1993 Brother Kogyo Kabushiki Kaisha Image forming device having sheet conveyance device
5475279, May 27 1992 Seiko Epson Corporation Piezoelectric/electrostrictive actuator having integral ceramic base member and film-type piezoelectric/electrostrictive element (S)
5475318, Oct 29 1993 ROXBURGH, LTD ; MARCUS, ROBERT B Microprobe
5477012, Apr 03 1992 Optical position determination
5477042, Jun 01 1993 Symbol Technologies, Inc 2-D bar code scanner/decoder having a redundancy canceller
5477264, Mar 29 1994 Intellectual Ventures Fund 83 LLC Electronic imaging system using a removable software-enhanced storage device
5477546, Jul 15 1991 Hitachi, Ltd. Teleconference terminal equipment and teleconference module
5479015, Aug 18 1994 Grumman Aerospace Corporation Multi-image detector assembly
5479515, May 11 1994 HAND HELD PRODUCTS, INC One-dimensional bar code symbology and method of using same
5482375, Nov 22 1993 REYNOLDS PRESTO PRODUCTS INC Tubular plastic end stops bonded to plastic zipper
5482389, Nov 25 1994 Westerex International, division of Capitol Circuits Paper feed driven cutter mechanism of an electronic printer
5483335, Mar 18 1993 Multiplex spectroscopy
5483379, May 14 1991 Forskarpatent I SYD AB Image registering in color at low light intensity
5485504, Aug 07 1991 DRNC HOLDINGS, INC Hand-held radiotelephone with video transmission and display
5488223, Sep 13 1994 Intermec IP Corporation System and method for automatic selection of printer control parameters
5489935, Sep 04 1992 PDACO LTD Laser printer power saver
5489945, Sep 13 1994 Eastman Kodak Company Timing logic system and method for selectably controlling a high resolution charge coupled device image sensor of the type having two line pixel registers to provide a high resolution mode and alternatively a television resolution mode of picture imaging
5489995, Jun 11 1992 Canon Kabushiki Kaisha Contact type image sensor, producing method of the same, and information processing apparatus
5493332, Feb 28 1994 ROPER SCIENTIFIC, INC Modular electronic imaging system which accepts replacement solid state images
5493335, Jun 30 1993 Apple Inc Single sensor color camera with user selectable image record size
5493409, Nov 29 1990 Minolta Camera Kabushiki Kaisha Still video camera having a printer capable of printing a photographed image in a plurality of printing modes
5493684, Apr 06 1994 Advanced Micro Devices Power management architecture including a power management messaging bus for conveying an encoded activity signal for optimal flexibility
5495097, Sep 14 1993 Symbol Technologies, Inc. Plurality of scan units with scan stitching
5495568, Jul 09 1990 Computerized clothing designer
5497498, Nov 05 1992 Giga Operations Corporation Video processing module using a second programmable logic device which reconfigures a first programmable logic device for data transformation
5502485, Jun 23 1993 Nikon Corporation Camera which compresses digital image data in correspondence with the focus control or the stop value of the camera
5502529, Feb 14 1995 Eastman Kodak Company Method of recycling single-use camera
5502577, Sep 25 1992 Xerox Corporation Paper user interface for image manipulations such as cut and paste
5504821, Mar 31 1993 Matsushita Electric Industrial Co., Ltd. Color converting apparatus for performing a three-dimensional color conversion of a colored picture in a color space with a small capacity of memory
5506603, May 19 1993 Fujitsu Ltd. Method and device for airbrushing
5506620, Dec 18 1991 Sony Corporation Recording/reproducing apparatus for providing indications of abnormal states
5510820,
5510857, Apr 27 1993 SAMSUNG ELECTRONICS CO , LTD Motion estimation coprocessor
5512924, Dec 28 1988 Canon Kabushiki Kaisha Jet apparatus having an ink jet head and temperature controller for that head
5512951, Jun 02 1992 Sony Corporation Auto-focusing apparatus
5512962, May 25 1993 HTC Corporation Motion vector detecting apparatus for moving picture
5513117, Apr 30 1993 Apparatus and method for electronically dispensing personalized greeting cards and gifts
5513922, Sep 24 1993 Esselte Meto International GmbH Printer having a removable control panel
5514860, May 24 1993 Pitney Bowes Inc. Document authentication system utilizing a transparent label
5515101, Apr 28 1989 Minolta Co., Ltd. Title generator for a video camera
5515104, Sep 28 1993 Hudson Soft Co. Ltd. Camera having color correction coefficients set in accordance with a combination of photographic parameters
5517222, Jul 01 1991 Canon Kabushiki Kaisha Ink jet recording apparatus having rotary drum with ink receptor
5517241, Jan 11 1991 FUJIFILM Corporation EEPROM memory card for an electronic still camera
5517265, Jan 09 1995 Eastman Kodak Company Method and apparatus for preventing unauthorized recycling of single-use camera and permitting authorized reuse of the camera
5520470, Oct 21 1993 Symbol Technologies, Inc Portable printer for handheld computer
5521372, Dec 22 1993 Xerox Corporation Framing codes for robust synchronization and addressing of self-clocking glyph codes
5521663, Oct 28 1992 Sound system for still film photography
5521710, Apr 12 1994 Xerox Corporation Method of applying electronically stored labels from a source job to a destination job in a printing system
5523780, Jun 24 1992 Canon Kabushiki Kaisha Ink jet recording apparatus and ink cartridge mountable on said apparatus
5524194, Sep 17 1990 Canon Kabushiki Kaisha Data communication apparatus
5528339, Aug 26 1994 Intellectual Ventures Fund 83 LLC Color image reproduction of scenes with color enhancement and preferential tone mapping
5529279, Aug 24 1994 Agilent Technologies Inc Thermal isolation structures for microactuators
5531431, Jan 29 1991 Fujitsu Isotec Limited Paper feeder for portable printer
5533170, Nov 02 1992 Applied Materials, Inc Rasterizer for a pattern generation apparatus
5533172, Dec 16 1993 Xerox Corporation Method of printing a print job with a print file
5534864, Feb 03 1992 Hitachi, LTD; Hitachi VLSI Engineering Corp Pipelined analog-to-digital converter
5534900, Sep 21 1990 Seiko Epson Corporation Ink-jet recording apparatus
5534923, Jun 11 1992 Canon Kabushiki Kaisha Video camera apparatus
5534962, Jan 09 1995 Eastman Kodak Company Method and apparatus for preventing unauthorized recycling of single-use camera and permitting authorized reuse of the camera
5535371, Feb 07 1992 Dell USA, L.P. Portable computer with automatic adaption to different device types on a standard port
5537075, Dec 17 1993 Sony Corporation Semiconductor integrated circuit having isolated supply paths for circuit blocks
5537144, Jun 11 1990 Reveo, Inc Electro-optical display system for visually displaying polarized spatially multiplexed images of 3-D objects for use in stereoscopically viewing the same with high image quality and resolution
5537294, Jun 01 1994 The Whitaker Corporation Printed circuit card having a contact clip for grounding a printed circuit board found therein
5539194, Jun 07 1989 AVAGO TECHNOLOGIES GENERAL IP SINGAPORE PTE LTD Modular hand-held data entry system
5539456, Aug 30 1991 Aiwa Co., Ltd. Video camera and camera system with white balance control
5541653, Jul 27 1993 Transpacific Kodex, LLC Method and appartus for increasing resolution of digital color images using correlated decoding
5541654, Jun 17 1993 L-3 Communications Corporation Focal plane array imaging device with random access architecture
5542487, Jul 01 1993 Intermec IP CORP Portable compact multi-function printer with cartridge paper supply
5543941, Dec 04 1990 Research Corporation Technologies, Inc. Method and apparatus for halftone rendering of a gray image using a blue noise mask
5547501, May 06 1994 KANSAI PAINT CO , LTD Method for formation of invisible marking and method for reading of invisible marking
5549740, Jul 11 1994 Canon Kabushiki Kaisha Liquid composition, ink set and image forming method and apparatus using the composition and ink set
5550935, Jul 01 1991 Eastman Kodak Company Method for multiframe Wiener restoration of noisy and blurred image sequences
5550938, Apr 17 1989 Omron Corporation Cordless image scanner
5552837, Mar 01 1995 Rovi Guides, Inc Remote controller for scanning data and controlling a video system
5553172, Dec 11 1991 Casio Computer Co., Ltd. Electronic image pickup apparatus having movable focus screen and movable mirror and which is capable of miniaturization
5553220, Sep 07 1993 Nvidia Corporation Managing audio data using a graphics display controller
5553864, May 22 1992 HANGER SOLUTIONS, LLC User image integration into audiovisual presentation system and methodology
5554432, Sep 15 1992 The Phscologram Venture, Inc. Press polymerization of lenticular images
5555061, Sep 27 1993 Nikon Corporation Camera with improved positioning of vibration detecting sensors therein
5555428, Dec 11 1992 Hughes Electronics Corporation Activity masking with mask context of SIMD processors
5555496, May 06 1994 Hallmark Cards, Incorporated Method and apparatus for communicating with a card distribution center for management, selection, and delivery of social expression cards
5557310, Oct 20 1989 Canon Kabushiki Kaisha Ink container with ring-shaped ink absorbing member
5557324, Oct 29 1992 Johns Hopkins University, The Polorization viewer
5557332, Mar 05 1993 Sony Corporation Apparatus and method for reproducing a prediction-encoded video signal
5559714, Apr 06 1992 HALLMARK CARDS, INC Method and apparatus for display sequencing personalized social occasion products
5559932, Jan 31 1994 Hitachi, LTD Printer and computer system with detachable built-in printer
5561604, Dec 08 1988 HALLMARK CARDS, INC , A CORP OF MISSOURI Computer controlled system for vending personalized products
5563643, Jan 03 1994 Xerox Corporation Ink jet printhead and ink supply manifold assembly having ink passageway sealed therebetween
5563722, Feb 26 1992 ART LEATHER MANUFACTURING CO , INC Method and apparatus for assembling a photographic album
5565900, Feb 04 1994 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Unit print head assembly for ink-jet printing
5566290, Apr 29 1992 Canon Kabushiki Kaisha Multi-media device
5566906, Sep 16 1992 Ricoh Company, Ltd. Decurling device for a rolled recording paper
5570130, Dec 06 1988 Canon Kabushiki Kaisha Detachable memory with starting block address selected in accordance with detected television programming standard
5570435, Dec 08 1989 Xerox Corporation Segmentation of text styles
5572310, Jan 24 1996 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Universal media size dial
5572596, Sep 02 1994 SENSAR, INC Automated, non-invasive iris recognition system and method
5572632, Oct 07 1994 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Universal frame buffer for a rendering device
5572635, Jun 04 1991 Hitachi, Ltd. Method for changing a natural image based on a light environment in the natural image
5574485, Oct 13 1994 Xerox Corporation Ultrasonic liquid wiper for ink jet printhead maintenance
5576783, Jun 12 1991 Recording and reproducing a 3-dimensional image
5579116, Jul 22 1993 FUJIFILM Corporation Video printer and printing method in use with the same
5579445, Dec 17 1993 Xerox Corporation Image resolution conversion method that employs statistically generated multiple morphological filters
5581773, May 12 1992 Massively parallel SIMD processor which selectively transfers individual contiguously disposed serial memory elements
5583971, Jan 09 1993 ND3D, B V Filmless method and apparatus for producing 3-D photographs
5586166, Mar 06 1993 Alcatel N.V Chip card
5586207, Nov 29 1993 NORTEL NETWORKS UK LIMITED Methods and assemblies for packaging opto-electronic devices and for coupling optical fibers to the packaged devices
5587740, Aug 17 1995 Digital photo kiosk
5591192, Feb 01 1995 Ethicon Endo-Surgery, Inc. Surgical penetration instrument including an imaging element
5591956, May 15 1995 Welch Allyn Data Collection, Inc Two dimensional data encoding structure and symbology for use with optical readers
5592237, Nov 04 1994 Varian Medical Systems, Inc High resolution image processor with multiple bus architecture
5592312, Apr 18 1994 FUJIFILM Corporation Method for transforming color signals
5592597, Feb 14 1994 Parametric Technology Corporation Real-time image generation system for simulating physical paint, drawing media, and feature modeling with 3-D graphics
5593236, Nov 06 1995 Hand-held sweep electronic printer with compensation for non-linear movement
5594500, Oct 17 1991 Canon Kabushiki Kaisha Image pickup apparatus
5598202, Mar 13 1995 ABLECO FINANCE LLC, AS COLLATERAL AGENT Method and apparatus for printing a graphic on fabric
5598242, Dec 14 1993 Nikon Corporation Vibration compensation mode selection apparataus and associated visual display for a camera
5599231, Oct 31 1994 NINTENDO CO , LTD Security systems and methods for a videographics and authentication game/program fabricating device
5600402, May 04 1995 Method and apparatus for producing three-dimensional graphic images using a lenticular sheet
5600563, Sep 23 1992 ONKOR, LTD System for printing social expression cards
5602377, Mar 01 1995 Symbol Technologies, LLC Bar code dataform scanning and labeling apparatus and method
5602412, Aug 15 1994 Nikon Corporation Imaging device which adjusts the ratio of color excitation values produced by an image pickup element in accordance with an exit pupil position and the size of an aperture
5602574, Aug 31 1994 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Matrix pen arrangement for inkjet printing
5604537, Sep 10 1992 Canon Kabushiki Kaisha Imaging apparatus having an automatic focusing means
5606420, Nov 29 1990 Minolta Camera Kabushiki Kaisha Camera system including a camera section and a reproduction section separately attachable to the camera section
5608437, Nov 18 1991 Canon Kabushiki Kaisha Ink container and ink jet recording apparatus using same
5610761, Dec 28 1993 Minolta Co., Ltd. Telescope having mechanism for automatically returning optical system to a reference dioptric power
5613146, Nov 17 1989 Texas Instruments Incorporated Reconfigurable SIMD/MIMD processor using switch matrix to allow access to a parameter memory by any of the plurality of processors
5613175, Aug 31 1995 Xerox Corporation Anisotropic imaging member
5613415, May 16 1994 NEC Corporation Paper cutting apparatus
5615123, Apr 02 1991 PNC BANK, A NATIONAL ASSOCIATION, AS COLLATERAL AGENT System for creating and producing custom card products
5615384, Nov 01 1993 MEDIATEK INC Personal communicator having improved zoom and pan functions for editing information on touch sensitive display
5615393, Oct 28 1993 PDACO LTD Computer system having a cordless keyboard and an induction coil in a plug-in electronic card module
5619030, Jan 22 1993 Canon Kabushiki Kaisha Control apparatus for image blur prevention employing an angular velocity and an image field sensor
5619590, Oct 06 1994 Eastman Kodak Company System for electronic image signal processing to provide a tonescale corrected full resolution luminance and two half resolution chrominance signals
5619622, Dec 16 1994 Xerox Corporation Raster output interface for a printbar
5619737, Feb 07 1996 Eastman Kodak Company Encodement-on-film recording apparatus utilizes flash components in a camera
5620269, Jan 17 1995 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Print media transport apparatus for moving print media through a printer from a high volume input tray accessory
5621445, Aug 27 1991 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Apparatus for refilling ink cartridges
5621524, Jul 14 1994 Hitachi Koki Co., Ltd. Method for testing ink-jet recording heads
5621545, Dec 08 1993 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Image production using color error diffusion
5621864, Jun 14 1995 ENGINEERED DATA PRODUCTS HOLDINGS, INC Label generation apparatus
5621868, Apr 15 1994 Sony Corporation; Sony Electronics, INC Generating imitation custom artwork by simulating brush strokes and enhancing edges
5623581, Jan 22 1996 AMERICAN PHOTO BOOTHS, INC Direct view interactive photo kiosk and image forming process for same
5624732, Sep 28 1994 Meiwa Gravure Co., Ltd. Bright printed sheet
5625669, Sep 27 1991 TRACFONE WIRELESS, INC Mobile phone with internal call accounting controls
5625770, Apr 20 1991 Ricoh Company, Ltd. File system for filing documents, using a catalog card having a plurality of marks thereon
5633667, Nov 05 1993 Seiko Epson Corporation Ink cartridge for printer
5633678, Dec 20 1995 Eastman Kodak Company Electronic still camera for capturing and categorizing images
5634730, Nov 06 1995 Hand-held electronic printer
5638103, Feb 20 1988 Dai Nippon Printing Co., Ltd. Method for recording and reproducing information, apparatus therefor and recording medium
5640002, Aug 15 1995 RUPPERT, JONATHAN P Portable RF ID tag and barcode reader
5640203, Feb 16 1994 Hoya Corporation Recording operation control device
5640627, Jul 02 1993 Hoya Corporation Display device in a camera finder
5642226, Jan 18 1995 Lenticular optical system
5644341, Jul 14 1993 Seiko Epson Corporation Ink jet head drive apparatus and drive method, and a printer using these
5644410, Mar 19 1993 Canon Kabushiki Kaisha Image sensing apparatus
5644431, Oct 21 1991 ARKANSAS, OF UNIVERSITY Directional image transmission sheet and method of making same
5644557, Dec 22 1993 Olympus Optical Co., Ltd. Audio data recording system for recording voice data as an optically readable code on a recording medium for recording still image data photographed by a camera
5644647, Sep 17 1990 Eastman Kodak Company; EASTMAN KODAK COMPANY, A CORP OF NJ User-interactive reduction of scene balance failures
5646658, Mar 16 1993 Digital Graphics Incorporation Modular ink jet printer head
5646752, Sep 15 1995 Canon Kabushiki Kaisha Color image processing apparatus which uses private tags to alter a predefined color transformation sequence of a device profile
5647484, May 31 1996 Laptop computer encasement device adapted for printer
5649031, Mar 31 1992 Hitachi, Ltd. Image information processor for producing high-quality output image
5652618, Jan 11 1993 Minolta Camera Kabushiki Kaisha Image reproducing apparatus
5652918, May 10 1994 Nikon Corporation Image blur suppression device for an optical camera
5655164, Dec 23 1992 Still film sound photography method and apparatus
5657237, Dec 23 1993 Electrex S.r.l. Instrument and method for the digital electronic measurement of periodic electrical quantities
5661506, Nov 10 1994 SIA Technology Corporation Pen and paper information recording system using an imaging pen
5663552, Oct 19 1993 Matsushita Electric Industrial Co., Ltd. Portable information terminal apparatus having image processing function
5664013, Jun 07 1995 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Embedded notepad system for a cellular telephone
5665249, Oct 17 1994 Xerox Corporation Micro-electromechanical die module with planarized thick film layer
5666141, Jul 13 1993 Sharp Kabushiki Kaisha Ink jet head and a method of manufacturing thereof
5666226, May 25 1993 Sharp Kabushiki Kaisha Optical apparatus
5666411, Jan 13 1994 Intarsia Software LLC System for computer software protection
5666516, Dec 16 1993 International Business Machines Corp Protected programmable memory cartridge having selective access circuitry
5670935, Feb 26 1993 MAGNA ELECTRONICS INC Rearview vision system for vehicle including panoramic view
5673073, Sep 29 1994 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Syringe for filling print cartridge and establishing correct back pressure
5677715, Dec 06 1994 Xerox Corporation Pivoting cap actuating assembly for printheads
5677716, Apr 30 1993 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Maximum-diagonal print mask and multipass printing modes, for high quality and high throughput with liquid-base inks
5678001, Aug 04 1993 Computerized game teaching method
5678081, Oct 05 1994 FUJI PHOTO OPTICAL CO , LTD Photographic camera having a picture size switching device
5679456, Jul 21 1993 TORAY INDUSTRIES, INC Fiber reinforced thermoplastic resin structure, process for production of same, and extruder for production of same
5679943, Apr 28 1989 AVAGO TECHNOLOGIES GENERAL IP SINGAPORE PTE LTD Hand-held terminal with display screens, interactive screens, magnetic credit card readers, scanners, printers and handlers
5680533, Oct 31 1994 NINTENDO CO , LTD Videographics program/video game fabricating system and method
5682191, Jan 24 1994 Eastman Kodak Company Ink jet printing apparatus having modular components
5687304, Feb 14 1994 Parametric Technology Corporation Real-time image generation system for simulating physical paint, drawing media, and feature modeling with 3-D graphics
5688056, Jun 17 1993 Gemplus Card International Method for controlling a printer in order to obtain postages
5689740, Sep 05 1994 Nikon Corporation Focus detection device
5691768, Jul 07 1995 Alcatel Lucent Multiple resolution, multi-stream video system using a single standard decoder
5692225, Aug 30 1994 Eastman Kodak Company Voice recognition of recorded messages for photographic printers
5696892, Jul 10 1992 DISNEY ENTERPRISES, INC Method and apparatus for providing animation in a three-dimensional computer generated virtual world using a succession of textures derived from temporally related source images
5696913, Nov 17 1989 Texas Instruments Incorporated Unique processor identifier in a multi-processing system having plural memories with a unified address space corresponding to each processor
5697006, Feb 06 1992 FUJIFILM Corporation Method and apparatus for recording stereoscopic images and lenticular recording material used therefor
5699102, Oct 15 1990 Eastman Kodak Company Non-impact copier/printer system communicating rosterized, printer independant data
5699491, Jun 15 1995 Canon Kabushiki Kaisha Printer driver having gamut-mapped colors
5703961, Dec 29 1994 WORLDSCAPE, INC Image transformation and synthesis methods
5706049, Nov 30 1995 Intellectual Ventures Fund 83 LLC Camera that records an active image area identifier with an image
5706870, May 06 1996 PROCUBED CORP Kit and method for refilling ink cartridges
5708518, Dec 04 1990 Research Corporation Technologies, Inc. Method and apparatus for halftone rendering of a gray scale image using a blue noise mask
5708900, Jun 18 1993 OLYMPUS OPTICAL CO , LTD Camera
5709253, Jul 30 1996 PROCUBED CORP Method for refilling an inkjet cartridge and apparatus to modify a cartridge with a negative pressure reservoir
5710582, Dec 07 1995 SAMSUNG ELECTRONICS CO , LTD Hybrid ink jet printer
5710948, Jun 09 1992 Nikon Corporation Camera system with color temperature meter
5713678, Jul 05 1996 COGNITIVETPG, LLC; CTPG OPERATING, LLC Low-paper sensing apparatus
5715228, Nov 24 1995 Sony Corporation Optical recording apparatus
5715234, Dec 16 1996 Eastman Kodak Company Electronic camera and associated printer which uses a display image
5715325, Aug 30 1995 Siemens Corporation Apparatus and method for detecting a face in a video image
5715493, Jan 08 1997 Eastman Kodak Company Apparatus and electronic camera and associated printer with light tight storage receptacle
5717197, Dec 21 1995 Xerox Corporation Tiled embedded data block-types for generic embedded data block systems
5717776, Mar 30 1994 Kabushiki Kaisha Toshiba Certification card producing apparatus and certification card
5719602, Jan 20 1995 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Controlling PWA inkjet nozzle timing as a function of media speed
5719621, Aug 10 1992 Olympus Optical Co., Ltd. Film image reproducing apparatus
5719936, Mar 07 1995 Gigaset Communications GmbH Communication device for mobile operation having a telephone and notebook with display
5719970, Jul 08 1994 Seiko Epson Corporation Image processing method and device
5722055, Feb 16 1995 Fujitsu Limited Portable radiotelephone terminal adaptable to multiple models
5722893, Oct 17 1995 SG GAMING, INC Card dispensing shoe with scanner
5726219, Dec 26 1996 Sumitomo Bakelite Company Limited Resin composition and printed circuit board using the same
5726435, Mar 14 1995 Denso Wave Incorporated Optically readable two-dimensional code and method and apparatus using the same
5726693, Jul 22 1996 Eastman Kodak Company Ink printing apparatus using ink surfactants
5726772, Dec 04 1990 Research Corporation Technologies Method and apparatus for halftone rendering of a gray scale image using a blue noise mask
5729252, Dec 27 1994 THE CHASE MANHATTAN BANK, AS COLLATERAL AGENT Multimedia program editing system and method
5729471, Mar 31 1995 The Regents of the University of California Machine dynamic selection of one video camera/image of a scene from multiple video cameras/images of the scene in accordance with a particular perspective on the scene, an object in the scene, or an event in the scene
5731062, Dec 22 1995 North Carolina State University Thermoplastic three-dimensional fiber network
5731829, Feb 02 1991 Canon Kabushiki Kaisha Information processing and recording apparatus with two recording medium conveyance routes
5734154, Sep 03 1996 Freescale Semiconductor, Inc Smart card with Iintegrated reader and visual image display
5734414, Mar 03 1994 Matsushita Electric Industrial Co., Ltd. Camera apparatus for electronic conference
5734425, Feb 15 1994 Intellectual Ventures Fund 83 LLC Electronic still camera with replaceable digital processing program
5737729, Jun 04 1996 Interactive kiosk for selecting and sending mail pieces
5740480, Feb 20 1997 Eastman Kodak Company Camera with movable first lens cover which supports movable second lens cover which opens during movement of first lens cover
5741155, Dec 20 1995 TERADATA US, INC Cable connector gender changer
5742296, Jan 08 1992 Canon Kabushiki Kaisha Image processing method and apparatus therefor
5742305, Jan 20 1995 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P PWA inkjet printer element with resident memory
5742333, Nov 12 1993 Reveo, Inc Electro-optical device for selectively transmitting polarized spectral components
5742861, Jan 08 1997 Eastman Kodak Company Electronic camera and associated printer which uses a display image
5743746, Apr 17 1996 IpLearn, LLC Reward enriched learning system and method
5745175, Oct 02 1995 FLASHPOINT TECHNOLOGY, INC Method and system for providing automatic focus control for a still digital camera
5748202, Jul 08 1994 Renesas Electronics Corporation Image data processor for processing pixel data in block buffer
5748228, May 27 1994 Fuji Xerox Co., Ltd. Image information enlarging reading device
5748326, Dec 07 1993 TTP Group PLC; PRIESTMAN, PAUL; GOODE, NIGEL Instant special effects electronic camera
5748448, Feb 21 1995 NEC Electronics Corporation Solid-state image sensor assembly with image sensor element chip mounted in package
5748764, Jul 19 1993 Eastman Kodak Company Automated detection and correction of eye color defects due to flash illumination
5748856, Aug 03 1992 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Method for reducing pixel density along a plurality of axes of a multiple dimension image representation
5749551, Sep 03 1996 Portable device to allow for simultaneous duplex printing and scanning on single pass machines
5750974, Apr 13 1995 KEYENCE CORPORATION Lighting apparatus having light emitting diodes arranged in a plurality of planes on a printed circuit board
5751303, Nov 10 1994 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Printing medium management apparatus
5751318, May 25 1993 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Elongated ink jet printhead using joined piezoelectric actuator
5751590, Sep 23 1992 Onkor, Ltd. System for printing social expression cards
5752114, Mar 17 1992 Sony Corporation Photographic and video image system
5753344, Dec 22 1993 In-line printing production of three dimensional image products incorporating lenticular transparent material
5754227, Sep 28 1994 Ricoh Company, Ltd. Digital electronic camera having an external input/output interface through which the camera is monitored and controlled
5754677, Oct 25 1994 Fuji Machine Mfg. Co., Ltd. Image processing apparatus
5754682, Sep 27 1995 Sony Corporation Picture processing method and apparatus
5754690, Oct 27 1995 Xerox Corporation Position sensitive detector based image conversion system capable of preserving subpixel information
5754700, Jun 09 1995 Intel Corporation Method and apparatus for improving the quality of images for non-real time sensitive applications
5755519, Dec 04 1996 ASSA ABLOY AB Printer ribbon identification sensor
5756978, Jun 21 1994 ZERCO SYSTEMS INTERNATONAL, INC Modular optical memory card image display point of sale terminal
5757354, Oct 31 1994 Sony Corporation Portable data communication apparatus with rotatable display images for accomodating a wireless remote keyboard
5757388, Dec 16 1996 Intellectual Ventures Fund 83 LLC Electronic camera and integral ink jet printer
5757393, Sep 06 1994 Canon Kabushiki Kaisha Image recording apparatus
5760814, Jul 13 1995 SAMSUNG ELECTRONICS CO , LTD Device for uncurling thermal sensitive recording paper
5761200, Oct 27 1993 Transpacific IP Ltd Intelligent distributed data transfer system
5761219, Jul 12 1996 Intermec IP Corporation Error correction for PDF417 and other machine-readable symbologies
5761698, Dec 16 1993 International Business Machines Corporation Computer system having audio/video/CD drive controller/coprocessor having integral memory interface, graphics coprocessor, digital signal processor, compact disk controller, and video controller
5761726, Nov 30 1993 Texas Instruments Incorporated Base address generation in a multi-processing system having plural memories with a unified address space corresponding to each processor
5764248, Jan 31 1995 President and Fellows of Harvard College Production of digitized stereoscopic polarizing images by ink jet printing
5764816, Jan 13 1994 Mita Industrial Co., Ltd. Image forming apparatus capable of converting the resolution
5765197, Dec 16 1993 International Business Machines Corporation Method and system for authentication of a memory unit for a computer system
5767945, Feb 28 1996 Eastman Kodak Company Methods of changing the visibility of some characteristic or information to be included in a hard copy of a recorded image
5768382, Nov 22 1995 Inventor Holdings, LLC Remote-auditing of computer generated outcomes and authenticated biling and access control system using cryptographic and other protocols
5768482, Jun 14 1995 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Resolution-triggered sharpening for scaling of a digital-matrix image
5768609, Jun 22 1994 Texas Instruments Incorporated Reduced area of crossbar and method of operation
5771012, Sep 11 1996 INTERSIL AMERICAS LLC Integrated circuit analog-to-digital converter and associated calibration method and apparatus
5771245, Mar 20 1992 Xerox Corporation Process for independently protecting two dimensional codes from one or more burst errors patterns
5774760, Dec 14 1994 FUJIFILM Corporation Method of controlling color correction and apparatus for imagewise exposure using said method
5777626, Aug 31 1994 Sony Corporation Video image special effect device
5781202, Apr 12 1995 Eastman Kodak Company Fax machine with concurrent drop selection and drop separation ink jet printing
5781708, Sep 13 1994 Intermec IP CORP Integral bar code printer and reader system and method of operation
5781924, Mar 07 1997 ELBRUS INTERNATIONAL, LIMITED Computer caching methods and apparatus
5784076, Jun 07 1995 International Business Machines Corporation Video processor implementing various data translations using control registers
5784088, Jul 20 1993 Canon Kabushiki Kaisha Ink jet recording apparatus using recording unit with ink cartridge having ink inducing element
5784434, Jan 16 1997 Industrial Technology Research Institute Digital intra-oral imaging system for dental radiography
5784521, Mar 09 1990 Canon Kabushiki Kaisha Signal recording system
5784959, Jul 09 1996 Hand-held printer and method for adhesive tape
5787193, Sep 27 1996 Xerox Corporation System for converting color image signals from RGB to CMY color spaces through look-up tables
5788387, Oct 13 1992 Seiko Epson Corporation Tape cartidge and printing device
5788388, Jan 21 1997 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Ink jet cartridge with ink level detection
5790158, Jan 28 1992 Seiko Epson Corporation Ink-jet recording apparatus and ink tank cartridge therefor
5790193, Nov 22 1995 Intellectual Ventures Fund 83 LLC Accessory module for an electronic camera
5790699, Oct 27 1995 Xerox Corporation Macrodetector based image conversion system
5792249, Jan 25 1995 Canon Kabushiki Kaisha Liquid composition, ink set, image-forming method and apparatus using the same
5793423, Mar 18 1991 Sony Corporation Solid state image sensing device
5793885, Jan 31 1995 International Business Machines Corporation Computationally efficient low-artifact system for spatially filtering digital color images
5793900, Dec 29 1995 Stanford University Generating categorical depth maps using passive defocus sensing
5796288, May 16 1995 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Graphics accelerator having minimal logic multiplexer system for sharing a microprocessor
5796429, Sep 18 1990 Canon Kabushiki Kaisha Apparatus for recording a video signal together with information from an external storage device
5796928, Feb 22 1994 Matsushita Electric Industrial Co., Ltd. Image reading apparatus with automatic document feeder
5801657, Feb 05 1997 Stanford University Serial analog-to-digital converter using successive comparisons
5801736, Nov 07 1994 CANON FINETECH, INC Ink jet printer with cartridge having integral ink storage chamber
5801854, Feb 14 1995 Canon Information Systems Research Australia Pty Ltd Color conversion method
5802413, Sep 18 1997 Monument Peak Ventures, LLC Printer receiving electronic camera
5805213, Dec 08 1995 Intellectual Ventures Fund 83 LLC Method and apparatus for color-correcting multi-channel signals of a digital camera
5805296, Aug 11 1995 Brother Kogyo Kabushiki Kaisha Optical scanning apparatus including an image reading section and an image printing section that share a common optical system and a method of printing and reading an image using the common optical system
5805550, Jul 29 1994 Sony Corporation Recording medium capable of recording a first data-type and a second data-type, playback method and playback device for playing back from the recording medium, and recording device for recording first-type data and second type data on the recording medium
5805883, Mar 08 1994 Fujitsu Limited Interrupt process distributing system
5805936, Nov 04 1993 Olympus Optical Co., Ltd. Instant camera
5806997, Feb 20 1996 Canon Kabushiki Kaisha Dot matrix printer
5808631, Apr 12 1995 Eastman Kodak Company Integrated fault tolerance in printing mechanisms
5808672, Oct 21 1993 Hitachi, Ltd. Apparatus for removably mounting an electronic camera to a computer system
5809181, Mar 08 1993 Canon Kabushiki Kaisha Color conversion apparatus
5809288, Mar 15 1993 Texas Instruments Incorporated Synchronized MIMD multi-processing system and method inhibiting instruction fetch on memory access stall
5809292, Nov 27 1991 International Business Machines Corporation Floating point for simid array machine
5809331, Apr 01 1996 Apple Inc System for retrieving configuration information from node configuration memory identified by key field used as search criterion during retrieval
5812071, Aug 13 1996 Nortel Networks Limited Apparatus and method for lossy compression using dynamic domain quantization
5812156, Jan 21 1997 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Apparatus controlled by data from consumable parts with incorporated memory devices
5814809, Feb 21 1995 MICROTEK INTERNATIONAL, INC Apparatus for optically scanning images using transmissive and reflective light sources
5815186, Apr 29 1996 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Removable roll-feed apparatus and method
5815211, Feb 15 1995 HANWHA TECHWIN CO , LTD Image processing system and method for outputting a superposed video signal including video and information
5816718, Jul 21 1997 ZIH Corp Hand-held label printer applicator
5816918, Apr 05 1996 SG GAMING, INC Prize redemption system for games
5818023, Feb 05 1996 Symbol Technologies, LLC Portable ID card verification apparatus
5818032, Jan 03 1997 Encoded color halftone micro-dots for high density digital information storage
5819240, Oct 11 1995 STAMPS COM INC System and method for generating personalized postage indica
5819662, Mar 29 1995 Seiko Epson Corporation Printer
5821886, Oct 18 1996 SAMSUNG ELECTRONICS CO , LTD Variable length code detection in a signal processing system
5822465, Sep 01 1992 Apple Inc Image encoding by vector quantization of regions of an image and codebook updates
5822606, Feb 16 1996 CUFER ASSET LTD L L C DSP having a plurality of like processors controlled in parallel by an instruction word, and a control processor also controlled by the instruction word
5822608, Nov 13 1990 International Business Machines Corporation Associative parallel processing system
5822623, Apr 27 1994 Nikon Corporation Camera with vibration correcting function
5824410, Jul 21 1993 Toray Industries, Inc. Fiber reinforced thermoplastic resin structure, process for production of same, and extruder for production of same
5825006, Mar 04 1994 Welch Allyn Data Collection, Inc Optical reader having improved autodiscrimination features
5825383, Dec 20 1994 Sharp Kabushiki Kaisha Ink jet head compact and allowing ink to be discharged with great force by using deformable structure
5825882, Nov 19 1992 Gemplus Card International Encryption and authentication method and circuit for synchronous smart card
5825947, Sep 01 1995 Olympus Optical Co., Ltd. Optical reproducing system for multimedia information recorded with code data having function for correcting image reading distortion
5826263, May 18 1993 Seiko Epson Corporation Data management, display, and retrieval system for a hierarchical collection
5826333, Oct 31 1994 Canon Kabushiki Kaisha Method of manufacturing an ink jet head
5828578, Nov 29 1995 SAMSUNG ELECTRONICS CO , LTD Microprocessor with a large cache shared by redundant CPUs for increasing manufacturing yield
5828911, May 24 1993 Olympus Optical Co., Ltd. One chip microcomputer built-in system
5829745, Mar 28 1995 HOME ARCADE SYSTEMS, INC Video game control unit with self-centering steering wheel
5831644, Oct 20 1995 Brother Kogyo Kabushiki Kaisha A recording medium feed mechanism and maintenance mechanism, having a common drive source, for an ink jet printer
5835136, Mar 12 1990 King Jim Co., Ltd. Electronic printer camera
5835616, Feb 18 1994 University of Central Florida Research Foundation, Inc Face detection using templates
5835641, Oct 14 1992 Mitsubishi Denki Kabushiki Kaisha Image pick-up apparatus for detecting and enlarging registered objects
5835817, Dec 22 1994 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Replaceable part with integral memory for usage, calibration and other data
5838331, Mar 02 1995 PTC INC Computer graphics system for creating and enhancing texture maps
5838458, Feb 25 1992 Method and apparatus for linking designated portions of a received document image with an electronic address
5841126, Nov 16 1995 California Institute of Technology CMOS active pixel sensor type imaging system on a chip
5841441, Jan 19 1996 VIRTUS ENTERTAINMENT, INC ; NXVIEW TECHNOLOGIES, INC High-speed three-dimensional texture mapping systems and methods
5841513, Nov 30 1992 Sony Corporation Apparatus for reproducing sound signals recorded on a motion picture film with digital sound track
5841885, Mar 29 1995 Eastman Kodak Company Print and method and apparatus for printing, storing and retrieving an image record
5845166, Feb 20 1997 Eastman Kodak Company Hybrid camera with identification matching of film and electronic images
5847698, Sep 17 1996 DataVentures, Inc. Electronic book device
5847836, Aug 29 1995 Canon Kabushiki Kaisha Printer-built-in image-sensing apparatus and using strobe-light means electric-consumption control method thereof
5848255, Jun 19 1996 Mitsubushi Denki Kabushiki Kaisha Method and aparatus for increasing the number of instructions capable of being used in a parallel processor by providing programmable operation decorders
5848264, Oct 25 1996 S3 GRAPHICS CO , LTD Debug and video queue for multi-processor chip
5848307, Jun 17 1994 FUJIFILM Corporation Camera for taking consecutive exposures
5848420, Jun 14 1996 Intellectual Ventures Fund 83 LLC System and method for accessing data of a digital camera from a personal computer
5850234, Jan 21 1997 Xerox Corporation Ink jet printhead with improved operation
5852502, May 31 1996 American Digital Imaging, Inc.; AMERICAN DIGITAL IMAGING, INC Apparatus and method for digital camera and recorder having a high resolution color composite image output
5852673, Mar 27 1996 Silicon Valley Bank Method for general image manipulation and composition
5854648, Aug 02 1990 Canon Kabushiki Kaisha Ink jet recording method and apparatus
5854882, Apr 08 1994 The University of Rochester; ROCHESTER, UNIVERSITY OF, THE Halftone correction systems
5859657, Dec 28 1995 Eastman Kodak Company Led printhead and driver chip for use therewith having boundary scan test architecture
5859921, May 10 1995 Mitsubishi Denki Kabushiki Kaisha Apparatus for processing an image of a face
5860036, Jun 10 1997 Industrial Technology Research Institute Controlling display useable in printers
5860363, Jan 21 1997 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Ink jet cartridge with separately replaceable ink reservoir
5861897, Jan 19 1991 Canon Kabushiki Kaisha Inkjet recording apparatus with a memory device disposed substantially within boundaries if a recording head unit
5864309, Oct 17 1996 Winbond Electronics Corp. Serial data timing base modulator
5864630, Nov 20 1996 AT&T Corp Multi-modal method for locating objects in images
5866253, Aug 19 1997 T A L C LTD Synthetic reinforcing strands with spaced filaments
5866895, Dec 16 1994 Olympus Optical Co., Ltd. Information recording medium and information reproduction system
5867213, Oct 21 1993 Canon Kabushiki Kaisha Image pickup apparatus having image-shake correcting devices determined according to zoom magnifying power
5867394, Mar 01 1996 STANDARD REGISTER COMPANY, THE Document dispenser operational program downloading
5867704, Feb 24 1995 Matsushita Electric Industrial Co., Ltd. Multiprocessor system shaving processor based idle state detection and method of executing tasks in such a multiprocessor system
5869595, Jun 13 1996 Xerox Corporation Polyimide curing process and improved thermal ink jet printhead prepared thereby
5870102, Nov 03 1995 Nvidia Corporation Texture compositing apparatus and method
5872594, Sep 20 1994 Method for open loop camera control using a motion model to control camera movement
5874718, Oct 23 1995 Olympus Optical Co., Ltd. Information recording medium
5874836, Sep 06 1996 International Business Machines Corporation High reliability I/O stacked fets
5875034, Nov 29 1990 MINOLTA CO , LTD Camera system having a recordable medium positioned between photographing and reproducing portions
5877715, Jun 12 1997 SAMSUNG ELECTRONICS CO , LTD Correlated double sampling with up/down counter
5878292, Feb 07 1997 Eastman Kodak Company Image-audio print, method of making and player for using
5881211, Dec 11 1995 Dainippon Screen Mfg. Co., Ltd. Data conversion table changing
5882128, Sep 02 1997 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Self-adjusting wheel for directly positioning and holding media during a cutting operation in a printer
5883653, Jul 12 1995 Brother Kogyo Kabushiki Kaisha Ink jet recording device and head holder with ink reserve section having a plurality of reserve grooves
5883663, Dec 02 1996 Multiple image camera for measuring the alignment of objects in different planes
5883830, Dec 29 1995 Intel Corporation CMOS imaging device with integrated flash memory image correction circuitry
5884013, Nov 17 1995 Agfa Graphics NV Autotypical screening with optimised dotshape
5884118, Nov 26 1996 Xerox Corporation Printer having print output linked to scanner input for automated image quality adjustment
5886371, Feb 22 1996 OKI ELECTRIC INDUSTRY CO , LTD Integrated circuit with gate-array interconnections routed over memory area
5886659, Aug 21 1997 California Institute of Technology On-focal-plane analog-to-digital conversion for current-mode imaging devices
5887992, Dec 05 1995 Brother Kogyo Kabushiki Kaisha Compact printing device with means for maintaining distance between print head and print medium
5889597, Jun 01 1994 Canon Kabushiki Kaisha Image processing apparatus and system having a detachable scanner unit
5892540, Jun 13 1996 RE SECURED NETWORKS LLC Low noise amplifier for passive pixel CMOS imager
5893037, Dec 09 1994 Apple Inc Combined electronic/silver-halide image capture system with cellular transmission capability
5893132, Dec 14 1995 Google Technology Holdings LLC Method and system for encoding a book for reading using an electronic book
5893662, Nov 05 1996 Brother Kogyo Kabushiki Kaisha Image forming device
5894309, Feb 27 1997 Mitsubishi Electric Research Laboratories, Inc System for modifying lighting in photographs
5894326, Aug 26 1996 Eastman Kodak Company Electronic camera having a printer
5896122, Jan 23 1991 FUJIFILM Corporation Color image processing
5896155, Feb 28 1997 Eastman Kodak Company Ink transfer printing apparatus with drop volume adjustment
5896169, Sep 16 1997 Philips Electronics North America Corp Video level measuring apparatus for X-ray imaging systems
5896176, Oct 25 1996 Texas Instruments Incorporated Content-based video compression
5896403, Sep 28 1992 Olympus Optical Co., Ltd. Dot code and information recording/reproducing system for recording/reproducing the same
5900909, Apr 13 1995 Intellectual Ventures Fund 83 LLC Electronic still camera having automatic orientation sensing and image correction
5901242, Jul 03 1996 Transpacific Kodex, LLC Method and apparatus for decoding spatiochromatically multiplexed color images using predetermined coefficients
5903706, Aug 26 1994 Hitachi, Ltd. Imager apparatus with rotatable camera head
5905529, Dec 22 1992 FUJIFILM Corporation Video camera, printer apparatus and method of controlling same, and a apparatus and method for detecting print inhibit signal
5907149, Jun 27 1994 L-1 SECURE CREDENTIALING, INC Identification card with delimited usage
5907354, May 23 1996 Intellectual Ventures Fund 83 LLC Memory card housing with a center-actuated ejector
5907415, Dec 15 1995 Canon Kabushiki Kaisha Image processing apparatus with color gamut dependent on color mode
5907434, Mar 20 1995 Canon Kabushiki Kaisha Image pickup apparatus
5909227, Apr 12 1995 Eastman Kodak Company Photograph processing and copying system using coincident force drop-on-demand ink jet printing
5909248, Jan 31 1997 Eastman Kodak Company Exposure control of camera attached to printer electronic camera
5909562, May 01 1997 Hewlett-Packard Company Backup FIFO in-line storage
5911056, May 01 1997 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P High speed interconnect bus
5913542, Sep 17 1993 FOX RIDGE, LLC System for producing a personal ID card
5914737, Apr 12 1995 Eastman Kodak Company Color printer having concurrent drop selection and drop separation, the printer being adapted for connection to a computer
5914748, Aug 30 1996 Intellectual Ventures Fund 83 LLC Method and apparatus for generating a composite image using the difference of two images
5914801, Sep 27 1996 ROYAL BANK CAPITAL PARTNERS Microelectromechanical devices including rotating plates and related methods
5914996, Feb 12 1997 Intel Corporation Multiple clock frequency divider with fifty percent duty cycle output
5915027, Nov 05 1996 NEC PERSONAL COMPUTERS, LTD Digital watermarking
5916358, Dec 30 1996 Eastman Kodak Company Ink compositions containing surfactant sols comprising mixtures of solid surfactants
5917542, Feb 18 1997 Apple Inc System and method for digital image capture and transmission
5917545, Aug 31 1995 Nikon Corporation Electronic still camera that can be directly inserted in an external device
5917937, Apr 15 1997 Microsoft Technology Licensing, LLC Method for performing stereo matching to recover depths, colors and opacities of surface elements
5917963, Sep 21 1995 Canon Kabushiki Kaisha Image processing apparatus and image processing method
5920062, Apr 30 1997 GS1 US, INC Combined linear and two-dimensional bar code structure
5920923, Jan 09 1998 Hydro-therapeutic stimulator
5921686, Jan 16 1997 PEAK TECHNOLOGIES, INC Kiosk printer
5923406, Jun 27 1997 Pitney Bowes Inc Personal postage stamp vending machine
5923882, Aug 29 1995 RPX Corporation Cross-module optimization for dynamically-shared programs and libraries
5924737, Dec 12 1996 Young America, LLC Postcard check
5929946, May 23 1995 RealD Inc Retarder stack for preconditioning light for a modulator having modulation and isotropic states of polarization
5930528, Nov 08 1990 Canon Kabushiki Kaisa Photography booth with multiple video and confirming image display
5931467, May 16 1997 Stuart J. Kamille Probability game
5933137, Jun 10 1997 FlashPoint Technology, Inc. Method and system for acclerating a user interface of an image capture unit during play mode
5933179, Dec 21 1992 Pitney Bowes Inc. Method of insuring print quality of a thermal printer
5937063, Sep 30 1996 Intel Corporation Secure boot
5937089, Oct 14 1996 Oki Data Corporation Color conversion method and apparatus
5937202, Feb 11 1993 3-D Computing, Inc.; 3D-COMPUTING, INC High-speed, parallel, processor architecture for front-end electronics, based on a single type of ASIC, and method use thereof
5938742, Aug 18 1995 Intellectual Ventures I LLC Method for configuring an intelligent low power serial bus
5938766, Mar 21 1997 Apple Computer, Inc. System for extending functionality of a digital ROM using RAM/ROM jump tables and patch manager for updating the tables
5939742, Feb 10 1997 Bell Semiconductor, LLC Field-effect photo-transistor
5940095, Sep 27 1995 FUNAI ELECTRIC CO , LTD Ink jet print head identification circuit with serial out, dynamic shift registers
5946007, Mar 20 1991 Canon Kabushiki Kaisha Temperature control of ink-jet recording head using heat energy
5946473, Jun 17 1997 International Business Machines Corporation LFSR implementation using split-table lookup
5949426, Jan 28 1997 Rambus Inc Non-linear texture map blending
5949439, Aug 15 1996 ATI Technologies ULC Computing apparatus and operating method using software queues to improve graphics performance
5949458, May 16 1995 SAMSUNG ELECTRONICS CO , LTD Ink cartridge for an ink jet printer
5949459, Jun 04 1997 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Method and apparatus for securing an ink container
5949467, Mar 07 1995 Francotyp-Postalia AG & Co Method and apparatus for preventing usage of an unauthorized inking ribbon in a thermal printing process
5949967, Dec 12 1997 Eastman Kodak Company Transforming input color values to device control signals
5955817, Sep 24 1997 MEMSCAP S A Thermal arched beam microelectromechanical switching array
5956051, May 29 1997 Pitney Bowes Inc Disabling a mailing machine when a print head is not installed
5956163, Sep 07 1996 U.S. Philips Corporation Image sensor
5959943, May 20 1988 Hitachi, Ltd. Information recording medium with clock information therein
5960412, May 06 1994 Hallmark Cards, Incorporated Method and apparatus for communicating with a card distribution center for management, selection, and delivery of social expression cards
5963104, Apr 15 1996 NXP B V Standard cell ring oscillator of a non-deterministic randomizer circuit
5964156, Jun 04 1997 Agfa Corporation Optimizing workflow in a prepress printing system
5965871, Nov 05 1997 PIXART IMAGING INC Column readout multiplexer for CMOS image sensors with multiple readout and fixed pattern noise cancellation
5966134, Jun 28 1996 AUTODESK, Inc Simulating cel animation and shading
5966553, Dec 26 1996 FUJIFILM Corporation Still camera
5969322, Jul 29 1996 MINOLTA CO , LTD Apparatus having a film condition judging device
5971533, Jan 07 1997 Brother Kogyo Kabushiki Kaisha Ink cartridge and printer
5971641, Jun 01 1998 Xerox Corporation Carriage driven tray lowering device for an ink jet printer
5973664, Mar 19 1998 Portrait Displays, Inc. Parameterized image orientation for computer displays
5973733, May 31 1995 Texas Instruments Incorporated Video stabilization system and method
5973751, Mar 17 1997 NIPPON TELEVISION NETWORK Picture replacement system and picture replacement method
5974168, Apr 16 1998 IBM Corporation Acquiring bump maps from curved objects
5974190, Dec 28 1992 Minolta Co., Ltd. Photographed image reproducing apparatus
5974234, Apr 15 1997 GOOGLE LLC Centralized print server for interfacing one or more network clients with a plurality of printing devices
5974238, Aug 07 1996 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Automatic data synchronization between a handheld and a host computer using pseudo cache including tags and logical data elements
5977982, Jun 28 1996 AUTODESK, Inc System and method for modification of the visual characteristics of digital 3D objects
5978100, Nov 14 1995 FUJIFILM Corporation Method of determining a principal portion of an image and method of determining a copying condition
5978511, Nov 12 1996 Tsukuba Software Laboratory Co., Ltd. Method and apparatus of inputting and outputting color pictures and continually-changing tone pictures
5978609, Feb 13 1995 Asahi Kogaku Kogyo Kabushiki Kaisha Electronic still video camera having electro-developing recording medium
5978838, Aug 19 1996 SAMSUNG ELECTRONICS CO , LTD Coordination and synchronization of an asymmetric, single-chip, dual multiprocessor
5980010, Jun 30 1997 Eastman Kodak Company Scanning ink jet printer for electronic displays
5982378, Aug 02 1996 SPATIAL CORP System and method for modeling a three dimensional object
5982424, Apr 23 1997 Cisco Technology, Inc CCD camera with adaptive compression control mechanism
5982853, Mar 01 1995 ALEXANDER TRUST Telephone for the deaf and method of using same
5984193, Mar 04 1998 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Printer media with bar code identification system
5986634, Dec 11 1996 Silicon Light Machines Corporation Display/monitor with orientation dependent rotatable image
5986671, Apr 10 1997 Monument Peak Ventures, LLC Method of combining two digitally generated images
5986698, Feb 20 1996 Canon Kabushiki Kaisha Image sensing apparatus with a moving image mode and a still image mode
5986706, Jul 22 1993 Canon Kabushiki Kaisha Electronic apparatus
5986718, Sep 19 1996 Video Magic, Inc. Photographic method using chroma-key and a photobooth employing the same
5988900, Nov 01 1996 Hand-held sweep electronic printer with compensation for non-linear movement
5989010, Sep 02 1997 SELAS FLUID PROCESSING CORP Matrix bed for generating non-planar reaction wave fronts, and method thereof
5989678, Jun 25 1996 Method of simultaneously printing a portion of a hook and loop fabric and attaching the fabric to another fabric and the fabric or garment resulting therefrom
5990469, Apr 02 1997 Gentex Corporation Control circuit for image array sensors
5990948, Feb 29 1996 Kabushiki Kaisha Toshiba Noise cancelling circuit for pixel signals and an image pickup device using the noise cancelling circuit
5990973, May 29 1996 BlackBerry Limited Red-eye detection/retouch apparatus
5991429, Dec 06 1996 INFRARED INDENTIFICATION, INC Facial recognition system for security access and identification
5991865, Dec 31 1996 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P MPEG motion compensation using operand routing and performing add and divide in a single instruction
5992994, Jan 31 1996 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Large inkjet print swath media support system
5995193, May 01 1998 Eastman Kodak Company Self-contained device for recording data encoded either in visible or invisible form
5995772, Feb 16 1996 Lexmark International Inc.; Lexmark International, Inc Imaging apparatus cartridge including an encoded device
5996893, Oct 28 1997 Eastman Kodak Company Method and apparatus for visually identifying an area on a photograph or image where digital data is stored
5997124, Mar 12 1997 OCE DISPLAY GRAPHICS SYSTEMS, INC Method and apparatus for drop volume normalization in an ink jet printing operation
5999190, Apr 04 1997 CERBERUS BUSINESS FINANCE, LLC, AS COLLATERAL AGENT Computer imaging using graphics components
5999203, Aug 18 1995 TTP Group PLC; PRIESTMAN, PAUL; GOODE, NIGEL Printer assembly with easily loaded paper cartridge
5999697, Jul 21 1995 Sony Corporation Apparatus for recording and/or reproducing still images
6000614, Dec 20 1996 Denso Corporation Two-dimensional code reading apparatus
6000621, Dec 21 1995 Xerox Corporation Tilings of mono-code and dual-code embedded data pattern strips for robust asynchronous capture
6000773, Aug 09 1994 Eastman Kodak Company Ink jet printer having ink use information stored in a memory mounted on a replaceable printer ink cartridge
6000791, Dec 23 1992 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Printer having a removable print cartridge with handle incorporating an ink inlet value
6005582, Aug 04 1995 Microsoft Technology Licensing, LLC Method and system for texture mapping images with anisotropic filtering
6005613, Sep 12 1996 Intellectual Ventures Fund 83 LLC Multi-mode digital camera with computer interface using data packets combining image and mode data
6006020, Apr 16 1993 Acoustic Technology LLC Video peripheral circuitry exercising bus master control over a bus of a host computer
6006039, Feb 13 1996 Scenera Technologies, LLC Method and apparatus for configuring a camera through external means
6007195, Aug 20 1996 Brother Kogyo Kabushiki Kaisha Scanner printer connectable to a PCMCIA card slot of an external computer and method for connecting a scanning printer to a PCMCIA card slot of an external computer
6009188, Feb 16 1996 Uber Technologies, Inc Method and system for digital plenoptic imaging
6010065, Mar 15 1994 Diebold Nixdorf, Incorporated Service method for automated banking machine
6011536, Apr 17 1998 New York University Method and system for generating an image having a hand-painted appearance
6011585, Jan 19 1996 Apple Computer, Inc. Apparatus and method for rotating the display orientation of a captured image
6011923, Jan 26 1998 Eastman Kodak Company Single use camera having flexure of a front cover constrained by an exposed-film door
6011937, Jun 13 1996 Sagem Communications Assembly of a printer and its consumption tank for business machine
6014165, Feb 07 1997 Eastman Kodak Company Apparatus and method of producing digital image with improved performance characteristic
6014170, Jun 20 1997 Nikon Corporation Information processing apparatus and method
6014457, Nov 01 1996 Fuji Xerox, Co., Ltd. Image processing apparatus
6015211, Jun 21 1996 Brother Kogyo Kabushiki Kaisha Portable printing device with shutter for covering print head
6016184, Aug 24 1995 FUJIFILM Corporation Filing system and reproduction apparatus
6019449, Jun 05 1998 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Apparatus controlled by data from consumable parts with incorporated memory devices
6019461, May 19 1995 Oki Data Corporation Printer and printing cartridge therefor
6019466, Feb 02 1998 Xerox Corporation Multicolor liquid ink printer and method for printing on plain paper
6020898, Jul 27 1992 Olympus Optical Co., Ltd. Information display system for displaying time-series numerical values and graph simultaneously
6020920, Jun 10 1997 FlashPoint Technology, Inc. Method and system for speculative decompression of compressed image data in an image capture unit
6020931, Apr 25 1996 GEORGE S SHENG Video composition and position system and media signal communication system
6022099, Jan 21 1997 Eastman Kodak Company Ink printing with drop separation
6022274, Nov 22 1995 NINTENDO CO , LTD Video game system using memory module
6023524, Dec 20 1995 FUJIFILM Corporation Method for determining amount of exposure
6023757, Jan 31 1996 Renesas Electronics Corporation Data processor
6028611, Aug 29 1996 Apple Inc Modular digital image processing via an image processing chain
6032861, Jan 03 1995 Method and apparatus for encoding and decoding bar codes with primary and secondary information and method of using such bar codes
6033137, Sep 14 1995 Canon Kabushiki Kaisha Ink jet printing apparatus performing printing with correction of image data at boundary portion of image
6034740, Oct 30 1995 Kabushiki Kaisha Photron Keying system and composite image producing method
6035214, Feb 24 1998 AT&T Corp Laptop computer with integrated telephone
6037915, Mar 01 1995 Olympus Optical Co., Ltd. Optical reproducing system for multimedia information
6038491, Nov 26 1997 CRANE PAYMENT INNOVATIONS, INC Monitoring and reporting system using cellular carriers
6039430, Jun 05 1998 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Method and apparatus for storing and retrieving information on a replaceable printing component
6040849, Nov 24 1998 Eastman Kodak Company Insertable thermal printer cartridges for digital camera
6042213, Oct 28 1994 Canon Kabushiki Kaisha Method and apparatus for correcting printhead, printhead corrected by this apparatus, and printing apparatus using this printhead
6043821, Jun 30 1997 ATI Technologies ULC Method and apparatus for rendering pixel information from blended texture maps
6044428, Mar 17 1998 Semiconductor Components Industries, LLC Configurable universal serial bus node
6046768, Jun 15 1994 Canon Kabushiki Kaisha Apparatus used for image blur prevention
6047130, Apr 24 1995 PIXEL MAGIC IMAGING, INC Apparatus and method for portrait photography
6048269, Jan 22 1993 MGM Grand, Inc. Coinless slot machine system and method
6049450, Oct 13 1997 Samsung Electronics Co., Ltd. Portable computer on which a communication device can be mounted
6050669, Dec 19 1991 Canon Kabushiki Kaisha Method of controlling an ink-jet recording apparatus according to recording apparatus in which the method is implemented
6052648, Apr 12 1996 EarthWatch Communications, Inc. Method and system for display of weather-related information
6053407, May 31 1995 Symbol Technologies, LLC Maxicode data extraction using spatial domain features
6056286, Nov 14 1997 Brother Kogyo Kabushiki Kaisha Automatic cut-sheet feeder
6057850, Jul 15 1997 Microsoft Technology Licensing, LLC Blended texture illumination mapping
6058498, Sep 28 1992 Olympus Optical Co., Ltd. Dot code and information recording/reproducing system for recording/reproducing the same
6061179, Jan 23 1996 Canon Kabushiki Kaisha Stereoscopic image display apparatus with two-/three-dimensional image display switching function
6062667, Aug 05 1989 Canon Kabushiki Kaisha Ink jet recording apparatus constructed to detect a properly mounted ink cartridge
6062681, Jul 14 1998 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Bubble valve and bubble valve-based pressure regulator
6064492, May 29 1998 Xerox Corporation Image data interface between digital front end and printer
6067088, May 18 1995 Canon Kabushiki Kaisha Image processing method and apparatus thereof
6069642, Oct 06 1998 Oki Data Corporation Cassette for holding ink ribbon and print paper therein and printer incorporating the cassette therein
6069711, Nov 26 1996 CITIZEN HOLDINGS CO , LTD Portable printer/facsimile device
6070013, Sep 18 1998 Monument Peak Ventures, LLC Transmogrifying photography systems, film packages, and cameras
6072586, Sep 04 1996 Intellectual Ventures Fund 83 LLC Computer program product for storing preselected zoom and crop data
6073034, Oct 31 1996 Kopin Corporation Wireless telephone display system
6074042, Jun 04 1997 Hewlett-Packard Company Ink container having a guide feature for insuring reliable fluid, air and electrical connections to a printing system
6074111, Dec 25 1996 Casio Computer Co., Ltd. Printing system, photographing apparatus, printing apparatus and combining method
6075882, Jun 18 1997 PHILIP MORRIS USA INC System and method for optically inspecting cigarettes by detecting the lengths of cigarette sections
6076913, Mar 04 1997 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Optical encoding of printhead service module
6078307, Mar 12 1998 Sharp Kabushiki Kaisha Method for increasing luminance resolution of color panel display systems
6078758, Feb 26 1998 Monument Peak Ventures, LLC Printing and decoding 3-D sound data that has been optically recorded onto the film at the time the image is captured
6081284, Mar 30 1994 Canon Kabushiki Kaisha Recording apparatus with plural ink tank configurations
6081422, Aug 19 1997 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Universal mount for computer peripheral device
6082581, Apr 28 1998 Ross, Anderson Business card dispenser
6084713, Jan 18 1995 Lenticular optical system
6085037, Sep 13 1996 Concord Camera Corp APS camera structure for film preloading
6087638, Jul 15 1997 Memjet Technology Limited Corrugated MEMS heater structure
6088025, Aug 24 1995 MATSUSHITA ELECTRIC INDUSTRIAL CO , LTD Terminal device with built-in image sensor
6088530, May 18 1999 Eastman Kodak Company Method of recycling one-time-use camera
6091514, Apr 11 1995 Canon Kabushiki Kaisha Ink jet recording apparatus recording images when an ink jet recording head is installed thereon and reading images when an image reading head is installed thereon
6091909, Nov 24 1998 Monument Peak Ventures, LLC Battery control for digital camera and integral printer
6094221, Jan 02 1997 Apple Computer, Inc System and method for using a scripting language to set digital camera device features
6094223, Jan 17 1996 Olympus Optical Co., Ltd. Automatic focus sensing device
6094279, Oct 28 1997 EAPEIRON SOLUTIONS INC System and process for non-perceptibly integrating sound data into a printed image
6094280, Nov 08 1996 Canon Kabushiki Kaisha Method and apparatus for correcting print density by printhead, printhead corrected by this apparatus, and printing apparatus using this printhead
6094282, May 17 1989 MINOLTA CO , LTD Camera capable of recording and reproducing a photographed image
6095418, Jan 27 1994 Symbol Technologies, LLC Apparatus for processing symbol-encoded document information
6095566, Mar 14 1996 Kabushiki Kaisha Toshiba Image recorded product, image recording system, image reproducing system, and recording medium for use to superimpose-record/reproduce additional information
6095633, Oct 06 1994 FUNAI ELECTRIC CO , LTD Process for priming a multi-chamber ink jet print head
6097431, Sep 04 1996 FLASHPOINT TECHNOLOGY, INC Method and system for reviewing and navigating among images on an image capture unit
6102289, Jun 28 1996 Intermec IP CORP 1D finder pattern for 2D bar codes
6102505, Dec 18 1997 Monument Peak Ventures, LLC Recording audio and electronic images
6104430, Sep 28 1994 Ricoh Company, Ltd. Digital electronic still camera which receives an input/output control program through a detachable communication interface card
6106147, Sep 23 1997 GOOGLE LLC Re-writeable optical card reader/writer unit using ink dots for data storage
6107988, Jun 12 1996 Portable electronic apparatus
6111598, Nov 12 1993 Reveo, Inc System and method for producing and displaying spectrally-multiplexed images of three-dimensional imagery for use in flicker-free stereoscopic viewing thereof
6111605, Nov 06 1995 Ricoh Company, LTD Digital still video camera, image data output system for digital still video camera, frame for data relay for digital still video camera, data transfer system for digital still video camera, and image regenerating apparatus
6115131, Jul 31 1996 Texas Instruments Incorporated Embedded display list interpreter for multiprocessor-based printer
6115137, Dec 06 1996 Canon Kabushiki Kaisha Image processing system, digital camera, and printing apparatus
6115837, Jul 29 1998 SAMSUNG ELECTRONICS CO , LTD Dual-column syndrome generation for DVD error correction using an embedded DRAM
6116510, May 16 1997 Olympus Optical Co., Ltd. Code reading and recording apparatus
6116715, Aug 23 1996 Pitney Bowes Inc. Device and method for sensing low ink level in an ink cartridge of a postage meter
6118484, May 22 1992 Canon Kabushiki Kaisha Imaging apparatus
6118485, May 18 1994 Sharp Kabushiki Kaisha Card type camera with image processing function
6118554, Nov 18 1996 Brother Kogyo Kabushiki Kaisha Image reading apparatus incorporating connector board for electrical connection and testing
6119931, Oct 02 1997 System and method for requesting and dispensing negotiable instruments
6119944, Feb 03 1997 Symbol Technologies, Inc Down-loadable hand-held optical reader
6120379, Nov 05 1997 Nintendo Co., Ltd. Portable game machine and portable game machine cartridge
6121990, Oct 03 1997 F&F Limited; Seiko Instruments Inc Printing apparatus and cartridge
6122403, Jul 27 1995 DIGIMARC CORPORATION AN OREGON CORPORATION Computer system linked by using information in data objects
6122526, Apr 24 1997 SCA VENTURES, LLC Cellular telephone and electronic camera system with programmable transmission capability
6123263, Jan 29 1998 Symbol Technologies, LLC Hand held dataform reader having strobing ultraviolet light illumination assembly for reading fluorescent dataforms
6124892, Mar 15 1996 Canon Kabushiki Kaisha Panhead device for movably supporting an apparatus
6126268, Apr 29 1998 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Multi-chamber ink supply
6128035, Apr 28 1994 Nikon Corporation Anti-blur image pickup device
6128446, Dec 11 1997 Eastman Kodak Company Method and apparatus for annotation of photographic film in a camera
6131807, Dec 16 1994 Olympus Optical Co., Ltd. Information recording medium and information reproduction system
6133951, May 10 1994 Asahi Kogaku Kogyo Kabushiki Kaisha Still-video camera with function setting operation
6133954, Mar 14 1996 Cirrus Logic, INC Integrated circuit color chip with cells with integral color filters including triplets of photodiodes with each having integrated therewith transistors for reading from and writing to the photodiode and methods of manufacture and operation thereof
6134030, May 24 1996 Canon Kabushiki Kaisha Image reading apparatus and image reading unit and control apparatus
6134339, Sep 17 1998 Monument Peak Ventures, LLC Method and apparatus for determining the position of eyes and for correcting eye-defects in a captured frame
6134353, Oct 16 1996 U S PHILIPS CORPORATION Digital image processing method for automatic extraction of strip-shaped objects
6135586, Oct 31 1995 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Large area inkjet printhead
6136212, Aug 12 1996 NANOSELECT, INC Polymer-based micromachining for microfluidic devices
6137495, Jul 20 1997 Hewlett-Packard Company Method for storing, accessing, transforming, and displaying multi-variable digital data
6137509, Sep 08 1993 Canon Kabushiki Kaisha Recording apparatus having a substrate for a recording head and method of producing the same
6137521, Jun 17 1996 Olympus Optical Co., Ltd. Information recording apparatus and information recording method
6137525, Feb 19 1997 LG Electronics Inc. Personal data communication apparatus
6141036, Apr 28 1994 Canon Kabushiki Kaisha Image recording and reproducing apparatus
6141431, Feb 02 1995 MATSUSHITA ELECTRIC INDUSTRIAL CO , LTD Image processing apparatus
6144414, Feb 26 1997 XACTI CORPORATION Image recording and reproduction apparatus
6145025, Aug 20 1996 SAMSUNG ELECTRONICS CO , LTD Method for transferring DMA data in a multimedia intergrated circuit including preloading DMA instructions in a frame buffer
6147682, May 07 1996 SAMSUNG ELECTRONICS CO , LTD , A CORP OF REPUBLIC OF KOREA Monitor for use with computer system and method of controlling supply of power to computer peripherals connected with the monitor
6147704, Nov 08 1990 Canon Kabushiki Kaisha Image processing system having a selector for selecting a picked-up image or a stored image for display
6149256, Nov 24 1998 Eastman Kodak Company Insertable cartridge for digital camera with ink jet printer
6151049, Jul 12 1996 Canon Kabushiki Kaisha Liquid discharge head, recovery method and manufacturing method for liquid discharge head, and liquid discharge apparatus using liquid discharge head
6151073, Mar 28 1996 FLASHPOINT TECHNOLOGY, INC Intelligent camera flash system
6152374, Aug 08 1997 Nitto Denko Corporation Method for renting fabric articles and data code-printed sheet
6152619, Jul 15 1997 Google Inc Portable camera with an ink jet printer and cutting blade
6154254, Oct 15 1997 Monument Peak Ventures, LLC Electronic camera for producing a digital image having a multimode microfluidic printing device
6157394, Aug 29 1996 Apple Inc Flexible digital image processing via an image processing chain with modular image processors
6158907, Nov 09 1998 Memjet Technology Limited PC card printer
6160633, Aug 07 1996 Olympus Optical Co., Ltd. Code printing apparatus for printing an optically readable code image at set positions on a print medium
6160642, Dec 22 1998 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Integrated printer and scanner device
6161203, Oct 03 1997 Ikanos Communications, Inc Communication system utilizing Reed-Solomon code to achieve auto frame synchronization acquistion
6161915, Jun 19 1998 FUNAI ELECTRIC CO , LTD Identification of thermal inkjet printer cartridges
6163338, Dec 11 1997 Apparatus and method for recapture of realtime events
6163340, Mar 27 1995 Canon Kabushiki Kaisha Automatic focus adjusting device
6163361, Apr 23 1999 Monument Peak Ventures, LLC Digital camera including a printer for receiving a cartridge having security control circuitry
6166826, Mar 25 1997 Seiko Epson Corporation Printing apparatus, printing method, and printing system
6166832, Dec 26 1995 Rohm Co., Ltd. Contact-type image sensor
6167551, Jul 29 1998 SAMSUNG ELECTRONICS CO , LTD DVD controller with embedded DRAM for ECC-block buffering
6167806, Mar 11 1998 GOSS INTERNATIONAL MONTATAIRE S A Device for controlling the printing of one or more webs of material in a rotary printing press
6169854, Jun 17 1998 MINOLTA CO , LTD Display device connectable to a camera
6170943, Oct 29 1998 Eastman Kodak Company Large and small format ink jet printing apparatus
6172688, Aug 06 1993 CANON FINETECH, INC Printer and printing method
6172706, Apr 19 1995 Canon Kabushiki Kaisha Video camera with automatic zoom adjustment based on distance between user's eyes
6177683, Nov 25 1998 C2it, Inc.; C2it Portable viewer for invisible bar codes
6178271, Apr 29 1996 MCLEAN HOSPITAL CORPORATION, THE Methods and systems for registering image data
6178883, Nov 26 1997 Kabushiki Kaisha Tokyo Kikai Tower type multi-color printing press
6180312, Mar 22 2000 Eastman Kodak Company Photographic imaging system incorporating metadata recording capability
6181361, Jul 22 1998 Dassault Automatismes et Telecommunications Device for thermal printing of a rolled paper strip, in particular for a plug-in or cordless portable payment terminal
6181377, Jul 29 1994 Canon Kabushiki Kaisha Apparatus for setting imaging functions based on a detected viewpoint
6181379, May 17 1995 Minolta Co., Ltd. Image sensing device with different image sensing characteristics for documents and scenery
6182901, Dec 22 1993 Xerox Corporation Orientational disambiguation for self-clocking glyph codes
6188430, Apr 18 1997 Canon Kabushiki Kaisha Digital camera and ink-jet printing apparatus
6188431, Feb 17 1996 BEJING XIAOMI MOBILE SOFTWARE CO ,LTD ; BEIJING XIAOMI MOBILE SOFTWARE CO ,LTD Electronic still camera and method for communication between electronic still cameras
6191406, Jul 24 1998 Eastman Kodak Company Data reader and reader system having visible centerless targeting
6195513, Feb 17 1997 FUJIFILM Corporation Electronic camera accessory and image composition system
6196541, Jul 15 1997 GOOGLE LLC De-curling print media in a digital instant printing camera
6196739, Jul 15 1997 GOOGLE LLC Paper guide system in a print on demand digital camera system
6198489, Feb 21 1997 Washington, University of Computer generated watercolor
6199874, May 26 1993 GEFUS SBIC II, L P Microelectromechanical accelerometer for automotive applications
6199969, Aug 01 1997 Eastman Kodak Company Method and system for detecting nonfunctional elements in an ink jet printer
6200216, Mar 06 1995 SEED SPRING LLC Electronic trading card
6201571, Jun 13 1996 NEC Corporation Digital camera recording a reduced image synthesized with a character image of the image picking-up information
6203147, Dec 22 1994 Hewlett-Packard Company Electrical and fluidic interface for an ink supply
6204877, Sep 09 1994 Olympus Optical Co., Ltd. Electronic image pickup system for transmitting image data by remote-controlling
6205245, Jul 28 1998 Intel Corporation Method and apparatus for rapid down-scaling of color images directly from sensor color filter array space
6211909, Feb 21 1996 Monument Peak Ventures, LLC Camera and equipment therefor
6211911, Oct 14 1994 Olympus Optical Co., Ltd. Image processing apparatus
6213588, Jul 15 1997 Zamtec Limited Electrostatic ink jet printing mechanism
6215561, Feb 28 1997 Seiko Epson Corporation Image processing apparatus and image processing method
6217165, Jul 15 1997 Zamtec Limited Ink and media cartridge with axial ink chambers
6219227, Jul 27 1999 Portable computer assembly
6219229, Sep 28 1999 Multifunctional computer
6222452, Dec 16 1996 TIMESTAMP AB Electronic identification tag
6222637, Jan 31 1996 FUJIFILM Corporation Apparatus and method for synthesizing a subject image and template image using a mask to define the synthesis position and size
6226015, Feb 25 1998 HANGER SOLUTIONS, LLC Method of automatically producing sketches and cartoon images from movies
6227643, May 20 1997 Eastman Kodak Company Intelligent printer components and printing system
6229565, Aug 15 1997 Hand-held electronic camera with integral printer
6229621, Jun 11 1998 NCH MARKETING SERVICES, INC Wireless system for broadcasting, receiving and selectively printing packets of information using bit-string selection means
6231148, Dec 12 1997 GOOGLE LLC Low cost disposable digital instant printing camera system
6232996, May 13 1999 CITIZEN WATCH CO , LTD Thermal printer
6233014, Apr 17 1996 Minolta Co., Ltd. Line sensor camera without distortion in photo image
6234389, Apr 29 1998 @POS COM, INC PCMCIA-based point of sale transaction system
6234392, Oct 08 1997 Fujitsu Limited Apparatus for issuing and/or reading recording medium and recording medium recorded with digitally coded signal
6234608, Jun 05 1997 Xerox Corporation Magnetically actuated ink jet printing device
6236431, May 27 1993 Canon Kabushiki Kaisha Video camera apparatus with distance measurement area adjusted based on electronic magnification
6236433, Sep 29 1998 Intel Corporation Scaling algorithm for efficient color representation/recovery in video
6238033, Dec 12 1997 GOOGLE LLC Reusable camera system which authenticates a refill station
6238043, May 25 1999 Zamtec Limited Ink cartridge for compact printer system
6238044, Jun 30 2000 Zamtec Limited Print cartridge
6238111, Dec 12 1997 GOOGLE LLC Camera picture printing user interface and method
6241350, Oct 09 1992 Canon Kabushiki Kaisha Ink jet printing head and printing apparatus using same
6241530, Dec 17 1997 Honeywell Inc. Backplane assembly for printed circuit boards
6243131, May 13 1991 Sony Semiconductor Solutions Corporation Method for directly scanning a rectilinear imaging element using a non-linear scan
6246827, Aug 17 1990 SAMSUNG ELECTRONICS CO , LTD A CORP OF REPUBLIC OF KOREA Deemphasis and subsequent reemphasis of high-energy reversed-spectrum components of a folded video signal
6252971, Apr 29 1998 Xerox Corporation Digital watermarking using phase-shifted stoclustic screens
6252976, Aug 29 1997 Monument Peak Ventures, LLC Computer program product for redeye detection
6254477, Jun 01 1998 SONY NETWORK ENTERTAINMENT PLATFORM INC ; Sony Computer Entertainment Inc Portable electronic device, entertainment system and method of operating the same
6256666, Jul 14 1998 GOOGLE LLC Method and system for remotely managing electronic mail attachments
6259469, Sep 05 1997 Nikon Corporation Information processing device, information processing method, and recording media
6260137, Sep 12 1997 Infineon Technologies AG Data processing unit with digital signal processing capabilities
6262769, Jul 31 1997 FlashPoint Technology, Inc. Method and system for auto rotating a graphical user interface for managing portrait and landscape images in an image capture unit
6267520, Dec 02 1994 Seiko Epson Corporation; KING JIM CO , LTD Printer head release mechanism
6268882, Dec 31 1998 ELBEX VIDEO LTD Dome shaped camera with simplified construction and positioning
6269217, May 21 1998 Monument Peak Ventures, LLC Multi-stage electronic motion image capture and processing system
6270177, Nov 09 1998 Zamtec Limited Printer unit for PC disk drive bay
6270271, Nov 07 1997 F&F Limited; Seiko Instruments Inc Printer for portable information processor
6273340, Sep 30 1997 Centre National de la Recherche Scientifique Coding method, coding equipment and resulting coded product
6273535, Feb 14 1997 Canon Kabushiki Kaisha Image forming system and images forming apparatus
6275239, Aug 20 1998 Hewlett Packard Enterprise Development LP Media coprocessor with graphics video and audio tasks partitioned by time division multiplexing
6276850, Nov 09 1998 GOOGLE LLC Sticker printing camera device
6278481, Oct 03 1996 HANGER SOLUTIONS, LLC Photocard that is inserted into a non-digital camera to enable the non-digital camera to take digital photographic images
6278486, Sep 18 1990 Canon Kabushiki Kaisha Information signal controlling system
6278491, Jan 29 1998 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Apparatus and a method for automatically detecting and reducing red-eye in a digital image
6280106, Feb 19 1999 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Feed apparatus for continuous band form print media and cut sheet form print media
6282082, Jul 31 1998 ADT Services AG Case for a modular tablet computer system
6285410, Sep 11 1998 CEDAR LANE TECHNOLOGIES INC Method and system for removal of flash artifacts from digital images
6290334, Aug 02 1991 Canon Kabushiki Kaisha Recording apparatus, recording head and substrate therefor
6290349, May 25 1999 Silverbrook Research Pty LTD Printer consumable cartridge
6292272, Aug 03 1995 Canon Kabushiki Kaisha Image sensor
6292574, Aug 29 1997 Monument Peak Ventures, LLC Computer program product for redeye detection
6293469, Dec 20 1994 PERTECH RESOURCES, INC Transaction printer
6293658, Jul 15 1997 Memjet Technology Limited Printhead ink supply system
6294101, Jul 15 1997 Zamtec Limited Method of manufacture of a thermoelastic bend actuator ink jet printer
6297872, Dec 27 1997 Konica Corporation Image forming apparatus
6300976, Sep 28 1994 Ricoh Company, Ltd. Digital image capturing device having an input/output interface through which the device is controlled
6302329, Dec 27 1994 Sharp Kabushiki Kaisha Method and apparatus for recording digital information in two-dimensional pattern, carrier of digital information recorded thereby, and a method and apparatus for decoding such digital information
6304291, Jul 15 1997 GOOGLE LLC Artcard for the administration of the operation of a camera device
6304345, Dec 14 1998 Monument Peak Ventures, LLC Auto resoration of a print
6304684, Feb 15 2000 CYBERECORD, INC Information processing system and method of using same
6304825, Jan 19 1999 Xerox Corporation Rotary encoder error compensation system and method for photoreceptor surface motion sensing and control
6305775, Jun 28 1996 Canon Kabushiki Kaisha Ink-jet printing method and apparatus therefor
6312070, Jul 15 1997 GOOGLE LLC Recycling of multi--use digital instant printing camera systems
6312114, Oct 16 1998 Memjet Technology Limited Method of interconnecting a printhead with an ink supply manifold and a combined structure resulting therefrom
6315200, Dec 16 1997 GOOGLE LLC Encoded data card reading system
6315384, Mar 08 1999 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Thermal inkjet printhead and high-efficiency polycrystalline silicon resistor system for use therein
6317156, Aug 07 1996 Olympus Corporation Printer incorporated type electronic camera and member to be recorded
6317192, Jul 15 1997 GOOGLE LLC Utilization of image tiling effects in photographs
6318826, Jun 27 1997 IMAGE PROCESSING TECHNOLOGIES LLC Device for determining a quantity of consumable product, notably ink, present in a reservoir with a number of compartments, and corresponding document printing device
6320591, Sep 10 1999 Gateway, Inc System and method for the utilization of an electronic book
6320617, Nov 07 1995 OmniVision Technologies, Inc CMOS active pixel sensor using a pinned photo diode
6322181, Sep 23 1997 GOOGLE LLC Camera system including digital audio message recording on photographs
6323912, Nov 20 1997 Eastman Kodak Company Electronic camera with microfluidic printer that prints scented images
6325380, May 20 1999 BURGMANN INDUSTRIES GMBH & CO KG Face seal assembly
6325488, Oct 28 1997 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Inkjet printhead for wide area printing
6328395, Sep 09 1996 Seiko Epson Corporation Ink jet printer and ink jet printing method
6331867, Mar 20 1998 Rovi Technologies Corporation Electronic book with automated look-up of terms of within reference titles
6334587, Dec 21 1996 Koenig & Bauer Aktiengesellschaft Spare paper roll
6337712, Nov 20 1996 Meta Platforms, Inc System for storing and utilizing picture image data recorded by digital camera
6341845, Aug 25 2000 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Electrical connection for wide-array inkjet printhead assembly with hybrid carrier for printhead dies
6344904, Oct 03 1998 Arrangement for reading from and/or writing to flexible sheet media in a curved configuration and method
6353680, Jun 30 1997 Intel Corporation Method and apparatus for providing image and video coding with iterative post-processing using a variable image model parameter
6356276, Mar 18 1998 Intel Corporation Median computation-based integrated color interpolation and color space conversion methodology from 8-bit bayer pattern RGB color space to 12-bit YCrCb color space
6356308, Jun 11 1998 Polycom, Inc. Device for rotatably positioning a camera or similar article about two orthogonal axes
6356357, Jun 30 1998 FLASHPOINT TECHNOLOGY, INC Method and system for a multi-tasking printer capable of printing and processing image data
6357865, Oct 15 1998 Xerox Corporation Micro-electro-mechanical fluid ejector and method of operating same
6359650, Dec 28 1994 Canon Kabushiki Kaisha Electronic camera having a tilt detection function
6362868, Jul 15 1997 GOOGLE LLC Print media roll and ink replaceable cartridge
6363239, Aug 11 1999 Eastman Kodak Company Print having attached audio data storage and method of providing same
6366319, Jul 03 1997 DRS Training & Control Systems, LLC Subtractive color processing system for digital imaging
6366694, Mar 26 1998 Intel Corporation Integrated color interpolation and color space conversion algorithm from 8-bit Bayer pattern RGB color space to 24-bit CIE XYZ color space
6370558, Nov 30 1993 Texas Instruments Incorporated Long instruction word controlling plural independent processor operations
6375301, Jan 21 1997 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Replaceable cartridge, kit and method for flushing ink from an inkjet printer
6375314, Aug 04 2000 CHINA CITIC BANK CORPORATION LIMITED, GUANGZHOU BRANCH, AS COLLATERAL AGENT Removable cassette having integrated supply of consumables
6377715, Oct 27 1994 VISTA PEAK VENTURES, LLC Data inputting device
6378997, Aug 15 2000 Canon Kabushiki Kaisha Media cartridge and ink jet recording apparatus
6381418, Aug 11 1999 Eastman Kodak Company Print having information associated with the print stored in a memory coupled to the print
6386675, Jun 04 1997 Hewlett-Packard Company Ink container having a multiple function chassis
6386772, Jan 25 1999 ASSA ABLOY AB Method and apparatus for communicating between printer or laminator and supplies
6389183, Apr 10 1997 Microtek International Inc. Contact image sensor hand-held scanner
6390368, Jun 07 1997 Aquasol Ltd. Coding systems
6390589, Oct 27 1998 Canon Kabushiki Kaisha Head substrate, ink jet head, and ink jet printer
6392699, Mar 04 1998 Intel Corporation Integrated color interpolation and color space conversion algorithm from 8-bit bayer pattern RGB color space to 12-bit YCrCb color space
6402308, Jun 24 1999 Canon Kabushiki Kaisha Liquid supply system and liquid supply vessel used for the same
6404511, Dec 11 1998 Seiko Epson Corporation Self-calibration of network copier system
6405055, Nov 09 1998 Memjet Technology Limited Hand held mobile phone with integral internal printer with print media supply
6407777, Oct 09 1997 FotoNation Limited Red-eye filter method and apparatus
6416152, May 13 1999 Seiko Epson Corporation Ink cartridge for ink-jet printing apparatus
6421050, Feb 27 1997 Mitsubishi Electric Research Laboratories, Inc User interface for creation of image generation and transformation functions
6425661, Jun 30 2000 Zamtec Limited Ink cartridge
6431669, Jul 15 1997 GOOGLE LLC Method and apparatus for information storage in a portable print roll
6431703, Oct 31 1997 Xerox Corporation Apparatus and method for improved life sensing in a replaceable intermediate transfer surface application assembly
6437849, Feb 03 1997 Eastman Kodak Company Method and apparatus for printing on a photosensitive material using a liquid crystal display
6441921, Oct 28 1997 Eastman Kodak Company System and method for imprinting and reading a sound message on a greeting card
6442336, Nov 21 1980 Hand-held video camera-recorder-printer and methods for operating same
6442525, Jul 15 1997 Memjet Technology Limited System for authenticating physical objects
6445417, Aug 19 1996 Sony Corporation Video still camera with a lens unit rotation device
6454375, Sep 01 1998 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Pressure based ink level detector and method
6462835, Jul 15 1998 Eastman Kodak Company Imaging system and method
6466618, Nov 19 1999 Sharp Laboratories of America, Inc. Resolution improvement for multiple images
6472052, Jul 15 1997 GOOGLE LLC Digital camera print roll with periodic anisotropic stiffness
6473123, Aug 21 1997 Flash Point Technology, Inc. Method and system for organizing DMA transfers to support image rotation
6473728, May 23 1996 Oracle America, Inc On-demand, multi-language business card printer
6489990, Nov 30 1995 Pendragon Wireless LLC Highlight compensation apparatus for monochrome cameras
6493029, Mar 15 1996 VLSI Vision Limited Image restoration method and associated apparatus
6493031, Mar 31 1995 Canon Kabushiki Kaisha Visual information processing method and apparatus for extracting feature quantities from a two-dimensional image signal
6496654, Oct 20 2000 GOOGLE LLC Method and apparatus for fault tolerant data storage on photographs
6515761, Oct 14 1997 Nikon Corporation Camera having a printer with a paper feed device using a vibration actuator
6522767, Jul 02 1996 Wistaria Trading Ltd Optimization methods for the insertion, protection, and detection of digital watermarks in digitized data
6525763, Apr 10 1995 Minolta Co., Ltd. Film image reading device and method with focus adjustment
6526181, Jan 27 1998 Apple Inc Apparatus and method for eliminating imaging sensor line noise
6529287, Jan 31 1996 Avision Inc. Image processing system
6529522, Mar 12 1997 Canon Kabushiki Kaisha Communication apparatus with digital interface
6530519, Jul 07 1999 Riso Kagaku Corporation Image recording apparatus
6533181, Jul 22 2000 MICROSCAN SYSTEMS, INC Direct marking of parts with encoded symbology method, apparatus and symbolody
6539180, Nov 09 1998 GOOGLE LLC Print on demand camera system incorporating a detachable printing unit
6542622, Aug 30 1999 Eastman Kodak Company Methods and articles for determining invisible ink print quality
6543880, Aug 25 2000 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Inkjet printhead assembly having planarized mounting layer for printhead dies
6546187, Dec 26 1997 FUJIFILM Corporation Digital camera for providing random special effect images and an image processing method therein
6547364, Jul 12 1997 Memjet Technology Limited Printing cartridge with an integrated circuit device
6549575, Nov 07 1996 GLOBALFOUNDRIES Inc Efficient, flexible motion estimation architecture for real time MPEG2 compliant encoding
6552743, Apr 08 1998 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Digital camera-ready printer
6552821, Aug 29 1995 Canon Kabushiki Kaisha Printer-built-in image-sensing apparatus using strobe-light means and electric-consumption control method thereof
6553459, May 25 1999 GOOGLE LLC Memory module for compact printer system
6556245, Mar 08 1999 Game hunting video camera
6563538, Sep 26 1997 Nikon Corporation Interpolation device, process and recording medium on which interpolation processing program is recorded
6565196, Jul 11 2000 MATSUSHITA ELECTRIC INDUSTRIAL CO , LTD Ink jet head, method of manufacturing the same and ink jet recording apparatus
6570616, Oct 17 1997 Nikon Corporation Image processing method and device and recording medium in which image processing program is recorded
6571021, Jan 29 1999 International Business Machines Corporation Recovering an invisible digital image from a distorted image replica
6573927, Feb 20 1997 Apple Inc Electronic still camera for capturing digital image and creating a print order
6573932, Mar 15 2002 Eastman Kodak Company Method for automatic white balance of digital images
6573936, Aug 17 1998 Intel Corporation Method and apparatus for providing a single-instruction multiple data digital camera system that integrates on-chip sensing and parallel processing
6573939, Feb 28 1997 Ricoh Company, Ltd. Digital camera having synchronized movement of lens and flash
6574363, Nov 13 1998 CNH Industrial Canada, Ltd Method for color detection in video images
6577818, Sep 14 2000 Canon Kabushiki Kaisha Information processing method, information processing system, electronic device, and cartridge
6583820, Mar 17 1997 Konica Corporation Controlling method and apparatus for an electronic camera
6587140, Oct 23 1997 Intellectual Ventures Fund 83 LLC System and method for using a single intelligence circuit in both a digital camera and printer
6593938, Apr 10 1998 Ricoh Company, LTD IMAGE PROCESSING APPARATUS, METHOD AND COMPUTER-READABLE RECORDING MEDIUM WITH PROGRAM RECORDED THEREON, FOR JOINING IMAGES TOGETHER BY USING VISIBLE JOINING POINTS AND CORRECTING IMAGE DISTORTION EASILY
6597384, Dec 22 1999 Intel Corporation Automatic reorienting of screen orientation using touch sensitive system
6597394, Nov 16 1997 PICTOS TECHNOLOGIES INC Programmable image transform processor for digital image processing
6597468, Apr 01 1997 FUJIFILM Corporation Image print system for printing a picture from an additional information affixed image file
6597817, Jul 15 1997 Google Inc Orientation detection for digital cameras
6599196, Dec 11 1998 SONY NETWORK ENTERTAINMENT PLATFORM INC ; Sony Computer Entertainment Inc Controllers with selectable force feedback
6600930, Jul 11 1997 SNAPTRACK, INC Information provision system, information regeneration terminal, and server
6603864, Oct 30 1998 Fuji Xerox Co., Ltd. Image processing apparatus and image processing method
6606171, Oct 09 1997 Howtek, Inc. Digitizing scanner
6607267, Feb 02 2001 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Method of printing a security verification with inkjet printers
6608297, Jul 23 1997 XROS, INC Scanner document speed encoder
6611631, Mar 01 1999 Adobe Inc Data management for rotated sampled images
6614560, Jul 15 1997 Google Inc Integrated camera circuit including image sensor, image processing, and printer drive circuits
6614914, May 16 1996 DIGIMARC CORPORATION AN OREGON CORPORATION Watermark embedder and reader
6618091, Sep 14 1995 Canon Kabushiki Kaisha Image pickup apparatus having image signal state adjusting means a response characteristic of which is controlled in accordance with image magnification rate
6618117, Jul 12 1997 GOOGLE LLC Image sensing apparatus including a microcontroller
6618553, May 26 1997 Seiko Epson Corporation Digital camera and printing system
6619774, Nov 11 1997 Brother Kogyo Kabushiki Kaisha Image forming device operable by different power sources
6619860, Nov 14 1997 KODAK ALARIS INC Photobooth for producing digitally processed images
6622276, Sep 28 1992 Olympus Optical Co., Ltd. Recording medium, information reproducing apparatus and information reproducing method
6622923, Jun 30 2000 Memjet Technology Limited Data package template with data embedding
6624848, Jul 15 1997 Google Inc Cascading image modification using multiple digital cameras incorporating image processing
6626529, Nov 09 1998 Memjet Technology Limited Print media cartridge with integral print media transport mechanism
6627870, Oct 25 1999 Silverbrook Research Pty LTD Sensing device with interchangeable nibs
6628326, Feb 05 1999 Monument Peak Ventures, LLC Wireless communication system for transmitting images from an enabled electronic camera to receiver
6628333, Nov 12 1997 MEDIATEK INC Digital instant camera having a printer
6628430, Nov 09 1998 Memjet Technology Limited Hand held mobile phone with integral internal printer
6633332, May 13 1999 HEWLETT-PACKARD DEVELOPMENT COMPANY L P Digital camera system and method capable of performing document scans
6633667, Oct 19 1998 Canon Kabushiki Kaisha Image processing apparatus and method
6634814, Aug 12 1998 Eastman Kodak Company Printer media supply spool adapted to allow the printer to sense type of media, and method of assembling same
6636216, Jul 15 1997 Google Inc Digital image warping system
6636332, Feb 05 1998 Eastman Kodak Company System for reproducing images and method thereof
6640004, Jul 28 1995 Canon Kabushiki Kaisha Image sensing and image processing apparatuses
6642956, May 29 1998 Nokia Corporation Digital image processor for a digital camera
6644764, Oct 28 1998 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Integrated printing/scanning system using invisible ink for document tracking
6646757, Jul 15 1997 Google Inc Garment design and fabric printing system utilizing digitally encoded design cards
6647369, Oct 20 2000 Google Inc Reader to decode sound and play sound encoded in infra-red ink on photographs
6650317, Jul 19 1971 Texas Instruments Incorporated Variable function programmed calculator
6650365, Apr 09 1997 Hoya Corporation Image correction information recording device
6650366, Mar 26 1998 Monument Peak Ventures, LLC Digital photography system using direct input to output pixel mapping and resizing
6650975, Mar 19 1999 MC ROBOTICS Multifunctional mobile appliance
6652089, Dec 16 1998 Memjet Technology Limited Duplex inkjet printing system
6652090, Dec 16 1998 Memjet Technology Limited Recess mountable printing system
6654051, Oct 07 1997 XACTI CORPORATION Digital camera
6654057, Jun 17 1999 Round Rock Research, LLC Active pixel sensor with a diagonal active area
6655776, May 15 2001 Eastman Kodak Media pack for combination image acquisition and printing device
6657657, Dec 19 1997 Hoya Corporation Camera, printer and picture compression system
6665454, Jul 15 1997 GOOGLE LLC Dot adjacency compensation in optical storage systems using ink dots
6667759, Dec 31 1997 AT&T Corp Video phone form factor
6667771, Dec 04 1998 KT & Co., Ltd. Wireless image transmission system having a portable camera
6670950, Oct 19 1999 SAMSUNG ELECTRONIC CO LTD Portable computer and method using an auxilliary LCD panel having a touch screen as a pointing device
6670985, Sep 28 1994 Canon Kabushiki Kaisha Image sensing apparatus including a card device connectable to an information processing device
6678402, May 13 1996 Cummins-Allison Corp. Automated document processing system using full image scanning
6680749, May 06 1997 FlashPoint Technology, Inc. Method and system for integrating an application user interface with a digital camera user interface
6681055, Jan 28 1999 ARAI KABUSHIKI KAISHA Formation method of two-dimensional code
6683996, Sep 16 1999 GOOGLE LLC Method and apparatus for rotating Bayer images
6686970, Oct 03 1997 Canon Kabushiki Kaisha Multi-media editing method and apparatus
6687383, Nov 09 1999 GOOGLE LLC System and method for coding audio information in images
6688528, Jul 15 1997 GOOGLE LLC Compact display assembly
6688739, May 15 2001 Eastman Kodak Image acquisition device with integral ink jet printing
6690731, Dec 01 1997 DBEZ FIRENZE LLC; Fortress Credit Co LLC Method and apparatus for diagonal processing of video data
6690881, Aug 24 1998 Sony Corporation Digital camera apparatus and recording method thereof
6691922, Dec 28 2000 Intermec IP CORP Method and apparatus for encoding data in logos
6697107, Jul 09 1998 Monument Peak Ventures, LLC Smoothing a digital color image using luminance values
6697174, Oct 03 1998 Arrangement for reading from and/or writing to flexible sheet media in a curved configuration and method
6700619, May 20 1997 MINOLTA CO , LTD Electronic still camera with feedback control
6701361, Aug 22 1996 Intermec IP CORP Enhanced mobility and address resolution in a wireless premises based network
6702417, Jul 12 1997 Memjet Technology Limited Printing cartridge with capacitive sensor identification
6704046, Apr 17 2002 Google Technology Holdings LLC Digital pixel image sensor with independent color channel reference signals
6710892,
6719415, Apr 27 1999 Canon Kabushiki Kaisha Ink container, valve unit, ink container manufacturing method, ink jet head cartridge and recording apparatus
6726306, Jul 10 2002 HEWLETT-PACKARD DEVELOPMENT COMPANY L P Print head shutter
6727948, Jul 15 1997 GOOGLE LLC Utilizing autofocus information for image processing in a digital camera
6727951, Jul 15 1997 Silverbrook Research Pty LTD Utilizing exposure information for image processing in a digital image camera
6731952, Jul 27 2000 SCA VENTURES, LLC Mobile telephone system having a detachable camera / battery module
6732924, Feb 29 2000 Kabushiki Kaisha Toshiba Automatic ticket checking apparatus
6736321, Mar 24 1998 Metrologic Instruments, Inc Planar laser illumination and imaging (PLIIM) system employing wavefront control methods for reducing the power of speckle-pattern noise digital images acquired by said system
6738096, Jul 10 1998 Google Inc Low-cost disposable camera including print media carrying indication of postage paid
6738903, Oct 01 1999 HEWLETT-PACKARD DEVELOPMENT COMPANY L P Password protected memory on replaceable components for printing devices
6741871, Dec 01 1999 Silverbrook Research Pty LTD Mobile phone with interactive printer
6742887, Jun 11 2001 Canon Kabushiki Kaisha Portable electronic device with printing mechanism
6744526, Feb 09 2001 OmniVision Technologies, Inc Image sensor having black pixels disposed in a spaced-apart relationship from the active pixels
6745331, Jul 10 1998 Memjet Technology Limited Authentication chip with protection from power supply attacks
6749301, Jan 09 2002 Silverbrook Research Pty LTD Ophthalmoscope with integral printer
6750901, Jul 10 1998 Google Inc Digital instant printing camera with image processing capability
6750944, Jul 15 1997 Google Inc Programmable camera system with software interpreter
6760164, Mar 01 2001 Olympus Corporation Optical system
6771811, Sep 16 1999 GOOGLE LLC Method and apparatus for up-interpolating a bayer image
6773874, Jul 15 1997 Google Inc Digital print media output with reduced residual curl
6788336, Jul 15 1997 Google Inc Digital camera with integral color printer and modular replaceable print roll
6791605, May 07 1999 Monument Peak Ventures, LLC Image capture and printing device
6795651, Nov 09 1998 Google Inc Camera with detachable printer
6803989, Jul 10 1998 Memjet Technology Limited Image printing apparatus including a microcontroller
6807315, Sep 16 1999 GOOGLE LLC Method and apparatus for sharpening an image
6812972, May 25 1999 Google Inc Camera module for compact printer system
6820968, Jul 15 1997 Memjet Technology Limited Fluid-dispensing chip
6823198, May 11 2000 FUJIFILM Corporation Portable phone with camera
6824257, Oct 16 1998 Memjet Technology Limited Ink supply system for a portable printer
6831681, Jul 15 1997 GOOGLE LLC Preprinted print rolls for use in an image processing device
6835135, Nov 09 1998 Silverbrook Research Pty LTD Video gaming console with integral printer device
6837635, Mar 08 1999 HEWLETT-PACKARD DEVELOPMENT COMPANY L P Inkjet apparatus and method for controlling undulation on media
6847686, Nov 25 1997 AVAGO TECHNOLOGIES INTERNATIONAL SALES PTE LIMITED Video encoding device
6847883, Oct 25 1999 Silverbrook Research Pty LTD Method and system for map and globe navigation
6854836, Oct 05 2001 Canon Kabushiki Kaisha Liquid container, liquid supply system, liquid using apparatus, ink tank, ink supply system, inkjet print head and print apparatus
6858837, Jan 05 1996 Canon Kabushiki Kaisha Illuminating unit having diffusion means
6859225, Oct 20 2000 GOOGLE LLC Method and apparatus for fault tolerant data storage on photographs
6867882, Jun 30 1999 Canon Kabushiki Kaisha Image inputting apparatus and its control method, information processing apparatus and method, and print system
6870566, Dec 07 1995 Canon Kabushiki Kaisha Image sensing system for sensing an image and converting the image into image signals with a controlled operating rate
6870966, May 25 1999 LIVESCRIBE INC Sensing device
6879341, Jul 15 1997 GOOGLE LLC Digital camera system containing a VLIW vector processor
6882364, Dec 02 1997 FUJIFILM Corporation Solid-state imaging apparatus and signal processing method for transforming image signals output from a honeycomb arrangement to high quality video signals
6883910, Sep 11 1998 Silverbrook Research Pty LTD Cartridge for a printing device
6888649, Aug 29 1995 Canon Kabushiki Kaisha Printer-built-in image-sensing apparatus and electric-consumption control method thereof
6894794, Jun 24 1999 Eastman Kodak Company Method and apparatus for making a print having an invisible coordinate system
6903766, May 25 1999 GOOGLE LLC Timer module for compact printer system
6906778, Nov 09 1998 Silverbrook Research Pty LTD Image recordal and generation apparatus
6909456, Jul 14 1999 FUJIFILM Corporation Electronic still camera with printer
6913875, Jul 15 1997 Google Inc Curl resistant print media
6914686, Nov 09 1998 Google Inc Handheld mobile communications device with a color image sensor and a color printer
6915140, Nov 09 1998 Zamtec Limited Hand held mobile phone with integral internal printer with print media supply
6918542, Mar 16 1997 Google Inc Data distribution mechanism in the form of ink dots on cards
6918654, Jul 15 1997 Memjet Technology Limited Ink distribution assembly for an ink jet printhead
6924835, Oct 20 2000 GOOGLE LLC Method and apparatus for fault tolerant data storage on photographs
6942334, Jan 17 2001 Silverbrook Research Pty LTD Personal digital assistant with internal printer
6948661, Mar 16 1997 Google Inc Data structure encoded on a surface of an object
6951390, Sep 11 1998 Google Inc Print media cartridge with integral print media and ink supplies
6953235, Jul 12 1997 Memjet Technology Limited Printing cartridge with a data-carrying integrated circuit device
6954254, Jul 12 1997 Zamtec Limited Printing cartridge with ink and print media supplies
6958207, Dec 07 2002 Method for producing large area antireflective microtextured surfaces
6965691, Sep 16 1999 Google Inc Camera with processor for up-interpolating a bayer image
6967741, May 25 1999 GOOGLE LLC Effects module for compact printer system
6967750, Nov 09 1998 Google Inc Hand held mobile communications device with an image sensor and a printer including a capping mechanism
6975429, May 25 1999 GOOGLE LLC Method and apparatus for image conversion
6977685, Feb 26 1999 MASSACHUSETTS INST OF TECHNOLOGY Single-chip imager system with programmable dynamic range
6981765, Nov 09 1998 Google Inc Print media cartridge with an integral print media transport mechanism and ink supply
6981769, Jan 17 2001 Silverbrook Research Pty LTD Personal digital assistant with internal printer having a media feed mechanism
6985207, Jul 15 1997 Google Inc Photographic prints having magnetically recordable media
6995790, Nov 08 1996 Olympus Corporation Image processing apparatus for joining a plurality of images
6999206, Nov 09 1998 Memjet Technology Limited Hand held mobile phone with integral internal printer
7006134, Aug 31 1998 Hitachi, LTD Pen type input device with camera
7018294, Nov 09 1998 Zamtec Limited Entertainment console with integrated printing
7041916, May 25 1999 LIVESCRIBE INC Orientation sensing device with processor
7044589, Jul 12 1997 Zamtec Limited Printing cartridge with barcode identification
7050143, Jul 10 1998 Google Inc Camera system with computer language interpreter
7058219, Sep 16 1999 Google Inc Camera and printer combination using up-interpolation of Bayer image
7063408, Nov 09 1998 Zamtec Limited Print media and ink supply cartridge
7063940, Jul 15 1997 Google Inc Curl resistant media
7068308, Jul 13 2001 LOGITECH EUROPE S A Removable media host executables
7070270, Nov 09 1998 Zamtec Limited Printer cartridge with media transport mechanism
7075684, Nov 09 1999 Zamtec Limited Handheld mobile communications device with a detachable printing mechanism and a receptacle having an interface that enables authentication of the printing mechanism
7077515, Jul 15 1997 Zamtec Limited Media cartridge for inkjet printhead
7077748, Nov 09 1998 Silverbrook Research Pty LTD Interactive information device with integral printer
7079292, Nov 09 1998 Memjet Technology Limited Modular mobile phone with integrated printer
7081947, Feb 27 2004 ASML NETHERLANDS B V Lithographic apparatus and device manufacturing method
7083108, Jul 10 1998 GOOGLE LLC Redundantly encoded data structure for encoding a surface
7084951, Jul 12 1997 Zamtec Limited Combined media- and ink-supply cartridge
7086724, Jul 15 1997 Zamtec Limited Compact media and ink cartridge for inkjet printhead
7092011, Jul 15 1997 GOOGLE LLC Camera for printing on media provided on print roll
7092130, Nov 09 1998 Memjet Technology Limited Handheld mobile communications device with a detachable printing mechanism
7095433, Nov 18 1999 FUJIFILM Corporation Optical printer and driving method therefor
7095533, Nov 09 1998 GOOGLE LLC Hand held mobile communications device with an image sensor and a printer
7097263, Jul 15 1997 GOOGLE LLC Printing cartridge for a camera and printer combination including an authentication device
7099033, Nov 09 1999 GOOGLE LLC Hand held mobile communications device with an image sensor, a printer and a print media slot
7099051, Nov 09 1998 GOOGLE LLC Hand held mobile communications device with an image sensor, a printer and an interface for interrogating an authentication mechanism of a cartridge inserted into the receptacle
7101034, Sep 11 1998 GOOGLE LLC Print media cartridge with integral print media transport mechanism
7108343, Nov 09 1998 Zamtec Limited Printing cartridge that incorporates an ink supply with closures for piercing by a printer
7110024, Jul 15 1997 GOOGLE LLC Digital camera system having motion deblurring means
7110139, Jul 15 1997 Memjet Technology Limited Printhead controller integrated circuit
7116355, Apr 15 1998 FUJIFILM Corporation Instant printer, printing method for using the same, combination printer/electronic still camera system
7118481, Nov 09 1998 Silverbrook Research Pty LTD Video gaming with integral printer device
7119836, Jul 15 1997 GOOGLE LLC Print roll for use in a camera imaging system
7125337, Nov 09 1998 Silverbrook Research Pty LTD Video gaming device with integral printer for printing gaming images at least partially based on at least some of the display images
7125338, Nov 09 1998 Silverbrook Research Pty LTD Video gaming device with integral printer and ink and print media cartridge
7130075, Nov 09 1998 Zamtec Limited Handheld mobile communications device with integral internal printer and drive means for business card printing
7136186, Nov 09 1998 Zamtec Limited Handheld mobile communications device with integral internal printer and an image capture device
7136198, Nov 09 1998 Memjet Technology Limited Handheld mobile communications device with integral internal printer
7139025, Oct 29 1998 U S BANK NATIONAL ASSOCIATION, AS COLLATERAL AGENT Active pixel sensor with mixed analog and digital signal integration
7140723, Jul 15 1997 Memjet Technology Limited Micro-electromechanical device for dispensing fluid
7140726, Jul 12 1997 Zamtec Limited Printing cartridge incorporating print media and an internal feed mechanism
7143944, Jun 30 2000 Silverbrook Research Pty LTD Two-dimensional code with locator and orientation components
7145689, Nov 09 1998 Memjet Technology Limited Handheld mobile communications device with integral internal printer incorporating media slot and drive means
7146179, Mar 26 2002 Monument Peak Ventures, LLC Portable imaging device employing geographic information to facilitate image access and viewing
7147294, Nov 09 1998 Silverbrook Research Pty LTD PCMCIA printer
7148993, Nov 09 1998 Zamtec Limited Handheld mobile communications device with a detachable printing mechanism and a dispenser interface
7152805, Jun 30 2000 Silverbrook Research Pty LTD Dot-based data package template
7154580, Nov 09 1998 Silverbrook Research Pty LTD Image recordal and generation apparatus
7154626, Nov 09 1998 Zamtec Limited Printer cellular phone
7155394, Oct 20 2000 GOOGLE LLC Audio playback device that reads data encoded as dots of infra-red ink
7156512, Jul 15 1997 Zamtec Limited Casing for an ink cartridge
7158258, Nov 09 1998 Zamtec Limited Handheld mobile communications device with a detachable printing mechanism and a slot for print media
7161709, Nov 09 1998 GOOGLE LLC Hand held mobile communications device with an image sensor, a printer and a receptacle for receiving an ink cartridge
7161715, Nov 09 1998 Zamtec Limited Handheld mobile communications device with a detachable printing mechanism and receptacle having an interface
7170652, Nov 09 1998 GOOGLE LLC Hand held mobile communications device with an image sensor, a printer and a business-card sized slot
7173729, May 25 1999 Silverbrook Research Pty LTD Effects module for a camera and printer assembly
7175097, Jun 30 2000 Silverbrook Research Pty LTD Two-dimensional data carrier incorporating dot-based data package templates
7177055, Nov 09 1998 Zamtec Limited Handheld mobile communications device with integral internal printer incorporating a receptacle for an ink cartridge
7185816, May 04 2000 Symbol Technologies, Inc Bar code and method of forming a bar code having color for encoding supplemental information
7186499, Jul 15 1997 GOOGLE LLC Print medium with anisotropic bending properties
7187404, Jul 15 1997 GOOGLE LLC Camera for printing manipulated images on media
7193734, Nov 09 1998 GOOGLE LLC Printer and image sensor in a mobile communication device
7201319, Jul 15 1997 GOOGLE LLC Device which processes images in accordance with coded data on card
7227576, Aug 25 2000 Nikon Corporation Electronic camera
7234645, Jul 15 1997 Silverbrook Research Pty LTD Document having an encoded data structure
7234801, Aug 06 2001 Memjet Technology Limited Printing cartridge with barcode identification
7243849, Apr 07 2003 Silverbrook Research Pty LTD Handheld coded data reader
7248376, May 25 1999 Memjet Technology Limited Printer module with a pen-like configuration
7249839, Sep 11 1998 Memjet Technology Limited Printing cartridge that incorporates a sheet transport mechanism
7250975, Jul 15 1997 GOOGLE LLC Modifying digital images utilizing auto focus information
7255646, Nov 09 1998 Silverbrook Research Pty LTD Video gaming console with printer apparatus
7259384, Apr 25 2005 The Boeing Company Fluid level optical detector with float having opaque and transmissive portions
7274455, Sep 07 2005 Samsung Electronics Co., Ltd. Optical detection apparatus for multi-channel multi-color measurement and multi-channel sample analyzer employing the same
7274485, May 25 1999 GOOGLE LLC Effects module for manipulation of an image
7278723, Jul 12 1997 Silverbrook Research Pty LTD Printing cartridge with a print roll incorporating an ink supply
7284843, Jul 10 1998 Memjet Technology Limited Ink distribution assembly for an ink jet printhead
7286182, May 25 1999 Google Inc Device for controlling the taking of multiple images
7286260, Nov 09 1998 Memjet Technology Limited Handheld mobile communications device with integral internal printer incorporating media slot
7287706, Jun 30 2000 Silverbrook Research Pty LTD Two-dimensional tag with locator and orientation components
7291447, Jul 15 1997 GOOGLE LLC Print medium with one side defined by a rib-like structure
7296304, Nov 15 2004 R & G Machine Tool Crash helmet with thermoelectric cooling
7301567, May 25 1999 GOOGLE LLC Method of image processing in a camera module
7310157, Jun 30 2000 Silverbrook Research Pty LTD Method of generating a two-dimensional code with a constant background pattern
7312845, Jul 12 1997 Google Inc Method of capturing and processing sensed images
7341336, Nov 09 1998 Silverbrook Research Pty LTD Print media cartridge with integral print media and collapsing ink supply chambers
7357497, Jul 15 1997 Silverbrook Research Pty LTD Print roll core with internal ink storage
7369161, Jun 08 1999 RPX Corporation Digital camera device providing improved methodology for rapidly taking successive pictures
7370947, Sep 11 1998 Zamtec Limited Print media and ink supply cartridge with built-in sheet transport mechanism
7377706, Jul 15 1997 GOOGLE LLC Print media roll and ink supply cartridge
7385639, Jul 15 1997 GOOGLE LLC Digital camera utilizing autofocus settings for image manipulation
7387573, Nov 09 1998 Silverbrook Research Pty LTD Video gaming apparatus with connected player and printer modules
7404633, Jul 15 1997 Memjet Technology Limited Inkjet cartridge with ink reservoir core and releasable housing
7430067, Nov 09 1998 Zamtec Limited Mobile phone device incorporating a printer assembly
7443434, Jul 09 2002 GOOGLE LLC Image sensing apparatus including a microcontroller
7452048, Jul 12 1997 Silverbrook Research Pty LTD Method of reading a two-dimensional code carrying image processing instructions
7453492, Jul 15 1997 Google Inc Portable hand held camera
7453586, Nov 09 1998 Google Inc Image sensor and printer in a mobile communications device
7458676, Sep 09 1998 GOOGLE LLC Print media cartridge with integral print media and ink storage
7460153, Nov 09 1998 Silverbrook Research Pty LTD Paper cartridge for camera having detachable printer unit
7460882, Nov 09 1998 Memjet Technology Limited Mobile phone with camera device and internal printhead
7466353, May 25 1999 Google Inc Method of processing an image in a camera module to produce L*a*b* form image
7466452, May 25 1999 Google Inc Hand held camera assembly with an effects module
7468810, Nov 09 1998 Zamtec Limited Mobile phone with printhead and ink supply module
7483053, Jul 10 1998 Silverbrook Research Pty LTD Combined camera and printer assembly with a card reader for image processing instructions
7492490, Jul 12 1997 GOOGLE LLC Image processing apparatus for applying effects to a stored image
7505068, Jul 12 1997 Silverbrook Research Pty LTD Image processing apparatus for applying effects to a stored image
7517071, Jul 12 1997 Memjet Technology Limited Print roll unit with ink storage core
7518634, May 25 1999 GOOGLE LLC Pivotal camera module for compact printer system
7524045, Mar 16 1998 GOOGLE LLC Print roll assembly
7525687, Jul 15 1997 GOOGLE LLC Garment creation system
7556564, Nov 09 1998 Silverbrook Research Pty LTD Hand-held video gaming device with integral printer
7557853, Jul 15 1997 GOOGLE LLC Processing of digital images using autofocus settings for image enhancement
7564580, Nov 09 1998 Zamtec Limited Mobile telephone with printer and print media dispenser
7575313, Aug 06 2001 Memjet Technology Limited Printing cartridge bearing indicia
7576775, May 25 1999 GOOGLE LLC Image processor having an application specific integrated circuit for camera module
7576794, Jul 15 1997 GOOGLE LLC Manipulation of digital camera images utilizing stored autofocus settings
7576795, Jul 15 1997 GOOGLE LLC Digital image camera using autofocus information for image enhancement
7581683, Jun 30 2000 Silverbrook Research Pty LTD Readable printed tag having locator, orientation and data components
7581826, Jul 12 1997 Zamtec Limited Ink reservoir
7585067, May 25 1999 Zamtec Limited Modular printer system with pen-shaped structure
7588323, Nov 09 1998 GOOGLE LLC Print media cartridge incorporating print media and ink housing assemblies
7590347, Jul 15 1997 Google Inc Photographic prints having magnetically recordable media
7591547, Nov 09 1998 Silverbrook Research Pty LTD Print media cartridge incorporating print media and a print media transport mechanism
7602423, Jul 15 1997 Google Inc Integrated circuit for a digital camera system
7604345, Jul 15 1997 GOOGLE LLC Digital camera with printing assembly
7605851, May 25 1999 GOOGLE LLC Method of operating a camera timing module
7609397, May 25 1999 Memjet Technology Limited Modular printer system with logically and physically interconnected modules
7609410, Dec 01 1999 Silverbrook Research Pty LTD Mobile telecommunication device with integral printer mechanism and sensing means
7612825, May 25 1999 GOOGLE LLC Cylindrical camera module with pivot assembly
7621607, Jul 15 1997 Zamtec Limited Print media cartridge for a camera
7629999, Jul 15 1997 Google Inc Printer CPU with VLIW processor
7631961, Nov 09 1998 Zamtec Limited Ink cartridge for a computer system having an integral printer
7633535, Jul 15 1997 GOOGLE LLC Apparatus for adding user-supplied text to a digital still image
7637594, Jun 08 1998 Zamtec Limited Ink jet nozzle arrangement with a segmented actuator nozzle chamber cover
7646403, Jul 15 1997 Google Inc De-blurring in a digital image system
7654626, Jul 15 1997 Google Inc Camera device incorporating a color printer with ink validation apparatus
7654905, Nov 09 1998 Silverbrook Research Pty LTD Video gaming device with pivotally mounted printer module
7664647, Oct 20 2000 Google Inc Camera for encoding audio signals
7665834, Jul 12 1997 Silverbrook Research Pty LTD Print roll with ink reservoir and print media roll sections
7688369, May 25 1999 Google Inc Image processing method in a camera module for converting non-linear RGB image data to L*a*b* image data
7690765, Jul 12 1997 Silverbrook Research Pty LTD Central processor for a camera with printing capabilities
7695108, Jul 15 1997 Memjet Technology Limited Fluid-ejecting integrated circuit utilizing electromagnetic displacement
7701506, Jul 15 1997 Google Inc Digital camera having functionally interconnected image processing elements
7703910, Mar 16 1997 Google Inc Print roll unit incorporating pinch rollers
7705891, Jul 15 1997 Google Inc Correction of distortions in digital images
7724282, Jul 15 1997 Google Inc Method of processing digital image to correct for flash effects
7742696, Jul 15 1997 Google Inc Digital camera having printhead and magnetic recorder
7750971, Jul 15 1997 Silverbrook Research Pty LTD Camera sensing device for capturing and manipulating images
7753508, Jul 15 1997 Memjet Technology Limited Ink supply cartridge for a printhead assembly
7758166, Jul 15 1997 Zamtec Limited Inkjet nozzle with paddle layer sandwiched between first and second wafers
7773124, May 25 1999 GOOGLE LLC Modular, multimedia pen having a camera module and a printer module
7773125, Feb 04 2004 GOOGLE LLC VLIW image processor
7784931, Nov 09 1998 Zamtec Limited Printing cartridge that incorporates casing for both print media and ink
7796166, Jul 15 1997 GOOGLE LLC Digital camera system incorporating VLIM image processor
7854500, Nov 09 1998 Silverbrook Research Pty LTD Tamper proof print cartridge for a video game console
7866794, May 25 1999 Silverbrook Research Pty LTD Pen-shaped modular camera assembly having a serial bus interface
7905574, Jul 15 1997 Zamtec Limited Method of fabricating resistor and proximate drive transistor for a printhead
7907178, Jul 15 1997 GOOGLE LLC Camera system for with velocity sensor and de-blurring processor
7936395, Jul 15 1997 Silverbrook Research Pty LTD Printer CPU with VLIW processor
7942332, Jul 15 1997 GOOGLE LLC Camera unit incoporating program script scanner
7957009, Jul 12 1997 GOOGLE LLC Image sensing and printing device
7961249, Jul 15 1997 GOOGLE LLC Digital camera having interconnected image processing units
7965416, Jul 15 1997 GOOGLE LLC Method for creating a garment
7970275, Jul 15 1997 GOOGLE LLC Digital camera system for simultaneous printing and magnetic recording
8020979, Aug 06 2001 Memjet Technology Limited Cartridge with optically readalble print media and ink information
8098285, Jul 15 1997 Memjet Technology Limited Processor for image capture and printing
8274665, Jul 15 1997 GOOGLE LLC Image sensing and printing device
8328101, Jul 15 1997 GOOGLE LLC Camera unit incoporating program script scanner
8421869, Jul 15 1997 GOOGLE LLC Camera system for with velocity sensor and de-blurring processor
20010000172,
20010001563,
20010007458,
20010013890,
20010015760,
20010015818,
20010019561,
20010020960,
20010022661,
20010023523,
20010030692,
20010033332,
20010035887,
20010040574,
20010040625,
20010040633,
20010055121,
20010055983,
20020001032,
20020003578,
20020011558,
20020015592,
20020024570,
20020024603,
20020025079,
20020033854,
20020047881,
20020047904,
20020050518,
20020054212,
20020063760,
20020071051,
20020071104,
20020080247,
20020101524,
20020135266,
20020140993,
20020141750,
20020158135,
20020164147,
20020176009,
20020180873,
20020180879,
20030001957,
20030043273,
20030076551,
20040001608,
20040006256,
20040018035,
20040032501,
20040032506,
20040066447,
20040070662,
20040090505,
20040119827,
20040125209,
20040141061,
20040196350,
20040201764,
20040207698,
20040252332,
20040257446,
20050030554,
20050030568,
20050062813,
20050088527,
20050104941,
20050146613,
20050179758,
20050179781,
20050270503,
20050280878,
20060007261,
20060056728,
20060072781,
20060098232,
20060126102,
20060133738,
20060197847,
20060239676,
20060250433,
20060250438,
20060250439,
20060250461,
20060250469,
20060250470,
20060250479,
20060250482,
20060250484,
20060250489,
20060252456,
20070003168,
20070013790,
20070021144,
20070024685,
20070040856,
20070046754,
20070070421,
20070070453,
20070081187,
20070099675,
20070109611,
20070121177,
20080002215,
20080036874,
20080062232,
20080068406,
20080098208,
20080152414,
20080204486,
20080252732,
20080300015,
20090015605,
20090027707,
20090029731,
20090029732,
20090052879,
20090073231,
20090075695,
20090085968,
20090141291,
20090207208,
20090244292,
20090264151,
20090278944,
20090291708,
20090295887,
20100002062,
20100085471,
20100100706,
20100157383,
20100194923,
20110211048,
20110211080,
20130010076,
20130010083,
20130010122,
20130010126,
20130010127,
20130010130,
20130010131,
20130010132,
20130010148,
20130010149,
20130010152,
20130016227,
20130016228,
20130016229,
20130016230,
20130016231,
20130016234,
20130016247,
20130016265,
20130016280,
20130021443,
20130021444,
20130021481,
20130063568,
20130222617,
AU199855415,
AU5541498,
AU9644491,
CA2079534,
D329862, Dec 20 1989 King Jim Co., Ltd. Combined instant camera and printer
D351144, Jan 31 1992 BANK OF AMERICA,N A Handheld finger print scanner for imaging and capturing a photographic image
DE10001768,
DE19832369,
DE248983,
DE4444295,
EP332787,
EP354581,
EP382044,
EP398295,
EP402016,
EP430692,
EP438841,
EP440261,
EP512709,
EP512799,
EP568357,
EP574581,
EP650125,
EP652108,
EP670555,
EP709825,
EP720915,
EP732859,
EP748697,
EP755162,
EP761450,
EP763430,
EP763930,
EP779736,
EP782053,
EP822078,
EP848540,
EP884197,
EP912035,
EP935384,
EP1039351,
EP1080917,
EP1129388,
EP1289309,
EP1389876,
EP3083015,
EP408241,
EP520289,
EP676291,
EP725364,
EP735420,
EP771101,
EP771102,
EP825758,
EP891148587,
EP907139,
EP913814,
EP924647,
EP949804,
EP965451,
EP974924,
EP978799,
GB1520594,
GB1595797,
GB2212481,
GB2228579,
GB2242753,
GB2263841,
GB2299787,
GB2327838,
GB2346110,
JP10000183,
JP10065780,
JP10107981,
JP10112855,
JP10126728,
JP10155053,
JP10164538,
JP10164602,
JP10229533,
JP10235957,
JP10264479,
JP10294918,
JP10301718,
JP11122565,
JP1114858,
JP11155053,
JP11164184,
JP11164248,
JP11167173,
JP11176173,
JP11187194,
JP11205517,
JP11227367,
JP11243516,
JP11249233,
JP11254700,
JP11275418,
JP11275501,
JP11298910,
JP11317897,
JP1148587,
JP1267254,
JP1277979,
JP1292483,
JP2000099616,
JP2000141788,
JP2000158712,
JP2000158720,
JP2000196931,
JP2000207512,
JP2000222520,
JP2000284370,
JP2001008153,
JP2001144459,
JP2001169222,
JP20020158135,
JP2096880,
JP2178163,
JP2188259,
JP2241760,
JP2302181,
JP230543,
JP3011483,
JP3127341,
JP314879,
JP3227875,
JP41051,
JP4105113,
JP4200184,
JP4200186,
JP4232084,
JP4282995,
JP4286444,
JP5016377,
JP5056160,
JP5064045,
JP5108278,
JP5137147,
JP5201081,
JP5208773,
JP5330150,
JP57107339,
JP57208547,
JP59128144,
JP59190857,
JP60096067,
JP60136480,
JP60204361,
JP6064160,
JP6086197,
JP6103358,
JP61129740,
JP6138588,
JP6149051,
JP6161047,
JP6183117,
JP6205147,
JP62081164,
JP62245857,
JP62272682,
JP6232778,
JP6238958,
JP63046193,
JP63145071,
JP637944,
JP7001874,
JP7009680,
JP7059107,
JP7108688,
JP7108786,
JP7129762,
JP7234911,
JP7254038,
JP7285250,
JP7298123,
JP7307956,
JP7315590,
JP8002754,
JP8113990,
JP8118653,
JP8129634,
JP8137882,
JP8185492,
JP8216384,
JP8224730,
JP8224865,
JP8249409,
JP8276600,
JP879417,
JP890879,
JP9005902,
JP9008592,
JP9015766,
JP9024631,
JP9036941,
JP9039318,
JP9058883,
JP9065182,
JP9065266,
JP9069064,
JP9071015,
JP9076532,
JP9076584,
JP9090513,
JP9113990,
JP9116843,
JP9123474,
JP9135316,
JP9149311,
JP9163196,
JP9187040,
JP9187960,
JP9261382,
JP9267487,
JP9300645,
JP9314918,
JP9327906,
KR1002270420000,
KR1019930005409,
KR1019960015313,
KR1019960704320,
RE33425, Nov 14 1984 Casio Computer Co., Ltd. Handy reader/printer apparatus
RE36338, Jul 08 1993 Ricoh Company, Ltd. Electronic still camera for recording and regenerating image data and sound data
RE36589, Dec 22 1993 Olympus Optical Co., Ltd. Audio data recording system for recording voice data as an optically readable code on a recording medium for recording still image data photographed by a camera
RE38896, Jan 19 1996 Apple Inc Apparatus and method for rotating the display orientation of a captured image
WO23279,
WO28379,
WO71348,
WO2093902,
WO235286,
WO3095224,
WO8303941,
WO8605641,
WO8707741,
WO9114336,
WO9114338,
WO9115078,
WO9210058,
WO9304425,
WO9316323,
WO9502247,
WO9516323,
WO9608114,
WO9632265,
WO9632274,
WO9632278,
WO9632281,
WO9632808,
WO9639301,
WO9704353,
WO9705738,
WO9706958,
WO9732265,
WO9750243,
WO9818253,
WO9830021,
WO9848567,
WO9904368,
WO9904388,
WO9904551,
WO9950787,
/
Executed onAssignorAssigneeConveyanceFrameReelDoc
Sep 15 2012Google Inc.(assignment on the face of the patent)
Date Maintenance Fee Events


Date Maintenance Schedule
Jul 14 20184 years fee payment window open
Jan 14 20196 months grace period start (w surcharge)
Jul 14 2019patent expiry (for year 4)
Jul 14 20212 years to revive unintentionally abandoned end. (for year 4)
Jul 14 20228 years fee payment window open
Jan 14 20236 months grace period start (w surcharge)
Jul 14 2023patent expiry (for year 8)
Jul 14 20252 years to revive unintentionally abandoned end. (for year 8)
Jul 14 202612 years fee payment window open
Jan 14 20276 months grace period start (w surcharge)
Jul 14 2027patent expiry (for year 12)
Jul 14 20292 years to revive unintentionally abandoned end. (for year 12)