Compressed storage of data items

• US 20010049778A1
• Filed: 03/12/2001
• Published: 12/06/2001
• Est. Priority Date: 03/13/2000
• Status: Active Grant

• Current Assignee: Koninklijke Philips N.V.
• Original Assignee: Koninklijke Philips N.V.
• Inventors: Van Der Vleuten, Renatus Josephus, Kleihorst, Richard Petrus
• Granted Patent: US 6,731,808 B2
• Time in Patent Office: Days
• US Class Current: 711/170
• CPC Class Codes: H04N 19/423 characterised by memory arrangements H04N19/433 takes precedence
• CPC Class Codes: H04N 19/61 in combination with predictive coding
• CPC Class Codes: H04N 5/772 the recording apparatus and the television camera being placed in the same enclosure
• CPC Class Codes: H04N 5/781 on disks or drums
• CPC Class Codes: H04N 5/907 using static stores, e.g. storage tubes or semiconductor memories H04N5/91 takes precedence
• CPC Class Codes: H04N 5/9261 involving data reduction

Abstract

Storing of data items in a memory (31) is provided wherein the data items are divided into successive data pieces of decreasing significance, and the data pieces are stored in respective parts of the memory (31), and when applying a data piece to the memory (31) in case all candidate memory parts are assigned to other data pieces: if the significance of the applied data piece is lower than a lowest significance of the other data pieces, discarding the applied data piece; if the significance of the applied data piece is higher than the lowest significance, storing the applied data piece in one of the candidate memory parts at expense of a given other data piece which has a lower significance than the significance of the applied data piece. Advantageous use of the invention is made in applications using a device of fixed storage capacity for storing compressible data, such as video, images, audio, speech.

Claims

1. A method of storing data items in a memory (3), the method comprising the steps of:

dividing each data item into successive data pieces of decreasing significance;

storing the data pieces in respective parts of the memory (31); and

when applying a data piece to the memory (31) in case all candidate memory parts are assigned to other data pieces;

if the significance of the applied data piece is lower than a lowest significance of the other data pieces, discarding the applied data piece;

or

if the significance of the applied data piece is higher than the lowest significance of the other data pieces, storing the applied data piece in one of the candidate memory parts at expense of a given other data piece which has a lower significance than the significance of the applied data piece.

2. A method as claimed in

claim 1

, wherein for each data piece a record (30) is kept, comprising the significance (S) of the data piece and the data item (I) to which the data piece belongs.

3. A method as claimed in

claim 2

, wherein the data items are stored in a main memory (31) and the record is kept in an auxiliary memory (30), each record further comprising a pointer (P) which indicates a position in the main memory (31) in which a given data piece is stored.

4. A method as claimed in

claim 1

, wherein the significance of a data piece is calculated on base of a distortion difference.

5. A method as claimed in

claim 1

, wherein the data items have been scalably coded (2).

6. A method of reading data items from a memory (3), which data items have been divided into successive data pieces of decreasing significance, which data pieces have been stored in respective memory parts (31 ), wherein an indication of the significance of each data piece is available in the memory, the method comprising the steps of:

reading for each data item the successive data pieces from the memory (31 ), which data pieces belong to said data item; and

constructing (4) the data item from the successive data pieces.

7. An arrangement for storing data items in a memory (3), the arrangement comprising:

means for dividing each data item into successive data pieces of decreasing significance;

means for storing the data pieces in respective parts of the memory (31); and

means for applying a data piece to the memory (31), which means are arranged for, in case all candidate memory parts are assigned to other data pieces,

discarding the applied data piece if the significance of the applied data piece is lower than a lowest significance of the other data pieces;

or

storing the applied data piece in one of the candidate memory parts at expense of a given other data piece that has a lower significance than the significance of the applied data piece if the significance of the applied data piece is higher than the lowest significance of the other data pieces.

8. An arrangement for reading data items from a memory, which data items have been divided into successive data pieces of decreasing significance, which data pieces have been stored in respective memory parts (31), wherein an indication of the significance of each data piece is available in the memory, the arrangement comprising:

means for reading for each data item the successive data pieces from the memory (31), which data pieces belong to said data item; and

means for constructing (4) the data item from the successive data pieces.

9. A storage medium (3) having stored thereon data items, which data items have been divided into successive data pieces of decreasing significance, which data pieces have been stored in respective memory parts (31), wherein an indication of the significance of each data piece is available on the storage medium.