The complexity of retina operators

Bernard Beauzamy

Journal of Applied Mathematics, 2002, vol. 2, issue 1, 23-50

Abstract: An artificial retina is a plane circuit, consisting of a matrix of photocaptors; each has its own memory, consisting in a small number of cells (3 to 5), arranged in parallel planes. The treatment consists in logical operations between planes, plus translations of any plane: they are called “elementary operations” (EO). A retina operator (RO) is a transformation of the image, defined by a specific representation of a Boolean function of n variables (n is the number of neighboring cells taken into account). What is the best way to represent an RO by means of EO, considering the strong limitation of memory? For most retina operators, the complexity (i.e., the number of EO needed) is exponential, no matter what representation is used, but, for specific classes, threshold functions and more generally symmetric functions, we obtain a result several orders of magnitude better than previously known ones. It uses a new representation, called “Block Addition of Variables.” For instance, the threshold function T 25,12 (find if at least 12 pixels are at 1 in a square of 5 × 5) required 62 403 599 EO to be performed. With our method, it requires only 38 084 operations, using three memory cells.

Date: 2002
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/S1110757X02111107

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2:y:2002:i:1:p:23-50

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().