Siddiqi, Umair F. and Sait, Sadiq M. (2008) Parallel Inverse Halftoning by Look-Up Table (LUT) Partitioning. Arabian Journal of Science and Engineering (AJSE).
|PDF (Submission to Arabian Journal of Sciences and Engineering)|
Look-Up Table (LUT) method for inverse halftoning is computation less, fast, and also yields goods results. It employs a single LUT that is stored in a ROM and contains pre-computed contone (gray level) values for inverse halftone operation. This paper proposes an algorithm that can perform parallel inverse halftone operation by partitioning the single LUT into N smaller Look-Up Tables (s-LUTs). Thereby, upto k (k≤N) pixels can be concurrently fetched from the halftone image, and their contone values can also be fetched concurrently from separate smaller Look-Up Tables (s-LUT). The parallelization increases the speed of inverse halftoning by upto k times while the total entries in all s-LUTs remains equal to the entries in the single LUT of the serial LUT method. Some degradation in image quality is possible due to pixel loss during parallel fetching. This is due to some contone values cannot be fetched in the same cycle because some other contone value is being fetched from the s-LUT. The complete implementation of the algorithm requires two CPLD devices for computational portion, external content addressable memories (CAM) and static RAMs to store s-LUTs.
|Divisions:||College Of Computer Sciences and Engineering > Computer Engineering Dept|
|Creators:||Siddiqi, Umair F. and Sait, Sadiq M.|
|Deposited By:||UMAIR FAROOQ SIDDIQI|
|Deposited On:||11 Jul 2008 02:51|
|Last Modified:||12 Apr 2011 13:16|
Available Versions of this Item
- Parallel Inverse Halftoning by Look-Up Table (LUT) Partitioning. (deposited 08 Dec 2007 10:49)
- Parallel Inverse Halftoning by Look-Up Table (LUT) Partitioning. (deposited 11 Jul 2008 02:51) [Currently Displayed]
Repository Staff Only: item control page