| Sonstiges: |
- Nachgewiesen in: USPTO Patent Grants
- Sprachen: English
- Patent Number: 11889,101
- Publication Date: January 30, 2024
- Appl. No: 16/814656
- Application Filed: March 10, 2020
- Assignees: Texas Instruments Incorporated (Dallas, TX, US)
- Claim: 1. A method for encoding a picture, the method comprising: dividing a coding unit (CU) of the picture into a first motion estimation region (MER) and a second MER, the CU larger in size than the first MER and the second MER; performing a first motion search for the first MER and the second MER to determine a first motion vector (MV) for the first MER and a second MV for the second MER, wherein: the first motion search is based on a first cost to predict the first MV and a second cost to predict the second MV; the first motion search for the first MER includes a first predictor search, a first integer-pel search, and a first fractional-pel search based on a first set of search points of the first MV; the first fractional-pel search includes an area bounded by eight neighbor integer-pel positions around a best integer-pel position determined from the first integer-pel search; and the first cost and the second cost are determined based on a penalty component and a distortion component; performing a second motion search for the CU to determine a selected MV from one of the first MV and the second MV based on which one of the first cost and the second cost is lower; performing a sub-pel refinement using the selected MV to determine a refined MV; and encoding the CU in the picture using the refined MV.
- Claim: 2. The method of claim 1 , wherein performing the first motion search includes: determining a first search set including the first MV, a third MV, and a fourth MV associated with the first MER; and selecting the first MV from among the first MV, the third MV, and the fourth MV based on the first cost, a third cost to predict the third MV, and a fourth cost to predict the fourth MV.
- Claim: 3. The method of claim 2 , further including: generating a first candidate list including the first search set and inter-cost information of the first search set; and updating the first candidate list in response to the first motion search.
- Claim: 4. The method of claim 1 , wherein performing the second motion search includes: determining a second search set including the first MV and the second MV; and selecting the selected MV from among the first MV and the second MV.
- Claim: 5. The method of claim 4 , further including: generating a second candidate list including the second search set and inter-cost information of the second search set; and updating the second candidate list in response to the second motion search.
- Claim: 6. A system comprising: a processor configured to: divide a coding unit (CU) of a picture into a first motion estimation region (MER) and a second MER, the CU larger in size than the first MER and the second MER; perform one or more first motion searches for the first MER and the second MER to determine a first motion vector (MV) for the first MER and a second MV for the second MER, wherein: the one or more first motion searches are based on a first cost to predict the first MV and a second cost to predict the second MV; the one or more first motion searches includes a first predictor search, a first integer-pel search, and a first fractional-pel search based on a first set of search points of the first MV; the first fractional-pel search includes an area bounded by eight neighbor integer-pel positions around a best integer-pel position determined from the first integer-pel search; and the first cost and the second cost are determined based on a penalty component and a distortion component; perform one or more second motion searches for the CU to determine a selected MV from one of the first MV and the second MV based on which one of the first cost and the second cost is lower; perform a sub-pel refinement using the selected MV to determine a refined MV; and encode the CU in the picture using the refined MV; and memory communicatively associated with the processor and configured to store a first candidate list generated based on a first number of the one or more first motion searches and a second candidate list generated based on a second number of the one or more second motion searches.
- Claim: 7. The system of claim 6 , wherein the processor is configured to: determine a first search set including the first MV, a third MV, and a fourth MV associated with the first MER; and select the first MV from among the first MV, the third MV, and the fourth MV based on the first cost, a third cost to predict the third MV, and a fourth cost to predict the fourth MV.
- Claim: 8. The system of claim 7 , wherein the processor is configured: generate the first candidate list including the first search set and inter-cost information of the first search set; and update the first candidate list in response to the one or more first motion searches.
- Claim: 9. The system of claim 6 , wherein the processor is configured to: determine a second search set including the first MV and the second MV; and select the selected MV from among the first MV and the second MV.
- Claim: 10. The system of claim 9 , wherein the processor is further configured to: generate the second candidate list including the second search set and inter-cost information of the second search set; and update the second candidate list in response to the one or more second motion searches.
- Claim: 11. A non-transitory computer readable medium storing a set of instructions that when executed cause a computer to at least: divide coding unit (CU) of a picture into a first motion estimation region (MER) and a second MER, the CU larger in size than the first MER and the second MER; perform a first motion search for the first MER and the second MER to determine a first motion vector (MV) for the first MER and a second MV for the second MER, wherein: the first motion search is based on a first cost to predict the first MV and a second cost to predict the second MV; the first motion search for the first MER includes a first predictor search, a first integer-pel search, and a first fractional-pel search based on a first set of search points of the first MV; the first fractional-pel search includes an area bounded by eight neighbor integer-pel positions around a best integer-pel position determined from the first integer-pel search; and the first cost and the second cost are determined based on a penalty component and a distortion component; and perform a second motion search for the CU to determine a selected MV from one of the first MV and the second MV based on which one of the first cost and the second cost is lower; perform a sub-pel refinement using the selected MV to determine a refined MV; and encode the CU in the picture using the refined MV.
- Claim: 12. The non-transitory computer readable medium of claim 11 , wherein the instructions cause the computer to: determine a first search set including the first MV, a third MV, and a fourth MV associated with the first MER; and select the first MV from among the first MV, the third MV, and the fourth MV based on the first cost, a third cost to predict the third MV, and a fourth cost to predict the fourth MV.
- Claim: 13. The non-transitory computer readable medium of claim 12 , wherein the instructions cause the computer to: generate a first candidate list including the first search set and inter-cost information of the first search set; and update the first candidate list in response to the first motion search.
- Claim: 14. The non-transitory computer readable medium of claim 11 , wherein the instructions cause the computer to: determine a second search set including the first MV and the second MV; and select the selected MV from among the first MV and the second MV.
- Claim: 15. The non-transitory computer readable medium of claim 14 , wherein the instructions cause the computer to: generate a second candidate list including the second search set and inter-cost information of the second search set; and update the second candidate list in response to the second motion search.
- Claim: 16. The method of claim 1 , wherein: the first cost is determined based on a first motion vector penalty component and a first distortion component; and the second cost is determined based on a second motion vector penalty component and a second distortion component.
- Claim: 17. The system of claim 6 , wherein: the first cost is determined based on a first motion vector penalty component and a first distortion component; and the second cost is determined based on a second motion vector penalty component and a second distortion component.
- Claim: 18. The non-transitory computer readable medium of claim 11 , wherein: the first cost is determined based on a first motion vector penalty component and a first distortion component; and the second cost is determined based on a second motion vector penalty component and a second distortion component.
- Claim: 19. The method of claim 1 , wherein the first fractional-pel search includes a block matching search using half-pels and quarter-pels interpolated midway between integer-pels and half-pels, respectively.
- Claim: 20. The method of claim 1 , wherein performing the sub-pel refinement is based on a third set of search points around the selected MV to determine the refined MV.
- Patent References Cited: 9008450 April 2015 Choudhary ; 20110075736 March 2011 Endo ; 20110286523 November 2011 Dencher ; 20130114727 May 2013 Sato ; 20140105295 April 2014 Shiodera et al. ; 20140301461 October 2014 Jeon et al.
- Other References: Zhibo Chen et al. (Fast integer-pel and fractional-pel motion estimation for H.264/AVC;—vol. 17, Issue 2, Apr. 2006, pp. 264-290) (Year: 2006). cited by examiner
- Assistant Examiner: Joisil, Berteau
- Primary Examiner: Czekaj, Dave
- Attorney, Agent or Firm: Peterson, Carl G. ; Cimino, Frank D.
|
