CN100423582C - Method and device for binary coding wait coding data - Google Patents
Method and device for binary coding wait coding data Download PDFInfo
- Publication number
- CN100423582C CN100423582C CNB2005100613938A CN200510061393A CN100423582C CN 100423582 C CN100423582 C CN 100423582C CN B2005100613938 A CNB2005100613938 A CN B2005100613938A CN 200510061393 A CN200510061393 A CN 200510061393A CN 100423582 C CN100423582 C CN 100423582C
- Authority
- CN
- China
- Prior art keywords
- subdomain
- data
- encoded
- bit string
- flag bit
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Compression Or Coding Systems Of Tv Signals (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The present invention discloses a method and a device for binary coding to data to be coded, which carries out the binary coding to the data to be coded. Firstly, ranges of the data to be coded are divided into a plurality of subsidiary ranges, each subsidiary range is provided with a subsidiary range mark bit string and a subsidiary range base value which are corresponding to the subsidiary range; then, the subsidiary ranges of the data to be coded can be determined according to the magnitude of the numerical value of the data to be coded, and the corresponding subsidiary range mark bit string and the subsidiary range base value can be generated simultaneously; subsequently, a subsidiary range relative value can be obtained by using the data to be coded to subtract the subsidiary range base value, and a corresponding binary coding mechanism is adopted to carry out the binary coding to the obtained subsidiary range relative value according to the generated subsidiary range mark bit string; thereby, a subsidiary range code can be obtained, and the subsidiary range code is spliced to the rear part of the subsidiary range mark bit string. The high coding efficiency can be achieved by combining the binary coding method and a binary arithmetic coding method. The present invention is used for the field of digital signal processing, particularly the field of video coding and decoding or image coding and decoding.
Description
Technical field
The present invention relates to a kind of electric numerical data treatment technology, particularly relate to a kind of method and apparatus that is used for data to be encoded are carried out binary scale coding.
Background technology
Entropy coding all has a wide range of applications in video coding and image encoding, and video data or the statistical redundancy of view data are removed in its effect, thereby reaches the effect of data compression.
Entropy coding can be divided into two classes: Huffman coding and arithmetic coding substantially.Static statistics that the information source data are distributed encodes because the Huffman sign indicating number is based on, so be difficult to adaptively to come information source is encoded according to conditional probability, condition redundant information between the information source data just can't well be removed like this, has therefore limited its compression performance.And arithmetic coding can be easily distributes to information source and carries out adaptive dynamic statistics, can be good at using the conditional information between the information source data, remove the condition correlation between the information source data, so relative and Huffman sign indicating number has better compression performance, but its algorithm complex is but higher relatively.
Based on contextual adaptive binary arithmetic coding (Context-based Adaptive BinaryArithmetic Coding, CABAC) adopt binary arithmetic coding, feasible probability Estimation to source symbol becomes simple, simultaneously, by source symbol being carried out probability statistics based on context-adaptive, realized with respect to the better compression performance of Huffman sign indicating number, so H.264 this algorithm is adopted by international video encoding standard.
Accompanying drawing 1 shows the coding block diagram based on contextual adaptive binary arithmetic coding (CABAC).As can be seen from the figure, the CABAC coding has three sport technique segments: to the binarization of syntactic element, based on contextual probabilistic Modeling and binary arithmetic coding engine.Wherein the binarization to syntactic element is a crucial link of basis among the CABAC, rational and effective binarization algorithm can make things convenient for the foundation of probabilistic model, can utilize the Probability Characteristics of source symbol fully, thereby make CABAC to compress the information source data efficiently.Therefore, source symbol is carried out the rational and effective binarization and in CABAC, play crucial effects.
H.264 the binarization algorithm that is adopted in the video standard is a kind of merging of Truncated Unary and two kinds of binary system mechanism of Exp-Golomb, it at first sets a threshold value, when numerical value to be encoded is lower than this threshold value, adopt Truncated Unary binary system mechanism that data to be encoded are carried out binarization; When numerical value to be encoded is higher than or equal this threshold value, at first, generate one section long prefix code, then the difference of data to be encoded and this threshold value is carried out binarization with Exp-Golomb binary system mechanism, and with the result after the binarization and receive after the prefix code, represent thereby generate the final binarization of data to be encoded.Its shortcoming is for the bigger data of numerical value, have among its binarization result to be greatly to be unfavorable for compression by prefix code.
Introduction about Truncated Unary sign indicating number and Exp-Golomb sign indicating number
Truncated Unary sign indicating number is simple relatively a kind of code word, and it is mainly used in processing has the upper limit in codomain data.If data to be encoded are x, be limited to s on the codomain, x wherein, s is nonnegative integer, if x＜s, then the binarization result of x is x prefix bits b0, then with a b1 bit as end, wherein b0, b1 ∈ 0,1}, and b0 ≠ b1; If x==s, then the binarization result of x is x prefix bits b0.Example: for higher limit is 8 Truncated Unary sign indicating number, and 5 coding result is b0 b0 b0 b0b0 b0 b1, and 8 coding result is b0 b0 b0 b0 b0 b0 b0 b0 b0 b0.
The Exp-Golomb sign indicating number is complicated with respect to Truncated Unary sign indicating number, and the Exp-Golomb sign indicating number has individual parameter k to define its exponent number.Provided the structure of 0 rank, 1 rank, 2 rank and 3 rank index Columbus sign indicating numbers in the following table, the x in the table
i∈ 0,1}.
Summary of the invention
The purpose of this invention is to provide a kind of method and apparatus that is used for data to be encoded are carried out binary scale coding.Data to be encoded are through after the binarization algorithm process of the present invention, can be good at reflecting the Probability Characteristics of information source data, and data to be encoded are through after the binarization processing of the present invention, it is accurately convenient to make to the probability Estimation of information source data, like this, the present invention combines with binary arithmetic coding, can be in the vision signal, as conversion coefficient, motion vector and other information to be encoded, realize compression performance efficiently.In addition, the present invention also can be applicable to the huffman sign indicating number.
In order to achieve the above object, the technical solution used in the present invention is as follows:
One, a kind of method that is used for data to be encoded are carried out binary scale coding, the step of this method is as follows:
A) codomain with data to be encoded is divided into m subdomain, and each subdomain all has corresponding with it subdomain flag bit string and subdomain base value;
B) according to the numerical values recited of data to be encoded, determine its affiliated subdomain, generate correspondingly subdomain flag bit string and subdomain base value simultaneously;
C) deduct the subdomain base value with data to be encoded and obtain the subdomain relative value;
D) according at b) the subdomain flag bit string that generated in the step adopts corresponding binary scale coding mechanism to come c) resulting subdomain relative value is carried out binary scale coding in the step, thereby obtain the subdomain sign indicating number, the binary scale coding mechanism that different subdomain flag bit strings is corresponding different;
E) the subdomain sign indicating number being spliced to the binarization that obtains data to be encoded after the subdomain flag bit string represents.
A described m subdomain, its m equals 2, and subdomain flag bit string length is 1 bit, and the subdomain flag bit string of first subdomain is b0, the subdomain base value is bv0, and the subdomain flag bit string of second subdomain is b1, and the subdomain base value is bv1, wherein, b0, b1 ∈ 0,1}, and b0 ≠ b1, bv0＜bv1.
Determine subdomain under the data to be encoded as follows: if data to be encoded more than or equal to subdomain base value bv0 and data to be encoded less than subdomain base value bv1, then data to be encoded belong to first subdomain; If data to be encoded are more than or equal to subdomain base value bv1, then data to be encoded belong to second subdomain.
For subdomain flag bit string is the data to be encoded of b0, and the employing cutoff value is that the Truncated Unary binary scale coding mechanism of bv1-bv0-1 is carried out binary scale coding to its subdomain relative value; For subdomain flag bit string is the data to be encoded of b1, adopts k rank Exp-Golomb binary scale coding mechanism that its subdomain relative value is carried out binary scale coding, and wherein k is a nonnegative integer.
Two, a kind of device that is used for data to be encoded are carried out binary scale coding, it comprises:
1) codomain of data to be encoded can be divided into several subdomains, determine each subdomain flag bit string and subdomain base value, according to the corresponding with it subdomain flag bit string of the numerical values recited output of data to be encoded and the subdomain classification apparatus of subdomain relative value;
2) can be according to the subdomain flag bit string of input, adopt corresponding binarization mechanism that the subdomain relative value of input is carried out binary scale coding to obtain the subdomain sign indicating number, the subdomain sign indicating number is spliced to the subdomain code encoding device that the binarization that obtains data to be encoded after the subdomain flag bit string is represented at last;
The input of subdomain code encoding device links to each other with data to be encoded, the subdomain flag bit string output of subdomain code encoding device and subdomain relative value output connect the input of subdomain code encoding device respectively, and the output of subdomain code encoding device is the output that the binarization of data to be encoded is represented.
The beneficial effect that the present invention has is:
According to the method described above data to be encoded are carried out binarization, the characteristic distributions that not only can better reflect data to be encoded, and can be at data to be encoded in probability distribution characteristics that different subdomain showed and adopt correspondingly binarization mechanism, thereby it is more accurate to the probability Estimation of data to be encoded to make, combine with binary arithmetic coding, just can improve encoding-decoding efficiency greatly.The present invention is applied to digital processing field, particularly coding and decoding video or image coding and decoding field.
Description of drawings
Fig. 1 is based on the coding block diagram of contextual adaptive binary arithmetic coding;
Fig. 2 is a code device block diagram of the present invention.
Embodiment
The invention will be further described below in conjunction with drawings and Examples.
Embodiment 1: the binarization of the Level absolute value of conversion coefficient
Accompanying drawing 2 shows binary scale coding device of the present invention, comprises subdomain classification apparatus, coding synthesizer.
Current data to be encoded (being designated as data_value) input subdomain classification apparatus.The subdomain classification apparatus is divided into m=2 subdomain with the data to be encoded codomain, the form relative sub area base value is respectively bv0=1 and bv1=15, subdomain flag bit string is respectively b0=' 0 ' and b1=' 1 ', even data to be encoded are greater than 0 simultaneously less than 15, then subdomain classification apparatus output subdomain flag bit string ' 0 ' and subdomain relative value data_value-1; If data to be encoded are more than or equal to 15, the subdomain classification apparatus is exported subdomain flag bit string ' 1 ' and subdomain relative value data_value-15.
Subdomain flag bit and subdomain relative value are input to the subdomain code encoding device, and the subdomain code encoding device adopts corresponding binarization mechanism to come the subdomain relative value is carried out binary scale coding according to the subdomain flag bit.Even subdomain flag bit string is ' 0 ', then adopts Truncated Unary encoding mechanism that the subdomain relative value is carried out binary scale coding; If subdomain flag bit string is ' 1 ', then adopt k=0 rank Exp-Golomb encoding mechanism that the subdomain relative value is carried out binary scale coding.
At last, the Bit String that generates after subdomain flag bit string and the binarization of subdomain relative value is carried out and connect, and when connecing, subdomain flag bit string is preceding, the Bit String that generates after the binarization of subdomain relative value after, like this, the binarization that finally obtains data to be encoded is represented.
Embodiment 2: the binarization of motion vector residual component absolute value
Accompanying drawing 2 shows binary scale coding device of the present invention, comprises subdomain classification apparatus, coding synthesizer.
Current data to be encoded (being designated as data_value) input subdomain classification apparatus.The subdomain classification apparatus is divided into m=2 subdomain with the data to be encoded codomain, the form relative sub area base value is respectively bv0=0 and bv1=9, subdomain flag bit string is respectively b0=' 0 ' and b1=' 1 ', even data to be encoded are more than or equal to 0 simultaneously less than 9, then subdomain classification apparatus output subdomain flag bit string ' 0 ' and subdomain relative value data_value; If data to be encoded are more than or equal to 9, the subdomain classification apparatus is exported subdomain flag bit string ' 1 ' and subdomain relative value data_value-9.
Subdomain flag bit string and subdomain relative value are input to the subdomain code encoding device, and the subdomain code encoding device adopts corresponding binarization mechanism to come the subdomain relative value is carried out binary scale coding according to subdomain flag bit string.Even subdomain flag bit string is ' 0 ', then adopts Truncated Unary encoding mechanism that the subdomain relative value is carried out binary scale coding; If subdomain flag bit string is ' 1 ', then adopt k=3 rank Exp-Golomb encoding mechanism that the subdomain relative value is carried out binary scale coding.
At last, the Bit String that generates after subdomain flag bit string and the binarization of subdomain relative value is carried out and connect, and when connecing, the subdomain flag bit is preceding, the Bit String that generates after the binarization of subdomain relative value after.
The foregoing description is used for the present invention that explains, rather than limits the invention, and in the protection range of spirit of the present invention and claim, any modification and change to the present invention makes all fall into protection scope of the present invention.
Claims (5)
1. method that is used for data to be encoded are carried out binary scale coding is characterized in that the step of this method is as follows:
A) codomain with data to be encoded is divided into m subdomain, and each subdomain all has corresponding with it subdomain flag bit string and subdomain base value;
B) according to the numerical values recited of data to be encoded, determine its affiliated subdomain, generate correspondingly subdomain flag bit string and subdomain base value simultaneously;
C) deduct the subdomain base value with data to be encoded and obtain the subdomain relative value;
D) according at b) the subdomain flag bit string that generated in the step adopts corresponding binary scale coding mechanism to come c) resulting subdomain relative value is carried out binary scale coding in the step, thereby obtain the subdomain sign indicating number, the binary scale coding mechanism that different subdomain flag bit strings is corresponding different;
E) the subdomain sign indicating number being spliced to the binarization that obtains data to be encoded after the subdomain flag bit string represents.
2. a kind of method that is used for data to be encoded are carried out binary scale coding according to claim 1 is characterized in that: a described m subdomain, and its m equals 2, subdomain flag bit string length is 1 bit, the subdomain flag bit string of first subdomain is b0, and the subdomain base value is bv0, and the subdomain flag bit string of second subdomain is b1, the subdomain base value is bv1, wherein, b0, b1 ∈ 0,1}, and b0 ≠ b1, bv0＜bv1.
3. a kind of method that is used for data to be encoded are carried out binary scale coding according to claim 2, it is characterized in that: determine the affiliated subdomain of data to be encoded as follows, if less than subdomain base value bv1, then data to be encoded belong to first subdomain to data to be encoded more than or equal to subdomain base value bv0 and data to be encoded; If data to be encoded are more than or equal to subdomain base value bv1, then data to be encoded belong to second subdomain.
4. a kind of method that is used for data to be encoded are carried out binary scale coding according to claim 3, it is characterized in that: for subdomain flag bit string is the data to be encoded of b0, and the employing cutoff value is that the Truncated Unary binary scale coding mechanism of bv1-bv0-1 is carried out binary scale coding to its subdomain relative value; For subdomain flag bit string is the data to be encoded of b1, adopts k rank Exp-Golomb binary scale coding mechanism that its subdomain relative value is carried out binary scale coding, and wherein k is a nonnegative integer.
5. device that is used for data to be encoded are carried out binary scale coding is characterized in that it comprises:
1) codomain of data to be encoded can be divided into several subdomains, determine each subdomain flag bit string and subdomain base value, according to the corresponding with it subdomain flag bit string of the numerical values recited output of data to be encoded and the subdomain classification apparatus of subdomain relative value;
2) can be according to the subdomain flag bit string of input, adopt corresponding binarization mechanism that the subdomain relative value of input is carried out binary scale coding to obtain the subdomain sign indicating number, the subdomain sign indicating number is spliced to the subdomain code encoding device that the binarization that obtains data to be encoded after the subdomain flag bit string is represented at last;
The input of subdomain classification apparatus links to each other with data to be encoded, the subdomain flag bit string output of subdomain classification apparatus and subdomain relative value output are connected respectively to the input of subdomain code encoding device, and the output of subdomain code encoding device is the output that the binarization of data to be encoded is represented.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100613938A CN100423582C (en) | 2005-11-03 | 2005-11-03 | Method and device for binary coding wait coding data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100613938A CN100423582C (en) | 2005-11-03 | 2005-11-03 | Method and device for binary coding wait coding data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1758756A CN1758756A (en) | 2006-04-12 |
| CN100423582C true CN100423582C (en) | 2008-10-01 |
Family
ID=36703902
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2005100613938A Active CN100423582C (en) | 2005-11-03 | 2005-11-03 | Method and device for binary coding wait coding data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100423582C (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101500164B (en) | 2008-12-31 | 2011-09-28 | 深圳市同洲电子股份有限公司 | Method and device for arithmetic code package outputting |
| CN102404571A (en) * | 2011-11-22 | 2012-04-04 | 浙江大学 | Binary method and device for video image coding and decoding |
| JP5603525B2 (en) * | 2012-06-22 | 2014-10-08 | パナソニック インテレクチュアル プロパティ コーポレーション オブ アメリカ | Image coding method and image coding apparatus |
| CN104104950B (en) * | 2013-04-12 | 2018-03-02 | 浙江大学 | The decoding method and device of a kind of pattern information |
| CN107770542A (en) * | 2016-08-21 | 2018-03-06 | 上海天荷电子信息有限公司 | Using the data compression method and device of coding parameter base value |
| CN107919943B (en) | 2016-10-11 | 2020-08-04 | 阿里巴巴集团控股有限公司 | Method and device for coding and decoding binary data |
| CN107846263B (en) * | 2017-11-01 | 2020-07-14 | 南京莱斯电子设备有限公司 | Information source binary arithmetic coding method and coding system based on segmented calculation |
| CN111431716B (en) * | 2020-03-30 | 2021-03-16 | 卓尔智联(武汉)研究院有限公司 | Data transmission method and device, computer equipment and storage medium |
| CN113346911A (en) * | 2021-06-18 | 2021-09-03 | 安谋科技（中国）有限公司 | Compression encoding method, electronic device, and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030103572A1 (en) * | 2001-11-27 | 2003-06-05 | Samsung Electronics Co., Ltd. | Method and apparatus for encoding and decoding key data |
| WO2003053065A2 (en) * | 2001-12-19 | 2003-06-26 | Thomson Licensing S.A. | Method and device for compressing video-packet coded video data |
| US6909744B2 (en) * | 1999-12-09 | 2005-06-21 | Redrock Semiconductor, Inc. | Processor architecture for compression and decompression of video and images |
-
2005
- 2005-11-03 CN CNB2005100613938A patent/CN100423582C/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6909744B2 (en) * | 1999-12-09 | 2005-06-21 | Redrock Semiconductor, Inc. | Processor architecture for compression and decompression of video and images |
| US20030103572A1 (en) * | 2001-11-27 | 2003-06-05 | Samsung Electronics Co., Ltd. | Method and apparatus for encoding and decoding key data |
| WO2003053065A2 (en) * | 2001-12-19 | 2003-06-26 | Thomson Licensing S.A. | Method and device for compressing video-packet coded video data |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1758756A (en) | 2006-04-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100423582C (en) | Method and device for binary coding wait coding data | |
| CN103067022B (en) | A kind of integer data lossless compression method, decompression method and device | |
| US7365658B2 (en) | Method and apparatus for lossless run-length data encoding | |
| US7817864B2 (en) | Coding apparatus and decoding apparatus | |
| CN101167366B (en) | Binarizing method and device | |
| CN103931194A (en) | Entropy coding of motion vector differences | |
| Fitriya et al. | A review of data compression techniques | |
| US9094039B2 (en) | Efficient deflate decompression | |
| CN112399181B (en) | Image coding and decoding method, device and storage medium | |
| US6225922B1 (en) | System and method for compressing data using adaptive field encoding | |
| US10127913B1 (en) | Method of encoding of data stream, method of decoding of data stream, and devices for implementation of said methods | |
| CN1984336A (en) | Binary method and device | |
| CN100370828C (en) | Adaptive method and system for mapping parameter values to codeword indexes | |
| CN103974066A (en) | Video coding method and device | |
| CN104380733A (en) | Video quantization-parameter encoding method, video quantization-parameter decoding method, device, and program | |
| CN110191341B (en) | Depth data coding method and decoding method | |
| Hsieh et al. | A concurrent memory-efficient VLC decoder for MPEG applications | |
| CN112449191A (en) | Method for compressing a plurality of images, method and apparatus for decompressing an image | |
| CN102388538A (en) | Method and device for encoding an input bit sequence and corresponding decoding method and device | |
| CN100413343C (en) | Method and device for getting decoded data value of binary decoding | |
| JP2010004284A (en) | Image decoder, and image decoding method | |
| Ezhilarasan et al. | A new entropy encoding technique for multimedia data compression | |
| US8854233B2 (en) | Method and system for de-binarization | |
| WO2020186535A1 (en) | Point cloud attribute encoding method and device, and point cloud attribute decoding method and device | |
| CN103024380B (en) | A kind of entropy coding method of data and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| ASS | Succession or assignment of patent right |
Owner name: HUAWEI TECHNOLOGY CO., LTD. Free format text: FORMER OWNER: ZHEJIANG UNIVERSITY Effective date: 20090417 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20090417 Address after: Bantian HUAWEI headquarters office building, Longgang District, Shenzhen, Guangdong Patentee after: Huawei Technologies Co., Ltd. Address before: No. 38, Zhejiang Road, Hangzhou, Zhejiang, Xihu District Patentee before: Zhejiang University |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20220118 Address after: 450046 Floor 9, building 1, Zhengshang Boya Plaza, Longzihu wisdom Island, Zhengdong New Area, Zhengzhou City, Henan Province Patentee after: Super fusion Digital Technology Co.,Ltd. Address before: 518129 Bantian HUAWEI headquarters office building, Longgang District, Guangdong, Shenzhen Patentee before: HUAWEI TECHNOLOGIES Co.,Ltd. |
|
| TR01 | Transfer of patent right |