History-Based Motion Vector Prediction uses look-up tables to store motion candidates for efficient video block decoding.
Selective deblocking filtering activates on chroma components while deactivating luma processing in BDPCM and RDPCM video blocks.
A coefficient scanning method aligns scanning directions with intra prediction modes using a look-up table to optimize video encoding.
Determines transform performing areas and partitions sub blocks using quadtree or binary tree segmentation to enhance coding efficiency.
Sign bit hiding infers motion vector signs from magnitude parity, reducing encoder complexity and saving bits without explicit sign encoding.
A video decoding apparatus derives prediction images using a matrix reference pixel derivation unit that downsamples adjacent blocks.
Applying DMVR offsets to initial motion vectors eliminates padding requirements, reducing memory bandwidth and improving video coding efficiency.
A video decoding method derives spatial merge candidates from parent node blocks to generate a merge candidate list for motion compensation.
A video decoding device selects a fixed or adaptive number of template matching candidates to reconstruct prediction and residual blocks.
Composite filters merge multiple base filters to resolve contradictions between hardware complexity and video quality in adaptive loop filtering.
Segmenting profile tier level information by layer resolves signaling complexity while improving multi-layer video decoding efficiency.
A video encoding method splits image blocks into various partition shapes to generate predicted and residual blocks for efficient processing.
Applying distinct width and height thresholds for unidirectional versus bidirectional affine inter prediction reduces computational complexity.
Signaling rectangular slice dimensions directly using tile subset or superset relationships in versatile video coding.
A video encoding device separates background images from foreground moving objects to reduce data volume.
A parallel entropy encoder distributes encoding elements across N search trees to process phrases concurrently.
A control unit adjusts offset ranges in decoded image pixels based on quantization parameters to optimize filter processing operations.
A hybrid inter-layer reference picture generation method enables single loop decoding by combining base layer motion data with enhancement layer texture signals.
Switching non-linear mapping filter shapes based on sample offset values improves compression efficiency while controlling computational complexity.
Processor encodes image data using bit numbers based on area complexity to manage transmission bandwidth.
Position dependent reference sample smoothing adjusts filter coefficients based on distance to improve prediction accuracy in video coding.
An encoding application detects user attention to adjust video stream quality dynamically.
Dynamic prediction mode switching reduces calculation complexity while maintaining high prediction accuracy.
Convolutional neural networks blend video patches using learned transformations to reduce computational burden.
A distributed transcoding system splits video content into segments for parallel processing by multiple workers to reduce encoding time.
An atlas processing unit generates identification information linking texture and depth images to enable selective rendering of video regions.
Assigning unequal weights to reference pixels based on proximity improves intra prediction accuracy in video coding.
A shared Haar transform module prepares input data using nonlinear lifting stages to enable reversible integer-to-integer operations.
A video decoder detects illegal block partitions and overrides them with legal syntax to maintain continuous decoding.
Packing left, right, and depth map frames into unified broadcast signals reduces bandwidth consumption while maintaining ultra-high definition quality.
A method determines the first video coding layer network abstraction layer unit within a picture unit by checking for a picture header presence.
Encoder restricts screen content motion vectors to integer pixels, reducing bit rate and processing complexity while maintaining video quality.
Shifting multi-directional image content aligns viewport data with earlier-coded positions, reducing rendering latency without decoding the entire image.
A video transcoding method segments frames into macroblocks and inserts watermark information to determine target encoding parameters.
Pixel cache pre-loads motion compensation reference data to reduce idle time during luminance and chrominance signal processing.
A video processing method constructs an optimized motion vector prediction list using template matching costs to select candidates.
A hierarchical epitome construction method generates reference structures at multiple resolution levels to support scalable video encoding.
A video encoder compares current block sizes with a maximum skip threshold to selectively bypass transforms.
Intermediate scaling prevents overflow during separable up-sampling, maintaining measurement precision for UHD and HDR video signals.
Deriving independent motion vectors for 8x8 subblocks reduces hardware gate count while maintaining compression performance in high-resolution video decoding.
A pixel encoding method determines luminance values by minimizing error differences between color spaces.
A block merging candidate list construction method generates spatial and temporal neighbors while removing redundant entries.
An encoder applies asymmetrical filter coefficients across block boundaries to adaptively adjust pixel values based on local prediction modes.
Predicts quantization parameters from previous block data to enable error-free transcoding between sequential and parallel processing modes.
Blending Intra and Inter predictors resolves complex motion handling limits, improving coding efficiency while reducing bandwidth requirements.
A steerable discrete cosine transform rotates basis vectors to align with image discontinuities.
A video decoding method selects inverse transforms based on prediction block information to enhance coding efficiency.
A method adjusts the 3D merge candidate list size based on view synthesis prediction flags to improve coding efficiency.
Deriving reference chroma blocks from co-located luma block vectors and fusing them reduces residual errors while managing signaling overhead.