Example: barber
Normalized cuts and image segmentation - Pattern Analysis ...

Normalized cuts and image segmentation - Pattern Analysis ...

Back to document page

X u2A;v2B w–u;vƒ: –1ƒ The optimal bipartitioning of a graph is the one that minimizes this cut value. Although there are an exponential number of such partitions, finding the minimum cut of a graph is a well-studied problem and there exist efficient algorithms for solving it. Wu and Leahy [25] proposed a clustering method based

Download Normalized cuts and image segmentation - Pattern Analysis ...


Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries