Deriving parameters to generate mathematical functions for intra prediction reduces data amount while maintaining image quality.
Applies gradient-based boundary filtering to reduce block discontinuities, lowering BD-rate while managing computational complexity.
Integrates reshaping and local illumination compensation to improve coding efficiency while managing computational complexity.
A video encoding system extracts camera translation and object location data to reconstruct frames without full frame-by-frame comparison.
A video processing apparatus selects filters for block boundaries based on pixel flatness to reduce visual artefacts.
A method filters discardable pictures from reference picture sets to maintain accurate decoding.
Decoding method adapts image luminance via dynamic tone mapping to resolve contradictions between power consumption policies and rendering accuracy.
A video processing method applies gradient-based position-dependent prediction combinations to target blocks during conversion.
Encoders adapt motion vector precision per block to resolve trade-offs between measurement accuracy and coding complexity.
Segmented bitstreams with distributed access points enable rapid viewport adjustments, eliminating temporal conflicts and reducing switching latency.
Hybrid transforms resolve coding inefficiencies from mismatched block sizes by applying adaptive segmentation and local quality principles.
A single loss function unifies an end-to-end video compression model, resolving uncontrollable loss values and suboptimal quality at predetermined code rates.
A motion estimation method selects reduced half-pixel and quarter-pixel candidate sets based on full-pixel results to lower computational load.
Template matching reorders merge list candidates for image encoding, resolving the trade-off between motion prediction precision and computational complexity.
Matrix-based intra prediction reduces data amounts while maintaining image quality by applying segmented matrix sets across different block sizes.
Straight partition lines split video coding units to select intra or inter prediction modes, resolving compression efficiency trade-offs.
Pre- and post-adjustment operations on base transforms lower device complexity while maintaining coding gain.
Adapting Rice parameter derivation via neighbor sums resolves large coefficient inefficiencies in lossless video coding.
A quantization scaling matrix decoder reconstructs new matrices from old values and update parameters to reduce coded stream data.
Aligns quantization outputs with entropy coding via dynamic flags and centered codebooks, resolving misalignment bottlenecks.
Default motion candidates improve compression performance by reducing computational complexity in candidate list management.
Classifies leading pictures as RADL or RASL using temporal identifiers to optimize bitstreams, eliminating consecutive picture dropping during stream switching.
Format-specific chroma quantization reduces artifacts and improves compression efficiency for high dynamic range video content.
Segmenting depth lookup tables into sub-ranges enables adaptive inter-DLT prediction, reducing bitrate overhead while maintaining encoding flexibility.
A video coding method constructs prediction sets from spatial non-adjacent and temporal neighboring blocks to enhance current block accuracy.
A video predictive decoding device encodes buffer description information by referencing previously processed pictures to reduce redundant data transmission.
A video coder forms a palette of dominant pixel values to encode index data for screen content blocks.
Adaptive directional information sets dynamically derive indices from neighboring blocks to reduce side information transmission and improve UMVE performance.
Parsing profile tier level syntax determines decoding levels, resolving signaling efficiency limits in Versatile Video Coding standards.
Image decoding apparatus generates reconstructed blocks and determines target boundaries to perform deblocking filtering on adjacent samples.
A transform block-level scan order selection method determines cost values based on zero-value coefficients before the end of block position.
A decoding method derives residual samples from residual information to generate a reconstructed picture.
A video processing device acquires quantization matrix parameters from a dedicated parameter set to configure inverse quantization.
Segmenting film grain model parameters reduces bit costs by sharing common data across layers while maintaining accuracy.
Encoder flags restrict references in sub-layer prediction dependency, reducing signaling overhead and memory costs.
Parallel octree coding accelerates point cloud reconstruction by enabling simultaneous node processing, reducing sequential dependency bottlenecks.
A transform basis selection mechanism generates symmetric variants from a single base matrix to reconstruct prediction residuals efficiently.
A video decoding device parses explicit height information for slices within a tile to derive individual slice dimensions.
An image decoding method uses transform skip and TSRC flags to derive prediction and residual samples for reconstructed pictures.
A data processing method segments syntax elements to apply fixed probability models for a subset, reducing computational burden.
A filter means classifies images by orthogonal transform sizes to apply tailored coefficients.
A predictor elimination algorithm removes redundant predictors from image coding data flows to lower processing complexity.
Disables triangular merge modes during slice-level weighted prediction to eliminate artifacts and reduce signaling overhead in fade regions.
A spiking neural network converts pixel data to spike trains, reducing transmission power while preserving image details in low Earth orbit satellites.
A homographic matrix compensates geometric distortions between neighboring views in omnidirectional video encoding.
Deriving predicted luma quantization parameters via partitioning type to resolve complexity in separate luma and chroma channel structures.
Decodes high dynamic range video using pre-computed color correction lookup tables for backward compatibility.
Extending control point intervals improves motion vector precision and reduces decoding complexity compared to standard corner-based affine prediction methods.