# Patent

## Title
Coding and noise filtering an image sequence

## Abstract

The invention provides a method of and a device for coding (10*) an image sequence g(i,j,k)). The device (10*) has a noise filter (12) for noise filtering (12) the image sequence (g(i,j,k)), and for regarding the noise filtering (12) as a rate-distortion optimization problem in order to adapt the response of the noise filter (12). In particular, a filter parameter set (C) is determined to adapt the response of the filter (12) in that the image sequence (g(i,j,k)) is encoded using an optimal bit-budget, which is the bit-budget used for compressing a noise-free image sequence, and the distortion for the given bit-budget is minimized. A solution of the rate-distortion problem is proposed that calculates (12) the filter parameter set (C) by a Lagrange multiplier method. Separate minimization is used to determine each parameter of the parameter set (C) independently. In a practical embodiment, a spatial adaptive weighted averaging (SAWA) filtering (23) is used to estimate the bit budget (Rf*) and to pre-filter the image sequence g(i,j,k)).

## Background
The invention relates to a method of and a device for coding an image sequence, in which the image sequence is noise filtered.
Kleihorst et al. [1] describe a single-chip MPEG2 encoder that employs an adaptive noise filter. The structure of the noise filter 2 is shown in FIG. 1. Besides the noise filter 2, the prior art embodiment has a subtractor 1, an adder 3, a selector 4, a main loop memory 5 and a motion estimator 6. For simplicity reasons, the signals are represented as 1-dimensional data. Here g(k) is the observed, noisy, signal; {circumflex over (f)}MC(k−1) is the previously filtered (and coded-decoded) signal which is retrieved from the main loop memory 5. Note that the subscript MC denotes that this signal is motion compensated to lie along the motion trajectory of g(k). The result of the filtering is {circumflex over (f)}(k), this is inserted into the coding chain instead of the noisy g(k). Within inter-coded macro-blocks, the signal {circumflex over (f)}−{circumflex over (f)}MC(k−1) is forwarded. The Kalman-gain multiplier 0≦C≦1 is controlled to adapt the filter 2 to the situation at hand. Setting C=1, forwards the (noisy) observation and no filtering action takes place. If C=0, then only the prediction is forwarded, while for intermediate values of C noise filtering is achieved. Except from globally controlling this value, C is also directly controlled by the result of the motion compensation. This is done to avoid blurring in situations where MPEG's (translational-) motion model is insufficient. Reversely, the adaptivity also increases filtering effort if a good motion-compensation is detected.
An object of the invention is, inter alia, to provide a more effective filtering. To this end, the invention provides a method of and a device for coding an image sequence and a camera system as defined in the independent claims. Advantageous embodiments are defined in the dependent claims.
A first embodiment of the invention is based on regarding the noise filtering as a rate-distortion optimization problem in order to adapt the noise filtering. The invention takes into account both the reduced quality of the encoded pictures and the increased amount of bits to transmit due to noise corruption. The invention allows adaptive filtering of image sequences resulting in better compression and distortion performance. Preferably, a filter parameter set is determined to adapt the response of the filter in that: the image sequence is encoded using an optimal bit-budget (or rate) R which is used for compressing a noise-free image sequence, and the distortion D for the given bit-budget R is minimized. The distortion of a certain frame due to the encoding process and the number of bits used to encode that frame need to be evaluated. The rate-distortion problem can be solved efficiently by calculating the filter parameter set by a Lagrange multiplier method.
A further embodiment according to the invention uses an effective algorithm to estimate an optimal Lagrange multiplier by determining a maximum of a second derivative of the bit budget R. In this embodiment the optimal Lagrange multiplier is determined without prior knowledge of the rate constraint and noise characteristics.
A practical embodiment according to the invention uses spatial adaptive weighted averaging filtering to estimate the rate. In a further embodiment the spatial adaptive weighted averaging filtering is used to pre-filter the image sequence. This is done to exploit the spatial correlation between the pixels and to reduce the processing burden compared to three-dimensional filtering techniques. The displacement vectors are now estimated from the current and the previous frame after they are spatially filtered, which provides additional robustness to the motion estimates.



The aforementioned and other aspects of the invention will be apparent from and elucidated with reference to the embodiments described hereinafter.
In the drawings:
FIG. 1 shows the structure of an adaptive noise filter as known from the prior art (already discussed);
FIG. 2 shows a first embodiment according to the invention that provides combined video coding and noise reduction;
FIG. 3 shows a second embodiment according to the invention that provides combined video coding and noise reduction; and
FIG. 4 shows a camera system according to the invention.



The drawings only show those elements that are necessary to understand the invention.
The invention regards noise filtering of an image sequence as a rate-distortion optimization problem in that the response of a filter can be adapted. In particular, an optimal filter parameter set is determined such that noisy images are encoded using an optimal bit budget and the distortion is minimized. The optimal bit budget is a number of bits that would be used for compressing a noise-free image sequence. As a favorable implementation, a solution based on a Lagrange multiplier method will be proposed. This method enables an efficient solution of the rate-distortion problem. Moreover, an effective algorithm will be discussed, which determines an optimal Lagrange multiplier without prior knowledge of the bit budget, i.e. a rate constraint, and noise characteristics.
Generally speaking, perfect noise filtering cannot be achieved without degrading the original signal. An aspect of the invention is that the problem of filtering the image sequence in the context of a certain video coding is considered as follows:

    
    
        encode the noisy sequence using the optimal bit budget R, i.e. the number of bits used to encode a noise-free sequence;
        given R, minimize the distortion due to filtering in that the coefficients of a given noise filter are adapted.
    
    


This can be regarded as a resource allocation problem where the optimal parameter set which allows efficient distribution of a given bit budget must be found in order to ensure satisfactory image quality. The invention, can be regarded as a general rate-distortion optimization framework to determine the optimal filter parameter set for a given video coder.
FIG. 2 shows a device 10 according to the invention that shows combined video coding and noise filtering. The device 10 comprises a subtractor 11, a noise filter 12 with a processing unit CPU 12*, an adder 13, a switch 14, a Discrete Cosine Transformer (DCT) 15, a Quantizer (Q) 16, a variable length coder (VLC) 17, an inverse quantizer (Q−1) 18, an inverse DCT (DCT−1) 19, an adder 20, a motion estimator (ME)/motion compensator (MC) 21 and a switch 22. The device 10 is a hybrid coder that codes the incoming image sequence g(i,j,k) spatially and temporally by DCT transformation plus quantization and motion compensation. The device produces intra-coded frames (I) and inter-coded frames (P). Inter-coded frames are motion-compensated while intra-coded frames are not. If the frame should be intra-coded, the switches 14 and 22 are positioned such that no motion-compensation is performed. All frames are DCT coded in the DCT 15, quantized in Q 16 and entropy coded in VLC 17. To obtain a reconstructed frame, that is necessary for motion estimation and motion compensation, the coded frame is inverse quantized in Q−1 18 and an inverse DCT transformed in DCT−1 19. A reconstructed frame is stored in a frame memory that is included in the ME/MC unit 21. The noise filter 12 filters a differential frame, because it is coupled to the subtractor 11. The device 10 and especially the noise filter 12 with the CPU 12* will be discussed in more detail below.
Assume an exemplary, simple additive noise model, given by:

g(i,j,k)=f(i,j,k)+n(i,j,k)  (1)

where g(i,j,k) denotes the observed image sequence that is input to the subtractor 11, f(i,j,k) the original sequence and n(i,j,k) the noise; i,j are the spatial coordinates and k the discrete time variable (frame index). The noise n(i,j,k) is assumed to be zero-mean, white, independent of f(i,j,k) and Gaussian distributed with constant variance σn2.

As an illustration and in order to keep the computation low, the following discussion is focussed on a simplified motion compensated (MC) noise filter [2] producing a filtered frame:

F(i,j,k)=F(i+vi,jx(k), j+vi,jy(k),k−1)+Ci,j(k)(g(i,j,k)−F(i+vi,jx(k), j+vi,jy(k),k−1))  (2)

wherein {right arrow over (v)}i,j(k)=[vi,jx(k) vi,jy(k)]T is the displacement of position (i,j) and Ci,j(k) is a control parameter to adapt a response of the noise filter 12.

For the given MC video coding system 10, consider now an image that is partitioned into K1×K2 fixed-sized block regions for motion estimation and motion compensation; the corresponding displacement set is dk=({right arrow over (d)}0,0(k), . . . , {right arrow over (d)}K1−1,K2−1(k)). Besides, suppose that the image is partitioned into N1×N2 non-overlapping blocks of dimensions I×J for MC filtering. The corresponding control parameter set and displacement set are given by: Ck=(C0,0(k), . . . , CN1−1,N2−1(k)) en vk=({right arrow over (v)}0,0(k), . . . , {right arrow over (v)}N1−1,N2−1(k)) respectively. The control parameter set and the motion vectors are assumed to be both in a finite set of admissible values.

Fn1,n2(i,j,k)=F(i+vn1,n2x(k), j+vn1,n2y(k),k−1)+Cn1,n2(k)[gn1,n2(i,j,k)−F(i+vn1,n2x(k), j+vn1,n2y(k),k−1)]  (3)

denotes the filtered frame to be encoded, and

{tilde over (F)}k1,k2(i,j,k)={tilde over (F)}(i+dk1,k2x(k), j+dk1,k2y(k), k−1)+Q[Fn1,n2(i,j,k)−{tilde over (F)}(i+dk1,k2x(k), j+dk1,k2y(k),k−1)]  (4)

the reconstructed filtered frame as displayed at a decoder wherein Q[.] is a quantization operator as present in quantizer 16. Note that k1 and k2 are indices to indicate a block region for motion estimation and motion compensation.

Two separate motion estimation/compensation processes have to be performed: one for the noise filtering and an other for the motion compensated coding. In order to save computational effort, it is assumed here that F(i,j,k)=g(i,j,k) and that the sequence g(i,j,k) being encoded is filtered along the motion trajectory vk=dk [1]. This means that the filtering is based on the motion compensated prediction performed in the coding loop. See FIG. 2.
The reconstructed filtered frame is then given by:

{tilde over (F)}k1,k2(i,j,k)={tilde over (F)}(i+dk1,k2x(k), j+dk1,k2y(k),k−1)+Q[Cn1,n2(k)(gn1,n2(i,j,k)−{tilde over (F)}(i+dk1,k2x(k), j+dk1,k2y(k),k−1)]  (5)

Notice that, since motion estimation is performed from the noisy observation g(i,j,k), the noise may result in inaccurate motion estimates, which degrade the motion-compensated prediction. Therefore, a noise-robust motion estimator (ME) 21 for the computation of dk is adopted in an advantageous embodiment. A low-complexity spatio-temporal recursive ME [3] can be used.
A rate-distortion optimization problem is formulated to compute the control parameter set Ck. Let Rkf be the number of bits used to encode a displaced frame difference (DFD) associated with the noise-free sequence f(i,j,k), denoted as:

DFD(f,{tilde over (f)})=Q(fk1,k2(i,j,k)−{tilde over (f)}(i+dk1,k2x(k), j+dk1,k2y(k),k−1))  (6)

The goal is to find the set Ck which minimizes the frame distortion: Dg(Ck)=Function(g(i,j,k),{tilde over (F)}(i,j,k)) for the given bit rate constraint Rkf.

Note that, since f(i,j,k) is not available, only the distortion due to the filtering by means of Dg(Ck) can be taken into account but it is not possible to consider the degradation due to noise.
Let Dn1,n2g(Ck) and Rn1,n2g(Ck) represent the distortion and the rate associated with the region (n1,n2) respectively. Then the RD optimization problem can be expressed as: 



  
    
      
        
          
            
              min
              
                C
                k
              
            
            ⁢
            
              
                D
                g
              
              ⁡
              
                (
                
                  C
                  k
                
                )
              
            
          
          =
          
            
              min
              
                C
                k
              
            
            ⁢
            
              
                ∑
                
                  
                    n
                    1
                  
                  ,
                  
                    n
                    2
                  
                
              
              ⁢
              
                 
              
              ⁢
              
                
                  
                    D
                    
                      
                        n
                        1
                      
                      ,
                      
                        n
                        2
                      
                    
                    g
                  
                  ⁡
                  
                    (
                    
                      C
                      k
                    
                    )
                  
                
                ⁢
                
                   
                
                ⁢
                subject
                ⁢
                
                   
                
                ⁢
                to
              
            
          
        
        ⁢
        
           
        
      
    
    
      
        (
        7
        )
      
    
  
  
    
      
        
           
        
        ⁢
        
          
            R
            k
            g
          
          =
          
            
              
                ∑
                
                  
                    n
                    1
                  
                  ,
                  
                    n
                    2
                  
                
              
              ⁢
              
                 
              
              ⁢
              
                
                  R
                  
                    
                      n
                      1
                    
                    ,
                    
                      n
                      2
                    
                  
                  g
                
                ⁡
                
                  (
                  
                    C
                    k
                  
                  )
                
              
            
            =
            
              R
              k
              f
            
          
        
      
    
    
      
        (
        8
        )
      
    
  




Equations (5), (7) and (8) define the proposed RD optimized MC temporal noise filter for video coding.

In order to solve this problem efficiently, an unconstrained problem can be formulated by merging the rate term with the distortion term through a Lagrange multiplier λk [4]. Introducing the total Lagrange cost function: 



  
    
      
        
          J
          ⁡
          
            (
            
              
                C
                k
              
              ,
              
                λ
                k
              
            
            )
          
        
        =
        
          
            ∑
            
              
                n
                1
              
              ,
              
                n
                2
              
            
          
          ⁢
          
            ⌊
            
              
                
                  D
                  
                    
                      n
                      1
                    
                    ,
                    
                      n
                      2
                    
                  
                  g
                
                ⁡
                
                  (
                  
                    C
                    k
                  
                  )
                
              
              +
              
                
                  λ
                  k
                
                ⁢
                
                  
                    R
                    
                      
                        n
                        1
                      
                      ,
                      
                        n
                        2
                      
                    
                    g
                  
                  ⁡
                  
                    (
                    
                      C
                      k
                    
                    )
                  
                
              
            
            ⌋
          
        
      
    
    
      
        (
        9
        )
      
    
  




It has been shown [5] that if there is a {overscore (λ)}k such that: 



  
    
      
        
          
            C
            _
          
          k
        
        =
        
          arg
          ⁢
          
            {
            
              
                min
                
                  C
                  k
                
              
              ⁢
              
                J
                ⁡
                
                  (
                  
                    
                      C
                      k
                    
                    ,
                    
                      
                        λ
                        _
                      
                      k
                    
                  
                  )
                
              
            
            }
          
          ⁢
          
             
          
          ⁢
          leads
          ⁢
          
             
          
          ⁢
          to
        
      
    
    
      
        (
        10
        )
      
    
  
  
    
      
        
           
        
        ⁢
        
          
            
              R
              _
            
            k
            g
          
          =
          
            
              
                ∑
                
                  
                    n
                    1
                  
                  ,
                  
                    n
                    2
                  
                
              
              ⁢
              
                 
              
              ⁢
              
                
                  R
                  
                    
                      n
                      1
                    
                    ,
                    
                      n
                      2
                    
                  
                  g
                
                ⁡
                
                  (
                  
                    
                      C
                      _
                    
                    k
                  
                  )
                
              
            
            =
            
              R
              k
              f
            
          
        
      
    
    
      
        (
        11
        )
      
    
  




then {overscore (C)}k is also an optimal solution to (7), (8).

A bisection method can be used to find an optimal {overscore (λ)}k. Supposing that the partition for noise filtering is such that there is no inter-region dependency, both rate and distortion of the region (n1,n2) depend only on the single Cn1,n2 (k) associated with that region. Thus, we have

Rn1,n2g (Ck)=Rn1,n2g (Cn1,n2(k))  (12)

and

Dn1,n2g (Ck)=Dn1,n2g (Cn1,n2(k))  (13)

where the distortion is expressed as: 



  
    
      
        
          
            D
            
              
                n
                1
              
              ,
              
                n
                2
              
            
            g
          
          ⁡
          
            (
            
              
                C
                
                  
                    n
                    1
                  
                  ,
                  
                    n
                    2
                  
                
              
              ⁡
              
                (
                k
                )
              
            
            )
          
        
        =
        
          
            1
            IJ
          
          ⁢
          
            
              ∑
              
                i
                =
                1
              
              I
            
            ⁢
            
               
            
            ⁢
            
              
                ∑
                
                  j
                  =
                  1
                
                
                  
                    

                  
                  ⁢
                  J
                
              
              ⁢
              
                 
              
              ⁢
              
                
                  (
                  
                    
                      
                        g
                        
                          
                            n
                            1
                          
                          ,
                          
                            n
                            2
                          
                        
                      
                      ⁡
                      
                        (
                        
                          i
                          ,
                          j
                          ,
                          k
                        
                        )
                      
                    
                    -
                    
                      
                        
                          F
                          ~
                        
                        
                          
                            n
                            1
                          
                          ,
                          
                            n
                            2
                          
                        
                      
                      ⁡
                      
                        (
                        
                          i
                          ,
                          j
                          ,
                          k
                        
                        )
                      
                    
                  
                  )
                
                2
              
            
          
        
      
    
    
      
        (
        14
        )
      
    
  




Therefore, the principle of separate minimization can be invoked, converting the joint optimization problem of (10) into a simpler optimization problem in which each control parameter Cn1,n2 (k) εCk can be determined independently, according to: 



  
    
      
        
          
            
              
                C
                _
              
              
                
                  n
                  1
                
                ,
                
                  n
                  2
                
              
            
            ⁡
            
              (
              k
              )
            
          
          =
          
            arg
            ⁢
            
               
            
            ⁢
            
              
                min
                
                  
                    C
                    
                      
                        n
                        1
                      
                      ,
                      
                        n
                        2
                      
                    
                  
                  ⁡
                  
                    (
                    k
                    )
                  
                
              
              ⁢
              
                ⌊
                
                  
                    
                      D
                      
                        
                          n
                          1
                        
                        ,
                        
                          n
                          2
                        
                      
                      g
                    
                    ⁡
                    
                      (
                      
                        
                          C
                          
                            
                              n
                              1
                            
                            ,
                            
                              n
                              2
                            
                          
                        
                        ⁡
                        
                          (
                          k
                          )
                        
                      
                      )
                    
                  
                  +
                  
                    
                      
                        λ
                        _
                      
                      k
                    
                    ⁢
                    
                      
                        R
                        
                          
                            n
                            1
                          
                          ,
                          
                            n
                            2
                          
                        
                        g
                      
                      ⁡
                      
                        (
                        
                          
                            C
                            
                              
                                n
                                1
                              
                              ,
                              
                                n
                                2
                              
                            
                          
                          ⁡
                          
                            (
                            k
                            )
                          
                        
                        )
                      
                    
                  
                
                ⌋
              
            
          
        
        ⁢
        
           
        
      
    
    
      
        (
        15
        )
      
    
  




Since in general there is no prior knowledge of the rate Rkf associated with the frame f(i,j,k), it would not be possible to compute {overscore (λ)}k such that (11) is fulfilled. An efficient method is proposed that is base on a scheme as described in [6]. This scheme implicitly estimates the noise power from the input data without the need for additional a priori information. An estimate {overscore (λ)}k* of the optimal {overscore (λ)}kis computed as: 



  
    
      
        
          
            
              λ
              _
            
            k
            *
          
          =
          
            arg
            ⁢
            
               
            
            ⁢
            
              
                
                  
                     
                  
                  ⁢
                  max
                
                
                  
                     
                  
                  ⁢
                  
                    λ
                    k
                  
                
              
              ⁢
              
                
                  
                    d
                    2
                  
                  ⁢
                  
                    R
                    k
                    g
                  
                
                
                  d
                  
                    
                      (
                      
                        λ
                        k
                      
                      )
                    
                    2
                  
                
              
            
          
        
        ⁢
        
           
        
      
    
    
      
        (
        16
        )
      
    
  




and assumed is that Rkg({overscore (λ)}k*)=Rkf (17)

An explanation of this equation is as follows: starting from λk=0 a decreasingly smaller bit budget is allocated to encode the image sequence corrupted with additive noise, thus reducing resources to encode noise and increasing the compressibility of a picture. At a certain λk which results to be a knee-point, the exact amount of bits to encode the original sequence is allocated. After this value, the compression ratio increases slowly, which points out that fewer bits than necessary are allocated to encode video information.
In a second embodiment 10* of the invention as shown in FIG. 3, a spatial adaptive weighted averaging (SAWA) filter 23 is used as an estimator of the rate term Rkf. A detailed description of the SAWA filter can be found in [7]. The SAWA estimate h(i,j,k) at the pixel location (i,j) in the kth frame is defined as 



  
    
      
        
          h
          ⁡
          
            (
            
              i
              ,
              j
              ,
              k
            
            )
          
        
        =
        
          
            ∑
            
              
                (
                
                  m
                  ,
                  n
                  ,
                  l
                
                )
              
              ∈
              
                S
                ⁡
                
                  (
                  
                    i
                    ,
                    j
                    ,
                    k
                  
                  )
                
              
            
          
          ⁢
          
            
              w
              ⁡
              
                (
                
                  m
                  ,
                  n
                  ,
                  l
                
                )
              
            
            ⁢
            
              g
              ⁡
              
                (
                
                  m
                  ,
                  n
                  ,
                  l
                
                )
              
            
          
        
      
    
    
      
        (
        18
        )
      
    
  
  
    
      
        
          where
          ⁢
          
             
          
          ⁢
          
            w
            (
            
              m
              ,
              n
              ,
              l
            
            )
          
        
        =
        
          
            K
            ⁡
            
              (
              
                i
                ,
                j
                ,
                k
              
              )
            
          
          
            1
            +
            
              α
              ⁢
              
                 
              
              ⁢
              max
              ⁢
              
                {
                
                  
                    ɛ
                    2
                  
                  ,
                  
                    
                      [
                      
                        
                          g
                          ⁡
                          
                            (
                            
                              i
                              ,
                              j
                              ,
                              k
                            
                            )
                          
                        
                        -
                        
                          g
                          ⁡
                          
                            (
                            
                              m
                              ,
                              n
                              ,
                              l
                            
                            )
                          
                        
                      
                      ]
                    
                    2
                  
                
                }
              
            
          
        
      
    
    
      
        (
        19
        )
      
    
  




are the weights within the spatial Support S(i,j,k), defined as the 3×3 spatial window centered about the current pixel location. K(i,j,k) is a normalization constant and a and εare tuning parameters. The quantity a, usually set at 1, controls how rapidly the weights should reduce as a function of the mismatch between pixels values, whereas the parameters ε2 determines the switching between weighted and direct averaging. In order to obtain accurate estimates of the number of bits to encode the DFD regardless of the noise level, a relationship between the parameter ε2 and the noise variance σn2 may be determined experimentally. From a number of experiments has been achieved that ε2=(δσn2)2, where δ is a tuning constant. The estimate Rkf* of the rate Rkf is then the number of bits used to encode:

DFD(h,{tilde over (h)})=Q(hk1,k2(i,j,k)−{tilde over (h)}(i+dk1,k2x(k), j+dk1,k2y(k),k−1))  (20)

The number of bits Rkf* is determined in VLC 17 and furnished to the CPU 12* of the noise filter 12. The parameter set {overscore (C)}k can be computed for each frame, but also kept constant for a certain number of frames.

In general, three-dimensional filtering techniques may be employed to exploit both the spatial correlation between the pixels and the temporal correlation between the frames. Furthermore, in order to reduce the processing burden, the filtering procedure may be separated in a spatial part, which operates on each frame separately, and a temporal part operating in the direction of motion. This technique is more advantageous especially for low SNR's since the displacement vectors are now estimated from the current and the previous frame after they have been spatially filtered, which provides additional robustness to the motion estimates. According to this strategy, SAWA pre-filtering of the current frame g(i,j,k) may be done first, and then the MC temporal filter may be applied to the smoothed images; i.e. g(i,j,k) of equation (5) is replaced by h(i,j,k) of equation (18), see FIG. 3. In order to achieve optimal distortion performance, ε2=2σn2 is set for SAWA pre-filtering.
A video coder according to the invention can be used in many applications, such as broadcast, video-phone, videoconferencing systems, satellite observation, surveillance systems, etc. FIG. 4 shows a camera system according to the invention, comprising a camera 100 and a device 200. The camera furnishes the image sequence g(i,j,k) to the device 200. The device 200 is similar to the device 10 or the device 10* as shown in FIGS. 2 and 3 respectively.
The invention is especially applicable on low bit-rate motion compensated hybrid coding schemes, such as H.261 and H.263, but also on MPEG.
In summary, the invention provides a method of and a device for coding an image sequence g(i,j,k). The device has a noise filter for noise filtering the image sequence g(i,j,k), and means for regarding the noise filtering as a rate-distortion optimization problem in order to adapt the response of the noise filter. In particular, a filter parameter set C is determined to adapt the response of the filter in that the image sequence g(i,j,k) is encoded using an optimal bit-budget, which is the bit-budget used for compressing a noise-free image sequence, and the distortion for the given bit-budget is minimized.
A solution of the rate-distortion problem is proposed that calculates the filter parameter set C by a Lagrange multiplier method. Separate minimization is used to determine each parameter of the parameter set C independently. In a practical embodiment, spatial adaptive weighted averaging filtering is used to estimate the bit budget and to pre-filter the image sequence g(i,j,k).
It should be noted that the above-mentioned embodiments illustrate rather than limit the invention, and that those skilled in the art will be able to design many alternative embodiments without departing from the scope of the appended claims. In the claims, any reference signs placed between parentheses shall not be construed as limiting the claim. The word “comprising” does not exclude the presence of other elements or steps than those listed in a claim. The invention can be implemented by means of hardware comprising several distinct elements, and by means of a suitably programmed computer. In a device claim enumerating several means, several of these means can be embodied by one and the same item of hardware.
REFERENCES


    [1] R. P. Kleihorst, A. van der Werf, W. H. A. Bruls, W. F. J. Verhaegh, and E. Waterlander, “MPEG2 video encoding in consumer electronics”, J. VLSI Signal Processing Syst., Vol. 17, pp. 1-13, 1997.
    [2] A. K. Katsaggelos, J. N. Driessen, S. N. Efstratiadis, and R. L. Lagendijk, “Spatio-temporal motion compensated noise filtering of image sequences”, Proc. SPIE Conf. Visual Commun. and Image Processing, Vol. 1199, pp. 61-70, 1989.
    [3] S. Olivieri, G. de Haan, and L. Albani, “Noise-robust recursive motion estimation for H.263 based videoconferencing systems”, Proc. MMSP'99, 1999.
    [4] K. Ramchandran, A. Ortega, M. Vetterli, “Bit allocation for dependent quantization with applications to multiresolution and MPEG video coders”, EEE Trans. Image Processing, Vol. 3, pp. 533-545, September 1994.
    [5] Y. Shoham and A Gersho, “Efficient bit allocation for an arbitrary set of quantizers”, IEEE Trans. Acoust., Speech, Signal Processing, Vol. 36, pp. 1445-1453, September 1988.
    [6] B. K. Natarajan, “Filtering random noise from deterministic signals via data compression”, IEEE Trans. Signal Processing, vol. 43, pp. 2595-2605, November 1995.
    [7] M. K. Ozkan, M. I. Sezan, and A. M. Tekalp, “Adaptive motion-compensated filtering of noisy image sequences”, IEEE Trans. Circuits Syst. Video Technol., Vol. 3, pp. 277-290, August 1993.

## Claims

1. A method of coding (10,10*) an image sequence g(i,j,k)), the method comprising the steps of:
noise filtering (12) the image sequence (g(i,j,k)); and 
adapting (12*) said noise filtering (12) in dependence on a rate-distortion optimization of said coding (10,10*) by calculating (12*) a filter parameter set (C) of said noise filtering (12) by a Lagrange multiplier method and estimating (12*) an optimal Lagrange multiplier by determining a maximum of a second derivative of a rate used in the rate-distortion optimization.

2. A device (10,10*) for coding an image sequence (g(i,j,k)), the device comprising:
means (12) for noise filtering the image sequence g(i,j,k)); and 
means (12*) for adapting a response of said means for noise filtering (12) in dependence on a rate-distortion optimization of said coding (10,10*) by calculating (12*) a filter parameter set (C) of said noise filtering (12) by a Lagrange multiplier method and estimating (12*) an optimal Lagrange multiplier by determining a maximum of a second derivative of a rate used in the rate-distortion optimization.

3. A camera system comprising a camera (100) and a device (200) as claimed in claim 2.