# US 12,731,301 B2 · Stable and discernable mapping of categorical data to colors for graphical display > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 12,731,301 B2 - Document ID: US12731301B2 - Status: Granted - Kind: B2 - Application number: 18/374,571 - Filed: 2023-09-28 - Published: 2025-04-03 - Granted: 2026-09-08 - Earliest claimed: 2023-09-28 - Assignees: CrowdStrike, Inc. - Applicants: Crowdstrike, Inc. - Inventors: Søren Skovsbøll - Web page: https://patentgrep.com/patent/US12731301B2 ## CPC - G06T 11/10: Texturing; Colouring; Generation of textures or colours (retouching, inpainting or scratch removal G06T5/77) - G06T 11/26: Drawing of charts or graphs - G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL ## Abstract Data is received. Each datum therein has one of a plurality of categorical values associated with a categorical variable. Each datum is deterministically mapped to a respective one of a plurality of colors in a color space based on its categorical value. The color to which each datum is deterministically mapped is then transformed to yield a minimum threshold separation between the respective colors. A graphical representation comprising the color to which each datum is respectively deterministically mapped, and as transformed to yield the minimum threshold separation between the respective colors, is displayed. ## Claims ### Claim 1 A computer-implemented method, comprising: repeatedly receiving data, in which each datum therein has one of a plurality of categorical values associated with a categorical variable; for each and every repetition of receiving data: always mapping the categorical value in each datum therein to a respective, same, unique one of a plurality of colors in a color space, hereinafter the “respective, same, unique color to which the categorical value in each datum is always mapped”, by: providing at least a portion of the categorical value in each datum as a hash key to a same hashing function that is used for the each and every repetition of receiving data; generating via the same hashing function a hash value based on the hash key; and mapping the hash value to a respective, unique, one of a plurality of colors in a color space; and transforming the respective, same, unique color to which the categorical value in each datum is always mapped to yield a minimum threshold separation between the respective colors; and displaying a graphical representation of the data, the graphical representation comprising the respective, same, unique, color to which the categorical value in each datum is always mapped and as transformed to yield the minimum threshold separation between the respective colors. ### Claim 2 (depends on 1) The computer-implemented method of claim 1, wherein mapping the hash value to the respective, unique, one of the plurality of colors in the color space comprises mapping the hash value to one or more parameters of the respective, unique, one of the plurality of colors in the color space. ### Claim 3 (depends on 2) The computer-implemented method of claim 2, wherein mapping the hash value to one or more parameters of the respective, unique, one of the plurality of colors in the color space, comprises mapping the hash value to a perceptual lightness parameter and parameters that represent the colors red, green, blue and yellow, according to a CIELAB color space model. ### Claim 4 (depends on 3) The computer-implemented method of claim 3, wherein mapping the hash value to one or more parameters of the respective, unique, one of the plurality of colors in the color space, comprises mapping the hash value to one or more parameters according to a CIELUV color space model for human perceptual uniformity of colors. ### Claim 5 (depends on 4) The computer-implemented method of claim 4, wherein mapping the hash value to the one or more parameters of the respective, unique, one of the plurality of colors in the color space, comprises mapping the hash value to hue, chroma, and luminance parameters of a cylindrical color space model in accordance with a human perception of color. ### Claim 6 (depends on 1) The computer-implemented method of claim 1, wherein transforming the respective, same, unique color to which the categorical value in each datum is always mapped to yield a minimum threshold separation between the respective colors comprises adjusting a location of at least one of the respective, same, unique colors in the color space to provide a separation between the locations of the at least one of the respective, same, unique colors and another one of the respective, same, unique colors in the color space sufficient to yield the minimum threshold separation between the respective colors. ### Claim 7 A computing system, comprising: one or more processors; memory storing computer-executable instructions that, when executed by the one or more processors, cause the one or more processors to perform operations comprising: repeatedly receiving data, in which each datum therein has one of a plurality of categorical values associated with a categorical variable; for each and every repetition of receiving data: always mapping the categorical value in each datum therein to a respective, same, unique one of a plurality of colors in a color space, hereinafter the “respective, same, unique color to which the categorical value in each datum is always mapped”, by: providing at least a portion of the categorical value in each datum as a hash key to a same hashing function that is used for the each and every repetition of receiving data; generating via the same hashing function a hash value based on the hash key; and mapping the hash value to a respective, unique, one of a plurality of colors in a color space; and transforming the respective, same, unique color to which the categorical value in each datum is always mapped to yield a minimum threshold separation between the respective colors; and displaying a graphical representation of the data, the graphical representation comprising the respective, same, unique color to which the categorical value in each datum is always mapped and as transformed to yield the minimum threshold separation between the respective colors. ### Claim 8 (depends on 7) The computing system of claim 7, wherein mapping the hash value to the respective, unique, one of the plurality of colors in the color space comprises mapping the hash value to one or more parameters of the respective, unique, one of the plurality of colors in the color space. ### Claim 9 (depends on 8) The computing system of claim 8, wherein mapping the hash value to one or more parameters of the respective, unique, one of the plurality of colors in the color space, comprises mapping the hash value to a perceptual lightness parameter and parameters that represent the colors red, green, blue and yellow, according to a CIELAB color space model. ### Claim 10 (depends on 8) The computing system of claim 8, wherein mapping the hash value to one or more parameters of the respective, unique, one of the plurality of colors in the color space, comprises mapping the hash value to one or more parameters according to a CIELUV color space model for human perceptual uniformity of colors. ### Claim 11 (depends on 10) The computing system of claim 10, wherein mapping the hash value to one or more parameters of the respective, unique, one of the plurality of colors in the color space, comprises mapping the hash value to hue, chroma, and luminance parameters of a cylindrical color space model in accordance with a human perception of color. ### Claim 12 (depends on 7) The computing system of claim 7, wherein transforming the respective, same, unique color to which the categorical value in each datum is always mapped to yield a minimum threshold separation between the respective colors comprises adjusting a location of at least one of the respective, same, unique colors in the color space to provide a separation between the locations of the at least one of the respective, same, unique colors and another one of the respective, same, unique colors in the color space sufficient to yield the minimum threshold separation between the respective colors. ### Claim 13 One or more non-transitory computer-readable media storing computer-executable instructions for an event query host that, when executed by one or more processors, cause the one or more processors to perform operations comprising: repeatedly receiving data, in which each datum therein has one of a plurality of categorical values associated with a categorical variable; for each and every repetition of receiving data: always mapping the categorical value in each datum therein to a respective, same, unique one of a plurality of colors in a color space, hereinafter the “respective, same, unique color to which the categorical value is each datum is always mapped”, by: providing at least a portion of the categorical value in each datum as a hash key to a same hashing function that is used for the each and every repetition of receiving data; generating via the same hashing function a hash value based on the hash key; and mapping the hash value to a respective, unique, one of a plurality of colors in a color space; and transforming the respective, same, unique color to which the categorical value in each datum is always mapped to yield a minimum threshold separation between the respective colors; and displaying a graphical representation of the data, the graphical representation comprising the respective, same, unique color to which the categorical value in each datum is respectively always mapped and as transformed to yield the minimum threshold separation between the respective colors. ### Claim 14 (depends on 13) The one or more non-transitory computer-readable media of claim 13, wherein mapping the hash value to the respective, unique, one of the plurality of colors in the color space, comprises mapping the hash value to one or more parameters of the respective, unique, one of the plurality of colors in the color space. ### Claim 15 (depends on 14) The one or more non-transitory computer-readable media of claim 14, wherein mapping the hash value to one or more parameters of the respective, same, unique one of the plurality of colors in the color space, comprises mapping the hash value to a perceptual lightness parameter and parameters that represent the colors red, green, blue and yellow, according to a CIELAB color space model. ### Claim 16 (depends on 14) The one or more non-transitory computer-readable media of claim 14, wherein mapping the hash value to one or more parameters of the respective, unique, one of the plurality of colors in the color space, comprises mapping the hash value to one or more parameters according to a CIELUV color space model for human perceptual uniformity of colors. ### Claim 17 (depends on 13) The one or more non-transitory computer-readable media of claim 13, wherein transforming the respective, same, unique color to which the categorical value in each datum is always mapped to yield a minimum threshold separation between the respective colors comprises adjusting a location of at least one of the respective, same, unique colors in the color space to provide a separation between the locations of the at least one of the respective, same, unique colors and another one of the respective, same, unique colors in the color space sufficient to yield the minimum threshold separation between the respective colors.