CN101754010A - Loop filtering method of video data encoding and filter - Google Patents
Loop filtering method of video data encoding and filter Download PDFInfo
- Publication number
- CN101754010A CN101754010A CN 200810240121 CN200810240121A CN101754010A CN 101754010 A CN101754010 A CN 101754010A CN 200810240121 CN200810240121 CN 200810240121 CN 200810240121 A CN200810240121 A CN 200810240121A CN 101754010 A CN101754010 A CN 101754010A
- Authority
- CN
- China
- Prior art keywords
- filtering
- boundary
- bit
- block
- loop
- 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.)
- Pending
Links
- 238000001914 filtration Methods 0.000 title claims abstract description 136
- 238000000034 method Methods 0.000 title claims abstract description 38
- 238000005070 sampling Methods 0.000 claims abstract description 15
- 238000010586 diagram Methods 0.000 description 8
- 238000009795 derivation Methods 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 2
- 230000000903 blocking effect Effects 0.000 description 1
- 238000000205 computational method Methods 0.000 description 1
- 230000004069 differentiation Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000002708 enhancing effect Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000013139 quantization Methods 0.000 description 1
Images
Landscapes
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
The present invention provides a loop filtering method of input video data above 8 bits and a filter. The loop filtering method comprises the following steps: the boundary filtering strength and the boundary threshold of a current block in a macro block are calculated; on the basis of the boundary threshold, current blocks with different filtering strengths are selectively carried out boundary filtering. The present invention is characterized in that the steps for calculating the boundary threshold comprise: the boundary threshold is adjusted according to the bit-position widths of sampling points. The present invention spreads the support of loop filtering for input video data bit-position width dynamic ranges to enable the input video data bit-position width ranges to adapt more application requirements; the compatibility of 8-bit input data is ensured; and meanwhile, the counting amount of an encoder is not increased, and the cost of a memory is not obviously increased.
Description
The technology neighborhood
The present invention relates to coding and decoding video, relate in particular to the filtering technique of removing blocking artifact.
Background technology
The method of present loop filtering of the prior art designs at the 8bit video data encoding.But, in recent years, some application (such as monitoring field) have appearred, and they need particularly be higher than the coding video data of 8bit to different bit wides, therefore are necessary loop filtering is improved, to adapt to the requirement of these new application.
Summary of the invention
The object of the present invention is to provide new loop circuit filtering method and filter, to adapt to the needs of new application.
For this reason, the bit bit wide that the present invention is based on sampling point is adjusted the block boundary threshold value relevant with the input video bit wide in the filtering, and loop circuit filtering method is expanded to the particularly video data of seniority top digit more of different bit wides.
According to first aspect, the invention provides a kind of loop circuit filtering method of inputting video data, comprise the following steps: the boundary filtering strength and the boundary threshold of current block in the computing macro block; Based on boundary threshold, the current block selectivity with different filtering strengths is carried out boundary filtering; The step that it is characterized in that the computation bound threshold value comprises according to the bit bit wide of sampling point adjusts boundary threshold.
According to second aspect, the invention provides a kind of loop filter of inputting video data, comprising: the unit of the boundary filtering strength of current block and boundary threshold in the computing macro block; Based on boundary threshold, the current block selectivity with different filtering strengths is carried out the unit of boundary filtering; The unit that it is characterized in that the computation bound threshold value comprises the subelement of adjusting boundary threshold according to the bit bit wide of sampling point.
Preferably, in the present invention, under the situation of benchmark class loop filtering, adjust filtering based on the bit bit wide of sampling point and reduce parameter, and parameter is reduced in filtering be used for the current block filtering strength is carried out boundary filtering.
The present invention has expanded the support of loop filtering to inputting video data bit bit wide dynamic range, enable to adapt to the requirement of more application, and guaranteed compatibility for 8bit input data, and do not increase the amount of calculation of codec simultaneously, obviously do not increase the memory expense yet.
Description of drawings
Below with reference to accompanying drawings specific embodiments of the present invention is described in detail, in the accompanying drawing:
Fig. 1 (a) and (b) be respectively the border schematic diagram of macro block filtering under the different-format;
Fig. 2 is according to the schematic diagram of first embodiment at 6 sample points of level or vertical boundary both sides;
Fig. 3 (a) and (b) be schematic diagram according to the second embodiment horizontal boundary sample;
Fig. 4 (a) and (b) be schematic diagram according to the second embodiment vertical boundary sample.
Embodiment
The present invention is based on the input video bit wide, adjust block boundary threshold value relevant in the filtering, filtering reduction parameter, the isoparametric computational methods of boundary intensity with the input video bit wide, improved the concrete technology of differentiation and filtering, loop circuit filtering method is expanded to support the video data of higher bit figure place is carried out, guarantee to the subjective quality that obtains after more the inputting video data of high dynamic range compresses.
When the bit bit wide of video data of input greater than 8bit, make BitDepthY, BitDepthC represent bit bit wide bright, degree colourity sampling point respectively, BitDepthY and BitDepthC value are more than or equal to 8.
If the value of coding profile_id is 0x20, is example with 8 * 8 luminance block, there is " boundary intensity " Bs on every border between the luminance block, and the boundary intensity of chrominance block replaces with the Bs on correspondence position luminance block border.Fig. 1 is the border schematic diagram that needs filtering in the macro block.Fig. 1 (a) is the 4:2:0 form, and Fig. 1 (b) is the 4:2:2 form.Note that the heavy line among the figure is a vertical boundary, thick dashed line is a horizontal boundary.If Bs equals 0 then not to boundary filtering, otherwise according to the characteristic of fractional sample value and Bs value to boundary filtering.
If the value of profile_id is 0x40, every border between 8 * 8 luminance block or the chrominance block has a plurality of " boundary intensity " Bs respectively.If Bs equals 0 then not to boundary filtering, otherwise according to the characteristic of fractional sample value and Bs value to boundary filtering.The characteristic of fractional sample value refers to the content character in field, border, coding mode of adjacent macroblocks or the like.
Except that the border of image boundary and band, the coboundary of macro block and adjacent macroblocks and left margin, and filtering all should be carried out in each border of 8 * 8 of interior macroblocks.
Loop filtering is a unit with the macro block, handles successively according to decoding order.The filtering of each macro block is as follows in the image:
Loop filtering is done in brightness and colourity respectively, as shown in Figure 1, at first from left to right to vertical boundary filtering, then from top to bottom to horizontal boundary filtering.Be modified in the macro-block loop filtering process that the top of current macro or the sample value on the left side may be former, the loop filtering of current macro be input as the sample value that these may be modified, and the current macro loop filtering may further be revised these sample values.The sample value of revising in the current macro vertical boundary filtering is as the input of horizontal boundary filtering.If the value of profile_id is 0x20, should adopt benchmark class loop filtering, if the value of profile_id is 0x40, should adopt to strengthen the class loop filtering.
Next, benchmark class loop filtering and enhancing class loop filtering are introduced respectively in detail.
1 benchmark class loop filtering
1.1 the derivation of boundary filtering strength
According to the motion vector of 8 * 8 luminance block in macro block (mb) type, the macro block, calculate the value of Bs as follows:
---if two 8 * 8 of the both sides, border have one or two all to belong to the infra-frame prediction macro block, and then Bs equals 2;
---otherwise, if the present image type is the P frame and satisfies in following two conditions any that then Bs equals 1; Do not satisfy if the present image type is P frame and following two conditions, then Bs equals 0;
A) the reference picture difference of two pieces.
B) reference picture of two pieces is identical, but the difference of any component is more than or equal to a whole pixel in two motion vector components.
---otherwise, calculate the value of Bs by the following method:
If a) the forward direction index reference value of two piece p and q and back equate respectively to the index reference value:
Below any establishment in two conditions, then Bs equals 1:
I) in the forward motion vector component of two pieces the difference of any component more than or equal to a whole pixel.
II) in the backward motion vector component of two pieces the difference of any component more than or equal to a whole pixel.
Otherwise Bs equals 0;
B) otherwise, Bs equals 1.
1.2 the derivation of block boundary threshold value
Fig. 2 represents piece p and the piece q schematic diagram at 6 sample points (border is represented with heavy black line) of level or vertical boundary both sides according to first embodiment.Represent the filtered sample value of p0, p1, q0 and q1 respectively with P0, P1, Q0 and Q1.
If following formula is true, to boundary sample filtering:
Bs！＝0&&Abs(p0-q0)＜α&&Abs(p1-p0)＜β&&Abs(q1-q0)＜β
Wherein α and β are the block boundary threshold value.
Can be according to the quantization parameter QP mean value QPav of two pieces, and block-eliminating effect filtering parameter A lphaCOffset and BetaOffset calculate lookup table index IndexA and IndexB.If current block is a luminance block, should use the QP of luminance block; If current block is a chrominance block, should use the QP of chrominance block.
The QP mean value QPav of two pieces is:
QPav＝(QPp+QPq+1)＞＞1
Index IndexA and IndexB are:
IndexA＝Clip3(0，63，QPav+AlphaCOffset)
IndexB＝Clip3(0，63，QPav+BetaOffset)
Wherein
According to the corresponding relation between index IndexA and IndexB and thresholding variable α ' and β ', obtain the value of α ', β ' by table 1.Here, α ', β ' are meant the block boundary threshold value of former 8 bit video pieces.Tabling look-up according to IndexA obtains α ', and tabling look-up according to IndexB obtains β '.Can obtain corresponding block boundary threshold alpha and β by following manner.
If current block is a luminance block
α＝α’*(1＜＜(BitDepthY-8))
β＝β’*(1＜＜(BitDepthY-8))。
Otherwise current block is a chrominance block
α＝α’*(1＜＜(BitDepthC-8))
β＝β’*(1＜＜(BitDepthC-8))。
The relation of table 1 block boundary thresholding variate-value α ' and β ' and IndexA and IndexB
| Index | ??α’ | β’ | Index | ??α’ | β’ | Index | α’ | ??β’ | Index | α’ | ??β’ |
| ??0 | ??0 | 0 | ??16 | ??4 | 2 | ??32 | ??22 | ??6 | ??48 | 46 | ??15 |
| ??1 | ??0 | 0 | ??17 | ??4 | 2 | ??33 | ??24 | ??7 | ??49 | 48 | ??16 |
| Index | ??α’ | β’ | Index | ??α’ | β’ | Index | α’ | ??β’ | Index | α’ | ??β’ |
| ??2 | ??0 | 0 | ??18 | ??5 | 3 | ??34 | ??26 | ??7 | ??50 | 50 | ??17 |
| ??3 | ??0 | 0 | ??19 | ??5 | 3 | ??35 | ??28 | ??7 | ??51 | 52 | ??18 |
| ??4 | ??0 | 0 | ??20 | ??6 | 3 | ??36 | ??30 | ??8 | ??52 | 53 | ??19 |
| ??5 | ??0 | 0 | ??21 | ??7 | 3 | ??37 | ??33 | ??8 | ??53 | 54 | ??20 |
| ??6 | ??1 | 1 | ??22 | ??8 | 4 | ??38 | ??33 | ??8 | ??54 | 55 | ??21 |
| ??7 | ??1 | 1 | ??23 | ??9 | 4 | ??39 | ??35 | ??9 | ??55 | 56 | ??22 |
| ??8 | ??1 | 1 | ??24 | ??10 | 4 | ??40 | ??35 | ??9 | ??56 | 57 | ??23 |
| ??9 | ??1 | 1 | ??25 | ??11 | 4 | ??41 | ??36 | ??10 | ??57 | 58 | ??23 |
| ??10 | ??1 | 1 | ??26 | ??12 | 5 | ??42 | ??37 | ??10 | ??58 | 59 | ??24 |
| ??11 | ??2 | 1 | ??27 | ??13 | 5 | ??43 | ??37 | ??11 | ??59 | 60 | ??24 |
| ??12 | ??2 | 1 | ??28 | ??15 | 5 | ??44 | ??39 | ??11 | ??60 | 61 | ??25 |
| ??13 | ??2 | 2 | ??29 | ??16 | 5 | ??45 | ??39 | ??12 | ??61 | 62 | ??25 |
| ??14 | ??3 | 2 | ??30 | ??18 | 6 | ??46 | ??42 | ??13 | ??62 | 63 | ??26 |
| ??15 | ??3 | 2 | ??31 | ??20 | 6 | ??47 | ??44 | ??14 | ??63 | 64 | ??27 |
1.3Bs equal 2 o'clock boundary filtering process
At first define ap=Abs (p2-p0), aq=Abs (q2-q0).
Filtering to sample p0, p1, q0 and the q1 on both sides, luminance block border is as follows:
if(ap＜β&&Abs(p0-q0)＜((α＞＞2)+2)){
P0＝(p1+2×p0+q0+2)＞＞2
P1＝(2×p1+p0+q0+2)＞＞2
}
else
P0＝(2×p1+p0+q0+2)＞＞2
if(aq＜β&&Abs(p0-q0)＜((α＞＞2)+2)){
Q0＝(q1+2×q0+p0+2)＞＞2
Q1＝(2×q1+q0+p0+2)＞＞2
}
else
Q0＝(2×q1+q0+p0+2)＞＞2
Wherein P0 and Q0 are respectively p0 and the filtered value of q0.If P1 in the superincumbent filtering (or Q1) not by assignment, then means not to p1 (or q1) filtering; Otherwise P1 or Q1 are p1 or the filtered value of q1.
The sample p0 on both sides, chrominance block border and q0 adopt the filtering that uses the same method, not to p1 and q1 filtering.
1.4Bs equal 1 o'clock boundary filtering process
The value of boundary filtering strength Bs is 1 o'clock, to the computational process following (P0 and Q0 are respectively p0 and the filtered value of q0) of p0 and q0 filtering:
delta＝Clip3(-C，C，(((q0-p0)×3+(p1-q1)+4)＞＞3))
If be the brightness border
P0＝Clip1Y(p0+delta)
Q0＝Clip1Y(q0-delta)
Otherwise be the colourity border
P0＝Clip1C(p0+delta)
Q0＝Clip1C(q0-delta)
Wherein:
Clip1Y(x)＝Clip3(0，(1＜＜BitDepthY)-1，x)
Clip1C(x)＝Clip3(0，(1＜＜BitDepthC)-1，x)
Judging whether then need be to p1 and q1 filtering, and computational process is as follows:
If---be the colourity border, not to p1 and q1 filtering.
---if ap is arranged less than β at the brightness boundary, then to p1 filtering, filtered value is
P1＝Clip1Y(p1+Clip3(-C，C，(((P0-p1)×3+(p2-Q0)+4)＞＞3)))
---if aq is arranged less than β at the brightness boundary, then to q1 filtering, filtered value is
Q1＝Clip1Y(q1-Clip3(-C，C，(((q1-Q0)×3+(P0-q2)+4)＞＞3)))
In the above-mentioned filtering, the definition of ap and aq sees 1.3, and C is called filtering and reduces parameter, and C ' reduces parametric variable for filtering, and the relation between C ' and the IndexA sees Table 2.The value that parameters C is reduced in filtering is calculated by following formula:
C＝C’*(1＜＜(BitDepthY-8))
The relation of parametric variable C ' and IndexA is reduced in table 2 filtering
| Index | ?C’ | Index | ?C’ | Index | ?C’ | Index | ?C’ |
| ??0 | ??0 | ??16 | ??1 | ??32 | ??2 | ??48 | ??5 |
| ??1 | ??0 | ??17 | ??1 | ??33 | ??2 | ??49 | ??5 |
| Index | ?C’ | Index | ?C’ | Index | ?C’ | Index | ?C’ |
| ??2 | ??0 | ??18 | ??1 | ??34 | ??2 | ??50 | ??5 |
| ??3 | ??0 | ??19 | ??1 | ??35 | ??2 | ??51 | ??6 |
| ??4 | ??0 | ??20 | ??1 | ??36 | ??2 | ??52 | ??6 |
| ??5 | ??0 | ??21 | ??1 | ??37 | ??2 | ??53 | ??6 |
| ??6 | ??0 | ??22 | ??1 | ??38 | ??3 | ??54 | ??7 |
| ??7 | ??0 | ??23 | ??1 | ??39 | ??3 | ??55 | ??7 |
| ??8 | ??0 | ??24 | ??1 | ??40 | ??3 | ??56 | ??7 |
| ??9 | ??0 | ??25 | ??1 | ??41 | ??3 | ??57 | ??7 |
| ??10 | ??0 | ??26 | ??1 | ??42 | ??3 | ??58 | ??8 |
| ??11 | ??0 | ??27 | ??1 | ??43 | ??3 | ??59 | ??8 |
| ??12 | ??0 | ??28 | ??1 | ??44 | ??3 | ??60 | ??8 |
| ??13 | ??0 | ??29 | ??1 | ??45 | ??4 | ??61 | ??9 |
| ??14 | ??0 | ??30 | ??2 | ??46 | ??4 | ??62 | ??9 |
| ??15 | ??0 | ??31 | ??2 | ??47 | ??4 | ??63 | ??9 |
2 strengthen the class loop filtering
2.1 whether skip the judgement of loop filtering
If present image is the P frame, perhaps current decoded field is | second (DISPLAY ORDER) of frame:
---if the value of the cbp of macro block is 0, and then 8 * 8 block boundaries do not need filtering in the macro block.
---do not adopt advanced prediction mode, left margin or coboundary for macro block, if the value of the cbp of two adjacent macroblocks is the difference of motion vector of identical while two macro blocks of the reference key of 0 and two macro block less than a whole pixel, then this border does not need filtering.
---adopt advanced prediction mode, for the VS macro block to and the NS macro block between the border, if the value of the VS0 macro block and the cbp of NS0 macro block is the difference of motion vector of identical while two macro blocks of the reference key of 0 and two macro block less than a whole pixel, then the VS macro block to and the NS macro block between the border do not need filtering; Otherwise, the VS macro block to and the NS macro block between the border in the pixel of VS1 macro block do not need filtering.
2.2 the derivation of boundary filtering strength
Fig. 3 is the schematic diagram according to the second embodiment horizontal boundary sample.Fig. 3 a) represents be top_field_first value for ' 1 ' and piece q place macro block be VS0 macro block or NS macro block; Or the value of top_field_first for ' 0 ' and piece q place macro block be the situation of VS1 macro block; Fig. 3 b) expression be top_field_first value for ' 0 ' and piece q place macro block be VS0 macro block or NS macro block; Or the value of top_field_first for ' 1 ' and piece q place macro block be the situation of VS1 macro block.
Fig. 4 is the schematic diagram according to the second embodiment vertical boundary sample.Fig. 4 a) represents is that the value of top_field_first is ' 1 ', and current block q place macro block is the NS macro block, and adjacent block p place macro block is the VS0 macro block; Or the value of top_field_first is ' 0 ', and current block q place macro block is the VS0 macro block, and adjacent block p place macro block is the situation of NS macro block; Fig. 4 b) value of expression top_field_first is ' 0 ', and current block q place macro block is the VS0 macro block, and adjacent block p place macro block is the NS macro block; Or the value of top_field_first is ' 1 ', and current block q place macro block is the NS macro block, and adjacent block p place macro block is the situation of VS0 macro block.
Calculate the QP mean value QPav of two pieces by the following method.If current block is a luminance block, should use the QP of luminance block; If current block is a chrominance block, should use the QP of chrominance block.
QPav＝(QPp+QPq+1)＞＞1
Index IndexA and IndexB are:
IndexA＝Clip3(0，63，QPav+AlphaCOffset)
IndexB＝Clip3(0，63，QPav+BetaOffset)
According to index IndexA and IndexB and threshold alpha ' and β ' between corresponding relation, obtain the value of α ', β ' by table 1, tabling look-up according to IndexA obtains α ', tabling look-up according to IndexB obtains β '.Can obtain corresponding block boundary threshold alpha and β by following manner.
If current block is a luminance block
α＝α’*(1＜＜(BitDepthY-8))
β＝β’*(1＜＜(BitDepthY-8))
Otherwise current block is a chrominance block
α＝α’*(1＜＜(BitDepthC-8))
β＝β’*(1＜＜(BitDepthC-8))
To each row of horizontal boundary and the independent computation bound filtering strength Bs of each row of vertical boundary.If Abs (p0-q0) greater than 1, calculates Bs less than α and Abs (p0-q0) by the following method; Otherwise Bs equals 0.
---at first, the value of fL and fR all is changed to 0,
if(Abs(p0-p1)＜β)
fL+＝2
if(Abs(p0-p2)＜β)
fL++
if(Abs(q0-q1)＜β)
fR+＝2
if(Abs(q0-q2)＜β)
fR++
fS＝fL+fR。
---in second step, obtain Bs according to the value of fS:
A) when fS equals 6, if p0 equals p1 and q0 equals q1, then Bs equals 4; Otherwise Bs equals 3.
B) when fS equals 5, if p0 equals p1 and q0 equals q1, then Bs equals 3; Otherwise Bs equals 2.
C) when fS equals 4, if fL equals 2, then Bs equals 2; Otherwise Bs equals 1.
D) when fS equals 3, and Abs (p1-q1) is less than β, and then Bs equals 1; Otherwise Bs equals 0.
E) when fS was worth for other, Bs equaled 0.
---in the 3rd step,, revise Bs by the following method if the Bs that second step obtained is not equal to 0:
If a) do not adopt advanced prediction mode, present image is that the border of two field picture and filtering is the chrominance block border, and Bs subtracts 1.
B) if do not adopt advanced prediction mode, present image is field picture and one of meets the following conditions that Bs subtracts 1.
C) if adopt advanced prediction mode, the macro block at current macro place to be the NS macro block to and the border of filtering be the chrominance block border, Bs subtracts 1.
D) if adopt advanced prediction mode, the macro block at current macro place to be the VS macro block to and one of meet the following conditions, Bs subtracts 1.
E) if adopt advanced prediction mode, current border is a horizontal boundary, and the both sides, border be the NS macro block to right with the VS macro block, filtering boundary is the luminance block border, Bs subtracts 1.
2.3Bs equal 4 o'clock boundary filtering process
The value of boundary filtering strength Bs is 4 o'clock, to the computational process following (P0, P1, P2 and Q0, Q1, Q2 are filtered values) of p0, p1, p2 and q0, q1, q2 filtering:
P0＝(p0+((p0+p2)＜＜3)+p2+(q0＜＜3)+(q2＜＜2)+(q2＜＜1)+16)＞＞5
P1＝((p0＜＜3)-p0+(p2＜＜2)+(p2＜＜1)+q0+(q0＜＜1)+8)＞＞4
P2＝((p0＜＜2)+p2+(p2＜＜1)+q0+4)＞＞3
Q0＝(q0+((q0+q2)＜＜3)+q2+(p0＜＜3)+(p2＜＜2)+(p2＜＜1)+16)＞＞5
Q1＝((q0＜＜3)-q0+(q2＜＜2)+(q2＜＜1)+p0+(p0＜＜1)+8)＞＞4
Q2＝((q0＜＜2)+q2+(q2＜＜1)+p0+4)＞＞3。
2.4Bs equal 3 o'clock boundary filtering process
The value of boundary filtering strength Bs is 3 o'clock, to the computational process following (P0, P1 and Q0, Q1 are filtered values) of p0, p1 and q0, q1 filtering:
P0＝(p2+(p1＜＜2)+(p0＜＜2)+(p0＜＜1)+(q0＜＜2)+q1+8)＞＞4
Q0＝(p1+(p0＜＜2)+(q0＜＜2)+(q0＜＜1)+(q1＜＜2)+q2+8)＞＞4
P1＝((p2＜＜1)+p2+(p1＜＜3)+(p0＜＜2)+q0+8)＞＞4
Q1＝((q2＜＜1)+q2+(q1＜＜3)+(q0＜＜2)+p0+8)＞＞4
2.5Bs equal 2 o'clock boundary filtering process
The value of boundary filtering strength Bs is 2 o'clock, to the computational process following (P0 and Q0 are filtered values) of p0 and q0 filtering:
P0＝((p1＜＜1)+p1+(p0＜＜3)+(p0＜＜1)+(q0＜＜1)+q0+8)＞＞4
Q0＝((p0＜＜1)+p0+(q0＜＜3)+(q0＜＜1)+(q1＜＜1)+q1+8)＞＞4。
2.6Bs equal 1 o'clock boundary filtering process
The value of boundary filtering strength Bs is 1 o'clock, to the computational process following (P0 and Q0 are filtered values) of p0 and q0 filtering:
P0＝((p0＜＜1)+p0+q0+2)＞＞2
Q0＝((q0＜＜1)+q0+p0+2)＞＞2。
The present invention has expanded the support of loop filtering to inputting video data bit bit wide dynamic range, enable to adapt to the requirement of more application, and guaranteed compatibility for 8bit input data, and do not increase the amount of calculation of codec simultaneously, obviously do not increase the memory expense yet.
Obviously, the present invention described here can have many variations, and this variation can not be thought and departs from the spirit and scope of the present invention.Therefore, all are included within the covering scope of these claims the conspicuous change of this neighborhood technical staff.
Claims (11)
1. the loop circuit filtering method of an inputting video data comprises the following steps:
The boundary filtering strength of current block and boundary threshold in the computing macro block;
Based on boundary threshold, the current block selectivity with different filtering strengths is carried out boundary filtering;
The step that it is characterized in that the computation bound threshold value comprises according to the bit bit wide of sampling point adjusts boundary threshold.
2. loop circuit filtering method as claimed in claim 1 is characterized in that current block is a luminance block, and the bit bit wide of described sampling point is the bit bit wide BitDepthY of brightness sampling point; Boundary threshold comprises α and β; α and β satisfy following formula:
α＝α’*(1＜＜(BitDepthY-8))
β＝β’*(1＜＜(BitDepthY-8))；
Wherein, α ' and β ' are the boundary threshold under the 8 bit inputting video data loop filterings.
3. loop circuit filtering method as claimed in claim 1 is characterized in that current block is a chrominance block, and the bit bit wide of described sampling point is the bit bit wide BitDepthC of colourity sampling point; Boundary threshold comprises α and β; α and β satisfy following formula:
α＝α’*(1＜＜(BitDepthC-8))
β＝β’*(1＜＜(BitDepthC-8))；
Wherein, α ' and β ' are the boundary threshold under the 8 bit inputting video data loop filterings.
4. loop circuit filtering method as claimed in claim 1 is characterized in that described boundary filtering is a benchmark class loop filtering.
5. loop circuit filtering method as claimed in claim 4 is characterized in that comprising that adjusting filtering based on the bit bit wide of sampling point reduces parameter, and the step that parameter is used for the current block filtering strength is carried out boundary filtering is reduced in filtering.
6. loop circuit filtering method as claimed in claim 4 when it is characterized in that the step that the current block selectivity with different filtering strengths is carried out boundary filtering comprised that the value of boundary filtering strength is low, calculates
Clip1Y(x)＝Clip3(0，(1＜＜BitDepthY)-1，x)
Clip1C(x)＝Clip3(0，(1＜＜BitDepthC)-1，x)
Then, utilize Clip1Y and Clip1C function to boundary filtering;
Wherein, BitDepthY is the bit bit wide of brightness sampling point, and BitDepthC is the bit bit wide of colourity sampling point.
7. loop circuit filtering method as claimed in claim 1 is characterized in that described boundary filtering is to strengthen the class loop filtering; The step of the boundary filtering strength of current block and boundary threshold comprises first computation bound threshold value in the described computing macro block, then based on boundary threshold computation bound filtering strength.
8. loop circuit filtering method as claimed in claim 7 is characterized in that comprising the step to the boundary filtering strength correction.
9. loop circuit filtering method as claimed in claim 7 is characterized in that comprising under given conditions, does not carry out the step of described loop filtering.
10. loop circuit filtering method as claimed in claim 1 is characterized in that described inputting video data is higher than 8 bits.
11. the loop filter of an inputting video data comprises:
The unit of the boundary filtering strength of current block and boundary threshold in the computing macro block;
Based on boundary threshold, the current block selectivity with different filtering strengths is carried out the unit of boundary filtering;
The unit that it is characterized in that the computation bound threshold value comprises the subelement of adjusting boundary threshold according to the bit bit wide of sampling point.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200810240121 CN101754010A (en) | 2008-12-18 | 2008-12-18 | Loop filtering method of video data encoding and filter |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200810240121 CN101754010A (en) | 2008-12-18 | 2008-12-18 | Loop filtering method of video data encoding and filter |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101754010A true CN101754010A (en) | 2010-06-23 |
Family
ID=42480284
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 200810240121 Pending CN101754010A (en) | 2008-12-18 | 2008-12-18 | Loop filtering method of video data encoding and filter |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101754010A (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103491372A (en) * | 2013-09-05 | 2014-01-01 | 复旦大学 | Filtering method of blocking-removing filter suitable for HEVC standard |
| CN103491373A (en) * | 2013-09-06 | 2014-01-01 | 复旦大学 | Four-level stream filtering method of block-removing filter suitable for HEVC standard |
| CN103957425A (en) * | 2014-04-23 | 2014-07-30 | 华为技术有限公司 | Image processing method and system |
| CN106954067A (en) * | 2011-06-30 | 2017-07-14 | 三菱电机株式会社 | Picture coding device and method, picture decoding apparatus and method |
| CN108293111A (en) * | 2015-10-16 | 2018-07-17 | Lg电子株式会社 | For improving the filtering method and device predicted in image encoding system |
| CN108696752A (en) * | 2011-09-20 | 2018-10-23 | Lg 电子株式会社 | Method and apparatus for encoding/decoding image information |
| CN109246429A (en) * | 2011-11-04 | 2019-01-18 | Lg 电子株式会社 | Method and apparatus for encoding/decoding image information |
| CN110024387A (en) * | 2016-11-28 | 2019-07-16 | 日本放送协会 | Code device, decoding apparatus, coding method and coding/decoding method |
| CN112119632A (en) * | 2018-05-17 | 2020-12-22 | 瑞典爱立信有限公司 | Deblocking of implicit transform unit boundaries |
| CN113228646A (en) * | 2018-12-21 | 2021-08-06 | 佳能株式会社 | Adaptive Loop Filtering (ALF) with non-linear clipping |
| CN113287318A (en) * | 2018-11-08 | 2021-08-20 | 瑞典爱立信有限公司 | Asymmetric deblocking in video encoder and/or video decoder |
-
2008
- 2008-12-18 CN CN 200810240121 patent/CN101754010A/en active Pending
Cited By (34)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10863180B2 (en) | 2011-06-30 | 2020-12-08 | Mitsubishi Electric Corporation | Image coding device, image decoding device, image coding method, and image decoding method |
| US11831881B2 (en) | 2011-06-30 | 2023-11-28 | Mitsubishi Electric Corporation | Image coding device, image decoding device, image coding method, and image decoding method |
| US11575906B2 (en) | 2011-06-30 | 2023-02-07 | Mitsubishi Electric Corporation | Image coding device, image decoding device, image coding method, and image decoding method |
| CN106954067A (en) * | 2011-06-30 | 2017-07-14 | 三菱电机株式会社 | Picture coding device and method, picture decoding apparatus and method |
| US10666983B2 (en) | 2011-09-20 | 2020-05-26 | Lg Electronics Inc. | Method and apparatus for encoding/decoding image information |
| CN108989806B (en) * | 2011-09-20 | 2021-07-27 | Lg 电子株式会社 | Method and apparatus for encoding/decoding image information |
| US11172234B2 (en) | 2011-09-20 | 2021-11-09 | Lg Electronics Inc. | Method and apparatus for encoding/decoding image information |
| CN108696752A (en) * | 2011-09-20 | 2018-10-23 | Lg 电子株式会社 | Method and apparatus for encoding/decoding image information |
| CN108696753A (en) * | 2011-09-20 | 2018-10-23 | Lg 电子株式会社 | Method and apparatus for encoding/decoding image information |
| CN108989806A (en) * | 2011-09-20 | 2018-12-11 | Lg 电子株式会社 | Method and apparatus for encoding/decoding image information |
| CN108989803A (en) * | 2011-09-20 | 2018-12-11 | Lg 电子株式会社 | Method and apparatus for encoding/decoding image information |
| CN108696752B (en) * | 2011-09-20 | 2021-07-27 | Lg 电子株式会社 | Method and apparatus for encoding/decoding image information |
| CN108696753B (en) * | 2011-09-20 | 2021-07-27 | Lg 电子株式会社 | Method and apparatus for encoding/decoding image information |
| CN109348224A (en) * | 2011-11-04 | 2019-02-15 | Lg 电子株式会社 | Method and apparatus for encoding/decoding image information |
| CN109547787A (en) * | 2011-11-04 | 2019-03-29 | Lg 电子株式会社 | Method and apparatus for encoding/decoding image information |
| US11350090B2 (en) | 2011-11-04 | 2022-05-31 | Lg Electronics Inc. | Method and apparatus for encoding/decoding image information |
| US11743460B2 (en) | 2011-11-04 | 2023-08-29 | Lg Electronics Inc | Method and apparatus for encoding/decoding image information |
| US10778975B2 (en) | 2011-11-04 | 2020-09-15 | Lg Electronics Inc. | Method and apparatus for encoding/decoding image information |
| CN109246429A (en) * | 2011-11-04 | 2019-01-18 | Lg 电子株式会社 | Method and apparatus for encoding/decoding image information |
| CN109672883A (en) * | 2011-11-04 | 2019-04-23 | Lg 电子株式会社 | Method and apparatus for encoding/decoding image information |
| CN103491372A (en) * | 2013-09-05 | 2014-01-01 | 复旦大学 | Filtering method of blocking-removing filter suitable for HEVC standard |
| CN103491373B (en) * | 2013-09-06 | 2018-04-27 | 复旦大学 | A kind of level Four flowing water filtering method of deblocking filter suitable for HEVC standard |
| CN103491373A (en) * | 2013-09-06 | 2014-01-01 | 复旦大学 | Four-level stream filtering method of block-removing filter suitable for HEVC standard |
| CN103957425A (en) * | 2014-04-23 | 2014-07-30 | 华为技术有限公司 | Image processing method and system |
| CN103957425B (en) * | 2014-04-23 | 2018-01-23 | 华为技术有限公司 | Image processing method and system |
| CN108293111A (en) * | 2015-10-16 | 2018-07-17 | Lg电子株式会社 | For improving the filtering method and device predicted in image encoding system |
| CN108293111B (en) * | 2015-10-16 | 2022-07-08 | Lg电子株式会社 | Filtering method, apparatus and storage medium for improving prediction in image coding system |
| CN110024387B (en) * | 2016-11-28 | 2021-10-08 | 日本放送协会 | Encoding device, decoding device, encoding method, and decoding method |
| CN110024387A (en) * | 2016-11-28 | 2019-07-16 | 日本放送协会 | Code device, decoding apparatus, coding method and coding/decoding method |
| CN112119632A (en) * | 2018-05-17 | 2020-12-22 | 瑞典爱立信有限公司 | Deblocking of implicit transform unit boundaries |
| CN113287318A (en) * | 2018-11-08 | 2021-08-20 | 瑞典爱立信有限公司 | Asymmetric deblocking in video encoder and/or video decoder |
| US12003785B2 (en) | 2018-11-08 | 2024-06-04 | Telefonaktiebolaget Lm Ericsson (Publ) | Asymmetric deblocking in a video encoder and/or video decoder |
| CN113228646A (en) * | 2018-12-21 | 2021-08-06 | 佳能株式会社 | Adaptive Loop Filtering (ALF) with non-linear clipping |
| CN113228646B (en) * | 2018-12-21 | 2024-04-05 | 佳能株式会社 | Adaptive Loop Filtering (ALF) with nonlinear clipping |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101754010A (en) | Loop filtering method of video data encoding and filter | |
| CN101389016B (en) | Method and device for obtaining boundary strength and removing block effect | |
| EP2938075B1 (en) | Deblocking filtering | |
| US9942574B2 (en) | Deblocking filtering | |
| CN110024387B (en) | Encoding device, decoding device, encoding method, and decoding method | |
| CN101321277A (en) | Method and apparatus for removing block effect | |
| CN106131555B (en) | De-blocking filtering device method and device | |
| CN101267560A (en) | Block-removal filtering method and device | |
| EP2870758B1 (en) | Controlling deblocking filtering | |
| WO2020183849A1 (en) | Information processing device, information processing method, and program | |
| US20200394760A1 (en) | Image adjustment method and associated image processing circuit | |
| EP1549075A2 (en) | Method of reducing block and mosquito noise (effect) in images | |
| CN104219520A (en) | Method and device for determining image compensation modes | |
| CN107155109A (en) | The filtering method and device of a kind of frame of video | |
| CN114125445A (en) | Decoding method, device, equipment and machine readable storage medium | |
| JP4380498B2 (en) | Block distortion reduction device | |
| US11758192B2 (en) | Method and apparatus for adaptively processing video samples in a video signal frame | |
| CN107172423B (en) | A kind of method and device that video frame is filtered | |
| US7844124B2 (en) | Method of estimating a quantization parameter | |
| Chou et al. | A hardware sharing architecture of deblocking filter for vp8 and h. 264/avc video coding | |
| CN101459755A (en) | Visual processing device | |
| CN116471406A (en) | Mosaic phenomenon weakening method based on just noticeable distortion | |
| CN103634609A (en) | Method and system for carrying out deblocking filtering on coding macro-block |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20100623 |