Color Recipe Database Redundancy Reduction via Hue Merging
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing color recipe determination systems are inefficient due to redundant data sets in databases, leading to a large number of variants not being covered, and users face difficulties in finding suitable color recipes that result in the desired color tone, especially when applied to different substrates and processes.
Innovation Solution
A method and system that utilize a database with a unique color recipe identification code and hue identification code, where data sets with the same color tone or recipe are linked, and a computer program searches for the best match within a predetermined tolerance, reducing redundant data and increasing the chances of finding a suitable color recipe for a target application, substrate, and desired color.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If a database contains numerous redundant data records for the same or similar color formulations, then the database appears comprehensive, but the number of covered variants relative to record count decreases and data efficiency deteriorates
Solution Approach 1:
The patent merges multiple data records that represent the same or perceptually identical hues into a single consolidated record. The system identifies redundant records by comparing hue values within a tolerance threshold (ΔE ≤ 0.5) and combines their associated color formulation information, substrate data, and application method details into one unified record, thereby reducing database size while maintaining comprehensive coverage.
Solution Approach 2:
The patent creates a universal hue identification system that can match color formulations across different substrates and application methods. By using standardized hue values and tolerance-based matching, a single color formulation record can serve multiple purposes across various printing applications, increasing the versatility and coverage efficiency of the database.
2Reliability
If the database contains many redundant records with similar information, then data completeness is maintained, but the time and computational resources required to search and process the database increase
Solution Approach 1:
The patent extracts and removes redundant duplicate records from the database while preserving the essential color formulation information. By identifying and eliminating records that represent the same hue within the tolerance threshold, the system reduces the total number of records that need to be searched, thereby decreasing processing time while maintaining data completeness through the consolidated records.
Solution Approach 2:
The patent performs preliminary consolidation of redundant records during database maintenance or initialization, before actual color formulation searches are conducted. This pre-processing step organizes the data structure and eliminates redundancies in advance, so that subsequent search operations work with an optimized, smaller dataset, reducing search time for all future queries.
3Measurement precision
If nearly identical hue values are stored as separate records, then measurement precision is maintained, but the human eye's inability to distinguish minute differences creates redundancy
Solution Approach 1:
The patent changes the parameter threshold for hue differentiation by introducing a tolerance value (ΔE ≤ 0.5) that aligns with human visual perception limits. Instead of treating all hue differences as distinct, the system rounds or groups hue values that fall within this tolerance threshold, effectively reducing the number of distinguishable hue categories to match human perception capabilities and simplifying the database structure accordingly.
Data Source
AI summary
The invention relates to a system and a method for ascertaining a color recipe, having the steps of: a) providing a database with a plurality of data sets, b) specifying a target application method, a target substrate, and a desired target hue by means of a user, c) searching the database using a computer program, and d) displaying stored information relating to the color recipe of at least one data set if found. The database for at least one hue comprises at least two different respective data sets, each of which comprises the same hue identification code but different substrates and/or application methods, and different color recipes, and the database for at least one color recipe comprises at least two different respective data sets, each of which comprises the same color recipe identification code but different substrates and/or application methods, and the resulting hue, wherein i) at least 90% of the data sets with different hues contain a respective different hue identification code than the other data sets, and/or ii) at least 90% of the data sets with different color recipes contain a respective different color recipe identification code than the other data sets.