Group homogeneous texture blocks into clusters to inherit characteristic values, reducing memory space while maintaining compression efficiency.
Adapting entropy coding strategies to reference picture types resolves complexity trade-offs and improves compression efficiency in scalable video applications.
A low complexity algorithm reduces multiplication computations for DST-7 and DCT-8 video transforms using FFT relationships.
Reset flags align picture order count values across layers, resolving bitstream conformance issues when random access pictures are misaligned.
A circuit derives motion information and intra prediction samples for geometric partitioning mode decoding.
A constraint-modified selection system generates multiple candidate video encodings to optimize quality metrics for diverse target devices.
Pipelined chroma deblocking filter merges luma techniques to reduce color artifacts.
Block-based context selection unifies significance map and group flag coding via sub-block indices, reducing computational complexity.
A video encoder adjusts chroma quantization parameters using a low-fidelity mode offset to emulate 4:2:0 coding within 4:4:4 streams.
A microcode engine buffers compressed macro-blocks and reorders them into raster scan order before decoding.
Back channel messages estimate network bandwidth to adjust encoding parameters, mitigating packet loss and inconsistent video quality.
A video decoder requests reduced picture resolution from an encoder to lower processing complexity.
Dynamic motion vector precision adjusts symmetric motion vector difference mode settings to optimize video block encoding.
An adaptive encoding method detects scene transitions to determine preprocessing specifications based on network bandwidth.
A directional encoding method projects spherical video onto a plane to identify regions of interest based on head tracking data.
Information processing device encodes multiple subpictures and generates compact mapping metadata for the bitstream.
Partitioning coding blocks into non-rectangular regions and applying adaptive filtering reduces computational complexity while maintaining high visual quality.
Spatiotemporal sub-sampling techniques reduce computational complexity in motion compensated temporal analysis while maintaining filtering performance.
Decoding methods compute scaled subpicture positions via scale factors to resolve applicability limits in non-multiple unit scenarios.
Modifying slice headers to transform image slices into independently decodable sub-frames.
A video encoder selects quantization degrees for macroblocks using complexity estimates to manage bitrate.
Segmenting 33 directional modes into groups reduces filtering complexity while maintaining coding efficiency.
A video decoder selects candidate reference pictures based on minimum decoding time intervals to optimize motion prediction accuracy.
A video coding module generates personal parameters through user sensitivity training to tailor image encoding.
A bit group based interleaving process rearranges compressed video segments to enable parallel entropy decoding circuits.
A video encoding method detects abnormal distortion points in candidate prediction modes to calibrate mode costs for accurate selection.
Quantify intrinsic algorithm data transfer rates using spectral graph theory and Laplacian matrices.
Encoder derives luminance gradient values to generate chrominance final prediction images, reducing processing load while maintaining prediction accuracy.
A video processing system constructs an optimized motion vector prediction list using template matching costs to prioritize candidates.
Replacing outside samples across virtual boundaries prevents face seam artifacts while maintaining in-loop filtering coverage.
A phase information generator selects interpolation phases based on motion vector crossing pixels to produce accurate interpolation-pixels.
Segmenting the decoder into two parsing units doubles bitstream handling speed without increasing device cost or power consumption.
Deriving prediction pixel blocks via quadrant-specific spatial regions to resolve accuracy and complexity trade-offs in video coding.
A Stream Video Quality metric calculates video fidelity using decoded quantization parameters and compressed frame analysis without requiring original source footage.
Calculates quantization and zero efficiencies to select optimal coefficient handling in hybrid video streams.
The device prevents buffer overflow and image degradation by inserting key frames only when buffer occupancy exceeds thresholds or frame similarity remains low.
Adaptive resolution conversion resamples reference pictures to switch video representations, reducing bandwidth demand and latency without IDR resets.
A video coder selectively entropy encodes syntax elements as regular or bypass bins to manage throughput.
Regression process derives affine candidates from subblock motion data to enhance video block conversion accuracy.
A method inserts additional data into a video stream by selecting target pictures and transforming referring pictures using a lossless scheme.
A variable-rate step quantization method adjusts encoding steps dynamically based on parameter values to optimize perceptual image quality.
A dual compressed video stream architecture enables rapid frame reconstruction via secondary data streams when primary packets are lost.
Grouping greater-than-one flags into tuples reduces context-coded bin throughput and device complexity by allowing the decoder to infer flag values.
Effective coefficient flags guide scanning of segmented frequency bands in residual blocks.
Pre-built parameter dictionaries enable decoding of headerless H.264 video fragments, resolving recovery bottlenecks in digital forensics.
Context modeling selects predefined transforms for video blocks based on coding mode, reducing bandwidth demand for color-rich sequences.
A video encoder signals intra-prediction modes using context-based adaptive binary arithmetic coding mapped to modified indexes.
A video encoding method uses user-guided information to predict motion vectors for specific regions of interest.
Adjusting luma residual samples by bit-depth ratios resolves prediction inaccuracies when luma and chroma components differ in bit-depth.