An algorithm for dense correspondence based on blended intrinsic map

Abstract

The dense matching of 3-D meshes is an important research topic in the field of computer vision. In this paper, we present a layered matching pipeline based on the mixed corresponding grid dense matching algorithm. Firstly, this algorithm find an intrinsic map between two non-isometric, genus zero surfaces. Secondly, we use the nature of the bottom of the measure preserving distance to released the dense corresponding of surfaces. A set of experimental results show that the proposed method achieves better approximation accuracy than the ICP method.