Efficient rate allocation for multi-resolution coding of data
AssigneeThe Hong Kong University of Science and Technology
InventorsYick Ming Yeung, Oscar Chi-Lim Au
Life of this patent
Estimating the term…
Loading patent…
AssigneeThe Hong Kong University of Science and Technology
InventorsYick Ming Yeung, Oscar Chi-Lim Au
Estimating the term…
There are disclosed three fast rate control methods that can efficiently reduce or remove the computation and memory usage redundancy over conventional PCRD methods. The first method, called successive bit-plane rate allocation (SBRA), assigns the maximum allowable bit-rate for each bit-plane of each code-block by using the currently available rate-distortion information only. The second method is called priority scanning rate allocation (PSRA). This first predicts the order of magnitude of each truncation point's rate-distortion slope and then encodes the truncation points based on the order (priority) information. The third method uses PSRA to obtain a significantly smaller amount of data than PCRD for optimal truncation and is called priority scanning with optimal truncation (PSOT). SBRA provides the highest computational complexity and memory usage reduction, and the lowest coding/transmission delay. The computational complexity reduction can be up to about 90% of the entropy coding process. However this method gives the lowest PSNR performance of the three. PSRA provides higher PSNR performance than SBRA with the penalty of lower memory usage reduction and higher delay. PSOT provides the best (optimal) quality while it is the least efficient method in term of computational complexity, memory usage and the coding/transmission delay. The three methods provide different degree of computation complexity and memory reduction, coding/transmission delay and PSNR performance. The most suitable rate control method can be chosen based on application requirements.
1-14. (canceled)
A method, comprising
A method, comprising:
(canceled)
28-42. (canceled)
The article of manufacture of claim 82, wherein the operations further comprises removing one or more last coding units encoded before the total amount of bits used exceeded the target bit rate from the output code-stream.
The article of manufacture of claim 82 wherein the operations further comprises terminating the examining, the encoding, the reducing, and the decreasing in response to determining that all the details of all the collections of coefficients have been encoded.
The article of manufacture of claim 82 wherein the collections of coefficients are code-blocks of coefficients in a data transform domain.
The article of manufacture of claim 82, wherein the operations further comprises:
(canceled)
The article of manufacture of claim 83 wherein:
(canceled)
The article of manufacture of claim 82 in which the respective priority levels of the collections of coefficients are respectively equal to a total number of coding units used to fully specify the respective collections of coefficients.
The article of manufacture of claim 82 in which the collections of coefficients are code-blocks of coefficients in a discrete wavelet transform domain of an image or image tile, and the coding unit is a significance pass, refinement pass or cleanup pass of JPEG2000.
The article of manufacture of claim 82 in which the respective priority levels of the collections of coefficients are respectively linear functions of a total number of bit planes used to describe wavelet coefficients.
55-69. (canceled)
The apparatus of claim 84 further comprising means for removing one or more last coding units encoded before the total amount of bits used exceeded the target bit rate from the output code-stream.
The apparatus of claim 84 further comprising means for terminating the examining, the encoding, the reducing, and the decreasing in response to determining that all the details of all the collections of coefficients have been encoded.
The apparatus of claim 84 wherein said collections of coefficients are code-blocks of coefficients in a data transform domain.
The apparatus of claim 84, further comprising
(canceled)
The apparatus of claim 85 wherein:
(canceled)
The apparatus of claim 84 in which the respective priority levels of the collections of coefficients are respectively equal to a total number of coding units used to specify the respective collections of coefficients.
The apparatus of claim 84 in which the collections of coefficients are code-blocks of coefficients in a discrete wavelet transform domain of an image or image tile, and the coding unit is a significance pass, refinement pass or cleanup pass of JPEG2000.
The apparatus of claim 84 in which the respective priority levels of the collections of coefficients are respectively linear functions of a total number of bit planes used to describe wavelet coefficients.
An article of manufacture including a computer-readable medium having instructions stored thereon that, upon execution by a computing device, cause the computing device to perform operations comprising:
An article of manufacture including a computer-readable medium having instructions stored thereon that, upon execution by a computing device, cause the computing device to perform operations comprising:
An apparatus, comprising:
An apparatus, comprising:
Dependencies are inferred from the claim text.