Methods and non-transitory computer readable storage medium for spatial resampling towards machine vision
US-2024357118-A1 · Oct 24, 2024 · US
US9621888B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9621888-B2 |
| Application number | US-201214343882-A |
| Country | US |
| Kind code | B2 |
| Filing date | Sep 7, 2012 |
| Priority date | Sep 9, 2011 |
| Publication date | Apr 11, 2017 |
| Grant date | Apr 11, 2017 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
According to the present invention, an inter prediction method comprises the steps of: generating a merge candidate list for a block to be predicted, wherein the block is to correspond to a current prediction unit; deriving, on the basis of one of a plurality of merge candidates constituting the merge candidate list, motion information on the block to be predicted; and performing, on the basis of the derived motion information, a prediction on the block to be predicted so as to generate a prediction block corresponding to the current prediction unit.
Opening claim text (preview).
The invention claimed is: 1. An inter prediction method comprising: generating a merging candidate list for a current block when a merge mode is applied to the current block; deriving motion information of the current block based on one of a plurality of merging candidates constituting the merging candidate list; and generating a prediction sample of the current block based on the derived motion information, wherein the current block is a prediction unit (PU) belonging to a parallel merging unit, wherein the PU is partitioned from a coding unit (CU), wherein PUs, in the CU and the parallel merging unit, share the same merge candidate list, and wherein the parallel merging unit is determined based on a parallel merge level which indicates a size of the parallel merging unit, and information on the parallel merge level is received through a picture parameter set. 2. The inter prediction method of claim 1 , wherein in the generating of the merging candidate list, one of a first merging candidate list consisting of a plurality of first merging candidates and a second merging candidate list consisting of a plurality of second merging candidates is selectively generated, wherein in the generating of the merging candidate list, whether the first merging candidate list is generated or whether the second merging candidate list is generated is determined by the parallel merging unit, and when it is determined that the second merging candidate list is generated, the PUs in the CU and the parallel merging unit share the second merging candidate list. 3. The inter prediction method of claim 2 , wherein the parallel merging unit has a same size as the CU to which the PU belongs, and wherein the plurality of second merging candidates are determined based on a location and size of the CU. 4. The inter prediction method of claim 3 , wherein the plurality of first blocks include a block closest in location to a left lower corner outside the block to be predicted, a block located in a lowermost portion among blocks adjacent to a left side of the block to be predicted, a block closest in location to a left upper corner outside the block to be predicted, a block located in a rightmost side among blocks adjacent to an upper portion of the block to be predicted, and a block closest in location to a right upper corner of the block to be predicted, and wherein the plurality of second blocks include a block closest in location to a left lower corner outside the block to be decoded, a block located in a lowermost portion among blocks adjacent to a left side of the block to be decoded, a block closest in location to a left upper corner outside the block to be decoded, a block located in a rightmost side among blocks adjacent to an upper portion of the block to be decoded, and a block closest in location to a right upper corner of the block to be decoded. 5. The inter prediction method of claim 4 , wherein in the generating of the merging candidate list, if it is determined that the first merging candidate list is generated, motion information of a block located in the CU among the plurality of first blocks is not used as the first merging candidate. 6. The inter prediction method of claim 5 , wherein in the generating of the merging candidate list, if it is determined that the first merging candidate list is generated, a partitioning mode of the PU is 2N×N, 2N×nU, or 2N×nD, and the PU is located in a lower portion in the CU, motion information of a block located in a rightmost side among blocks adjacent to an upper portion of the current block is not used as the first merging candidate. 7. The inter prediction method of claim 5 , wherein in the generating of the merging candidate list, if it is determined that the first merging candidate list is generated, a partitioning mode of the current PU is N×2N, nL×2N, or nR×2N, and the PU is located in a right side in the CU, motion information of a block located in a lowermost portion among blocks adjacent to a left side of the current block is not used as the first merging candidate. 8. The inter prediction method of claim 3 , wherein the generating of the merging candidate list and the driving of the motion information are performed in parallel for all PUs in the parallel merging unit. 9. The inter prediction method of claim 2 , wherein in the generating of the merging candidate list, whether the first merging candidate list is generated or the second merging candidate list is generated is determined on the basis of a size of the CU and the parallel merge level. 10. The inter prediction method of claim 9 , wherein in the generating of the merging candidate list, if the size of the CU is 8×8 and the size of the parallel merging unit is 4×4, the second merging candidate list is generated.
using parallelised computational arrangements · CPC title
Hardware specially adapted for motion estimation or compensation · CPC title
Selection of the reference unit for prediction within a chosen coding or prediction mode, e.g. adaptive choice of position and number of pixels used for prediction · CPC title
Motion estimation characterised by a search window with variable size or shape · CPC title
by predictive encoding · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.