3 ms·
Very cool! :-) I built a similar search by color tool at 99designs and wrote a bit about how it works here: http://99designs.com/tech-blog/blog/2012/08/02/colo
by dhotson 13y ago
Very cool! :-)
I built a similar search by color tool at 99designs and wrote a bit about how it works here:
http://99designs.com/tech-blog/blog/2012/08/02/color-explorer/ http://99designs.com/tech-blog/blog/2012/08/02/color-explore...
TL;DR I'm using R-trees to do fast perceptual nearest neighbour color search.
OP, how are you doing it in this?
- mbarrett 13y agoNice walk through on your side. The color search mechanism is one that I am wanting to rehash. When the album update script is started, each album's color info is parsed and stored in the database. During the update, they are also assigned a color group which aligns with the color selection in the UI. In my implementation the nearest neighbor was trying to be determined when each album is parsed. Its an area that needs improved upon but that's basically how its setup. During the research phase, I referenced a php class for the color parsing, but ultimately modified it heavily for my use. http://www.phpclasses.org/package/5577-PHP-Get-the-most-used-colors-in-an-image.html http://www.phpclasses.org/package/5577-PHP-Get-the-most-used...
- sigil 13y agoNice. Have you considered putting the extracted (H,S,V) color space points into a postgis database? Querying and ordering with a KNN gist index may be even faster than bare R-Trees. http://workshops.opengeo.org/postgis-intro/knn.html http://workshops.opengeo.org/postgis-intro/knn.html