Quality Metric for Compressed Video
    2.
    发明申请
    Quality Metric for Compressed Video 有权
    压缩视频质量指标

    公开(公告)号:US20170048522A1

    公开(公告)日:2017-02-16

    申请号:US14824420

    申请日:2015-08-12

    CPC classification number: H04N19/124 H04N19/14 H04N19/154 H04N19/176 H04N19/48

    Abstract: Methods and systems are disclosed for calculating and applying a VQ metric which operates during the decoding of compressed video. As such, this metric is appropriate for all formats of compressed video codecs (e.g. MPEG-2, AVC and HEVC.) The VQ metric relies on the decoded quantization parameter (Qp) together with analysis of both the compressed and decoded video. As such, the VQ metric does not require a reference video, and is less cumbersome to use for multiple channels, e.g. statistically multiplexed channels.

    Abstract translation: 公开了用于计算和应用在压缩视频解码期间操作的VQ度量的方法和系统。 因此,该度量适用于所有格式的压缩视频编解码器(例如,MPEG-2,AVC和HEVC).VQ度量依赖于解码的量化参数(Qp)以及压缩和解码的视频的分析。 因此,VQ度量不需要参考视频,并且对于多个频道使用不太麻烦,例如, 统计复用通道。

    Network-aware storage repairs
    4.
    发明授权

    公开(公告)号:US10140172B2

    公开(公告)日:2018-11-27

    申请号:US15253346

    申请日:2016-08-31

    Abstract: In an example, there is disclosed a computing apparatus, having one or more logic elements, including at least one hardware logic element, comprising a network-aware data repair engine to compute a feasible repair log for n fragments of an original data structure, comprising: receiving a predictive failure scenario; identifying at least one repair ξi for the failure scenario; determining that ξi is feasible; and logging ξi to a feasible repair log. When a node failure occurs, a network cost may be computed for each repair in the feasible repair log, and an optimal repair may be selected.

    Congestion Aware Load Balancing for Distributed Storage

    公开(公告)号:US20170346897A1

    公开(公告)日:2017-11-30

    申请号:US15163814

    申请日:2016-05-25

    CPC classification number: H04L67/1097 H04L47/125 H04L67/1002 H04L67/32

    Abstract: Congestion aware load balancing for distributed storage may be provided. First, a read request for data may be received. The data may have redundancy through coding or through copying. Then it may be determined which K of M possible storage nodes to direct the received read request. K and M may be integers and M may be greater than K. In response to determining which K of M possible storage nodes to direct the received read request, the received read request may be copied into K read requests respectively corresponding to the determined K of M possible storage nodes. The copied K read requests may then be transmitted to the determined respective K storage nodes. And, in response to transmitting the copied K read requests, a client may receive data replies from each of the determined respective K storage nodes.

Patent Agency Ranking