Conventional vision systems with uniform resolution sensors contain a huge amount of information, a great part of it not necessary for the tasks they are intended. This fact makes processing difficult at speeds that may be desirable for many applications. Opposed to this option, foveal vision offers a wide visual field and high resolution in a small area of the image with a reduced data set, allowing us to do real-time image processing in many applications. In this field have emerged a great deal of algorithms and hierarchical structures to support the processing of this type of image. In this paper we present a VLSI architecture that implements a level sequential segmentation algorithm in one of these hierarchical structures (a polygon) generated using a Cartesian symmetric lattice topology. This structure is designed to work at real time (20-30 frames/s).
VLSI implementation of a foveal polygon segmentation algorithm
01.01.1999
125116 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
VLSI Implementation of a Foveal Polygon Segmentation Algorithm
British Library Conference Proceedings | 1999
|Effects of foveal information processing
NTRS | 1984
|Optimal Algorithms for Some Polygon Enclosure Problems for VLSI Layout Analysis
British Library Online Contents | 2006
|Features of foveal dichromacy illustrated by deuteranopia
British Library Conference Proceedings | 1997
|Toward Color Image Segmentation in Analog VLSI: Algorithm and Hardware
British Library Online Contents | 1994
|