Pixel Stream Generation for Lissajous Projection Synchronization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current Lissajous scanners face high processing power requirements and complex synchronization issues due to massive memory accesses and CPU loads, especially for high-resolution images and high frame rates, making it difficult to adapt pixel values on-the-fly for changed ambient lighting.
Innovation Solution
A method that determines the pixels to be displayed in each sub-interval and retrieves their values once for multiple sub-intervals, reducing memory accesses by forecasting sequences of the same pixel and using look-up tables to efficiently identify and retrieve pixel values, allowing for faster generation of pixel streams.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If current Lissajous scanning method is used with frame buffer synchronization, then correct pixel display according to mirror position is achieved, but processing power requirements and CPU load become excessively high
Solution Approach 1:
The patent pre-calculates and stores the sequence of pixel values in a buffer before the scanning process begins. This preliminary preparation eliminates the need for real-time calculations during scanning, significantly reducing CPU load and processing power requirements while maintaining accurate pixel display synchronization with the Lissajous pattern.
Solution Approach 2:
The patent dynamically generates the pixel stream sequence based on the specific Lissajous pattern parameters (frequencies, amplitudes, phase differences) and scan duration. This dynamic approach allows the system to adapt the pre-calculated pixel sequence to different scanning configurations without requiring complex real-time adjustments, optimizing processing efficiency for varying display requirements.
2Reliability
If frame buffer stores and retrieves pixels for Lissajous pattern, then pixel values match mirror position, but memory access complexity and processing time increase
Solution Approach 1:
The patent pre-calculates the complete sequence of pixel values corresponding to the Lissajous scan pattern before scanning begins. This pixel stream is stored in a buffer and simply read out during scanning, eliminating complex real-time memory access operations and significantly reducing processing time while ensuring accurate pixel-mirror position matching.
Solution Approach 2:
The patent creates a pre-ordered copy of the pixel data stream that mirrors the temporal sequence of the Lissajous scan. This copied pixel stream can be read sequentially from the buffer without complex memory addressing calculations, reducing both processing time and memory access complexity while maintaining accurate synchronization with the scanner position.
3Device complexity
If pixel values are predetermined and fed in stream, then synchronization complexity is reduced, but adaptability to changed ambient lighting is nearly infeasible
Solution Approach 1:
The patent implements a dynamic pixel stream generation system that can recalculate and update the pixel value sequence in real-time based on ambient lighting changes or other environmental factors. This dynamic capability allows the predetermined pixel stream approach to maintain low synchronization complexity while gaining the flexibility to adapt to changing display conditions.
Solution Approach 2:
The patent incorporates feedback mechanisms that monitor ambient lighting conditions and automatically adjust the pixel values in the stream accordingly. This feedback loop enables the system to maintain accurate color and brightness representation despite environmental changes, preserving adaptability while keeping the overall system complexity low through automated adjustments.
Data Source
AI summary
A method of generating a pixel stream from an image comprised of pixels which each have a pixel value. The method comprising storing the image in a memory; determining, for each of successive sub-intervals, that pixel that is to be displayed by a light beam within said sub-interval; for each of successive sequences of one or more successive sub-intervals for which the same pixel has been determined: retrieving the pixel value of said pixel from the memory once and appending the retrieved pixel value N times to the pixel stream. Further disclosed is a projection system using this method.


