METHOD OF SWITCHING OF CODED VIDEO SEQUENCES AND CORRESPONDING DEVICE

Abstract: The invention relates, in a video decoder, to a method of switching from a first to a second coded video sequence when the second bit rate is lower than the first one. If the time spent in the decoder's buffer by the first bit of the first transmitted picture of the second sequence that has to be decoded, also called vbv_ delay, is greater - and therefore not compatible with - than the similar period for the first bit of the first replaced picture of the first sequence, it is then reduced by giving to the bit rate of said first transmitted picture an increased value, in order to obtain the compatibility of the vbv_ delays. In case of a limited bandwidth for the bit rates, this reduction operation is successively repeated for as many following pictures as necessary.

Description: METHOD OF SWITCHING OF CODED VIDEO SEQUENCES AND CORRESPONDING DEVICE. FIELD OF THE INVENTION The present invention relates, in a video decoder provided with a buffer for receiving pictures to be decoded, to a method of switching, before decoding, from a first coded picture sequence at a bit rate R OM to a second one at a lower bitrate R new , and to a corresponding device for implementing said switching method. BACKGROUND OF THE INVENTION As described for instance in the document "MPEG video coding : a basic tutorial introduction", BBC report RD 1996/3, an MPEG-type compressed video sequence is subdivided into groups of pictures (or GOPs), that themselves include different types of coded pictures (an example of GOP is described in Fig.l) : - intra-coded pictures (I-pictures), that are coded without any reference to other pictures ; - predictive-coded pictures (P -pictures), that are coded using prediction from a past reference ; - bidirectionally predictive-coded pictures (B-pictures), that are coded using prediction from past and/or future reference(s) (the arrows indicate for each P-picture or B- picture the respective reference picture(s)). According to the different types of prediction, pictures are coded with more or less efficiency, and the resulting number of bits is not constant. Moreover, as a picture is assumed, according to the MPEG specifications, to be instantaneously decoded every picture period T v , the first bit of the coded pictures does not spend the same time in the decoder's buffer : this variable time, defined in the MPEG syntax, is called the vbv_delay (vbv = video buffering verifier). An example of decoder's buffer fullness for a stream coded at a constant bit rate and where a picture is instantaneously decoded every picture period T v is shown in Fig.2 (decoder's buffer fullness S(t) versus time t) for successive pictures In to I 4 with respective vbv_delays vbv(I 0 ), vbv(Iι),..., vbv(I ),..., etc. The bit rate for a picture is given by the slope, and the fullness (or decoder's buffer state) is given by the highest point for each period T v . According to Fig.3, the size d(Ij) of a picture Ij decoded at the time t d (Ij) when Ij is removed from the decoder buffer is equal to : d(Ij) = S " (Ij) - S + (Ij) (1) with S " (Ij) and S + (Ij) designating respectively the decoder's buffer state at time t d (Ij) ( = the time just before the picture Ij is removed from decoder's buffer) and at time t (Ij ) ( = the time just after the picture Ij is removed from decoder's buffer). For this picture Ij, the relation between its vbv_delay vbv(Ij), the bit rate R of the video stream and the decoder's buffer state S " (Ij) is given by : S " (Ij) = vbv(Ij).R (2) One has also : S + (Ij) = S " (Ij+l) - R.T v (3) From relations (2), (1), (3), it can be deduced a more precise relation giving (in bits)the size d(Ij) of the decoded picture Ij : d(Ij) = R.(vbv(Ij) - vbv(Ij+l) + T v ) (4) Due to this regulation model, a simple switch between two compressed (coded) video sequences is not always possible : performing a switch with a picture decoded at every period T v is not possible when the vbv_delay of the first new picture that is transmitted is greater than the vbv_delay of the first old picture that is replaced. This situation is illustrated in Fig.4 : it is not possible to replace the picture O of the old sequence (Oi, 0 , 0 3 ) by the picture Ni of the new sequence (Ni, N 2 ), since the vbv_delay vbv(Nl) of Ni . is greater than the vbv_delay vbv(0 ) of 0 3 . It is known, in MPEG-2 standard (such as described for instance in the european patent application EP 0692911), that video switching is then facilitated by the use of special access points called "splicing points" : it can be performed only if same splicing points are present on both old and new video sequences. SUMMARY OF THE INVENTION It is an object of the invention to propose a method that allows video sequence switching without the constraints of splicing point creation. To this end the invention relates to a method such as described in the preamble of the description and which is moreover characterized in that, if the period vbv(Nι) that the first bit of the first transmitted picture (Ni) of the second sequence would have to spend in the decoder's buffer before the decoding time of said first transmitted picture is greater than the similar period vbv(0 ) that the first bit of the first replaced picture (0 ) of the first sequence would have to spend in said buffer before its own decoding time, then the bitrate of said first transmitted picture of the second sequence is increased, at least up to the value Rj nt for which said period vbv(Nj) is correspondingly reduced to a value at most equal to the period vbv(0 3 ). Switch can now be performed without any splicing point. According to the present invention, the bit rate is locally increased in such a manner that vbv_delays of the first old picture that is replaced and the first new picture that is transmitted are now compatible, and therefore that a splicing point is no longer needed in order to implement the switching operation. However, it is not always possible to increase the bitrate indefinitely to reach a suitable vbv_delay value : for instance, the video sequences may be multiplexed with other elementary streams to form a multiplex transport stream, and the method described hereabove may be limited, in that case, by the available bandwidth in said multiplex transport stream. According to the invention, the above-described method is then improved in that, in case of a limited bandwidth for the bitrates : (a) the bit rate of said first transmitted picture Ni is increased up to the lower of the two following values : the maximum bit rate value corresponding to said limited bandwidth, or the value R ιnt for which said period vbv(Nι) is correspondingly reduced to a value at most equal to the period vbv(0 ) ; (b) the operation (a) is repeated for the second picture N of the second sequence, only if said lower value is the maximum bit rate value corresponding to said limited bandwidth ; (c) the operation (a) is similarly repeated for the following pictures N 3 , N 4 ,..., of the second sequence, only if said lower value at the end of the previous operation is said maximum bit rate value. When there is a bandwidth limitation for the bit rate increase, the proposed method is improved by increasing successively the bit rates for as many pictures of the second sequence as necessary, in a way to reduce as much as possible the vbv_delay of the first picture in spite of the constraint due to said bandwidth limitation. BRIEF DESCRIPTION OF THE DRAWINGS The particularities and advantages of the invention will now be apparent from the following description and the accompanying drawings, in which : - Fig.l shows an example of GOP including different types of coded pictures ; - Fig.2 gives an example of decoder's buffer fullness versus time, for a stream coded at a constant bit rate and where a picture is instantaneously decoded at regular times ; - Fig.3 allows to identify the main useful parameters of a picture Ij when using the decoder's buffer fullness representation of Fig.2 ; - Fig.4 illustrates a situation where a switch between an old sequence and a new one is not possible ; - Fig.5 illustrates the principle of the method according to the invention, and Fig.6 shows the resulting stream if the switch is made according to said principle ; - Figs.7 and 8 illustrate a limitation of the method according to the invention : the switch problem, that can be observed in Fig.7, is not completely solved by the implementation of the invention as shown in Fig.8 ; - Fig.9 illustrates the principle of the improved method according to the invention, allowing to solve said limitation ; - Figs.10 to 12 illustrate a situation where underflow occurs ; - Figs.13 and 14 illustrate respectively the steps carried out in a switching device for implementing the described method and in another embodiment of said device. DETAILED DESCRIPTION OF THE INVENTION The principle of the invention is to locally increase, at the transition, the bit rate of the new sequence, which leads to a reduction of vbv(Nι) to a value at most equal to (this value is then designated by (vbv'(Nι)), or even lower, than vbv(0 ) : the switch is now possible. This situation corresponds to Fig.5, that illustrates how the vbv_delays of Ni and 0 (in comparison with Fig.4) are now compatible after the bit rate modification concerning Ni.. The global decoder's buffer evolution after replacing the picture 0 by the picture Ni . is illustrated in Fig.6, that shows the stream obtained when the switch is made according to the principle of the invention. From the relation (2), it can be deduced that : R int = (vbv(N .Rnew)/vbv(0 3 ) (5) knowing that Rnew = bit rate of the new video sequence R ιnt = intermediate bit rate when the method according to the invention is implemented. As can be seen in Fig.5, the intermediate bit rate R mt is applied to the stream as soon as the switch is requested, i.e. at the time t sw when the first bit of the new picture N] enters the decoder's buffer (R o ia designates the bit rate of the old video sequence). As seen in Fig.6, at this time t sw the picture Oi is not yet decoded and its last bits will be introduced in the decoder's buffer at the intermediate rate R mt . When this picture Oi is decoded, the last bits of the picture O are not completely introduced in the decoder's buffer and this introduction is also done at R mt . When O is decoded, similarly the last bits of Ni (that replaces O ) are not yet completely introduced in the decoder's buffer and this introduction is still done at R ιnt . When Ni is decoded, all the subsequent vbv_delays (of N 2 , etc..) are compatible, and the bit rate for the introduction of the following pictures (N 2 , etc..) is now the bit rate R new of the new video sequence. The invention is not limited to the implementation described above, from which modifications can be deduced without departing from the scope of the invention. For instance, if the intermediate bit rate R ιnt becomes higher than the old bit rate R o w, care must be taken that no overflow will appear at the transition. Secondly it is not always possible to increase the bit rate of Ni indefinitely to reach a suitable vbv_delay value : generally the video sequences are multiplexed with other elementary streams to form a multiplex transport stream, and the method of performing a local bit rate modification may be limited in that case by the available bandwidth in said multiplex transport stream. Figs.7 and 8 illustrate respectively the switch problem (when vbv(Nι) is greater than vbv(0 3 ), the switching operation cannot be performed) and an implementation of the switching method such as previously described : vbv(Nι) has decreased by means of an increase of the bit rate of the first transmitted picture Ni of the new sequence. In the case where the available bandwidth is limited, the increase of bit rate of Ni is not sufficient to have for vbv(Nι) a value compatible with vbv(0 3 ). For a reason of simplicity of the figures, the bit rate of the old sequence R o]d is here assumed to correspond to the bandwidth limit for the increase of R new (for the picture Ni). As depicted in Fig.8, the value vbv(Nι) after the bit rate of Ni has increased up to a value equal to the bit rate corresponding to 0 is indeed still greater than vbv(0 ) (in that figure and in the following Figs.9 and 11, the double line corresponds to the picture Ni before the modification of the bit rate of said picture Ni). As it can then be seen in Fig.9, when propagating -according to the invention- the increase of bit rate to the following picture N of the new sequence, the decoder's buffer is partly emptied and vbv(Nj) decreases once more, but, this time, of a quantity that is sufficient to make vbv_delays of Ni and 0 compatible. More generally, it may be proposed, if necessary 6 (i.e. if said quantity is however not sufficient to make vbv_delays of Ni and 0 3 compatible), to increase the bit rate not only on the first, and then on the second new picture, but also successively on each of the following pictures, to a sufficient extent to obtain said compatibility of the vbv_delays. Said generalization may be more precisely studied, and a computation of new buffer states and vbv_delays after such a generalized bit rate modification may be proposed. For that study, it is assumed that : (a) all the notations of variables with index "b" indicate the variables before bit rate modification ; (b) all the notations of variables with index "a" indicate the variables after bit rate modification ; (c) since the implementation of the invention only relates to the new stream, which is independent of the pictures of the old stream, all the notations that consider an image N of the new sequence will be resumed to the index k of this image ; (d) decoded times t d (k) and picture sizes d(k) are not modified during the process. The other used notations not still explained are the following : - ts(I) = time when the first bit of the picture I enters the decoder buffer ; - t sa (l),..., t sa (i),..., t sa (n) = the times similar to ts(I), but after bit rate modification, for pictures 1,..., i,..., n of the new sequence ; - d(l),..., d(i),..., d(n) = size in bits of pictures l,...,i,...,n. It is considered that the bit rate modification is made until the decoding of picture n (consideration on how deep must be the value of n will be presented later). Thus, for time t between t sa (l) to t d (n), the bit rate is equal to R o i and, for time t higher than t d (n), the bit rate is equal to R ne w After t d (n), the buffer fullness does not change : S " a (k) = S ' b (k) and S + a (k) = S + D (k) for k > n. The buffer state at time t d " (n) is S " b (n). The new buffer state at time t ' d (n-l) can then be deduced : S " a (n-1) - S-„(n) - Row.Tv + d(n-l) (6) Moreover : S " b (n- 1 ) = S " b (n) - R new .T v + d(n- 1 ) (7) Thus it may be deduced that : S ' a (n-1) = S- b (n-l) - (R o i d - new ).T, (8) In the same way one can show that : S ' a (n-2) = S ' b (n-2) - (Ro, d - R ne w).2T v (9) And recursively that : S ' a (n- ) = S " b (n-k) - (Roid - R n ew).kT v for k in [0,...,n-l] (10) In the same way, it can be shown that : S + a (n-k) = S + b (n-k) - (R , d - Rnew).kTv for k in [0,...,n-l] (11) New vbv_delays can also be computed : vbv a (n-k) = S " a (n-k)/Roid for k in [0,..., n-1] (12) From equation (10) it is deduced that : Vbv a (n-k) = (S " b (n-k)/R new ).(Rnew/Rold) - kT v .(l - Rnew Rold) (13) for k i=[0,..., n-l] Thus : vbv a (n-k) = vbv b (n-k).(R new Roid) - kT v .(l - R ne w/Roid) (14) for k in [0,..., n-l]. It must be noted, from equations (10) and (11), that the original buffer fullness is lower after a local bit rate increase, since R o i d is higher than R new Thus, if no care is taken, underflow can occur. The condition of non underflow will determine how deep can be the value of n. To have a compliant buffer fullness after local bit rate increase, it is needed to have : S + a (n-k) > 0 for k = [0,...,n-l] (15) Due to equation (11), this leads to : S + b (n-k) > kT v . (Row - Rnew) for k in [0,...,n-l] (16) The condition can also be expressed on vbv_delays. Buffer fullness does not underflow if : vbv b (n-k) > T v for k in [0,..., n-l] (17) Due to equation (14), this leads to : vbv a (n-k) > T v .(Roid - new + k.(RolαVRnew-l)) (18) for k = [0,..., n-l] If there is no problem of underflow, the minimal possible vbv_delay d(l)/R o i d will be reached. Figs. 10 to 12 show an example of a situation where underflow occurs if n = 2 : Fig.10 represents the original stream, Fig.H shows the increase of bit rate until the decoding of picture Ni, and Fig.12 shows the increase of bit rate until the decoding of picture N (as previously, the double lines correspond to the pictures Ni, N before the modification of the bit rate of these pictures). In this last case, underflow occurs, while it does not if the bit rate is o increased only until the decoding of Nj. That is finally this condition of non underflow that will determine the number of pictures of the new sequence for which the bit rate may be increased without any problem. It should however be noted that, after having reduced the vbv_delay according to the present method, it is sometimes possible to be still in a situation where vbv_delays are not yet compatible. It is then possible to combine said method with a second one based on the insertion of so-called minimal pictures, as described in the european patent application n°97401160.3 (PHF97557) previously filed on May 27, 1997. According to said document, the bit rate is no longer modified ; instead, the new video sequence is delayed by a given number k of pictures, and k minimal pictures - i.e. pictures that are coded with a number of bits as low as possible and which stay compliant for the decoding process - are then inserted within the released space between the old and new sequences. The diagrams of Figs.13 and 14 illustrate the main steps carried out respectively in a device for implementing the local bit rate modification such as described and in a device for implementing the above-mentioned combination of methods. In Fig.14, R(of _ min) designates the minimal rate that guarantees no overflow.

Claims: CLAIMS : 1. In a video decoder provided with a buffer for receiving pictures to be decoded, a method of switching, before decoding, from a first coded picture sequence at a bit rate R o w to a second one at a lower bit rate R ne w, characterized in that, if the period vbv(Nι) that the first bit of the first transmitted picture (Ni) of the second sequence would have to spend in the decoder's buffer before the decoding time of said first transmitted picture is greater than the similar period vbv(0 3 ) that the first bit of the first replaced picture (0 3 ) of the first sequence would have to spend in said buffer before its own decoding time, then the bit rate of said first transmitted picture of the second sequence is increased, at least up to the value Rj nt for which said period vbv(Nι) is correspondingly reduced to a value at most equal to the period vbv(0 3 ). 2. A method according to claim 1 , characterized in that, in case of a limited bandwidth for the bit rates : (a) the bit rate of said first transmitted picture Ni is increased up to the lower of the two following values : the maximum bit rate value corresponding to said limited bandwidth, or the value R ιm for which said period vbv(Nι) is correspondingly reduced to a value at most equal to the period vbv(0 ) ; (b) the operation (a) is repeated for the second picture N of the second sequence, only if said lower value is the maximum bit rate value corresponding to said limited bandwidth ; (c) the operation (a) is similarly repeated for the following pictures N 3? N 4 ,..., of the second sequence only if said lower value at the end of the previous operation ((b) for (c), (c) for (d),...) is said maximum bit rate value. 3. A method according to anyone of claims 1 and 2, characterized in that said maximum bit rate value R ιπt is equal to said bit rate R o and said value Rj nt is given by the following relation : R, nt = (vbv(N,).R new )/vbv(0 3 ). 4. A device for switching according to the method as claimed in anyone of claims l to 3. 5. A device as claimed in claim 4, provided for combining said switching method to a second one where a sequence of pictures coded with a number of bits as low as possible is inserted between the first and second sequences.

Inventors: MARTIN FRANCOIS, MARTIN, FRANCOIS
Applicants: KONINKL PHILIPS ELECTRONICS NV, PHILIPS SVENSKA AB, KONINKLIJKE PHILIPS ELECTRONICS N.V., PHILIPS AB
Application year: 1999
Main classification: H04N7
IPC codes: H04N7