Dithering Device Spatiotemporal Mask Generation Storage Optimization

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Display devices face challenges in maintaining picture quality when image data exceeds the bit-depth output capabilities, leading to deterioration, which existing dithering methods fail to adequately address efficiently.

Innovation Solution

A dithering device that includes a controller, random number generator, dithering mask generator, and applier, using count data to generate and apply dithering masks based on frame, row, and column periods, performing n-bit dithering to reduce noise and optimize storage space.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If traditional dithering methods are used to reduce picture quality deterioration, then picture quality is improved, but storage space consumption increases

Engineering Contradiction:
Improvepicture qualityVSAvoidstorage space
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

The patent segments the dithering process into three independent stages: frame period dithering, row period dithering, and column period dithering. Each stage uses a separate random number generator and stores only the necessary random numbers for that specific period, rather than storing all possible random numbers simultaneously. This segmentation reduces storage space requirements while maintaining picture quality enhancement.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent generates and stores random numbers in advance for each period (frame, row, column) before they are needed for dithering operations. The random numbers are pre-generated and stored in dedicated memory spaces, allowing the dithering process to proceed efficiently without requiring large amounts of storage space during actual image processing.

Inventive Principle:
Principle #10Preliminary action

2Manufacturing precision

If multiple random numbers are stored for different periods, then dithering accuracy is improved, but device complexity increases

Engineering Contradiction:
Improvedithering accuracyVSAvoidstorage structure
Core Design Contradiction:
Manufacturing precisionVSDevice complexity

Solution Approach 1:

The patent divides the random number storage structure into three separate, manageable segments: frame period random number storage, row period random number storage, and column period random number storage. Each segment handles only its specific period's random numbers, simplifying the overall storage architecture compared to a single large storage structure that would need to manage all periods simultaneously.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent implements a universal random number generation framework that can serve multiple periods (frame, row, column) through a single random number generator. The same generator mechanism is reused for different periods, with only the storage and selection logic varying, thereby reducing device complexity while maintaining dithering accuracy across all periods.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Data Source

PatentUS20240386832A1Dithering device
Publication Date: 2024.11.21 SAMSUNG ELECTRONICS CO LTD
  • US20240386832A1 patent drawing
  • US20240386832A1 patent drawing
  • US20240386832A1 patent drawing

AI summary

A dithering device configured to count a frame, a row, and a column of input image data based on an enable signal and generate count data, generate a plurality of random numbers based on a first seed, store a first random number to a third random number selected based on the count data, among the plurality of random numbers, the first random number corresponding to a frame period associated with the frame, the second random number corresponding to a row period associated with the row, and the third random number corresponding to a column period associated with the column, generate a dithering mask for n-bit dithering (where n is a positive integer) using a single random number, among the first random number to the third random number, as a second seed, and apply the dithering mask to the input image data to perform the n-bit dithering.