Abstract:
Deblocking filters are disclosed, where the nature of the filter is determined based upon the level of detail of a reconstructed video frame in the region in which the block boundary is located. One embodiment of the method of the invention includes identifying a boundary between two blocks of the reconstructed video frame, determining the level of detail of the reconstructed video frame in a region in which the block boundary is located, wherein the region includes pixels from multiple rows and multiple columns of the reconstructed video frame and includes at least one pixel that is not immediately adjacent the block boundary and selecting a filter to apply to predetermined pixels on either side of the block boundary based upon the determined level of detail.

Description:
CROSS-REFERENCE TO RELATED APPLICATION(S)  
       [0001]     This application claims the benefit of U.S. Provisional Patent Application No. 60/611,513, filed Sep. 20, 2004, the contents of which are expressly incorporated herein by reference in its entirety. 
     
    
     BACKGROUND  
       [0002]     The present invention relates to video compression and in particular to methods of deblocking compressed video.  
         [0003]     Digital video sequences are composed of frames of pixels, where the characteristics of the pixels are represented using digital information. The amount of data that is required to represent a video sequence can be reduced using compression. Several compression schemes seek to utilize characteristics that commonly occur within video sequences to achieve significant reductions in the amount of digital data required to encode a video sequence.  
         [0004]     Encoding schemes, such as the scheme described in the MPEG-4 standard, can include video compression algorithms that divide frames into blocks of pixels and use the characteristics of the pixels within the blocks to encode the blocks of the video frame. Treating adjacent blocks separately in a lossy compression scheme can result in artifacts at block boundaries when an encoded video frame is reconstructed. A technique that can be used to remove artifacts and improve the quality of a reconstructed image involves applying a deblocking filter to pixels adjacent block boundaries.  
         [0005]     The MPEG-4 standard developed by the Motion Picture Experts Group (i.e. ISO/IEC 14496) contains an example of a deblocking filter that can be applied when reconstructing video encoded using an MPEG-4 compliant encoder. The disclosure of the MPEG-4 standard is incorporated herein by reference in its entirety. The filtering is typically performed by a decoder and the filter is applied along the edges of the 8×8 blocks of pixels that were used in the encoding of the video frame. In many instances, the deblocking filter is applied to both luminance and chrominance data.  
         [0006]     The deblocking filter specified in the MPEG-4 standard can operate in one of two modes. The modes are commonly referred to as the “DC offset mode” and “the default mode”. The pixel conditions around each block boundary determine which mode to use. The “DC offset mode” is typically selected to filter block boundaries that are located within very smooth regions of a video frame (i.e. a region without much detail). The default mode is typically selected for all other cases. The term “smooth” describes a region of a video frame where the chrominance and luminance either do not vary or vary gradually across adjacent pixels. The term “detail” is typically used to describe visual elements of a video frame that vary significantly across adjacent pixels. The appearance of a reconstructed image usually can be improved by applying a filter that smoothes variation across block boundaries that lie in smooth regions of the image. However, smoothing a block boundary that lies in a region possessing a high level of detail can actually detract from the appearance of the reconstructed frame.  
         [0007]     The decoding process specified in the MPEG-4 standard involves applying the MPEG-4 deblocking filter to each row of pixels at vertical block boundaries and each column of pixels at horizontal block boundaries. The application of the deblocking filter in relation to each row or column of pixels involves a decision concerning which filter mode is most appropriate. In order to determine the filtering mode to use, the decoder inspects five pixels of the row or column on either side of the block boundary. The following filter mode decision algorithm is then applied using the chrominance or luminance values of ten pixels v 0 -v 9 : 
 
 eq   —   cnt =φ( v   0   −v   1 )+φ( v   1   −v   2 )+φ( v   2   −v   3 )+φ( v   3   −v   4 )+φ( v   4   −v   5 )+φ( v   5   −v   6 )+φ( v   6   −v   7 )+φ( v   7   −v   8 )+φ( v   8   −v   9 ), 
 
where φ(γ)=1 if |γ|≦THR 1  and 0 otherwise. 
 
         [0008]     If (eq_cnt≦THR 2 ) 
        DC offset mode is applied, else     Default mode is applied.        
 
         [0011]     The threshold values THR 1  and THR 2  can be determined based upon the desired quality of the visual image. Suitable values for the thresholds are THR 1 =2 and THR 2 =6.  
         [0012]     The “DC offset mode” of the deblocking filter is specified in the MPEG-4 standard and is intended to reduce blocking artifacts due to dc offset in very smooth regions of an image. The filter that is applied to the chrominance or luminance values of the four pixels on either side of a block boundary (i.e. v 1 -v 8 ) in “DC offset mode” as follows  
                                                                                 max = MAX (v 1 , v 2 , v 3 , v 4 , v 5 , v 6 , v 7 , v 8 ),           min = MIN (v 1 , v 2 , v 3 , v 4 , v 5 , v 6 , v 7 , v 8 ),           if ( |max−min| &lt; 2·QP ) {                                                    v   n   ′     =       ∑     k   =     -   4       4     ⁢       b   k     ·     p     n   +   k             ,     1   ≤   n   ≤   8                                           p   m     =     {                 (              v   1     -     v   0            &lt;   QP     )     ?           ⁢     v   0       ⁢     :     ⁢     v   1       ,             if   ⁢           ⁢   m     &lt;   1                 v   m     ,             if   ⁢           ⁢   1     ≤   m   ≤   8                     (              v   8     -     v   9            &lt;   QP     )     ?           ⁢     v   9       ⁢     :     ⁢     v   8       ,             if   ⁢           ⁢   m     &gt;   8                                         {b k  :− 4 ≦ k ≦ 4} = {1,1,2,2,4,2,2,1,1}//16                }           else                No change will be done.                      
 
         [0013]     where 
        QP is the average of the quantizers used in the encoding of the two blocks        
 
         [0015]     The “default mode” of the deblocking filter is also specified in the MPEG-4 standard and involves replacing the two pixels adjacent the block boundary (i.e. v 4  and v 5 ) as follows: 
 
 v   4   ′=v   4   −d,  
 
 v   5   ′=v   5   +d,  
 
and 
 
 d =CLIP(5·( a   3,0   ′−a   3,0 )// 8, 0, (   v   4   −v   5 )/2)·δ(| a   3,0   |&lt;QP  ) 
 
where  a   3,0 ′=SIGN( a   3,0 )·MIN(| a   3,0   |, |a   3,1   |, |a   3,2 |). 
 
         [0016]     Frequency components a 3,0 , a 3,1 , and a 3,2  can be evaluated from the simple inner product of the approximated DCT kernel [2−5 5−2] with the pixel vectors as follows: 
 
 a   3,0 =([2−5 5−2] ∘ [ v   3    v   4    v   5    v   6 ] T )//8, 
 
 a   3,1 =([2−5 5−2] ∘ [ v   1    v   2    v   3    v   4 ] T )//8, 
 
 a   3,2 =([2−5 5−2] ∘ [ v   5    v   6    v   7    v   8 ] T )//8. 
 
         [0017]     The algorithm used in the “default mode” of the deblocking filter described in the MPEG-4 standard can involve complex calculations including 4-tap filtering and clipping.  
       SUMMARY OF THE INVENTION  
       [0018]     Embodiments of the present invention include deblocking filters and methods of applying deblocking filters. In one embodiment of the invention, the characteristics of the deblocking filter are determined based upon the relative level of smoothness or detail in the region of a reconstructed video frame in which a block boundary is located. In many embodiments, the level of detail of a region is ascertained by inspecting a set of pixels including pixels from multiple rows and columns and at least one pixel that is not adjacent the block boundary. In several embodiments, the set of pixels is a block of pixels divided by the block boundary. In numerous embodiments, the characteristics of the filter can be further determined by the level of detail of the image in the region of the pixels being filtered.  
         [0019]     One embodiment of the method of the invention includes identifying a boundary between two blocks of the reconstructed video frame, determining the level of detail of the reconstructed video frame in a region in which the block boundary is located, where the region includes pixels from multiple rows and multiple columns of the reconstructed video frame and includes at least one pixel that is not immediately adjacent the block boundary, and selecting a filter to apply to predetermined pixels on either side of the block boundary based upon the determined level of detail.  
         [0020]     In a further embodiment, the determination of the level of detail of the reconstructed video frame in a region in which the block boundary is located further includes taking the sum of the absolute difference of at least some of the pixels within a set of pixels surrounding the block boundary.  
         [0021]     In another embodiment the block boundary is a horizontal block boundary and the set of pixels is a block of pixels that is divided by the horizontal block boundary. In addition, the sum of the absolute difference is taken for each vertically adjacent pair of pixels in each column of the block of pixels, except the pair of pixels that are separated by the block boundary.  
         [0022]     In a still further embodiment, the set of pixels is an 8×8 block that is evenly divided by the horizontal block boundary.  
         [0023]     In still another embodiment, the determination of the level of detail involves calculating the following sum:  
           ∑   i     ⁢       ∑   j     ⁢            v       i   +   1     ,   j       -     v     i   ,   j                  ,       where   ⁢           ⁢   i     =       1   ⁢           ⁢   to   ⁢           ⁢   7   ⁢           ⁢   and   ⁢           ⁢   i     ≠   4       ,     j   =     1   ⁢           ⁢   to   ⁢           ⁢   8.           
 
         [0024]     where: 
        v i,j  is the chrominance of a pixel in row i and column j of the 8×8 block of pixels.        
 
         [0026]     In a yet further embodiment, the determination of the level of detail involves calculating the following sum:  
           ∑   i     ⁢       ∑   j     ⁢            v       i   +   1     ,   j       -     v     i   ,   j                  ,       where   ⁢           ⁢   i     =       1   ⁢           ⁢   to   ⁢           ⁢   7   ⁢           ⁢   and   ⁢           ⁢   i     ≠   4       ,     j   =     1   ⁢           ⁢   to   ⁢           ⁢   8.           
 
         [0027]     where: 
        v i,j  is the luminance of a pixel in row i and column j of the 8×8 block of pixels.        
 
         [0029]     In yet another embodiment, the set of pixels is a 4×8 block that is evenly divided by the horizontal block boundary.  
         [0030]     In a further embodiment again, the determination of the level of detail involves calculating the following sum:  
           ∑   i     ⁢       ∑   j     ⁢            v       i   +   1     ,   j       -     v     i   ,   j                  ,       where   ⁢           ⁢   i     =       1   ⁢           ⁢   to   ⁢           ⁢   7   ⁢           ⁢   and   ⁢           ⁢   i     ≠   4       ,     j   =     1   ⁢           ⁢   to   ⁢           ⁢   4.           
 
         [0031]     where: 
        v i,j  is the chrominance of a pixel in row i and column j of the 4×8 block of pixels.        
 
         [0033]     In another embodiment again, the determination of the level of detail involves calculating the following sum:  
           ∑   i     ⁢       ∑   j     ⁢            v       i   +   1     ,   j       -     v     i   ,   j                  ,       where   ⁢           ⁢   i     =       1   ⁢           ⁢   to   ⁢           ⁢   7   ⁢           ⁢   and   ⁢           ⁢   i     ≠   4       ,     j   =     1   ⁢           ⁢   to   ⁢           ⁢   4.           
 
         [0034]     where: 
        v i,j  is the luminance of a pixel in row i and column j of the 4×8 block of pixels.        
 
         [0036]     In a still further embodiment again, the block boundary is a vertical block boundary, the set of pixels is a block of pixels that is divided by the vertical block boundary and the sum of the absolute difference is taken for each adjacent pair of pixels in each row of the block of pixels, except the pair of pixels that are separated by the block boundary.  
         [0037]     In still another embodiment again, the set of pixels is an 8×8 block that is evenly divided by the vertical block boundary.  
         [0038]     In a yet further embodiment again, the determination of the level of detail involves calculating the following sum:  
           ∑   i     ⁢       ∑   j     ⁢            v     i   ,     j   +   1         -     v     i   ,   j                  ,       where   ⁢           ⁢   i     =     1   ⁢           ⁢   to   ⁢           ⁢   8       ,     j   =       1   ⁢           ⁢   to   ⁢           ⁢   7   ⁢           ⁢   and   ⁢           ⁢   j     ≠   4.           
 
         [0039]     where: 
        v i,j  is the chrominance of a pixel in row i and column j of the 8×8 block of pixels.        
 
         [0041]     In yet another embodiment again the determination of the level of detail involves calculating the following sum:  
           ∑   i     ⁢       ∑   j     ⁢            v     i   ,     j   +   1         -     v     i   ,   j                  ,       where   ⁢           ⁢   i     =     1   ⁢           ⁢   to   ⁢           ⁢   8       ,     j   =       1   ⁢           ⁢   to   ⁢           ⁢   7   ⁢           ⁢   and   ⁢           ⁢   j     ≠   4.           
 
         [0042]     where: 
        v i,j  is the luminance of a pixel in row i and column j of the 8×8 block of pixels.        
 
         [0044]     In a yet further additional embodiment, the set of pixels is an 8×4 block that is evenly divided by the vertical block boundary.  
         [0045]     In yet another additional embodiment, the determination of the level of detail involves calculating the following sum:  
           ∑   i     ⁢       ∑   j     ⁢            v     i   ,     j   +   1         -     v     i   ,   j                  ,       where   ⁢           ⁢   i     =     1   ⁢           ⁢   to   ⁢           ⁢   4       ⁢           ,     j   =       1   ⁢           ⁢   to   ⁢           ⁢   7   ⁢           ⁢   and   ⁢           ⁢   j     ≠   4.           
 
         [0046]     where: 
        v i,j  is the chrominance of a pixel in row i and column j of the 8×4 block of pixels.        
 
         [0048]     In a still further additional embodiment the determination of the level of detail involves calculating the following sum:  
           ∑   i     ⁢       ∑   j     ⁢            v     i   ,     j   +   1         -     v     i   ,   j                  ,       where   ⁢           ⁢   i     =     1   ⁢           ⁢   to   ⁢           ⁢   4       ⁢           ,     j   =       1   ⁢           ⁢   to   ⁢           ⁢   7   ⁢           ⁢   and   ⁢           ⁢   j     ≠   4.           
 
         [0049]     where: 
        v i,j  is the luminance of a pixel in row i and column j of the 8×4 block of pixels.        
 
         [0051]     In still another additional embodiment, selecting a filter to apply to predetermined pixels on either side of the block boundary based upon the determination of the level of detail includes comparing the determined level of detail to a threshold.  
         [0052]     In a yet further additional embodiment again, the threshold varies depending upon the quantizer used in the encoding of the blocks at the block boundary.  
         [0053]     In yet another additional embodiment again, selecting a filter to apply to predetermined pixels on either side of the block boundary based upon the determination of the level of detail further includes when the level of detail exceeds the threshold, selecting a filter to apply to predetermined pixels. In addition, selection of a filter includes determining the detail of the image in the region of the pixels being filtered.  
         [0054]     In a still further additional embodiment again, the block boundary is a horizontal block boundary and determining the detail of the image in the region of the pixels being filtered includes calculating the following expression with respect to a column of pixels divided by the horizontal block boundary: 
 
(|v −2 −v −1 |*3+|v −1 −v 1 |*2+|v 1 −v 2 |*3)//8 
 
         [0055]     where:  
         [0056]     v i  is the chrominance of the pixel i pixels from the horizontal block boundary.  
         [0057]     In still another additional embodiment again, the block boundary is a horizontal block boundary and determining the detail of the image in the region of the pixels being filtered includes calculating the following expression with respect to a column of pixels divided by the horizontal block boundary: 
 
(|v −2 −v −1 |*3+|v −1 −v 1 |*2+|v 1 −v 2 |*3)//8 
 
         [0058]     where: 
        v i  is the luminance of the pixel i pixels from the horizontal block boundary.        
 
         [0060]     In still another further embodiment, the block boundary is a vertical block boundary and determining the detail of the image in the region of the pixels being filtered includes calculating the following expression with respect to a row of pixels divided by the vertical block boundary: 
 
(|v −2 −v −1 |*3+|v −1 −v 1 |*2+|v 1 −v 2 |*3)//8 
 
         [0061]     where: 
        v i  is the chrominance of the pixel i pixels from the vertical block boundary.        
 
         [0063]     In still another further embodiment, the block boundary is a vertical block boundary and determining of the detail of the image in the region of the pixels being filtered includes calculating the following expression with respect to a row of pixels divided by the vertical block boundary: 
 
(|v −2 −v −1 |*3+|v −1 −v 1 |*2+|v 1 −v 2 |*3)//8 
 
         [0064]     where: 
        v i  is the luminance of the pixel i pixels from the vertical block boundary.        
 
         [0066]     In still another further embodiment again, selecting a filter to apply to each pixel on either side of the block boundary further includes comparing the determined level of detail in the region of the pixels being filtered to a first threshold and applying a first filter when the level of detail is less than the threshold.  
         [0067]     In yet another further embodiment again, the first threshold varies with respect to the value of the quantizer used in the encoding of each of the blocks at the block boundary.  
         [0068]     In still another further additional embodiment, selecting a filter to apply to each pixel on either side of the block boundary further includes comparing the determined level of detail in the region of the pixels being filtered to a second threshold and applying a second filter when the level of detail exceeds the first threshold and is less than the second threshold.  
         [0069]     In yet another further additional embodiment, selecting a filter to apply to each pixel on either side of the block boundary further includes applying the following filter when the level of detail is less than the first threshold: 
 
 v   −1 ′=([4 9 3 ]·[v   −2    v   −1    v   1 ] T )//16 
 
 v   1 ′=([4 9 3 ] ·v   2    v   1    v   −1 ] T )//16 
 
         [0070]     applying the following filter when the level of detail exceeds the first threshold and is less than the second threshold: 
 
 v   −1 ′=([3 11 2 ]·[v   −2    v   −1    v   1 ] T )//16 
 
 v   1 ′=([3 11 2 ]·[v   2    v   1    v   −1 ] T )//16 
 
 else applying the following filter: 
 
 v   −1   ′=v   −1  
 
v 1 ′=v 1  
 
         [0071]     where v i  is the chrominance of a pixel displaced i pixels from the block boundary.  
         [0072]     In still another further additional embodiment again, selecting a filter to apply to each pixel on either side of the block boundary further includes applying the following filter when the level of detail is less than the first threshold: 
 
 v   −1 ′=([4 9 3 ]·[v   −2    v   −1    v   1 ] T )//16 
 
 v   1 ′=([4 9 3 ]·[v   2    v   1    v   −1 ] T )//16 
 
         [0073]     applying the following filter when the level of detail exceeds the first threshold and is less than the second threshold: 
 
 v   −1 ′=([3 11 2 ]·[v   −2    v   −1    v   1 ] T )//16 
 
 v   1 ′=([3 11 2 ]·[v   2    v   1    v   −1 ] T )//16 
 
         [0074]     else applying the following filter 
 
 v   −1   ′=v   −1  
 
v 1 =v 1  
 
         [0075]     where v i  is the luminance of a pixel displaced i pixels from the block boundary.  
         [0076]     An embodiment of the apparatus of the invention includes a 3-tap filter. In addition, the inputs to the 3-tap filter include the chrominance of three pixels, the 3-tap filter is configured to increase the weighting to the second input with increased variation between a set of pixels including at least the three pixels provided to the inputs and the 3-tap filter is configured to decease the weighting to the first and third inputs with increased variation between the set of pixels including at least the three pixels provided to the inputs.  
         [0077]     In a further embodiment, the set of pixels including at least the three pixels provided to the inputs further includes a fourth pixel, where the 3-tap filter is configured to determine the variation between the pixels by taking a weighted absolute sum of the difference between the chrominance of the pixels.  
         [0078]     In another embodiment, the 3-tap filter is configured to calculate: 
 
(|v 1 −v 2 |*3+|v 2 −v 3 |*2+|v 3 −v 4 |*3)//8 
 
         [0079]     wherein 
        v i  is the chrominance of the ith pixel.        
 
         [0081]     In a further embodiment again, the weightings of the 3-tap filter are asymmetric with respect to the second input.  
         [0082]     Another embodiment again includes a 3-tap filter. In addition, the inputs to the 3-tap filter include the luminance of three pixels, the 3-tap filter is configured to increase the weighting to the second input with increased variation between a set of pixels including at least the three pixels provided to the inputs and the 3-tap filter is configured to decease the weighting to the first and third inputs with increased variation between the set of pixels including at least the three pixels provided to the inputs.  
         [0083]     In a still further embodiment, the set of pixels including at least the three pixels provided to the inputs further involves a fourth pixel and the 3-tap filter is configured to determine the variation between the pixels by taking a weighted absolute sum of the difference between the luminance of the pixels.  
         [0084]     In still another embodiment, the 3-tap filter is configured to calculate: 
 
(|v 1 −v 2 |*3+|v 2 −v 3 |*2+|v 3 −v 4 |*3)//8 
 
         [0085]     wherein 
        v i  is the luminance of the ith pixel.        
 
         [0087]     In a yet further embodiment, the weightings of the 3-tap filter are asymmetric with respect to the second input. 
     
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0088]      FIG. 1  is a schematic view a video frame reconstructed from video data obtained using an encoding scheme that utilizes the characteristics of 8×8 pixel blocks;  
         [0089]      FIG. 2  is a flow chart showing a process for filtering block boundaries of a reconstructed video frame in accordance with an embodiment of the invention;  
         [0090]      FIG. 3  is a schematic view of a block of pixels used to determine an appropriate filter to apply to a horizontal block boundary in accordance with an embodiment of the invention; and  
         [0091]      FIG. 4  is a schematic view of a block of pixels used to determine the filtering applied to a vertical block boundary in accordance with an embodiment of the invention. 
     
    
     DETAILED DESCRIPTION OF THE INVENTION  
       [0092]     Turning now to the drawings, a deblocking scheme is illustrated that applies varying levels of smoothing to edge boundaries based upon the level of detail of a video frame in a region surrounding the block boundary. In many embodiments, the decision concerning the specific characteristics of the filter applied to the pixels adjacent a block boundary is made by analyzing the characteristics of a set of pixels, including pixels from multiple rows and multiple columns, lying on either side of the boundary. Once the level of detail of the set of pixels has been determined, a filter appropriate to the level of detail can be applied to the pixels adjacent the boundary.  
         [0093]     A portion of a reconstructed video frame is represented in  FIG. 1 . The video frame  10  is made up of a number of pixels  12 . In the illustrated embodiment, the video frame was reconstructed from data encoded using the characteristics of blocks of pixels. The horizontal boundaries  14  and vertical boundaries  16  between the reconstructed blocks of pixels are shown in  FIG. 1 . In the illustrated embodiment, the blocks are of 8×8 pixels. In other embodiments, the block can include a greater or lesser number of pixels with a different number of pixels in the horizontal and/or vertical dimensions. A deblocking filter in accordance with an embodiment of the present invention can be applied to the pixels along the horizontal and vertical block boundaries to improve the visual appearance of the video frame.  
         [0094]     A process for applying a deblocking filter in accordance with an embodiment of the present invention is shown in  FIG. 2 . The process  20  involves identifying ( 22 ) the location of horizontal and vertical block boundaries. The level of detail of the region of the video frame in which the block boundary is located is then determined ( 24 ). If the process determines ( 26 ) that a boundary lies in a smooth region of the reconstructed image, then a smoothing filter can be applied ( 28 ) to the pixels adjacent the boundary. When the boundary lies within a region possessing a threshold level of detail, a filter appropriate to the level of detail can be applied ( 30 ) to the pixels along the horizontal or vertical boundary. As will be discussed further below a first deblocking filter can be applied to pixel chrominance and/or a second deblocking filter can be applied to pixel luminance. In many embodiments, the same techniques can be used to determine the characteristics of the first and second filters that are applied to pixel chrominance and/or luminance.  
         [0095]     Many embodiments of deblocking filters in accordance with the present invention use sets of pixels that include pixels from multiple rows and multiple columns including pixels that are not adjacent the boundary to determine whether a boundary lies within a region of the image that is smooth or a region that contains significant levels of detail. Pixels that can be used to determine whether a horizontal boundary lies within a smooth region of a reconstructed video frame in accordance with an embodiment of the invention are illustrated in  FIG. 3 . The set of pixels  40  includes pixels from multiple rows and multiple columns. In the illustrated embodiment, the set of pixels  40  is an 8×8 block that is divided in half by the horizontal boundary  14 . In other embodiments, the dimensions of the set of pixels can vary.  
         [0096]     In the illustrated embodiment, each pixel in the set of pixels used to determine the level of detail of the region of the image in which the boundary lies is indicated using the notation v i,j  where i and j represent the position of the pixel with respect to the top left hand corner of the 8×8 set of pixels. When applying a deblocking filter to pixel chrominance v i,j  can be the value of the pixels chrominance. When applying a deblocking filter to pixel luminance v i,j  can be the value of the pixel luminance.  
         [0097]     In several embodiments, the level of detail of a set of pixels can be determined by taking the sum of the absolute difference of adjacent pixels in the set of pixels. When determining the level of detail in the chrominance or luminance using a sum of the absolute difference in the chrominance or luminance of pixels, the absolute difference of pixels separated by a block barely is often excluded from the calculation. The absolute difference of pixels separated by a block boundary can be excluded, because the absolute difference of these pixels can often be more reflective of the differences in the values of the quantizer used to encode the adjacent blocks of the video frame than the level of detail of the image in that region. In the case of a horizontal block boundary  14 , many embodiments take the sum of the absolute difference of each vertically adjacent pair of pixels in each column of the set of pixels except the pair of pixels that are separated by the block boundary. In the case of a vertical block boundary  16 , many embodiments take the sum of the absolute difference of each horizontally adjacent pair of pixels in each row of the set of pixels except the pair of pixels that are separated by the block boundary.  
         [0098]     In one embodiment, the relative smoothness of the region in which a horizontal block boundary is located can be determined in accordance with the following algorithm:  
         sum_SAD   =       ∑   i     ⁢       ∑   j     ⁢            v       i   +   1     ,   j       -     v     i   ,   j                    ,     
     ⁢       where   ⁢           ⁢   i     =       1   ⁢           ⁢   to   ⁢           ⁢   7   ⁢           ⁢   and   ⁢           ⁢   i     ≠   4       ,     j   =     1   ⁢           ⁢   to   ⁢           ⁢   8.           
 
         [0099]     if (sum_SAD≦THR(QP)*2 
        boundary lies within a relatively smooth region, else     boundary lies within a relatively detailed region.        
 
         [0102]     where 
        THR(QP) is a threshold adaptive to QP     QP is the average value of the quantizer for the two 8×8 blocks on each side of the block boundary.        
 
         [0105]     In one embodiment, the threshold values that are used for each QP are as listed in Table 1.  
                                           TABLE 1                           THR(QP) as a function of QP                QP   THR(QP)                            1   10           2   12           3   15           4   18           5   21           6   23           7   25           8   27           9   29           10   31           11   33           12   35           13   37           14   39           15   41           16   43           17   45           18   47           19   49           20   51           21   52           22   53           23   54           24   55           25   56           26   57           27   59           28   61           29   63           30   65           31   68                      
 
         [0106]     In other embodiments, other values for THR(QP) with respect to QP can be used based upon the relative image quality resulting from the application of various filters to the pixels along the boundary. In addition, the value of QP can be determined in other ways. In one embodiment, QP is determined as the average of the quantizer values for each block in the video frame. In a further embodiment, the value of QP is determined as the value of the quantizer used to encode one of the blocks adjacent the block boundary. In other embodiments, QP can be determined in a variety of ways that are indicate of values of the quantizer used in the encoding of the video frame.  
         [0107]     In many embodiments, a determination that the boundary lies within a region of the image that is smooth (e.g. sum_SAD≦THR(QP)*2) results in the application of a filter possessing characteristics similar to the deblocking filter specified in the MPEG-4 standard, when operating in “DC offset mode”. In other embodiments, other smoothing filters can be applied. In a number of embodiments, a determination that a boundary lies within a region of an image that is relatively detailed (e.g. sum_SAD&gt;THR(QP)*2) can result in the application of a filter appropriate to the level of detail. Embodiments of filters in accordance with the present invention that are appropriate in instances where a block boundary lies in a region possessing a comparatively high level of detail are discussed below.  
         [0108]     When a reconstructed image includes a boundary that lies within a detailed region of the image, the quality of the image can be improved by applying a level of filtering appropriate to the level of detail. In one embodiment, the amount of smoothing applied by a deblocking filter along a block boundary is inversely proportional to the level of detail of the image in the region being filtered.  
         [0109]     In several embodiments, the filter applied is determined based upon the level of detail of the portion of the image represented by the pixels to which the filter is to be applied. In one embodiment, the filter is applied to pixels from a single row or column that are adjacent the block boundary. In a further embodiment, the filter is applied to the two pixels on either side of the block boundary and the level of detail of the portion of the image represented by these four pixels is obtained using the following expression: 
 
var=(| v   3,j   −v   4,j |*3 +|v   4,j   −v   5,j |*2 +|v   5,j   −v   6,j |*3)//8 
 
         [0110]     Using a simple 3-tap low pass filter, a deblocking filter in accordance with an embodiment of the present invention can be created that tailors to the level of detail in accordance with the following algorithm: 
 
if (var≦ THR   — 1( QP )) 
 
 v   4,j ′=([4 9 3 ] ∘ [v   3,j    v   4,j    v   5,j ] T )//16 
 
 v   5,j ′=([4 9 3 ] ∘ [v   6,j    v   5,j    v   4,j ] T )//16 
 
else if (var≦ THR   — 2( QP )) 
 
 v   4,j ′=([3 11 2 ]·[v   3,j    v   4,j    v   5,j ] T )//16 
 
 v   5,j ′=([3 11 2 ]·[v   6,j    v   5,j    v   4,j ] T )//16 
 
else 
 
v 4,j ′=v 4,j  
 
v 5,j ′=v 5,j  
 
         [0111]     where 
        THR_ 1 (QP) and THR_ 2 (QP) represent various thresholds in the level of detail and are adaptive with respect to QP     QP is the average value of the quantizer for the two 8×8 blocks on each side of the block boundary        
 
         [0114]     In one embodiment, the threshold values for each QP are the values shown in Table 2.  
                                           TABLE 2                           values of THR_1 and THR_2 with respect to QP            QP   THR_1(QP)   THR_2(QP)                    1   1   2       2   1   3       3   2   5       4   2   6       5   3   8       6   4   9       7   5   10       8   5   11       9   6   12       10   6   13       11   7   14       12   7   15       13   8   16       14   8   17       15   9   18       16   9   19       17   10   20       18   10   21       19   11   22       20   11   23       21   12   24       22   12   25       23   13   26       24   13   27       25   14   28       26   14   30       27   15   32       28   15   34       29   16   36       30   16   38       31   17   40                  
 
         [0115]     In the embodiment described above, the deblocking filter applies the greatest amount of smoothing when the level of detail is less than the first threshold (i.e. var≦THR_ 1 (QP)). A decreased amount of smoothing is applied when the level of detail is between the first and second thresholds (i.e. THR_ 1  (QP)&lt;var≦THR_ 2 (QP)) and the deblocking filter does not apply any smoothing to the pixels when the level of detail exceeds the second threshold (i.e. var&gt;THR_ 2 (QP)).  
         [0116]     In other embodiments, other values for THR_ 1 (QP) and THR_ 2 (QP) can be used that are determined based upon observation of the image quality subsequent to the application of the deblocking filter to the reconstructed image. As discussed above, other embodiments of deblocking filters in accordance with the present invention derive QP in other ways that are indicative of the values of the quantizers used to encode the blocks of the reconstructed video frame.  
         [0117]     Although the above embodiment uses two thresholds to determine the level of smoothing to be applied by the deblocking filter to pixels adjacent a block boundary located in a detailed region of an image, many embodiments use the same level of smoothing for all pixels adjacent block boundaries located within relatively detailed regions of an image. Alternatively, embodiments of deblocking filters in accordance with the present invention can include a single threshold or more than two thresholds to determine the appropriate filter to apply.  
         [0118]     In many embodiments, a 3-tap filter is used that increases the weighting provided to the 2 nd  filter input as the level of detail of the portion of the image represented by the pixels being filtered increases. In addition, several embodiments decrease the weighting provided to the 1 st  and 3 rd  inputs of the 3-tap filter as the level of detail of the portion of the image represented by the pixels being filtered increases. Furthermore, numerous embodiments of 3-tap filters in accordance with the present invention are asymmetric with respect to pixel being filtered. In many instances, use of asymmetric weightings in accordance with embodiments of the present invention can reduce translation distortions that may result from filtering across a block boundary.  
         [0119]     In many embodiments, a similar technique is used to smooth vertical block boundaries as is used to smooth horizontal block boundaries. In other embodiments, the technique used to determine the level of detail of the region of an image in which a vertical block boundary lies need not correspond to the technique used to determine the level of detail of the region of the image in which a horizontal block boundary lies.  
         [0120]     A set of pixels that can be used to determine whether a vertical block boundary lies within a relatively smooth region of an image or a relatively detailed region of an image is shown in  FIG. 4 . The set  50  forms an 8×4 block of pixels  12  that includes four pixels on either side of the vertical block boundary  16 . As discussed above other sets of pixels possessing greater or smaller dimensions can also be used.  
         [0121]     In one embodiment, a determination of whether the vertical block boundary  16  lies within a relatively smooth region or relatively detailed region involves analyzing the pixels within this 8×4 block as follows:  
         sum_SAD   =       ∑   i     ⁢       ∑   j     ⁢            v     i   ,   j       -     v     i   ,     j   +   1                      ,     
     ⁢       where   ⁢           ⁢   i     =     1   ⁢           ⁢   to   ⁢           ⁢   4       ,     j   =       1   ⁢           ⁢   to   ⁢           ⁢   7   ⁢           ⁢   and   ⁢           ⁢   j     ≠   4           
 
         [0122]     if (sum_SAD≦THR(QP) 
        block boundary lies in relatively smooth region, else     block boundary lies in relatively detailed region.        
 
         [0125]     where 
        THR(QP) is a threshold adaptive to QP     QP is the average value of the quantizer for the two 8×8 blocks on each side of the block boundary.        
 
         [0128]     In one embodiment, the threshold values that are used for each QP are as listed in Table 1 above. In other embodiments, other values can be used based upon the relative image quality resulting from the application of various filters to the pixels along the boundary.  
         [0129]     Once a determination has been made as to whether the block boundary lies in a relatively smooth region or a relatively detailed region, deblocking filters similar to those described above with respect to the filtering of horizontal block boundaries can be used to filter the pixels along the vertical boundary in accordance with an embodiment of the invention. In other embodiments, other suitable deblocking filters can be applied. Furthermore, although the above description relates to vertical boundaries the same techniques can be applied in accordance with embodiments of the present invention to the use of 4×8 blocks for determining the level of detail of an image surrounding a horizontal boundary.  
         [0130]     While the above description contains many specific embodiments of the invention, these should not be construed as limitations on the scope of the invention, but rather as an example of one embodiment thereof. For example, although determinations of relative smoothness or detail of a region of an image in which a boundary lies are discussed with respect to 8×8, 8×4 and 4×8 blocks of pixels, the techniques are equally applicable for sets of pixels where the number of rows and columns of pixels are increased and/or decreased. Accordingly, the scope of the invention should be determined not by the embodiments illustrated, but by the appended claims and their equivalents.