# Patent

## Title
Method and apparatus for encoding and/or decoding moving pictures

## Abstract

A method of encoding moving pictures using a plurality of quantization matrices. The method involves selecting one of the plurality of quantization matrices in consideration of an at least one characteristics of an input image; transforming the input image; and quantizing the transformed input image using the selected quantization matrix.

## Background
CROSS-REFERENCE TO RELATED APPLICATIONS
This application is a continuation of application Ser. No. 11/249,310 filed Oct. 14, 2005, now U.S. Pat. No. 7,978,766 which is a continuation of application Ser. No. 10/755,671 filed on Jan. 13, 2004, now abandoned which claims the priority of Korean Patent Application No. 2003-2371, filed on Jan. 14, 2003, in the Korean Intellectual Property Office, the disclosure of which is incorporated herein by reference.


BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates to a method and apparatus for encoding and/or decoding moving pictures, and more particularly, to a method and an apparatus for encoding and/or decoding moving pictures which are capable of enhancing the efficiency of encoding moving pictures by adaptively selecting a quantization matrix in consideration of the characteristics of images input into a moving picture encoder.
2. Description of the Related Art
FIG. 1 is a block diagram of an encoding unit 120 for encoding moving pictures and a decoding unit 140 for decoding encoded moving pictures.
In order to provide a video-on-demand (VOD) service or to enable a moving picture communication, the encoding unit 120 creates a bitstream encoded by a compression technique, and the decoding unit 140 restores original images from a bitstream input thereinto.
A discrete cosine transform (DCT) unit 122 carries out a DCT operation on image data input thereinto in the unit of an 8×8 pixel block in order to remove spatial correlation from the input image data. A quantization unit (Q) 124 carries out highly efficient data loss compression by carrying out quantization on the input image data using a DCT coefficient obtained by the DCT unit 122 and representing the quantized data by several representative values.
An inverse quantization unit (IQ) 126 inversely quantizes the quantized image data provided by the quantization unit 124. An inverse discrete cosine transform (IDCT) unit 128 carries out an IDCT on the inversely quantized image data provided by the inverse quantization unit 126. A frame memory unit 130 stores the IDCT'ed image data provided by the IDCT unit 128 on a frame-by-frame basis.
A motion estimation and compensation unit (ME/MC) 132 estimates a motion vector (MV) for each macroblock and a sum of absolute difference (SAD), which correspond to a block matching error, by using the image data of a current frame inputted thereinto and the image data of a previous frame stored in the frame memory unit 130.
A variable length coding unit (VLC) 134 removes statistical redundancy from digital cosine transformed and quantized image data according to the estimated motion vector provided by the motion estimation and compensation unit 132.
A bitstream encoded by the encoding unit 120 is decoded by the decoding unit 140. The decoding unit 140 includes a variable length decoding unit (VLD) 142, an inverse quantization unit 144, an IDCT unit 146, a frame memory unit 148, and a motion estimation unit 150.
U.S. Pat. No. 6,480,539 discloses an example of an apparatus for encoding moving pictures.
A set-top box, which receives an analog terrestrial broadcast program and then encodes and stores the received program by using a data compression method such as MPEG2 or MPEG4, has recently been developed. However, in the case of a terrestrial broadcast, images arriving at a receiving terminal may be distorted due to channel noise. For example, an image may look as if white Gaussian noise were added thereto. If the image is compressed as it is, the efficiency of compressing the image may be very low due to the influence of the white Gaussian noise.
Therefore, in order to get rid of noise in a conventional method of encoding moving pictures, a pretreatment filter is provided at an input port of an encoder. However, in the case of using the pretreatment filter, an additional calculation process for encoding moving pictures is needed.
In addition, in such a conventional method of encoding moving pictures, a quantization matrix is determined irrespective of the characteristics of an input image, and quantization is carried out on the input image by applying the quantization matrix to the input image on a picture-by-picture basis, in which case the efficiency of encoding the inputted image is low.
SUMMARY OF THE INVENTION
The present invention provides a method and an apparatus for encoding and/or decoding moving pictures, which are capable of improving the efficiency and performance of compressing moving pictures.
The present invention also provides a method and an apparatus for encoding and/or decoding moving pictures, which are capable of removing noise without increasing the number of calculations performed.
According to an aspect of the present invention, there is provided a method of encoding moving pictures using a plurality of quantization matrices. The method involves (a) selecting one of the plurality of quantization matrices in consideration of characteristics of an input image; (b) transforming the input image; and (c) quantizing the transformed input image using the selected quantization matrix.
According to another aspect of the present invention, there is provided a method of decoding moving pictures using a plurality of quantization matrices. The method involves (a) carrying out variable length decoding on encoded image data; (b) extracting index information that specifies one of the plurality of quantization matrices, classified according to characteristics of an input image, from the variable-length-decoded image data; (c) selecting one of the plurality of quantization matrices based on the extracted index information; and (d) inversely quantizing each macroblock of the variable-length-decoded image data using the selected quantization matrix.
According to another aspect of the present invention, there is provided an apparatus for encoding moving pictures using a plurality of quantization matrices. The apparatus includes a quantization matrix determination unit that selects one of the plurality of quantization matrices for each macroblock in consideration of characteristics of an input image and generates index information indicating the selected quantization matrix for each macro block; a quantization matrix storage unit that stores a plurality of quantization matrices, which are classified according to the characteristics of the input image and outputs a quantization matrix for each macroblock according to the index information generated by the quantization matrix determination unit; an image transformation unit that transforms the input image; and a quantization unit that quantizes the transformed input image using the selected quantization matrix.
According to another aspect of the present invention, there is provided an apparatus for decoding moving pictures using a plurality of quantization matrices. The apparatus includes a variable length decoding unit that receives an encoded image stream, carries out variable length decoding on the input image stream, and extracts index information that specifies one of the plurality of quantization matrices, which are classified according to characteristics of an input image, from each macroblock of the variable-length-decoded image stream; a quantization matrix storage unit that stores the plurality of quantization matrices, selects one of the plurality of quantization matrices based on the extracted index information, and outputs the selected quantization matrix; and an inverse quantization unit that inversely quantizes each macroblock of the variable-length-decoded image stream using the quantization matrix output from the quantization matrix storage unit.
Additional aspects and/or advantages of the invention will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the invention.



BRIEF DESCRIPTION OF THE DRAWINGS
These and/or other aspects and advantages of the invention will become apparent and appreciated from the following description of the embodiments taken in the attached drawings in which:
FIG. 1 is a block diagram of a conventional MPEG encoder and a conventional MPEG decoder;
FIG. 2 is a block diagram of an approximated generalized Wiener filter processing an image whose average is not 0;
FIG. 3 is a block diagram of an approximated generalized Wiener filter processing an image whose average is not 0 in a DCT block;
FIGS. 4A through 4C are block diagrams of different types of approximated generalized Wiener filters used for intra-block encoding;
FIG. 5 is a block diagram of a typical video encoder used for inter-block encoding;
FIG. 6 is a block diagram of an apparatus for encoding moving pictures according to an embodiment of the present invention;
FIG. 7 is a block diagram of an apparatus for encoding moving pictures according to an embodiment of the present invention; and
FIG. 8 is a block diagram of an apparatus for decoding moving pictures according to an embodiment of the present invention.



DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
Reference will now be made in detail to the embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like reference numerals refer to the like elements throughout. The embodiments are described below to explain the present invention by referring to the figures.
When it comes to encoding moving pictures, pre-treatment filtering is very important because it can increase the efficiency of encoding the moving pictures by removing noise from images. While a conventional pre-treatment filtering technique for removing noise from images is generally carried out in a spatial pixel block, in the present invention, a noise removal technique is carried out in a DCT block in an apparatus for encoding moving pictures.
In the present invention, an approximated generalized Weiner filtering method is used for removing noise from images. In the approximated generalized Weiner filtering method, Weiner filtering is realized by taking advantage of fast unitary transformation, such as a discrete cosine transform (DCT). However, a filtering method other than the approximated generalized Weiner filtering method may be selectively used for carrying out filtering in a DCT block.
FIG. 2 is a block diagram of an approximated generalized Weiner filter processing image data whose average is not 0.
In FIG. 2, v represents an image block containing noise, and ŵ represents a row-ordered column vector of a filtered image block. Since the average of the image block v is not 0, an average estimation unit 210 estimates an average {circumflex over (m)} of the image block v, and a subtraction unit 220 subtracts the estimated average {circumflex over (m)} from the image block v.
A value z, output from the subtraction unit 220 as a result of the subtraction, is filtered by a filtering unit 230, and the filtering unit 230 outputs filtered data ŷ as a result of the filtering. An addition unit 240 adds the estimated average {circumflex over (m)} of the image block v to the filtered data and then outputs desirably filtered data was a result of the addition.
Hereinafter, an approximated generalized Weiner filtering method for processing an image model whose average is 0 will be described in greater detail.
The approximated generalized Weiner filtering method for processing an image model whose average is 0 can be expressed by Equation (1) below.

ŷ=A*T[ALA*T]Az=A*T{tilde over (L)}Z  (1)

In Equation (1), {tilde over (L)}=ALA*T, L=[1+σn2R−1]−1, R=E[yyT], Z=Az, and σn2 represents a noise variance value. In addition, in Equation (1), A represents unitary transformation. Since in the present embodiment, DCT is used as unitary transformation, A represents DCT here. Supposing that C8 and  represent an 8×8 DCT matrix and a Kronecker operator, A=C8C8.
Since, in most cases, L is approximately diagonalized in a unitary transformation, Equation (1) can be rearranged into Equation (2) below.

ŷ=A*TŶ  (2)

In Equation (2), Ŷ={tilde over (L)}Z≈[Diag{tilde over (L)}]Z.
Therefore, by applying Equation (2) to an 8×8 block, Equation (3) below can be obtained.




  
    
      
        
          
            y
            ⋒
          
          ⁡
          
            (
            
              k
              ,
              l
            
            )
          
        
        ≈
        
          
            
              p
              ~
            
            ⁡
            
              (
              
                k
                ,
                l
              
              )
            
          
          ⁢
          
            Z
            ⁡
            
              (
              
                k
                ,
                l
              
              )
            
          
        
      
    
    
      
        (
        3
        )
      
    
  
  
    
      
        
          
            p
            ~
          
          ⁡
          
            (
            
              k
              ,
              l
            
            )
          
        
        ≅
        
          1
          
            1
            +
            
              
                
                  σ
                  n
                  2
                
                
                  σ
                  2
                
              
              ⁢
              
                
                  Ψ
                  ⁡
                  
                    (
                    
                      k
                      ,
                      l
                    
                    )
                  
                
                
                  -
                  1
                
              
            
          
        
      
    
    
      
        (
        4
        )
      
    
  




In Equation (4), Ψ (k, l) represents normalized elements placed along a diagonal line of ALA*T, and σ2 represents a variance value of an original image y. In general, σ2 cannot be known. Therefore, σ2 is substituted by a result of subtracting the noise variance value σn2 from a variance value of z.
As shown in Equation (3), approximated generalized Weiner filtering is carried out on an image block whose average is 0 by multiplying a two-dimensional DCT coefficient Z(k, l) by {tilde over (p)}(k, l). Once ŷ(m, n) is determined, a final, filtered image is obtained by adding {circumflex over (m)}(m, n) to ŷ(m, n).
Hereinafter, an approximated generalized Weiner filtering method for processing an image model whose average is not 0 will be described in greater detail.
Let us assume that an average block is obtained by multiplying an input DCT block containing noise by S(k, l), i.e., the average block satisfied in Equation (5) below. Then, the approximated generalized Weiner filter method of FIG. 3, which carries out addition and subtraction in the DCT block, can be restructured into an approximated generalized Weiner filter of FIG. 4A, 4B, or 4C.

{circumflex over (M)}(k,l)=S(k,l)·V(k,l)  (5)

By using Equations (3) and (5), an image block filtered in the DCT block can be represented by Equation (6) below.




  
    
      
        
          
            
              
                
                  W
                  ⋒
                
                ⁡
                
                  (
                  
                    k
                    ,
                    l
                  
                  )
                
              
              =
              
                
                  
                    Y
                    ⋒
                  
                  ⁡
                  
                    (
                    
                      k
                      ,
                      l
                    
                    )
                  
                
                +
                
                  
                    M
                    ^
                  
                  ⁡
                  
                    (
                    
                      k
                      ,
                      l
                    
                    )
                  
                
              
            
          
        
        
          
            
              =
              
                
                  (
                  
                    
                      
                        
                          p
                          ~
                        
                        ⁡
                        
                          (
                          
                            k
                            ,
                            l
                          
                          )
                        
                      
                      ·
                      
                        (
                        
                          1
                          -
                          
                            S
                            ⁡
                            
                              (
                              
                                k
                                ,
                                l
                              
                              )
                            
                          
                        
                        )
                      
                    
                    +
                    
                      S
                      ⁡
                      
                        (
                        
                          k
                          ,
                          l
                        
                        )
                      
                    
                  
                  )
                
                ·
                
                  V
                  ⁡
                  
                    (
                    
                      k
                      ,
                      l
                    
                    )
                  
                
              
            
          
        
        
          
            
              =
              
                
                  F
                  ⁡
                  
                    (
                    
                      k
                      ,
                      l
                    
                    )
                  
                
                ·
                
                  V
                  ⁡
                  
                    (
                    
                      k
                      ,
                      l
                    
                    )
                  
                
              
            
          
        
      
    
    
      
        (
        6
        )
      
    
  




F(k, l) in Equation (6) can be expressed by Equation (7) below.




  
    
      
        
          
            
              
                
                  
                    F
                    ⁡
                    
                      (
                      
                        k
                        ,
                        l
                      
                      )
                    
                  
                  =
                  
                    
                      
                        
                          p
                          ~
                        
                        ⁡
                        
                          (
                          
                            k
                            ,
                            l
                          
                          )
                        
                      
                      ·
                      
                        (
                        
                          1
                          -
                          S
                        
                        )
                      
                    
                    ⁢
                    k
                  
                
                ,
                l
              
              )
            
            )
          
          +
          
            S
            ⁡
            
              (
              
                k
                ,
                l
              
              )
            
          
        
        =
        
          
            1
            +
            
              
                S
                ⁡
                
                  (
                  
                    k
                    ,
                    l
                  
                  )
                
              
              ·
              
                
                  σ
                  n
                  2
                
                
                  σ
                  2
                
              
              ·
              
                1
                
                  Ψ
                  ⁡
                  
                    (
                    
                      k
                      ,
                      l
                    
                    )
                  
                
              
            
          
          
            1
            +
            
              
                
                  σ
                  n
                  2
                
                
                  σ
                  2
                
              
              ·
              
                1
                
                  Ψ
                  ⁡
                  
                    (
                    
                      k
                      ,
                      l
                    
                    )
                  
                
              
            
          
        
      
    
    
      
        (
        7
        )
      
    
  




As shown in Equation (6), the entire filtering process can be simplified into a multiplication of F(k, l). Equation (7) shows that F(k, l) is determined by a signal-to-noise ratio (SNR), a covariance matrix, and an average matrix.
In order to determine F(k, l) it is necessary to obtain an average matrix S(k, l). In the present embodiment, among possible candidates for the average matrix S(k, l) the one that is satisfied in Equation (5) is selected. The average matrix S(k, l) can be represented by Equation (8) below. Equation (8) illustrates one of the simplest forms that the average matrix S(k, l) could take in the DCT block.




  
    
      
        
          S
          ⁡
          
            (
            
              k
              ,
              l
            
            )
          
        
        =
        
          (
          
            
              
                1
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
            
            
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
            
            
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
            
            
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
            
            
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
            
            
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
            
            
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
            
            
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
            
          
          )
        
      
    
    
      
        (
        8
        )
      
    
  




Hereinafter, a pretreatment process performed in an apparatus for encoding moving pictures will be described in greater detail with reference to FIGS. 4 and 5.
As described above, an approximated generalized Weiner filtering process can be carried out on an image block whose average is not 0 by multiplying the image block with a DCT value.
FIGS. 4A through 4C are block diagrams of different types of approximated generalized Weiner filters in an apparatus for encoding moving pictures. More specifically, FIGS. 4A through 4C illustrate the structure of an encoding apparatus that processes an intra block. FIGS. 4A and 4B describe that an intra block is encoded by carrying out filtering on the intra block in a DCT block and carrying out quantization and variable length coding (VLC) on the filtered intra block without performing an inverse DCT on the filtered intra block. In other words, FIGS. 4A and 4B describe that filtering is completed by multiplying the DCT coefficient by F(k, l). In the meantime, quantization is carried out by multiplying or dividing the DCT coefficient by a certain value with reference to a quantization table. The filtering carried out by multiplying the DCT coefficient by F(k, l) and the quantization carried out by multiplying the DCT coefficient by a certain value can be integrated into a single operation, as described in FIG. 4C.
As described in FIG. 5, the concepts of the present invention, described in FIGS. 4A through 4C, can be directly applied to an occasion when an apparatus for encoding moving pictures processes an inter block, as long as the noise has been removed from the motion-compensated block information p(m, n).
A covariance value Ψ(k, l) is determined depending on whether an input image block is an inter block or an intra block. Therefore, F(k, l) of FIG. 5 may be varied depending on whether the input image block is an inter block or an intra block.
Hereinafter, a method of obtaining an estimated variance value of intra blocks or inter blocks, from each of which their average is subtracted, will be described in detail with reference to Equation (9) below. Supposing that S represents an N×N (where N=8) block from which an average of the corresponding block has already been subtracted, a variance matrix of the N×N block can be obtained using Equation (9).




  
    
      
        
          C
          ^
        
        =
        
          
            1
            2
          
          ⁢
          
            N
            
              2
              ⁢
              
                
              
              ⁢
              
                trace
                ⁡
                
                  (
                  
                    
                      S
                      T
                    
                    ⁢
                    S
                  
                  )
                
              
            
          
          ⁢
          
            (
            
              
                
                  S
                  T
                
                ⁢
                S
              
              +
              
                SS
                T
              
            
            )
          
        
      
    
    
      
        (
        9
        )
      
    
  




Equation (9) has been disclosed by W. Niehsen and M. Brunig in “Covariance Analysis of Motion-compensated Frame Differences”, IEEE Trans. Circ. Syst. for Video Technol., June 1999.
An estimated variance value can be obtained by applying Equation (9) to a variety of experimental images. Where an original image block is an intra block, an original image is divided into 8×8 blocks, and then a variance value of each of the 8×8 blocks is calculated. On the other hand, where the original image block is an inter block, an estimated variance value is calculated by applying Equation (9) above to each image block that is determined as an inter block.
By using the estimated covariance value, the following equation is obtained: R=E[yyT]. Thereafter, by carrying out DCT on R, the following equation is obtained: Ψ=ARA*T.
Hereinafter, a method of calculating




  
    σ
    n
    2
  
  
    σ
    2
  




of Equation (7) will be described.

In Equation (7), the noise variance value σn2 can be obtained by using a noise estimator. Given that noise and original image pixels are independent random variables, an estimated value {circumflex over (σ)}2 of the variance σ2 of an original image can be calculated using Equation (10) below.

{circumflex over (σ)}2=max({circumflex over (σ)}z2−{circumflex over (σ)}n2,0)  (10)

In Equation (10), σz2 represents a variance value of each macroblock (MB). In a typical type of apparatus for encoding moving pictures, σz2 is calculated on a macroblock-by-macroblock basis. In the present embodiment, 8×8 blocks in the same macroblock are supposed to have the same variance value. Therefore, there is no need to perform additional calculations to obtain a variance value of each of the 8×8 blocks.
FIG. 6 is a block diagram of an apparatus for encoding moving pictures according to an embodiment of the present invention that encodes an input image in consideration of the characteristics of the input image.
In the present embodiment a level of noise contained in the input image is adaptively reflected in a quantization matrix.
Hereinafter, the structure and operation of the apparatus for encoding moving pictures according to a preferred embodiment of the present invention will be described in detail with reference to FIGS. 1 through 6.
The apparatus of FIG. 6 includes a discrete cosine transfer unit 610, a quantization unit (Q) 620, a variable length coding unit (VLC) 670, an inverse quantization unit (IQ) 630, an inverse DCT unit (IDCT) 640, a frame memory unit 650, and a motion estimation and compensation unit 660, which correspond to the DCT unit 122, the quantization unit 124, the VLC unit 134, the inverse quantization unit 126, the inverse DCT unit 128, the frame memory 130, and the motion estimation and compensation unit 132, respectively, of the encoding unit 120 of FIG. 1. In addition, the apparatus further includes a noise estimation unit 680, a quantization weight matrix determination unit 692, and a quantization weight matrix storage unit 694.
Since the DCT unit 610, the inverse DCT unit 640, the frame memory unit 650, and the motion estimation and compensation unit 660 serve the same functions as their respective counterparts of FIG. 1, their description will not be repeated.
The quantization weight matrix determination unit 692 determines a quantization weight matrix corresponding to a predetermined macroblock based on a noise variance value σn2 received from the noise estimation unit 680 and the predetermined macroblock's variance value σz2 received from the motion estimation and compensation unit 660. Thereafter, the quantization weight matrix determination unit 692 sends index information corresponding to the determined quantization weight matrix to the quantization weight matrix storage unit 694 and the VLC unit 670.
Hereinafter, a method of determining a quantization weight matrix corresponding to the predetermined macroblock based on σn2 received from the noise estimation unit 680 and σz2 received from the motion estimation and compensation unit 660, will be described in detail.
As described above with reference to Equation (8) and FIGS. 4 and 5, F(k, l) is determined by Equation (7). Once F(k, l) is determined, the DCT coefficient V(k, l) of an 8×8 block is multiplied by F(k, l) and the result of the multiplication Ŵ(k, l) is divided by a predetermined quantization weight matrix during a quantization process.
The apparatus of FIG. 6 integrates the process of multiplying F(k, l) by the DCT coefficient V(k, l) and the process of dividing Ŵ(k, l) by the quantization weight matrix into a single process and performs the single process. In other words, if a location component of (k, l) of a quantization weight matrix QT is represented by Q(k, l) then a location of (k, l) in a new quantization weight matrix QT′ is Q(k, l)/F(k, l).
In the present embodiment, by integrating the two separate processes into a single process, a plurality of F matrices obtained using σn2 and σz2 are computed in advance, and then the new quantization weight matrix QT′ is then computed using the plurality of F matrices and then is stored in the quantization weight matrix storage unit 694.
In addition, in the present embodiment, five new quantization weight matrices obtained using σn2 and σn2 are stored in the quantization weight matrix storage unit 694. Once σn2 and σz2 are determined




  
    σ
    n
    2
  
  
    σ
    2
  




can be calculated using Equation (10).

As shown in Equation (7), F(k, l) is determined by S(k, l) Ψ(k, l) and




  
    
      σ
      n
      2
    
    
      σ
      2
    
  
  .




S(k, l) is calculated using Equation (8), and Ψ(k, l) is variably set depending on whether or not an input image is an inter block or an intra block. Therefore, there is only one variable left for determining F(k, l), i.e.,





  
    
      σ
      n
      2
    
    
      σ
      2
    
  
  .




In the present embodiments, five different estimates of





  
    σ
    n
    2
  
  
    σ
    2
  




and their respective quantization weight matrices QT′ are provided. The provided quantization weight matrices QT′ are stored in the quantization weight matrix storage unit 694.

The quantization weight matrix determination unit 692 quantizes




  
    σ
    n
    2
  
  
    σ
    2
  




based on σn2 received from the noise estimation unit 680 and σz2 received from the motion estimation and compensation unit 660. The result of the quantization is transmitted to the quantization weight matrix storage unit 692 and the VLC unit 670 as index information of a quantization matrix corresponding to the predetermined macroblock.

For example, if quantization weight matrices stored in the quantization weight matrix storage unit 694 are classified into five different types according to




  
    
      σ
      n
      2
    
    
      σ
      2
    
  
  ,




the quantization of





  
    σ
    n
    2
  
  
    σ
    2
  




is carried out in five levels, and the index information of each of the five quantization weight matrices is set to 0, 1, 2, 3, or 4.

In an image with a lot of noise, the




  
    
      σ
      n
      2
    
    
      σ
      2
    
  
  ,




especially for blocks having a small variance value, is very large. When





  
    σ
    n
    2
  
  
    σ
    2
  




is very large, F(k, l) approaches 0, resulting in a severe blocking phenomenon. In order to prevent the blocking phenomenon, Tcutoff is used, as shown in Equation (11) below.





  
    
      
        
          
            σ
            n
            2
          
          
            σ
            2
          
        
        =
        
          min
          (
          
            
              T
              cutoff
            
            ,
            
              
                σ
                n
                2
              
              
                σ
                2
              
            
          
          )
        
      
    
    
      
        (
        11
        )
      
    
  




In general, Tcutoff has a value between 1 and 2.
The quantization weight matrix storage unit 694 transmits a quantization weight matrix corresponding to the index information received from the quantization weight matrix determination unit 692 to the quantization unit 620 and the inverse quantization unit 630.
The quantization unit 620 quantizes the predetermined macroblock using the quantization weight matrix received from the quantization weight matrix storage unit 694.
The inverse quantization unit 630 inversely quantizes the predetermined macroblock using the received quantization weight value.
The VLC unit 670 carries out VLC on input image data quantized by the quantization unit 620 and inserts the index information of the quantization weight matrix received from the quantization weight matrix determination unit 692 into a macroblock header.
In the present embodiment, the index information of the corresponding quantization weight matrix is inserted into the macroblock header and the macroblock header is transmitted. If there are ten quantization weight matrices stored in the quantization weight matrix storage unit 694, then 4-bit data is required for each macroblock.
Adjacent macroblocks are supposed to have similar image characteristics and there is supposedly a correlation among their index values. Therefore, a difference between an index value of one macroblock and an index value of an adjacent macroblock may be used as index information. The amount of index information to be transmitted can be considerably reduced in cases where a single quantization weight matrix is applied to an entire sequence.
In the present embodiment, a plurality of quantization weight matrices stored in the quantization weight matrix storage unit 694 should also be stored in a decoding unit. It may also be possible to use a plurality of quantization weight matrices transmitted to the decoding unit on a picture-by-picture basis using a picture extension header or transmitted to the decoding unit on a sequence-by-sequence basis using a sequence extension header.
As described above, it is possible to remove noise from an input image and enhance the efficiency of encoding the input image by adaptively applying a quantization matrix to each macroblock in consideration of a level of noise contained in the input image.
It is also possible for a user to arbitrarily determine quantization weight matrices. In the present embodiment, noise removal has been described as being performed on a Y component of an input image block in a DCT block. However, the noise removal can also be applied to a U or V component of the input image block, in which case additional quantization weight matrices are required exclusively for the U and V components of the input image block.
FIG. 7 is a block diagram of an apparatus for encoding moving pictures according to another preferred embodiment of the present invention that encodes an input image in consideration of the characteristics of the input image.
More specifically, among various characteristics of an input image, the edge characteristics of each macroblock of the input image are taken into consideration in the present embodiment.
Referring to FIG. 7, an apparatus for encoding moving pictures according to another preferred embodiment of the present invention includes a DCT unit 710, a quantization unit 720, a VLC unit 770, an inverse quantization unit 730, an inverse DCT unit 740, a frame memory unit 750, and a motion estimation and compensation unit 760, which correspond to the DCT unit 122, the quantization unit 124, the VLC unit 134, the inverse quantization unit 126, the inverse DCT unit 128, the frame memory 130, and the motion estimation and compensation unit 132, respectively, of the encoding unit 120 of FIG. 1. In addition, the apparatus further includes a quantization matrix determination unit 780 and a quantization matrix storage unit 790. Since the DCT unit 710, the inverse DCT unit 740, the frame memory unit 750, the motion estimation and compensation unit 760, and the VLC unit 770 serve the same functions as their respective counterparts of FIG. 1, their description will not be repeated.
The quantization matrix determination unit 780 selects an optimal quantization matrix for each macroblock in consideration of the characteristics of an input image and then transmits index information of the selected quantization matrix to the quantization matrix storage unit 790 and the VLC unit 770.
The quantization matrix determination unit 780 takes the edge characteristics of each macroblock into consideration as a benchmark for selecting one out of a predetermined number of quantization matrices.
Hereinafter, a method of selecting a quantization matrix in consideration of the edge characteristics of a macro block will be described in detail.
In a case where a predetermined macroblock of an input image is an intra block, the size and direction of an edge in each pixel of the predetermined macroblock are computed using such an edge detector as a sobel operator. The sobel operation can be represented by Equation (12).




  
    
      
        
          
            H
            1
          
          =
          
            [
            
              
                
                  
                    -
                    1
                  
                
                
                  0
                
                
                  1
                
              
              
                
                  
                    -
                    2
                  
                
                
                  0
                
                
                  2
                
              
              
                
                  
                    -
                    1
                  
                
                
                  0
                
                
                  1
                
              
            
            ]
          
        
        ,
        
          
        
        ⁢
        
          
            H
            2
          
          =
          
            [
            
              
                
                  
                    -
                    1
                  
                
                
                  
                    -
                    2
                  
                
                
                  
                    -
                    1
                  
                
              
              
                
                  0
                
                
                  0
                
                
                  2
                
              
              
                
                  1
                
                
                  2
                
                
                  1
                
              
            
            ]
          
        
      
    
    
      
        (
        12
        )
      
    
  




The quantization matrix determination unit 780 calculates the magnitude of a vertical edge and the magnitude of a horizontal edge using Equation (12) above and calculates the intensity and direction of an edge of the predetermined macroblock using the magnitude of the vertical and horizontal edges. Thereafter, the quantization matrix determination unit 780 selects one from among a predetermined number of quantization matrices in consideration of the intensity and direction of the edge of the predetermined macroblock and encoding efficiency. In other words, in a case where the predetermined macro block includes a horizontal or vertical edge, the quantization matrix determination unit 780 selects a quantization matrix that can enable quantization in full consideration of the horizontal or vertical edge of the predetermined macro block.
In a case where the predetermined macroblock is an inter block, the intensity and direction of an edge included in the predetermined macroblock can also be obtained using such an edge detector as a sobel operator.
In the present embodiment, a sobel detector is used for computing the intensity and direction of an edge included in the predetermined macroblock. However, a spatial filter, such as a differential filter or a Robert's filter, can also be used for computing the intensity and direction of the edge included in the predetermined macroblock.
In addition, in the present embodiment, a quantization matrix is selected in consideration of the edge characteristics of the predetermined macroblock. However, other characteristics of the predetermined macroblock that can affect encoding efficiency or the quality of an output image can be taken into consideration in adaptively selecting an optimal quantization matrix for the predetermined macroblock.
The quantization matrix storage unit 790 selects a quantization matrix based on the index information received from the quantization matrix determination unit 780 and transmits the selected quantization matrix to the quantization unit 720 and the inverse quantization unit 730.
The quantization unit 720 carries out quantization using the quantization matrix received from the quantization matrix storage unit 790.
The inverse quantization unit 730 carries out inverse quantization using the quantization matrix received from the quantization matrix storage unit 790.
The VLC unit 770 carries out VLC on quantized input image data, received from the quantization unit 720, and index information of a quantization matrix corresponding to the predetermined macroblock, received from the quantization weight matrix determination unit 780. The index information is inserted into a macroblock header.
In the present embodiment, index information of a quantization weight matrix corresponding to a predetermined macroblock is inserted into a header of the predetermined macroblock and then transmitted. A difference between an index value of one macroblock and an index value of an adjacent macroblock may be used as index information.
In the present embodiment, a plurality of quantization weight matrices stored in the quantization matrix storage unit 790 are also stored in a decoding unit. However, it may also be possible to use a plurality of quantization weight matrices transmitted to the decoding unit on a picture-by-picture basis using a picture extension header or transmitted to the decoding unit on a sequence-by-sequence basis using a sequence extension header.
FIG. 8 is a block diagram of an apparatus for decoding moving pictures according to an embodiment of the present invention. Referring to FIG. 8, the apparatus includes a variable length decoding unit 810, an inverse quantization unit 820, an inverse DCT unit 830, a frame memory unit 840, and a motion compensation unit 850, which correspond to the variable length decoding unit 142, the inverse quantization unit 144, the inverse DCT unit 146, the frame memory unit 148, and the motion compensation unit 150, respectively, of the decoding unit 140 of FIG. 1. In addition, the apparatus further includes a quantization weight matrix storage unit 860. The inverse DCT unit 830, the frame memory unit 840, and the motion compensation unit 850 serve the same functions as their respective counterparts of FIG. 1, and thus their description will not be repeated here.
The variable length decoding unit 810 carries out variable length decoding on an input stream, extracts index information of a quantization weight matrix corresponding to a predetermined macroblock of the input stream from a header of the predetermined macroblock, and outputs the extracted index information to the quantization weight matrix storage unit 860.
The quantization weight matrix storage unit 860 outputs a quantization weight matrix corresponding to the index information received from the variable length decoding unit 810 to the inverse quantization unit 820. The quantization weight matrix storage unit 860 stores a plurality of quantization weight matrices, which are classified according to the characteristics of an input image processed by an encoding unit, for example, a noise variance value as a ratio between an input image variance value and the edge characteristics of the input image.
The plurality of quantization weight matrices stored in the quantization weight matrix storage unit 860 can be transmitted on a picture-by-picture basis using a picture extension header or transmitted to the decoding unit on a sequence-by-sequence basis using a sequence extension header. The plurality of quantization weight matrices are transmitted from the variable length decoding unit 810 to the quantization weight matrix storage unit 860, as marked by a dotted line in FIG. 8.
The present invention can be applied to different types of methods and apparatuses for encoding and/or decoding moving pictures, such as MPEG-1, MPEG-2, or MPEG4. In addition, the present invention can be realized as computer-readable codes written on a computer-readable recording medium. The computer-readable recording medium includes any type of recording device on which data can be written in a computer-readable manner. For example, the computer-readable recording medium includes ROM, RAM, CD-ROM, a magnetic tape, a hard disk, a floppy disk, flash memory, an optical data storage, and a carrier wave (such as data transmission through the Internet). In addition, the computer-readable recording medium can be distributed over a plurality of computer systems which are connected to one another in a network sort of way so that computer-readable codes are stored on the computer-readable recording medium in a decentralized manner.
As described above, the methods of encoding and/or decoding moving pictures according to the embodiments of present invention, a quantization matrix is adaptively applied to each macroblock of an input image in consideration of the characteristics of the input image. Thus, it is possible to enhance the efficiency and performance of encoding the input image.
Although a few embodiments of the present invention have been shown and described, it would be appreciated by those skilled in the art that changes may be made in this embodiment without departing from the principles and spirit of the invention, the scope of which is defined in the claims and their equivalents.

## Claims

1. A method of decoding moving pictures by adaptively applying a plurality of quantization weight matrices, that are not related by a scalar, to a respective macroblock of an input image, the method comprising:
receiving an encoded stream including the input image, the encoded stream comprising at least one macroblock;
for each macroblock that is an intra-block, the respective intra-block comprises index information that specifies a plurality of intra-block quantization weight matrices for a luminance (Y) component and chrominance (U, V) components for intra-blocks corresponding to the respective intra-block, wherein the specified intra-block quantization weight matrices correspond to which of non-zero spatial characteristic were detected regarding the respective intra-block;
for each macroblock that is an inter-block, the respective inter-block comprises index information that specifies a plurality of inter-block quantization weight matrices for Y, U, and V components for inter-blocks corresponding to the respective inter-block, wherein the specified inter-block quantization weight matrices correspond to which of non-zero spatial characteristics were detected regarding the respective inter-block;
performing a variable length decoding on the encoded image data;
selecting at least one quantization weight matrix based on the index information; and
inversely quantizing each variable length decoded macroblock by adaptively applying specified respective quantization weight matrices for the respective macroblock,
wherein at least two intra-block macroblocks of the input image having different determined spatial characteristics are inverse quantized using different intra-block quantization weight matrices, and at least two inter-block macroblocks of the input image having different determined spatial characteristics are inverse quantized using different inter-block quantization weight matrices.

2. The method of claim 1, wherein the performing of the variable length decoding comprises extracting the index information of each of the plurality of quantization weight matrices from a macroblock header.

3. The method of claim 1, wherein the index information is a difference between an index of a quantization weight matrix corresponding to a macroblock and an index of a quantization weight matrix corresponding to an adjacent macroblock.

4. The method of claim 1, wherein each different non-zero detected spatial characteristic corresponds to different detected magnitudes of an edge included in the input image.

5. An apparatus, including at least one processing device, for decoding moving pictures by adaptively applying a plurality of quantization weight matrices applied to a macroblock, the apparatus comprising:
a variable length decoding unit to receive an encoded image stream including an image, to perform variable length decoding on the encoded image stream, the encoded image stream comprising at least one macroblock;
a quantization weight matrix storage unit to store a plurality of quantization weight matrices, to select respective quantization weight matrices from the plurality of quantization weight matrices, and to output the selected quantization weight matrices; and
an inverse quantization unit to inversely quantize each macroblock of the variable-length-decoded image stream using the selected quantization weight matrices,
wherein for each macroblock that is an intra-block, a respective intra-block comprises information that specifies which of the plurality of quantization weight matrices, predefined for a luminance (Y) component and chrominance (U, V) components for intra-blocks, corresponds to quantization weight matrices used in quantizing the Y, U, and V components of the respective intra-block macroblocks, and for each macroblock that is an inter-block, a respective inter-block macroblock comprises information that specifies which of the plurality of quantization weight matrices, predefined for Y, U, and V components for inter-blocks, corresponds to quantization weight matrices used in quantizing the Y, U, and V components of the respective inter-block macroblocks, and
wherein the quantization weight matrix storage unit selects one of the plurality of quantization weight matrices based on the respective intra-block macroblock comprised information or the respective inter-block macroblock comprised information, with the specified quantization weight matrices predefined for intra-blocks corresponding at least to which of different non-zero spatial characteristics were detected in the image or in the image at least regarding the respective intra-block macroblock, and the specified quantization weight matrices predefined for inter-blocks corresponding at least to which of different non-zero spatial characteristics were detected in the image or in the image at least regarding the respective inter-block macroblock,
wherein at least two intra-block macroblocks of the input image having different determined spatial characteristics are inverse quantized using different intra-block quantization weight matrices, and at least two inter-block macroblocks of the input image having different determined spatial characteristics are inverse quantized using different inter-block quantization weight matrices.

6. The apparatus of claim 5, the intra-block macroblock comprised information and the inter-block macroblock comprised information include respective index information specifying the respectively selected quantization weight matrices, and wherein the variable length decoding units extracts the respective index information from a macroblock header.

7. The apparatus of claim 6, wherein the respective index information is a difference between an index of a quantization weight matrix corresponding to a macroblock and an index of a quantization weight matrix corresponding to an adjacent macroblock.

8. The apparatus of claim 5, wherein each different non-zero detected spatial characteristic corresponds to different detected magnitudes of an edge included in the image.

9. The apparatus of claim 8, wherein, for intra-blocks, each different non-zero detected spatial characteristic is detected in the respective intra-block macroblock and corresponds to different detected magnitudes of an edge included in the respective intra-block macroblock, and, for inter-blocks, each different non-zero detected spatial characteristic is detected in the respective inter-block macroblock and corresponds to different detected magnitudes of an edge included in the respective inter-block macroblock.

10. A method of decoding moving pictures by adaptively applying a plurality of quantization weight matrices, that are not related by a scalar, to a respective macroblock of an input image, the method comprising:
receiving an encoded stream including the input image, the encoded stream comprising at least one macroblock;
for each macroblock that is an intra-block, a respective intra-block macroblock comprises information that specifies which of the plurality quantization weight matrices, predefined for a luminance (Y) component and chrominance (U, V) components for intra-blocks, corresponds to quantization weight matrices used in quantizing the Y, U, and V components of the respective intra-block macroblock based on at least which of different non-zero spatial characteristics were detected in the input image or in the input image at least regarding the respective intra-block macroblock;
for each macroblock that is an inter-block, a respective inter-block macroblock comprises information that specifies which of the plurality of quantization weight matrices, predefined for Y, U, and V components for inter-blocks, corresponds to quantization weight matrices used in quantizing the Y, U, and V components of the respective inter-block macroblock based on at least which of different non-zero spatial characteristics were detected in the input image or in the input image at least regarding the respective inter-block macroblock;
performing a variable length decoding on the encoded image data; and
inversely quantizing each variable length decoded macroblock by adaptively applying the specified respective quantization weight matrices for the respective macroblock,
wherein at least two intra-block macroblocks of the input image having different determined spatial characteristics are inverse quantized using different intra-block quantization weight matrices, and at least two inter-block macroblocks of the input image having different determined spatial characteristics are inverse quantized using different inter-block quantization weight matrices.

11. The method of claim 10, wherein the intra-block macroblock comprised information and the inter-block macroblock comprised information include respective index information specifying the respectively selected quantization weight matrices, and wherein the performing of the variable length decoding comprises extracting respective index information from a macroblock header.

12. The method of claim 11, wherein the respective index information is a difference between an index of a quantization weight matrix corresponding to a macroblock and an index of a quantization weight matrix corresponding to an adjacent macroblock.

13. The method of claim 10, wherein each different non-zero detected spatial characteristic corresponds to different detected magnitudes of an edge included in the input image.

14. The method of claim 13, wherein, for intra-blocks, each different non-zero detected spatial characteristic is detected in the respective intra-block macroblock and corresponds to different detected magnitudes of an edge included in the respective intra-block macroblock, and, for inter-blocks, each different non-zero detected spatial characteristic is detected in the respective inter-block macroblock and corresponds to different detected magnitudes of an edge included in the respective inter-block macroblock.

15. An apparatus, including at least one processing device, to decode a bit stream including an image by adaptively applying a plurality of stored quantization weight matrices, that are not related by a scalar, to respective macroblocks extracted from the bit stream, the apparatus comprising:
a memory device storing the plurality of quantization weight matrices prior to decoding of the bit stream by the apparatus; and
an inverse quantizer configured to inversely quantize respective intra-block macroblocks of the bit stream and respective inter-block macroblocks of the bit stream using selected quantization weight matrices for a luminance (Y) component and chrominance (U, V) components predefined for the respective intra-block macroblocks and selected quantization weight matrices for Y, U, and V components predefined for the respective inter-block macroblocks,
wherein the selected quantization weight matrices for the Y, U, and V components for the respective intra-block macroblocks and the selected quantization weight matrices for the Y, U, and V components for the respective inter-block macroblocks are selected from the plurality of stored quantization weight matrices based upon index information encoded in the bit stream identifying which of the plurality of quantization weight matrices to select and obtain from the memory device for the inverse quantizing by the inverse quantizer, with each of the index information encoded in the bit stream being based upon which of different non-zero spatial characteristics were detected in the image or in the image at least regarding the respective macroblocks,
wherein at least two intra-block macroblocks of the input image having different determined spatial characteristics are inverse quantized using different intra-block quantization weight matrices, and at least two inter-block macroblocks of the input image having different determined spatial characteristics are inverse quantized using different inter-block quantization weight matrices.

16. The apparatus of claim 15, wherein each non-zero detected spatial characteristic corresponds to different detected magnitudes of an edge included in the image.

17. The apparatus of claim 16, wherein each different non-zero detected spatial characteristic is detected in each of the respective macroblocks.

18. A method decoding a bit stream by adaptively applying a plurality of stored quantization weight matrices, that are not related by a scalar, to respective macroblocks extracted from the bit stream including an image, the apparatus comprising:
storing the plurality of quantization weight matrices in a memory device;
selecting respective quantization weight matrices for a luminance (Y) component and chrominance (U, V) components predefined for respective intra-block macroblocks of the respective macroblocks and respective quantization weight matrices for Y, U, and V components predefined for respective inter-block macroblocks of the respective macroblocks, from the plurality of stored quantization weight matrices, based upon index information encoded in the bit stream identifying which of the plurality of quantization weight matrices to select and obtain from the memory device for inverse quantization, with each of the index information encoded in the bit stream being based upon respective different non-zero detected spatial characteristics of the image in the image or in the image at least regarding the respective macroblocks; and
inversely quantizing the respective intra-block macroblocks using the selected quantization weight matrices for the Y, U, and V components for the respective intra-block macroblocks and inversely quantizing the respective intra-block macroblocks and the respective inter-block macroblocks using the selected quantization weight matrices for the Y, U, and V components for the respective inter-block macroblocks,
wherein at least two intra-block macroblocks of the input image having different determined spatial characteristics are inverse quantized using different intra-block quantization weight matrices, and at least two inter-block macroblocks of the input image having different determined spatial characteristics are inverse quantized using different inter-block quantization weight matrices.

19. The method of claim 18, wherein each non-zero detected spatial characteristic corresponds to different detected magnitudes of an edge included in the image.

20. The method of claim 19, wherein each different non-zero detected spatial characteristic is detected in each of the respective macroblocks.