pub trait NodeMerging {
// Required method
fn should_merge(
&self,
s_n: &Cell<ImageNode>,
s_m: &Cell<ImageNode>,
e: &ImageEdge,
) -> bool;
}
Expand description
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.