Patent No. US9571833 (titled "Method for coding and an apparatus") on Nov 1, 2012. The application was issued on Feb 14, 2017.
’833 is related to the field of video compression, specifically the efficient encoding and decoding of motion information. In modern video codecs, motion vectors are often predicted from neighboring blocks to reduce the amount of data that needs to be transmitted. A common technique is the use of a merge list, which contains a set of motion vector candidates from which the encoder selects the best match, signaling only the index of that candidate to the decoder.
The underlying idea behind ’833 is to optimize the construction of the merge list by performing a limited redundancy check that is spatially aware. Instead of comparing every new candidate against every existing candidate in the list—which is computationally expensive—the system uses the geometric location of the neighboring blocks to determine a specific subset of prior candidates for comparison. This targeted approach identifies and removes redundant motion information without the overhead of exhaustive pair-wise matching.
The claims of ’833 focus on a method for generating a merge list by selecting a potential spatial motion vector candidate and determining a location-based subset of existing candidates for comparison. The process involves performing an equivalence check or similarity metric between the potential candidate and only those in the determined subset. If a match is found, the candidate is excluded from the list, ensuring that the final signaled index refers to a unique set of motion parameters.
In practice, the invention works by evaluating neighbors in a specific order, such as left, top, and corner blocks. For example, a candidate from a block on the left might only be compared to the block above it if certain splitting conditions are met. By using the spatial relationship between blocks to prune the candidate list, the encoder and decoder can maintain identical lists with fewer operations, which is critical for real-time hardware implementations where memory bandwidth and logic gates are limited.
This approach differs from prior solutions that either performed full redundancy checks or used fixed, non-adaptive candidate sets. By integrating the block partitioning mode (such as vertical or horizontal splits) into the pruning logic, the invention prevents the inclusion of redundant motion vectors that are mathematically likely to be identical due to the way images are subdivided. This results in a more compact merge list that improves compression efficiency while reducing the computational burden on the decoder.
In the early 2010s when ’833 was filed, video compression systems were transitioning toward high-efficiency coding structures that utilized recursive partitioning of images into variable-sized blocks. At a time when motion information was typically implemented using differential coding against a single predicted vector, systems commonly relied on exhaustive candidate lists for motion vector prediction to improve compression ratios. However, when hardware or software constraints made the computational overhead of pruning these lists non-trivial, the process of removing redundant candidates through full pairwise comparisons created significant processing bottlenecks in both encoders and decoders.
The disclosed invention represents a technical advancement by introducing a restricted pruning architecture for motion vector candidate lists. Instead of performing an exhaustive comparison of all available motion information, the system determines a specific subset of candidates for comparison based on the spatial location of the block associated with a potential candidate. This architectural shift enables the exclusion of redundant motion information from a merge list while significantly reducing the number of required comparison operations. The resulting technical effect is a reduction in computational complexity and memory access requirements during the construction of the motion prediction list, overcoming the constraint of high processing latency in high-efficiency video codecs without compromising the integrity of the motion compensation process.
This patent contains 30 claims, with claims 1, 9, 15, 16, 17, and 18 serving as the independent claims. The independent claims focus on methods, apparatuses, and computer-readable media for video coding that optimize the construction of a motion vector merge list by selectively comparing and excluding redundant spatial motion vector prediction candidates based on block locations and similarity metrics without exhaustive pair-wise comparisons. The dependent claims further refine this process by specifying candidate selection orders, limiting the total number of candidates, defining specific exclusion conditions based on prediction unit partitions, and incorporating temporal motion prediction candidates.
Definitions of key terms used in the patent claims.
US Latest litigation cases involving this patent.

The dossier documents provide a comprehensive record of the patent's prosecution history - including filings, correspondence, and decisions made by patent offices - and are crucial for understanding the patent's legal journey and any challenges it may have faced during examination.
Get instant alerts for new documents