| 
    Superpixel Benchmark
    
   Superpixel benchmark, tools and algorithms. 
   | 
 
The magic part of the graph segmentation, i.e. s given two nodes decide whether to add an edge between them (i.e. merge the corresponding segments). See the paper by Felzenswalb and Huttenlocher for details. More...
#include <graph_segmentation.h>
  
 Public Member Functions | |
| GraphSegmentationMagic () | |
| Constructor.  More... | |
| virtual bool | operator() (const ImageNode &S_n, const ImageNode &S_m, const ImageEdge &e)=0 | 
| Decide whether to merge the two segments corresponding to the given nodes or not.  More... | |
The magic part of the graph segmentation, i.e. s given two nodes decide whether to add an edge between them (i.e. merge the corresponding segments). See the paper by Felzenswalb and Huttenlocher for details.
      
  | 
  inline | 
Constructor.
      
  | 
  pure virtual | 
Decide whether to merge the two segments corresponding to the given nodes or not.
| [in] | S_n | node representing the first segment | 
| [in] | S_m | node representing the second segment | 
| [in] | e | the edge between the two segments true if merge | 
Implemented in GraphSegmentationMagicThreshold.
 1.8.11