中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

10 records (took 0.014 seconds)

    VIDEO STREAMING OVER DATA NETWORKS
    1.
    发明申请
    VIDEO STREAMING OVER DATA NETWORKS 审中-公开
    视频流过数据网络

    公开(公告)号：WO2012085505A1

    公开(公告)日：2012-06-28

    申请号：PCT/GB2011/001743

    申请日：2011-12-20

    Applicant: BRITISH TELECOMMUNICATIONS PUBLIC LIMITED COMPANY ,  NILSSON, Michael, Erling ,  APPLEBY, Stephen, Clifford ,  TURNBULL, Rory Stewart ,  CRABTREE, Ian, Barry

    Inventor： NILSSON, Michael, Erling ,  APPLEBY, Stephen, Clifford ,  TURNBULL, Rory Stewart ,  CRABTREE, Ian, Barry

    IPC: H04L12/56 ,  H04N7/26 ,  H04L29/06

    CPC classification number: H04L65/60 ,  H04L47/10 ,  H04L47/38 ,  H04L47/801 ,  H04L47/822 ,  H04L65/10 ,  H04L65/4084 ,  H04L65/4092 ,  H04L65/602 ,  H04L65/80 ,  H04N19/115 ,  H04N19/152 ,  H04N19/154 ,  H04N19/177 ,  H04N19/192 ,  H04N19/44 ,  H04N21/23439 ,  H04N21/4621

    Abstract: A client device receives streamed encoded content data, such as encoded video data, which has been encoded at a constant perceptual quality. Several different versions of the content are available to be streamed to the device, at different perceptual quality levels. In order to decide which quality level to request from a content server at intervals the device calculates the delivery rates that would be required for each level of quality. The delivery rates are calculated in dependence on so-called critical points, which are points at which a piecewise constant bit rate delivery schedule is just equal to the decoding schedule. There are two classes of critical points, being a first class of critical points, referred to herein as "additional critical points", which are points on the decoding schedule where, for any particular other point on the decoding schedule before an additional critical point, and assuming that a minimum threshold amount of data is buffered when delivery occurs from the particular point, a constant bit rate delivery schedule that is calculated for the particular point taking into account the buffered minimum amount of data and of such a rate such that buffer underflow does not occur is substantially equal to the decoding schedule. A second class of critical points, referred to herein as "downstairs critical points", is also defined, which are derived from the decoding schedule as a whole, and which are the points at which a piecewise monotonically decreasing constant bit rate delivery schedule (the so-called "downstairs" schedule), which is calculated such that when delivering the encoded content data from the start buffer underflow does not occur, is substantially equal to the decoding schedule of the encoded content data. When the actual delivery rate received is ahead of the so-called "downstairs" schedule, then the delivery rate required for a particular quality level can be calculated from the second class of critical points. However, when the actual delivery rate received is behind the downstairs schedule, then the delivery rate required is calculated from the first class of critical points.

    Abstract translation: 客户端设备接收已经以恒定感知质量编码的流编码内容数据，例如编码视频数据。 在不同的感知质量水平下，可以将多种不同版本的内容流式传输到设备。 为了从内容服务器间隔决定要求哪个质量等级，设备会计算每个质量级别所需的传送速率。 递送率根据所谓的临界点计算，所述临界点是分段恒定比特率传送调度恰好等于解码调度的点。 有两类临界点，作为关键点的第一类，这里称为“附加关键点”，这些是解码调度的要点，对于在额外临界点之前的解码调度上的任何特定的其他点， 并且假设当从特定点发送时缓冲最小阈值量的数据，考虑到所缓冲的最小数据量以及使得缓冲器下溢的特定点计算的恒定比特率传送调度 不发生基本上等于解码时间表。 还定义了第二类关键点，这里称为“楼下关键点”，它们是从整体上的解码进度得出的，它们是分段单调递减的恒定比特率传送时间表（ 被计算为所谓的“楼下”时间表），使得当不发生来自起始缓冲器下溢的编码内容数据时，基本上等于编码内容数据的解码调度。 当收到的实际交货率超过所谓的“楼下”时间表时，可以从第二类关键点计算特定质量水平所需的交货率。 然而，当收到的实际交货率落后于楼下的时间表时，所需的交货率是从第一类关键点计算的。

    A METHOD FOR DELIVERING VIDEO CONTENT ENCODED AT ONE OR MORE QUALITY LEVELS OVER A DATA NETWORK
    2.
    发明申请
    A METHOD FOR DELIVERING VIDEO CONTENT ENCODED AT ONE OR MORE QUALITY LEVELS OVER A DATA NETWORK 审中-公开
    一种在数据网络中传送一个或多个质量级别的视频内容的方法

    公开(公告)号：WO2012085504A1

    公开(公告)日：2012-06-28

    申请号：PCT/GB2011/001742

    申请日：2011-12-20

    Applicant: BRITISH TELECOMMUNICATIONS public limited company ,  NILSSON, Michael, Erling ,  APPLEBY, Stephen, Clifford ,  TURNBULL, Rory, Stewart ,  CRABTREE, Ian, Barry

    Inventor： NILSSON, Michael, Erling ,  APPLEBY, Stephen, Clifford ,  TURNBULL, Rory, Stewart ,  CRABTREE, Ian, Barry

    IPC: H04L12/56 ,  H04N7/26 ,  H04L29/06 ,  H04N21/2343

    CPC classification number: H04N21/26208 ,  H04L47/38 ,  H04L47/801 ,  H04L47/822 ,  H04L65/4084 ,  H04L65/4092 ,  H04L65/602 ,  H04L65/80 ,  H04N19/146 ,  H04N19/154 ,  H04N19/177 ,  H04N19/18 ,  H04N21/23439 ,  H04N21/23805 ,  H04N21/2401 ,  H04N21/25833 ,  H04N21/25858 ,  H04N21/64738 ,  H04N21/64769

    Abstract: A client device receives streamed encoded content data, such as encoded video data, which has been encoded at a constant perceptual quality. Several different versions of the content are available to be streamed to the device, at different perceptual quality levels. In order to decide which quality level to request from a content server at intervals the device calculates the delivery rates that would be required for each level of quality. The calculation of the delivery levels is made in dependence on whether the actual delivery rate that has been received so far is greater than or less than a constant bit rate delivery schedule that decreases monotonically but which guarantees to deliver the encoded data in a timely manner such that no buffer underflow and interruption of reproduction takes place. The monotonically decreasing bit rate schedule is defined by one or more "critical points", which are the points at which the bit rates are decreased, and correspond to the points where the delivery schedule is just equal to the decoding schedule of the encoded data. At such points there would be no encoded data in a buffer at the client. If the delivery rate has been greater than the constant bit rate schedule for a quality then the delivery rate required going forward for a particular quality level can be calculated from the critical point information, and no more complicated calculation is required.

    Abstract translation: 客户端设备接收已经以恒定感知质量编码的流编码内容数据，例如编码视频数据。 在不同的感知质量水平下，可以将多种不同版本的内容流式传输到设备。 为了从内容服务器间隔决定要求哪个质量等级，设备会计算每个质量级别所需的传送速率。 交付水平的计算取决于目前已经收到的实际交货率是否大于或小于单调减少但是保证以及时方式递送编码数据的恒定比特率传送计划 没有发生缓冲区下溢和中断再现。 单调递减的比特率调度由一个或多个“临界点”定义，其是比特率降低的点，并且对应于传送调度恰好等于编码数据的解码调度的点。 在这样的点上，在客户端的缓冲器中将不存在编码数据。 如果传送速率大于质量的恒定比特率调度，则可以从临界点信息计算特定质量水平所需的传送速率，并且不需要更复杂的计算。

    MULTIPLEXED VIDEO STREAMING
    4.
    发明申请
    MULTIPLEXED VIDEO STREAMING 审中-公开
    多媒体视频流

    公开(公告)号：WO2010067050A1

    公开(公告)日：2010-06-17

    申请号：PCT/GB2009/002827

    申请日：2009-12-07

    Applicant: BRITISH TELECOMMUNICATIONS PUBLIC LIMITED COMPANY ,  NILSSON, Michael, Erling ,  CRABTREE, Ian, Barry ,  MULROY, Patrick, Joseph

    Inventor： NILSSON, Michael, Erling ,  CRABTREE, Ian, Barry ,  MULROY, Patrick, Joseph

    IPC: H04N7/26 ,  H04N7/24 ,  H04N7/58

    CPC classification number: H04N21/23655 ,  H04N19/103 ,  H04N19/115 ,  H04N19/127 ,  H04N19/146 ,  H04N19/149 ,  H04N19/152 ,  H04N19/61 ,  H04N19/63 ,  H04N2007/243

    Abstract: A plurality of video streams is transmitted over a transmission link. At intervals, one determines for each video stream at each of a plurality of encoder settings, having regard to the amount of data buffered at a receiver for that stream, a bit rate sufficient to transmit the remainder of that stream at that encoder setting such as to avoid buffer underflow at the receiver. One determines also a critical point equal to the earliest time at which that bit rate can be reduced while still avoiding buffer underflow at the receiver. An encoder setting is chosen for each video stream such that the sum of said bit rates required for transmission of the streams does not exceed the capacity of the transmission link. Any surplus capacity of the transmission link is allocated to the stream that has the earliest critical point.

    Abstract translation: 多个视频流通过传输链路传输。 间隔地，考虑到在该流的接收机处缓冲的数据量，在多个编码器设置中的每一个处确定每个视频流的比特率，足以在该编码器设置处发送该流的剩余部分，例如 以避免接收器的缓冲器下溢。 一个还确定等于可以减小该比特率的最早时间的临界点，同时仍避免接收器处的缓冲器下溢。 为每个视频流选择编码器设置，使得传输流所需的所述比特率的总和不超过传输链路的容量。 将传输链路的任何剩余容量分配给具有最早临界点的流。

    ADAPTIVE STREAMING OF VIDEO AT DIFFERENT QUALITY LEVELS
    6.
    发明申请
    ADAPTIVE STREAMING OF VIDEO AT DIFFERENT QUALITY LEVELS 审中-公开
    在不同质量水平的视频自适应流水线

    公开(公告)号：WO2012028856A1

    公开(公告)日：2012-03-08

    申请号：PCT/GB2011/001296

    申请日：2011-09-02

    Applicant: BRITISH TELECOMMUNICATIONS PUBLIC LIMITED COMPANY ,  NILSSON, Michael, Erling ,  TURNBULL, Rory, Stewart ,  CRABTREE, Ian, Barry ,  APPLEBY, Stephen, Clifford

    Inventor： NILSSON, Michael, Erling ,  TURNBULL, Rory, Stewart ,  CRABTREE, Ian, Barry ,  APPLEBY, Stephen, Clifford

    IPC: H04N7/24 ,  H04N21/2343 ,  H04N21/24 ,  H04N21/845

    CPC classification number: H04N21/23406 ,  H04N19/503 ,  H04N21/23424 ,  H04N21/23439 ,  H04N21/2401 ,  H04N21/2402 ,  H04N21/44004 ,  H04N21/44016 ,  H04N21/6377 ,  H04N21/647 ,  H04N21/845

    Abstract: The network contains one or more network based video servers connected to one or more video receivers over a shared network. Multiple pieces of video content are each encoded at a number of constant quality levels and stored on one or more of the network based servers. In response to requests from a receiver, video content is selected on a server and delivered over the shared network to the receiver. The system selects the quality level of the stream to deliver based on characteristics of the video stream currently being delivered, and the number of bits already buffered at the video receiver and the available network throughput. The aim is to select the video quality being delivered according to the available network throughput so as maximise the quality while ensuring that all video data is delivered over the network in time for it to be decoded and displayed without interruption. The invention proposes a method for making that selection in advance.

    Abstract translation: 该网络包含通过共享网络连接到一个或多个视频接收器的一个或多个基于网络的视频服务器。 多个视频内容分别以多个恒定质量级别编码并存储在一个或多个基于网络的服务器上。 响应于来自接收器的请求，在服务器上选择视频内容并通过共享网络传送到接收器。 该系统基于当前正在传递的视频流的特性，以及已经在视频接收器处缓冲的位数以及可用的网络吞吐量来选择要传送的流的质量级别。 目的是根据可用的网络吞吐量选择要传送的视频质量，以便最大限度地提高质量，同时确保所有视频数据及时传送到网络上，以便不间断地对其进行解码和显示。 本发明提出了一种预先进行选择的方法。

    VIDEO CACHING
    8.
    发明申请
    VIDEO CACHING 审中-公开
    视频缓存

    公开(公告)号：WO2015015140A1

    公开(公告)日：2015-02-05

    申请号：PCT/GB2014/000299

    申请日：2014-07-31

    Applicant: BRITISH TELECOMMUNICATIONS PUBLIC LIMITED COMPANY

    Inventor： CRABTREE, Ian, Barry ,  STEVENS, Timothy, Sean ,  ALLAN, Brahim ,  TURNBULL, Rory, Stewart

    IPC: H04N21/231 ,  H04N21/2343 ,  H04N21/433 ,  H04N21/845

    CPC classification number: H04N21/4331 ,  G11B27/10 ,  H04L65/4084 ,  H04L65/605 ,  H04N21/23106 ,  H04N21/23439 ,  H04N21/2662 ,  H04N21/6379 ,  H04N21/8456

    Abstract: The invention presents a method of providing a modified manifest to a video client for streaming a video sequence associated with the manifest. An original manifest is modified to replace references to locations of lower quality, or bit rate, segments with references to equivalent segments at a higher quality, or bit rate, if the higher quality segment is cached locally. Then, when the video client determines that a given quality of segment should be streamed, it uses the modified manifest to retrieve the appropriate reference for that segment, and if a replacement has taken place, will be provided with the reference to the replacement segment at the higher quality. Thus, the client will always be provided with the highest possible quality segment taking into account local caching.

    Abstract translation: 本发明提供了一种向视频客户端提供修改的清单以便流式传输与清单相关联的视频序列的方法。 如果较高质量的段被本地缓存，修改原始清单以替代对具有较高质量或比特率的等效片段的较低质量或比特率片段的引用。 然后，当视频客户端确定分段的给定质量应该被流传输时，它使用修改的清单来检索该段的适当参考，并且如果发生替换，则将提供对替换段的引用 质量更高。 因此，客户端将始终被提供尽可能高的质量部分，同时考虑到本地缓存。

    COMPACT CUMULATIVE BIT CURVES
    9.
    发明申请
    COMPACT CUMULATIVE BIT CURVES 审中-公开
    紧凑的累积位曲线

    公开(公告)号：WO2012110764A1

    公开(公告)日：2012-08-23

    申请号：PCT/GB2012/000160

    申请日：2012-02-16

    Applicant: BRITISH TELECOMMUNICATIONS PUBLIC LIMITED COMPANY ,  NILSSON, Michael, Erling ,  TURNBULL, Rory, Stewart ,  APPLEBY, Stephen, Clifford ,  CRABTREE, Ian, Barry

    Inventor： NILSSON, Michael, Erling ,  TURNBULL, Rory, Stewart ,  APPLEBY, Stephen, Clifford ,  CRABTREE, Ian, Barry

    IPC: H04N7/24

    CPC classification number: H04N19/00169 ,  H04N7/12 ,  H04N19/146 ,  H04N21/23424 ,  H04N21/234327 ,  H04N21/23439 ,  H04N21/2381 ,  H04N21/44016 ,  H04N21/44209 ,  H04N21/6373 ,  H04N21/8456

    Abstract: Embodiments of the present invention provide a compact representation of a cumulative bit curve formed from piecewise straight line approximations between upper and lower bounds about an actual cumulative bit curve (CBC). In one embodiment the lower bounds are found by applying a constraint such that if a delivery rate was to be calculated using the count at the lower bound it would result in a delivery rate which was greater than the delivery rate that would be calculated using the actual CBC data by a particular amount, for example 10 %. The actual CBC data is then used as an upper bound. As a result, the approximated CBC will lie for each GoP between the actual CBC value and the lower bound, with the result that one can be certain that any data rate that is calculated using the approximation will be at least as high as a data rate that is calculated using the actual CBC data. In terms of line- fitting algorithms that are used, several different algorithms may be used of differing complexities, with the intention of trying to minimise the number of end-points required of within the piecewise approximation.

    Abstract translation: 本发明的实施例提供了一种由关于实际累积位曲线（CBC）的上下界之间的分段直线逼近形成的累积位曲线的紧凑表示。 在一个实施方案中，通过应用约束来发现下限，使得如果使用下限的计数来计算递送率，则将导致递送率大于使用实际值计算的递送率 CBC数据按特定数量，例如10％。 然后将实际的CBC数据用作上限。 因此，近似的CBC将适用于实际CBC值和下限之间的每个GoP，结果可以确定使用近似计算的任何数据速率将至少与数据速率一样高 这是使用实际的CBC数据计算的。 在所使用的线拟合算法方面，可以使用不同复杂度的几种不同的算法，其目的是试图使分段近似中所需的端点的​​数量最小化。

Patent Agency Ranking