Hi all,

I'm actually working on a project where I need to grab the pixels from a webcam and turn it to kind of "8 colors lo-fi screen".

Basically I have the eight colors in an array and I'm comparing pixel by pixel the camera data, in order to find the closest color of the array in each pixel.

I can't figure out how to find the color value of a color.

I tried to make this, getting distance value, for each pixel and each color in the array, and get the tiniest one at the end, but the result is kind of weird.

Any solution ?

I hope to be clear.

Martial


Code:

int compare( int colour1, int colour2 ) 
{

  int currR = (colour1 >> 16) & 0xFF; 
  int currG = (colour1 >> 8) & 0xFF;
  int currB = colour1 & 0xFF;

  int currR2 = (colour2 >> 16) & 0xFF; 
  int currG2 = (colour2 >> 8) & 0xFF;
  int currB2 = colour2 & 0xFF;

  int distance  = 0;
  distance += Math.pow(currR - currR2, 2);
  distance += Math.pow(currG - currG2, 2);
  distance += Math.pow(currB - currB2, 2);
  return distance ;
} 

Get the source here : http://www.164-prod.com/lab/8colors/eightColorProto.pde

Thanks !

Martial

also:

http://processing.org/reference/dist_.html

there's a built-in distance method, which will save you 4 lines of code.

i also think that given your target palette there'll be a faster way of working out the target colour for each pixel, one that doesn't need you to check 8 values every time. basically if your r, g or b component is > 128 then map it to FF, if it's less map it to 00. your target palette is the corners of the colour cube so you just need to work out which octant your source colour is in and then map it to the corner. kind of a specialised solution though, won't work if you change the palette.