Dual clustering - Guberman ( Image Segmentation)

From Algorithm Wiki

Revision as of 09:37, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n \log n)$

Space Complexity

()

Description

Approximate?

Approximate

Approximation Factor:

Randomized?

No, deterministic

Model of Computation

Year

2012

Reference

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Dual_clustering_-_Guberman_(_Image_Segmentation)&oldid=47357"