# Patent

## Title
Method and apparatus for reframing and encoding a video signal

## Abstract

Reframing is used to re-size an image or video content, e.g. for displaying video signals with a given aspect ratio on a display having a different aspect ratio. Window cropping parameters (position and size over time) are constrained in order to optimise the rate/distortion of the encoded output video signal. Initial reframing is improved by computing a saliency map representing a user attention map which considers the video coding context and by providing a macroblock coding efficiency cost map and then taking the saliency map or a combined saliency/coding cost map into account so that the coding cost for said reframed video signal is smaller than the coding cost for other candidate reframing windows' sizes and positions.

## Background
This application claims the benefit, under 35 U.S.C.§365 of International Application PCT/EP2012/062196, filed Jun. 25, 2012, which was published in accordance with PCT Article 21(2) on Jan. 24, 2013 in English and which claims the benefit of European patent application No. 11305937.2, filed Jul. 19, 2011.
The invention relates to a method and to an apparatus for reframing and encoding an original video signal, wherein the reframing window position and/or size is adapted so as to reduce the encoding cost of the reframed video signal.
BACKGROUND
Reframing is used to re-size an image or video content, e.g. for displaying video signals with a given aspect ratio on a display having a different aspect ratio. For example, High Definition (HD) video content might not be well suited for display on a small portable device.
EP 1748385 A2 discloses dynamic reframing based on a human visual attention model, in which source video content is appropriately cropped in order to keep the region of interest. The output signal may be encoded and transmitted via a network.
C. Chamaret, O. LeMeur, “Attention-based video reframing: validation using eye-tracking”, 19th International Conference on Pattern Recognition ICPR'08, 8-11 Dec. 2008, Tampa, Fla., USA, also describes reframing applications.
O. LeMeur, P. LeCallet and D. Barba, “Predicting visual fixations on video based on low-level visual features”, Vision Research, vol. 47, no. 19, pp. 2483-2498, September 2007, describes the calculation of a dynamic saliency map, based on a visual attention model.
INVENTION
It appears that no known reframing processing addresses the bit rate and distortion of the output cropped and encoded video signal. For example, a cropping window may track a region of interest, without considering the coding complexity of the encoded video signal. This can result in multiple zooming and de-zooming, pannings and thereby in high coding cost for appearing areas. When the final reframed video signal is encoded, for example by using an H.264/AVC encoder, this can result in an increase of the bit rate and/or a decrease of video quality.
A problem to be solved by the invention is to provide a video source signal reframing wherein the cropping window position and size takes into account the rate/distortion of an encoded output video signal containing that cropped window. This problem is solved by the method disclosed in claim 1. An apparatus that utilises this method is disclosed in claim 2.
According to the invention, the cropping window parameters (position and size over time) are constrained in order to optimise the rate/distortion of the encoded output video signal. An initial reframing is improved by considering the video coding context and then by taking into account the coding efficiency cost induced if the reframed video sequence is encoded.
In principle, the inventive method is suited for reframing an original video signal, followed by an encoding of the reframed video signal, said method including the steps:

    
    
        computing a saliency map for a current picture of said original video signal, said saliency map representing a user attention map;
        providing a macroblock coding efficiency cost map for said current picture of said original video signal, and combining said saliency map and said macroblock coding efficiency cost map;
        selecting a candidate reframing window size and position within said current picture of said original video signal;
        by using said saliency map or said combined saliency and macroblock coding efficiency cost map, determining in said original video signal a different position and/or size of the reframing window, for which different position and/or size the coding cost for said reframed video signal are smaller than the coding cost for said candidate reframing window size and position;
        encoding said corresponding reframed video signal.
    
    


In principle the inventive apparatus is suited for reframing an original video signal, followed by an encoding of the reframed video signal, said apparatus including:

    
    
        means being adapted for computing a saliency map for a current picture of said original video signal, and for providing a macroblock coding efficiency cost map for said current picture and for combining said saliency map and said macroblock coding efficiency cost map, said saliency map representing a user attention map;
        means being adapted for selecting a candidate reframing window size and position within said current picture of said original video signal, and for determining in said original video signal a different position and/or size of the reframing window, by using said saliency map or said combined saliency and macroblock coding efficiency cost map, for which different position and/or size the coding cost for said reframed video signal are smaller than the coding cost for said candidate reframing window size and position;
        encoding means for said corresponding reframed video signal.
    
    


Advantageous additional embodiments of the invention are disclosed in the respective dependent claims.



DRAWINGS
Exemplary embodiments of the invention are described with reference to the accompanying drawings, which show in:
FIG. 1 overall block diagram of the inventive processing;
FIG. 2 reframing processing according to the invention;
FIG. 3 anisotropic extension of a cropping window;
FIG. 4 anisotropic extension based on macro-block cost map;
FIG. 5 choice between several cropping windows regarding their coding costs Ci;
FIG. 6 cropping window displacement optimised for video coding.



EXEMPLARY EMBODIMENTS
In FIG. 1 a source video signal is fed to saliency computing step or stage 12 and to a reframing step/stage 16. The saliency computing step or stage 12 computes a saliency map 13 of the current source video signal content, whereby the saliency map represents a user attention map and provides, e.g. per pixel, a saliency value that characterises its perceptual relevancy. The input is the current picture content whereas the output is a map showing which sections of the picture get which attention by humans when looking at that picture, or looking at that picture within a video sequence. A block or macroblock coding efficiency cost map is calculated in a corresponding step/stage 14, which receives its input signal from an encoded version of the source video signal. If step/stage 14 is present, its output signal is combined 15 with the saliency map 13. The result is also input to the reframing step/stage 16, which operates as described in the following, and outputs a reframed video signal 17 with reduced coding cost. The reframed video signal 17 is encoded in an encoder 18 (e.g. by using H.264 processing), resulting in encoded reframed video signal with optimised rate/distortion properties.
To optimise the rate/distortion of the output video signal encoding, the cropping window is following some rules:

    
    
        Avoid appearing areas or objects on window borders because this induces intra-coding mode blocks and requires more bits for encoding than inter-coding mode or skip mode. If appropriate, an electronic image stabiliser should be used.
        Avoid changing size of objects: to favour good inter prediction the zoom factor should follow video motion parameters.
        Favour constant dominant motion: encoding can be more efficient if the content motion is constant (good use of bi-directional prediction, skip and direct modes).
        Try to not enclose macro-blocks that are difficult to encode. When reframing compressed video, use the macroblock coding efficiency cost map for trying to reject costly areas of the image if such areas are not of interest.
    
    


FIG. 2 shows the reframing processing in more detail. The original source sequence 21 is checked with a visual attention model 22, resulting in a saliency map for a current picture (corresponds to 12 and 13 in FIG. 1). The following cropping window extraction 23 (corresponds to 16 in FIG. 1) outputs a reframed sequence 24, and includes an initial window extraction 231, a temporary consistency check 232 and an aspect ratio processing 233 as described below.
Following are several complementary embodiments that address bit rate reduction of the encoded output reframed video sequence.
A. Improving Temporal Consistency
In this section the fact is used that a temporally more stable image will in principle need fewer bits for encoding.
A.1 Simple Temporal Constraint
A Kalman filter is used to control the position and the size of the cropping window. In a first implementation the covariance noise matrix Q is constrained. The goal of the Kalman filter application is to smooth the variations of the raw values provided by the attention model 22, i.e. the variations of the content of the saliency map over time. In the Kalman modelisation, the raw values given by the attention model 22 are considered as representing a noise measurement while it is tried to estimate the optimal cropping parameters (centre and size of window). The current state xk of the parameters of the cropping window is defined as xk=Akxk−1+Bkuk+wk, where Ak is the state transition model applied to the previous state, Bk is the control input model, uk is the control vector, wk is the state noise with wk≈N(0,Qk), and N is the normal distribution with zero mean and covariance Qk.
At time k an observation or measurement zk of the true state xk is made and is defined as zk=Hkxk+vk,
where Hk is the observation model which maps the true state space into the observed space and vk is the observation noise with vk≈N(0,Rk) that is assumed to be zero mean Gaussian white noise with covariance Rk.
In the reframing application, the Kalman filter is used as follows. The state xk defines the position of the centre of the cropping window and its size. It is defined as:




  
    x
    k
  
  =
  
    
      [
      
        
          
            centerColumn
          
        
        
          
            centerLine
          
        
        
          
            windowWidth
          
        
        
          
            windowHeight
          
        
      
      ]
    
    .
  




For each image, the Kalman filter is applied in two steps: prediction phase and update phase.
In the prediction phase, the prediction step estimates the current state with the previous state and the state transition model. In this particular case, the Kalman filter is used to stabilise the cropping window parameters. Consequently the predicted state {circumflex over (x)}k is mostly a copy of the previous state:

    
    
        {circumflex over (x)}k=xk−1, if Ak is the identity matrix and Bk=0, {circumflex over (P)}k=Pk−1+Qk−1, wherein Pk is the covariance matrix that controls the system noise.
    
    


The update phase is a correction of the prediction using the noisy measure:
{tilde over (y)}k=zk−{circumflex over (x)}k is the measurement residual, where zk are the raw window parameters given by the attention model, and Hk is the identity matrix.

xk={circumflex over (x)}k+Kk{tilde over (y)}k, Pk=(I−Kk){circumflex over (P)}k−1,

wherein





  
    K
    k
  
  =
  
    
      
        P
        ^
      
      k
    
    
      
        
          P
          ^
        
        k
      
      +
      
        R
        k
      
    
  




is the matrix gain that minimises the a posteriori error covariance.

As an initial estimate the centre of the screen can be chosen. R and Q are constant diagonal matrices that define state and measure covariance noise, respectively. In this context, the simplest way to implement a temporal constraint is to lower the values in the state covariance noise matrix Q.
This solution does not consider video content with moving background (or non-zero dominant motion). The next section considers this more complex case.
A.2 Dominant Motion Constraint
In case of video content with non-zero dominant motion, i.e. with background translation and/or zoom, to improve coding efficiency, the cropping window follows the dominant motion in order to avoid appearing blocks at the border of the image and to avoid size change of objects for better interpicture prediction.
In the visual attention model, a motion estimator is used that computes parameters of dominant motion with a 6-parameters affine model. In the context previously defined, these parameters are used to derive background translation and zoom.
As before, the Kalman filter state is defined as:




  
    x
    k
  
  =
  
    
      [
      
        
          
            centerColumn
          
        
        
          
            centerLine
          
        
        
          
            windowWidth
          
        
        
          
            windowHeight
          
        
      
      ]
    
    .
  




This time the command is non-null and is used to follow dominant motion:




  
    u
    k
  
  =
  
    
      
        [
        
          
            
              translation_x
            
          
          
            
              translation_y
            
          
          
            
              zoom_dx
            
          
          
            
              zoom_dy
            
          
        
        ]
      
      ⁢
      
        
      
      ⁢
      and
      ⁢
      
        
      
      ⁢
      
        B
        k
      
    
    =
    
      
        [
        
          
            
              1
            
            
              
                
              
            
            
              
                
              
            
            
              0
            
          
          
            
              
                
              
            
            
              1
            
            
              
                
              
            
            
              
                
              
            
          
          
            
              
                
              
            
            
              
                
              
            
            
              1
            
            
              
                
              
            
          
          
            
              0
            
            
              
                
              
            
            
              
                
              
            
            
              1
            
          
        
        ]
      
      .
    
  




Again, for each image the Kalman filter is applied in two steps: prediction phase and update phase.
In the prediction phase, the prediction step estimates the current state with the previous state and the state transition model. The cropping window parameters are allowed to change only according to the dominant motion:

    
    
        {circumflex over (x)}k=xk−1+Bkuk, where Ak is the identity matrix, {circumflex over (P)}k=Pk−1+Qk-1,
    
    


The update phase is a correction of the prediction using a noise measure:
{tilde over (y)}k=zk−{circumflex over (x)}k is the measurement residual, where zk are the raw window parameters given by the attention model, and Hk is the identity matrix.




  
    K
    k
  
  =
  
    
      
        P
        ^
      
      k
    
    
      
        
          P
          ^
        
        k
      
      +
      
        R
        k
      
    
  




is the matrix gain that minimises the a posteriori error covariance.

xk={circumflex over (x)}k+Kk{tilde over (y)}k, Pk(I−Kk){circumflex over (P)}k−1 

As an initial estimate the centre of the screen can be chosen. Q and R are constant diagonal matrices that define state and measure covariance noise. Here again the state covariance noise matrix Q defines the relation between the model and the actual output. It also takes into account the noise in the estimation of the dominant motion parameters. If Q has low values, the output is strongly constrained to the model, otherwise (Q has high values) it will faster follow the attention model output and possibly high variations due to noise.
The output of the dominant motion uk can also be integrated into the Kalman filter for improving temporal consistency.
B. Constraining by Macro-Block Cost
It is assumed that the original video sequence 11, 21 comes with values of encoding cost if it is a compressed video sequence. As is well-known, the coding cost of a given macroblock is represented the number of bits required to encode that macroblock using a current quantisation parameter q. According to the invention, these input sequence coding costs are used for constraining the reframing. The processing defined in the following can be used in addition to, or independently from, the processings described in section A.
B.1 Constrained by Overall Image Cost
The state covariance noise matrix Q of the Kalman filter can be derived from the overall cost of the picture sequence. If the cost of the input sequence is low, it can be predicted that the cost of the cropped picture will also be low, and as a consequence the constraints for reducing the cost of the cropped sequence can be lowered.
As an example, the matrix Q can be defined as Q=I·(σ−λ·cost), where I is the identity matrix, σ is a constant, λ is a weighting parameter that gives more or less weight to the cost, and cost is the coding cost of the sequence in megabytes per second (MB/s).
B.2 Constraining Window Enlargement with Macro-Block Cost Map
This implementation deals with the aspect ratio step/stage 233 described in FIG. 2. Once the first cropping window has been extrapolated in step/stage 231 out of the saliency map, its location and size is smoothed temporally. Thereafter an anisotropic extension is performed, of which the different variables and notations are depicted in FIG. 3.
The aspect ratio AR is the ratio between the width and the height of the original video signal 11 and 22. The anisotropic extension refines the cropping window size by extending the cropping window CWiSM(xSM,ySM,wSM,hSM) in a direction depending on the current aspect ratio RSM, wherein SM refers to salience map. The extension is either on width or on height for achieving the targeted aspect ratio RTG.




  
    R
    SM
  
  =
  
    
      w
      SM
    
    
      h
      SM
    
  




is the aspect ratio resulting from the extraction from the saliency map, and





  
    R
    TG
  
  =
  
    
      
        w
        TG
      
      
        h
        TG
      
    
    =
    
      
        w
        AR
      
      
        h
        AR
      
    
  




is the target aspect ratio.

If RTG>RSM, horizontal extension is performed (on the width of the current rectangle) else vertical extension is performed (on the height of the current rectangle).
Assuming a horizontal extension (for vertical extension in parentheses), one can define:



  
    
      h
      AR
    
    =
    
      
        h
        SM
      
      ⁡
      
        (
        
          
            w
            AR
          
          =
          
            w
            SM
          
        
        )
      
    
  




  
    
      w
      AR
    
    =
    
      
        w
        SM
      
      +
      
        
          d
          w
        
        ⁡
        
          (
          
            
              h
              AR
            
            =
            
              
                h
                SM
              
              +
              
                d
                h
              
            
          
          )
        
      
    
  




  
    
      x
      AR
    
    =
    
      
        x
        SM
      
      +
      
        
          d
          x
        
        ⁡
        
          (
          
            
              x
              AR
            
            =
            
              x
              SM
            
          
          )
        
      
    
  




  
    
      y
      AR
    
    =
    
      
        y
        SM
      
      ⁡
      
        (
        
          
            y
            AR
          
          =
          
            
              y
              SM
            
            +
            
              d
              y
            
          
        
        )
      
    
  




  where




  
    
      
        d
        w
      
      =
      
        
          
            d
            left
          
          +
          
            d
            right
          
        
        =
        
          
            
              
                
                  w
                  AR
                
                
                  
                    h
                    AR
                  
                  ⁢
                  
                    
                  
                
              
              ×
              
                h
                SM
              
            
            -
            
              w
              SM
            
          
          =
          
            
              
                R
                TG
              
              ×
              
                h
                SM
              
            
            -
            
              w
              SM
            
          
        
      
    
    ,
    
      

    
    ⁢
    
      
        d
        x
      
      =
      
        
          
            x
            SM
          
          +
          
            
              
                (
                
                  
                    d
                    right
                  
                  -
                  
                    d
                    left
                  
                
                )
              
              2
            
            ⁢
            
              
            
            ⁢
            and
            ⁢
            
              
            
            ⁢
            
              w
              AR
            
          
        
        =
        
          
            w
            SM
          
          +
          
            d
            left
          
          +
          
            
              d
              right
            
            .
          
        
      
    
  



Once the side of extension is defined, there are still several ways to extend the window. In other words, dright and dleft may be computed in a different manner. In the following it is assumed that the width wSM is to be extended to reach the final aspect ratio. The extension may be entirely transferred to the left side, such as dleft=dw and dright=0, to the right side, such as dleft=0 and dright=dw, or to both sides in the same proportion, such as




  
    d
    left
  
  =
  
    
      
        
          d
          w
        
        2
      
      ⁢
      
        
      
      ⁢
      and
      ⁢
      
        
      
      ⁢
      
        d
        right
      
    
    =
    
      
        
          d
          w
        
        2
      
      .
    
  




Such solutions are not optimal from a content point of view. Therefore, in the prior art a finer analysis of the saliency map was carried out to favour one side or the other one.

According to the invention a new criterion is used for the choice of the extended direction: the coding cost based on a macro-block coding efficiency cost map for a current picture, which is depicted in FIG. 4. In case the area of one direction costs more bits to be coded (deduced by the macroblock cost map) than the other direction, the other direction is favoured. I.e., the cropping window is extended in the opposite direction proportionally to the bits cost in each direction, whereby this cost is minimised. The extensions to the left and/or to the right are computed as follows:
dright and dleft should be found such as




  
    
      
        
          
            d
            right
          
          
            d
            left
          
        
        =
        
          
            
              C
              right
              
                ma
                ⁢
                
                  
                
                ⁢
                x
              
            
            
              C
              left
              
                ma
                ⁢
                
                  
                
                ⁢
                x
              
            
          
          .
        
      
    
    
      
        (
        1
        )
      
    
  




The bits cost Crightmax and Cleftmax are computed by considering a full extension to the left (dleft=wAR−wSM and dright=0) and fully to the right (dright=wAR−wSM and dleft=0), where



  
    
      C
      left
      
        ma
        ⁢
        
          
        
        ⁢
        x
      
    
    =
    
      
        ∑
        
          y
          =
          
            
              y
              SM
            
            -
            
              
                h
                SM
              
              2
            
          
        
        
          y
          =
          
            
              y
              SM
            
            +
            
              
                h
                SM
              
              2
            
          
        
      
      ⁢
      
        
          ∑
          
            x
            =
            
              x
              inf
            
          
          
            x
            =
            
              
                x
                inf
              
              +
              
                d
                w
              
            
          
        
        ⁢
        
          
            C
            ⁡
            
              (
              
                x
                ,
                y
              
              )
            
          
          ⁢
          
            
          
          ⁢
          and
        
      
    
  




  
    
      C
      right
      
        ma
        ⁢
        
          
        
        ⁢
        x
      
    
    =
    
      
        
          ∑
          
            y
            =
            
              
                y
                SM
              
              -
              
                
                  h
                  SM
                
                2
              
            
          
          
            y
            =
            
              
                y
                SM
              
              +
              
                
                  h
                  SM
                
                2
              
            
          
        
        ⁢
        
          
            ∑
            
              x
              =
              
                
                  x
                  sup
                
                -
                
                  d
                  w
                
              
            
            
              x
              =
              
                x
                sup
              
            
          
          ⁢
          
            
              C
              ⁡
              
                (
                
                  x
                  ,
                  y
                
                )
              
            
            .
            
              

            
            ⁢
            
              x
              inf
            
          
        
      
      =
      
        
          x
          SM
        
        -
        
          
            w
            SM
          
          2
        
        -
        
          
            (
            
              
                w
                AR
              
              -
              
                w
                SM
              
            
            )
          
          ⁢
          
            
          
          ⁢
          and
        
      
    
  




  
    
      x
      sup
    
    =
    
      
        x
        SM
      
      +
      
        
          w
          SM
        
        2
      
      -
      
        (
        
          
            w
            AR
          
          -
          
            w
            SM
          
        
        )
      
    
  



can be defined. Once the saliency quantities available on each side are known, one can estimate the extensions dright and dleft on each direction, when using the equation (1):





  
    
      d
      left
    
    =
    
      
        
          d
          w
        
        ×
        
          C
          left
          
            m
            ⁢
            
              
            
            ⁢
            ax
          
        
      
      
        
          C
          left
          
            ma
            ⁢
            
              
            
            ⁢
            x
          
        
        +
        
          C
          right
          
            ma
            ⁢
            
              
            
            ⁢
            x
          
        
      
    
  
  ,
  
    
      d
      right
    
    =
    
      
        
          d
          w
        
        ×
        
          C
          right
          
            ma
            ⁢
            
              
            
            ⁢
            x
          
        
      
      
        
          C
          left
          
            ma
            ⁢
            
              
            
            ⁢
            x
          
        
        +
        
          C
          right
          
            m
            ⁢
            
              
            
            ⁢
            ax
          
        
      
    
  




B.3 Predefined Window Location Chosen by Macro-Block Cost Map

Another way to constraint the location of the cropping window box is to compute only the cost corresponding to several reachable cropping windows in the neighbourhood, as depicted in FIG. 5, and to keep the one with the smallest coding cost. The set of M candidate cropping windows has the corresponding cost {C0 . . . CM}. The coding cost of the final location of the cropping window and thereby the final location itself is determined by Cfinal=Min{C0 . . . CM}.
C. Other Features
C.1 Constraint at the Saliency Map Level
Another interesting embodiment is to merge the saliency map with the macro-block cost map, such that an expensive coding cost macro-block decreases its corresponding saliency in the final saliency map. Thereby the potential impact of an expensive macro-block is decreased in the determination of the final cropping window location.
One way to merge the two maps is to apply the following processing, called Coherent Normalisation, Sum plus Product (CNSP):

SMfinal=NC(SM)+NC(MBinv)+(1+NC(SM))·(1+NC(MBinv)),

where MB is a macro-block coding efficiency cost map value in the range 0 . . . 255, MBinv=255−MB, SM is a salience map value, and NC is the normalisation operator driven by a priori knowledge. Instead of using the global maximum of each map, this operator uses an empirical value.

C.2 Cropping Window Displacement Constraint by Encoder Architecture

Some simplifications can be performed to adapt the cropping window to the encoder architecture, but also to improve coding efficiency in some cases:

    
    
        Insure alignment of the cropping window on the macroblock grid between prediction frame and current frame. It will improve the temporal prediction quality, but also may help to select the appropriate block size. The drawback is that a smooth temporal variation of the cropping window should be anyway guaranteed; otherwise some temporal artefacts will be visible.
        Similarly the cropping window position can be set to match the pixel sampling grid. In that case the motion vector will be necessarily a multiple of a number of pixels, and sub-pel motion estimation may not be necessary. Advantageously, this leads to a significant simplification of the encoder.
        Re-use any information from the re-framing process. For instance, in order to compute the saliency areas, it is necessary to compute the motion between frames. This information can be passed to the video encoder to help or replace the encoder motion estimation. Similarly, temporal variations of the cropping window are monitored and managed to ensure a smooth behaviour similar to the camera-man way of shooting. These virtual camera movements can also be used by the encoder to help motion estimation.
        If the source input video signal is an encoded one (whatever the encoder format), it is possible to re-use coding information like parameters, like it is known from video signal transcoding or transrating.
    
    


In addition to such adaptations of the re-framing process for the encoding, it is also possible to include the reframing process within the encoding loop. For instance, the cropping window can be computed during the encoding of a frame such that the encoding and the re-framing are jointly optimised instead of being performed as a pre-processing. There are several advantages in doing that:

    
    
        First, the full picture can be encoded and some encoding strategy can be adapted to the cropping window, i.e. H.264/AVC SEI messages are used to signal to the decoder the optional cropping window, higher bit-rate/encoding quality can be set for the cropping window, different slices can be used for the two areas, skip modes can be set for the non cropping window.
        Second, the full frame can be used in the encoder but only the cropping window is encoded. This allows the previously described joint optimisations of the cropping window size and position as well as encoding, and the motion estimation can be performed on the full frame to prevent border effects and to ease encoding of the motion field (better homogeneity), provides the possibility of dynamically switching from the cropping window to the full frame.
        Third, as mentioned, many computations from one process can be re-used by a subsequent process, instead of performing them twice. The architecture and the CPU performance (or hardware complexity) will be globally reduced, and such system offers more functionalities and flexibility.

## Claims

1. A method for reframing an original video signal, followed by an encoding of the reframed video signal, the method comprising:
computing a saliency map for a current picture of said original video signal, said saliency map representing a user attention map;
providing a macroblock coding efficiency cost map for said current picture of said original video signal;
selecting a candidate reframing window size and position within said current picture of said original video signal;
using in combination said saliency map and said macroblock coding efficiency cost map for determining in said original video signal a different position and/or size of the reframing window, for which different position and/or size the coding cost for said reframed video signal are smaller than the coding cost for said candidate reframing window size and position;
encoding said corresponding reframed video signal.

2. The method according to claim 1, wherein a Kalman filter is used to control the variation of the position and the size of the reframing window due to variations of the content of the saliency map over time.

3. The method according to claim 2, wherein a Kalman filter is used in two steps for each picture, for predicting a current state xk with respect to a previous state xk-1 and a state transition model so as to stabilize the reframing window parameters, and for correcting the prediction using a noisy measure, wherein state xk defines the position of the center of the reframing window and its size,




  
    x
    k
  
  =
  
    
      [
      
        
          
            centerColumn
          
        
        
          
            centerLine
          
        
        
          
            windowWidth
          
        
        
          
            windowHeight
          
        
      
      ]
    
    .

4. The method according to claim 1, wherein said macroblock coding efficiency cost map is provided and, if the aspect ratio of the candidate reframing window resulting from the current content of said saliency map is different than the aspect ratio of said original video signal, the candidate reframing window is extended correspondingly in horizontal or vertical direction so as to achieve said aspect ratio of said original video signal, wherein the direction of said extension is performed such that for the current candidate reframing window the macroblock coding cost derived from the current macroblock coding efficiency cost map is reduced.

5. The method according to claim 1, wherein said saliency map is merged with said macro-block cost map, such that an expensive coding cost macro-block decreases the corresponding saliency value in a final saliency map applied.

6. Method The method according to claim 1, wherein said encoding is a H.264/AVC encoding, wherein said encoding means are H.264/AVC encoding means.

7. The method according to claim 6, wherein said re-framing is included within the encoding loop but the full picture is encoded, and wherein SEI messages are used to signal to the decoder a reframing window to be used.

8. The method according to claim 1, wherein said reframing window is aligned to macroblock borders.

9. An apparatus for reframing an original video signal, followed by an encoding of the reframed video signal, said apparatus comprising:
computing means which compute a saliency map for a current picture of said original video signal, and for providing a macroblock coding efficiency cost map for said current picture, said saliency map representing a user attention map;
selecting means which select a candidate reframing window size and position within said current picture of said original video signal, and for determining in said original video signal a different position and/or size of the reframing window, by using in combination said saliency map and said macroblock coding efficiency cost map, for which different position and/or size the coding cost for said reframed video signal are smaller than the coding cost for said candidate reframing window size and position; and
encoding means for said corresponding reframed video signal.

10. The apparatus according to claim 9, wherein a Kalman filter is used to control the variation of the position and the size of the reframing window due to variations of the content of the saliency map over time.

11. The apparatus according to claim 10, wherein a Kalman filter is used in two steps for each picture, for predicting a current state xk with respect to a previous state xk−1 and a state transition model so as to stabilize the reframing window parameters, and for correcting the prediction using a noisy measure, wherein state x k defines the position of the center of the reframing window and its size,




  
    x
    k
  
  =
  
    
      [
      
        
          
            centerColumn
          
        
        
          
            centerLine
          
        
        
          
            windowWidth
          
        
        
          
            windowHeight
          
        
      
      ]
    
    .

12. The apparatus according to claim 9, wherein said macroblock coding efficiency cost map is provided and, if the aspect ratio of the candidate reframing window resulting from the current content of said saliency map is different than the aspect ratio of said original video signal, the candidate reframing window is extended correspondingly in horizontal or vertical direction so as to achieve said aspect ratio of said original video signal, wherein the direction of said extension is performed such that for the current candidate reframing window the macroblock coding cost derived from the current macroblock coding efficiency cost map is reduced.

13. The apparatus according to claim 9, wherein said saliency map is merged with said macro-block cost map, such that an expensive coding cost macro-block decreases the corresponding saliency value in a final saliency map applied.

14. The apparatus according to claim 9, wherein said encoding means is an H.264/AVC encoder.

15. The apparatus according to claim 14, wherein said re-framing is included within the encoding loop but the full picture is encoded, and wherein SEI messages are used to signal to the decoder a reframing window to be used.

16. The apparatus according to claim 9, wherein said reframing window is aligned to macroblock borders.

17. An encoded digital video signal that was, before the encoding, reframed according to the method of claim 1.