Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/11681
Title: A fast BNM (Best Neighborhood Matching) : algorithm and parallel processing for image restoration
Authors: Li, W
Zhang, D 
Liu, Z
Qiao, X
Issue Date: 2003
Source: International journal of imaging systems and technology, 2003, v. 13, no. 4, p. 189-200
Abstract: Best Neighborhood Matching (BNM) algorithm is a good approach of error concealment in terms of restored image quality. However, this kind of error concealment algorithm is commonly computation-intensive, which restricts their real applications on large-scale image or video sequence restoration. In this article, we propose a fast method, named Jump and look around Best Neighborhood Matching (JBNM), which reduces computing time to one sixth of that by BNM, while the quality of the restored images remains almost the same. To further reduce processing time and meet large-scale image restorations, a parallel JBNM working on a cluster of workstations is proposed. Several critical techniques, including reading policy, overlap stripe data distribution, and communication strategies, have been developed to obtain high performance. Both theoretical analysis and experiment results indicate that our parallel JBNM provides an efficient technique for image restoration applications.
Keywords: Block-base coding
Error concealment
Image transmission
Parallel processing
Journal: International Journal of Imaging Systems and Technology 
ISSN: 0899-9457
DOI: 10.1002/ima.10057
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

141
Last Week
1
Last month
Citations as of Jul 14, 2020

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.