← Search

Vitaliy Kurlin

3 accepted papers

2023

A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree

ICML 2023poster

Given a reference set R of n points and a query set Q of m points in a metric space, this paper studies an important problem of finding k-nearest neighbors of every point q of Q in the set R in a near-linear time. In the paper at ICML 2006, Beygelzimer, Kakade, and Langford introduced a cover tree a…

Cited by 14SourcePDFScholar
2023

Recognizing Rigid Patterns of Unlabeled Point Clouds by Complete and Continuous Isometry Invariants With No False Negatives and No False Positives

CVPR 2023poster

Rigid structures such as cars or any other solid objects are often represented by finite clouds of unlabeled points. The most natural equivalence on these point clouds is rigid motion or isometry maintaining all inter-point distances. Rigid patterns of point clouds can be reliably compared only by c…

Cited by 30SourcePDFScholar