Felzenswalb Segmentation

Felzenswalb segmentation algorithm looks appealing for my project since is fast, quite simple and boasts an example in which reflectance on a car surface does not affect the segmentation in a sigle region for a car. This last aspect is very interesting, considering the color distribution I found for the car colors, which are influenced (among the others) by reflectance factors.


I read Felzenswalb's article to understand what segmentation it applies exactly. It turned out that 2 different methods are applied, both graph based:

- GRID GRAPHS
- NEAREST NEIGHBOR GRAPH

I will describe them in class, the second one being the most appealig for my project.
It claims the use of an Approximate Nearest Neighbor (ANN) algorithm, which is referenced, but not explained (I will read the referenced article)

I took a look at code, downloadable for free from here, to understand which method of the two was implemented.
Ironically, none of them was exactly reproduced in the code. In fact, the program runs the Grid Graphs with an alteration in the graph weights computation.