 Image forming system including interconnected and priority allocated image forming devices |
| The object of the present invention is to provide an image forming system characterized in (1) ... |
|
| Advanced programmable interrupt controller |
| According to the present invention, a computer system includes an advanced programmable interrupt ... |
|
| Low speed serial bus protocol and circuitry |
| OF THE PREFERRED EMBODIMENT Referring now to FIG. 1, the computer system C according to the ... |
|
| Serial bus system for sending multiple frames of unique data |
| Accordingly, the present invention discloses a computer system including a processor, a memory ... |
|
| Data routing using status-response signals |
| The present invention provides an apparatus and method for routing data between multiple bus ... |
|
| Data and data strobe circuits and operating protocol for double data rate memories |
| What is claimed is: 1. A computer populated with a plurality of double data rate DRAMS including a ... |
|
| Non-volatile, electrically erasable and reprogrammable memory element |
| We claim: 1. A non-volatile, electrically erasable and reprogrammable memory element comprising a ... |
|
| High speed processing flip-flop |
| A high speed processing flip-flop contains a header circuit and a pulse flip-flop circuit. The ... |
|
|
Compressed image virtual editing system
| Details |
Inventors: Miller, Robert F.; Blonstein, Steven M.;
Assignee: Ricoh Company, Ltd. (Tokyo, JP); Ricoh Corporation (Menlo Park, CA)
Primary Examiner: Coles, Sr.; Edward L.
Assistant Examiner: Ning; John
Attorney, Agent or Firm: Townsend and Townsend Khourie and Crew
In an image compression system using a typical image compression scheme, a pointer array is provided to point to each of the many MCUs in a compressed image file. From all the blocks of an image, a subset of the blocks is selected as a virtual image. The virtual image is edited, and each edited block is compressed into an edited block. The edited block is compressed into an edited MCU and placed in an edited block region, and the pointer to the original MCU is changed to point to the new MCU. In this way, the pointer array can be modified to perform an Undo operation. An edge table is provided to hold values where each value, when combined with the differential value for a block on the edge of the virtual image, provides an absolute value for the block without reference to blocks beyond the edge of the virtual image. The entries in the edge table are determined from the compressed MCUs without the blocks being fully decompressed. More than one edge table can be provided. In an image editor, a virtual image is decompressed from a compressed image, the virtual image is processed, and recompressed. The recompressed, edited blocks are then placed in a edited block memory. |
|
DETAILED DESCRIPTION The present invention allows for pixel level manipulation of images that remain in a compressed form.
In an image compression system using a typical image compression scheme, a pointer array is provided to point to each of the many MCUs in a compressed image file.
From all the blocks of an image, a subset of the blocks is selected as a "virtual" image.
The virtual image is decompressed/decoded and edited, each edited block is compressed into an edited block, and the pointers to the original MCUs are changed to point to edited MCUs, which are stored in the edited image data region.
In this way, the pointer array can be modified to perform an "Undo" operation.
The present invention provides a means for handling differentially encoded values within MCUs where not all MCUs are decoded.
An edge table is provided to hold values, where each value, when combined with the differential value for a block on the edge of the virtual image, provides an absolute value for the block without reference to blocks beyond the edge of the virtual image.
The entries in the edge table are determined from the compressed MCUs without the blocks being fully decompressed.
More than one edge table can be provided to improve the speed of computing absolute values from differential values, where speed is more valuable than the storage space used up for the additional tables.
Computation of absolute values is faster, on the average, with more edge tables, since computational speed is proportional to the distance from a block to the nearest edge having an edge table.
The present invention also provides a means for reindexing a compressed edited image, to resort all the MCUs and replace MCUs from the original image data region with MCUs from the edited image data region.
The described embodiment of the present invention works with image data compressed according to the JPEG standard, but the invention is applicable for any image compression scheme where blocks are compressed into variable sized MCUs or where the data is encoded with differential values whereby reference must be made to other MCUs in order to fully decode an MCU
|
|
I/O Systems 
