白丝美女被狂躁免费视频网站,500av导航大全精品,yw.193.cnc爆乳尤物未满,97se亚洲综合色区,аⅴ天堂中文在线网官网

Methods, systems, and computer readable media for decoding video using rate sorted entropy coding

專利號
US11212531B2
公開日期
2021-12-28
申請人
The University of North Carolina at Chapel Hill(US NC Chapel Hill)
發(fā)明人
Ketan Dasharath Mayer-Patel; Aaron Joseph Smith
IPC分類
H04B1/66; H04N7/12; H04N11/02; H04N11/04; H04N19/13; H04N19/146
技術領域
bitstream,symbol,coding,entropy,video,rsac,decoder,hevc,scalable,in
地域: NC NC Chapel Hill

摘要

According to one method, a method for decoding data using rate sorted entropy coding occurs at a video decoder implemented using at least one processor. The method comprises: receiving rate control information associated with a first bitstream; determining, using the rate control information, a maximum amount of bits available for a next symbol in the first bitstream; determining, using a symbol probability model and a first deterministic algorithm, an amount of bits for a least probable value of the next symbol; and determining that the next symbol is included in the first bitstream if the amount of bits for the least probable value of the next symbol is less than or equal to the maximum amount of bits available for the first bitstream.

說明書

In some embodiments, a video decoder (e.g., implemented using or by RSAC module 1006) may perform data decoding using rate sorted entropy coding or a related aspect thereof. For example, RSAC module 1006 may receive rate control information associated with a first bitstream; may determine, using the rate control information, a maximum amount of bits available for a next symbol in the first bitstream; may determine, using a symbol probability model shared by the video decoder and a corresponding video encoder and a deterministic algorithm, an amount of bits for a least probable value of the next symbol; and may determine that the next symbol is included in the first bitstream if the amount of bits for the least probable value of the next symbol is less than or equal to the maximum amount of bits available for the first bitstream and may determine that the next symbol is not included in the first bitstream if the amount of bits for the least probable value of the next symbol is greater than the maximum amount of bits available for the first bitstream.

It will be appreciated that FIG. 10 is for illustrative purposes and that various nodes, their locations, and/or their functions may be changed, altered, added, or removed. For example, some nodes and/or functions may be combined into a single entity or some functionality (e.g., in RSAC module 1006) may be separated into separate nodes or modules.

權利要求

1
微信群二維碼
意見反饋