I’m not sure where to post this question, so if it’s not in the right forum please move it, thank you.
My goal is to make a photomosaic. I already have made a script which makes a photomosaic (PHP). But it very slow because of the linear search through all images. I’m trying to make this process much quicker.
The bottleneck is matching the best picture with a part of the main picture. For example: I have to search which 3 images are closest to the color 34.234.128. (RGB). So I determine the distance between this color and the mean color of all images.
Now I’m searching how to improve this process, this is the reason I’m here. I’ve got some questions and maybe you got some suggestions/answers.
• What data-structure should I use and why? After searching online I found a solution called KD-tree. But I’m not sure this is the most efficient way. Maybe there are other methods more suited for my problem.
• Which language should I use with this data-structure. And what sort of database do you guys suggest?
Peter
My goal is to make a photomosaic. I already have made a script which makes a photomosaic (PHP). But it very slow because of the linear search through all images. I’m trying to make this process much quicker.
The bottleneck is matching the best picture with a part of the main picture. For example: I have to search which 3 images are closest to the color 34.234.128. (RGB). So I determine the distance between this color and the mean color of all images.
Now I’m searching how to improve this process, this is the reason I’m here. I’ve got some questions and maybe you got some suggestions/answers.
• What data-structure should I use and why? After searching online I found a solution called KD-tree. But I’m not sure this is the most efficient way. Maybe there are other methods more suited for my problem.
• Which language should I use with this data-structure. And what sort of database do you guys suggest?
Peter
