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
Intro to the Design of Everyday ThingsUdacity Product Design: The Delft Design Approach
Delft University of Technology via edX Architecture 101 - Part I: From Nothingness to Place
iversity Visual Storytelling for Film and Video Games
Ringling College of Art + Design via Kadenze UX Design: From Concept to Wireframe
University of Michigan via edX