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.
A Near-Linear Time Algorithm for the Chamfer Distance
Overview
Syllabus
A Near-Linear Time Algorithm for the Chamfer Distance
Taught by
Simons Institute
Related Courses
-
Near Linear Time Approximation Schemes for Clustering in Doubling Metrics
-
Edit Distance in Near-Linear Time - It’s a Constant Factor
-
Long-context Attention in Near-Linear Time
-
Sublinear Algorithms for Gap Edit Distance
-
Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver
-
Fine-Grained Complexity and Algorithm Design for Graph Reachability and Distance Problems
