Concealment of damaged blocks by neighborhood regions partitioned matching
Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
| Original language | English |
|---|---|
| Title of host publication | IEEE International Conference on Image Processing |
| Pages | 45-48 |
| Volume | 2 |
| Publication status | Published - 2001 |
Publication series
| Name | |
|---|---|
| Volume | 2 |
Conference
| Title | IEEE International Conference on Image Processing (ICIP) |
|---|---|
| Place | Greece |
| City | Thessaloniki |
| Period | 7 - 10 October 2001 |
Link(s)
Abstract
This paper presents a new error concealment algorithm for the masking of damaged blocks due to data loss during transmission over packet network of DCT based images. The algorithm is called Neighborhood Regions Partitioned Matching (NRPM). In our approach, instead of repairing damaged block as a whole, each damaged block is divided into a number of sub-blocks. Each sub-block is recovered utilizing not only the surrounding pixels, but also remote pixels which share similar local image characteristics. The approach yields good quality repair and since smaller block size is used, it can significant reduce the computational time for the reconstruction process.
Citation Format(s)
Concealment of damaged blocks by neighborhood regions partitioned matching. / Wong, W. Y F; Cheng, A. K Y; Ip, H. H S.
IEEE International Conference on Image Processing. Vol. 2 2001. p. 45-48.
IEEE International Conference on Image Processing. Vol. 2 2001. p. 45-48.
Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review
