System and method for encoding a data set
DCFirst Claim
Patent Images
1. A system for compressing a video data set, comprising:
- a constructing device for constructing coding strategies into a tree-based representation which comprises a plurality of tree nodes, said tree-based representation starts from a root node;
a cost projecting device for generating a projected cost for each tree node at a target bit rate;
the system for compressing the video data set is characterized by further comprising;
a classifying device for classifying each tree node into an AND node, an OR node, or a LEAF node, wherein the AND node and the OR node have child nodes, and the LEAF node is free of child nodes;
a searching device for finding a parameter set to compress the video data set wherein the parameter set is a selected path from the root node to the LEAF nodes with minimum projected costs.
1 Assignment
Litigations
0 Petitions
Accused Products
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.
-
Citations
7 Claims
-
1. A system for compressing a video data set, comprising:
a constructing device for constructing coding strategies into a tree-based representation which comprises a plurality of tree nodes, said tree-based representation starts from a root node; a cost projecting device for generating a projected cost for each tree node at a target bit rate; the system for compressing the video data set is characterized by further comprising; a classifying device for classifying each tree node into an AND node, an OR node, or a LEAF node, wherein the AND node and the OR node have child nodes, and the LEAF node is free of child nodes; a searching device for finding a parameter set to compress the video data set wherein the parameter set is a selected path from the root node to the LEAF nodes with minimum projected costs. - View Dependent Claims (2, 3, 4, 5)
-
6. A program product stored on a computer readable medium that, said program product is executed to compresses a video data set, said program product comprising:
a first means for constructing coding strategies into a tree-based representation which comprises a plurality of tree nodes, said tree-based representation starts from a root node; a second means for generating a projected cost for each tree node at a target bit rate; the program product is characterized by further comprising; a third means for classifying each tree node into a AND node, a OR node, or a LEAF node, wherein the AND node and the OR node have child nodes, and the LEAF node is free of child nodes; and a fourth means for finding a parameter set to compress the video data set wherein the parameter set is a selected path from the root node to the LEAF nodes with minimum projected costs.
-
7. A method of compressing a video data set, comprising the steps of:
-
constructing coding strategies into a tree-based representation which comprises a plurality of tree nodes, and said tree-based representation starts from a root node; generating a projected cost for each tree node at a target bit rate; classifying each tree node into a AND node, a OR node, or a LEAF node, wherein the AND node and the OR node have child nodes, and the LEAF node is free of child nodes; and searching a parameter set to compress the video data set wherein the parameter set is a selected path from the root node to the LEAF nodes with minimum projected costs.
-
Specification