University of Cambridge > Talks.cam > CUED Computer Vision Research Seminars > A fast and robust algorithm to count topologically persistent holes in noisy clouds.

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

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

Download to your calendar using vCal

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

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:

Note that ex-directory lists are not shown.

Other lists

Harker 1, Dept of Earth Sciences Average on weekdays: 9140.55167598 kWh Large Lecture Theatre, Department of Plant Sciences,

Other talks

Polar Oceans Seminar Talk Title TBC Group Presentation 2 Title to be confirmed Dr Dinis Calado, Senior Group Leader, Immunity and Cancer Laboratory, the Francis Crick Institute Online Causal Inference Seminar
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity