PATENT CLAIM ANALYSIS

Application Number: 16197210
Application Type: Utility
Filing Date: 2018-11
Publication Date: 2019-03
Patent Classification: ["705", "014250"]

Abstract:
A favorable merging or grouping of simply connected regions into which the array of information samples is sub-divided, is coded with a reduced amount of data. To this end, a predetermined relative locational relationship is defined enabling an identifying, for a predetermined simply connected region, of simply connected regions within the plurality of simply connected regions which have the predetermined relative locational relationship to the predetermined simply connected region. Namely, if the number is zero, a merge indicator for the predetermined simply connected region may be absent within the data stream. In other embodiments, spatial sub-division is performed depending on a first subset of syntax elements, followed by combining spatially neighboring simply connected regions depending on a second subset of syntax elements, to obtain an intermediate sub-division.

Claim (Index 9):
A method of decoding arrays of information samples encoded in a data stream each representing a picture, the method comprising:\n extracting, from the data stream, a merge indicator with respect to a region currently being decoded within an array of information samples, wherein the region currently being decoded is one of a plurality of regions obtained by dividing the array of information samples and the merge indicator is indicative of whether the region currently being decoded is to be reconstructed based on at least one motion coding parameter determined based on a candidate motion coding parameter; identifying a set of candidate motion coding parameters; extracting information related to a candidate identifier from the data stream; selecting the candidate motion coding parameter from the set of candidate motion coding parameters in accordance with the candidate identifier; copying, if an indication is to copy, a motion vector of the candidate motion coding parameter as a motion vector of the at least one motion coding parameter; computing, if the indication is to compute, the at least one motion coding parameter based on the candidate motion coding parameter, the computing including:\n determining a prediction of a motion vector of the at least one motion coding parameter based on a motion vector of the candidate motion coding parameter, \n extracting, from the data stream, a prediction residual of the motion vector of the at least one motion coding parameter, and \n combining the prediction and the prediction residual of the motion vector of the at least one motion coding parameter to obtain the motion vector of the at least one motion coding parameter; and \n reconstructing the region currently being decoded based on the motion vector of the at least one motion coding parameter.

Metadata:
- Claim Count in Document: 30.0
- Percentile: 98.0
- Lexical Diversity: 1.94444
- Patent Class: 705.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: True
- Related Applications: ['15940839', '13650635', '13649251', '16197154', '16017453']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.1131309555807271
- 35 USC 102 Novelty (BERT): 0.6097535790399704
- Combined Prediction Score: 0.1627932179266515
- Mean Citation Score: 469.326342
- Max Citation Score: 553.5531599999998
- Similarity Product: 492.740995980985

Labels:
- Claim Label 101: 1
- Claim Label 102: 1
- Claim Label 103: 1
- Claim Label 112: 1
- Combined Label: 1
- Label 101 Adjusted: 1

Dataset: test