Spaces:
Running
on
Zero
Running
on
Zero
update README
Browse files
README.md
CHANGED
@@ -12,42 +12,4 @@ license: apache-2.0
|
|
12 |
|
13 |
Documentation [https://ncut-pytorch.readthedocs.io/](https://ncut-pytorch.readthedocs.io/)
|
14 |
|
15 |
-
|
16 |
-
## NCUT: Nyström Normalized Cut
|
17 |
-
|
18 |
-
**Normalized Cut**, aka. spectral clustering, is a graphical method to analyze data grouping in the affinity eigenvector space. It has been widely used for unsupervised segmentation in the 2000s.
|
19 |
-
|
20 |
-
**Nyström Normalized Cut**, is a new approximation algorithm developed for large-scale graph cuts, a large-graph of million nodes can be processed in under 10s (cpu) or 2s (gpu).
|
21 |
-
|
22 |
-
## Gallery
|
23 |
-
TODO
|
24 |
-
|
25 |
-
## Installation
|
26 |
-
|
27 |
-
PyPI install, our package is based on [PyTorch](https://pytorch.org/get-started/locally/), presuming you already have PyTorch installed
|
28 |
-
|
29 |
-
```shell
|
30 |
-
pip install ncut-pytorch
|
31 |
-
```
|
32 |
-
|
33 |
-
[Install PyTorch](https://pytorch.org/get-started/locally/) if you haven't
|
34 |
-
```shell
|
35 |
-
pip install torch
|
36 |
-
```
|
37 |
-
## Why NCUT
|
38 |
-
|
39 |
-
Normalized cut offers two advantages:
|
40 |
-
|
41 |
-
1. soft-cluster assignments as eigenvectors
|
42 |
-
|
43 |
-
2. hierarchical clustering by varying the number of eigenvectors
|
44 |
-
|
45 |
-
Please see [NCUT and t-SNE/UMAP](compare.md) for a full comparison.
|
46 |
-
|
47 |
-
|
48 |
-
> paper in prep, Yang 2024
|
49 |
-
>
|
50 |
-
> AlignedCut: Visual Concepts Discovery on Brain-Guided Universal Feature Space, Huzheng Yang, James Gee\*, Jianbo Shi\*, 2024
|
51 |
-
>
|
52 |
-
> Normalized Cuts and Image Segmentation, Jianbo Shi and Jitendra Malik, 2000
|
53 |
-
>
|
|
|
12 |
|
13 |
Documentation [https://ncut-pytorch.readthedocs.io/](https://ncut-pytorch.readthedocs.io/)
|
14 |
|
15 |
+
We thank the Hugging Face team for providing free GPU for hosting this demo.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|