A Method for Enforcing Integrability in Shape from Shading Algorithms

نویسندگان

  • Robert T. Frankot
  • Rama Chellappa
چکیده

Several recently developed techniques for reconstructing surface shape from shading information estimate surface slopes without ensuring that they a re integrable. This paper presents a n approach for enforcing integrability, a particular implementation of the approach, a n example of its application to extending a n existing shapefrom-shading algorithm, and experimental results showing the improvement that results from enforcing integrability. 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. This projection maps closed convex sets into closed convex sets and, hence, is attractive as a constraint in iterative algorithms. The same technique is also useful for noniterative algorithms since it provides a least-squares fit of integrable slopes to nonintegrable slopes in one pass of the algorithm. The special case of Fourier basis functions is also formulated. This provides an intuitive frequency domain interpretation of shape from shading, a computationally efficient implementation using fast Fourier transforms, and a convenient method for introducing low-resolution information into the shape-from-shading solution. Reconstruction of surface height by integrating surface slope estimates is obtained as a byproduct of the integrability constraint. The integrability projection constraint was applied to extending a n iterative shape-from-shading algorithm of Brooks and Horn. Experimental results show that the extended algorithm converges faster and with less e r ror than the original version. Good surface reconstructions were obtained with and without known boundary conditions and for fairly complicated surfaces. Simulation examples show that the algorithm is robust with respect to large (but known) changes in illumination geometry, obtaining high-quality reconstructions even in the presence of significant shadowing. Other possible applications of this method to computer vision problems such as shape from texture and surface reconstruction from synthetic aperture radar imagery a re discussed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enforcing Integrability for Surface Reconstruction Algorithms Using Belief Propagation in Graphical Models

Accurate calculation of the three dimensional shape of an object is one of the classic research areas of computer vision. Many of the existing methods are based on surface normal estimation, and subsequent integration of surface gradients. In general, these methods do not produce valid surface due to violation of surface integrability. We introduce a new method for shape reconstruction by integ...

متن کامل

Segmentation and Morphometry of Histological Sections Using Deformable Models: A New Tool for Evaluating Testicular Histopathology

Enforcing a Shape Correspondence between Two Views of a 3D Non-rigid Object p. 163 A Colour Constancy Algorithm Based on the Histogram of Feasible Colour Mappings p. 171 Reconstruction of Surfaces from Cross Sections Using Skeleton Information p. 180 Extension of a New Method for Surface Reconstruction from Cross Sections p. 188 Imposing Integrability in Geometric Shape-from-Shading p. 196 Corr...

متن کامل

The Lawn-Mowing Algorithm for noisy gradient vector elds

In this paper we analyze a speci c problem within the context of recovering the geometric shape of an unknown surface frommultiple noisy shading patterns generated by consecutive parallel illuminations by di erent light-sources. Shading-based single-view shape recovery in computer vision often leads to vector elds (i.e. estimated surface normals) which have to be integrated for calculations of ...

متن کامل

The variational approach to shape from shading

We develop a systematic approach to the discovery of parallel iterative schemes for solving the shape-from-shading problem on a grid. A standard procedure for finding such schemes is outlined, and subsequently used to derive several new ones. The shape-from-shading problem is known to be mathematically equivalent to a nonlinear first-order partial differential equation in surface elevation. To ...

متن کامل

The Lawn-Mowing Algorithm for Noisy Gradient Vector Fields

In this paper we analyze a specific problem within the context of recovering the geometric shape of an unknown surface from multiple noisy shading patterns generated by consecutive parallel illuminations by different light-sources. Shading-based single-view shape recovery in computer vision often leads to vector fields (i.e. estimated surface normals) which have to be integrated for calculation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Pattern Anal. Mach. Intell.

دوره 10  شماره 

صفحات  -

تاریخ انتشار 1988