Results 1  10
of
15
Gaussian Networks for Direct Adaptive Control,"
 IEEE Transactions on Neural Networks,
, 1991
"... ..."
(Show Context)
Analog VLSI Systems for Image Acquisition and Fast Early Vision
 International Journal of Computer Vision,
, 1992
"... This article describes a project to design and build prototype analog early vision systems that are remarkably lowpower, small, and fast. Three chips are described in detail. A continuoustime CMOS imager and processor chip uses a fully parallel 2D resistive grid to find an object's position ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
This article describes a project to design and build prototype analog early vision systems that are remarkably lowpower, small, and fast. Three chips are described in detail. A continuoustime CMOS imager and processor chip uses a fully parallel 2D resistive grid to find an object's position and orientation at 5000 frames/second, using only 30 milliwatts of power. A CMOS/CCD imager and processor chip does highspeed image smoothing and segmentation in a clocked, fully parallel 2D array. And a chip that merges imperfect depth and slope data to produce an accurate depth map is under development in switchedcapacitor CMOS technology. (see also Parallel networks for machine vision â Horn  1988)
Computation of Smooth Optical Flow in a Feedback Connected Analog Network
 in Advances in Neural Information Processing Systems
, 1998
"... In 1986, Tanner and Mead [1] implemented an interesting constraint satisfaction circuit for global motion sensing in aVLSI. We report here a new and improved aVLSI implementation that provides smooth optical flow as well as global motion in a two dimensional visual field. The computation of optical ..."
Abstract

Cited by 18 (8 self)
 Add to MetaCart
(Show Context)
In 1986, Tanner and Mead [1] implemented an interesting constraint satisfaction circuit for global motion sensing in aVLSI. We report here a new and improved aVLSI implementation that provides smooth optical flow as well as global motion in a two dimensional visual field. The computation of optical flow is an illposed problem, which expresses itself as the aperture problem. However, the optical flow can be estimated by the use of regularization methods, in which additional constraints are introduced in terms of a global energy functional that must be minimized. We show how the algorithmic constraints of Horn and Schunck [2] on computing smooth optical flow can be mapped onto the physical constraints of an equivalent electronic network. 1 Motivation The perception of apparent motion is crucial for navigation. Knowledge of local motion of the environment relative to the observer simplifies the calculation of important tasks such as timetocontact or focusofexpansion. There are sever...
Toward 3D Vision from Range Images: An Optimization Framework and Parallel Networks
"... We propose a unified approach to solve low, intermediate and high level computer vision problems for 3D object recognition from range images. All three levels of computation are cast in an optimization framework and can be implemented on neural network style architecture. In the low level computatio ..."
Abstract

Cited by 17 (10 self)
 Add to MetaCart
We propose a unified approach to solve low, intermediate and high level computer vision problems for 3D object recognition from range images. All three levels of computation are cast in an optimization framework and can be implemented on neural network style architecture. In the low level computation, the tasks are to estimate curvature images from the input range data. Subsequent processing at the intermediate level is concerned with segmenting these curvature images into coherent curvature sign maps. In the high level, image features are matched against model features based on an object description called attributed relational graph (ARG). We show that the above computational tasks at each of the three different levels can all be formulated as optimizing a twoterm energy function. The first term encodes unary constraints while the second term binary ones. These energy functions are minimized using parallel and distributed relaxationbased algorithms which are well suited for neural...
Compound eye sensor for 3D ego motion estimation
 Proc. IEEE/RSJ Int. Conf. Intelligent Robots and Systems 2004
"... Abstract — We describe a compound eye vision sensor for 3D ego motion computation. Inspired by eyes of insects, we show that the compound eye sampling geometry is optimal for 3D camera motion estimation. This optimality allows us to estimate the 3D camera motion in a sceneindependent and robust man ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
(Show Context)
Abstract — We describe a compound eye vision sensor for 3D ego motion computation. Inspired by eyes of insects, we show that the compound eye sampling geometry is optimal for 3D camera motion estimation. This optimality allows us to estimate the 3D camera motion in a sceneindependent and robust manner by utilizing linear equations. The mathematical model of the new sensor can be implemented in analog networks resulting in a compact computational sensor for instantaneous 3D ego motion measurements in full six degrees of freedom. Key words: analog VLSI; 3D motion sensor; parallel imaging sensor; robot vision; insect vision; 3D ego motion I.
Computing 3D Motion in Custom Analog and Digital VLSI
, 1994
"... This thesis examines a complete design framework for a realtime, autonomous system with specialized VLSI hardware for computing 3D camera motion. In the proposed architecture, the first step is to determine point correspondences between two images. Two processors, a CCD array edge detector and a m ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
This thesis examines a complete design framework for a realtime, autonomous system with specialized VLSI hardware for computing 3D camera motion. In the proposed architecture, the first step is to determine point correspondences between two images. Two processors, a CCD array edge detector and a mixed analog/digital binary block correlator, are proposed for this task. The report is divided into three parts. Part I covers the algorithmic analysis; part II describes the design and test of a 32x32 CCD edge detector fabricated through MOSIS; and part III compares the design of the mixed analog/digital correlator to a fully digital implementation.
Estimating the Focus of Expansion in Analog VLSI
 International Journal of Computer Vision
, 1996
"... In the course of designing an integrated system for locating the focus of expansion (FOE) from a sequence of images taken while a camera is translating, a variety of direct motion vision algorithms based on image brightness gradients have been studied (McQuirk, 1991, 1996b). The location of the FOE ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In the course of designing an integrated system for locating the focus of expansion (FOE) from a sequence of images taken while a camera is translating, a variety of direct motion vision algorithms based on image brightness gradients have been studied (McQuirk, 1991, 1996b). The location of the FOE is the intersection of the translation vector of the camera with the image plane, and hence gives the direction of camera motion. This paper describes two approaches that appeared promising for analog very large scale integrated (VLSI) circuit implementation. In particular, two algorithms based on these approaches are compared with respect to bias, robustness to noise, and suitability for realization in analog VLSI. From these results, one algorithm was chosen for implementation. This paper also briefly discuss the realtime analog CMOS/CCD VLSI architecture realized in the FOE chip.
COMPUTER VISION IN THE SPACE OF LIGHT RAYS: PLENOPTIC VIDEOGEOMETRY AND POLYDIOPTRIC CAMERA DESIGN
, 2004
"... Most of the cameras used in computer vision, computer graphics, and image processing applications are designed to capture images that are similar to the images we see with our eyes. This enables an easy interpretation of the visual information by a human observer. Nowadays though, more and more pro ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Most of the cameras used in computer vision, computer graphics, and image processing applications are designed to capture images that are similar to the images we see with our eyes. This enables an easy interpretation of the visual information by a human observer. Nowadays though, more and more processing of visual information is done by computers. Thus, it is worth questioning if these human inspired “eyes ” are the optimal choice for processing visual information using a machine. In this thesis I will describe how one can study problems in computer vision without reference to a specific camera model by studying the geometry and statistics of the space of light rays that surrounds us. The study of the geometry will allow us to determine all the possible constraints that exist in the visual input and could be utilized if we had a perfect sensor. Since no perfect sensor exists we use signal processing techniques to examine how well the constraints between different sets of light rays can be exploited given a specific camera model. A camera is modeled as a spatiotemporal filter in the space of light rays which lets us express the image formation process in a function approximation framework. This framework then allows us to relate the geometry of the
Direct Adaptive Control Using Gaussian Networks
 IN services” (Sean Hinde, One2One) http://www.erlang.se/euc/00/one2one.pdf
, 1991
"... A direct adaptive tracking control architecture is proposed and evaluated for a class of continuoustime nonlinear dynamic systems for which an explicit linear parameterization of the uncertainty in the dynamics is either unknown or impossible. The architecture employs a network of gaussian radial b ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
A direct adaptive tracking control architecture is proposed and evaluated for a class of continuoustime nonlinear dynamic systems for which an explicit linear parameterization of the uncertainty in the dynamics is either unknown or impossible. The architecture employs a network of gaussian radial basis functions to adaptively compensate for the plant nonlinearities. Under mild assumptions about the degree of smoothness exhibited by the nonlinear functions, the algorithm is proven to be stable, with tracking errors converging to a neighborhood of zero. A constructive procedure is detailed, which directly translates the assumed smoothness properties of the nonlinearities involved into a specification of the network required to represent the plant to a chosen degree of accuracy. A stable weight adjustment mechanism is then determined using Lyapunov theory. The network construction and performance of the resulting controller are illustrated through simulations with an example system. 1 ...