US 12,170,765 B2
Hierarchical packing of syntax elements
Ujval J. Kapasi, Westford, MA (US); Amit Gulati, San Mateo, CA (US); John Sievers, North Reading, MA (US); Yipeng Liu, Sunnyvale, CA (US); and Dan Miller, Campbell, CA (US)
Assigned to OL Security Limited Liability Company, Wilmington, DE (US)
Filed by OL Security Limited Liability Company, Dover, DE (US)
Filed on Apr. 6, 2023, as Appl. No. 18/131,470.
Application 12/192,841 is a division of application No. 11/973,889, filed on Oct. 9, 2007, granted, now 8,213,509, issued on Jul. 3, 2012.
Application 18/131,470 is a continuation of application No. 17/098,699, filed on Nov. 16, 2020, granted, now 11,665,342.
Application 17/098,699 is a continuation of application No. 15/607,474, filed on May 27, 2017, granted, now 10,841,579, issued on Nov. 17, 2020.
Application 15/607,474 is a continuation of application No. 14/513,191, filed on Oct. 13, 2014, granted, now 9,667,962, issued on May 30, 2017.
Application 14/513,191 is a continuation of application No. 12/192,841, filed on Aug. 15, 2008, granted, now 8,861,611, issued on Oct. 14, 2014.
Claims priority of provisional application 60/849,857, filed on Oct. 6, 2006.
Prior Publication US 2023/0247197 A1, Aug. 3, 2023
This patent is subject to a terminal disclaimer.
Int. Cl. H04N 19/115 (2014.01); H04N 19/176 (2014.01); H04N 19/43 (2014.01); H04N 19/433 (2014.01); H04N 19/436 (2014.01); H04N 19/46 (2014.01); H04N 19/51 (2014.01); H04N 19/53 (2014.01); H04N 19/533 (2014.01); H04N 19/56 (2014.01); H04N 19/61 (2014.01)
CPC H04N 19/115 (2014.11) [H04N 19/176 (2014.11); H04N 19/43 (2014.11); H04N 19/433 (2014.11); H04N 19/436 (2014.11); H04N 19/46 (2014.11); H04N 19/51 (2014.11); H04N 19/53 (2014.11); H04N 19/533 (2014.11); H04N 19/56 (2014.11); H04N 19/61 (2014.11)] 27 Claims
OG exemplary drawing
 
1. A non-transitory computer-readable medium on which are embedded instructions that, when executed on one or more computer devices, improve video coding performance while using a merge mode in motion estimation, the instructions comprising:
instructions to perform one or more refinement searches on a plurality of candidate regions of a current frame, wherein the plurality of candidate regions comprises a candidate region identified in a reference frame and a plurality of candidate search regions, and wherein the one or more refinement searches reduce the plurality of candidate regions to obtain reduced candidates, by:
reducing the plurality of candidate regions based, at least in part, on a relative proximity of the plurality of candidate regions; and
merging two or more redundant candidate regions from the plurality of candidate regions into a single candidate; and
instructions to code motion data based, at least in part, on the one or more refinement searches.