Advanced Search
DSpace@MIT

Browsing AI Memos (1959 - 2004) by Title

Research and Teaching Output of the MIT Community

Browsing AI Memos (1959 - 2004) by Title

Sort by: Order: Results:

  • Shashua, Amnon; Toelg, Sebastian (1994-06-01)
    The conceptual component of this work is about "reference surfaces'' which are the dual of reference frames often used for shape representation purposes. The theoretical component of this work involves the question ...
  • Weinshall, Daphna (1987-12-01)
    Obtaining exact depth from binocular disparities is hard if camera calibration is needed. We will show that qualitative depth information can be obtained from stereo disparities with almost no computations and with ...
  • Forbus, Kenneth D. (1983-05-01)
    Things move, collide, flow, bend, heat up, cool down, stretch, break and boil. These and other things that happen to cause changes in objects over time are intuitively characterized as processes. To understand common ...
  • Ward, Allen C.; Seering, Warren (1989-01-01)
    This paper presents the ideas underlying a program that takes as input a schematic of a mechanical or hydraulic power transmission system, plus specifications and a utility function, and returns catalog numbers from ...
  • Moses, Joel (1967-03-01)
    One of the most widely used routines in an algebraic manipulation system is a polynomial manipulation package (1,2,3). The crucial operation in such routines is the extraction of the Greatest Common Divisor (GCD) of ...
  • Beal, Jacob; Gilbert, Seth (2003-12-17)
    We present an algorithm to store data robustly in a large, geographically distributed network by means of localized regions of data storage that move in response to changing conditions. For example, data might migrate away ...
  • Taycher, Leonid; Darrell, Trevor (2001-09-01)
    Visibility constraints can aid the segmentation of foreground objects observed with multiple range images. In our approach, points are defined as foreground if they can be determined to occlude some {em empty space} in the ...
  • Lieberman, Henry; Hewitt, Carl (1981-10-01)
    In previous heap storage systems, the cost of creating objects and garbage collection is independent of the lifetime of the object. Since objects with short lifetimes account for a large portion of storage use, it's ...
  • Gordon, Steven J.; Seering, Warren P. (1988-05-01)
    A light stripe vision system is used to measure the location of polyhedral features of parts from a single frame of video camera output. Issues such as accuracy in locating the line segments of intersection in the image ...
  • McAllester, David Allen (1982-04-01)
    RUP (Reasoning Utility Package) is a collection of procedures for performing various computations relevant to automated reasoning. RUP contains a truth maintenance system (TMS) which can be used to perform simple ...
  • McIntosh, Harold V. (1968-01-01)
    REC/8 is a CONVERT program, realized in the CTSS LISP of Project MAC, for compiling RED expressions into the machine language of the PDP-8 computer. Since the compilation consists in its majority of subroutines calls (to ...
  • Edwards, D.J.; Minsky, M.L. (1963-11-01)
    This paper will report new developments and recent improvements to DDT. "Window DDT" now will remember undefined symbols and define them on a later command. Using sequence breaks, it can change the contents of memory while ...
  • Sinha, Pawan (1995-04-21)
    The processes underlying the perceptual analysis of visual form are believed to have minimal interaction with those subserving the perception of visual motion (Livingstone and Hubel, 1987; Victor and Conte, 1990). ...
  • Grimson, W. Eric L.; Lozano-Perez, Tomas (1985-06-01)
    This paper discusses how sparse local measurements of positions and surface normals may be used to identify and locate overlapping objects. The objects are modeled as polyhedra (or polygons) having up to six degreed ...
  • Poggio, Tomaso; Vetter, Thomas (1992-02-01)
    In this note we discuss how recognition can be achieved from a single 2D model view exploiting prior knowledge of an object's structure (e.g. symmetry). We prove that for any bilaterally symmetric 3D object one non- ...
  • Ullman, Shimon; Basri, Ronen (1989-08-01)
    Visual object recognition requires the matching of an image with a set of models stored in memory. In this paper we propose an approach to recognition in which a 3-D object is represented by the linear combination of 2-D ...
  • Basri, Ronen (1992-12-01)
    A scheme for recognizing 3D objects from single 2D images is introduced. The scheme proceeds in two stages. In the first stage, the categorization stage, the image is compared to prototype objects. For each prototype, ...
  • Marr, David (1974-12-01)
    The recognition of sharp edges from edge- and bar-mask convolutions with an image is studied for the special case where the separation of the edges is of the order of the masks' panel-widths. Desmearing techniques are ...
  • Dror, Ron O.; Edward H. Adelson,; Willsky, Alan S. (2001-10-21)
    This paper describes a machine vision system that classifies reflectance properties of surfaces such as metal, plastic, or paper, under unknown real-world illumination. We demonstrate performance of our algorithm for ...
  • Beyer, Terry (1968-09-01)
    In this paper we study recognition of topological invariant properties of patterns by use of finite, rectangular 2-dimensional, interactive arrays of finite state automata (hereafter called modular arrays). The use of ...
MIT-Mirage