Dr Vitaliy Kurlin: mathematics & computer science

Data Science theory and applications. Everything is possible!

E-mail: vitaliy.kurlin(at)gmail.com, University of Liverpool, UK

Project Point cloud analysis based on papers in
MFCS 2020 | AIAA 2019 | PRL 2016 | CVPR 2014 | CTIC 2014

The mergegram of a dendrogram

mergegram

Back to Top of this page | Back to Research & papers | Back to Home page

Vortex structures around tandem flapping wing objects

velocity_field
  • Naohiko Ban, Wataru Yamazaki, Vitaliy Kurlin.
  • Development of a Reconstruction Method for Major Vortex Structure around Tandem Flapping Wing Object via Vortex Trajectory Method.
  • Proceedings of the American Institute of Aeronautics and Astronautics SciTech Forum (2019).
  • PDF [37 pages, 7.2M]   url [official link]

Back to Top of this page | Back to Research & papers | Back to Home page

Persistence-based segmentation of noisy 2D clouds

original image noisy input segmentation
  • V. Kurlin.
  • A fast persistence-based segmentation of noisy 2D clouds with provable guarantees.
  • Pattern Recognition Letters, v. 83 (2016), p. 3-12.
  • PDF [full version: 16 pages, 4.2M]   bib [code: beta-version]  

Back to Top of this page | Back to Research & papers | Back to Home page

Topologically persistent holes in noisy clouds

cloud
  • V. Kurlin.
  • A fast and robust algorithm to count topologically persistent holes in noisy clouds.
  • Proceedings of CVPR 2014: Computer Vision and Pattern Recognition, p. 1458-1463, a top 3 conference in entire Computer Science and the highest h-index conference.
  • PDF [extended: 10 pages, 1.6M]   bib [code: beta-version]   url [official link]

Back to Top of this page | Back to Research & papers | Back to Home page

Auto-completion of contours in sketches and 2D images

noisy inputautomatic output
  • V. Kurlin.
  • Auto-completion of contours in sketches, maps and sparse 2D images based on topological persistence.
  • Proceedings of CTIC (Computational Topology in Image Context) at SYNASC 2014 (Symposium on Symbolic and Numeric Algorithms for Scientific Computing), p. 594-601.
  • PDF [8 pages, 1.1M]   Slides [16 pages, 0.9K]   bib [code: beta-version]   url [official link]

Back to Top of this page | Back to Research & papers | Back to Home page