Video Codec Motion Region Segmentation for Cloud Editing

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current video compression technologies are inadequate for cloud video editing software, particularly in supporting multiple live source streams on standard devices without dedicated video hardware, and fail to efficiently manage data rate, random access, and real-time compression.

Innovation Solution

The method involves dividing video streams into Key frames and subsequent chunks of 2n frames, constructing Delta frames from adjacent frames, and using Motion Regions to determine motion vectors, with intra- and inter-frame compression, and Transition Tables for efficient encoding and decoding, optimizing data representation and compression.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If conventional video compression is used, then video streaming is suitable, but cloud video editing software cannot efficiently support multiple live source streams on standard devices

Engineering Contradiction:
Improvesupport for multiple live source streamsVSAvoiddedicated video hardware requirement
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The video stream is divided into Key frames and subsequent chunks of 2n frames, with Delta frames constructed from adjacent frames. This segmentation allows standard devices to process video in manageable units without requiring dedicated hardware, while still supporting multiple concurrent streams through efficient data organization and compression.

Inventive Principle:
Principle #1Segmentation

2Measurement precision

If more Delta frames are included in the bitstream, then frame reconstruction accuracy improves, but data rate increases proportionally

Engineering Contradiction:
Improveframe reconstruction accuracyVSAvoiddata rate
Core Design Contradiction:
Measurement precisionVSQuantity of substance

Solution Approach 1:

The patent includes only the necessary Delta frames (Dx where x>0) required for accurate frame reconstruction, eliminating unnecessary information. The data rate increases at a much lower rate than the number of frames because motion vectors and other data are efficiently represented and reused across multiple Delta frames, rather than transmitting complete frame data for each chunk.

Inventive Principle:
Principle #16Partial or excessive action

3Measurement precision

If motion vectors are determined for every frame, then motion compensation accuracy improves, but processing time and computational resources increase

Engineering Contradiction:
Improvemotion compensation accuracyVSAvoidprocessing time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

Motion vectors are determined during the encoding phase for all Delta frames in advance. The encoded bitstream contains the necessary motion vector data that can be efficiently decoded during playback without requiring real-time motion analysis, thus achieving accurate motion compensation while minimizing processing time during actual video editing and playback operations.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS11792405B2Codec
Publication Date: 2023.10.17 BLACKBIRD PLC
  • US11792405B2 patent drawing
  • US11792405B2 patent drawing
  • US11792405B2 patent drawing

AI summary

As may be implemented with one or more embodiments, a video stream is divided into a key frame and subsequent chunks of frames including a key frame and Delta (Dx) frames constructed from adjacent frames by dividing the frame into Motion Regions representing groups of pixels, determining a pixel group in an Earlier and later frame that is a best match for a pixel group in a Motion Region of a Current frame, and determining motion vectors for best matches for the Motion Regions and/or by intra-frame compression. A bitstream may be built such that as x increases, motion vector and other data relating to a combination of Dx frames is represented by data that is less than all the data in the combination of Dx frames and increases at a lower rate than the quantity of frames in Dx compared to the quantity of frames in Dx 1.