A fast and robust algorithm to count topologically persistent holes in noisy clouds
(2014)
Conference Proceeding
Kurlin, V. (2014). A fast and robust algorithm to count topologically persistent holes in noisy clouds.
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.