Digital Video Signal Modification TRIZ Cases

A video coding system generates composite depth and texture images to enable efficient compression of multi-view data.

Flipping palette index maps positions large pixel runs for efficient signaling, resolving quality deterioration in screen content encoding.

Compression tree references similar intra and predicted frames to reduce storage space without degrading image quality.

Introduces right shifts to lower internal bit-widths of gradient values, preventing precision loss while fully utilizing 32-bit hardware dynamic range.

Deriving current palette predictors from unused previous entries reduces bitrate while maintaining decoding accuracy.

A context modeling method determines flag models using neighboring block status and current block dimensions.

Threshold-based processing removes non-visible noise from saturated regions, preventing banding artifacts while maintaining visual quality.

Segmenting mixed images into attribute-specific blocks resolves the trade-off between compression efficiency and text resolution.

Separate auxiliary channels transmit predictor correlation data to mitigate drift without requiring packet loss estimation.

A video decoder constructs motion vector candidates with possible sign values and sorts them by cost to determine the respective motion vector difference sign.

A video coder skips illumination compensation syntax elements when advanced residual prediction weighting factors are non-zero.

An affine merge model derives candidate control point motion vectors from neighboring blocks to reconstruct current video frames.

A video encoding system selects distinct downsampling proportions for P and B frames to optimize data reduction.

Segmenting video frames into spatial tiles reduces data duplication by transmitting only selected regions instead of full streams.

A multi-processing unit calculates motion estimation for multiple macroblocks in parallel to reduce encoding time.

Adaptive coding tree unit depth determination reduces inter-frame predictive processing complexity.

Interpolates stereoscopic video frames via motion compensation and occlusion detection to resolve quality degradation during frame rate up-conversion.

Segmenting signal processing functions between a display and computing device reduces visual artifacts while maintaining system complexity.

Demultiplexer and multiplexer circuits route data through segmented buffers to reduce memory requirements while maintaining high throughput efficiency.

Auxiliary information extraction bridges missing regions and reference data, resolving input scarcity while preserving subjective image quality.

A video encoding system splits blocks into sub-blocks to code motion information independently.

Modifying compressed bitstreams with user-specific syntax elements enables efficient watermarking, avoiding the computational cost of full re-encoding.

An encoder derives motion vectors for sub-blocks to perform adaptive motion compensation.

A low resolution pipeline processes downscaled image data to generate initial motion vector candidates.

Dynamically switches atlas bitstreams based on viewer position, reducing data reception load while ensuring seamless viewport image reproduction.

Dynamic reference picture list construction enriches candidate sets with temporally aligned high-resolution images.

A decoding method derives intra prediction modes using an MPM list to enhance entropy coding efficiency.

A statistical multiplexing encoder adjusts video bitrate and buffer size based on content complexity.

A sub-bitstream extraction mechanism selects modes based on decoder capabilities to transmit only required texture and depth data.

A scalable video bit extraction method prioritizes refinement layers before temporal and spatial levels to maximize coding gain.

A second wireless channel transmits error information with lower latency than the primary video data path.

A video coding method uses pixel histograms to identify caption regions within image blocks.

Signaling picture order count most significant bits in a recovery point SEI message prevents incorrect referencing during multi-layer video decoding.

Segmenting image frames into portions with minimized boundary motion enables two separate encoders to operate independently without data copying.

A reference pixel unit generates secondary reference values from primary neighbors to support bi-directional intra prediction.

A video encoding method combines list 0 and list 1 motion parameters into a unified merge candidate for block prediction.

Decoding device determines enhanced temporal motion vector prediction modes using index information from bit streams to identify matching blocks.

A sub-bitstream extraction device determines separate texture and depth target view lists to optimize bandwidth usage.

Processing circuitry decodes profile information for image slices in a coded video bitstream to perform intra prediction.

Deriving candidate lists based on current block size reduces data volume in high-resolution image compression while maintaining quality.

A video encoding system measures complexity using video description length to adjust quantizer values for constant visual quality.

A reduced size context coefficient register stores only essential coefficients based on scan order distance to accelerate video decoding.

A decoding method filters boundaries between reconstructed blocks using variable strengths to suppress visual artifacts.

Shifts filter region boundaries relative to coding units to eliminate delayed filtering and reduce memory usage.