You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+31-8Lines changed: 31 additions & 8 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -3,35 +3,57 @@
3
3
A Python implementation of an SN-Graph skeletonisation algorithm. Based on the article *SN-Graph: a Minimalist 3D Object Representation for Classification*[arXiv:2105.14784](https://arxiv.org/abs/2105.14784).
4
4
5
5
6
-

6
+

7
7
8
8
## Description
9
9
10
-
SN-Graph works by:
10
+
Given a binary image/volume representing a shape, SN-Graph works by:
11
11
12
-
1. Creating vertices as centres of spheres inscribed in the image, where one balances the size of the spheres with their coverage of the shape, and pariwise distances from one another.
12
+
1. Creating vertices as centres of spheres inscribed in the shape, where one balances the size of the spheres with their coverage of the shape, and pariwise distances from one another.
13
13
3. Adding edges between the neighbouring spheres, subject to a few common-sense criteria.
14
14
15
15
The resulting graph serves as a lightweight 1-dimensional representation of the original image, potentially useful for further analysis.
16
16
17
+
## Installation
18
+
19
+
```bash
20
+
pip install sn-graph
21
+
```
22
+
or
23
+
24
+
```bash
25
+
poetry add sn-graph
26
+
```
27
+
17
28
## Basic Usage
18
29
30
+
See notebooks [demo_sn-graph](notebooks/demo_sn-graph.ipynb) and [3d_demo](notebooks/3D_demo.ipynb) for 2D and 3D demo, respectively. Notebook [mnist_classification](notebooks/mnist_classification.ipynb) has some good stuff too!
0 commit comments