{"title":"P-LSR:线划痕恢复的并行算法","authors":"G. Laccetti, L. Maddalena, A. Petrosino","doi":"10.1109/CAMP.2005.37","DOIUrl":null,"url":null,"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. In this paper, 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.","PeriodicalId":393875,"journal":{"name":"Seventh International Workshop on Computer Architecture for Machine Perception (CAMP'05)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"P-LSR: a parallel algorithm for line scratch restoration\",\"authors\":\"G. Laccetti, L. Maddalena, A. Petrosino\",\"doi\":\"10.1109/CAMP.2005.37\",\"DOIUrl\":null,\"url\":null,\"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. In this paper, 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.\",\"PeriodicalId\":393875,\"journal\":{\"name\":\"Seventh International Workshop on Computer Architecture for Machine Perception (CAMP'05)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-07-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Seventh International Workshop on Computer Architecture for Machine Perception (CAMP'05)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CAMP.2005.37\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Seventh International Workshop on Computer Architecture for Machine Perception (CAMP'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CAMP.2005.37","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
P-LSR: a parallel algorithm for line scratch restoration
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. In this paper, 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.