Method for scalable delivery of compressed video data
Abstract
A method and system for scalable delivery of compressed video data over a communications network which is dynamically adaptable to network congestion conditions. A frequency domain encoding algorithm is used to encode/compress the video data which generates frequency domain coefficients and motion vectors representing the video. The DC coefficients, motion vectors and header data required for decoding are stored in a base-file, and the AC coefficients are split into ordered groups and stored in separate delta-files. During transmission the base-file is always sent, which itself can provide a low level of video quality when decoded. Depending upon network conditions, as many of the delta-files containing the AC coefficients as possible or desirable can be dynamically multiplexed with the base-file to provide for greater quality video. The network conditions can be determined by monitoring the packet loss ratio on the network, for example.

Term
Term ended
Projected expiry passed 8 June 2019, 7.3 years ago.
- Priority
- Filed
- Published
- Projected expiry
- Today
19 claims: 4 independent, 15 dependent
- 1A method for delivering encoded visual media data over a transmission medium comprising the steps of:applying a frequency domain encoding algorithm to visual media data to generate encoded media data having a sequence of ordered frequency domain coefficients;arranging the coefficients into a plurality of frequency groups, each frequency group having at least one consecutively ordered frequency domain coefficient;transmitting the lowest order frequency group over the transmission medium;and according to conditions on the transmission medium, transmitting at least one higher order frequency group over the transmission medium multiplexed with the lowest order frequency group.
- 10A method for scalable delivery of moving pictures data over a communications network, comprising the steps of:encoding the moving pictures data according to a frequency domain encoding algorithm to generate an ordered sequence of frequency domain coefficients;arranging the sequence of frequency domain coefficients into a plurality of consecutively ordered frequency groups;determining a communications status parameter of the network;and transmitting on the communications network a set of at least one of the consecutively ordered frequency groups selected in order beginning with the lowest order frequency group according to the communications network status parameter.
- 18A method of encoding picture data for scalable delivery over a communications network, comprising:applying a frequency domain encoding algorithm to the picture data to generate an ordered sequence of frequency domain coefficients;arranging the frequency domain coefficients into a base-file and a plurality of delta-files, the base-file including the lowest order frequency domain coefficients together with header data and required decoding information and the delta-files each including a plurality of consecutive higher order frequency coefficients;and storing the base-file and delta-files for selective multiplexing of the delta-files with the base-file during transmission over said communications network.
- 19A system for scalable delivery of moving pictures data over a communications network to which the system is coupled, comprising:a moving pictures encoder for generating an ordered sequence of frequency domain coefficients, representing the moving pictures data, according to a frequency domain encoding algorithm;means for arranging the sequence of frequency domain coefficients into a plurality of consecutively ordered frequency groups and storing the ordered frequency groups in corresponding respective data files;means for determining a communications status parameter of the network;selection means for selecting a consecutive set of at least one of the ordered data files, beginning with the lowest order data file, and zero or more of the higher order data files according to the communications network status parameter;and delivery means for multiplexing together the selected set of ordered data files for transmission on the communications network.
Independent claims4
38 paragraphs, as filed
Field of the invention
0001The present invention related to the delivery or communication of compressed moving pictures data, and in particular to a scalable delivery scheme for compressed video.
Background of the Invention
0002Digital compression has been applied to moving pictures for the purposes of transmissions bandwidth or storage size reduction. One current art of such compression techniques can be derived from the ISO/IEC MPEG Standards, the ISO/IEC 11172-3 (MPEG-1), the ISO/IEC 13818-2 and 13818-6 (MPEG-2) and the MPEG-2 TM5 (test model 5), developed by the Moving Picture Experts Group of the International Organisation for Standardization. The disclosures of those standards documents and annexes are hereby expressly incorporated into this specification by reference.
0003MPEG-2 video has been widely adopted in nowadays multimedia applications, eg., video-on-demand and multimedia broadcasting service. With the emergence of Fast Ethernet and Gigabit switching capabilities and its wide acceptance, many people are now attempting to use IP-based networks to deliver MPEG-2 video. However current IP-based networks, and even future networks that support protocols like Resource Reservation Setup Protocol (RSVP) or Type of Service (ToS), can not really provide a Quality of Service (QoS) guarantee as in ATM networks which incorporate such service requirements in its specifications. Therefore, when an IP-based network becomes congested, the MPEG-2 video quality suffers significantly because of packet loss. Scalable delivery schemes have been suggested in order to solve this problem because the scalable delivery schemes can guarantee the best video quality in proportion to the available bandwidth.
0004The MPEG-2 video compression algorithm employs two basic techniques: motion compensation for the reduction of the temporal redundancy, and transform domain coding for the reduction of spatial redundancy. The motion compensation technique, which is applied both in the forward and backward direction, results in three kinds of frame: I, P and B frames. The I-frames(I-pictures) are intra-coded pictures used mainly for random access or scene update. The P-frames(P-pictures) use forward motion predictive coding with reference to previously coded I- or P- frames (anchor pictures), and the B-frames(B-pictures) use both forward and backward motion predictive/interpolative coding with reference to previously coded I-or P-frames. In the MPEG-2 video based applications eg., video-on-demand, VCR-like operations such as Fast Forward/Rewind are normally implemented by only transferring I or P frames and skipping B or P frames. Only transferring I or P frames generates a large amount of traffic because I and P frames are of much larger size compared to B frames. Therefore, a very high bandwidth is required to accommodate such a large traffic throughput. If it is not satisfied the network is likely to be congested. A scalable delivery scheme described herein can be used to avoid network congestion caused by the large amount of traffic generated from such VCR operations.
0005Previous reported work on scalable delivery of MPEG-2 video involves, for example, data partitioning, and spatial, temporal and frequency resolution scaling. A description of such techniques can be found in an article entitled "Bandwidth Renegotiation for VBR Video Over ATM Networks" (D.J. Reininger, D. Raychaudhuri and J.Y. Hui; IEEE Journal on Selected Areas in Communications, Vol. 14, No. 6, pp1076-1086, August 1996). Data partitioning assigns different frequency DCT coefficient with different priority. Spatial resolution scaling involves switching among multiple video streams pre-compressed at different resolutions. Temporal resolution scaling involves selectively skipping frames to reduce the bit rate. Frequency resolution scaling involves requantizing the quantized information using a higher quantization step so that the desired bit rate can be achieved.
0006However, all these schemes have intrinsic disadvantages. Data partitioning, for example, lacks flexibility. Spatial resolution scaling requires more storage space to store multiple video streams. Temporal resolution scaling introduces more serious video quality degradation compared to other schemes. Frequency resolution scaling increases the complexity of the server program and introduces a long processing delay.
Summary of the Invention
0007In accordance with the present invention, there is provided a method for scalable delivery of moving pictures data over a communications network, comprising the steps of: <ul id="ul0001" list-style="none" compact="compact"><li>encoding the moving pictures data according to a frequency domain encoding algorithm to generate an ordered sequence of frequency domain coefficients;</li><li>arranging the sequence of frequency domain coefficients into a plurality of consecutively ordered frequency groups;</li><li>determining a communications status parameter of the network; and</li><li>transmitting on the communications network a set of at least one of the consecutively ordered frequency groups selected in order beginning with the lowest order frequency group according to the communications network status parameter.</li></ul>
0008The present invention also provides a method for delivering encoded visual media data over a transmission medium comprising the steps of: <ul id="ul0002" list-style="none" compact="compact"><li>applying a frequency domain encoding algorithm to visual media data to generate encoded media data having a sequence of ordered frequency domain coefficients;</li><li>arranging the coefficients into a plurality of frequency groups, each frequency group having at least one consecutively ordered frequency domain coefficient;</li><li>transmitting the lowest order frequency group over the transmission medium; and</li><li>according to conditions on the transmission medium, transmitting at least one higher order frequency group over the transmission medium multiplexed with the lowest order frequency group.</li></ul>
0009The present invention further provides a method of encoding picture data for scalable delivery over a communications network, comprising: <ul id="ul0003" list-style="none" compact="compact"><li>applying a frequency domain encoding algorithm to the picture data to generate an ordered sequence of frequency domain coefficients;</li><li>arranging the frequency domain coefficients into a base-file and a plurality of delta-files, the base-file including the lowest order frequency domain coefficients together with header data and required decoding information and the delta-files each including a plurality of consecutive higher order frequency coefficients; and</li><li>storing the base-file and delta-files for selective multiplexing of the delta-files with the base-file during transmission over said communications network.</li></ul>
Brief Description of the Drawings
0010The invention is described in greater detail hereinafter, by way of example only, with reference to embodiments thereof which are described with the aid of the accompanying drawings, wherein: <ul id="ul0004" list-style="none" compact="compact"><li>Figure 1 is a diagrammatic illustration of a scalable video data delivery scheme in accordance with an embodiment of the present invention;</li><li>Figure 2 is a block diagram illustrating the composition of video data stream of various bandwidth requirements from a base-file and several delta-files representing encoded video data;</li><li>Figure 3 is a diagrammatic illustration of network status measurements based on packet loss ratio in a packet-based communications network, for implementing a particular form of the present invention;</li><li>Figure 4 is a diagram showing the composition of delta-files in an embodiment of the invention and the effect of run length encoding; and</li><li>Figure 5 is a block diagram of an advantageous structure of delta-files in an embodiment of the invention, for ease of multiplexed construction of a video data stream for transmission.</li></ul>
Detailed Description of the Preferred Embodiments
0011Embodiments of the invention for implementing a scheme for scalable delivery of compressed video are described hereinbelow. The basis of the scalable delivery scheme is relatively simple, and can be easily implemented and practised without many disadvantages associated with scalable delivery schemes which have been proposed previously, some of which are mentioned above. The basis of the scalable delivery scheme exploits limitations in human visual acuity to higher (spatial) frequency components in moving images, and accordingly is able to utilise aspects of a frequency based video picture data encoding or compression system. Broadly speaking, a conventional frequency based encoding or compression system can be modified to deliver video data in which the upper frequency components are limited according to the available delivery capabilities of the communications medium over which the data is conveyed. Preferably the communications network which is utilised for delivering the video data has provision for indicating a measure of the network congestion(status) or available bandwidth, by which a judgement on the limitation of upper frequency components to be included may be made.
0012The scheme is based on the feature that different frequency AC coefficients in frequency encoded picture data have different contributions to the video quality, and that human beings are not very sensitive to the video quality degradation caused by the removal of high frequency AC coefficients. Referring to Figure 1, when applying the scheme in a real application, e.g. a video-on-demand content server, an MPEG-2 bit stream 11 is split and stored into a base-file 12 and one or more delta-files (labelled 1...n). The base file 12 contains the header data, motion vectors and DC coefficients. The delta-files only contain different respective AC frequency coefficients. At the time of transmission of a video stream based on the encoded video data, the server dynamically multiplexes (13) the base-file and a certain number of delta-files into a resultant stream to deliver (14). The number of delta-files is determined according to the current status of the network over which the video data stream is to be delivered, obtained from the network management protocol. The pre-compressed and stored base-file and delta-files representing the video data can be dynamically multiplexed at the time of transmission, based on a dynamic network status parameter representing network congestion, for example, so that the scalable delivery scheme can be implemented in real-time.
0013The compression of the raw video data using a frequency domain encoder (e.g. MPEG-2 compliant encoder) and dividing the resultant frequency coefficients amongst the base-file and a plurality of delta-files can be performed using any suitable digital computational apparatus of the type which is already known for compressing video. The system for delivering the encoded video in a scalable manner according to an embodiment of the invention does not require complex computational processing, and may typically be implemented on a computer server platform coupled to convey data over a suitable communications network (as discussed in greater detail below). The compression and file creation can be performed on the same computer apparatus as the multiplexing delivery scheme, or can be pre-computed on a separate processor.
0014Compared to data partition, this scheme is more flexible since it is possible to divide the encoded frequency domain coefficient data into as many delta-files as required or desired. Compared to spatial resolution scaling, this scheme requires much less extra space, as delta-files need contain only AC coefficients and no headers and motion vector information. Compared to temporal resolution scaling, this scheme results in better video quality because no frames are skipped. Compared to frequency resolution scaling, the server program is simpler and introduces less processing delay, since only a multiplex process is needed and no re-quantization is involved.
0015In the following description, several examples are presented to explain the use of the scalable delivery scheme according to embodiments of the invention in real applications to achieve efficient transmission and avoid network congestion when performing VCR-like operations. The MPEG-2 video stream used in the examples is described, as well as how to split it into the base file and delta-files. Two application scenarios that adopt the proposed scheme are then described, one is based on RTP/RTCP, the other one based on MPEG-2 DSM-CC SRM. Finally, the manner in which the problem of network congestion, associated with VCR-like operations for example, can be eased by implementation of a system embodying the present invention is explained.
0016An MPFG-2 video elementary stream is used in the below examples, and the general structure of the MPEG-2 video data will be readily understood by those of skill in the art from the above referenced documents. In this example the video stream has a resolution of 720 by 480 pixels and a frame rate equal to 29.970 frames per second. The number of frames in a group of pictures (GOP) is 15. Further, the spacing between consecutive P frames is 3, such that, in other words, the GOP pattern is IBBPBBPBBPBBPBB. The bit rate of the stream is 5Mbps. The video stream file is of size 147M bytes.
0017In this case, the compressed video stream can be split into the base-file and four delta-files containing the various AC compressed image components. The base file contains headers, motion vectors and DC coefficients, and has a size of 61 Mbytes. The four delta-files contain the AC coefficients, which are numbered from 1 to 63 in increasing frequency. Table 1, below, indicates the arrangement of the AC coefficients in the delta files. <tables id="tabl0001" num="0001"><table frame="all"><title>Table 1.</title><tgroup cols="3" colsep="1" rowsep="1"><colspec colnum="1" colname="col1" colwidth="52.50mm" /><colspec colnum="2" colname="col2" colwidth="52.50mm" /><colspec colnum="3" colname="col3" colwidth="52.50mm" /><thead valign="top"><row><entry namest="col1" nameend="col3" align="center">Base-File and Delta-Files Description</entry></row><row><entry namest="col1" nameend="col1" /><entry namest="col2" nameend="col2" align="center">AC Frequency Range</entry><entry namest="col3" nameend="col3" align="center">File Size (Mbytes)</entry></row></thead><tbody valign="top"><row><entry namest="col1" nameend="col1" align="left">Base-File</entry><entry namest="col2" nameend="col2" align="left">0</entry><entry namest="col3" nameend="col3" align="left">61</entry></row><row><entry namest="col1" nameend="col1" align="left">Delta-File 1</entry><entry namest="col2" nameend="col2" align="left">1</entry><entry namest="col3" nameend="col3" align="left">3</entry></row><row><entry namest="col1" nameend="col1" align="left">Delta-File 2</entry><entry namest="col2" nameend="col2" align="left">2-5</entry><entry namest="col3" nameend="col3" align="left">20</entry></row><row><entry namest="col1" nameend="col1" align="left">Delta-File 3</entry><entry namest="col2" nameend="col2" align="left">6-10</entry><entry namest="col3" nameend="col3" align="left">16</entry></row><row rowsep="1"><entry namest="col1" nameend="col1" align="left">Delta-File 4</entry><entry namest="col2" nameend="col2" align="left">11-63</entry><entry namest="col3" nameend="col3" align="left">47</entry></row></tbody></tgroup></table></tables>
0018During transmission, the server dynamically multiplexes the base-file and several delta-files into a resultant stream with the bit rate corresponding to the current network status. If the network load is light, the server may multiplex the base file and all delta-files, which results in the stream with the best video quality. In contrast, if the network is congested, the server may multiplex the base-file and only a certain number of delta-files, e.g. delta-files 1 and 2, to achieve a lower bit rate. Or if the network is very congested, the server can just deliver the base file to achieve the lowest bit rate. Unavoidably, in this case, the video quality degrades, as some high frequency coefficients are not transmitted. However, the degradation suffered from the removal of high frequency coefficients is much less than that from packet loss in the communications network during delivery.
0019As illustrated in Figure 2, for this example video stream, by combing the base-file and various delta-files, five resultant deliverable video streams with different bit rates are possible. The stream with the lowest bandwidth requirements (Stream 1), consists of the base-file only, and in this case is 1.91 Mbps. The second available video stream (Stream 2) comprises the base-file and delta-file 1, and requires 2.00 Mbps. Stream 3 includes the base-file and delta-files 1 and 2 (2.60 Mbps) and Stream 4 further includes delta-file 3 (3.20 Mbps). The highest resolution compressed video stream (Stream 5) includes all of the AC components, and requires transmission of the base-file and all of delta-files 1 to 4. Stream 5 requires 5.00 Mbps.
0020The use of a network management protocol which can provide network status information is particularly advantageous for delivery of scalable video streams in embodiments of the present invention. One such protocol is the Real-time Transport Protocol (RTP), which is described in "RTP: A Transport Protocol for Real-Time Applications" (H. Schulzrinne, S. Casner, R. Frederick and V. Jacobson; RFC 1889; January 1996). Another such protocol is provided by the MPEG-2 Digital Storage Media - Command and Control (MPEG-2 DSMCC) which is described in ISO/IEC International Standard 13818-6, "Information Technology - Generic Coding of Moving Pictures and Associated Audio Information: Digital Storage Media Command and Control", (1996). The disclosure of both of these referenced documents is incorporated herein by reference.
0021The Real-time Transport Protocol (RTP) provides end-to-end delivery services for data with real-time characteristics. The services include payload type identification, sequence numbering, timestamping and delivery monitoring. The RTP Control Protocol (RTCP) is based on the periodic transmission of control packets to all participants in the RTP session. Its primary function is to provide feedback on the quality of the data transmission in terms of packet loss ratio, round-trip delay and jitter.
0022The packet loss ratio can be used to estimate the network status for the purposes of implementing a preferred feature of the present invention. The packet loss ratio is provided from the network in a form which indicates the percentage of packets lost by the network (0.0% - 100%) over a preceding time period. This information can therefore be utilised to provide a measure of congestion on the network. One way of doing this is to set a number of thresholds of packet loss ratio as related to network congestion. For example, Figure 3 is a diagrammatic illustration of network status measurements (congestion) based on packet loss ratio according to two thresholds set at 0.6% and 1.0%. This means that three phases of network status can be determined from the packet loss ratio: congested, normal and light.
0023In this implementation of the scalable video delivery scheme, the server uses RTP to deliver the video stream and at the same time monitors the network status based on RTCP control packets. At the beginning of transmission, the server delivers stream 5 (refer to Figure 2), which is the combination of the base-file and all delta-files. The server keeps sending stream 5 (5.00 Mbps) as long as the packet loss ratio is less than 1.0% (i.e. the network status is considered as normal/light). If the packet loss ratio reaches 1.0%, the server knows that the network is getting congested. This causes the server to stop multiplexing delta-file 4 into the resultant stream, which means the server begins to deliver stream 4 which has a lower bit rate (3.2 Mbps). If the packet loss ratio is still larger than 1.0%, the server stops multiplexing the highest frequency delta-files one by one till packet loss ratio is less than 1.0%. For example, the packet loss ratio of 1.0% on the network might be reached whilst stream 2 is being delivered by the server. On the other hand, suppose that another traffic source on the network stops generating packets so that the video server determines a drop in the packet loss ratio. If the packet loss ratio reaches less than 0.6%, the server determines that the network load is light. Then the server can multiplex the higher frequency delta-files, ie., delta-file 3 and 4, into the resultant stream as long as the packet loss ratio remains less than 1.0%. This allows delivery of the best video quality in proportion to the current network situation to be guaranteed.
0024The MPEG-2 Digital Storage Media - Command and Control (DSM-CC) provides the protocols needed to deliver a complete application such as video-on-demand. Within the DSM-CC functional reference model, there is an entity called Session and Resource Manager (SRM) whose purpose is to control sessions and network resources. It is possible for some new resource descriptors to be added in the SRM, so that the SRM can provide the information such as available bandwidth through U-N messages. Then based on a measure of the available bandwidth provided in this way, the server can directly determine how many delta-files need to be multiplexed in the resultant stream so that the best video quality can be maintained.
0025In the MPEG-2 video based applications, e.g. video-on-demand, VCR-like operations such as Fast Forward/Rewind can be implemented by transferring I or P frames only and skipping B or P frames. Consider, for example, an implementation of the Fast Forward/Rewind functions on the sample video stream introduced above. The bit rate of the resultant stream for skipping B frames only is 6.7 Mbps which is 1.34 times of the original stream. This means that a 1.34 times higher bandwidth is needed to deliver the resultant stream. The faster motion can even be achieved by skipping both P and B frames. If so, the bit rate of the resultant stream is up to 10 Mbps. To accommodate such a large amount of traffic, a very high bandwidth is required of the transport network also. If it is not satisfied the network is very likely to be congested.
0026The scalable delivery scheme described herein can be used to solve the above problem. First, the removal of high frequency coefficients from the encoded data as proposed in the scheme can be used to efficiently reduce the bit rate in VCR-like operations so as to avoid the possible network congestion. Then, based on the current network status, the most suitable number of delta-files can be determined to generate a resultant stream to maintain the best video quality. <tables id="tabl0002" num="0002"><table frame="all"><title>Table 2.</title><tgroup cols="6" colsep="1" rowsep="1"><colspec colnum="1" colname="col1" colwidth="26.25mm" /><colspec colnum="2" colname="col2" colwidth="26.25mm" /><colspec colnum="3" colname="col3" colwidth="26.25mm" /><colspec colnum="4" colname="col4" colwidth="26.25mm" /><colspec colnum="5" colname="col5" colwidth="26.25mm" /><colspec colnum="6" colname="col6" colwidth="26.25mm" /><thead valign="top"><row><entry namest="col1" nameend="col6" align="center">Stream Bit Rate for different resultant streams in VCR-like operations</entry></row><row><entry namest="col1" nameend="col1" align="center">Stream Bit Rate (Mbps)</entry><entry namest="col2" nameend="col2" align="center">Stream 1</entry><entry namest="col3" nameend="col3" align="center">Stream 2</entry><entry namest="col4" nameend="col4" align="center">Stream 3</entry><entry namest="col5" nameend="col5" align="center">Stream 4</entry><entry namest="col6" nameend="col6" align="center">Stream 5</entry></row></thead><tbody valign="top"><row><entry namest="col1" nameend="col1" align="left">Skipping B only</entry><entry namest="col2" nameend="col2" align="char" char=".">2.05</entry><entry namest="col3" nameend="col3" align="char" char=".">2.4</entry><entry namest="col4" nameend="col4" align="char" char=".">3.5</entry><entry namest="col5" nameend="col5" align="left">4.5</entry><entry namest="col6" nameend="col6" align="left">6.7</entry></row><row rowsep="1"><entry namest="col1" nameend="col1" align="left">Skipping P and B</entry><entry namest="col2" nameend="col2" align="char" char=".">2.95</entry><entry namest="col3" nameend="col3" align="char" char=".">3.7</entry><entry namest="col4" nameend="col4" align="char" char=".">5.8</entry><entry namest="col5" nameend="col5" align="left">7</entry><entry namest="col6" nameend="col6" align="left">10</entry></row></tbody></tgroup></table></tables>
0027From Table 2, above, it can be observed that, by only transmitting the base-file and a certain number of delta-files, a lower bit rate can be generated to avoid network congestion. For example, by transmitting base-file and delta-file 1, which forms stream 2, the bit rate can be reduced from 6.7 to 2.4 Mbps (for a fast motion involving skipping B-frames only) and reduced from 10 to 3.7 Mbps (for a fast motion involving skipping both P and B-frames). Based on the network situation, the server can actually select a particular stream to deliver so that the best video quality in proportion to current network situation can be maintained.
0028Figure 4 illustrates a scheme for arranging the frequency coefficients into delta-files for an implementation of an embodiment of the present invention. The base-file and delta-files are indicated by reference numeral 41, and the ordered frequency coefficients labelled DC and 1,...,9 (not all coefficients are shown) are indicated by reference numeral 42. As diagarammatically illustrated in the Figure, the base-file contains the run length encoded DC coefficient and the first AC coefficient (frequency coefficient 1), as well as the compression header data, motion vectors and the like. According to the MPEG standard, the base-file is still an MPEG-2 standard compliant stream which can be decompressed by an appropriate MPEG-2 standard decoder. The delta-files contain run length coded AC coefficients numbered 2 to 63. Each run length code denotes a run of zeros followed by a non-zero coefficient of a particular level. If one run length code covers more than all coefficients allocated to a particular delta-file, the code will be put into the higher frequency delta-file which contains the non-zero coefficient.
0029As shown in Figure 4, the base-file contains the DC and first AC coefficient, the first delta-file (Delta-1) is allocated AC frequency coefficients 2 and 3, the second delta file (Delta-2) is allocated frequency coefficients 4 and 5, and Delta-3 is allocated coefficients numbered 6 to 63. Because the AC coefficients of frequency 2 and 3 are zero, they will be combined in a single run length code together with non-zero frequency coefficient 4. This run length code will be put into Delta file number 2, even though two of the coefficients therein are allocated to Delta-1. Similarly, the run length code denoting coefficients 5 to 8 are put into Delta-3.
0030The delta files are arranged according to a syntax which enables the proper AC coefficients to be extracted and multiplexed with the corresponding portions of the base-file at the time of transmission. This allows the transmitted data to be arranged according to, for example, an industry standard such as the MPEG-2 standard so that the transmitted data stream can be decoded by means of a standard decoder. A preferred structure for a delta-file for an MPEG? based system is illustrated in block diagram form in Figure 5.
0031When the server undertakes construction of a data stream for transmission from the base-file and selected delta-file(s), it synchronously scans the base-file and selected delta-files. Whenever the server program reaches a new block of a macroblock within a picture in the base-file, it also reaches the corresponding position in each of the delta-files, based on the syntax illustrated in Figure 5. In other words, the data in each of the delta-files is structured in the same way as the base-file so that corresponding coefficient data in the base-file and delta-files can be easily retrieved. Thus, when a new block of coefficient data is encountered during scanning of the base-file, the selected corresponding AC coefficient data in the delta-files is also reached, and can be easily multiplexed together to form, for example, an MPEG compliant resultant video stream.
0032The foregoing detailed description of the preferred embodiments is presented by way of example only, and is not intended to be considered limiting to the invention as defined in the appended claims. It is will be readily apparent to those skilled in the art that numerous alternatives to the particular features described in relation to the embodiments of this invention are possible without departing from the essence of the present invention. For example, although the preceding description is based primarily upon MPEG-2 video compression, it is clear that other forms of frequency domain compression or encoding of picture data can equally be employed in implementing the invention. Further, several different examples of dividing or grouping the frequency coefficients into "delta-files" are given, but it will be understood that these examples are not intended to be limiting to the invention. Similarly, the particular example given in relation to determining the appropriate frequency coefficients to multiplex into the delivery stream according to an available network packet loss ratio is given as a presently preferred implementation only, and it will be recognised that various other ways of determining the most appropriate inclusion of frequency components in the delivery scheme are possible and may depend upon the particular communications network used in practice.
0033Throughout this specification and the claims which follow, unless the context requires otherwise, the word "comprise", and variations such as "comprises" and "comprising", will be understood to imply the inclusion of a stated integer or step or group of integers or steps but not the exclusion of any other integer or step or group of integers or steps.
4 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4
Every citation, both ways
| Document | Relation | Office | Cited during |
|---|---|---|---|
| WO03036911A2 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| WO02102084A1 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| GB2564081B | Cited by | United Kingdom | Search report |
| EP2875641A4 | Cited by | European Patent Office (EPO) | Search report |
| WO2004021668A1 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| KR100989222B1 | Cited by | Republic of Korea | Examiner |
| WO2006090253A1 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| WO02056250A3 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| WO02056250A2 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| WO0225925A2 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| WO0225925A3 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| WO0225925A3 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| WO03065683A1 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| WO03036911A3 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| WO02056250A3 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| US8352991B2 | Cited by | United States of America | Applicant |
| US9955154B2 | Cited by | United States of America | Applicant |
| US10516898B2 | Cited by | United States of America | Applicant |
| EP0539833A2 | Cites | European Patent Office (EPO) | Search report |
| EP0577327A1 | Cites | European Patent Office (EPO) | Search report |
| WO9837698A1 | Cites | World Intellectual Property Organization (WIPO) | Search report |
3 members in 2 offices
Priority claims4
| Document | Office | Kind | Date |
|---|---|---|---|
| 1998003575 | Singapore | A | |
| 9803575 | Singapore | – | |
| SG19980003575 | – | – | – |
| 9803575 | – | – | – |
Members3
| Document | Office | Kind | |
|---|---|---|---|
| EP0986265A2This record | European Patent Office (EPO) | A2 | |
| JP2000101537A | Japan | A | |
| EP0986265A3 | European Patent Office (EPO) | A3 |
13 legal events, as 2 offices reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | Office | |
|---|---|---|---|
| Application deemed to be withdrawnWithdrawn18D | 18D | EP | |
| Information on the status of an ep patent application or granted ep patentGrantedSTATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWNSTAA | STAA | EP | |
| Designated country de not longer valid8566 | 8566 | DE | |
| Designation fees paidAKX | AKX | EP | |
| Designated contracting statesAK | AK | EP | |
| Request for extension of the european patentAX | AX | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Search report despatchedORIGINAL CODE: 0009013PUAL | PUAL | EP | |
| Designated contracting statesAK | AK | EP | |
| Request for extension of the european patentAL;LT;LV;MK;RO;SIAX | AX | EP | |
| Public reference made under article 153(3) epc to a published international application that has entered the european phaseORIGINAL CODE: 0009012PUAI | PUAI | EP |
Numbers
- Publication
- 0986265
- Publication, DOCDB
- 0986265
- Publication, EPODOC
- EP0986265
- Application
- 99304427
- Application, DOCDB
- 99304427
- Application, EPODOC
- EP19990304427
Titles3
- German
- Verfahren zur skalierbaren Verteilung von komprimierten Videodaten
- English
- Method for scalable delivery of compressed video data
- French
- Méthode de distribution à échelle variable de données vidéo comprimées
Classification
- CPC, 5
- H04N21/434
- H04N19/132
- H04N19/37
- H04N19/587
- H04N21/236
- IPC, 19
- H04J3 00
- H04L12 70
- H04N1 41
- H04N7 60
- H04N19 102
- H04N19 122
- H04N19 166
- H04N19 18
- H04N19 187
- H04N19 196
- H04N19 33
- H04N19 423
- H04N19 436
- H04N19 46
- H04N19 57
- H04N19 60
- H04N19 70
- H04N21 236
- H04N21 434
Designated states25
- Contracting states, 19
- Austria
- Belgium
- Switzerland
- Cyprus
- Germany
- Denmark
- Spain
- Finland
- France
- United Kingdom
- Greece
- Ireland
- Italy
- Liechtenstein
- Luxembourg
- Monaco
- Netherlands (Kingdom of the)
- Portugal
- Sweden
- Extension states, 6
- Albania
- Lithuania
- Latvia
- North Macedonia
- Romania
- Slovenia