Recurrent Algorithms for Selecting the Maximum Input

Author: Koutroumbas Konstantinos  

Publisher: Springer Publishing Company

ISSN: 1370-4621

Source: Neural Processing Letters, Vol.20, Iss.3, 2004-11, pp. : 179-197

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

In this paper, two novel recurrent algorithms for selecting the maxima of a set S containing M positive real numbers are introduced. In the first one the aim is to determine a threshold T such that only the maxima of S lie above it, while in the second one, each element of S is reduced independently of the rest until either it becomes zero (if it is non-maximum) or it freezes to a positive value (if it is a maximum). Convergence analysis of both schemes as well as neural network implementations of simplified versions of the algorithms are given. Finally, a comparison of the performance of the proposed algorithms with other related methods is carried out.