Paper
30 April 2007 Analysis of the map-seeking circuit
Author Affiliations +
Abstract
Arathorn developed a new theory to address the translation, rotation, scale and perspective invariance problem in vision. According to it, both natural and machine vision systems may be built using a basic block which he calls the map-seeking circuit. In his recent book1, he informally describes the circuit and a number of simulation studies to illustrate his ideas and support his claims. In this paper, we complement his work by providing mathematical analysis of the circuit. We first construct difference equations describing its dynamics and study when they converge to a steady state which represents the circuit's interpretation of the input scene image. We then show that the state corresponds to the minimum of an upper bound on the difference between the input image and its reconstruction done by the circuit using its built-in banks of object memories and construction operators. The fact that the upper bound can be constructed and minimized directly in a computationally efficient and numerically robust manner, without having to recourse to the map-seeking circuit simulation, makes our alternative approach attractive for applications. We explain why the upper bound is not always tight, which leads to the collusion and other matching errors noticed by Arathorn.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jan Jelinek "Analysis of the map-seeking circuit", Proc. SPIE 6560, Intelligent Computing: Theory and Applications V, 656008 (30 April 2007); https://doi.org/10.1117/12.719722
Lens.org Logo
CITATIONS
Cited by 2 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Matrices

Computer simulations

Device simulation

Binary data

Complex systems

Control systems

Dynamical systems

Back to Top