0

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.

dieki
  • 2,435
  • 5
  • 23
  • 29

2 Answers2

3

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:

  1. Convert RGB color space to HSV or HSL.
  2. Run edge detection algorithm on Hue values.
  3. Sample edge points to reduce data size.
  4. Run points clustering algorithm.
  5. Filter-out points which doesn't belongs to nearest cluster.
  6. 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!

Agnius Vasiliauskas
  • 10,935
  • 5
  • 50
  • 70
  • Quite interesting. However, this is an combination of algorithms, and I was looking for implementations. – dieki Sep 18 '10 at 20:04
  • I think it also stores a mask of the adjustments the user made to the selection (adding and removing parts from the selection). – Tara Apr 01 '20 at 12:21
0

There is a paper called "Paint Selection" published at Siggraph 2009. It describes a method very similar to Photoshop's quick select tool. You can access the paper from https://www.microsoft.com/en-us/research/wp-content/uploads/2009/08/PaintSelection_SIGGRAPH09.pdf

Christian Di Lorenzo
  • 3,562
  • 24
  • 33
Atilim Cetin
  • 73
  • 5
  • 3
    When linking to an external resource, please include a summary (even if brief) of the contents so that your answer remains useful if the linked resource ever disappears. – stkent Jan 01 '15 at 22:06