A Near-Linear Time Algorithm for the Chamfer Distance
Offered By: Simons Institute via YouTube
Course Description
Overview
Explore a groundbreaking algorithm for computing the Chamfer distance in near-linear time through this 54-minute lecture by Piotr Indyk from MIT. Delve into the intricacies of sketching techniques and algorithm design as applied to this fundamental problem in computational geometry. Gain insights into the innovative approach that significantly improves upon previous methods, potentially revolutionizing applications in computer vision, pattern recognition, and image processing.
Syllabus
A Near-Linear Time Algorithm for the Chamfer Distance
Taught by
Simons Institute
Related Courses
Natural Language ProcessingColumbia University via Coursera Intro to Algorithms
Udacity Conception et mise en œuvre d'algorithmes.
École Polytechnique via Coursera Paradigms of Computer Programming
Université catholique de Louvain via edX Data Structures and Algorithm Design Part I | 数据结构与算法设计(上)
Tsinghua University via edX