A Fast and Robust Algorithm to Count Topologically Persistent Holes in Noisy Clouds

  • Vitaliy Kurlin
  • Published 2014 in
    2014 IEEE Conference on Computer Vision and…

Abstract

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 the cloud is analyzed at all possible scales. We design the algorithm to count holes that are most persistent… (More)
DOI: 10.1109/CVPR.2014.189

Topics

20 Figures and Tables

Slides referencing similar topics