Given an RGB value what would be the best way to find the closest match in the database?

user_171632 0
Viewed 22217

I have a rgb value and if it doesn't exist in the color table in my database I need to find the closest color. I was thinking of comparing all values and finding the difference(in red,green,and blue) then take the average. The lowest average deviation should be the closest color. There seems to me like there should be a better way. Any ideas?

colors sql algorithm
8 Answers

Comparing a color sample to the whole color list every time is probably not optimal. This can be optimized by putting the colors in the color list into a search tree. If you are comparing the color sample on its Red, Green and Blue (RGB) value, you would put the colors in the color list into a three dimensional search tree. The search tree could be created once and saved to a (json, xml) file or in a database. This may be worth it if speed is important, e.g. there are many points to compare.

  • Use a [k-d tree] with the R, G and B values 0-256 as X, Y, and Z coordinates1.
  • Or another type of nearest neighbour search.
user_4472330
Related