Method of video coding using binary tree block partitioning

    公开(公告)号:US10375393B2

    公开(公告)日:2019-08-06

    申请号:US15801457

    申请日:2017-11-02

    Abstract: A method of video coding using block partitioning process including a binary tree partitioning process is disclosed. The block partitioning process is applied to a block of video data to partition the block into final sub-blocks. Coding process comprising prediction process, transform process or both for the block will be applied at the final sub-blocks level. The binary tree partitioning process can be applied to a given block when an associated indicator has a first value. In another embodiment, the quadtree partitioning process is applied to a block first. The quadtree leaf nodes are further partitioned using one or more stages of binary tree partitioning process. The quadtree partitioning process can be applied to a given block recursively to generate quadtree leaf nodes until a termination condition is met.

    Entropy encoding and decoding scheme

    公开(公告)号:US10374627B2

    公开(公告)日:2019-08-06

    申请号:US16109953

    申请日:2018-08-23

    Abstract: Decomposing a value range of the respective syntax elements into a sequence of n partitions with coding the components of z laying within the respective partitions separately with at least one by VLC coding and with at least one by PIPE or entropy coding is used to greatly increase the compression efficiency at a moderate coding overhead since the coding scheme used may be better adapted to the syntax element statistics. Accordingly, syntax elements are decomposed into a respective number n of source symbols si with i=1 . . . n, the respective number n of source symbols depending on as to which of a sequence of n partitions into which a value range of the respective syntax elements is sub-divided, a value z of the respective syntax elements falls into, so that a sum of values of the respective number of source symbols si yields z, and, if n>1, for all i=1 . . . n−1, the value of si corresponds to a range of the ith partition.

    Coding in Galois fields with reduced complexity

    公开(公告)号:US10362151B2

    公开(公告)日:2019-07-23

    申请号:US15319428

    申请日:2015-06-15

    Applicant: Memoscale AS

    Abstract: Disclosed herein is a method of generating a coded data packet in dependence on a plurality of source data packets, the method comprising: determining a plurality of data packets, for generating a coded data packet, from a plurality of source data packets for encoding, wherein each of the plurality of source data packets for encoding comprises the same number of bits; generating a multiplied data packet in dependence on one or more multiplication operations between a multiplication value and bits of one of the determined data packets; and generating a coded data packet in dependence on a combination of the multiplied data packet and one or more of the other of said plurality of determined data packets that have not been multiplied; wherein the one or more multiplication operations are performed as operations in the finite field GF(p); p is greater than 2; the multiplication value is an element of the finite field GF(p); the multiplication value is not 0 or 1; and the combination of data packets is performed by bitwise XOR operations. Advantageously, the coding scheme can be almost as computationally efficient as GF(2) and the likelihood of obtained coded data packets being linearly independent is greatly increased.

    Systems and methods for using a program schedule to facilitate modifying closed-captioning text

    公开(公告)号:US10289677B2

    公开(公告)日:2019-05-14

    申请号:US14626598

    申请日:2015-02-19

    Inventor: Hank J. Hundemer

    Abstract: In one aspect, an example method involves: a computing device selecting a media program; the computing device accessing first data representing closed-captioning text that corresponds to the media program; accessing second data representing a program schedule of the selected media-program, wherein the program schedule comprises first text; the computing device selecting second text from among the first text; the computing device using the selected second-text to (i) identify a candidate misspelled-term within the closed-captioning text, and (ii) identify a candidate replacement-term for the candidate misspelled-term; and the computing device outputting, via a user interface, a prompt requesting a command to modify the closed-captioning text by replacing the identified candidate misspelled-term with the identified candidate replacement-term.

    Techniques for parallel data decompression

    公开(公告)号:US10230392B2

    公开(公告)日:2019-03-12

    申请号:US15393190

    申请日:2016-12-28

    Abstract: Techniques and apparatus for parallel decompression are described. In one embodiment, for example, an apparatus to provide parallel decompression may include at least one memory and logic for a decompression component, at least a portion of the logic comprised in hardware coupled to the at least one memory, the logic to determine decompression information of a compressed data unit, annotate the compressed data unit with at least a portion of the decompression information to generate an annotated data unit, parallel-decode the annotated data unit to generate a plurality of intermediate elements, and decode and merge the plurality of intermediate elements to generate a decompressed data unit. Other embodiments are described and claimed.

    High speed data weighted averaging architecture

    公开(公告)号:US10218380B1

    公开(公告)日:2019-02-26

    申请号:US16036004

    申请日:2018-07-16

    Abstract: Data weighted averaging of a thermometric coded input signal is accomplished by controlling the operation of a crossbar switch matrix to generate a current cycle of a data weighted averaging output signal using a control signal generated in response to feedback of a previous cycle of the data weighted averaging output signal. The control signal specifies a bit location for a beginning logic transition of the data weighted averaging output signal in the current cycle based on detection of an ending logic transition of the data weighted averaging output signal in the previous cycle.

    Method and system for compressing data from smart meter

    公开(公告)号:US10211851B2

    公开(公告)日:2019-02-19

    申请号:US15947857

    申请日:2018-04-08

    Abstract: The present invention relates to a method and a system for compressing data from a smart meter. The method comprises: LZ-encoding electricity load data collected by the smart meter whenever the smart meter collects the electricity load data; storing the LZ-encoded electricity load data in a temporary database through a smart grid communication channel; reading the electricity load data from the temporary database every preset second duration, wherein the read electricity load data is electricity load data stored in the temporary database within the second duration before a corresponding reading time point; and LZ-decoding the read electricity load data, SAX-compressing the LZ-decoded electricity load data, and storing the SAX-compressed electricity load data in a data center. The present invention has high compression rate, reduces the transmission burden for communication lines and storage burden for the data center, and improves the efficiency of smart electricity data analysis and mining.

    Bin string coding based on a most probable symbol

    公开(公告)号:US10194153B1

    公开(公告)日:2019-01-29

    申请号:US15983662

    申请日:2018-05-18

    Applicant: GOOGLE LLC

    Abstract: Bins of a bin string representative of binarized video data are processed to determine whether each bin stores a most probable symbol of a probability model available for coding the binarized video data. If the symbol stored in each bin of the bin string is the most probable symbol, the probability model is updated based on a size of the bin string to determine a first number of bits to use to code the binarized video data. However, if the symbol stored in each bin of the bin string is not the most probable symbol, the probability model is updated based on a number of bins of the bin string storing a symbol that is not the most probable symbol to determine a second number of bits to use to code the binarized video data.

Patent Agency Ranking