A METHOD FOR ENFORCING INTEGRABILITY IN SHAPE FROM SHADING ALGORITHMS
A METHOD FOR ENFORCING INTEGRABILITY IN SHAPE FROM SHADING ALGORITHMS
复制标题
DOI：
10.1109/34.3909
复制
发表时间：
1988-07-01
影响因子：
23.6
通讯作者：
CHELLAPPA, R
中科院分区：
文献类型：
--
作者：
FRANKOT, RT;CHELLAPPA, R
给出了一种增强可积性的方法，该方法的一个具体实现，它应用于扩展现有的从明暗处理形状的算法的一个例子，以及实验结果显示了增强可积性所带来的改善。曲面斜率的一个可能的不可积估计由一个有限基函数集来表示，并通过计算在该可积斜率集上的矢量子空间上的正交投影来加强可积性。应用可积投影约束推广了M.J.Brooks和B.K.P.Horn(1985)的一种迭代Shape-From-Shading算法。实验结果表明，扩展后的算法收敛速度更快，误差更小。对于相当复杂的表面，在有和没有已知边界条件的情况下都获得了良好的表面重建。
An approach for enforcing integrability, a particular implementation of the approach, an example of its application to extending an existing shape-from-shading algorithm, and experimental results showing the improvement that results from enforcing integrability are presented. A possibly nonintegrable estimate of surface slopes is represented by a finite set of basis functions, and integrability is enforced by calculating the orthogonal projection onto a vector subspace spanning the set of integrable slopes. The integrability projection constraint was applied to extending an iterative shape-from-shading algorithm of M.J. Brooks and B.K.P. Horn (1985). Experimental results show that the extended algorithm converges faster and with less error than the original version. Good surface reconstructions were obtained with and without known boundary conditions and for fairly complicated surfaces.<>