3D Look Up Table Multiple Stage Memory Loading
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current gamut mapping techniques, particularly using 3D look-up tables (LUTs), face significant computational overhead and loading time issues due to the need to store and interpolate vast numbers of color component values, which hinders efficient color representation across different display devices with varying gamuts.
Innovation Solution
Implementing a multiple stage memory loading technique for 3D LUTs, where output color component values are stored in subsets of memory elements using reduced most significant bits (MSBs) and offset values, allowing for concurrent loading and interpolation, thereby reducing the time required to initiate gamut mapping.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If a 3D LUT is used to store all color component values for gamut mapping, then mapping precision is improved, but memory loading time and computational overhead increase significantly
Solution Approach 1:
The patent divides the 3D LUT into multiple stages of memory loading, where color component values are loaded in successive stages rather than all at once. This segmentation allows the system to perform gamut mapping with progressively higher precision as more memory elements are loaded, resolving the contradiction between mapping precision and loading time.
Solution Approach 2:
The patent implements preliminary loading of color component values into memory elements before the actual gamut mapping operation. By pre-loading data in multiple stages, the system reduces the computational overhead and time required during the mapping process itself, while maintaining the ability to achieve high precision when needed.
2Measurement precision
If a 3D LUT stores all color component values, then gamut mapping accuracy is improved, but device complexity and computational overhead increase
Solution Approach 1:
The patent segments the computational process into multiple stages, where different subsets of color component values are processed in sequence. This reduces the computational overhead at any given time while maintaining the ability to achieve high accuracy through successive refinement, thereby reducing device complexity.
Solution Approach 2:
The patent allows the system to perform partial gamut mapping operations using only the necessary portion of the 3D LUT at any given time, rather than requiring all data to be loaded and processed simultaneously. This partial action approach reduces computational overhead while maintaining sufficient accuracy for most applications.
3Productivity
If color values are loaded into memory for gamut mapping, then mapping speed is improved, but memory capacity requirements increase
Solution Approach 1:
The patent segments the memory loading process into multiple stages, where color component values are loaded in progressively smaller or more targeted subsets. This allows the system to achieve fast gamut mapping speeds by loading only the necessary memory capacity at each stage, rather than requiring large memory capacity upfront.
Data Source
AI summary
A processor is configured to store color component values associated with a first subset of vertices of a three-dimensional (3-D) look up table (LUT) in a first subset of memory elements. The color component values are defined according to a destination gamut. A data select module is configured to access the color component values from the first subset of the memory elements concurrently with the processor storing color component values associated with a second subset of the vertices of the 3-D LUT in a second subset of the memory elements. The data select module is configured to access the color component values from the first and second subsets of the memory elements in response to the processor storing the color component values associated with the second subset of the vertices of the 3-D LUT in the second subset of the memory elements. This process can be extended to additional subsets.