Digital Video Signal Modification TRIZ Cases

An image processing apparatus selects compression algorithms based on similarity between consecutive frames.

Adaptive reshaping functions convert high dynamic range video to lower bit depths, resolving compression efficiency and image quality trade-offs.

A video coding system merges shared and parallel candidate list derivation into a single unified process to improve inter-prediction accuracy.

Video coder signals weighted prediction parameters for one reference picture list and determines the other based on equivalence.

Affine motion vector prediction estimates translational vectors from block control points to populate history-based predictor tables.

A motion vector coding method predicts residuals between hypotheses to reduce transmission overhead.

A video encoder divides frames into sub-picture blocks to select multiple reference pictures for motion compensation.

Variable non-square coding blocks adapt to local image characteristics for precise prediction signal generation.

A method segments intra prediction modes into candidate sets to reduce bit transmission during encoding.

A moving picture coding device derives inter prediction information candidates from neighboring blocks to select optimal motion vectors.

Modifies spacing between reference frames based on real-time loss rates, reducing bandwidth consumption while preserving streaming reliability.

Combining multiple predictors via weighted settings reduces parsing errors and computational complexity in HEVC coding.

A system on chip evaluates residual blocks using space domain metrics to skip unnecessary transformations, resolving complexity trade-offs in video compression.

A decoding method applies merge with motion vector difference to current picture referencing blocks.

A VDI agent determines encoding configurations using UI information to optimize motion vectors and reference frames for framebuffer data.

Signaling color value differences against predictor samples reduces bit usage for new palette entries while maintaining accurate reconstruction.

Segmenting NALU headers resolves the trade-off between compactness and adaptability by reducing overhead for common units while supporting 360 video coding.

A video coding method selects optimal intra-frame prediction modes from alternative sets derived from adjacent and parent coding unit references.

Selective luminance compensation on non-split blocks resolves encoding complexity while maintaining interlayer prediction accuracy.

Multiple SEI payload type entries signal relative processing orders to resolve syntax complexity while maintaining bitstream conformance.

Estimating output bits from intermediate data selects encoding parameters to maintain target bit rates without waiting for completed array counts.

A motion-compensated prediction apparatus maps reference pixels across polyhedral faces using spherical coordinates to determine target locations.

Truncating 4x4 RGB pixel cells into four colors preserves edges and critical gray pixels lost in standard JPEG compression.

Virtual boundary padding and prioritization eliminate face seam artifacts while maintaining coding efficiency in 360-degree video streams.

A video encoding system performs linear prediction of chrominance reference pixels using intra-predicted luminance data.

A division unit splits image data into multiple arrangements for parallel coding units to derive global motion vectors from finished preceding pictures.

A decoding apparatus parses transform skip and palette coding syntax elements based on defined dependency conditions.

A video processing method determines mapping relationships between color components to perform cross-component prediction.

A viewport bitstream splits video into tile-based fragments using distinct Group-of-Picture structures to enable selective rendering.

Compressing motion vectors from 4x4 to 16x16 units suppresses storage capacity increases in HEVC decoding.

An index allocation unit alternates reference image indexes between view and time directions to support flexible prediction patterns.

Dividing reference frames into lower quality base layers and enhancement data reduces network congestion and latency spikes during adaptive bitrate streaming.

A control unit adapts video frame flow by adjusting framerate and encoding quality based on real-time bandwidth measurements.

A DCT-based deblocking filter replaces weak and strong filtering in HEVC standards to reduce blocking artifacts.

A video encoder generates transform-coded correction signals by comparing original frames with reconstructed references to reduce prediction errors.

A motion estimation method uses partial sample matching to reduce computational complexity.

An image encoding device evaluates reference similarity to apply orthogonal transform only to specific prediction residual areas.

A video coding mechanism applies tailored scaling factors to non-dyadic blocks during residual transform processing.

Detects block statistics to disable cross-component filtering in smooth areas, reducing bit overhead and storage space.

A video stream protection device identifies data units by header information to selectively prohibit decoding of sensitive content.

Rounding motion vectors to integer precision and refining predictions using spatial gradients reduces memory access bandwidth for small video blocks.

A decoding method acquires a CIIP enable flag and parses a regular merge flag based on block size to generate prediction samples.

Compresses motion estimation distortion values via fixed-bit scaling, reducing memory bandwidth and computational complexity in video encoding.

Segmenting 35 intra prediction directions into groups and applying partial evaluation lowers processing complexity while maintaining coding efficiency.

A mode decision component estimates compression coding data to select video encoding modes without waiting for updated cumulative distribution function tables.

Conditional constraints on disparity vectors reduce memory usage and bitrates while maintaining coding performance.

An intra-prediction preprocessor generates candidate data from edge strength and angle range metrics to streamline encoding operations.

Segmenting modes into Most Probable and non-MPM groups resolves the trade-off between compression efficiency and device complexity.

Extracting spatial subsets from coded pictures creates parallel bitstreams that resolve the trade-off between transmission efficiency and decoding quality.