Construct a planar graph using Delaunay triangulation with the region centers as vertices.
The saliency operator is then applied to each edge of this graph, keeping only the salient ones and removing the rest.
The edge pruning on the graph effectively divides the original graph into a set of connected subgraphs. Each subgraph with more than two vertices is considered a text group.
pcannons
commented
10 years ago
This removes isolated regions:
Construct a planar graph using Delaunay triangulation with the region centers as vertices.
The saliency operator is then applied to each edge of this graph, keeping only the salient ones and removing the rest.
The edge pruning on the graph effectively divides the original graph into a set of connected subgraphs. Each subgraph with more than two vertices is considered a text group.