US5327248A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Compressed image virtual editing system
Assignee: Ricoh Co Ltd
•
Filing: 1992-03-23
•
Granted: 1994-07-05
•
Expires: 2012-03-23
Abstract
Abstract 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.
Inventors
- 👤 Robert F. Miller
- 👤 Steven M. Blonstein
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 02:03
CPC Classifications
G; G06; G06T; G06T9/00; G06T9/005
Claims Analysis
Total Claims: 17
Claim 1
Independent Claim
198 words
A method for handling a portion of a compressed image for editing, wherein the image is divided into blocks, each block being represented by digital data, and wherein the digital data for each block is compressed into a minimum coded unit, a plurality of said minimum coded units forming a compressed image data packet, the method comprising the steps of: creating a pointer array, wherein each pointer in said pointer array points to a minimum coded unit within the compressed image data packet; selecting blocks from the image to define a virtual image; decompressing a set of minimum coded units corresponding to said virtual image; editing said virtual image to form at least one edited block; compressing said edited block into a edited minimum coded unit; saving said edited minimum coded unit in an edited block memory; and modifying a pointer in said pointer array, said pointer corresponding to said edited block, said pointer being modified to point to said edited minimum coded unit in said edited block memory, whereby said blocks, whose corresponding minimum coded units are pointed to by the pointers of said pointer array as modified in said modifying step, collectively define an edited image.
Claim 2
Independent Claim
198 words
A method for handling a portion of a compressed image for editing, wherein the image is divided into blocks, each block being represented by digital data, and wherein the digital data for each block is compressed into a minimum coded unit, a plurality of said minimum coded units forming a compressed image data packet, the method comprising the steps of: creating a pointer array, wherein each pointer in said pointer array points to a minimum coded unit within the compressed image data packet; selecting blocks from the image to define a virtual image; decompressing a set of minimum coded units corresponding to said virtual image; editing said virtual image to form at least one edited block; compressing said edited block into a edited minimum coded unit; saving said edited minimum coded unit in an edited block memory; and modifying a pointer in said pointer array, said pointer corresponding to said edited block, said pointer being modified to point to said edited minimum coded unit in said edited block memory, whereby said blocks, whose corresponding minimum coded units are pointed to by the pointers of said pointer array as modified in said modifying step, collectively define an edited image.
Claim 3
Dependent Claim
20 words
The method of claim 1, wherein the step of selecting blocks selects less than all the blocks of the image.
Claim 4
Dependent Claim
56 words
The method of claim 1, wherein said editing step comprises the steps of: displaying said virtual image on a display; accepting input commands, where said input commands are instructions for modifying said virtual image; applying said instructions to said virtual image resulting in a modified virtual image; and displaying said modified virtual image on said display.
Claim 5
Dependent Claim
26 words
The method of claim 1, where said steps of editing, compressing said at least one edited block, and modifying said pointer, are repeated more than once.
Claim 6
Dependent Claim
12 words
The method of claim 1, wherein a block is a single pixel.
Claim 7
Dependent Claim
17 words
The method of claim 1, wherein said each pointer comprises an edit flag and an address value.
Claim 8
Dependent Claim
72 words
The method of claim 1, wherein a minimum coded unit comprises a minimum coded unit header and a minimum coded unit body, wherein said minimum coded unit header comprises an image block identifier and a length field indicating the number of bits in said minimum coded unit, and wherein said minimum coded unit body comprises at least one relative value and a plurality of absolute values for qualities of an image block.
Claim 9
Dependent Claim
78 words
The method of claim 1, wherein the minimum coded units contain differentially encoded values for a quality of a block, the method further comprising the steps of: determining an absolute value for said quality for a plurality of blocks adjacent to an edge of said virtual image; creating an edge table for holding said absolute values; and using said edge table to determine absolute values for said quality for new blocks decompressed and added to said virtual image.
Claim 10
Dependent Claim
15 words
The method of claim 8, wherein said new blocks are added in a scrolling operation.
Claim 11
Independent Claim
119 words
A method for handling a portion of a compressed image for editing, wherein the image is divided into blocks, each block being represented by digital data, including at least one relative value, wherein an absolute value is determined for a block by reference to relative values for other blocks, the method comprising the steps of: selecting blocks from the image to define a virtual image corresponding to the portion of the compressed image; determining an absolute value for each of a plurality of blocks adjacent to an edge of said virtual image; creating an edge table for holding said absolute values; and using said edge table to determine absolute values for blocks decompressed and added to said virtual image.
Claim 12
Independent Claim
119 words
A method for handling a portion of a compressed image for editing, wherein the image is divided into blocks, each block being represented by digital data, including at least one relative value, wherein an absolute value is determined for a block by reference to relative values for other blocks, the method comprising the steps of: selecting blocks from the image to define a virtual image corresponding to the portion of the compressed image; determining an absolute value for each of a plurality of blocks adjacent to an edge of said virtual image; creating an edge table for holding said absolute values; and using said edge table to determine absolute values for blocks decompressed and added to said virtual image.
Claim 13
Independent Claim
173 words
An apparatus for handling a portion of a compressed image for editing, wherein the image is divided into blocks, each block comprising pixel data representing the digitized image at points corresponding to each pixel in each block, and wherein the image is stored as minimum coded units in a compressed image data packet, the compressed image data packet, wherein each minimum coded unit corresponds to one block, the apparatus comprising: a pointer array, where each pointer of said pointer array points to a minimum coded unit, said pointer array collectively pointing to the compressed image data packet; a compressed data memory for holding the compressed image data packet; a virtual image memory for holding blocks corresponding to a virtual image; an edited data memory for holding edited minimum coded units corresponding to edited blocks of said virtual image; and means for modifying a pointer in said pointer array corresponding to an edited block, said means for modifying modifying said pointer to point to an edited minimum coded unit corresponding to said edited block.
Claim 14
Independent Claim
173 words
An apparatus for handling a portion of a compressed image for editing, wherein the image is divided into blocks, each block comprising pixel data representing the digitized image at points corresponding to each pixel in each block, and wherein the image is stored as minimum coded units in a compressed image data packet, the compressed image data packet, wherein each minimum coded unit corresponds to one block, the apparatus comprising: a pointer array, where each pointer of said pointer array points to a minimum coded unit, said pointer array collectively pointing to the compressed image data packet; a compressed data memory for holding the compressed image data packet; a virtual image memory for holding blocks corresponding to a virtual image; an edited data memory for holding edited minimum coded units corresponding to edited blocks of said virtual image; and means for modifying a pointer in said pointer array corresponding to an edited block, said means for modifying modifying said pointer to point to an edited minimum coded unit corresponding to said edited block.
Claim 15
Dependent Claim
16 words
The apparatus of claim 11, wherein said compressed data is compressed according to the JPEG standard.
Claim 16
Dependent Claim
13 words
The apparatus of claim 11, wherein the pixel data represents a grayscale intensity.
Claim 17
Dependent Claim
24 words
The apparatus of claim 11, wherein the pixel data comprises more than one digital value, each digital value representing the intensity of one color.
References Cited (Backward Citations)
US4558374A
Cited
US4633503A
Cited
US4814898A
Cited
US4665555A
Cited
US4750044A
Cited
US5033106A
Cited
US4851906A
Cited
US4896208A
Cited
US4800425A
Cited
US4797739A
Cited
US4827330A
Cited
US4868570A
Cited
US4837635A
Cited
US4906991A
Cited
US4910611A
Cited
US5107345A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-07-04 | 1998-01-03 | 1998-07-05 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-07-04 | 2002-01-03 | 2002-07-05 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-07-04 | 2006-01-03 | 2006-07-05 | $7700.00 | Window Closed / Lapsed |