Method for sub-pixel value interpolation

Patent No. US8036273 (titled "Method for sub-pixel value interpolation") on Aug 15, 2007. The application was issued on Oct 11, 2011.

What is this patent about?

’273 is related to the field of digital video coding and decoding, specifically focusing on motion-compensated temporal prediction. In modern video compression, the accuracy of motion vectors is critical for reducing prediction error; however, real-world motion often occurs at a finer resolution than the original pixel grid. The patent addresses the computational and memory challenges associated with interpolating sub-pixel values at fractional locations, such as half, quarter, or eighth-pixel resolutions, to improve the efficiency of video codecs.

The underlying idea behind ’273 is a multi-stage interpolation strategy that balances computational precision with hardware efficiency by utilizing a specific sequence of filtering and averaging. The core insight is to derive primary sub-pixel values using high-order filters (such as 6-tap or 8-tap filters) to maintain accuracy, and then generate finer fractional values through simpler linear or diagonal averages. By calculating certain sub-pixels diagonally from previously interpolated values, the invention avoids the cumulative rounding errors and high memory overhead found in prior methods that rely on exhaustive multi-step horizontal and vertical filtering.

The claims of ’273 focus on a method for determining sub-pixel values within a rectangular region defined by four corner pixels using a specific coordinate-based logic. The independent claims cover a process where sub-pixels at odd-numbered fractional coordinates (the most granular level) are interpolated using a weighted average of either a nearest-neighbor pixel and a central half-pixel, or a pair of diagonally-opposed sub-pixels. This diagonal approach is supported by first calculating intermediate sub-pixels at even fractional coordinates using weighted sums of pixels in the primary rows and columns.

In practice, the invention operates by first applying a Kth-order filter to original pixels to generate half-resolution values, which are stored as intermediate results. When a motion vector points to a quarter-pixel or eighth-pixel location, the system performs diagonal interpolation to reach the final value. This differs from prior approaches like TML5, which suffered from precision loss due to multiple stages of truncation, and TML6, which required high-precision 32-bit arithmetic for all calculations. The '273 method allows for high-quality prediction while keeping the arithmetic requirements low enough for standard CPUs and low-cost ASICs.

The differentiation of this invention lies in its flexibility and reduced computational burden during the decoding process. By allowing a choice between horizontal and vertical filtering to reach the same intermediate sub-pixel, the decoder can select the path that requires the fewest operations for a specific motion vector. This on-demand interpolation strategy significantly reduces the number of processor cycles and the amount of silicon area needed for memory, making it particularly suitable for mobile terminals and real-time videotelephony where power and hardware resources are constrained.

How does this patent fit in bigger picture?

Technical Landscape

In the early 2000s when ’273 was filed, digital video compression was typically implemented using motion-compensated temporal prediction to manage the high data rates required for real-time transmission over bandwidth-limited networks. At a time when systems commonly relied on integer-pixel or basic half-pixel displacement vectors to identify redundant image data between frames, the precision of motion estimation was often limited by the underlying pixel grid. When hardware and software constraints made the processing of high-resolution video non-trivial, especially for mobile and low-bitrate telecommunications, standard practices involved sub-sampling chrominance components and using variable length coding to reduce spectral and spatial redundancies. Engineering constraints of the era necessitated efficient interpolation methods that could provide higher motion vector precision without incurring prohibitive computational overhead or excessive memory access requirements.

Prosecution Position

The disclosed invention addresses the technical problem of limited precision in motion-compensated prediction by providing a structured architectural solution for sub-pixel interpolation at fractional locations. The solution integrates a multi-stage interpolation framework where sub-pixels at specific fractional intervals are generated through weighted sums of unit-level pixels, while finer sub-pixel values are derived via diagonal weighted averages of previously calculated sub-pixels or pixels. This hierarchical approach enables an architectural shift from simple linear interpolation to a more complex diagonal averaging scheme that maintains high precision across various fractional resolutions, such as quarter-pixel or eighth-pixel levels. The technical effect achieved is a significant reduction in prediction error and bit-rate requirements, overcoming the constraint of high data volume in low-bandwidth environments by enabling more accurate motion tracing between consecutive video frames.

Claims

This patent contains a total of 83 claims, with 13 independent claims identified as 1, 31, 32, 33, 64, 68, 71, 73, 75, 76, 79, 82, and 83. The independent claims generally focus on methods, interpolators, encoders, decoders, and computer programs for sub-pixel value interpolation within a rectangular bounded region, specifically utilizing weighted averages and sums of pixels and sub-pixels at various coordinate resolutions to determine intermediate values. The dependent claims serve to further specify weighting factors, distance-based calculations, truncation processes for managing dynamic range, and the integration of these interpolation techniques into specific hardware environments such as wireless communications terminals and codecs.

Key Claim Terms New

Definitions of key terms used in the patent claims.

Term (Source)Support for SpecificationInterpretation
Immediately adjacent rectangular bounded regions
(Claim 1, Claim 31, Claim 32, Claim 33, Claim 64, Claim 68, Claim 71, Claim 73, Claim 75, Claim 76, Claim 79, Claim 82, Claim 83)
Interpolating sub-pixel values for sub-pixels having co-ordinates with even values of both K and L using a weighted sum of the values of sub-pixels having co-ordinates with K equal to an even value and L equal to zero and the values of sub-pixels having corresponding co-ordinates in immediately adjacent rectangular bounded regions. This allows for the use of values from adjacent regions to calculate sub-pixels within the current region.The neighboring blocks of pixels used to provide reference values for interpolating sub-pixels at even coordinate locations within the current bounded region.
Rectangular bounded region
(Claim 1, Claim 31, Claim 32, Claim 33, Claim 64, Claim 68, Claim 71, Claim 73, Claim 75, Claim 76, Claim 79, Claim 82, Claim 83)
The method for sub-pixel value interpolation determines values for sub-pixels situated within a rectangular bounded region defined by four corner pixels with no intermediate pixels between the corners. Each image block comprises four corners, each corner being defined by a pixel located at a unit horizontal and unit vertical location.An area in an image defined by four corner pixels at unit horizontal and vertical locations, containing no intermediate pixels between these corners.
Sub-pixel value interpolation
(Claim 1, Claim 31, Claim 32, Claim 33, Claim 64, Claim 68, Claim 71, Claim 73, Claim 75, Claim 76, Claim 79, Claim 82, Claim 83)
The present invention relates to a method for sub-pixel value interpolation in the encoding and decoding of data. It relates particularly, but not exclusively, to encoding and decoding of digital video. The method is used to generate values for sub-pixels at fractional horizontal and vertical locations defined according to 1/2^x.A process in video or image coding to generate values for image elements at fractional horizontal and vertical locations between the unit locations of the original pixel grid.
Weighted average
(Claim 1, Claim 31, Claim 32, Claim 33, Claim 64, Claim 68, Claim 71, Claim 73, Claim 75, Claim 76, Claim 79, Claim 82, Claim 83)
Preferably a first and a second weight are used in the weighted average, the relative magnitudes of the weights being inversely proportional to the proximity of the first and the second sub-pixel or pixel to the sub-pixel being calculated. In a situation where the first and the second sub-pixel or pixel are symmetrically located with respect to the sub-pixel, the first and second weights may have equal values.A calculation used to determine a sub-pixel value by combining the values of two or more pixels or sub-pixels, where each value is multiplied by a weight reflecting its diagonal proximity to the target sub-pixel.
Weighted sums
(Claim 1, Claim 31, Claim 32, Claim 33, Claim 64, Claim 68, Claim 71, Claim 73, Claim 75, Claim 76, Claim 79, Claim 82, Claim 83)
Interpolating such values directly using weighted sums of pixels residing at unit horizontal and unit vertical locations. At least one of step a) and step b) interpolating sub-pixel values directly using weighted sums may involve the calculation of an intermediate value for the sub-pixel values having a dynamic range greater than the specified dynamic range.Direct calculations using values of pixels located in rows or columns to interpolate sub-pixel values at fractional horizontal or vertical locations.

Litigation Cases New

US Latest litigation cases involving this patent.

Case NumberFiling DateTitle
0:24-cv-04269Nov 25, 2024Element Television Company, Llc V. Nokia Corporation
1:23-cv-01237Oct 31, 2023Nokia Technologies Oy V. Hp, Inc.
1:23-cv-01236Oct 31, 2023Nokia Technologies Oy V. Amazon.Com, Inc.

Patent Family

Patent Family

File Wrapper

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

US8036273

SEP
Application Number
US11839205A
Filing Date
Aug 15, 2007
Status
Expired
Publication Date
Oct 11, 2011
External Links
Slate, USPTO , Google Patents