[论文解读] Teichmüller extremal mapping and its applications to landmark matching registration

Lok Ming Lui, Ka Chun Lam+2 more|arXiv (Cornell University)|Nov 12, 2012

Analytic and geometric function theory参考文献 5被引用 6

一句话总结

该论文提出了一种高效的迭代算法——准共形（QC）迭代，用于在具有地标约束的曲面之间计算Teichmüller极值映射，采用Beltrami系数（BCs）表示微分同胚，并利用线性Beltrami求解器（LBS）进行重建。该方法在10秒内即可计算出双射且共形性失真最小的配准结果，适用于脑部和面部配准等应用中的精确与软性地标匹配。

ABSTRACT

Registration, which aims to find an optimal 1-1 correspondence between shapes, is an important process in different research areas. Conformal mappings have been widely used to obtain a diffeomorphism between shapes that minimizes angular distortion. Conformal registrations are beneficial since it preserves the local geometry well. However, when landmark constraints are enforced, conformal mappings generally do not exist. This motivates us to look for a unique landmark matching quasi-conformal registration, which minimizes the conformality distortion. Under suitable condition on the landmark constraints, a unique diffeomporphism, called the Teichmüller extremal mapping between two surfaces can be obtained, which minimizes the maximal conformality distortion. In this paper, we propose an efficient iterative algorithm, called the Quasi-conformal (QC) iterations, to compute the Teichmüller mapping. The basic idea is to represent the set of diffeomorphisms using Beltrami coefficients (BCs), and look for an optimal BC associated to the desired Teichmüller mapping. The associated diffeomorphism can be efficiently reconstructed from the optimal BC using the Linear Beltrami Solver(LBS). Using BCs to represent diffeomorphisms guarantees the diffeomorphic property of the registration. Using our proposed method, the Teichmüller mapping can be accurately and efficiently computed within 10 seconds. The obtained registration is guaranteed to be bijective. The proposed algorithm can also be extended to compute Teichmüller mapping with soft landmark constraints. We applied the proposed algorithm to real applications, such as brain landmark matching registration, constrained texture mapping and human face registration. Experimental results shows that our method is both effective and efficient in computing a non-overlap landmark matching registration with least amount of conformality distortion.

研究动机与目标

• 开发一种计算曲面之间唯一、双射且在地标约束下最小化最大共形性失真映射的方法。
• 解决共形映射在施加地标约束时通常不存在的局限性。
• 将该方法扩展以处理软性地标约束，适用于地标位置不准确的情况。
• 为现实世界应用（如医学影像和计算机图形学）中的非重叠地标匹配配准，提供一种高效且精确的算法。
• 在最小化几何失真的同时，确保配准具有微分同胚（双射且光滑）的性质。

提出的方法

• 该方法使用Beltrami系数（BCs）表示微分同胚的空间，其编码了映射的共形性失真。
• 采用迭代优化过程，寻找对应于Teichmüller极值映射的最优BC，以最小化最大共形性失真。
• 线性Beltrami求解器（LBS）能够高效地从计算出的最优BC重建微分同胚映射。
• 通过修改BC优化过程，使算法能够精确或近似地满足指定特征点或曲线的地标约束。
• 由于BC表示的内在性质和Teichmüller理论，最终映射的双射性得到保证。
• 该方法在三角化曲面网格上实现，并应用于大脑和人脸等三维形状。

实验结果

研究问题

• RQ1 当施加地标约束时，能否在曲面之间计算出唯一、双射且共形性失真最小的映射？
• RQ2 在实际应用中，如何高效计算Teichmüller极值映射，尤其是在精确或软性地标约束下？
• RQ3 该方法能否在处理复杂数学曲面（如多连通或开放区域）时保持双射性与低失真？
• RQ4 在脑部配准和纹理映射等实际应用中，该算法的有效性如何？
• RQ5 该方法在运行时间与收敛速度方面的计算效率如何？

主要发现

• 所提出的QC迭代算法在10秒内完成Teichmüller极值映射的计算，确保了实际应用中的高效性。
• 所得配准结果保证为双射，即使在强地标约束下也不会出现折叠或重叠。
• Beltrami系数的范数在整个曲面上几乎保持恒定，证实了计算出的映射确实是共形性失真最小的Teichmüller映射。
• 该方法成功计算了单连通与多连通曲面（包括人脸和脑部网格）的地标匹配配准。
• 该算法支持软性地标约束，使得在地标位置不准确时仍能实现鲁棒配准。
• 实验结果表明，该方法在纹理映射中实现了有效且无重叠的映射，并在最小几何失真下实现了精确的面部与脑部配准。