Color Chart Sequence Optimization Using Weighted Vector Minimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for arranging colors in a sequence are subjective, time-consuming, and lack reproducibility, especially when dealing with colors having small variations in multiple dimensions, and fail to efficiently eliminate duplicates in color documentation.
Innovation Solution
A process that assigns colors positions in a three-dimensional color space, calculates color and direction difference values, and arranges them to minimize overall sum of these values, using weight factors to optimize the sequence, eliminating the need for subjective human perception.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If colors are arranged using existing three-dimensional color space systems, then colors can be positioned in a multi-dimensional space, but there is no guidance on how to convert them to a one-dimensional sequence
Solution Approach 1:
The patent applies dimensionality reduction by projecting three-dimensional color space coordinates (L*, a*, b*) onto a one-dimensional sequence through a mathematical transformation function. This converts the multi-dimensional color positioning problem into a linear ordering problem while preserving the essential color relationships, enabling both 3D spatial arrangement and 1D sequential ordering.
2Reliability
If visual perception by test panels is used to determine color sequence, then subjective color perception can be captured, but the process consumes a lot of time and has poor reproducibility
Solution Approach 1:
The patent replaces the mechanical human visual perception system with an automated computational system. Instead of relying on test panels to subjectively evaluate and rank colors, the invention uses mathematical algorithms to calculate color differences and determine sequences objectively, eliminating time-consuming human evaluation while maintaining or improving reliability through consistent, reproducible calculations.
Solution Approach 2:
The color ordering system performs self-evaluation through automated calculation of color differences using standardized formulas. The system independently determines the optimal sequence without requiring external human judgment, making the process self-sufficient, rapid, and highly reproducible across different applications.
3Ease of manufacture
If colors are spaced by integral multiples of a preselected color difference value, then a systematic arrangement can be achieved, but the process is not suitable for colors with random color difference values
Solution Approach 1:
The patent transforms the rigid parameter constraint of integral multiples into a flexible continuous parameter system. By using calculated color difference values based on actual color measurements and standardized difference formulas, the system can accommodate any color difference magnitude, including random and irrational values, while maintaining systematic ordering through mathematical ranking.
4Reliability
If duplicate colors from different manufacturers are included in documentation, then complete manufacturer coverage is achieved, but documentation size and production cost increase
Solution Approach 1:
The patent extracts and identifies duplicate colors from multi-manufacturer documentation by calculating color differences between samples. When colors fall below a specified difference threshold, they are identified as duplicates and can be removed or consolidated, reducing documentation size while preserving all perceptually distinct colors from all manufacturers.
Data Source
AI summary
The invention relates to a process for arranging a plurality of colours or coloured objects in a defined sequence so that each colour or coloured object has at least one neighbouring colour or coloured object, comprising the steps of a) assigning all colours or coloured objects a position in an at least two-dimensional colour space, b) assigning all neighbouring colours or coloured objects a colour difference value corresponding to the length of a vector connecting the neighbouring colours in the colour space, c) assigning a direction to every vector in the colour space connecting two neighbouring colours or coloured objects, d) arranging the sequence of colours or coloured objects in such a way that the overall sum of i. all colour difference values over the sequence and ii. all direction difference values of two consecutive vectors is minimized, and wherein a weight factor x is assigned to the sum of all colour difference values and a weight factor y is assigned to the sum of all direction difference values of two consecutive vectors prior to minimization of the overall sum, and wherein at least one of x and y is not zero.