Video Splicing via Virtual Buffer Constraints
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional methods for seamless ad-insertion in compressed video domains are complex and computationally expensive, making it difficult to implement targeted advertising close to the customer premises without requiring expensive splicing applications.
Innovation Solution
A method for seamless splicing in the compressed video domain involves modifying the rate control algorithms of primary and secondary video streams to ensure buffer fullness constraints, allowing for temporary replacement of video content without recalculation of buffer fullness, enabling splicing anywhere between the encoder and decoder, including at the customer's set-top box.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional splicing methods are used to enable seamless ad-insertion in compressed video domains, then seamless splicing is achieved, but the system complexity and computational cost increase significantly
Solution Approach 1:
The patent applies preliminary action by pre-calculating and embedding buffer fullness information and splice point markers during the initial video encoding process. This allows the splicing operation to simply read and act on pre-prepared data without performing complex real-time calculations, thereby achieving seamless splicing with reduced computational complexity
Solution Approach 2:
The patent uses copying by creating and storing virtual buffer state representations during encoding. These copied buffer state data structures are then used during splicing operations to determine valid splice points without needing to simulate the entire decoder buffer behavior, reducing the computational burden while maintaining splicing reliability
2Reliability
If complex splicing applications are deployed to achieve seamless ad-insertion, then seamless splicing is enabled, but the implementation cost increases
Solution Approach 1:
The patent employs cheap short-living objects by using lightweight data structures (splice point markers and buffer fullness indicators) that can be quickly generated during encoding and discarded after splicing. These simple marker objects replace the need for expensive, complex splicing software applications, significantly reducing implementation costs while maintaining seamless splicing capability
3Adaptability or versatility
If splicing is performed close to customer premises for targeted advertising, then advertising targeting capability is improved, but the requirement for complex splicing applications at customer premises increases
Solution Approach 1:
The patent extracts the complex computational requirements from the customer premises equipment by moving all buffer fullness calculations and splice point determination to the encoding stage. The customer premises only needs to perform simple marker detection and switching operations, enabling targeted advertising without requiring complex splicing applications at the customer location
Data Source
AI summary
A method of splicing video content from a secondary encoded video stream into a primary encoded video stream, the method including the steps of identifying a splice out-time tout and a splice in-time tin, at least T time after tout, in the primary stream; causing the fullness of primary encoder's virtual buffer to be less than XB, where X is greater than 0 and less than 1, at the first decode times after tout and tin; encoding the secondary stream such that an initial coded picture is transmitted in no more than B/(XR) time, and encoding the second stream such that, at a final coded picture's decode time, the fullness of the secondary encoder's virtual buffer is less than XB; and replacing video content of the primary stream from tout through tout+T, with the video data of the second stream.