Description
The aim of 3D shape matching is to establish correspondences between semantically similar regions across given surfaces. A desirable property of resulting matchings is geometric consistency, which means that correspondences preserve the neighbourhood relation between shape elements. Yet, in practice, geometric consistency is often overlooked, or only achieved under severely limiting assumptions (e.g. a good initialisation). This lecture will take on a discrete view and cover graph-based formalisms for geometrically consistent shape matching, including foundations on general assignment problems, product graph formalisms for 1D, 2D and 3D matching, as well as recent developments towards globally optimal 3D shape matching with geometric consistency.