Algorithm for Parallel Inverse Halftoning using Partitioning of Look-Up Table (LUT)

(2007) Algorithm for Parallel Inverse Halftoning using Partitioning of Look-Up Table (LUT). IEEE Symposium on Circuits and Systems (ISCAS). (Submitted)

[img]
Preview
PDF (Conference Paper)
ISCAS2008.pdf

Download (570kB) | Preview

Abstract

The Look-Up Table (LUT) method for inverse halftoning is fast and computation-free technique employed to obtain good quality images. In this work we propose a new algorithm to parallelize the LUT method so that more pixels can be concurrently inverse halftoned using minimum additional hardware. The proposed algorithm partitions the single LUT of serial LUT method into N smaller Look-Up Tables (s-LUTs) such that the total number of entries in all s-LUTs remain equal to the number of entries in the single LUT of serial LUT method. The proposed algorithm can be implemented on a single FPGA (Field Programmable Gate Arrays) device with external memories to store s-LUTs.

Item Type: Article
Subjects: Computer
Department: College of Computing and Mathematics > Computer Engineering
Depositing User: UMAIR FAROOQ SIDDIQI
Date Deposited: 10 Dec 2007 05:05
Last Modified: 01 Nov 2019 13:22
URI: http://eprints.kfupm.edu.sa/id/eprint/66