Inexact elastic shape matching in the square root normal field framework
Abstract
This paper puts forth a new formulation and algorithm for the elastic matching problem on unparametrized curves and surfaces. Our approach combines the frameworks of square root normal fields and varifold fidelity metrics into a novel framework, which has several potential advantages over previous works. First, our variational formulation allows us to minimize over reparametrizations without discretizing the reparametrization group. Second, the objective function and gradient are easy to implement and efficient to evaluate numerically. Third, the initial and target surface may have different samplings and even different topologies. Fourth, texture can be incorporated as additional information in the matching term similarly to the fshape framework. We demonstrate the usefulness of this approach with several numerical examples of curves and surfaces.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.