SHAPE FROM SHADING AS A PARTIALLY WELL-CONSTRAINED PROBLEM

被引:51
作者
OLIENSIS, J
机构
[1] Department of Computer Science, University of Massachusetts at Amherst, Amherst
来源
CVGIP-IMAGE UNDERSTANDING | 1991年 / 54卷 / 02期
基金
美国国家科学基金会;
关键词
D O I
10.1016/1049-9660(91)90061-S
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
For general objects, and for illumination from a general direction, we study the constraints on shape imposed by shading. Assuming generalized Lambertian reflectance, we argue that, for a typical image, shading determines shape essentially up to a finite ambiguity. Thus regularization is often unnecessary, and should be avoided. More conjectural arguments imply that shape is typically determined with little ambiguity. However, it is pointed out that the degree to which shape is constrained depends on the image. Some images uniquely determine the imaged surface, while, for others, shape can be uniquely determined over most of the image, but infinitely ambiguous in small regions bordering the image boundary, even though the image contains singular points. For these images, shape from shading is a partially well-constrained problem. The ambiguous regions may cause shape reconstruction to be unstable at the image boundary. Our main result is that, contrary to previous belief, the image of the occluding boundary does not strongly constrain the surface solution. Also, it is shown that characteristic strips are curves of steepest ascent on the imaged surface. Finally, a theorem characterizing the properties of generic images is presented. © 1991.
引用
收藏
页码:163 / 183
页数:21
相关论文
共 15 条
[1]  
[Anonymous], 1998, ORDINARY DIFFERENTIA
[2]  
BROOKS MJ, 1990, TR9010 FLIND U S AUS
[3]   THE EIKONAL EQUATION - SOME RESULTS APPLICABLE TO COMPUTER VISION [J].
BRUSS, AR .
JOURNAL OF MATHEMATICAL PHYSICS, 1982, 23 (05) :890-896
[4]  
GARABEDIAN PR, 1969, PARTIAL DIFFERENTIAL
[5]  
GIBLIN P, 1987 P INT C COMP VI, P136
[6]  
Horn B. K. P., 1975, PSYCHOL COMPUTER VIS, P115
[7]   HEIGHT AND GRADIENT FROM SHADING [J].
HORN, BKP .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 1990, 5 (01) :37-75
[8]  
HORN BKP, UNPUB IMPOSSIBLE SHA
[9]  
Milnor J., 1970, ANN MATH STUDIES, V51
[10]  
OLIENSIS J, IN PRESS INT J COMPU