Methods and non-transitory computer readable storage medium for spatial resampling towards machine vision
US-2024357118-A1 · Oct 24, 2024 · US
US9516332B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9516332-B2 |
| Application number | US-201314133994-A |
| Country | US |
| Kind code | B2 |
| Filing date | Dec 19, 2013 |
| Priority date | Dec 21, 2012 |
| Publication date | Dec 6, 2016 |
| Grant date | Dec 6, 2016 |
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.
A video coder searches a set of neighbor blocks to generate a plurality of disparity vector candidates. Each of the neighbor blocks is a spatial or temporal neighbor of a current block. The video coder determines, based at least in part on the plurality of disparity vector candidates, a final disparity vector for the current block.
Opening claim text (preview).
What is claimed is: 1. A method of decoding video data, the method comprising: searching a set of neighbor blocks of the video data to generate a plurality of disparity vector candidates, wherein each of the neighbor blocks is a neighbor of a current block of the video data, wherein generating the plurality of disparity vector candidates comprises storing disparity motion vectors or implicit disparity vectors (IDVs) of the neighbor blocks as the plurality of disparity vector candidates; in response to determining that all of the disparity vector candidates have the same reference view index, applying a mathematical function to the plurality of disparity vector candidates to determine a final disparity vector for the current block, wherein the mathematical function is one selected from a group consisting of a median operation, a minimum function, and a maximum function; in response to determining that not all of the disparity vector candidates have the same reference view index, determining that the final disparity vector for the current block is one of the disparity vector candidates; and reconstructing a sample block for the current block in part by performing, based on the final disparity vector for the current block, inter-view motion prediction or inter-view residual prediction for the current block. 2. The method of claim 1 , wherein searching the set of neighbor blocks comprises: concurrently searching spatial and temporal neighbor blocks for disparity motion vectors; and including the disparity motion vectors in the plurality of disparity vector candidates. 3. The method of claim 1 , wherein searching the set of neighbor blocks comprises: searching spatial neighbor blocks for disparity motion vectors; searching temporal neighbor blocks for additional disparity motion vectors; and including the disparity motion vectors and the additional disparity motion vectors in the plurality of disparity vector candidates, wherein the searching of the temporal neighbor blocks is not concurrent with the searching of the spatial neighbor blocks. 4. The method of claim 1 , wherein searching the set of neighbor blocks comprises terminating searching the set of neighbor blocks when the number of generated disparity vector candidates exceeds a threshold greater than 1. 5. The method of claim 1 , wherein applying the mathematical function to the plurality of disparity vector candidates to determine the final disparity vector comprises: determining a particular disparity vector candidate by applying the mathematical function to horizontal components of the plurality of disparity vector candidates; and setting a horizontal component of the final disparity vector to a horizontal component of the particular disparity vector candidate. 6. The method of claim 5 , wherein applying the mathematical function to the plurality of disparity vector candidates to determine the final disparity vector further comprises: determining a view index of the final disparity vector as a view index of the particular disparity vector candidate; determining a reference index of the final disparity vector as a reference index of the particular disparity vector candidate; and setting a vertical component of the final disparity vector to a vertical component of the particular disparity vector candidate. 7. The method of claim 1 , wherein searching the set of neighbor blocks comprises only including non-zero disparity motion vectors in the plurality of disparity vector candidates. 8. A method of encoding video data, the method comprising: searching a set of neighbor blocks of the video data to generate a plurality of disparity vector candidates, wherein each of the neighbor blocks is a neighbor of a current block of the video data, wherein generating the plurality of disparity vector candidates comprises storing disparity motion vectors or implicit disparity vectors (IDVs) of the neighbor blocks as the plurality of disparity vector candidates; in response to determining that all of the disparity vector candidates have the same reference view index, applying a mathematical function to the plurality of disparity vector candidates to determine a final disparity vector for the current block, wherein the mathematical function is one selected from a group consisting of a median operation, a minimum function, and a maximum function; in response to determining that not all of the disparity vector candidates have the same reference view index, determining that the final disparity vector for the current block is one of the disparity vector candidates; and generating a bitstream that includes a coded representation of the video data in part by performing, based on the final disparity vector for the current block, inter-view motion prediction or inter-view residual prediction for the current block. 9. The method of claim 8 , wherein searching the set of neighbor blocks comprises: concurrently searching spatial and temporal neighbor blocks for disparity motion vectors; and including the disparity motion vectors in the plurality of disparity vector candidates. 10. The method of claim 8 , wherein searching the set of neighbor blocks comprises: searching spatial neighbor blocks for disparity motion vectors; searching temporal neighbor blocks for additional disparity motion vectors; and including the disparity motion vectors and the additional disparity motion vectors in the plurality of disparity vector candidates, wherein the searching of the temporal neighbor blocks is not concurrent with the searching of the spatial neighbor blocks. 11. The method of claim 8 , wherein searching the set of neighbor blocks comprises terminating searching the set of neighbor blocks when the number of generated disparity vector candidates exceeds a threshold greater than 1. 12. The method of claim 8 , wherein applying the mathematical function to the plurality of disparity vector candidates to determine the final disparity vector comprises: determining a particular disparity vector candidate by applying the mathematical function to horizontal components of the plurality of disparity vector candidates; and setting a horizontal component of the final disparity vector to a horizontal component of the particular disparity vector candidate. 13. The method of claim 12 , wherein applying the mathematical function to the plurality of disparity vector candidates to determine the final disparity vector further comprises: determining a view index of the final disparity vector as a view index of the particular disparity vector candidate; determining a reference index of the final disparity vector as a reference index of the particular disparity vector candidate; and setting a vertical component of the final disparity vector to a vertical component of the particular disparity vector candidate. 14. The method of claim 8 , wherein searching the set of neighbor blocks comprises only including non-zero disparity motion vectors in the plurality of disparity vector candidates. 15. A video coding device that comprises: a data storage medium configured to store video data, and one or more processors configured to: search a set of neighbor blocks of the video data to generate a plurality of disparity vector candidates, wherein each of the neighbor blocks is a neighbor of a current block of the video data, wherein generating the plurality of disparity vector candidates comprises storing disparity motion vectors or implicit disparity vectors (IDVs) of the neighbor blocks as the plurality of disparity vector candidates; apply, in response to determining that all of the dispar
specially adapted for multi-view video sequence encoding · CPC title
by predictive encoding · CPC title
using parallelised computational arrangements · CPC title
Processing of motion vectors · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.