Claims
- 1. A method for storing JPEG 2000 compressed image data, containing one or more tiles and one or more precincts, for subsequent transmission to a display, comprising the steps of:
storing first data having a minimum level of image information using a resolution level-layer-component-position progression ordering; and storing second data having image details using a component-position-resolution level-layer progression ordering.
- 2. The method according to claim 1, wherein the first data has all precincts from one or more low resolution levels.
- 3. The method according to claim 1, wherein the second data has precincts that are not included in the first data.
- 4. The method according to claim 1, wherein the second data is organized so that all data packets for each tile are contiguous and all data packets for each precinct within a tile are contiguous.
- 5. The method according to claim 1, further comprising the step of:
producing a lookup table that associates a spatial location with a byte-count offset for the start of the data packets for each tile.
- 6. The method according to claim 1, further comprising the step of:
producing a lookup table that associates a spatial location with a byte-count offset for the start of the data packets for each precinct in each tile.
- 7. A method for storing JPEG 2000 compressed image data, containing one or more tiles and one or more precincts, for subsequent transmission to a display that is viewed by an observer having a point of gaze, comprising the steps of:
a) storing first data that represents a minimum level of image information using a resolution level-layer-component-position progression ordering; and b) storing second data that represents image details using a component-position-resolution level-layer progression ordering.
- 8. The method according to claim 7, wherein the first data represent all precincts from one or more low resolution levels.
- 9. The method according to claim 8, wherein the second data represent remaining precincts that are not included in the first data.
- 10. The method according to claim 9, wherein the second data is organized so that all data packets for each tile are contiguous and all data packets for each precinct within a tile are contiguous.
- 11. The method according to claim 7, further comprising the step of:
c) producing a lookup table that associates a spatial location with a byte-count offset for the start of the data packets for each tile.
- 12. The method according to claim 7, further comprising the step of:
c) producing a lookup table that associates a spatial location with a byte-count offset for the start of the data packets for each precinct in each tile.
CROSS REFERENCE TO RELATED APPLICATION
[0001] This is a divisional of application Ser. No. 09/971,346, filed 04 Oct. 2001.
Divisions (1)
|
Number |
Date |
Country |
Parent |
09971346 |
Oct 2001 |
US |
Child |
10838682 |
May 2004 |
US |