BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260911T215229Z
UID:Seminar-dept-315@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20130326T160000
DTEND:20130326T170000
SUMMARY:School Seminar Series
DESCRIPTION:Dr. Vitaliy Kurlin: Reconstructing persistent graph structures from noisy images\n\nLet a point cloud be a noisy dotted image of a graph on the plane. We present a new fast algorithm for reconstructing the original graph from the given point cloud. Degrees of vertices in the graph are found by methods of persistent topology. Necessary parameters are automatically optimized by machine learning tools. The algorithm is implemented in the Java applet at http://www.maths.dur.ac.uk/~dma0vk/java-applets/graph-reconstruction.html.\n\n\n\nThis is a joint work with A.Chernov, which has been recently presented at\n\nDGCI 2013 (Discrete Geometry for Computer Imagery). \n\nThe research was supported by the EPSRC grant (EP/I030328/1).\n\nhttp://gow.epsrc.ac.uk/NGBOViewGrant.aspx?GrantRef=EP/I030328/1 .\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=315
LOCATION:G12
END:VEVENT
END:VCALENDAR