The Prague Texture Segmentation Datagenerator and Benchmark - Algorithms
optimized
for

The concise description of algorithms contains hyperlinks to further information (author, algorithms details, BIB entry, WWW external page).
The algorithm features are: f1 = classification (supervised segmentation), f2 = hiearchy result (manual selection), f3 = known number of regions, f4 = [reserved].
rohit.iiith's
Graph based Segmentation
f1: 0
f2: 0
f3: 0
f4: 0
Graph based Segmentation

List of uploaded results for 'Graph based Segmentation' algorithm
   benchmark label version CS OS US ME NE O C CA CO CC I II EA MS RM CI GCE LCE BCE GBCE BGM SC SSC VD L AVI NVI NMI M ARI JC DC FMI WI WII NBDE
Colour [normal] Graph based Segmentation 40.32 14.75 24.05 26.74 24.43 25.10 45.01 57.45 69.00 74.51 31.00 7.58 65.86 55.81 8.90 68.46 17.54 8.99 40.34 31.79 69.00 64.12 61.80 18.83 69.96 7.27 21.14 71.82 16.27 57.53 53.34 68.06 69.35 61.84 79.58 8.43