Collusion attack prevention
US-2024362739-A1 · Oct 31, 2024 · US
US10602175B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10602175-B2 |
| Application number | US-201213725613-A |
| Country | US |
| Kind code | B2 |
| Filing date | Dec 21, 2012 |
| Priority date | Dec 21, 2012 |
| Publication date | Mar 24, 2020 |
| Grant date | Mar 24, 2020 |
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 method for using an average motion vector in a motion vector search process. The method includes accessing an input frame for processing and reading average motion vector information from memory. The method further includes performing a motion vector search by using the average motion vector and a plurality of hints, calculating a winner motion vector based on the average motion vector and the plurality of hints, and storing the winner motion vector back into memory to create a new updated average motion vector. The method further includes finishing processing the input frame using the winning motion vector.
Opening claim text (preview).
What is claimed is: 1. A method for using an average motion vector in a motion vector search process, comprising: accessing an input frame for processing; reading average motion vector information from memory, wherein the average motion vector comprises an average of a plurality of prior winning motion vectors computed when encoding a plurality of previous frames; performing a motion vector search by using the average motion vector and a plurality of hints; responsive to said motion vector search, calculating a winner motion vector based on the average motion vector and the plurality of hints; storing the winner motion vector back into the memory to create a new updated average motion vector; and finishing processing the input frame using the winner motion vector. 2. The method of claim 1 , wherein the motion vector search implements a video compression process. 3. The method of claim 1 , wherein the motion vector search is performed on a macro block. 4. The method of claim 1 , wherein a plurality of winner motion vector values are calculated and an average motion vector hint is calculated before encoding a current frame. 5. The method of claim 1 , wherein the motion vector search is implemented in a graphics processing unit. 6. The method of claim 1 , wherein the average motion vector is scaled based on a distance between a current frame and a reference frame. 7. A non-transitory computer readable media having computer readable code which when executed by a computer system causes said computer system to implement a method for using an average motion vector in a motion vector search process, the method comprising: accessing an input frame for processing; reading average motion vector information from memory, wherein the average motion vector comprises an average of a plurality of prior winning motion vectors computed when encoding a plurality of previous frames; performing the motion vector search process by using the average motion vector and a plurality of hints; responsive to the motion vector search process, calculating a winner motion vector based on the average motion vector and the plurality of hints; storing the winner motion vector back into the memory to create a new updated average motion vector; and finishing processing the input frame using the winner motion vector. 8. The non-transitory computer readable media of claim 7 , wherein the motion vector search process implements a video compression process. 9. The non-transitory computer readable media of claim 7 , wherein the motion vector search process is performed on a macro block. 10. The non-transitory computer readable media of claim 7 , wherein a plurality of winner motion vector values are calculated and an average motion vector hint is calculated before encoding a current frame. 11. The non-transitory computer readable media of claim 7 , wherein the motion vector search process is implemented in a graphics processing unit. 12. The non-transitory computer readable media of claim 7 , wherein the average motion vector is scaled based on a distance between a current frame and a reference frame. 13. A computer system, comprising: a computer system having a processor coupled to a computer readable storage media and executing computer readable code which causes the computer system to: access an input frame for processing; read average motion vector information from memory, wherein the average motion vector comprises an average of a plurality of prior winning motion vectors computed when encoding a plurality of previous frames; perform a motion vector search process by using the average motion vector information and a plurality of hints; responsive to said motion vector search process, calculate a winner motion vector based on the average motion vector and the plurality of hints; store the winner motion vector back into the memory to create a new updated average motion vector; and finish processing the input frame using the winner motion vector. 14. The computer system of claim 13 , wherein the motion vector search process implements a video compression process. 15. The computer system of claim 13 , wherein the motion vector search process is performed on a macro block. 16. The computer system of claim 13 , wherein a plurality of winner motion vector values are calculated and an average motion vector hint is calculated before encoding a current frame. 17. The computer system of claim 13 , wherein the average motion vector is scaled based on a distance between a current frame and a reference frame. 18. The method of claim 1 , wherein the plurality of hints comprises: a top neighbor motion vector, a left neighbor motion vector, and a collocated motion vector. 19. The non-transitory computer readable media of claim 7 , wherein the plurality of hints comprises: a top neighbor motion vector, a left neighbor motion vector, and a collocated motion vector. 20. The computer system of claim 13 , wherein the plurality of hints comprises: a top neighbor motion vector, a left neighbor motion vector, and a collocated motion vector.
Motion estimation with initialisation of the vector search, e.g. estimating a good candidate to initiate a search · CPC title
Processing of motion vectors · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.