Image Segmentation Based on Efficient Graph and Feature
Defines a predicate for measuring the evidence for a boundary between two regions using a traditional graph-based representation of the image. Develops an efficient segmentation algorithm based on this predicate, and shows that although this algorithm makes greedy deci-sions, it produces segmentations that satisfy global properties. The algorithm runs in time nearly linear in the number of graph edges and is also fast in practice. Extracts feature to deal with all of the components, then calculates the distance of the components,which can solve the similar components which is not neighboring can not be classified.
NETL
NSTL
万方数据
维普
