System and method for encoding a data set

• US 20090040080A1
• Filed: 11/09/2007
• Published: 02/12/2009
• Est. Priority Date: 08/10/2007
• Status: Active Grant

• Current Assignee: National Cheng KUNG University (Government of The Republic of China)
• Original Assignee: National Cheng KUNG University (Government of The Republic of China)
• Inventors: Lee, Tsung-Han, Hwang, Wen-Liang
• Granted Patent: US 7,561,078 B2
• Time in Patent Office: Days
• US Class Current: 341/51
• CPC Class Codes: H04N 19/103 Selection of coding mode or of prediction mode
• CPC Class Codes: H04N 19/122 Selection of transform size, e.g. 8x8 or 2x4x8 DCT; Selection of sub-band transforms of varying structure or type
• CPC Class Codes: H04N 19/147 according to rate distortion criteria rate-distortion as a criterion for motion estimation H04N19/567
• CPC Class Codes: H04N 19/172 the region being a picture, frame or field
• CPC Class Codes: H04N 19/176 the region being a block, e.g. a macroblock
• CPC Class Codes: H04N 19/635 characterised by filter definition or implementation details

Abstract

An encoding system for a data set, particularly for a video data set is disclosed in the present invention. The encoding system includes a coding strategies represented as a tree-based structure, a cost projection system for each tree node, and a parameter searching algorithm for coding strategies to encode a data set. When the encoder parameters are obtained, the coding strategies and rate-allocation have better performance comparing to the related art.

Claims

1. A system for encoding a data set, comprising:

a system that constructs coding strategies into tree-based representation for an encoder which comprises a plurality of coding sub-systems, wherein each coding sub-system is one of tree node in the tree-based representation;

an analysis system that project a cost for each tree node using coding strategies; and

a system that search a parameter set for encoding the data set based on the projected cost of the tree-based represented coding strategies.

2. The system of claim 1, further comprising:

a system that classifies the coding sub-system into AND, OR, or LEAF nodes,

wherein each node represents a coding sub-system.

3. The system of claim 2, wherein the searched parameter set is the path from root note to LEAF nodes with minimum projected cost.

4. The system of claim 1, wherein the cost for each node is projected at a target bit rate.

5. The system of claim 2, wherein an OR node have child nodes and only one of the coding sub-system will be chosen for this OR node to included in the coding strategies.

6. The system of claim 2, wherein an AND node is decomposed into several coding sub-systems and all sub-systems thereof must be included into the coding strategies if the AND node is selected.

7. The system of claim 2, wherein the node without any child node is a LEAF node.

8. The system of claim 5, wherein an OR node selects one child node with minimum cost at a target bit rate as the OR node cost.

9. The system of claim 6, wherein an AND node combines all its child node cost at a target bit rate as the AND node cost.

10. The system of claim 1, further comprising:

a system that allocates rate of the encoded a data set,

wherein the rate allocation based on the searched parameters using the coding strategies.

11. The system of claim 2, wherein nodes that are not LEAF nodes are either an AND node or an OR node.

12. The system of claim 1, wherein the data set comprises video data.

13. A program product stored on a computer readable medium that, when executed, encodes a data set, the program product comprising:

program code configured to construct coding strategies into tree-based representation for an encoder which comprises a plurality of coding sub-systems, wherein each coding sub-system is one of tree node in the tree-based representation;

program code configured to project a cost for each tree node using coding strategies; and

program code configured to search a parameter set for encoding the data set based on the projected cost of the tree-based represented coding strategies.

14. The program product of claim 13, further comprising:

program code configured to classify the coding sub-system into AND, OR, or LEAF nodes,

wherein each node represents a coding sub-system.

15. The program product of claim 14, wherein the searched parameter set is the path from root note to LEAF nodes with minimum projected cost.

16. The program product of claim 13, wherein the cost for each node is projected at a target bit rate.

17. A method of encoding a data set, comprising the steps of:

constructing coding strategies into tree-based representation for an encoder which comprises a plurality of coding sub-systems, wherein each coding sub-system is one of tree node in the tree-based representation;

projecting a cost for each tree node using coding strategies; and

searching a parameter set for encoding the data set based on the projected cost of the tree-based represented coding strategies.

18. The method of claim 17, further comprising the steps of:

classifying the coding sub-system into AND, OR, or LEAF nodes,

wherein each node represents a coding sub-system.

19. The method of claim 18, wherein the searched parameter set is the path from root note to LEAF nodes with minimum projected cost.

20. The method of claim 17, wherein the cost for each node is projected at a target bit rate.