Name
Abstract | ||
|---|---|---|
We show how an image can, in principle, be described by the tangles of the graph of its pixels. The tangle-tree theorem provides a nested set of separations that efficiently distinguish all the distinguishable tangles in a graph. This translates to a small data set from which the image can be reconstructed. The tangle duality theorem says that a graph either has a certain-order tangle or a tree-structure witnessing that this cannot exist. This tells us the maximum resolution at which the image contains meaningful information. |
Year | Venue | Field |
|---|---|---|
2016 | arXiv: Combinatorics | Graph,Discrete mathematics,Tangle,Combinatorics,Small data,Duality (mathematics),Nested set model,Pixel,Mathematics |
DocType | Volume | Citations |
Journal | abs/1603.06652 | 2 |
PageRank | References | Authors |
0.41 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Reinhard Diestel | 1 | 452 | 68.24 |
| Geoff Whittle | 2 | 471 | 57.57 |