Many algorithms have been proposed in literature for digital film restoration; unfortunately, none of them ensures a perfect restoration whichever is the image sequence to be restored. Here, we adopt an approach to digital scratch restoration based on the combination of relatively well settled distinct techniques. We propose P-LSR, a parallel version focusing on strategies based on both task and data partitioning to achieve good load balancing, that well adapts also to be distributed. Parallel performance is deeply investigated for several real image sequences.
P-LSR: A Parallel Algorithm for Line Scratch Restoration
Maddalena Lucia;
2005
Abstract
Many algorithms have been proposed in literature for digital film restoration; unfortunately, none of them ensures a perfect restoration whichever is the image sequence to be restored. Here, we adopt an approach to digital scratch restoration based on the combination of relatively well settled distinct techniques. We propose P-LSR, a parallel version focusing on strategies based on both task and data partitioning to achieve good load balancing, that well adapts also to be distributed. Parallel performance is deeply investigated for several real image sequences.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
