RGB Run-Length Compression for Jitter-Free Projection Scanning
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing projection systems experience jitter and require high processing power to synchronize RGB light beams with scanner movement, limiting high-resolution and high-frame-rate image display.
Innovation Solution
A method of generating a compressed data stream by extracting and encoding RGB color values according to a scan pattern, using run-length encoding to create smaller data packets that are synchronized with scanner movement, reducing bandwidth and processing requirements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a frame buffer is used to synchronize color values with scanner movement, then jitter is eliminated, but processing power requirements increase significantly
Solution Approach 1:
The patent divides the image data into multiple data packets, each containing color values for a specific time interval and scanner position range. This segmentation allows the system to process and transmit smaller chunks of data sequentially, reducing the peak processing power required compared to processing the entire frame buffer at once, while maintaining synchronization accuracy.
Solution Approach 2:
The patent performs preliminary organization of color values into time-synced data packets before transmission to the light source driver. By pre-structuring the data according to scanner position and time intervals, the system eliminates the need for complex real-time buffer management and random memory access, significantly reducing processing power requirements while ensuring jitter-free synchronization.
2Reliability
If a frame buffer buffers and retrieves scattered memory locations, then synchronization is achieved, but pixel feeding rate is limited
Solution Approach 1:
The patent reorganizes scattered memory locations into sequential data packets in advance, according to the scan pattern and time intervals. This preliminary action converts random memory access patterns into sequential access, dramatically increasing the pixel feeding rate while maintaining synchronization, as the buffer no longer needs to perform scattered reads during active display.
Solution Approach 2:
The patent implements a dynamic data packet structure that adapts to the scanner's movement and the image's characteristics. By organizing data packets to match the actual scan pattern and timing, the system optimizes the feeding rate for each specific scenario, overcoming the static limitations of traditional frame buffer approaches.
3Device complexity
If uncompressed RGB stream is continuously fed to light source driver, then simplicity is maintained, but bandwidth requirements increase
Solution Approach 1:
The patent extracts only the necessary color values for each time interval and scanner position into separate data packets, rather than transmitting the complete uncompressed RGB stream. This extraction reduces the data bandwidth requirement while maintaining system simplicity, as the light source driver receives precisely the data it needs in the correct sequence without unnecessary overhead.
4Measurement precision
If high resolution and high frame rate are displayed, then image quality improves, but processing power requirements increase
Solution Approach 1:
The patent segments high-resolution image data into multiple time-synced data packets, each handling a portion of the total pixels for a specific time interval. This segmentation allows the processing system to handle high resolution and high frame rate requirements by distributing the processing load across multiple smaller, manageable packets rather than processing the entire high-resolution frame at once, thereby reducing peak processing power requirements.
Data Source
AI summary
A method of generating a compressed data stream from an uncompressed data stream with red, green and blue sub-streams of red, green and blue colour values of an image, comprising, for each of a number of sub-interval which together form a time interval: Determining, in each sub-stream, at least N−1 sets of successive equal colour values and run-lengths indicating the numbers of colour values in the sets; and generating a data packet composed of one colour value from each set and their respective run-lengths; which data packet forms the compressed data stream for said time interval. Further disclosed is a projection system using this method.