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].
test's EGBIS 

f1: 0 f2: 0 f3: 0 f4: 0 
Efficient GraphBased Image Segmentation We define a predicate for measuring the evidence for a boundary between two regions using a graphbased representation of the image. We then develop an efficient segmentation algorithm based on this predicate, and show that although this algorithm makes greedy decisions it produces segmentations that satisfy global properties. We apply the algorithm to image segmentation using two different kinds of local neighborhoods in constructing the graph, and illustrate the results with both real and synthetic images. The algorithm runs in time nearly linear in the number of graph edges and is also fast in practice. An important characteristic of the method is its ability to preserve detail in lowvariability image regions while ignoring detail in highvariability regions. List of uploaded results for 'EGBIS' algorithm

