KFUPM ePrints

Parallel Inverse Halftoning by Look-Up Table (LUT) Partitioning

Siddiqi, Umair F. and Sait, Sadiq M. (2007) Parallel Inverse Halftoning by Look-Up Table (LUT) Partitioning. Arabian Journal of Science and Engineering (AJSE). (Submitted)

WarningThere is a more recent version of this item available.

[img]
Preview
PDF (Submission to Arabian Journal of Sciences and Engineering)
667Kb

Abstract

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.



Item Type:Article
Date:2007
Date Type:Publication
Subjects:Computer
Divisions:College Of Computer Sciences and Engineering > Computer Engineering Dept
Creators:Siddiqi, Umair F. and Sait, Sadiq M.
Email:umairf@kfupm.edu.sa, sadiq@kfupm.edu.sa
ID Code:61
Deposited By:UMAIR FAROOQ SIDDIQI
Deposited On:08 Dec 2007 10:49
Last Modified:12 Apr 2011 13:06

Available Versions of this Item

Repository Staff Only: item control page