Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Computer Science and Artificial Intelligence Lab (CSAIL)
  3. Artificial Intelligence Lab Publications
  4. AI Memos (1959 - 2004)
  5. Computing Visible-Surface Representations

Computing Visible-Surface Representations

Thumbnail Image
Download
Name

AIM-800.pdf

Size

6.24 MB

Format

Adobe PDF

Checksum (MD5)

8661fd21c2c640b1d1a5abafba5a0eaa

Thumbnail Image
Download
Name

AIM-800.ps

Size

8.68 MB

Format

PostScript

Checksum (MD5)

3402fd25e5ea6f6e34b25a0dace8c840

Author(s)
Terzopoulos, Demetri
Date Issued
March 1, 1985
Series/Report no.
AIM-800
Abstract
The low-level interpretation of images provides constraints on 3D surface shape at multiple resolutions, but typically only at scattered locations over the visual field. Subsequent visual processing can be facilitated substantially if the scattered shape constraints are immediately transformed into visible-surface representations that unambiguously specify surface shape at every image point. The required transformation is shown to lead to an ill-posed surface reconstruction problem. A well-posed variational principle formulation is obtained by invoking 'controlled continuity,' a physically nonrestrictive (generic) assumption about surfaces which is nonetheless strong enough to guarantee unique solutions. The variational principle, which admits an appealing physical interpretation, is locally discretized by applying the finite element method to a piecewise, finite element representation of surfaces. This forms the mathematical basis of a unified and general framework for computing visible-surface representations. The computational framework unifies formal solutions to the key problems of (i) integrating multiscale constraints on surface depth and orientation from multiple visual sources, (ii) interpolating these scattered constraints into dense, piecewise smooth surfaces, (iii) discovering surface depth and orientation discontinuities and allowing them to restrict interpolation appropriately, and (iv) overcoming the immense computational burden of fine resolution surface reconstruction. An efficient surface reconstruction algorithm is developed. It exploits multiresolution hierarchies of cooperative relaxation processes and is suitable for implementation on massively parallel networks of simple, locally interconnected processors. The algorithm is evaluated empirically in a diversity of applications.
Subjects
vision
multi-resolution reconstruction
finite elements
sdiscontinuities
surface representation
variational principles
sgeneralized splines
regularization
Persistent DSpace Link
http://hdl.handle.net/1721.1/5628
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.