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 Technical Reports (1964 - 2004)
  5. The Coupled Depth/Slope Approach to Surface Reconstruction

The Coupled Depth/Slope Approach to Surface Reconstruction

Thumbnail Image
Download
Name

AITR-908.pdf

Size

2.84 MB

Format

Adobe PDF

Checksum (MD5)

360ef217510b0592d48c06e1a9bd8694

Thumbnail Image
Download
Name

AITR-908.ps

Size

7.55 MB

Format

PostScript

Checksum (MD5)

03aaa58208e67f43af6fbceff27ee109

Author(s)
Harris, John G.
Date Issued
June 1, 1986
Series/Report no.
AITR-908
Abstract
Reconstructing a surface from sparse sensory data is a well known problem in computer vision. Early vision modules typically supply sparse depth, orientation and discontinuity information. The surface reconstruction module incorporates these sparse and possibly conflicting measurements of a surface into a consistent, dense depth map. The coupled depth/slope model developed here provides a novel computational solution to the surface reconstruction problem. This method explicitly computes dense slope representation as well as dense depth representations. This marked change from previous surface reconstruction algorithms allows a natural integration of orientation constraints into the surface description, a feature not easily incorporated into earlier algorithms. In addition, the coupled depth/ slope model generalizes to allow for varying amounts of smoothness at different locations on the surface. This computational model helps conceptualize the problem and leads to two possible implementations- analog and digital. The model can be implemented as an electrical or biological analog network since the only computations required at each locally connected node are averages, additions and subtractions. A parallel digital algorithm can be derived by using finite difference approximations. The resulting system of coupled equations can be solved iteratively on a mesh-pf-processors computer, such as the Connection Machine. Furthermore, concurrent multi-grid methods are designed to speed the convergence of this digital algorithm.
Persistent DSpace Link
http://hdl.handle.net/1721.1/6859
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.