Skipping split syntax for uniform PCM blocks avoids engine resets and reduces bitstream redundancy.
A decoding method derives block vectors from predictors to generate prediction blocks using similar regions within the same picture.
Segmenting motion vectors into temperature-indexed differences reduces signaling complexity while maintaining high-resolution video quality.
A video encoding method adjusts block quality values using spatial and temporal filters to blend data from contiguous frames.
Pre-decoding reference frames reduces processing time for high-resolution video by eliminating real-time decoding delays.
A video encoder applies bi-directional optical flow processing to generate predicted sample values.
A parallel processing method divides video transform units into independent regions to remove context selection dependencies between neighboring bins.
A container frame structure combines virtual video frames encoded with different parameters into a single transmission unit.
Inverse reduced secondary transform concentrates non-zero coefficients in low-frequency components to enhance residual coding efficiency.
Block-level scaling factors in the bitstream reduce bitrate without re-coding intra-frames, resolving encoding complexity trade-offs.
Virtual boundaries enable selective in-loop filtering via SPS flags, reducing transmission costs while maintaining high-resolution image quality.
Asymmetric ternary splits in a QTBT structure adapt to local video characteristics, reducing bitrate while managing partitioning complexity.
Embedding URI messages within video frames preserves enhanced service data integrity against MVPD modifications, ensuring accurate AV presentation.
A transmission device generates base and enhanced streams from mixed image data to reduce prediction residue.
Template matching reorders available motion vector resolutions by cost, selecting the optimal resolution for each block to improve compression efficiency.
Detecting edge directions in adjacent blocks generates predicted image data that reduces coded distortion and improves coding efficiency.
Intra-block copy prediction shares context modeling with inter modes, enabling non-square partitions that resolve coding efficiency trade-offs.
Conditionally non-linear transform coding on non-square blocks uses previously decoded pixels for prediction.
A coding apparatus selects target block motion vectors using adjoining block references to reduce calculation cost.
A content-adaptive denoising method segments video frames into uniform and non-uniform regions to estimate noise levels accurately.
A multi-angle adaptive intra-frame prediction scheme reduces point cloud attribute redundancy through six distinct coding block modes.
Applying boundary-specific filters and offset values reduces sample discontinuities, improving prediction accuracy without raising computational complexity.
Derives sample unit motion vectors from control points to enhance inter prediction accuracy, reducing data requirements and improving coding efficiency.
Adaptable deblocking filters adjust boundary strength based on video block partition sizes to enhance inter-layer prediction in scalable video coding.
Dynamic clipping parameters adapt to bit-depth and color formats, resolving format compatibility issues in video coding standards.
A candidate filter selection method reduces video stream bitrate by encoding filtered copies and comparing cost values.
Polynomial fitting refines texture region clusters to encode complex video areas separately, reducing bit rate consumption while maintaining subjective quality.
Shared context memory eliminates parameter copying between block lines, maintaining coding efficiency during wavefront processing.
A layered augmented 3D entertainment system generates cinema and wearable device image layers using tensor maps to render visual objects with positive parallax.
A merge candidate list construction method checks spatial and temporal availability to optimize motion information prediction.
A video coding method sets a BDOF flag based on motion vectors to control inter-frame prediction.
Encoding averaged pictures alongside residual frames reduces receiver calculation load while maintaining image sharpness during high-speed shutter capture.
A deblocking filter system selects adaptive strength based on local block characteristics to smooth reconstructed video boundaries.
Splitting coding tree units using mixed quadtree and binary tree structures resolves fixed square block limitations in high-resolution image decoding.
Applying a universal maximum temporal sub-layer value across all layers reduces signaling overhead while maintaining inter-layer prediction accuracy.
Reorder motion vector prediction candidates via cost estimation to reduce bandwidth consumption from redundant candidate lists.
Dynamic scheduling of I-frames and P-frames prevents collisions and reduces latency in wireless networks.
A video processing apparatus selects a reference sample filter based on each video block size to perform intra prediction.
Segmenting NAL units into a decoder configuration record resolves the contradiction between high-resolution video volume and storage costs.
A CCLM prediction unit derives parameters using right-shift scaling to simplify multiplication operations.
Adaptive kernel sizes and shapes selected from coded information reduce hardware requirements while increasing decoding throughput.
Modifying intra prediction modes per subblock based on partition shape reduces transmission overhead while improving coding efficiency.
Adaptive control point selection reduces entropy coding complexity while maintaining high motion representation accuracy.
A Transform Skip Mode encoding method calculates costs using sum of absolute differences to select candidate intra-prediction modes.
Detecting and filtering boundaries within transform units resolves coding inefficiencies from mismatched block sizes.
Depth condition validation enables accurate disparity vector derivation via camera parameters, resolving accuracy and complexity trade-offs in 3D video coding.