Are there any open-source implementations of an graph-cut algorithm similar to that used for Photoshop's quick select tool? I'm researching for a personal project of making a GIMP tool\plugin similar to PS's tool, but I'm wondering if it's been done before.
A:
I'm not sure How exactly quick select works, but if i had to implement such task - my first starting approach would be to detect area of similar colors. For this one should:
- Convert RGB color space to HSV or HSL.
- Run edge detection algorithm on Hue values.
- Sample edge points to reduce data size.
- Run points clustering algorithm.
- Filter-out points which doesn't belongs to nearest cluster.
- Run convex hull algorithm to dismiss cluster inner edges.
I'm not saying that this approach will work, but still i think that this is an interesting idea to explore.
Good luck!
0x69
2010-09-18 17:55:34
Quite interesting. However, this is an combination of algorithms, and I was looking for implementations.
snostorm
2010-09-18 20:04:57