### Abstract

Let a point cloud be a noisy dotted image of a graph on the plane. We present a new fast algorithm for reconstructing the original graph from the given point cloud. Degrees of vertices in the graph are found by methods of persistent topology. Necessary parameters are automatically optimized by machine learning tools.

Original language | English |
---|---|

Pages (from-to) | 19-22 |

Number of pages | 4 |

Journal | Image-A: Applicable Mathematics in Image Engineering |

Volume | 3 |

Issue number | 5 |

Publication status | Published - 15 Mar 2013 |

### Bibliographical note

This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 International License## Fingerprint Dive into the research topics of 'Reconstructing persistent graph structures from noisy images'. Together they form a unique fingerprint.

## Cite this

Chernov, A., & Kurlin, V. (2013). Reconstructing persistent graph structures from noisy images.

*Image-A: Applicable Mathematics in Image Engineering*,*3*(5), 19-22.