find largest cluster?

Given a list of RGB (or other triple) colours,
rgb0, rgb1... rgbN I would like to be able
to detect what the largest "common" colour.

I think this would need to be within a tolerance
(e.g. from a list of 10, 4 are identical
within +- 2 in each channel).

There are some obvious nested loop
algorithms, but they're very inefficient
(essentially form and calculate all permutations
of the list).

Is this a standard problem, or does
anyone have an ah-hah algorithm?

BugBear
.

Relevant Pages

  • Re: find largest cluster?
    ... rgb0, rgb1... ... rgbN I would like to be able ... to detect what the largest "common" colour. ... I think this would need to be within a tolerance ...
    (sci.image.processing)
  • Re: find largest cluster?
    ... rgb0, rgb1... ... rgbN I would like to be able ... to detect what the largest "common" colour. ...
    (sci.image.processing)
  • Re: find largest cluster?
    ... rgb0, rgb1... ... rgbN I would like to be able ... to detect what the largest "common" colour. ... the lists will be small ...
    (sci.image.processing)