in reply to Re^2: A data selection problem(in3D).
in thread A data selection problem(in3D).

It is true that the end points lose the darkest and lightest shades -- this is another point I was too lazy to addres, but assumed you could rectify this. That source image only has 200 unique colors in it, and a lot of them are non-gold shades of gray -- this image does not contain a rich color selection -- so interpolation into absent colors is necessary. And your first point (undesired patterns of brightness density) would be addressed by using brightness levels, instead of the densities of unique colors at a similar brightness, to group the "reference" colors (which I was also too lazy to do here).

Replies are listed 'Best First'.
Re^4: A data selection problem(in3D).
by BrowserUk (Patriarch) on Apr 08, 2017 at 02:55 UTC
    That source image only has 200 unique colors in it,

    Are we talking about the same "source image"?

    Because this is the one (linked from the root node) that I was referring to, and I find 63889 unique colors in it.

    I then discarded 1119 outliers to concentrate on the 62770 in the upper half of this image.

    With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
    Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
    "Science is about questioning the status quo. Questioning authority". The enemy of (IT) success is complexity.
    In the absence of evidence, opinion is indistinguishable from prejudice.
[reply]

In Section Seekers of Perl Wisdom