Search
Now showing items 1-10 of 60
Visual Routines
(1983-06-01)
This paper examines the processing of visual information beyond the creation of the early representations. A fundamental requirement at this level is the capacity to establish visually abstract shape properties and ...
Design Issues in Parallel Architecture for Artificial Intelligence
(1983-11-01)
Development of highly intelligent computers requires a conceptual foundation that will overcome the limitations of the von Neumann architecture. Architectures for such a foundation should meet the following design ...
Analyzing the Roles of Descriptions and Actions in Open Systems
(1983-04-01)
This paper analyzes relationships between the roles of descriptions and actions in large scale, open ended, geographically distributed, concurrent systems. Rather than attempt to deal with the complexities and ambiguities ...
Picking Up an Object from a Pile of Objects
(1983-05-01)
This paper describes a hand-eye system we developed to perform the binpicking task. Two basic tools are employed: the photometric stereo method and the extended Gaussian image. The photometric stereo method generates ...
The Smoothest Velocity Field and Token Matching
(1983-08-01)
This paper presents some mathematical results concerning the measurement of motion of contours. A fundamental problem of motion measurement in general is that the velocity field is not determined uniquely from the ...
Planning Collision Free Motions for Pick and Place Operations
(1983-05-01)
An efficient algorithm which finds collision free paths for a manipulator with 5 or 6 revolute joints is described. It solves the problem for four degree of freedom pick and place operations. Examples are given of paths ...
Scaling Theorems for Zero-Crossings
(1983-06-01)
We characterize some properties of the zero-crossings of the laplacian of signals - in particular images - filtered with linear filters, as a function of the scale of the filter (following recent work by A. Witkin, 1983). ...
Solving Uninterpreted Equations with Context Free Expression Grammars
(1983-05-01)
It is shown here that the equivalence class of an expression under the congruence closure of any finite set of equations between ground terms is a context free expression language. An expression is either a symbols or ...
Symmetric Set Theory: A General Theory of Isomorphism, Abstraction, and Representation
(1983-08-01)
It is possible to represent a finite set of points (atoms) by a finite sequence of points. However a finite set of points has no distinguished member and therefore it is impossible to define a function which takes a ...
Information Processing in Dendritic Spines
(1983-03-01)
Dendritic spines are small twigs on the dendrites of a very large class of neurons in the central nervous system. There are between 10 (3) and 10 (5) spines per neuron, each one including at least one synapse, i.e. a ...