Velos Media LLC v. Walt Disney Co

I. Executive Summary and Procedural Information

• Parties & Counsel:
  • Plaintiff: Velos Media, LLC (Delaware)
  • Defendant: The Walt Disney Company, et al. (Delaware)
  • Plaintiff's Counsel: McKool Smith, P.C.
• Case Identification: 2:26-cv-03052, C.D. Cal., 03/20/2026
• Venue Allegations: Plaintiff alleges venue is proper in the Central District of California because Defendants have committed acts of infringement in the district and maintain regular and established places of business within the district, including offices and headquarters for various Disney entities.
• Core Dispute: Plaintiff alleges that Defendant's video streaming services (Disney+, Hulu, ESPN+) infringe six patents related to video encoding and decoding technologies compliant with the H.265/HEVC standard.
• Technical Context: The technology at issue involves advanced video compression techniques that enable the efficient streaming of high-quality digital video, a critical component of modern on-demand and live streaming services.
• Key Procedural History: The complaint states that Plaintiff, both directly and through the Avanci Video patent pool, engaged in licensing negotiations with Defendant. Plaintiff alleges that Defendant received and did not accept a license offer on Reasonable and Non-Discriminatory (RAND) terms for patents Plaintiff claims are essential to the H.265 standard. One of the asserted patents, U.S. 8,964,849, was subject to an Inter Partes Review (IPR) proceeding (IPR2019-00710), which confirmed the patentability of several claims, including asserted independent claim 1.

Case Timeline

II. Technology and Patent(s)-in-Suit Analysis

U.S. Patent No. 11,627,338 - "Significance map encoding and decoding using partition selection"

(issued Apr. 11, 2023)

The Invention Explained

• Problem Addressed: In modern video compression standards like H.265/HEVC, a significant portion of the data in a video bitstream (30-80%) relates to "quantized transform coefficients" Compl. ¶116 '338 Patent, col. 2:21-23 A "significance map" indicates the positions of non-zero coefficients. Encoding this map using techniques like Context-Adaptive Binary Arithmetic Coding (CABAC) requires tracking a large number of distinct "contexts" (e.g., 88), which demands high computational speed and resources Compl. ¶117 '338 Patent, col. 2:30-40
• The Patented Solution: The invention proposes a more efficient method for assigning these contexts by using a "non-spatially-uniform partitioning" of the significance map Compl. ¶118 Instead of assigning a unique context to every position, the method groups bit positions into different "parts" and assigns a shared context to all positions within a part '338 Patent, abstract This partitioning is non-uniform, meaning some parts are smaller (e.g., a single position with its own context) while others are larger (e.g., multiple positions sharing a common context), as illustrated in the patent's figures '338 Patent, Fig. 4 This focuses the computational cost of context adaptation on the most critical areas of the map Compl. ¶118
• Technical Importance: This technique improves the operational efficiency of video decoders and encoders by reducing the complexity associated with managing contexts for significance map coding Compl. ¶118

Key Claims at a Glance

• The complaint identifies independent claim 1 as asserted Compl. ¶146
• Claim 1 is a method claim directed to decoding a bitstream to reconstruct a significance map for a 4x4 transform unit. Its essential elements include:
  • For each bit position, determining a context based on a "partition set."
  • The partition set must assign contexts according to a specific nine-part geometric structure within the 4x4 block (e.g., four distinct contexts in the upper-left quadrant, a fifth context for two positions in the upper-right quadrant, etc.).
  • Decoding the encoded data using the determined context to reconstruct a bit value.
  • Updating the context based on the reconstructed bit value.
• The complaint does not explicitly reserve the right to assert dependent claims for this patent.

U.S. Patent No. 9,008,184 - "Multiple sign bit hiding within a transform unit"

(issued Apr. 14, 2015)

The Invention Explained

• Problem Addressed: The sign bits associated with non-zero transform coefficients can consume a significant amount of data in a compressed video bitstream Compl. ¶122 '184 Patent, col. 1:65-67 A technique known as "sign bit hiding" aims to reduce this data overhead by encoding the sign of a coefficient implicitly through the parity (even or odd) of the sum of other coefficient values Compl. ¶122 '184 Patent, col. 7:49-51 The complaint alleges that this technique was conventionally applied only to an entire transform block at a time Compl. ¶123
• The Patented Solution: The patent proposes an improvement where sign bit hiding is applied to multiple, smaller subsets of coefficients within a single transform unit Compl. ¶123 The transform unit is partitioned into two or more "sets of non-zero coefficients," and a sign bit is hidden for each set by using the parity of the sum of coefficients within that set '184 Patent, col. 8:29-32 This approach compounds the data-saving benefits of sign bit hiding by applying it multiple times within a single larger block Compl. ¶123
• Technical Importance: This method improves video compression efficiency by reducing the data required to signal the signs of transform coefficients, which can contribute to higher video quality or lower bandwidth requirements Compl. ¶120

Key Claims at a Glance

• The complaint identifies independent claim 1 as asserted Compl. ¶156
• Claim 1 is a method claim for decoding a bitstream by reconstructing coefficients for a transform unit. Its essential elements include:
  • The bitstream encodes "two or more sets of sign bits" for the transform unit, with each set corresponding to a respective "set of coefficients."
  • For each of the two or more sets, summing the absolute value of the coefficients to obtain a "parity value."
  • Assigning a sign to one of the coefficients within that set based on whether the parity value is even or odd.
• The complaint does not explicitly reserve the right to assert dependent claims for this patent.

Multi-Patent Capsules

• *U.S. Patent No. 12,186,395, "Multiple sign bit hiding within a transform unit", issued Jan. 7, 2025 Compl. ¶124*

  • Technology Synopsis: As a continuation of the '184 Patent, this invention refines the concept of sign bit hiding for subsets of coefficients Compl. ¶¶125-126 It introduces a conditional application of the technique, whereby sign bit hiding is only used for a given subset if it meets a specified threshold, such as containing a minimum number of non-zero coefficients Compl. ¶126 '395 Patent, col. 9:18-25 This approach aims to increase efficiency and flexibility by applying the technique only where it is likely to provide a significant benefit Compl. ¶126
  • Asserted Claims: The complaint indicates assertion of at least claim 1 Compl. ¶166
  • Accused Features: The accused features are Defendant's H.265-compliant encoders and decoders, which allegedly perform this threshold-based, conditional sign bit hiding within their video processing pipelines Compl. ¶¶159-160

• *U.S. Patent No. 8,964,849, "Multi-level significance maps for encoding and decoding", issued Feb. 24, 2015 Compl. ¶127*

  • Technology Synopsis: The patent is directed to reducing the data required for signaling a "significance map," which indicates the locations of non-zero transform coefficients Compl. ¶¶129-130 The invention achieves this by allowing a decoder to infer certain significance flags under specific circumstances, rather than having to receive every flag explicitly from the bitstream '849 Patent, col. 18:11-19:24 This inference mechanism enables the decoding of high-quality video using less data Compl. ¶130
  • Asserted Claims: The complaint indicates assertion of at least claim 1 Compl. ¶176 The IPR certificate for this patent confirmed claim 1 as patentable '849 Patent IPR Certificate, p. 2
  • Accused Features: Defendant's H.265-compliant decoders are accused of infringing by inferring significance flags as taught by the patent, thereby reducing the amount of data needed to reconstruct video for streaming Compl. ¶¶169-170

• *U.S. Patent No. 12,088,843, "Method for deriving a motion vector", issued Sep. 10, 2024 Compl. ¶131*

  • Technology Synopsis: This patent addresses motion vector prediction, a key part of inter-frame video compression Compl. ¶133 The technical problem is the complexity and memory requirement of generating a list of candidate motion vectors for prediction '843 Patent, col. 3:36-38 The patented solution is a technique where candidate motion vectors for a current block are determined based on the candidates of a "co-located block" in a previously decoded frame, which reduces complexity and storage needs while maintaining prediction reliability Compl. ¶133 '843 Patent, col. 4:15-21
  • Asserted Claims: The complaint indicates assertion of at least claim 1 Compl. ¶186
  • Accused Features: Defendant's video decoders are accused of infringing by using this co-located block method to derive motion vectors during the decoding of streamed video content Compl. ¶¶179-180

• *U.S. Patent No. 12,341,962, "Multi-level significance maps for encoding and decoding", issued Jun. 24, 2025 Compl. ¶134*

  • Technology Synopsis: This patent, related to the '849 Patent, focuses on improving the efficiency of encoding transform coefficient information Compl. ¶¶135-136 It provides methods for an encoder to reduce the data needed to signal this information, such as by using "indirect signaling" to convey a "group flag" that corresponds to a group of significant-coefficient flags '962 Patent, abstract Compl. ¶136 This enables the transmission of higher quality video with less bandwidth Compl. ¶136
  • Asserted Claims: The complaint indicates assertion of at least claim 1 Compl. ¶196
  • Accused Features: Defendant's video encoders used for transcoding and preparing content for its streaming platforms are accused of infringing by using the claimed indirect signaling methods to create H.265-compliant bitstreams Compl. ¶¶189-190

III. The Accused Instrumentality

Product Identification

The accused instrumentalities are Defendant's streaming platforms-Disney+, Hulu, Hulu Live, and ESPN+-and the associated encoders and decoders used on their servers and in their client applications Compl. ¶¶14 Compl. ¶21

Functionality and Market Context

• The accused platforms deliver on-demand and live video content to subscribers across a wide range of devices Compl. ¶¶54-59 The complaint alleges that these services use video formats compliant with the H.265/HEVC standard to stream video efficiently Compl. ¶55 Compl. ¶57 Compl. ¶59
• The core accused functionality resides in the H.265-compliant decoders and encoders used in Defendant's infrastructure for transcoding uploaded content and in the client-side applications for playback Compl. ¶¶15-16 The complaint provides a screenshot of Defendant's marketing materials promoting bundles of these services, which allegedly encourages users to engage in infringing use by playing back video content. This screenshot shows promotional offers for "Disney+ and Hulu!" and various bundles including ESPN+ and HBO Max Compl. ¶142, p. 35
• The complaint alleges these platforms serve nearly 200 million subscribers, positioning them as a major force in the video streaming market Compl. ¶2

IV. Analysis of Infringement Allegations

The complaint references claim-chart exhibits for the asserted patents but does not attach them Compl. ¶146 Compl. ¶156 The infringement theory is therefore summarized in prose.

'338 Patent Infringement Allegations

The complaint alleges that Defendant's decoders, used for transcoding, playback testing, and in streaming applications, infringe the '338 patent Compl. ¶¶139-140 The infringement theory suggests that because these decoders are H.265-compliant, they necessarily practice the method of claim 1 for decoding 4x4 transform units. This would require the accused decoders to implement the specific nine-part, non-spatially-uniform context partitioning scheme recited in the claim when reconstructing significance maps Compl. ¶118

'184 Patent Infringement Allegations

The complaint alleges that Defendant's H.265-compliant decoders and encoders infringe the '184 patent Compl. ¶¶149-150 The infringement theory is based on the allegation that these systems implement the claimed "sign bit hiding" technique. Specifically, the accused systems are alleged to partition transform units into "two or more sets of coefficients" and then, for each set, determine the sign of one coefficient based on the parity of the sum of the absolute values of the coefficients within that set, as required by claim 1 Compl. ¶123 The complaint includes a screenshot of the "Streams" feature on Disney+, illustrating how users are instructed to play back video, which Plaintiff alleges constitutes infringement Compl. ¶153, p. 38

Identified Points of Contention

• Scope Questions: For both the '338 and '184 patents, a central question may be whether the methods described in the claims are mandatory, optional, or merely one of several possible implementations within the H.265/HEVC standard. The analysis may explore whether practicing the H.265 standard, as the accused products are alleged to do, necessarily means practicing the claimed inventions.
• Technical Questions: For the '338 patent, what evidence demonstrates that the accused decoders use the exact nine-part geometric partitioning of contexts for 4x4 blocks as recited in claim 1? For the '184 patent, what evidence shows that the accused systems partition coefficients into "sets" and use the parity of each set to decode a distinct sign bit, as opposed to applying sign hiding only to the transform unit as a whole or using a different data reduction technique?

V. Key Claim Terms for Construction

For the '338 Patent

• The Term: "partition set"
• Context and Importance: This term is the foundation of claim 1. Its construction will determine whether the specific context-assignment rules used in an H.265-compliant decoder fall within the scope of the claim. Practitioners may focus on this term because the claim itself provides a detailed functional definition by reciting a nine-part structure for a 4x4 block.
• Intrinsic Evidence for Interpretation:
  • Evidence for a Broader Interpretation: The specification describes the partition set in general mathematical terms as a mapping of bit positions to contexts, which could suggest that any system performing such a mapping is covered '338 Patent, col. 7:59-62
  • Evidence for a Narrower Interpretation: Claim 1 itself defines the "partition set" by an exhaustive list of nine specific structural and relational requirements for a 4x4 block. This explicit recitation may be argued to limit the term's scope to only those partition schemes that meet all nine listed criteria.

For the '184 Patent

• The Term: "sets of coefficients"
• Context and Importance: The novelty of the '184 patent hinges on applying sign bit hiding to multiple "sets" within a transform unit, rather than the entire unit. The definition of what constitutes a "set" for the purposes of the claim will be critical to the infringement analysis.
• Intrinsic Evidence for Interpretation:
  • Evidence for a Broader Interpretation: The claim language only requires "two or more sets," without specifying their size, shape, or how they are formed. This lack of limitation could support a broad reading covering various ways of partitioning coefficients.
  • Evidence for a Narrower Interpretation: The specification provides examples where these "sets" correspond to "coefficient groups" used for significance map encoding '184 Patent, col. 7:60-62 A defendant might argue that the term "sets" should be construed as being limited to these specific, structured "coefficient groups" rather than any arbitrary partitioning.

VI. Other Allegations

Indirect Infringement

The complaint alleges induced infringement for all asserted patents. The basis is that Defendant provides its streaming applications and instructs and encourages its subscribers to use them to play back video, which allegedly constitutes direct infringement by the end-users Compl. ¶141 Compl. ¶151

Willful Infringement

The complaint alleges willful infringement based on Defendant's alleged knowledge of the patents since at least December 17, 2025 Compl. ¶138 Compl. ¶148 This date corresponds to an email Plaintiff sent to Defendant that included a list of the Asserted Patents Compl. ¶49

VII. Analyst's Conclusion: Key Questions for the Case

1. Standard Essentiality and Claim Scope: A primary issue will be the relationship between the patent claims and the H.265/HEVC standard. The case may turn on whether the specific techniques recited in the claims (e.g., the '338 patent's nine-part partition, the '184 patent's multi-set sign hiding) are mandatory or optional implementations of the standard that Defendant's products are proven to practice.
2. RAND Obligations and Negotiation Conduct: The complaint dedicates two counts to the parties' failed licensing negotiations, alleging Defendant breached its obligation to negotiate in good faith for a license to patents Plaintiff asserts are standard-essential Compl. ¶¶197-214 A key question will be whether Plaintiff's licensing offers were consistent with its RAND commitments and whether Defendant's conduct constituted a breach of its obligations as an implementer of the standard.
3. Evidentiary Proof of Infringement: For claims involving subtle data processing techniques (e.g., inferring significance flags under the '849 patent or using indirect signaling under the '962 patent), a central question will be evidentiary. Can Plaintiff produce sufficient technical evidence, likely through source code analysis or reverse engineering, to demonstrate that the accused encoders and decoders perform the specific, nuanced steps required by the claims, as opposed to other functionally similar but non-infringing compression methods?