Image analysis – Image compression or coding – Including details of decompression
Reexamination Certificate
1999-02-02
2002-02-26
Boudreau, Leo (Department: 2621)
Image analysis
Image compression or coding
Including details of decompression
C382S236000, C375S240250
Reexamination Certificate
active
06351564
ABSTRACT:
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
old
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.
1
):
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 I
0
to I
4
with respective vbv_delays vbv(I
0
), vbv(I
1
), . . . , vbv(I
4
), . . . , 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
d
+
(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+
1)−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+1)+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
3
of the old sequence (O
1
, O
2
, O
3
) by the picture N
1
of the new sequence (N
1
, N
2
), since the vbv_delay vbv(N1) of N
1
is greater than the vbv_delay vbv(O
3
) of O
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
1
) that the first bit of the first transmitted picture (N
1
) 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(O
3
) that the first bit of the first replaced picture (O
3
) 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 R
int
for which said period vbv(N
1
) is correspondingly reduced to a value at most equal to the period vbv(O
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 N
1
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
int
for which said period vbv(N
1
) is correspondingly reduced to a value at most equal to the period vbv(O
3
);
(b) the operation (a) is repeated for the second picture N
2
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.
REFERENCES:
patent: 5913031 (1999-06-01), Blanchard
patent: 6011598 (2000-01-01), Tsuji et al.
patent: 6072831 (2000-06-01), Chen
patent: 6154494 (2000-11-01), Blanchard
patent: 6160915 (2000-12-01), Kato et al.
patent: 062911 (1996-01-01), None
patent: 0711077 (1996-05-01), None
patent: 0755157 (1997-01-01), None
patent: 974011603 (1997-05-01), None
patent: 9708898 (1997-03-01), None
“MPEG Video Coding: A Basic Tutorial Introduction”, by S.R. Ely, Research and Development Report BBC RD Mar. 1993, pp. 1-10.
Boudreau Leo
Gross Russell
Sherali Ishrat
U.S. Philips Corporation
LandOfFree
Method of switching of coded video sequences and... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method of switching of coded video sequences and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of switching of coded video sequences and... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2946537