Skip to main content

Research Repository

Advanced Search

Outputs (3)

A fast and robust algorithm to count topologically persistent holes in noisy clouds (2014)
Presentation / Conference Contribution
Kurlin, V. (2023, June). A fast and robust algorithm to count topologically persistent holes in noisy clouds. Presented at CVPR : Computer Vision and Pattern Recognition, Columbus, Ohio, USA

Preprocessing a 2D image often produces a noisy cloud of interest points. We study the problem of counting holes in noisy clouds in the plane. The holes in a given cloud are quantified by the topological persistence of their boundary contours when th... Read More about A fast and robust algorithm to count topologically persistent holes in noisy clouds.

Computing a configuration skeleton for motion planning of two round robots on a metric graph (2014)
Presentation / Conference Contribution
Kurlin, V., & Safi-Samghabadi, M. (2014, October). Computing a configuration skeleton for motion planning of two round robots on a metric graph. Presented at 2014 Second RSI/ISM International Conference on Robotics and Mechatronics (ICRoM), Tehran

A connected metric graph G with n vertices and without loops and multiple edges is given as an n × n-matrix whose entry aij is the length of a single edge between vertices i ≠ j. A robot in the metric graph G is the metric ball with a center x ϵ G an... Read More about Computing a configuration skeleton for motion planning of two round robots on a metric graph.

Auto-completion of Contours in Sketches, Maps and Sparse 2D Images Based on Topological Persistence (2014)
Presentation / Conference Contribution
Kurlin, V., Winkler, F., Negru, V., Ida, T., Jebelean, T., Petcu, D., Watt, S., & Zaharie, D. (2014, December). Auto-completion of Contours in Sketches, Maps and Sparse 2D Images Based on Topological Persistence. Presented at Computational Topology in Image Context (workshop of SYNASC 2014: Symbolic and Numeric Algorithms for Scientific Computing, http://synasc.ro/2014), Timisoara, Romania

We design a new fast algorithm to automatically complete closed contours in a finite point cloud on the plane. The only input can be a scanned map with almost closed curves, a hand-drawn artistic sketch or any sparse dotted image in 2D without any ex... Read More about Auto-completion of Contours in Sketches, Maps and Sparse 2D Images Based on Topological Persistence.