The transfer function of IIR all-pass filters is a rational function of ω. However, the optimization of such a rational function using the successive projections method, which has a wider range of application than the Remez algorithm, has not been presented. In this paper, we propose designing IIR allpass filters using the successive projections method. key words: successive projections method,...

F. Fallside We develop a sequential adaptation algorithm for radial basis function (RBF) neural networks of Gaussian nodes, based on the method of successive F-Projections. This method makes use of each observation efficiently in that the network mapping function so obtained is consistent with that information and is also optimal in the least L 2-norm sense. The RBF network with the F-Projectio...

We study the problem of reconstructing binary images from four projections data in a fuzzy environment. Given the uncertainly projections,w e want to find a binary image that respects as best as possible these projections. We provide an iterative algorithm based on fuzzy integer programming and linear membership functions.

Successive refinement is a technique to encode a source iteratively, improving the distortion at each step. If the code rates of all steps combined can be as efficient as coding only for the final distortion in one go, then the source is said to be successively refinable. We turn our attention to vector sources and we propose to replace the high-distortion first stage by a projection to low-dim...

Isotonic regression is the problem of fitting data to order constraints. This problem can be solved numerically in an efficient way by successive projections onto order simplex constraints. An algorithm for solving the isotonic regression using successive projections onto order simplex constraints was originally suggested and analyzed by Grotzinger and Witzgall. This algorithm has been employed...

In arithmetic geometry, cohomology groups are not vector spaces as in classical algebraic geometry but rather euclidean lattices. As a consequence, to understand these groups we need to evaluate not only their rank, but also their successive minima, which are fundamental invariants in the geometry of numbers. The goal of this article is to perform this task for line bundles on projective curves...