Enlarged reference blocks reconstruct uncovered points, eliminating gaps between projected blocks while maintaining continuous coverage across the entire image.
Dividing video frames into macroblocks creates wave front groups that reduce processing cycles and complexity.
A sample adaptive offset block adjusts decoded image data using edge and band parameters derived from rate-distortion costs.
A transmission device divides encoded content into segments and routes them through multiple uploaders and networks to a distribution unit.
Segmenting mode determination into independent stages allows partial hardware remodeling to comply with new video standards.
A rate-distortion optimization model trained on structural similarity indices processes video sequences to improve compression performance.
Derives chroma quantization parameters from luma values using adaptive bias to resolve limited flexibility in HEVC compression efficiency.
Partitioning video signals into hierarchical tiles and slices reduces data amounts while maintaining compression performance.
A depth map coding method selects predetermined patterns using boundary neighboring samples to reconstruct coding units with single depth sample values.
A video encoding method divides image blocks into sub-blocks using rectangular patterns for motion compensation.
Extending PSAO parameter ranges enables flexible offset values for video picture data.
Dynamic bin adjustment for residual coefficients reduces transmission costs while maintaining high-resolution image quality.
Prioritizes chroma intra prediction modes using luma references to reduce data volume and storage costs.
An encoder-aware temporal filter aligns P-frame blocks with neighboring reference frames to optimize inter-frame prediction.
A video distribution system postpones bitrate transitions until detected scene cut boundaries to maintain playback continuity.
Dynamic codeword allocation adjusts prediction indices based on neighboring block statistics, resolving fixed allocation inefficiencies in 3D-HEVC depth coding.
A deblocking filter stores blocks in intermediate memory to process pixel data sequentially.
A video inter prediction method uses angle index values to map dividing line orientations in geometrical partitioning mode.
Extracts video frame identifiers into packet headers to enable network device processing without payload access.
Partitioning coding units into oblong prediction units improves reference block matching accuracy, resolving H.265/HEVC square unit restrictions.
Layered bitstreams resolve high latency and bandwidth waste in adaptive streaming by enabling instant track switching without segment re-fetches.
Dynamic tree splitting controls video coding block partitioning to resolve bitrate reduction and picture quality preservation trade-offs.
Logarithmic luminance scaling reduces CCLM memory usage while maintaining prediction accuracy.
A state machine determines quantization shifting offsets for transform coefficients in video blocks.
A split framebuffer encoding method divides video frames into child buffers for independent processing.
Dividing largest coding units into parallel motion estimation regions enables independent processing streams for merge and skip modes.
Video encoders determine illumination compensation parameters using spatially neighboring samples to resolve bitstream overhead trade-offs.
Decoupling arithmetic decoding from neural network modules eliminates serial bottlenecks, achieving a tenfold speed-up while maintaining compression efficiency.
Computes device-specific bitrates to encode and chunk audio video content, resolving bandwidth versus compatibility trade-offs.
A video decoder determines profile compatibility for still pictures in bitstreams.
Classifying pixels by orientation enables adaptive filtering that removes compression artifacts while preserving edge sharpness.
Region-based context indexing balances coding precision against device complexity.
A video decoding apparatus determines adjacent pixel values outside slice boundaries using horizontal replication for adaptive loop filtering.
A decoding unit generates a first quantizing matrix from scaling list data to support diverse transform block sizes.
A decoding apparatus generates reference picture lists based on current picture flags to restore blocks using derived motion information.
Affine motion compensation reduces coding data requirements by deriving block parameters from neighboring spatial data.
Writes compressed pixel data to a local cache to reduce system memory bandwidth utilization and conserve power during display refresh cycles.
Autonomously deriving cross-component intra prediction modes from neighboring chroma samples reduces bitrate while maintaining decoding accuracy.
A video encoding device distributes computational load across multiple encoders to process high-definition images.
Segmenting video into hierarchical layers adapts quality to network conditions without re-encoding.
Segmenting reference pictures into temporal layers reduces memory consumption while maintaining compression performance in video codecs.
Segmenting blocks into reusable sub-blocks reduces computational energy consumption and processing time while maintaining accurate cost measurement precision.
A processing apparatus loads partial reference frame regions into a second memory to encode video coding units.
Adaptive reference frame selection mitigates frame loss impact while optimizing bandwidth utilization in resilient signal encoding.
A websocket module establishes a persistent transport layer connection to transmit RTP packets for real-time video playback directly within the web browser.
Groups transform coefficients into blocks for optimized scanning to reduce bit rates in high-resolution image encoding.
Coding section processes coefficient data in parallel across coding tree unit lines with controlled timing delays.
Colored pixel regions encode timecode directly within video frames, eliminating computational overhead from OCR processing.
A long-term reference picture indicator manages video coding references using absolute Picture Order Count least significant bits.