English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

The projection algorithms have evolved from the alternating projection method proposed by J. von Neumann in 1933, who treated the problem of finding the projection of a given point in a Hilbert space onto the intersection of two closed subspaces. Recent researches have been centered in techniques for accelerate the convergence ofthe method and to exploit the multiprocessing. In this work we considered the image restoration problem. In most techniques developed to solved it have used iterative algorithms; one of them consists of using alternating orthogonal projections. We carried out one chronological looking back of different techniques in which has been applied the method of the alternating orthogonal projections to the problem of imagen restoration, until arriving at the recent approach of Combettes (1997-1999), on where the restoration process is based on the computation of approximate projections (i.e., subgradient projections), instead of exact projections

Algoritmos Numéricos para el Problema de Restauración de Imágenes usando el Método de las Proyecciones Alternantes