Merging separate clipping level configurations into a single structure reduces device complexity while maintaining filtering precision for video streams.
Embed end-of-block positions within quantized transform coefficients to reduce decoding operations and lower computational complexity.
Refining motion information via projection format distortion compensation improves coding efficiency by resolving inaccuracies in video decoding.
A decoding unit manages prediction refinement optical flow processing through a slice header flag in the video stream.
A deblocking filter modifies up to one sample at sub-partition boundaries to reduce blocking artifacts.
A decoding device determines a transform skip residual coding flag based on dependent quantization and sign data hiding flags.
Multiple encoders process divided video groups in parallel to reduce computational complexity and enable real-time 8K broadcasting.
Adapts variable length coding tables based on tree hierarchy levels to resolve compression efficiency versus adaptive complexity trade-offs.
A split mechanism divides coding units into sub-CUs to enable multiple transform unit applications.
Deriving intra prediction data from adjacent reconstructed samples and block dimensions enables efficient encoding of arbitrary rectangular video blocks.
Dividing moving pictures into slices enables parallel encoding while maintaining quality through boundary macroblock information sharing.
A low resolution pipeline generates candidate inter-frame prediction modes to reduce computational complexity in video encoding.
Encoding symbology metadata in video frames enables flexible overlay without modifying raw sensor data.
Encoder signals selected CCLM index to decoder, reducing complexity while maintaining prediction accuracy.
A decoding apparatus identifies all-zero residual blocks using a specific flag to skip transform tree syntax structures.
Segmenting the motion field into affine regions reduces signalling overhead while maintaining picture quality during lossy video compression.
A video decoder applies deformation compensation to texture blocks using reference picture parameters.
Encoding residual sub-frames in an enhancement layer allows non-scalable decoders to process scalable video streams without hardware modifications.
A point cloud index determination method uses occupied child nodes on planes perpendicular to a k-th axis for accurate node prediction.
A bit rate control method adjusts coding parameters using real-time complexity data to manage video encoding streams.
Computes target frame sizes for Inter frames relative to Intra frames to prevent bitrate exceedance and maintain video quality.
A block vector restriction mechanism ensures neighboring pixel availability for fractional-pel interpolation in IntraBC video coding.
A 3D video decoding method constructs sample candidate sets using only two adjacent prediction sampling points.
Mixed palette encoding reduces staircasing artifacts by combining fixed and local color entries, improving compression efficiency for comic book graphics.
Segmenting parameter sets with unique identifiers allows flexible tool updates while reducing computational burden in video codec implementations.
Segmenting transform blocks into sub-blocks reduces computational complexity while maintaining compression performance in high precision video coding.
Merging bilateral and adaptive loop filters into a unified pipeline lowers hardware complexity while maintaining compression efficiency gains.
Flexible luma bins and a single chroma residual scaling factor reduce processing latency while maintaining high visual quality in video compression.
Multiple depth plane prediction decomposes previous frames into planes adjusted for camera viewpoint changes, reducing storage and transmission requirements.
A processing circuitry updates a history based list to reconstruct sample strings, resolving redundancy in less likely intra prediction directions.
Adaptive composite intra prediction selects dynamic modes based on neighbor availability, eliminating explicit signaling overhead while improving compression.
Selects distinct interpolation filters per pixel position using local image features, reducing residual errors while avoiding explicit signaling overhead.
Flexible coefficient coding defines variable coefficient groups within transform units to adapt entropy modeling.
A hardware entropy engine outputs count information to external storage during video processing.
Encoding device transmits reference image specifying information for non-first Group of Picture images to reduce data volume.
A video coding method simplifies Intra-block copy prediction by extracting its signaling from the conventional intra prediction binary tree structure.
Separate syntax elements manage adaptive loop filtering for individual chrominance components, resolving flexibility bottlenecks in video encoding.
Segmenting motion vector candidates into two lists reduces encoding complexity while maintaining high prediction accuracy for video compression.
Unified binarization of non-separable secondary transform indices reduces bitstream redundancy while maintaining coder complexity.
A video central processing unit parses bitstreams and generates prescan information to enable parallel decoding across multiple processing units.
A quantization offset parameter modifies coding units based on prediction mode type within a single largest coding unit.
Multiple CC-ALF filters refine chroma components via luma-based processing to reduce coding artefacts in video decoding.
Determining processing block orders splits video into largest coding units, resolving uniform order limits on compression efficiency.
Encoder computes hash values to identify candidate blocks, resolving screen content compression quality issues.
A video encoder modifies luma filtering coefficients via arithmetic right shift to generate chroma component values.
A channel change method for OTT video services encodes live streams into main and sub streams to enable rapid client switching.