MOTION VECTOR FIELD CODING

Abstract: A video codec includes a motion field coder for minimizing the number of motion coefficients of a motion vector field. In the coder, a first block includes means for forming a new matrix representation of the motion vector field. The new coded motion vector field is linear. A second main block includes means for merging pairs of adjacent segments if the combined segment area can be predicted using a common motion field. Merging information is transmitted to a decoder. A third main block includes means for removing motion field basis functions. After each removing step, the squared prediction error is calculated and removing is continued until the chance of the error is not acceptable. Final motion coefficients are calculated by solving a linear matrix equation. As a result, reduced number of motion coefficients of each segment are obtained. The motion coefficients are transmitted to the decoder.

Description: Motion vector field coding FIELD OF THE INVENTION The present invention generally relates to video compression. More pre- cisely, the invention relates to a method of coding an estimated motion field and for generating motion information in a video sequence. BACKGROUND OF THE INVENTION The motion compensated prediction is a key element of majority of video coding schemes. Figure 1 is a schematic diagram of an encoder for compres¬ sion of video sequences using motion compensation. Essential elements in the encoder are a motion compensated prediction block 1 , a motion estimator 2 and a motion field coder 3. The operating principle of the motion compensating video coders is to compress the prediction error E n (x,y), which is a difference between the incoming frame l n (x,y) being coded called the current frame and a prediction frame i„(χ,y), wherein: E n ( χ ,y) = ι n ( χ ,y)-l( χ ,y) (i) The prediction frame i„(χ,y) is constructed by the motion compensated predic¬ tion block 1 and is built using pixel values of the previous, or some other already coded frame denoted 7 π _,(x, ), called a reference frame, and the motion vec¬ tors of pixels between the current frame and the reference frame. Motion vec¬ tors are calculated by the motion field estimators 2 and the resulting vector field is then coded in some way before applying to the predictor block 1. The predic¬ tion frame is then: / n (Λ,y) = 7__ 1 [Λ + _ ,y) > y + Δy( ,y)]. (2) The pair of numbers [x+ Δx(x,y), y+Δy(x,y)] is called the motion vector of pixel in location (x, y) in the current frame, whereas Δx(x,y) and Δy(x,y) are the values of horizontal and vertical displacement of this pixel. Set of motion vectors of all pixels in the current frame l n (x,y) is called motion vector field. The coded motion vector field is also transmitted as motion inf romation to the decoder. In the decoder, fig 2, pixels of the current frame l n (x,y) are reconstructed by finding the pixels' predictions I n (χ,y) in the reference frame ϊ„ . ,(χ,y). The motion compensated prediction block 21 generates the prediction frame using the received motion information and the reference frame ϊ n _.(χ,y) (in this picture the reference frame is the same as the current frame). In the prediction error decoder 22 decoded prediction error E n (x,y) is then added with the prediction frame, the result being the original current frame l n . The general object of the motion compensated (MC) prediction is to minimize amount of information which needs to be transmitted to the decoder. It should minimize the amount of prediction error measured, e.g., as the energy of En(x.y), and minimize the amount of information needed to represent motion vector field. The document H.Nguen, E.Dubois, "Representation of motion information for image coding". Proc. Picture Coding Symposium '90, Cambridge, Massachusetts, March 26-18, 1990, pages 841-845, gives a review of motion field coding techniques.As a rule of the thumb reduction of prediction error requires more sophisticated motion field, i.e., more bits must be spent on its encoding. Therefore the overall goal of the video encoding is to encode as compactly as possible the motion vector field keeping at the same time the measure of prediction error as low as possible. The motion field estimation block 1 , fig. 1 , calculates motion vectors of all the pixels of a given segment which minimize some measure of prediction error in this segment, for example square prediction error. Motion field estimation techniques differ both in the model of the motion field and in the algorithm for minimisation of the chosen measure of prediction error. Due to very large number of pixels in the frame it is not efficient to transmit a separate motion vector for each pixel. Instead, in most of the video coding schemes the current frame is divided into larger image segments so that all motion vectors of the segment can be described by few parameters. Image segments can be square blocks, e.g. 16x 16 pixels blocks are used in codecs in accordance with international standard ISO/IEC MPEG-1 or ITU-T H.261 , or they can comprise of completely arbitrarily shaped regions obtained for instance by a segmentation algorithm. In practice segments include at least few tens of pixels. In order to compactly represent the motion vectors of the pixels in the segment it is desireable that their values are described by a function of few parameters. Such function is called motion vector field model. A known group of models are linear motion models, in which motion vectors are linear combinations of motion field basis functions. In such models the motion vectors of image segments are described by a general formula: Aχ(χ,y) = c i f i (x,y) N ,= + 1 M ( V 3) ' Δy(*, y) = ∑ < ,./. (jc, y) i=(V+l where parameters q are called motion coefficients and are transmitted to the decoder. Functions fi(x,y) are called motion field basis functions which are fixed and known both to encoder and decoder. The problem when using the linear motion model having the above described formula is how to minimize the number of motion coefficients Cj which are send to the decoder, preserving at the same time as low measure of prediction error E n (x,y) as possible. This process is performed in the encoder by the motion field coding block 3, see fig. 1. It is performed after computationally very complex motion field estimation which is accomplished by the block 2. It is therefore crucial that motion field coding is computationally simple so that it does not impose additional burden on the encoder. The total number of motion coefficients which needs to be sent to the decoder depends both on number of segments in the image and number of motion coefficients per segment. Therefore, there is at least two ways to reduce the total number of motion coefficients. The first way is to reduce the number of segments by combining (merging) together those segments which can be predicted with a common motion vector field without causing a large increase of prediction error. The number of segments in the frame can be reduced because very often the adjacent, i.e. neighbouring, segments can be predicted well with the same set of motion coefficients. Process of combining such segments is called motion assisted merging. The second way is to select for each segment a motion model which allows achieving satisfactorily low prediction error with as few coefficients as possible. Since the amount and the complexity of the motion varies between frames and between segments it is not efficient to use always all N+ M motion coefficients per segment. It is necessary to find out for every segment what is the minimum number of motion coefficients which allows to achieve satisfactorily low prediction error. The process of such adaptive selection of coefficients is called motion coefficient removal. Figure 3 shows a frame divided into segments. The prior art techniques for motion coefficient coding include several techniques for motion assisted merging. After motion vectors of all the segments have been estimated, the motion assisted merging is performed. It is done by considering every pair of adjacent segments 5, and S, with their respective motion coefficients c, and c . Area of combined segments 5, and 5 ; is denoted S υ . If the area 5 y can be predicted with one set of motion coefficients c v without causing excessive increase of prediction error over the error resulting from separate predictions of S, and S , then 5, and 5. are merged. The methods for motion assisted merging differ essentially in the way of finding a single set of motion coefficients c υ which allow a good prediction of segments combined together. One method is known as merging by exhaustive motion estimation. This method estimates "from scratch" a new set of motion parameters c_ for every pair of adjacent segments 5, and S, . If the prediction error for S v is not excessively increased then the segments S, and 5 ; are merged. Although this method can very well select the segments which can be merged it is not feasible for implementation because it would increase the complexity of the encoder typically by several orders of magnitude. Another method is known as merging by motion field extension. This method tests whether area of S v can be predicted using either motion parameters c, or c. without an excessive increase of the prediction error. This method is characterised by very low computational complexity because it does not require any new motion estimation. However, it fails to merge segments very often because motion compensation with coefficients calculated for one segment very rarely predicts well also the adjacent segments. Still another method is known as merging by motion field fitting. In this method the motion coefficients c y are calculated by the method of approximation. This is done by evaluating few motion vectors in each of the segments. Some motion vectors in segments Si and Sj are depicted in figure 3. The motion field for the segment Sή is done by fitting a common motion vector field through these vectors using some known fitting method. The disadvantage of the method is that motion field obtained by fitting is not precise enough and often leads to unacceptable increase of prediction error. Methods for performing motion estimation with different models and selecting the most suitable one are proposed in the documents H. Nicolas and C. Labit, "Region-based motion estimation using deterministic relaxation schemes for image sequence coding," Proc. 1994 International Conference on Acoustics, Speech and Signal Processing, pp. III265-268 and P. Cicconi and H. Nicolas, "Efficient region-based motion estimation and symmetry oriented segmentation for image sequence coding," IEEE Tran. on Circtuits and Systems for Video Technology, Vol. 4, No. 3, June 1994, pp. 357-364. The methods try to adapt the motion model depending on complexity of the motion by performing motion estimation with different models and selecting the most suitable one. The main disadvantage of these methods is their high computational complexity and low amount of different motion field models which can be tested in practice. None of afore described methods alone solves the problem how to minimize the number of motion coefficients q which are send to the decoder, preserving at the same time as low measure of prediction error E n (x,y) as possible. SUMMARY OF THE INVENTION An objective of the present invention is to create a motion field coder which reduces the amount of motion field vector information produced by some known motion estimator by large factor without causing large increase of prediction error. The complexity of the motion field coder should be low for allowing practical implementation on available signal processors or general purpose microprocessors. In accordance with the invention, the motion field coder includes three main blocks. The first main block is called a QR motion analyzer. Its task is to find a new representation of the inputted motion field produced by the motion field estimator. This new representation is applied to the second main block. Ope¬ rations in this first main block include a plurality of steps comprising matrix operations: In the first step the prediction frame is linearized using some known approximation method so that the prediction frame becomes linear with respect to motion vectors. In the second step a matrix Ej and a matrix y f are constructed for minimisation of the square prediction error. In the third step the well known QR factorization algorithm is used to decompose the matrix Ej into a product of two matrices Qi and Rj. In addition, an auxiliary vector zi is calculated from the factor matrix Qi and the matrix . Part of the matrix Ri and the auxiliary vector Zj are applied to the second main block. The secod main block called a segment merging block performs merging operation for pairs of adjacent segments by finding whether their combined area can be predicted using a common motion field. In the matrix operations a matrix equation is firstly formed, thereafter the factor matrices are processed by using known matrix computation methods. The result is a matrix equation, where one matrix includes terms on the basis of which it is easy to calculate the sqare prediction error in the area of the merged segments. If the change of the square prediction error is acceptable according to a chosen criterion the the segments are merged. After all pairs of segments are considered the output of the segment merging block is : i. a new division of the image with reduced number of segments, ii. for each new segment the block outputs matrix R 1 , , vector , iii. merging information which is sent to the decoder and helps the decoder to identify segments which were merged. The third main block is called a coefficient removal block. The block receives as the input new division of the current frame into segments and for every segment it receives matrices R'*, z'_, and c t produced by the segment merging block. Motion vectors of every segment are represented by a number of motion coefficients. The motion coefficient removal block determines for each of the segments if it is possible to simplify the motion field model, wit- hout excessive increase of prediction error. Some basis functions are remo¬ ved from the motion model, wherein less coefficients are required to describe such a simplified motion field model. The operations in this third main block are matrix operations, in which the matrix equation is firstly modified by removing one column and row of the factor matrices, then the matrix equation is triangularized. Removal one co¬ lumn and row correspods to removal one basis function from the motion mo¬ del. The change of the square prediction error for the segment caused by re¬ moval of one basis function is equal to the square of one term in equation. If the change of the prediction error is acceptable according to a chosen criterion than one coefficient is removed from the coefficient set. More coeffi¬ cients for the segment can be reduced further repeating these matrix opera¬ tions. After sufficient amount of coefficients has been removed final motion coefficients for the segment are calculated by solving the resulting linear equation. The equation can be solved using one of well known algorithms, e.g., backsubstitution. This third main block outputs for every processed segment selection in¬ formation which tells which basis functions were removed from motion field model. Additionally it outputs new motion coefficients corresponding to the remaining basis functions. Both selection information and motion coefficients are transmitted to the decoder. BRIEF DESCRIPTION OF THE DRAWINGS Fig. 1 is a schematic diagram of a known encoder; Fig. 2 is a schematic diagram of a known decoder; Fig. 3 depicts adjacent segments for merging; Fig. 4 illustrates merging by motion field approximation; Fig. 5 is the motion field coder according to the invention; Fig. 6 is a schematic diagram of QR motion analyser. DESCRIPTION OF THE ILLUSTRATIVE EMBODIMENT Fig. 5 illustrates the motion field encoder according to the invention. It corresponds to the block 3 in fig. 1 but it has as inputs also the reference fra¬ me and the current frame. The third input to this block is the motion vector field [Δx( ),Δ ( )] produced by motion field estimation block 2, fig. 1. If we imagine, that the output of the video encoder is the compressed frame divided into segments and each of the segments is accompanied by motion coefficients, then for a segment S t which consists of P pixels with coordinates (χ,,y,), i = l,2,...,P, the task of the motion field coder is to find the motion coefficients c = (c i ,c 2 ,...,c N+M ) of a compressed motion vector field [__*(•), Δy(-)l where the motion vectors are described by a linear motion model, the field being of the form: such that it minimizes square prediction error: ∑ (/. (*, . y, ) " .-1 (*, + Δx(*, . y, ), y t + Δy(x, , y, ))) 2 . (5) 1=1 To fulfill said task, the motion field encoder consists of three main buil¬ ding blocks which are the QR motion analyser block, the segment merging block and the motion coefficient removal block. The segment merging block and the motion coefficient removal block reduce the amount of motion infor- mation which results in increase of the square prediction error. The objective of the QR motion analyzer is to find a new representation of the motion field. This new representation is used later in the other two blocks for a fast and flexible finding of motion coefficients for merged segments and for coefficient removal. The operation of QR Motion Analyzer consists of following steps: Step 1 is linearization of error. In this step the prediction frame /„_,(•) in equation (7) is approximated using some known approximation method so that it becomes linear with respect to [2_x( ),Δy( )l . Then elements under sum in the formula (5) become linear combinations of coefficients c, Σ A + e j 2 c 2 +- "^ e j,N+M N+M - y ,r (6) ;=ι Step 2 is construction of matrices. It is based on the fact that minimisati¬ on of the formula (6) is fully equivalent to minimisation of the matrix expressi¬ on (E,c I -y,) r (E,c, -y,) , where E, and y, are: 'I, l '1.2 '2.1 '2.2 E. = (7) '- ,1 '/• ,2 Step 3 is QR Factorization. The well known QR factorization algorithm is described in the document G. H. Golub and C. van Loan, " Matrix computati¬ on" 2'nd edition, The Johns Hopkins University Press, 1989. This algorithm is used to decompose E, into a product of two matrices E, = Q,R, (8) In this step is also calculated an auxiliary vector z, where z, = Q r , (9) In step 4 the output of the QR motion analyzer block is calulated. The output comprises of a matrix R, 1 consisting of N+M first rows of matrix R, and a vector z\ consisting of first N+M elements of z ( . In the segment merging block merging operation is performed for pairs of adjacent segments S t and S J t see fig. 4, by finding whether their combined area 5 y can be predicted using a common motion field described by motion coefficients c,. . Merging operation consists of the following steps: Step 1 comprises matrix calculation. This invention utilizes a previously unknown property that motion coefficients c y can be found by solving the system of linear equations: where R 1 ,, z 1 , and R , ~ are already produced by the QR analyzer block for segments 5, and S } respectively. Step 2 comprises triangularization of the matrices obtained in the step 1. Matrices R 1 ,, R 1 , are upper triangular and the system in equation (10) has according to the teaching of the afore mentioned documet the form: where symbol x denotes a nonzero element. According to the teaching of the afore mentioned documet, the system is triangularized by applying a series of multiplications of rows by scalars followed by additions of the rows, i.e., it is converted to the form: '1,1 '1.3 0 '2,2 '2,3 0 0 '3,3 0 0 0 0 0 0 0 (12) 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 In the step 3 merging error is evaluated. The change of the square pre¬ diction error AE ij in the area S 0 caused by merging of segments S, and S j is calculated according to the teaching of the afore mentioned documet, wherein N+M ( 13) k=\ Finally, in the step 4 the segments are merged if the change of square prediction error in the formula (13) is acceptable according to a chosen criteri¬ on. For the resulting new segment S υ matrix R\, and vector z , are built by taking first N+M rows of the system in equation (12), i.e., are given by formula: (14) After all pairs of segments of the frame are considered the output of the segment merging block is obtained. The output comprises of three kind of in¬ formation. Firstly, it gives a new division of the image with reduced number of segments. Secondly, it gives for each new segment the block outputs matrix R' υ , vector hirdly, it gives merging information which is sent to the deco¬ der and helps the decoder to identify segments which were merged. The motion coefficients c u = (c c 2 ,...c N+M ) for the segment S tj could be now calculated by solving the system of equations R' y c y = z\ . but their calcu¬ lation is not necessary if the next block, the coefficient removal block is used. We consider now operation of the coefficient removal block. The block receives as the input new division of the current frame into segments and for every segment S k it receives matrices R'_, z , and c t produced previously by the segment merging block. Motion vectors of every segment is represented by N+M motion coefficients. The motion coefficient removal block determines for a given segment S k if it is possible to simplify the motion field model, without excessively increase of prediction error. Simplified motion field model is obtained when some basis functions are removed from the model in equations (3) described in the background art of this application. Less coefficients are required to describe such a simplified motion field model. The following procedure is performed for segments in order to find out whether i'th basis function (and i'th coefficient) can be removed from the moti¬ on field model: Step 1 includes matrix modification, where system of linear equations ΕL l k k = ~l k (15) is modified by removing i'th column from R'„ and i'th element are from c k . Step 2 includes matrix triangularization, where the system in equation (15) is triangularized in the known manner by applying a series of multiplica¬ tions of rows by scalars followed by additions of the rows, i.e., it is converted to the form: Step 3 includes error evaluation. The change of the square prediction er¬ ror for the segment caused by removal of i'th coefficient is simply equal to the term q 2 , in equation (16) . Step 4 includes removal of coefficients. If the change of the prediction error is acceptable according to a chosen criterion than the coefficient c, is removed from the coefficient set. The new number of coefficients is now N+M- 1. Matrix RV and vector τ are modified to form: (17) Number of coefficients for the segment can be reduced further by using matri- ces (17) in the equation (15) and repeating the steps 1-4. Step 5 includes coefficient calculation. After sufficient amount of coeffi¬ cients has been removed, this step is started. In this step final motion coeffi¬ cients for a segment S k are calculated by solving the system of linear equa¬ tions: R'_c έ = _. ( 18) where matrix R 1 * and vector τ are the result of the previous steps 1-4. The equation can be solved using one of well known algorithms, e.g., back- substitution. The motion coefficient removal block outputs for every processed segment selection information which tells to the decoder which basis functions were removed from motion field model. Additionally it outputs new motion coefficients corresponding to the remaining basis functions. Both selection information and motion coefficients are transmitted to the decoder. As a result of all of the steps in all of the blocks, the motion field coder according to the invention produces merging information telling to the decoder which segments are merged, selection information telling to the decoder which basis functions are removed and motion coefficient information. The main advantage of the present invention over prior art solutions is its ability to reduce the amount of motion information by large factor without cau¬ sing large increase of prediction error. Additionally the complexity of the ove¬ rall system is low which allows practical implementation on available signal processors or general purpose microprocessors. The segment merging block has a unique ability of finding motion vec¬ tors of combined segments from given motion vectors estimated for separate segments. It can be proven that the motion vectors it produces are in fact op¬ timal in terms of keeping minimal square error for the combined segment. This explains the ability of this block to dramatically reduce the number of segments with only very modest increase of square prediction error. The motion coefficient removal block is a very powerful tool for instanta¬ neous adaptation of the motion model to the actual amount and type of moti¬ on in the video scene. This block can easily test the result of prediction (value of square prediction error for a segment) with a very large number of models, e.g., with all possible combinations of motion field basis functions. No other known method has this amount of flexibility. A strong advantage of this sche¬ me is that it does not need to repeat process of motion estimation hence is computationally simple. By using motion estimation followed by QR motion analyzer the motion field coder can find new motion coefficients for any desired combination of image segments or any desired model of the motion field in the segment by solving very simple systems of linear equations. DESCRIPTION OF THE PREFERRED EMBODIMENT In the preferred implementation quadratic polynomial motion vector field model with 12 coefficients is used: Δx(x, y) - c t + c 2 x + c 3 y + c xy + c 5 x 2 + c 6 y 2 Δy{x, y) = c 7 + c 8 x + c g y + c w xy + c u x 2 + c u y 2 This model in practice can handle very well even very complex motion in video sequences and yields good prediction results. In the QR motion analyzer block, linearization in the step 1 is done by using Taylor expansion of /__,( • ) at every pixel (χ,,y,) where i = l,2,...,P around points: x' = x,+Δx(x„y,) y,'=y, + Δy( χ „y,) Using property that ∑α 2 = ∑(-α) 2 , the prediction error is then Auxiliary values g j (χ,y) are calculated using formula: when ; = 1,2,...,N 8j ,,y ' \f J (x„y l )G y ( χ „y l ) when ; = N + l,N + 2,..., N + M where function fj(Xι,yι) is basis function as defined in the equations (4a) and (4b). Matrix E and vector y in equation (9) are build using formulas: " _.(*ι.>.) & ..: ) .) _ *p:y.) ' E = 5l(*2')_) &(*2»3-) _fA-.ii- (^.Λ) ft -.y.) gι( χ p>yp &N+M X p->yp). G x (x,y) and G y (χ,y) are values of the horizontal and vertical gradient of the reference frame 7 n _,(x,y) calculated using following formula: G-(Λ,y) = 7-_ 1 (x + l,y)-7._ 1 (x-l,y), Figure 6 shows a schematic diagram of QR Motion Analyzer. Row selec¬ tion block selects only Ν+M first rows of the input matrix. In the segment merging block following strategy for segment merging is used: a. a threshold T is selected which corresponds to allowed increase of square prediction error in whole frame. b. for all pairs of adjacent segments ΔE y is calculated using equation (13). c. pair of segments with smallest ΔE y is merged. d. points b-c are repeated until sum of AE tj corresponding to all merged pairs of segments is greater then T. For triangularization of system in equation (11) a sequence of Givens rotations is used. In the motion coefficient removal block the following strategy for coeffi- cient removal is used: a. a threshold T is selected which corresponds to allowed increase of square prediction error in whole frame. b. for all segments and all basis functions q 2 is calculated using equation (16). c. basis function of a segment with smallest q 2 is removed. d. points b-c are repeated until sum of all q 2 's corresponding to all removed basis functions in different segments is greater then T. The system in formula (16) is triangularized using a sequence of Givens rotations. The final motion coefficients of segments are calculated by solving equation (18) using backsubstitution algorithm. The pixel values of /__,(*, y), G x ( χ ,y) and G (x,y) are defined only for in¬ teger coordinates x and y . In many instances when x or y are noninteger the pixel value is calculated using bilinear interpolation of closest pixels with inte- ger coordinates. The system can be implemented in a variety of ways without departing from the spirit and scope of the invention. For instance, different linear motion models can be used in equations (3). Different methods can be used to linea¬ rize the term in the formula (5). Further, different criteria may be used to deci- ded whether to merge or not to merge two segments. The strategy for deci- ding whether a given basis function should be removed from the model may vary. Triangularization of matrices in equations (10) and (15) can be perfor¬ med using various algorithms and calculation of final coefficients by solving equation (18) can be done using a number of known algorithms for solving systems of linear equations. Finally, different inteφolation methods can be used to values of 7 n _,(x,y), G x (x,y) and G y (x,y) in noninteger coordinates.

Claims: We claim: 1. A video codec comprising: a motion field coder responsive to the current frame, a reference frame and a motion vector field for producing a coded motion vector field and for minimizing the number of the motion coefficients, the motion field coder comprising: a first main block including linearization means for linearizing a squa¬ red error function between a segment of the current frame and a segment of the prediction frame, and matrix processing means for forming a first matrix R and a first vector z 1 , , said matrix and vector being a new representation of the motion vector field of the segment; a second main block connected to the first main block, the second main block including merging means for merging pairs of adjacent segments if the combined area can be predicted using a common motion field, wherein, for each merged segment, the block outputs a first merged matrix R' y and a second merged vector z\, , a third main block connected to the second main block, the third main block including coefficient removal means for removing motion coeffi¬ cients of the segment untill the change of the squared prediction error is not acceptable, wherein the third main block outputs reduced number of motion coefficients of each segment. wherein in the outputted coded motion vector field each motion vector is based on a linear motion model comprising basis functions and mo¬ tion coefficients 2. A video codec as in claim 1 , wherein linearization means trans¬ form the square prediction error to a form according to the formula: . ∑ (e, , ,c, + e 2 c 2 +- →e j N+M c ' N+M - , ) 2 =ι where c, is motion coefficient and N+M is the number of motion coefficients. 3. A video codec as in claim 2, wherein the matrix processing means include means for constructing following matrices: 4. A video codec as in claim 3, wherein the matrix processing means further include QR factorization means for decomposing in the as such known manner the matrix Ej into a product of a matrix Q, and a matrix Rj and for for¬ ming an auxiliary vector z, of the form z, = Q r ,y, and for outputting a first matrix R, 1 consisting N+M first rows of matrix R, and the first vector z\ con¬ sists of first N+M elements of z,. 5. A video codec as in claim 1 , wherein the merging means includes means for triangularizating the linear equation where R\, z 1 , and R 1 ,, z 1 , are produced by the first main block for segments 5, and S ] respectively, to the form: '1,1 '1,2 ' 1,3 0 r 2,2 r 2,3 0 0 r 3,3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 6. A video codec as in claim 5, wherein the merging means further includes means for calculating the change of the square prediction error ΔE y in the area S caused by merging of segments 5, and S in accordance with the following formula: N+M Δ£y = Σ« 2 wherein the segments are merged if the change of the square prediction error is acceptable according to a given criterion. 7. A video codec as in claim 5, wherein the merging means further includes means for building for the resulting merged segment S (j a matrix R' y and a vector z'y by taking first N+M rows of the triangularizated matrix equati¬ on, wherein the matrix R'y and vector are described by the following formula: said matrix and vector being outputted from the second main block. 8. A video codec as in claim 1 , wherein the merging information is send to the decoder. 9. A video codec as in claim 1 , wherein the coefficient removal me¬ ans includes means for reducing the matrix equation R' t c λ = ~ by removing i'th column from a matrix R' t and i'th element from the vector c k , 10. A video codec as in claim 9, wherein the coefficient removal me- ans further includes means for triangularizing the reduced matrix equation to the form: wherein the change of the square prediction error caused by removal of the i'th column and i'th element is equal to q 2 , . 11. A video codec as in claim 10, wherein the coefficient removal means further includes means for comparing the change of the prediction error to a chosen criterion. 12. A video codec as in claim 11 , wherein the coefficient removal means further includes means for removing the motion coefficient c i from the coeffi¬ cient matrix if the change is acceptable, and means for forming a modified matrix R 1 * and a modified vector τ by removing the bottom row from the triangularized matrix, said modified matrix and modified vector being applied to the coefficient removal means. 13. A video codec as in claim 11 , wherein the coefficient removal means further includes means for calculating of final motion coefficients for the segment by solving the system of linear equations R'*c t = z , if the further change is not acceptable.

Inventors: KARCZEWICZ MARTA, NIEWEGLOWSKI JACEK, KARCZEWICZ, MARTA, NIEWEGLOWSKI, JACEK
Applicants: KARCZEWICZ MARTA, NIEWEGLOWSKI JACEK, NOKIA MOBILE PHONES LTD, KARCZEWICZ, MARTA, NIEWEGLOWSKI, JACEK, NOKIA MOBILE PHONES LTD.
Application year: 1995
Main classification: H04N7
IPC codes: G06T9, H04N7