CN102843562B - A kind of method of the fault-tolerant entropy code that divides into groups - Google Patents
A kind of method of the fault-tolerant entropy code that divides into groups Download PDFInfo
- Publication number
- CN102843562B CN102843562B CN201210299132.XA CN201210299132A CN102843562B CN 102843562 B CN102843562 B CN 102843562B CN 201210299132 A CN201210299132 A CN 201210299132A CN 102843562 B CN102843562 B CN 102843562B
- Authority
- CN
- China
- Prior art keywords
- length
- block
- grouping
- fault
- entropy code
- 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.)
- Expired - Fee Related
Links
Landscapes
- Compression Or Coding Systems Of Tv Signals (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The invention belongs to information fault tolerance technical field, provide a kind of method of the fault-tolerant entropy code that divides into groups, first the frame in video sequence is divided into the macro block of equal sizes, and macro block is compressed, obtain the data block that length does not wait, as the source data of the fault-tolerant entropy code of grouping; Then according to transition length algorithm, obtain transition length sequence, source data is divided into different groups, draw the grouping information of each data block; Finally the grouping information of each data block is encoded; The group of the method by being divided into total length equal the block of different length, then group is encoded according to order one by one, optimize cataloged procedure, accelerate the code rate of coding side, increase seldom to storage demand, reduce the complexity of decoding, effectively improve robustness, there is stronger propagation and employment and be worth.
Description
Technical field
The invention belongs to information fault tolerance field, particularly relate to a kind of method of the fault-tolerant entropy code that divides into groups.
Background technology
The frame structure of fault-tolerant entropy code adopts equel length code groove to encode the data block of different length, and the length of each yard of groove is close to average length.Fault-tolerant entropy code is generally divided into N to walk, the first step, is inserted in corresponding code groove by all blocks and goes, when the n-th step, and the i-th block search (i+ φ
n)/N, φ
nbe a predefined offset sequence, N is the total block data of source data.If the groove that certain data block searches also has remaining space after installing this data block, so just the part that other blocks have more is loaded into.
The method of fault-tolerant entropy code needs data block to be put into step by step isometric code groove, and cataloged procedure is long, and decoding is complicated, poor robustness.
Summary of the invention
The invention provides a kind of method of the fault-tolerant entropy code that divides into groups, the method being intended to solve traditional fault-tolerant entropy code needs data block to be put into step by step isometric code groove, and cataloged procedure is long, the code rate of coding side is lower, decode operation is complicated, the problem of poor robustness.
The object of the present invention is to provide a kind of method of the fault-tolerant entropy code that divides into groups, the method comprises the following steps:
Step one, is divided into the macro block of equal sizes, and is compressed by macro block, obtain the data block that length is second-class by the frame in video sequence, as the source data of the fault-tolerant entropy code of grouping;
Step 2, according to transition length algorithm, obtains transition length sequence, source data is divided into different groups, draw the grouping information of each data block;
Step 3, encodes to the grouping information of each data block.
Further, in step 2, according to transition length algorithm, the implementation method obtaining transition length sequence is:
1) initialization: make L=L
min, k=1, L
minthe block of shortest length in representing all pieces.
2) find all length to be not more than the block of L, and be designated as SL.
K
lthe quantity of to be length the be block of l
3) R=k*T/M is made, if S
l> R, then L
k=L, k=k+1, L
kbe a kth transition length, T is the total length of all pieces, and M is the group number preset.
4) L=L+1, if L=L
maxor k=M, then terminate, otherwise jump to 2), wherein L
maxthe block that in representing all pieces, length is the longest.
Further, in step 2, the group number of source data grouping is setting in advance, and the group number of source data grouping is not less than 2 groups.
Further, the data group that with the addition of grouping information also can be transmitted, with the actual effect of the fault-tolerant entropy code of test packet by the method.
Further, when method being used for the compression transmission of video sequence, the impact of sequence quantized level is little, and Y-PSNR improves along with the increase of grouping group number.
The method of the fault-tolerant entropy code of grouping provided by the invention, is first divided into the macro block of equal sizes, and is compressed by macro block by the frame in video sequence, obtain the data block that length does not wait, as the source data of the fault-tolerant entropy code of grouping; Then according to transition length algorithm, obtain transition length sequence, source data is divided into different groups, draw the grouping information of each data block; Finally the grouping information of each data block is encoded; The group of the method by being divided into total length equal the block of different length, then group is encoded according to order one by one, optimize cataloged procedure, accelerate the code rate of coding side, increase seldom to storage demand, reduce the complexity of decoding, effectively improve robustness, there is stronger propagation and employment and be worth.
Accompanying drawing explanation
Fig. 1 is the realization flow figure of the method for the fault-tolerant entropy code of grouping that the embodiment of the present invention provides;
Fig. 2 be the embodiment of the present invention provide according to transition length algorithm, obtain the flow chart of the implementation method of transition length sequence.
Embodiment
In order to make object of the present invention, technical scheme and advantage clearly understand, below in conjunction with drawings and Examples, the present invention is described in further detail.Should be appreciated that specific embodiment described herein only in order to explain the present invention, and be not used in restriction invention.
Fig. 1 shows the realization flow of the method for the fault-tolerant entropy code of grouping that the embodiment of the present invention provides.
The method comprises the following steps:
In step S101, the frame in video sequence is divided into the macro block of equal sizes, and macro block is compressed, obtain the data block that length is second-class, as the source data of the fault-tolerant entropy code of grouping;
In step s 102, according to transition length algorithm, obtain transition length sequence, source data is divided into different groups, draw the grouping information of each data block;
In step s 103, the grouping information of each data block is encoded.
As shown in Figure 2, in embodiments of the present invention, in step s 102, according to transition length algorithm, the implementation method obtaining transition length sequence is:
1) initialization: make L=L
min, k=1, L
minthe block of shortest length in representing all pieces.
2) find all length to be not more than the block of L, and be designated as SL.
K
lthe quantity of to be length the be block of l
3) R=k*T/M is made, if S
l> R, then L
k=L, k=k+1, L
kbe a kth transition length, T is the total length of all pieces, and M is the group number preset.
4) L=L+1, if L=L
maxor k=M, then terminate, otherwise jump to 2), wherein L
maxthe block that in representing all pieces, length is the longest.
In embodiments of the present invention, in step s 102, the group number of source data grouping is setting in advance, and the group number of source data grouping is not less than 2 groups.
In embodiments of the present invention, the data group that with the addition of grouping information also can be transmitted, with the actual effect of the fault-tolerant entropy code of test packet by the method.
In embodiments of the present invention, when method being used for the compression transmission of video sequence, the impact of sequence quantized level is little, and Y-PSNR improves along with the increase of grouping group number.
Below in conjunction with drawings and the specific embodiments, application principle of the present invention is further described.
After image is divided into different blocks, the length after its compression differs, thus is divided into different groups according to its length.In grouping process, the length of each piece and the transition length obtained by algorithm are made comparisons, thus determines the group belonging to each block.
Carry out the compression transmission of video sequence by the method in the present invention, the impact of sequence quantized level is little, and Y-PSNR improves along with the increase of M.Meanwhile, it is also showing than traditional E REC compared with the performance under high bit-error.
After obtaining the grouping information of data block, can be predictive coding to the coding of grouping information also can be other coding techniquess, can multiple compression means be realized by this group technology from the different combinations to grouping information coding techniques.
The idiographic flow of the method for the fault-tolerant entropy code of this grouping is as follows:
The a certain frame of video sequence is divided into the macro block of equal sizes, is then compressed, thus obtain length not wait data block, as we coding source data.
According to transition length algorithm, obtain transition length sequence, thus source data is divided into different groups, thus draw the grouping information of each piece.Group number M is setting in advance, M >=2.
The compress techniques such as predictive coding are utilized to encode to grouping information.
The data group that with the addition of grouping information is transmitted, the actual effect of test new method.
The method of the fault-tolerant entropy code of the grouping that the embodiment of the present invention provides, is first divided into the macro block of equal sizes, and is compressed by macro block by the frame in video sequence, obtain the data block that length does not wait, as the source data of the fault-tolerant entropy code of grouping; Then according to transition length algorithm, obtain transition length sequence, source data is divided into different groups, draw the grouping information of each data block; Finally the grouping information of each data block is encoded; The group of the method by being divided into total length equal the block of different length, then group is encoded according to order one by one, optimize cataloged procedure, accelerate the code rate of coding side, increase seldom to storage demand, reduce the complexity of decoding, effectively improve robustness, there is stronger propagation and employment and be worth.
The foregoing is only preferred embodiment of the present invention, not in order to limit the present invention, all any amendments done within the spirit and principles in the present invention, equivalent replacement and improvement etc., all should be included within protection scope of the present invention.
Claims (3)
1. a method for the fault-tolerant entropy code of grouping, it is characterized in that, the method comprises the following steps:
Step one, is divided into the macro block of equal sizes, and is compressed by macro block by the frame in video sequence, obtain the data block that length does not wait, as the source data of the fault-tolerant entropy code of grouping;
Step 2, according to transition length algorithm, obtains transition length sequence, source data is divided into different groups, draw the grouping information of each data block;
Step 3, encodes to the grouping information of each data block;
In step 2, according to transition length algorithm, the implementation method obtaining transition length sequence is:
1) initialization: make L=L
min, k=1, L
minthe block of shortest length in representing all pieces;
2) find all length to be not more than the block of L, and be designated as S
l;
K
lthe quantity of to be length the be block of l;
3) R=k*T/M is made, if S
l> R, then L
k=L, k=k+1, L
kbe a kth transition length, T is the total length of all pieces, and M is the group number preset;
4) L=l, if l=L
maxor k=M, then terminate, otherwise jump to 2), wherein L
maxthe block that in representing all pieces, length is the longest.
2. the method for claim 1, is characterized in that, in step 2, the group number of source data grouping is setting in advance, and the group number of source data grouping is not less than 2 groups.
3. the method for claim 1, is characterized in that, the data group that with the addition of grouping information also can be transmitted, with the actual effect of the fault-tolerant entropy code of test packet by the method.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201210299132.XA CN102843562B (en) | 2012-08-21 | 2012-08-21 | A kind of method of the fault-tolerant entropy code that divides into groups |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201210299132.XA CN102843562B (en) | 2012-08-21 | 2012-08-21 | A kind of method of the fault-tolerant entropy code that divides into groups |
Publications (2)
Publication Number | Publication Date |
---|---|
CN102843562A CN102843562A (en) | 2012-12-26 |
CN102843562B true CN102843562B (en) | 2016-03-02 |
Family
ID=47370578
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201210299132.XA Expired - Fee Related CN102843562B (en) | 2012-08-21 | 2012-08-21 | A kind of method of the fault-tolerant entropy code that divides into groups |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN102843562B (en) |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103209325B (en) * | 2013-02-26 | 2016-03-09 | 西北农林科技大学 | The fault-tolerant entropy coding method of a kind of intersection |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101243459A (en) * | 2005-08-12 | 2008-08-13 | 微软公司 | Adaptive coding and decoding of wide-range coefficients |
CN101243611A (en) * | 2005-08-12 | 2008-08-13 | 微软公司 | Efficient coding and decoding of transform blocks |
Family Cites Families (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR101426272B1 (en) * | 2008-03-10 | 2014-08-07 | 삼성전자주식회사 | Apparatus of encoding image and apparatus of decoding image |
US8179974B2 (en) * | 2008-05-02 | 2012-05-15 | Microsoft Corporation | Multi-level representation of reordered transform coefficients |
-
2012
- 2012-08-21 CN CN201210299132.XA patent/CN102843562B/en not_active Expired - Fee Related
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101243459A (en) * | 2005-08-12 | 2008-08-13 | 微软公司 | Adaptive coding and decoding of wide-range coefficients |
CN101243611A (en) * | 2005-08-12 | 2008-08-13 | 微软公司 | Efficient coding and decoding of transform blocks |
Also Published As
Publication number | Publication date |
---|---|
CN102843562A (en) | 2012-12-26 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN103067022B (en) | A kind of integer data lossless compression method, decompression method and device | |
RU2011117578A (en) | VIDEO ENCODING WITH LARGE MACRO BLOCKS | |
HRP20161174T1 (en) | Method and apparatus for encoding video, and method and apparatus for decoding video | |
CN104168085A (en) | Data compression method based on redundant entropy conversion | |
CN103339959A (en) | Dynamic video switching | |
CN106170921A (en) | Relate to source code and the decoding method and device of the data of sign compression | |
CN102469311A (en) | Hierarchical forward error correction encoding/decoding method, encoding/decoding device and system | |
MY180135A (en) | Nested entropy encoding | |
AR069887A1 (en) | IMPROVED PIXEL PREDICTION FOR VIDEO CODING | |
CN102438145A (en) | Lossless picture compression method based on Huffman coding | |
CN102724500B (en) | A kind of compressing/decompressing method of video data and system | |
CN104837019B (en) | AVS to HEVC optimization video transcoding methods based on SVMs | |
WO2011021910A3 (en) | Method and apparatus for intra-prediction encoding/decoding | |
CN104467868A (en) | Chinese text compression method | |
CN102118615B (en) | Video coding/decoding method adopting variable size block skipping mode and device | |
CN101540901B (en) | Method and device for coding/decoding | |
CN104935944A (en) | Method and device for coding and decoding video data | |
CN107733562B (en) | Method and device for encoding and decoding polarization code | |
CN103731154B (en) | Data compression algorithm based on semantic analysis | |
CN102843562B (en) | A kind of method of the fault-tolerant entropy code that divides into groups | |
CN107071452B (en) | To the decoded method of video quantizing parameter | |
CN106791859B (en) | Method for video coding and video encoder | |
CN103533354B (en) | A kind of HD video fast encoding method | |
CN106130692B (en) | A kind of not equal differential protection methods based on online fountain codes | |
CN109587499A (en) | A kind of method of ultrahigh resolution computer desktop compressed encoding |
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 | ||
CF01 | Termination of patent right due to non-payment of annual fee | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20160302 Termination date: 20160821 |