pedgebasedragpruning

Synopsis

Description

pedgebasedragpruning cuts adjacency link in the gr_in between two regions that have at least one edge point on their boundary line given in the im_in. (A n edge point is a pixel in im_in with a valeur >0.)

This operator prevents a merge process to merge two regions that are separted by an edge.

Input

• rg_in: a region map.
• gr_in: a graph.
• im_in: an edge map.

Output

• gr_out: a graph.

Result

Returns the number of cuts.

Examples

Performs a bottom-up merging processus (without and with edges):

   pbinarization 112 255 tangram.pan a.pan
   plabeling 8 a.pan b.pan
   paddcst 1 b.pan c.pan
   prg2gr c.pan d.pan

   # without edges.
   psetcst 0 tangram.pan e.pan
   pmeanmerging -1 60 c.pan d.pan e.pan f1.pan g1.pan

   #with edges.
   pderiche 1 tangram.pan f.pan g.pan
   pvariancebinarization f.pan h.pan
   pedgebasedragpruning c.pan d.pan h.pan i.pan
   pmeanmerging -1 60 c.pan i.pan e.pan f2.pan g2.pan

See Also

C++ Prototype