How to pick the most interesting color from an image?...

@Gargron Which average are you using? Just spit-balling but maybe bucketing the colourspace and picking the modal colour could work?

24 Jun 2020 at 11:59 | Open on mastodon.social

josef

@Gargron here's something i've seen used before, although this demo website seems a bit broken now https://gauguin.lunarlogic.io/

24 Jun 2020 at 11:59 | Open on mastodon.social

Hugo Gameiro

@Gargron I have came across this recently and it looks pretty cool: https://github.com/lokesh/color-thief

Haven't tested it but something like that looks pretty accurate and it has an API.

24 Jun 2020 at 12:02 | Open on masto.pt

Olie

@Gargron Might be worth looking around the source of something like wal. It's a bit duff at generating full colour schemes (they tend to just be a few shades of a single colour - 2 if you're lucky), but it's very good at picking out accent colours from images.

24 Jun 2020 at 12:02 | Open on mastodon.technology

halcy:icosahedron:

@Gargron take the median colour rather than the average

24 Jun 2020 at 12:07 | Open on icosahedron.website

[DATA EXPUNGED]

j@mastodon

@Gargron I guess you would have to work with saturation...

24 Jun 2020 at 12:20 | Open on mastodon.social

Zen

@Gargron this might help:

https://github.com/Dannvix/ColorTunes

24 Jun 2020 at 12:22 | Open on mastodon.social

Bluestarultor

@Gargron What you could do fairly efficiently is take the most prominent color:

1) Read bitmap into number array via hex
2) Sort
3) Split into 8 equal array chunks (enough for nearly any album cover)
4) Average each chunk
5) Compare in pairs
6) Discard least-like pairs
7) Choose the first index from the highest number chunk of last pair (they should be side by side)
8) This will be from the middle of the largest color block

You now have a representative color from the cover.

@Gargron What you could do fairly efficiently is take the most prominent color:

1) Read bitmap into number array via hex
2) Sort
3) Split into 8 equal array chunks (enough for nearly any album cover)
4) Average each chunk
5) Compare in pairs
6) Discard least-like pairs
7) Choose the first index from the highest number chunk of last pair (they should be side by side)
8) This will be from the middle of the largest color block

Expand text...

24 Jun 2020 at 12:44 | Open on mastodon.social

Bluestarultor

@Gargron What you could do fairly efficiently is take the most prominent color:

1) Read bitmap into number array via hex
2) Sort
3) Split into 8 equal array chunks (enough for nearly any album cover)
4) Average each chunk
5) Compare in pairs (1/2, 2/3, 3/4...)
6) Discard least-like pairs
7) Choose the first index from the highest number chunk of last pair (they should be side by side)
8) This will be from the middle of the largest color block

You now have a representative color from the cover.

@Gargron What you could do fairly efficiently is take the most prominent color:

1) Read bitmap into number array via hex
2) Sort
3) Split into 8 equal array chunks (enough for nearly any album cover)
4) Average each chunk
5) Compare in pairs (1/2, 2/3, 3/4...)
6) Discard least-like pairs
7) Choose the first index from the highest number chunk of last pair (they should be side by side)
8) This will be from the middle of the largest color block

Expand text...

24 Jun 2020 at 12:45 | Open on mastodon.social

Dag Ågren ↙︎↙︎↙︎

@Gargron You can increase the saturation of the average colour, that might give interesting results.

24 Jun 2020 at 12:56 | Open on mastodon.social

muesli

@Gargron

I wouldn't use the average color, but the most dominant colors in an image. Also pre-cropping and edge detection may help here to center on the focused part of the image.

24 Jun 2020 at 12:57 | Open on mastodon.social

gudenau

@Gargron Try the most prominent color and use alpha to weight it?

24 Jun 2020 at 13:59 | Open on mastodon.technology

Robert

@Gargron no idea how to implement this as code, but maybe find the color with the highest difference in value between the lowest and highest of RGB? Like the most attractive would be something where one of the values is 255 and another is 0, and the least attractive would be any color where all three values are the same

24 Jun 2020 at 14:19 | Open on jorts.horse