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

@article{Kurlin2014AFA,
  title={A Fast and Robust Algorithm to Count Topologically Persistent Holes in Noisy Clouds},
  author={V. Kurlin},
  journal={2014 IEEE Conference on Computer Vision and Pattern Recognition},
  year={2014},
  pages={1458-1463}
}
  • V. Kurlin
  • Published 2014
  • Mathematics, Computer Science
  • 2014 IEEE Conference on Computer Vision and Pattern Recognition
  • 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 in the filtration of offsets (neighborhoods) around given points. The input is a cloud of n points in the plane without any user-defined… CONTINUE READING
    17 Citations
    A fast persistence-based segmentation of noisy 2D clouds with provable guarantees
    • V. Kurlin
    • Computer Science
    • Pattern Recognit. Lett.
    • 2016
    • 18
    • PDF
    Auto-completion of Contours in Sketches, Maps, and Sparse 2D Images Based on Topological Persistence
    • V. Kurlin
    • Mathematics, Computer Science
    • 2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
    • 2014
    • 15
    • PDF
    Skeletonisation Algorithms for Unorganised Point Clouds with Theoretical Guarantees
    • PDF
    Polygonal Meshes of Highly Noisy Images based on a New Symmetric Thinning Algorithm with Theoretical Guarantees
    • PDF
    A higher-dimensional homologically persistent skeleton
    • 14
    • PDF
    Superpixels Optimized by Color and Shape
    • 3
    • PDF

    References

    SHOWING 1-10 OF 10 REFERENCES
    Scalar Field Analysis over Point Cloud Data
    • 24
    • PDF
    Image Segmentation Using Topological Persistence
    • 35
    • PDF
    Persistence-sensitive simplication of functions on surfaces in linear time
    • 36
    • PDF
    Data Skeletonization via Reeb Graphs
    • 82
    • PDF
    The union of balls and its dual shape
    • 181
    Zigzag persistent homology in matrix multiplication time
    • 105
    • PDF
    Computational Topology - an Introduction
    • 1,307
    • PDF
    Stability of persistence diagrams
    • 816
    • PDF
    Computational geometry: algorithms and applications
    • M. Berg
    • Computer Science, Mathematics
    • 1997
    • 5,935
    • PDF
    Data structures and network algorithms
    • R. Tarjan
    • Mathematics, Computer Science
    • CBMS-NSF regional conference series in applied mathematics
    • 1983
    • 2,182