PATENT CLAIM ANALYSIS

Application Number: 16268136
Application Type: Utility
Filing Date: 2019-02
Publication Date: 2019-06
Patent Classification: ["375", "240080"]

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 1):
A decoder for decoding arrays of information samples encoded in a data stream each array representing a picture, the decoder comprising:\n an extractor configured for 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 coding parameter determined based on one or more coding parameters associated with a selected candidate region, wherein the at least one coding parameter and the one or more coding parameters include motion vectors, identifying a set of candidate regions with respect to the region currently being decoded, extracting a candidate identifier from the data stream, and selecting the selected candidate region from the set of candidate regions in accordance with the candidate identifier; and a reconstructor configured for copying, if an indication is to copy, a motion vector of the one or more coding parameters as a motion vector of the at least coding parameter, computing, if the indication is to compute, the at least one coding parameter based on the one or more coding parameters, the computing including:\n determining a prediction of a motion vector of the at least coding parameter based on a motion vector of the one or more coding parameters, \n extracting, from the data stream, a prediction residual of the motion vector of the at least one coding parameter, and \n combining the prediction and the prediction residual of the motion vector of the at least one coding parameter to obtain the motion vector of the at least one coding parameter, and \n reconstructing the region currently being decoded based on the motion vector of the at least one coding parameter.

Metadata:
- Claim Count in Document: 80.0
- Percentile: 99.0
- Lexical Diversity: 1.94444
- Patent Class: 375.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: True
- Related Applications: ['16197210', '15940839', '13650635', '16261823', '13649251']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.5394227526754768
- 35 USC 102 Novelty (BERT): 0.624771100807378
- Combined Prediction Score: 0.5479575874886669
- Mean Citation Score: 497.204868
- Max Citation Score: 528.7504
- Similarity Product: 516.4258239843368

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