A fast and robust algorithm to count topologically persistent holes in noisy clouds.

Add to your list(s) Download to your calendar using vCal

• Dr Vitaliy Kurlin
• Tuesday 17 June 2014, 15:00-16:00
• Cambridge University Engineering Department, LT1.

If you have a question about this talk, please contact ah781.

Preprocessing a 2D image often produces a noisy cloud of interest points. We study the problem of counting holes in unstructured clouds in the plane. The holes in a given cloud are quantified by the topological persistence of their boundary contours when the cloud is analysed at all possible scales. We design the algorithm to count holes that are most persistent in the filtration of offsets (neighbourhoods) around given points. The input is a cloud of n points in the plane without any user-defined parameters. The algorithm has O(n log n) time and O(n) space. The output is the array (number of holes, relative persistence in the filtration). We prove theoretical guarantees when the algorithm finds the correct number of holes (connected components in the complement) of an unknown shape approximated by a cloud.

This talk is part of the CUED Computer Vision Research Seminars series.

This talk is included in these lists:

• CUED Computer Vision Research Seminars
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge University Engineering Department, LT1
• Cambridge talks
• Chris Davis' list
• Information Engineering Division seminar list
• Interested Talks
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• ob366-ai4er
• rp587

Note that ex-directory lists are not shown.