返回
Parallel image restoration using surrogate constraint methods
DOI:10.1016/j.jpdc.2006.10.001.png)
摘要
En 中文
When formulated as a system of linear inequalities, the image restoration problem yields huge, unstructured, sparse matrices even for images of small size. To solve the image restoration problem, we use the surrogate constraint methods that can work efficiently for large problems. Among variants of the surrogate constraint method, we consider a basic method performing a single block projection in each step and a coarse-grain parallel version making simultaneous block projections. Using several state-of-the-art partitioning strategies and adopting different communication models, we develop competing parallel implementations of the two methods. The implementations are evaluated based on the per iteration performance and on the overall performance. The experimental results on a PC cluster reveal that the proposed parallelization schemes are quite beneficial. (C) 2006 Elsevier Inc. All rights reserved.
Keyword:
parallel computing
image restoration
linear feasibility problem
surrogate constraint method
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
暂无机构信息
引用论文
Surgical management of urachal tumors: Can the umbilicus be sparred in localized disease?
Rare Tumors
IF0

