# Patent

## Title
Apparatus, and associated method, for forming a compressed motion vector field utilizing predictive motion coding

## Abstract

Apparatus, and an associated method, motion compensates coding of video sequences. Motion compensated prediction is utilized in the representation of motion vector fields. Reduced numbers of bits are required to represent the motion vector field while maintaining a low prediction error, thereby facilitating improved communication of, and recreation of, video frames forming a video sequence.

## Background
The present invention relates generally to a manner by which to utilize motion compensation in coding a video sequence. More particularly, the present invention relates to apparatus, and an associated method, for encoding, and decoding, a video sequence utilizing motion compensated prediction. Motion fields of a segment are predicted from adjacent segments of a video frame and by using orthogonal affine motion vector field models. Through operation of an embodiment of the present invention, motion vector fields are formed with a reduced number of bits while still maintaining a low prediction error.
BACKGROUND OF THE INVENTION
Advancements in digital communication techniques have permitted the development of new and improved types of communications. Additional advancements shall permit continued improvements in communications and communication systems which make use of such advancements.
For instance, communication systems have been proposed for the communication of digital video data capable of forming video frames. Video images utilized during video conferencing are exemplary of applications which can advantageously make use of digital video sequences.
A video frame is, however, typically formed of a large number of pixels, each of which is representable by a set of digital bits. And, a large number of video frames are typically required to represent any video sequence. Because of the large number of pixels per frame and the large number of frames required to form a typical video sequence, the amount of data required to represent the video sequence quickly becomes large. For instance, an exemplary video frame includes an array of 640 by 480 pixels, each pixel having an RGB (red, green, blue) color representation of eight bits per color component, totaling 7,372,800 bits per frame.
Video sequences, like ordinary motion pictures recorded on film, comprise a sequence of still images, the illusion of motion being created by displaying consecutive images at a relatively fast rate, say 15-30 frames per second. Because of the relatively fast frame rate, the images in consecutive frames tend to be quite similar. A typical scene comprises some stationary elements, for example the background scenery and some moving parts which may take many different forms, for example the face of a newsreader, moving traffic and so on. Alternatively, the camera recording the scene may itself be moving, in which case all elements of the image have the same kind of motion. In many cases, this means that the overall change between one video frame and the next is rather small. Of course, this depends on the nature of the movement: the faster the movement, the greater the change from one frame to the next.
Problems arise in transmitting video sequences, principally concerning the amount of information that must be sent from the transmitting device to the receiver. Each frame of the sequence comprises an array of pixels, in the form of a rectangular matrix. To obtain a sharp image, a high resolution is required i.e. the frame should comprise a large number of pixels. Today, there are a number of standardized image formats, including the CIF (common intermediate format) which is 352×288 pixels and QCIF (quarter common Intermediate format) which is 176×144 pixels. QCIF format is typical of that which will be used in the first generation of mobile video telephony equipment and provides an acceptably sharp image on the kind of small (3-4 cm square) LCD displays that may be used in such devices. Of course, larger display devices generally require images with higher spatial resolution, in order for those images to appear with sufficient spatial detail when displayed.
For every pixel of the image, color information must be provided. Typically, and as noted above, color information is coded in terms of the primary color components red, green and blue (RGB) or using a related luminance/chrominance model, known as the YUV model which, as described below, provides some coding benefits. Although there are several ways in which color information can be provided, the same problem is common to all color representations; namely the amount of information required to correctly represent the color range present in natural scenes. In order to create color images of an acceptable quality for the human visual system, each color component must typically be represented with 8 bit resolution. Thus each pixel of an image requires 24 bits of information and so a QCIF resolution color image requires 176×144×(3×8)=608256 bits. Furthermore, if that QCIF image forms part of a video sequence with a frame rate of 15 frames per second, a total of 9,123,840 bits/s is required in order to code that sequence.
As such, amounts of data sometimes must be transmitted over relatively low bit-rate communication channels, such as wireless communication channels operating below 64 kilobits per second.
Video coding schemes are utilized to reduce the amount of data required to represent such video sequences. A key of many video coding schemes is a manner by which to provide motion compensated prediction. Motion compensated prediction, generally, provides a manner by which to improve frame compression by removing temporal redundancies between frames. Operation is predicated upon the fact that, within a short sequence of the same general image, most objects remain in the same location whereas others move only short distances. Such motion is described as a two-dimensional motion vector.
Some coding advantage can be obtained using the YUV color model. This exploits a property of the human visual system, which is more sensitive to intensity (luminance) variations than it is to color variations. Thus, if an image is represented in terms of a luminance component and two chrominance components (as in the YUV model), it is possible to spatially sub-sample (reduce the resolution of) the chrominance components. This results in a reduction in the total amount of information needed to code the color information in an image with an acceptable reduction in image quality. The spatial subsampling may be performed in a number of ways, but typically each block of 16×16 pixels in the image is coded by 1 block of 16×16 pixels representing the luminance information and 1 block of 8×8 pixels for both chrominance components. In other words, the chrominance components are sub-sampled by a factor of 2 in the x and y directions. The resulting assembly of one 16×16 luminance block and two 8×8 chrominance blocks is commonly referred to as a macroblock. Using this kind of coding scheme, the amount of information needed to code a QCIF image can be calculated as follows: The QCIF resolution is 176×144. Thus the image comprises 11×9 16×16 pixel luminance blocks. Each luminance block has two 8×8 pixel sub-sampled chrominance blocks associated with it, i.e., there are also 11×9 macroblocks within the image. If the luminance and chrominance components are coded with 8 bit resolution, the total number of bits required per macroblock is 1×(16×16×8)+2×(8×8×8)=3072 bits. Thus the number of bits required to code the entire QCIF image is now 99×3072=304128 bits i.e. half the number required if no chrominance sub-sampling is performed (see above). However, this is still a very large amount of information and if a QCIF image coded in this way is part of a 15 frame per second video sequence, a total of 4,561, 920 bits/s are still required.
Video coding requires processing of a large amount of information. This necessarily means that powerful signal processing devices are required to code video images and, if those images are to be transmitted in their original form, a high bandwidth communication channel is required. However, in many situations it is not possible to provide a high capacity transmission channel. This is particularly true in video telephony applications, where the video signals must be transmitted over existing fixed line communication channels (i.e. over the conventional public telephone network) or using radio communication links, such as those provided by mobile telephone networks. A number of international telecommunications standards already exist, laying down the guidelines for video coding in these kinds of systems. The H.261 and H.263 of the International Telecommunications Union (ITU) standards are exemplary. Standard H.261 presents recommendations for video coding in transmission systems operating at a multiple of 64 kilobits/s (these are typically fixed line telephone networks), while H.263 provides similar recommendations for systems in which the available bandwidth is less than 64 kilobits per second. The two standards are actually very closely related and both make use of a technique known as motion predictive coding in order to reduce the amount of information that must be transferred.
In mobile videotelephony the aim is to transmit a video sequence over a transmission channel with an available bandwidth of approximately 20 k bits per second. The typical frame rate should be sufficient to provide a good illusion of motion and thus should be between 10 and 15 frames per second. Thus it will be appreciated that a very large compression ratio (approximately 225:1) is required in order to match a video sequence requiring some 4.5 Megabits per second to a channel capable of transferring only 20 kilobits per second. This is where motion predictive coding, as well as other techniques, comes into play.
The basic idea behind motion predictive coding is to take into account the very large amount of temporal redundancy that exists in video sequences. As explained above, in a typical video sequence recorded at comparatively rapid frame rate (i.e. greater than 10 frames per second), there are only small changes from one frame to the next. Usually the background is stationary and only some parts of the image undergo some form of movement. Alternatively, if the camera itself is moving, all elements undergo some consistent movement.
Thus it is possible to take advantage of this high degree of correlation between consecutive frames when trying to reduce the amount of information when transmitting a video sequence. In other words, one frame can be predicted from a previous, so-called reference frame, which is usually, but not necessarily, the frame immediately preceding that currently being coded. In such a coding scheme, it is typically only the differences between the current frame and the reference frame, which are coded and transmitted to the receiver. In general, this kind of coding is referred to as INTER coding. It is a necessary requirement of such a coding scheme that both the transmitter and receiver keep a record of the reference frame (e.g. previous coded frame). At the transmitter the video encoder compares the current frame with the reference, identifies the differences between the two frames, codes them and transfers information about the changes to the receiver. In the receiver the current frame is then reconstructed in a video decoder by adding the difference information to the reference (e.g. previous) frame. The frame stores in the encoder and decoder are then updated so that the current frame becomes the new reference and the process continues in an identical fashion from one frame to the next.
There are of course, some situations in which this kind of prediction cannot be used. It is obvious that the first frame of a video sequence must always be coded and transmitted as such to the decoder in the receiver. Clearly there is no previous frame that can be used as a reference for predictive coding. A similar situation occurs in the case of a scene cut. Here the current frame may be so different from the previous one that no prediction is possible and again the new frame must be coded and transmitted as such. This kind of coding is generally referred to as INTRA coding. Many coding schemes also use periodic INTRA frame coding. For example one INTRA frame may be sent every ten or twenty frames. This is done to counteract the effect of coding errors that gradually accumulate and eventually cause unacceptable distortion in the reconstructed image.
Motion predictive coding can be viewed as an extension of the INTER coding technique introduced above. The account given above describes how difference information is sent to the receiver to enable decoding of a current video frame with reference to some previous frame. The simplest and most obvious way to provide the difference information would be to send the pixel values (YUV data) of each pixel in the current image that differs from the corresponding pixel in the reference image. However, in practice this solution does not provide the reduction in data rate necessary to enable video transmission over very low bit rate channels. Motion predictive coding adopts a different approach. As previously described, both encoder and decoder maintain a record of a reference frame and the current frame is coded with reference to that stored frame. At the decoder, the current image is reconstructed with reference to the stored previous frame and the difference information transmitted from the encoder.
In the encoder, the current frame is examined on a segment-by-segment basis in order to determine the correspondence between itself and the reference frame. A number of segmentation schemes may be adopted. Frequently, the current image is simply divided into regular blocks of pixels e.g. the comparison may be done macroblock by macroblock. Alternatively, the frame may be divided on some other basis; perhaps in an attempt to better identity the different elements of the image contained therein and thus enable a more accurate determination of the motion within the frame.
Using the predefined segmentation scheme, a comparison is made between each segment of the current frame and the reference frame in order to determine the “best match” between the pixels in that segment and some group of pixels In the reference frame. Note that there is no fixed segmentation applied to the reference frame; the pixels that correspond best to a given segment of the current frame may, within certain limitations explained below, have any location within the reference. In this way motion predictive coding can be viewed as an attempt to identity the origin of a group of pixels in the current image i.e. it tries to establish how pixels values propagate from one frame to the next by looking back into the reference frame.
Once a best match has been found for a given segment within the current frame, the correspondence between the segment and the reference frame is coded using “motion vectors”. A motion vector can be considered as a displacement vector with x and y (horizontal and vertical) components, which actually points back from the segment of the current frame to pixel locations in the reference frame. Thus motion vectors actually identify the origin of pixels in the current frame by comparison with the reference frame. Coding continues until the origin of each segment in the current frame has been identified. The resulting representation can be thought of as a “motion vector field” describing the overall correspondence between the two frames.
Coding of a complete video frame, segment-by-segment, using motion vectors produces a very efficient representation of the current frame, as comparatively very few bits are required to code information about the motion vectors for each segment. However, the coding process is not perfect and there are errors and loss of information. Typically, errors arise because it is not possible to identify exactly corresponding pixel values in the reference frame. For example, there may be some change in image content from one frame to the next, so new elements appear in the current frame which have no counterparts in the reference frame. Furthermore, many predictive motion encoders restrict the type of motion allowed between frames. This restriction arises as follows: In order to further reduce the amount of information required to represent the motion vector field, motion predictive encoders typically use a “motion model” to describe the way in which pixel values may be propagated from one frame to the next. Using a motion model, the motion vector field is described in terms of a set of “basis functions,” The propagation of pixel values from one frame to the next is represented in terms of these mathematical basis functions. Typically, the motion is represented as a sum involving the basis functions multiplied by certain coefficient values, the coefficients being determined in such a way as to provide the best approximation of the motion vector field. This re-expression of the motion vector field necessarily introduces some additional error, as the motion model is unable to describe the motion vector field exactly. However, this approach has a significant advantage because now only the motion model coefficients must be transmitted to the decoder. This advantage arises because the motion field basis functions are chosen in advance, according to the implementation and the level of accuracy deemed necessary, and as such they are known to both the encoder and decoder. Many currently proposed video coding schemes that make use of motion predictive coding, and in particular the H.263 standard, are based on a translational motion field model i.e. one whose basis functions can only represent straight line movement in the x and y (horizontal and vertical) directions. Thus rotations and skewing of picture elements that may occur between consecutive frames cannot be represented and this inevitably introduces errors into the predicted motion.
Finally, and in order to compensate for the errors introduced by the motion field coding process, typical motion predictive encoders include an error estimation function. Information about the prediction error is transmitted to the decoder, together with the motion field model coefficients. In order to estimate the error introduced in the motion field coding process, a motion predictive encoder typically also includes a decoding section, identical to that found in the receiver. Once the current frame has been encoded using the motion predictive methods described above, the decoding section of the encoder reconstructs the current frame and compares it with the original version of the current frame. It is then possible to construct an “prediction error frame,” containing the difference between the coded current frame and the original current frame. This information, together with the motion field model coefficients and perhaps some information about the segmentation of the current frame, is transmitted to the decoder.
Even with the use of such an exemplary, significant amounts of data are still required to represent a video sequence.
An improved manner by which to code video sequences utilizing reduced amount of bits or reduced bit rates, while maintaining low prediction error would therefore be advantageous.
It is in light of this background information related to video data that the significant improvements of the present invention have evolved.
SUMMARY OF THE INVENTION
The present invention, accordingly, advantageously provides apparatus, and an associated method, for operating upon a video sequence utilizing motion compensated prediction.
A manner is provided by which to represent a motion vector field by dividing a video frame into segments and predicting a motion field of a segment from its adjacent segments and by using orthogonal affine motion vector field models. Operation of an embodiment of the present invention provides a manner by which to quickly, and compactly, encode motion vector fields while also retaining a low prediction error. Communication of improved-quality video frames together forming a video sequence is thereby provided.
Through operation of an embodiment of the present invention, a manner is provided by which to reduce the amount of information needed to represent the motion vector field while preserving, at the same time, a low amount of prediction error.
A motion field coder for an encoder is provided by which to form the motion vector field. Use is made of affine motion vector field modeling. In contrast, for instance, to a purely translational motion model, a more flexible representation of the motion field can be obtained using the affine modeling. Typical natural motion, such as zooming, rotation, sheer, or translation is able to be represented by affine motion vector field models. Conventional systems which utilize only a translational model are unable to represent other forms of motion.
The similarity of affine motion vector fields of neighboring segments of a video frame is exploited by utilizing affine prediction motion vector fields. If, for instance, two neighboring segments have similar motion vector fields, one of the motion vector fields can be computed from the other merely with the addition of a small, or even negligible, i.e., zero, refinement field. For each segment of a video frame, an affine motion model is selected which achieves satisfactorily low prediction error with as few non-zero coefficients as possible. Furthermore, orthogonal basis functions are utilized. The orthogonal basis functions have low sensitivity to quantization of corresponding motion coefficients so that the coefficients are able to be represented with a small number of bits. That is to say, efficient transmission of the motion coefficients requires the coefficients to be quantized to low precision levels. However, types of basis functions conventionally utilized results in unacceptable increases in prediction error when represented by a small number of bits. As the coefficients corresponding to orthogonal basis functions are much more robust to quantization, advantageous utilization of the orthogonal basis function is made during operation of an embodiment of the present invention.
In one aspect of the present invention, a motion field coder is provided for a video encoder. The motion field coder is operable to form a compressed motion vector field which is formed of a set of motion vectors of all pixels of a current frame. The motion vector field is formed of a prediction motion vector field and a refinement motion vector field.
In another aspect of the present invention, a motion compensated predictor is provided for a video encoder. The motion compensated predictor receives indications of the compressed motion vector field formed by the motion field coder. The motion compensated predictor constructs a prediction frame. The predictor is operable to reconstruct the pixels of a frame by calculating the motion vector fields of each segment thereof. The motion vector field is computed based on a prediction motion vector field and refinement motion vector field.
In yet another aspect of the present invention, a motion compensated predictor is provided for a video decoder. The motion compensated predictor receives indications of a predicted motion vector field and refinement motion vector field coefficients.
In these and other aspects, therefore, apparatus for a video device for operation upon a video sequence is provided. The video sequence is formed at least of a current video frame having at least a first neighboring segment and a second neighboring segment. The apparatus forms approximations of a motion vector field of the second neighboring segment. The apparatus includes a motion vector field builder coupled to receive indications representative of a first affine motion model forming an approximation of a first motion vector field representative of the first neighboring segment. The motion vector field builder forms a second affine motion model responsive to the indications representative of the first affine motion model. The second affine motion model forms the approximation of the motion vector field of the second neighboring segment.
A more complete appreciation of the present invention and the scope thereof can be obtained from the accompanying drawings which are briefly summarized below, the following detailed description of the presently-preferred embodiments of the invention, and the appended claims.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 illustrates an encoder and decoder of a video communication system in which an embodiment of the present invention is operable.
FIG. 2 illustrates a functional block diagram of a motion field coder which forms a portion of the communication system shown in FIG. 1.
FIG. 3 illustrates a functional block diagram of a motion compensated predictor which forms a portion of the encoder and also of the decoder of the communication system shown in FIG. 1.
FIG. 4 illustrates a manner by which a video frame is divided into segments during operation of an embodiment of the present invention.
FIG. 5 illustrates a table indicating exemplary values and meaning of selection bits utilized during operation of an embodiment of the present invention.



DETAILED DESCRIPTION
The new manner of motion predictive video coding of an embodiment of the present invention report further reduces the amount of data to be transferred from encoder to decoder in a low bit-rate video coding system, while maintaining good image quality. The manner includes a new way of further predicting the pixel values of segments in the current frame using already coded segments of that same frame.
In one exemplary implementation, when a new video sequence is to be coded and transmitted, the first frame in the sequence is transmitted in INTRA format, as known from prior art and described above. That frame is then stored in the encoder and in the decoder and forms a reference frame for the next (i.e. second) frame in the sequence.
When the encoder begins encoding the second frame, it starts the coding process by examining the first segment of the frame. In the preferred embodiment, the current frame is divided into a set of 16×16 pixel segments, but this is not essential to the method and other segmentation schemes may be envisaged. Encoding is started from the upper leftmost segment and proceeds from left-to-right and top-to-bottom throughout the frame (i.e. the coding process is performed in rows, progressing from top to bottom).
A motion vector field that describes the mapping of pixel values between the reference frame and the first segment of the current frame is determined and then a so-called “affine” motion model is used to approximate that motion vector and to generate a set of motion coefficients. The affine motion model is a special class of motion model whose mathematical form is such as to allow translational, rotational and skewing movements between frames. It comprises 6 basis functions. Thus the motion vectors are essentially replaced by a sum involving the six basis functions multiplied by appropriately chosen “motion coefficients.” It is then sufficient to transmit only the motion coefficients (or a subset thereof) to the decoder, as the basis functions themselves are known to (i.e. stored in) both encoder and decoder. The group of pixels in the reference frame that yields the best affine motion model for any given segment of the current frame may reside, at least in theory, in any region of the reference frame. It should be emphasized here that an aim of this method is not merely to minimize the prediction error, but to find the affine motion field model that yields the best match for a segment in a “rate-distortion” sense. This means that the best match is determined by taking into account both a measure of image distortion and a measure of the amount of data required to achieve that level of distortion.
Since the first (upper leftmost) segment of the frame has no previously coded neighbors, no further action can be taken and the encoder proceeds to the second segment of the current frame. Then the affine motion field model providing the best mapping between the reference frame and the second segment of the current frame is determined, using the same kind of rate-distortion, best-match evaluation as previously described. As before, the corresponding region of pixel values may reside anywhere in the reference frame and may indeed overlap with that previously determined as the best match for the first segment of the current frame.
The second segment has one previously coded neighboring segment (i.e. the first segment). The encoder now considers whether it is “more efficient” to model the second segment in terms of the affine motion model previously determined for the first segment, rather than according to the newly determined affine motion coefficients for the second segment itself. The rationale is as follows: Since the motion coefficients for the first segment have already been determined and transmitted to the decoder, it may be possible to reduce the amount of information that must be transmitted to the decoder while encoding the second segment. Hence an improvement in coding efficiency may be obtained.
However, it is unlikely that the motion coefficients for the first segment are exactly identical to those that most accurately model the motion vector field of the second segment. Therefore, the motion coefficients calculated for the first segment are not simply used as such, but a projection is performed in order to map the motion field of the first segment into the second segment. Even after this projection has been performed, it is still likely that some information about the difference between the motion fields of the first and second segments must also be sent to the decoder, in order to avoid unacceptable distortion in the reconstructed image. Thus, the encoder performs a comparison between the amount of data of required a) to transmit motion coefficient data determined specifically for the second segment and b) that required if the second segment's motion vector field is determined from a projection of the motion model of the first segment plus some “refinement” information. When making its choice of what information to transmit, the encoder must also take into account distortions that may introduced into the image by the prediction process. This comparison between options can be thought of as determining the “cost” of choosing a particular option, a trade-off between the amount of information to be transmitted and the amount of distortion allowed.
The benefit of this approach to motion predictive coding may not be immediately apparent. However, in many cases, it is found that after projection of the motion field model from a neighboring segment, very little or even zero refinement information is required. This can result in a significant reduction in the amount of data that must be transmitted from encoder to decoder. In the case where zero refinement information is required, the motion vector field of the second segment can be predicted purely on the basis of motion coefficients already stored in the decoder.
So far in this example, only the first and second segments of the frame have been considered. As explained above, according to the segmentation scheme used in the preferred embodiment of the invention, the second segment has only one neighbor that can be used to predict its motion coefficients. The same is true for all other segments on the first row of the frame. All such segments can only have previously coded neighbors immediately to their left. However, on the second and subsequent rows of the image, previously coded segments are also available above each segment. Thus, segments in subsequent rows have neighbors to the left and above. This is true for all segments except the first in each row, which only has a previously coded neighbor directly above it. Thus, when considering a general segment in a frame to be coded, there are several possibilities for the prediction of motion coefficients. In a general case, the encoder can try to predict the motion coefficients for a given segment using the motion field model for the segment above it or to the left. Alternatively, it can form some kind of average, using the motion field model for both neighbors. In each case, the motion field model predicted from the neighboring segment(s) is referred to as the “prediction field” and the difference between the prediction field and the motion field model determined specifically for the segment itself is termed the “refinement field.” In the preferred embodiment, both the prediction and refinement fields are affine motion field models. The sum of the prediction field and the refinement field should thus be equivalent to the motion field model determined by applying the affine motion model to the segment itself. In a situation where it is not possible to predict the motion field model for a given segment from any of its neighbors, the prediction field is set to zero and the refinement field becomes equal to the motion field model determined specifically for the segment itself.
As will be appreciated from the description above, there are several different ways in which a given segment can be coded. The choice of which option to use is made in the encoder on the basis of the “rate-distortion” considerations previously described. Consequently, several different types of data must be transmitted to the decoder, depending on the chosen coding option, and that information must be transmitted to the decoder in an unambiguous way, so that the segment can be correctly reconstructed and displayed. The various coding options are as follows. 1.) A given segment can be represented as a sum of a prediction field and a refinement field. 2.) The segment may be represented as a prediction field only. This situation may arise when the segment can be adequately represented in terms of the motion field of one or more of its previously coded neighbors and no refinement information is necessary, or in a case where the encoder has found it efficient to reduce the refinement field to zero. 3.) The segment in question may be coded using a motion model determined specifically for the segment using the reference frame. In this case, as described above, the prediction field is set to zero and the refinement field is set equal to the motion field model determined from the reference frame.
Basically, there are two types of information that must be transmitted to the decoder in order to enable correct reconstruction of a given segment. These are: 1.) selection information, enabling the decoder to select the correct neighboring segment(s) to use in prediction; 2.) motion coefficient information. Whenever a segment is coded using a prediction field, whether there is an associated refinement field or not, it is necessary to provide information about the neighboring segment(s) used in the prediction. It is not necessary to transmit any motion coefficient data because the motion field model(s) of the previously coded neighboring segment(s) are already known to (i.e., stored in) the decoder. Extra information may also be required if, for example, prediction is based on more than one neighboring segment, or neighboring segments have been divided into sub-segments and the motion field model of one or more of the sub-segments is used to form the prediction field. When a refinement field is used, motion coefficient values must be provided. In this case, it should be remembered that it is only necessary to transmit motion coefficient data because the motion model basis functions are know to the decoder as well as the encoder.
The data stream transmitted from encoder to decoder is therefore likely to contain both motion coefficient data and a variety of selection data (i.e., non-motion coefficient data) instructing the decoder to perform different operations. For example, if the decoder receives non-motion coefficient data, it should construct a prediction motion field model using the neighboring segment(s) or sub-segment(s) indicated by the selection data. If it receives motion coefficient data, the decoder must construct a refinement motion field model using the transmitted motion coefficient values and the stored motion model basis functions. The format of the data stream provided by the encoder in the preferred embodiment of the invention is described in detail later in the text.
Some further refinements of the method are possible. In the preferred embodiment of the invention, neighboring segments can be divided into smaller sub-segments. Specifically, each 16×16 pixel segment may be divided into four 8×8 pixel blocks and the motion field models for those sub-segments can be used to derive prediction fields. In this case, a general 16×16 pixel segment has four immediately neighboring 8×8 pixel sub-segments that may be considered, two directly above and two immediately to the left. In this situation, the decision process is a little more complicated, but works in an essentially identical fashion to that described in the preceding paragraphs. The choice of sub-segment size is not limited to the example just-presented and a variety of other sub-segment sizes can be envisaged. For example, 4×8 or 8×4 pixel blocks could be used as sub-segments.
As stated above, when the method according to the invention is applied in practice, it is often found that very little refinement information is required and the motion model of a general segment can be predicted with quite high precision from the motion field models of its neighbors. The invention includes a further feature, whereby individual coefficients of the refinement field or the entire refinement field may be set to zero, if that is efficient in a “rate-distortion sense.” In other words, the refinement field may be set to zero if the image distortion introduced in doing that is acceptable when considering the reduction in the amount of data to be transmitted. This additional feature further reduces the amount of data that must be transmitted from encoder to decoder.
Referring first to FIG. 1, a communication system, shown generally at 10, is operable to communicate a video sequence between a video sequence generator and a video sequence receiver. In the illustration of the Figure, the encoder 12 of the video sequence generator is shown, and a decoder 14 which forms a portion of the video sequence receiver is also shown. Other elements of the video sequence generator and receiver, respectively, for purposes of simplicity, are not shown. A communication path 16 is shown to interconnect the portions of the communication system. The communication path can take any of various forms, including, e.g., a radio-link.
The encoder 12 is here shown to be coupled to receive a video input on the line 18. The video input is provided to a motion estimator 22 and to an input of a subtractor 24. The motion estimator is also coupled to receive indications of a reference frame stored at a frame memory 26. The motion estimator calculates motion vectors of pixels between a frame being coded, i.e., the current video input In(x, y), and a prior, i.e., reference frame, Rref(x, y).
Once the encoder has coded each segment, the information necessary for its reconstruction can be transmitted to the decoder and the decoder can start reconstructing the segment. Because each frame is coded on a segment-by-segment basis and only previously coded segments are used in the prediction process, reconstruction of the frame at the decoder can start at once i.e. there is no need to wait until the entire frame has been encoded. Information about each segment is transmitted to the decoder as soon as it becomes available and decoding of the frame occurs at the receiver essentially in parallel with the encoding process. In videotelephony applications this has the advantage that end-to-end delay is kept to a minimum. Of course, the method can also be applied in video storage and retrieval systems where immediate transmission is not a necessary requirement. In that case, there is no requirement for data to be transmitted immediately and it might also be possible to use other neighboring segments in the current frame for prediction purposes.
The motion estimator 22 is coupled to a motion field coder 28. The motion field coder 28 is operable to form a motion vector field which is a set of motion vectors of all pixels of the current frame. The field generated by the motion field coder is provided by way of the line 32 to a multiplexor 34 thereafter to be communicated upon the communication path 16 to the video sequence receiver and the decoder 14 thereof.
The encoder is further shown to include a motion compensated (MC) predictor 36. The predictor 36 is also coupled to the frame memory 26. The predictor 36 is operable to generate a prediction frame which is supplied to the subtractor 24 and also to a summer 38.
Difference values formed by the subtractor 24 are provided to a prediction error coder 42. The prediction error coder determines the differences in pixel value between the current input video frame and the MC predicted version of the frame in order to produce an indication of the prediction error. And, in turn, the prediction error coder 42 is coupled to the multiplexor 34 and to a prediction error decoder 46. The prediction error decoding block decodes the prediction error which is added to the MC predicted current frame by the adder 38 and the result is stored in the frame memory 26.
The decoder 14 is here shown to include a demultiplexor 52, a prediction error decoder 54, a motion compensated predictor 36, a summer 56, and a frame memory 26. The predictor 36 of the encoder and of the decoder are commonly numbered as are the frame memories 26 of the respective devices.
The motion estimator 22 calculates motion vectors (Δx(x, y), Δy(x, y)) of pixels between the frame being coded, referred to as the current frame In(x, y), and the reference frame Rref(x, y). The reference frame is one of the previously coded and transmitted frames which at a given instant is available in the frame memory 26 of the encoder and also of the decoder.
Δx(x, y) and Δy(x, y) are the values of the horizontal and vertical displacements, respectively. The set of motion vectors of all pixels in the current frame, referred to as a motion vector field, is compressed by the motion field coder 28 and thereafter, as noted above, sent to the decoder.
To indicate that the compression of the motion vector field is typically lossy, the compressed motion vectors are denoted as ({tilde over (Δ)}x(x,y), {tilde over (Δ)}y(x,y)). In the motion compensated predictor 36, the compressed motion vectors and the reference frame are used to construct a prediction frame, Pn(x, y). The prediction frame is a coded version of the current frame In(x, y) calculated using the motion vector field determined by the motion estimator 22 and the motion field coder 28 and the pixel values of the reference frame Rref(x, y). The following equation shows the manner in which the prediction frame is calculated:

Pn(x,y)=Rref(x+{tilde over (Δ)}x(x,y),y+{tilde over (Δ)}(x,y))  EQUATION 1

The prediction error, i.e., the difference between the current frame and the prediction frame, is as follows:

En(x,y)=In(x,y)−Pn(x,y)  EQUATION 2

The prediction error is compressed and sent to the decoder 14. The compressed prediction error is denoted as {tilde over (E)}n(x,y).
At the decoder 14, pixels of the current coded frame Ĩn(x,y), are reconstructed by finding the prediction pixels in the reference frame RRef(x, y) using the received motion vectors and by adding the received prediction error {tilde over (E)}n(x,y) as follows:

Ĩn(x,y)=Rref(x+{tilde over (Δ)}x(x,y),y+{tilde over (Δ)}(x,y))+{tilde over (E)}n(x,y)  EQUATION 3

The difference between the coded frame and the original frame is designated as follows:

Dn(x,y)=In(x,y)−Ĩn(x,y)  EQUATION 4

and is referred to as the reconstruction error.

The motion compensated prediction frame Pn(x, y), formed by the MC predictor 36 is constructed in such a way as to minimize the amount of reconstruction error, and at the same time, minimize the amount of information needed to represent the motion vector field.
A frame of a typical video sequence contains a number of segments with different motion. Therefore, motion compensated prediction is performed by dividing the frame In(x, y) into several segments and estimating the motion of such segments between such frame and a reference frame. Segmentation information is an inherent part of motion representation. Unless a default frame segmentation is used, and known both to the encoder and to the decoder, additional information describing the final partition of the frame must be transmitted to the decoder. In practice, a segment typically includes at least a few tens of pixels. In order to represent the motion vectors of such pixels compactly, it is desirable that their values be described by a function of a few parameters. Such a function is referred to as a motion vector field model. For the purposes of the following description, the motion vectors of an image segment shall be approximated using the following general, additive expression:

Δx(x,y)=Δxprd(x,y)+Δxrefine(x,y)

Δy(x,y)=Δyprd(x,y)+Δyrefine(x,y)  EQUATION 5

The second terms of the above equation are referred to as refinement motion vector fields and are expressed as linear combinations as follows:




  
    
      
        
          
            Δ
            ⁢
            
              
            
            ⁢
            
              
                x
                refine
              
              ⁡
              
                (
                
                  x
                  ,
                  y
                
                )
              
            
          
          =
          
            
              ∑
              
                n
                +
                1
              
              N
            
            ⁢
            
              
                c
                n
              
              ⁢
              
                
                  f
                  n
                
                ⁡
                
                  (
                  
                    x
                    ,
                    y
                  
                  )
                
              
            
          
        
        ⁢
        
          

        
        ⁢
        
          
            Δ
            ⁢
            
              
            
            ⁢
            
              
                y
                refine
              
              ⁡
              
                (
                
                  x
                  ,
                  y
                
                )
              
            
          
          =
          
            
              ∑
              
                n
                =
                
                  N
                  +
                  1
                
              
              
                N
                +
                M
              
            
            ⁢
            
              
                c
                n
              
              ⁢
              
                
                  f
                  n
                
                ⁡
                
                  (
                  
                    x
                    ,
                    y
                  
                  )
                
              
            
          
        
      
    
    
      
        EQUATION
        ⁢
        
          
        
        ⁢
        6
      
    
  




The parameters cn are referred to as refinement motion coefficients. The coefficients are compressed at the encoder transmitted upon the communication path 16, and then recovered at the decoder 14.
The functions fn are referred to as basis functions and are known to both the encoder 12 and to the decoder 14. The set of vectors (Δxprd(x,y),Δyprd(x,y)) is referred to as a prediction motion vector field and is also known to both the encoder and to the decoder.
The prediction error frame, En(x, y) see equation 2, resulting after motion compensated prediction is typically encoded by using a two-dimensional transform such as a discrete cosine transform (DCT). This process is referred to as prediction error coding and aims to reduce the prediction error. Since the prediction error coding is usually lossy, this results in a reconstruction error.
A primary task of the encoder 12 is to find a suitable set of motion coefficients which are to be encoded and transmitted to the decoder. Usually, by increasing the number of bits allocated to the coding of coefficients, the resultant, incurred distortion is reduced. However, the decrease in distortion is not always worth the increased number of bits. Typically, a way to deal with such a tradeoff is to minimize the following Lagrangian criterion as follows:

L=D+λ·B  EQUATION 7

In this equation, the term D represents the incurred distortion, i.e., error, when encoding by a given set of coefficients. The cost of sending the coefficients is represented by the number of bits B. The factor λ is a constant referred to as the Lagrangian parameter.
In operation of an embodiment of the present invention, the motion vector field of a given segment of a video frame is a sum of two affine motion vector fields, namely, the prediction motion vector field and the refinement motion vector field as follows:

Δx(x,y)=Δxprd(x,y)+Δxrefine(x,y)Δy(x,y)=Δyprd(x,y)+Δyrefine(x,y)  EQUATION 8

The prediction motion vector field is obtained from the motion vector field of one or more neighboring segments in one of several ways. For instance, in one implementation, the prediction motion vector field is obtained by extrapolating the affine motion vector field of a neighboring, e.g., adjacent, segment inside the area covered by the current segment. As the current segment can have several neighboring segments, usually signaling information is provided to the decoder in order to specify which segment shall be used. In another implementation, the prediction motion vector field is obtained from a combination of affine motion vector fields of several neighboring segments using some particular method which is known both to the encoder and to the decoder. Such method is, for example, averaging or determining the median, of horizontal and vertical motion vector field components.
The refinement motion vector field has an affine model expressed as follows:




  
    
      
        
          
            Δ
            ⁢
            
              
            
            ⁢
            
              
                x
                refine
              
              ⁡
              
                (
                
                  x
                  ,
                  y
                
                )
              
            
          
          =
          
            
              ∑
              
                n
                =
                1
              
              3
            
            ⁢
            
              
                c
                n
              
              ⁢
              
                
                  f
                  n
                
                ⁡
                
                  (
                  
                    x
                    ,
                    y
                  
                  )
                
              
            
          
        
        ⁢
        
          

        
        ⁢
        
          
            Δ
            ⁢
            
              
            
            ⁢
            
              
                y
                refine
              
              ⁡
              
                (
                
                  x
                  ,
                  y
                
                )
              
            
          
          =
          
            
              ∑
              
                n
                =
                1
              
              3
            
            ⁢
            
              
                c
                
                  n
                  +
                  3
                
              
              ⁢
              
                
                  f
                  n
                
                ⁡
                
                  (
                  
                    x
                    ,
                    y
                  
                  )
                
              
            
          
        
      
    
    
      
        EQUATION
        ⁢
        
          
        
        ⁢
        9
      
    
  




in which the basis functions f1 . . . , f3 are affine orthogonal functions. The basis functions are orthogonal with respect to a rectangle circumscribing the given segment. And, the coefficients c1, . . . , c6, are refinement motion vector field coefficients corresponding to the orthogonal set of basis functions.

The refinement motion coefficients are determined for every segment in the frame by the motion field coder during encoding by the encoder 12, and, in particular, by the motion field coder 28.
FIG. 2 illustrates the motion field coder 28 in greater detail. The coder 28 is here shown to include a selector and builder of prediction motion fields 62, a motion analyzer 64, a motion coefficient remover 66, and a quantizer 68.
The selector and builder 62 is operable, for a given segment, to determine a previously-encoded segment of the current frame, or a combination of such segments, whose motion vector field, or fields, is best suitable for predicting the motion field of a given, e.g., current segment. Based on the motion vector field of the “winning” candidate, or candidates, the prediction motion field is computed as described above. Usually, signaling information is transmitted to the decoder to specify the most suitable amongst the several candidate segments.
The motion analyzer 64 is operable to find a new representation of a refinement motion vector field. That is to say, a mathematically efficient representation is made. The new representation is later used at the motion coefficient remover 66 for a quick and flexible determination of refinement motion coefficients.
The motion coefficient remover 66 is operable to determine which of the refinement coefficients should be set to zero and to calculate the value of remaining non-zero coefficients so as to minimize the Lagrangian criterion as follows:

L(c)=D(c)+λ·B(c)  EQUATION 10

in which D(c) and B(c) are measures of prediction error and bits corresponding to encoding the given segment by using the refinement motion coefficients c. The constant λ is a Lagrangian parameter. When setting some of the refinement motion vector field coefficients to zero, the prediction error is increased. However, when more coefficients are set to zero, the number of bits required to be transmitted by the encoder to the decoder is reduced. Therefore, the value of the Lagrangian can decrease when some of the refinement motion coefficients are set to zero.

The quantizer 68 is operable to quantize the remaining non-zero refinement motion vector coefficients in order to make such coefficients suitable for entropy coding and transmission from the encoder to the decoder.
FIG. 3 illustrates the motion compensated (MC) predictor 36 forming portions of both the encoder and decoder 12 and 14 respectively, as shown in FIG. 1. The functional elements of the MC predictor 36 are similar for both the encoder and the decoder and the MC predictor is operable, at both the encoder and decoder to reconstruct the pixels of a current frame by calculating the motion vector fields of each segment within the frame. The motion vector field is computed based upon a prediction motion vector field (Δxprd(x,y),Δyprd(x,y)) and the refinement motion vector field coefficients. In the exemplary implementation, the refinement motion vector fields are represented by their inverse quantized values. At the decoder 14 the prediction motion vector field is derived from one or several neighboring segments which have already been decoded. The refinement motion vector field coefficients are available at the decoder after the decoding and inverse quantization performed by the inverse quantizer 76. As illustrated, the MC predictor further includes a motion vector field builder, a segment predictor 80 and a prediction motion vector field builder 81.
As FIG. 2 illustrates, inputs to the motion analyzer 64 of the motion field coder 62 include the estimation motion vector field (Δx(x, y), Δy(x, y)). The motion vector field is provided by the Motion Estimator 22 (shown in FIG. 1). The motion vector field is calculated in the motion estimator 22 in a conventional fashion. The prediction motion vector field is also provided to the motion analyzer. And, the geometry, that is, the size and shape, of the segment, S, which is to be coded and the reference and current frames (Rref(x y) and In(x, y), respectively) are also provided as inputs to the motion analyzer.
The motion analyzer is operable to perform several operations. First, the motion analyzer performs error linearization. The prediction error Di of a given segment Si, which consists of P pixel coordinates (xp,yp), p=1, 2 . . . P and whose prediction motion field is denoted by (Δxprd(xp,yp), Δyprd(xp,yp)) and whose refinement motion vector field is approximated by an affine motion model as given by equation 9 is:




  
    
      
        
          D
          i
        
        =
        
          
            ∑
            
              p
              =
              1
            
            P
          
          ⁢
          
            (
            
              
                
                  I
                  n
                
                ⁡
                
                  (
                  
                    
                      x
                      p
                    
                    ,
                    
                      y
                      p
                    
                  
                  )
                
              
              -
              
                
                  R
                  ref
                
                ⁡
                
                  (
                  
                    
                      
                        x
                        p
                      
                      +
                      
                        Δ
                        ⁢
                        
                          
                        
                        ⁢
                        
                          
                            x
                            prd
                          
                          ⁡
                          
                            (
                            
                              
                                x
                                p
                              
                              ,
                              
                                y
                                p
                              
                            
                            )
                          
                        
                      
                      +
                      
                        Δ
                        ⁢
                        
                          
                        
                        ⁢
                        
                          
                            x
                            refine
                          
                          ⁡
                          
                            (
                            
                              
                                x
                                p
                              
                              ,
                              
                                y
                                p
                              
                            
                            )
                          
                        
                      
                    
                    ,
                    
                      
                        y
                        p
                      
                      +
                      
                        Δ
                        ⁢
                        
                          
                        
                        ⁢
                        
                          
                            y
                            prd
                          
                          ⁡
                          
                            (
                            
                              
                                x
                                p
                              
                              ,
                              
                                y
                                p
                              
                            
                            )
                          
                        
                      
                      +
                      
                        Δ
                        ⁢
                        
                          
                        
                        ⁢
                        
                          
                            y
                            refine
                          
                          ⁡
                          
                            (
                            
                              
                                x
                                p
                              
                              ,
                              
                                y
                                p
                              
                            
                            )
                          
                        
                      
                    
                  
                  )
                
              
            
            )
          
        
      
    
    
      
        EQUATION
        ⁢
        
          
        
        ⁢
        11
      
    
  




During linearization, the value of Rref(x, y) of equation 11 is approximated using some known approximation method so that it becomes linearly dependent on (Δxrefine(xp, yp), Δyrefine(xp, yp)). Then, the square prediction error Di can be approximated as follows:




  
    
      
        
          D
          i
        
        =
        
          
            ∑
            
              p
              =
              1
            
            P
          
          ⁢
          
            
              (
              
                
                  
                    e
                    
                      p
                      ,
                      1
                    
                  
                  ⁢
                  
                    c
                    1
                  
                
                +
                
                  
                    e
                    
                      p
                      ,
                      2
                    
                  
                  ⁢
                  
                    c
                    2
                  
                
                +
                ...
                +
                
                  
                    e
                    
                      p
                      ,
                      6
                    
                  
                  ⁢
                  
                    c
                    6
                  
                
                -
                
                  w
                  p
                
              
              )
            
            2
          
        
      
    
    
      
        EQUATION
        ⁢
        
          
        
        ⁢
        12
      
    
  




The values of e and w are dependent upon the type of approximation method utilized.
Thereafter, matrices are constructed by the motion analyzer. As the elements under the square in equation (12) are linear combinations of coefficients cn, minimization of the equation is fully equivalent to minimization of the following matrix expression:

(Eici−wi)T(Eici−wi)  EQUATION 13

Where Ei, wi, and ci are as follows:




  
    
      
        
          
            E
            i
          
          =
          
            [
            
              
                
                  
                    e
                    
                      1
                      ,
                      1
                    
                  
                
                
                  
                    e
                    
                      1
                      ,
                      2
                    
                  
                
                
                  ...
                
                
                  
                    e
                    
                      1
                      ,
                      
                        N
                        +
                        M
                      
                    
                  
                
              
              
                
                  
                    e
                    
                      2
                      ,
                      1
                    
                  
                
                
                  
                    e
                    
                      2
                      ,
                      2
                    
                  
                
                
                  ...
                
                
                  
                    e
                    
                      2
                      ,
                      
                        N
                        +
                        M
                      
                    
                  
                
              
              
                
                  ...
                
                
                  ...
                
                
                  ...
                
                
                  ...
                
              
              
                
                  
                    e
                    P
                  
                
                
                  
                    e
                    
                      P
                      ,
                      2
                    
                  
                
                
                  ...
                
                
                  
                    e
                    
                      P
                      ,
                      
                        N
                        +
                        M
                      
                    
                  
                
              
            
            ]
          
        
        ,
        
          

        
        ⁢
        
          
            w
            i
          
          =
          
            [
            
              
                
                  
                    w
                    1
                  
                
              
              
                
                  
                    w
                    2
                  
                
              
              
                
                  ...
                
              
              
                
                  
                    w
                    p
                  
                
              
            
            ]
          
        
        ,
        
          
        
        ⁢
        
          
            c
            i
          
          ⁡
          
            [
            
              
                
                  
                    c
                    1
                  
                
              
              
                
                  
                    c
                    2
                  
                
              
              
                
                  ...
                
              
              
                
                  
                    c
                    
                      N
                      +
                      M
                    
                  
                
              
            
            ]
          
        
      
    
    
      
        EQUATION
        ⁢
        
          
        
        ⁢
        14
      
    
  




Based on Ei and wi, a matrix Ai and a vector di are calculated as follows:

Ai=EiTEi.  EQUATION 15

di=EiTwi.  EQUATION 16

The motion analyzer generates an output which includes an (N+M)×(N+M) upper triangular matrix Ri which has the following form:




  
    R
    i
  
  =
  
    [
    
      
        
          x
        
        
          x
        
        
          x
        
        
          ...
        
        
          x
        
      
      
        
          0
        
        
          x
        
        
          x
        
        
          ...
        
        
          x
        
      
      
        
          0
        
        
          0
        
        
          x
        
        
          ...
        
        
          x
        
      
      
        
          ⋮
        
        
          ⋮
        
        
          ⋮
        
        
          ⋱
        
        
          ⋮
        
      
      
        
          0
        
        
          0
        
        
          0
        
        
          ...
        
        
          x
        
      
    
    ]
  




where the symbol x denotes a nonzero element which is obtained by calculating a Cholesky factorization of matrix Ai as follows:

Ai=RiTRi.  EQUATION 17

The motion analyzer also generates a vector zi which is obtained by solving the following set of equations:

RiTzi=di.  EQUATION 18

The matrix Ri and the vector zi are the output parameters of the motion analyzer and together such output parameters constitute a representation of a refinement motion vector field suitable for manipulation at the motion coefficient remover 66.
The output of the motion analyzer 64 forms the input to the motion coefficient remover 66. The operations performed by the remover 66 when setting some of the refinement motion field coefficients to zero include, for instance, removing those elements that correspond to coefficients that can be removed from Ri with {tilde over (z)}1. The result is a modified matrix R and vector z.
Various manners can be utilized to specify, or imply by default, the segment or the set of neighboring segments from which the prediction motion field is derived. Also, different manners can be utilized to generate the prediction motion field Δxprd(x, y), Δyprd(x, y), to linearize equation (11) above, and to solve the set of equations (18).
FIG. 4 illustrates a single video frame 84, here shown to be divided into a plurality, here thirty, segments 86. Each of the segments 86 is here formed of a sixteen pixel by sixteen pixel block. And, each of the segments can further be divided to form smaller segments. Here some of the segments 86 are divided to form eight pixel by eight pixel blocks 88. The segments 86 are commonly referred to as macroblocks. The coding of a frame is performed by scanning from left-to-right and top-to-bottom, macroblock by macroblock.
As described previously, the motion vector field of a given segment obeys the additive motion model given in equation (8). The way in which the prediction, the refinement, and the final motion prediction fields are obtained is described below. In the exemplary implementation, either of the motion prediction or motion refinement fields can be zero. Therefore, with respect to motion vector fields, a given segment S, can be coded in any of various manners. For instance, the segment can be coded using only prediction motion vector fields extrapolated from a neighboring segment. Or, the segment can be coded by using a prediction motion vector field extrapolated from a neighboring segment together with a compressed refinement motion vector field. Alternately, the segment can be coded using only a compressed motion vector field without utilization of a prediction field. If the prediction field is set to zero, however, refinement information is sent. The segment can also be coded by using a zero motion vector field, e.g., a copy from the reference frame Rref(x,y). And, for example, the segment can be coded using intra coding in which no motion vector field is utilized.
In the exemplary implementation, independent of the presence of a prediction motion vector field or a refinement motion vector field, the final motion vector field of a given motion compensated segment Si has an affine model given by the following equation, here in which the superscript i indicates the fact that the coefficients are associated with a corresponding segment Si:

Δx(x,y)=β1i+β2i·(y−yoi)+β3i·(x−xoi)

Δx(x,y)=β4i+β5i·(y−yoi)+β6i·(x−xni)  EQUATION 19

wherein xoi and yoi are coordinates of the upper left-most pixel in the segment and β1i, . . . βbi are the affine coefficients calculated as described below.

In the exemplary implementation of the decoder 14, operations are performed by utilizing integer precision. This is achieved by utilizing a fixed point implementation corresponding to a fixed precision. As a result, all of the coefficients referred to hereinbelow are integer-valued, including the coefficients of equation (19). In other implementations, other precisions are utilized.
In the exemplary implementation, one bit is sent to the decoder 14 to signal whether the prediction field of a neighbor is used or not, but only in the case when there is at least one prediction neighbor candidate. A neighboring segment Sk is a candidate for prediction of motion vector field of a segment Si only if it has a nonzero motion vector field.
Also in the exemplary implementation, prediction is performed only from a nearest neighboring block at the left or just above the current segment. Therefore, the number of neighboring segments can be at most four, i.e., two eight by eight pixel blocks above and two eight by eight pixel blocks at the left. In this implementation, whenever the bit sent to the decoder indicates that prediction from a neighboring segment is used, the number and location of prediction candidates is calculated, in both the encoder and decoder. If there are, e.g., two, three, or four prediction candidates, then one or two selection bits are sent to the decoder 14 to indicate the candidate to be used. The selection information is made, e.g., of one prediction direction bit which may, or may not, exist, followed by one discrimination bit, which also may, or may not, exist.
FIG. 5 illustrates a table, shown generally at 92, which lists the meanings and values of selection bits in an exemplary implementation of the present invention. The mark x denotes absence or logical don't cares depending on context. The direction bit indicates whether candidate neighbor segments are available above or to the left of the segment currently being predicted. The discrimination bit specifies which of two remaining candidates must be used for prediction of motion vector fields. That is to say, when the segments above or to the left are chosen, two selection possibilities are available. The discrimination bit identifies the selection. In the final four cases shown in the table, the discrimination bit may, or may not, exist depending on the location of the most suitable candidate segment. For instance, if the direction bit indicates “from left” where there is only a single candidate, then the discrimination bit is not needed. In the decoder 14, the direction the winning candidate is known after decoding the direction bit.
Once the neighboring segment has been selected for the prediction of the current segment, the prediction motion vector field is simply the extrapolation of the motion vector field of the segment inside the pixel domain covered by the current segment as follows:

Δxprd(x,y)=β1k+β2k·(y−yok)+β3k·(x−xok)  EQUATION 20

where xok, yok are coordinates of the upper left-most pixel in the neighboring segment Sk and β1k, . . . β6k are integer-valued coefficients corresponding to the motion field of segment Sk. In equation 20, the superscript k indicates that the coefficients are associated with the neighboring segment Sk.

Analysis of equations 19 and 20 indicates that the motion vector field of the neighboring segment Sk has become the prediction motion vector field of the segment Si by simply extrapolating it to the pixels inside the current segment Si.
The refinement motion vector field assumes the affine orthogonal model given in equation 9. However, in the preferred implementation, the refinement coefficients are converted into a set of auxiliary refinement coefficients. The auxiliary refinement coefficients enable a fast computation of the final predicted motion field.
In the preferred implementation, refinement coefficients in equation 9 which correspond to an orthogonal affine set of basis functions are first converted to a different set of auxiliary coefficients. These coefficients correspond to the set of basis functions {1, (y−yo), (x−xo)} where xo, yo are coordinates of the upper-left most pixel in the segment. This conversion is performed in order to achieve a common basis function representation for both prediction and refined motion vector fields, i.e., in order to use the same set of basis functions. By doing so, the final motion vector field is computed based on the summation of two sets of coefficients, as will be described later. Based upon the refinement coefficients, c1, . . . , c6 the following auxiliary coefficients a1 . . . a6 are calculated for segments Si. For segments which are sixteen by sixteen pixel blocks; this is done as follows:




  
    
      
        
          
            
              [
              
                
                  
                    
                      a
                      1
                    
                  
                
                
                  
                    
                      a
                      2
                    
                  
                
                
                  
                    
                      a
                      3
                    
                  
                
              
              ]
            
            =
            
              
                [
                
                  
                    
                      4096
                    
                    
                      6664
                    
                    
                      6664
                    
                  
                  
                    
                      0
                    
                    
                      
                        -
                        889
                      
                    
                    
                      0
                    
                  
                  
                    
                      0
                    
                    
                      0
                    
                    
                      
                        -
                        899
                      
                    
                  
                
                ]
              
              ·
              
                [
                
                  
                    
                      
                        c
                        1
                      
                    
                  
                  
                    
                      
                        c
                        2
                      
                    
                  
                  
                    
                      
                        c
                        3
                      
                    
                  
                
                ]
              
            
          
          ⁢
          
            
          
          ⁢
          
            

          
          ⁢
          
            
              and
              ⁢
              
                

              
              [
              
                
                  
                    
                      a
                      4
                    
                  
                
                
                  
                    
                      a
                      5
                    
                  
                
                
                  
                    
                      a
                      6
                    
                  
                
              
              ]
            
            =
            
              
                [
                
                  
                    
                      4096
                    
                    
                      6664
                    
                    
                      6664
                    
                  
                  
                    
                      0
                    
                    
                      
                        -
                        889
                      
                    
                    
                      0
                    
                  
                  
                    
                      0
                    
                    
                      0
                    
                    
                      
                        -
                        899
                      
                    
                  
                
                ]
              
              ·
              
                [
                
                  
                    
                      
                        c
                        4
                      
                    
                  
                  
                    
                      
                        c
                        5
                      
                    
                  
                  
                    
                      
                        c
                        6
                      
                    
                  
                
                ]
              
            
          
        
        ⁢
        
          
        
      
    
    
      
        EQUATION
        ⁢
        
          
        
        ⁢
        21
      
    
  




For segments Si which are eight by eight pixel blocks, the calculation takes the form:




  
    
      
        
          
            [
            
              
                
                  
                    a
                    1
                  
                
              
              
                
                  
                    a
                    2
                  
                
              
              
                
                  
                    a
                    3
                  
                
              
            
            ]
          
          =
          
            
              [
              
                
                  
                    8192
                  
                  
                    12513
                  
                  
                    12513
                  
                
                
                  
                    0
                  
                  
                    
                      -
                      3575
                    
                  
                  
                    0
                  
                
                
                  
                    0
                  
                  
                    0
                  
                  
                    
                      -
                      3575
                    
                  
                
              
              ]
            
            ·
            
              [
              
                
                  
                    
                      c
                      1
                    
                  
                
                
                  
                    
                      c
                      2
                    
                  
                
                
                  
                    
                      c
                      3
                    
                  
                
              
              ]
            
          
        
        ⁢
        
          

        
        ⁢
        
          
            and
            ⁢
            
              

            
            [
            
              
                
                  
                    a
                    4
                  
                
              
              
                
                  
                    a
                    5
                  
                
              
              
                
                  
                    a
                    6
                  
                
              
            
            ]
          
          =
          
            [
            
              
                
                  8192
                
                
                  12513
                
                
                  12513
                
              
              
                
                  0
                
                
                  
                    -
                    3575
                  
                
                
                  0
                
              
              
                
                  0
                
                
                  0
                
                
                  
                    -
                    3575
                  
                
              
            
            ]
          
        
      
    
    
      
        EQUATION
        ⁢
        
          
        
        ⁢
        22
      
    
  




As a result, the following integer-valued displacements represent the refinement motion vector field of segment Si:

Δxrefine(x,y)=a1+a2·(y−yoi)+a3·(x−xoi).

Δxrefine(x,y)=a4+a5·(y−yoi)+a6·(x−xoi).  EQUATION 23

where xoi and yoi are coordinates of the upper left-most pixel within the segment Si. The superscript i indicates that these coordinates are associated with the current segment Si.

In the exemplary implementation, the final set of affine coefficients for a given segment which uses the neighboring segment Sk for motion field prediction is calculated as in the following equation in which the superscripts i and k indicate that the corresponding coefficients are associated with Si and Sk, respectively:

β1I=a1+Δxprd(xOi,yOi)

β2I=a2+β2K 

β3I=a3+β3K 

and

β4i=a4+Δyprd(xoi,yoi)

β5I=a5+β5k 

β6I=a6+β6k  EQUATION 24

Based upon the integer-valued coefficients of β1 . . . β6, the set of final motion vectors for the segment Si is generated using equation 19. The way by which the motion vectors are used to calculate the pixel intensities from the reference frame is described below.
In the exemplary implementation, the presence of motion coefficients in the bitstream is signaled by one bit whenever refinement or nonrefinement motion coefficients can be expected. This bit is referred to as a motion coefficient indicator (MCI).
Also in the exemplary implementation, when motion coefficients are transmitted for a segment Si, a variable-length code, referred to as a motion coefficient pattern (MCP) is first sent to indicate which coefficients have nonzero values. An all-zero pattern is the only non-valid pattern, as this possibility can be signaled by the MCI bit alone. The total number of valid patterns which can be indicated by the MCP codeword is sixty-three. This is a property of the affine model. As it has six coefficients, there are 26, i.e., 64, possible results. Thus, the MCP codeword has 63 possible values as zero is not valid. Following the MCP codeword are the encoded values of each non-zero motion coefficient indicated by the MCP pattern. The encoded values of each non-zero coefficient follow the MCP codeword. A motion coefficient cj is encoded as an amplitude variable-length codeword indicating the absolute value of cj followed by a sign bit indicating the sign of cj. In the exemplary implementation, the same variable-length coding table is used to encode the amplitude of different coefficients. Different coding tables can be used. Zero-amplitude is not amongst the valid options as this possibility can be indicated by the MCP codeword.
The final motion vector field components calculated by using equation 19 correspond to a discretization step of:




  
    
      
        D
        =
        
          
            1
            65536
          
          =
          0.0000152587890625
        
      
    
    
      
        EQUATION
        ⁢
        
          
        
        ⁢
        25
      
    
  




If (Δx (x,y), Δy(x, y)) denote final motion compensation displacements for segment Si, then the corresponding non-integer coordinates in the previous frame are:

x′=x+Δx(x,y)·D 

y′=y+Δy(x,y)·D  EQUATION 26

In the preferred implementation, the reference frame Rref is of a size of M×N pixels with intensity values in the range {0, 1, . . . , 255}. The valid pixel coordinates (x′,y′) are defined only in the range of {0, 1, . . . , M−1}×{0, 1, . . . , N−1}. When motion compensated prediction requires evaluating the luminance and chrominance values at non-integer locations in the reference frame Rref a discrete version of cubic convolution interpolation is used. In the exemplary implementation, fixed point precision is employed when calculating reconstruction values in the reference frame as described below.
First, the integer-valued displacements (Δx(x,y), Δy(x,y)) corresponding to the pixel (x,y) in segment Si are expressed in modulo-65536 form as follows:

Δx(x,y)=dx·65536+δx, δxε{0,1, . . . ,65535}

Δx(x,y)=dy·65536+δy, δyε{0,1, . . . ,65535}  EQUATION 27

where dx, dy, δx, and δy are integer values with the latter two being always non-negative.

The x′j,y′k integer-valued coordinates of the four by four cubic convolution window are defined as:

x′j=sat(x+dx+j−2,M−1), j=1,2,3,4

x′k=sat(y+dy+k−2,N−1), k=1,2,3,4  EQUATION 28

Wherein sat(u,v) is the saturation function as follows:




  
    
      
        
          sat
          ⁡
          
            (
            
              u
              ,
              v
            
            )
          
        
        =
        
          {
          
            
              
                0
              
              
                
                  u
                  <
                  0
                
              
            
            
              
                u
              
              
                
                  0
                  ≤
                  u
                  ≤
                  v
                
              
            
            
              
                v
              
              
                
                  u
                  >
                  v
                
              
            
          
        
      
    
    
      
        EQUATION
        ⁢
        
          
        
        ⁢
        29
      
    
  




Consequently, the sixteen integer pixel values rjk used in the cubic convolution are as follows:

rjk=Rref(x′j,y′k) j,k=1,2,3,4  EQUATION 29

where x′j, y′k are the integer-valued coordinates computed in equation 28.
Then, the convolution coefficients are computed. In the following, the integer division by truncation is denoted by “/” and both or its operands are always non-negative integers. By using integer truncation, following uj, vk j,k=1, 2, 3, 4 are computed:

u1=spl(δx/256+256)

u2=spl(δx/256)

u3=spl(256−(δx/256))

u4=16384−(u1+u2+u3)

and

v1=spl(δy/256+256)

v2=spl(δy/256)

v3=spl(256−(δy/256))

v4=16384−(v1+v2+v3)  EQUATION 31

where δx, δy are the integer values of equation 27 and spl(s) is the integer-valued function of positive integer argument:





  
    
      
        
          spl
          ⁡
          
            (
            s
            )
          
        
        =
        
          {
          
            
              
                
                  16384
                  -
                  
                    (
                    
                      
                        
                          s
                          2
                        
                        ·
                        
                          (
                          
                            1280
                            -
                            
                              3
                              ·
                              s
                            
                          
                          )
                        
                      
                      +
                    
                  
                
              
              
                
                  s
                  ∈
                  
                    {
                    
                      0
                      ,
                      1
                      ,
                      ...
                      ⁢
                      
                        
                      
                      ,
                      255
                    
                    }
                  
                
              
            
            
              
                
                  
                    1024
                    )
                  
                  /
                  2048
                
              
              
                
                  
                
              
            
            
              
                
                  -
                  
                    (
                    
                      (
                      
                        
                          t
                          ·
                          
                            (
                            
                              65536
                              +
                              
                                t
                                2
                              
                              -
                              
                                512
                                ·
                                t
                              
                            
                            )
                          
                        
                        +
                      
                    
                  
                
              
              
                
                  
                    s
                    ∈
                    
                      {
                      
                        256
                        ,
                        ...
                        ⁢
                        
                          
                        
                        ,
                        511
                      
                      }
                    
                  
                  ,
                
              
            
            
              
                
                  
                    
                      1024
                      )
                    
                    /
                    2048
                  
                  )
                
              
              
                
                  t
                  =
                  
                    s
                    -
                    256
                  
                
              
            
            
              
                0
              
              
                otherwise
              
            
          
        
      
    
    
      
        EQUATION
        ⁢
        
          
        
        ⁢
        32
      
    
  




Then the reference pixel value is computed. By using integer division by truncation, the reference pixel value is computed as follows:




  
    
      
        r
        =
        
          sat
          ⁢
          
             
            
              
                
                  (
                  
                    
                      
                        
                          
                            
                              (
                              
                                
                                  [
                                  
                                    
                                      
                                        
                                          r
                                          11
                                        
                                      
                                      
                                        
                                          r
                                          21
                                        
                                      
                                      
                                        
                                          r
                                          31
                                        
                                      
                                      
                                        
                                          r
                                          41
                                        
                                      
                                    
                                    
                                      
                                        
                                          r
                                          12
                                        
                                      
                                      
                                        
                                          r
                                          22
                                        
                                      
                                      
                                        
                                          r
                                          32
                                        
                                      
                                      
                                        
                                          r
                                          42
                                        
                                      
                                    
                                    
                                      
                                        
                                          r
                                          13
                                        
                                      
                                      
                                        
                                          r
                                          23
                                        
                                      
                                      
                                        
                                          r
                                          33
                                        
                                      
                                      
                                        
                                          r
                                          43
                                        
                                      
                                    
                                    
                                      
                                        
                                          r
                                          14
                                        
                                      
                                      
                                        
                                          r
                                          24
                                        
                                      
                                      
                                        
                                          r
                                          34
                                        
                                      
                                      
                                        
                                          r
                                          44
                                        
                                      
                                    
                                  
                                  ]
                                
                                ·
                                
                                  
                                    [
                                    
                                      
                                        
                                          
                                            u
                                            1
                                          
                                        
                                      
                                      
                                        
                                          
                                            u
                                            2
                                          
                                        
                                      
                                      
                                        
                                          
                                            u
                                            3
                                          
                                        
                                      
                                      
                                        
                                          
                                            u
                                            4
                                          
                                        
                                      
                                    
                                    ]
                                  
                                  /
                                  2.56
                                
                              
                              )
                            
                            T
                          
                          ·
                        
                      
                    
                    
                      
                        
                          
                            [
                            
                              
                                
                                  
                                    v
                                    1
                                  
                                
                              
                              
                                
                                  
                                    v
                                    2
                                  
                                
                              
                              
                                
                                  
                                    v
                                    3
                                  
                                
                              
                              
                                
                                  
                                    v
                                    4
                                  
                                
                              
                            
                            ]
                          
                          +
                          
                            
                          
                          ⁢
                          
                            2
                            19
                          
                        
                      
                    
                  
                  )
                
                /
                
                  2
                  20
                
              
              ,
              255
            
            )
          
        
      
    
    
      
        EQUATION
        ⁢
        
          
        
        ⁢
        33
      
    
  




where integer-valued coefficients rjk are given by equation 30 and integer-valued coefficients uj, vk j,k=1, 2, 3, 4 are given by equation 31 and function sat(.,.) is given by equation 29.

At the motion analyzer, the step of linearization is performed by employing a first order Taylor expansion of Rref(x,y) around:

x′p=xp+Δx(xp,yp)

y′p=yp+Δy(xp,yp)  EQUATION 34

with respect to x and y:





  
    
      
        
          
            R
            ref
          
          ⁡
          
            (
            
              
                
                  
                    
                      
                        
                          
                            
                              x
                              p
                            
                            +
                            
                              Δ
                              ⁢
                              
                                
                              
                              ⁢
                              
                                
                                  x
                                  prd
                                
                                ⁡
                                
                                  (
                                  
                                    
                                      x
                                      p
                                    
                                    ,
                                    
                                      y
                                      p
                                    
                                  
                                  )
                                
                              
                            
                            +
                          
                        
                      
                      
                        
                          
                            Δ
                            ⁢
                            
                              
                            
                            ⁢
                            
                              
                                x
                                refine
                              
                              ⁡
                              
                                (
                                
                                  
                                    x
                                    p
                                  
                                  ,
                                  
                                    y
                                    p
                                  
                                
                                )
                              
                            
                          
                        
                      
                    
                    ,
                  
                
              
              
                
                  
                    
                      
                        
                          
                            y
                            
                              
                                
                              
                              ⁢
                              p
                            
                          
                          +
                          
                            Δ
                            ⁢
                            
                              
                            
                            ⁢
                            
                              y
                              prd
                            
                            ⁢
                            
                              (
                              
                                
                                  x
                                  p
                                
                                ,
                                
                                  y
                                  p
                                
                              
                              )
                            
                          
                          +
                        
                      
                    
                    
                      
                        
                          
                            Δ
                            
                              
                                
                              
                              ⁢
                              refine
                            
                          
                          ⁡
                          
                            (
                            
                              
                                x
                                p
                              
                              ⁢
                              
                                y
                                p
                              
                            
                            )
                          
                        
                      
                    
                  
                
              
            
            )
          
        
        ≈
        
          
            
              R
              ref
            
            ⁡
            
              (
              
                
                  x
                  p
                  ′
                
                ,
                
                  y
                  p
                  ′
                
              
              )
            
          
          +
          
            
              (
              
                
                  
                    
                      
                        Δ
                        ⁢
                        
                          
                        
                        ⁢
                        
                          
                            x
                            refine
                          
                          ⁡
                          
                            (
                            
                              
                                x
                                p
                              
                              ,
                              
                                y
                                p
                              
                            
                            )
                          
                        
                      
                      +
                    
                  
                
                
                  
                    
                      
                        Δ
                        ⁢
                        
                          
                        
                        ⁢
                        
                          
                            x
                            prd
                          
                          ⁡
                          
                            (
                            
                              
                                x
                                p
                              
                              ,
                              
                                y
                                p
                              
                            
                            )
                          
                        
                      
                      -
                      
                        Δ
                        ⁢
                        
                          
                        
                        ⁢
                        
                          x
                          ⁡
                          
                            (
                            
                              
                                x
                                p
                              
                              ,
                              
                                y
                                p
                              
                            
                            )
                          
                        
                      
                    
                  
                
              
              )
            
            ·
            
              
                G
                
                  
                    
                  
                  ⁢
                  x
                
              
              ⁡
              
                (
                
                  
                    x
                    p
                    ′
                  
                  ,
                  
                    y
                    p
                    ′
                  
                
                )
              
            
          
          ⁢
          
            
          
          +
          
            
              (
              
                
                  
                    
                      
                        Δ
                        ⁢
                        
                          
                        
                        ⁢
                        
                          
                            y
                            refine
                          
                          ⁡
                          
                            (
                            
                              
                                x
                                p
                              
                              ,
                              
                                y
                                p
                              
                            
                            )
                          
                        
                      
                      +
                    
                  
                
                
                  
                    
                      
                        Δ
                        ⁢
                        
                          
                        
                        ⁢
                        
                          
                            y
                            prd
                          
                          ⁡
                          
                            (
                            
                              
                                x
                                p
                              
                              ,
                              
                                y
                                p
                              
                            
                            )
                          
                        
                      
                      -
                      
                        Δ
                        ⁢
                        
                          
                        
                        ⁢
                        
                          y
                          ⁡
                          
                            (
                            
                              
                                x
                                p
                              
                              ,
                              
                                y
                                p
                              
                            
                            )
                          
                        
                      
                    
                  
                
              
              )
            
            ·
            
              
                G
                y
              
              ⁡
              
                (
                
                  
                    x
                    p
                    ′
                  
                  ,
                  
                    y
                    p
                    ′
                  
                
                )
              
            
          
        
      
    
    
      
        EQUATION
        ⁢
        
          
        
        ⁢
        35
      
    
  




Gx(x′p,y′p) and Gy(x′p,y′p) are values of the derivative of the reference frame Rref with respect to x and y. Using such an approximation, the elements of matrix Ei and vector wi in equation 14 are:




  
    
      
        
          e
          pk
        
        =
        
          {
          
            
              
                
                  
                    
                      
                        f
                        k
                      
                      ⁡
                      
                        (
                        
                          
                            x
                            p
                          
                          ,
                          
                            y
                            p
                          
                        
                        )
                      
                    
                    ⁢
                    
                      
                        G
                        x
                      
                      ⁡
                      
                        (
                        
                          
                            x
                            p
                            ′
                          
                          ,
                          
                            y
                            p
                            ′
                          
                        
                        )
                      
                    
                  
                  ,
                
              
              
                
                  
                    k
                    =
                    1
                  
                  ,
                  2
                  ,
                  ...
                  ⁢
                  
                    
                  
                  ,
                  N
                
              
            
            
              
                
                  
                    
                      
                        f
                        k
                      
                      ⁡
                      
                        (
                        
                          
                            x
                            p
                          
                          ,
                          
                            y
                            p
                          
                        
                        )
                      
                    
                    ⁢
                    
                      
                        G
                        y
                      
                      ⁡
                      
                        (
                        
                          
                            x
                            p
                            ′
                          
                          ,
                          
                            y
                            p
                          
                        
                        )
                      
                    
                  
                  ,
                
              
              
                
                  
                    k
                    =
                    
                      N
                      +
                      1
                    
                  
                  ,
                  
                    N
                    +
                    2
                  
                  ,
                  ...
                  ⁢
                  
                    
                  
                  ,
                  
                    N
                    +
                    M
                  
                
              
            
          
        
      
    
    
      
        EQUATION
        ⁢
        
          
        
        ⁢
        36
      
    
  




wp=In(xp,yp)−Rref(x′p,y′p)+Gx(x′p,y′p)Δx(xp,yp)+Gy(x′p,y′p)Δy(xp,yp)=Gx(x′p,y′p)Δxprd(xp,yp)−Gy(x′p,y′p)Δyprd(xp,yp)  EQUATION 37

The previous descriptions are of preferred examples for implementing the invention and, the scope of the invention should not necessarily be limited by this description. The scope of the present invention is defined by the following claims:

## Claims

1. A method comprising:
retrieving a motion predictor indication for a first segment of a video frame from encoded data representative of a sequence of video frames;
identifying one neighboring segment from a plurality of segments adjacent to the first segment based on the motion predictor indication;
retrieving refinement information for motion coefficients for the first segment; and
deriving motion coefficients for the first segment based on motion coefficients of the identified neighboring segment by at least summing the refinement information to a prediction based on the motion coefficients of the identified neighboring segment.

2. A method according to claim 1, wherein the plurality of segments adjacent to the first segment comprise segments to the left and above the first segment, and wherein the motion predictor indicator indicates whether the segment above the first segment or the segment to the left of the first segment is used for deriving the motion coefficients of the first segment.

3. A decoder comprising:
a demultiplexor configured to:
retrieve a motion predictor indication for a first segment of a video frame from encoded data representative of a sequence of video frames;
identify one neighboring segment from a plurality of segments adjacent to the first segment based on the motion predictor indication; and
retrieve a refinement information for motion coefficients for the first segment; and

a motion compensated predictor configured to derive motion coefficients for the first segment based on motion coefficients of the identified neighboring segment by at least summing the refinement information to a prediction based on the motion coefficients of the identified neighboring segment.

4. A decoder according to claim 3, wherein the plurality of segments adjacent to the first segment comprise segments to the left and above the first segment, and wherein the motion predictor indicator indicates whether the segment above the first segment or the segment to the left of the first segment is used for deriving the motion coefficients of the first segment.

5. A decoder comprising:
means for retrieving a motion predictor indication for a first segment of a video frame from encoded data representative of a sequence of video frames;
means for identifying one neighboring segment from a plurality of segments adjacent to the first segment based on the motion predictor indication;
means for retrieving a refinement information for motion coefficients for the first segment; and
means for deriving motion coefficients for the first segment based on the motion coefficients of the identified neighboring segment by at least summing the refinement information to a prediction based on the motion coefficients of the identified neighboring segment.

6. A decoder according to claim 5, wherein the plurality of segments adjacent to the first segment comprise segments to the left and above the first segment, and wherein the motion predictor indicator indicates whether the segment above the first segment or the segment to the left of the first segment is used for deriving the motion coefficients of the first segment.