Research and Markets, the largest resource for market research information in world providing essential market research reports, industry research, industry analysis, forecasts, market studies, company profiles and country reports.
Welcome - Register - Login - Help/FAQ - 0 items View Basket
Worlds Largest Market Research Resource - 1516374 Live Reports
Search Research and Markets
  Search
Enter keywords, a title or
a report id number below.





Advanced   
Company search
Register for free email updates of market research
Currency
  Select a currency for use throughout the site



Viewing report

Order by Fax
Ask a Question
Printer Friendly
PDF Brochure
Hard CopyAdd to Basket
Live Chat Live Help Software for Website

Parallel Inverse Halftoning via Look-Up Table (LUT) Partitioning. Edition No. 1

VDM Publishing House, Feb 2009, Pages: 120


  Description  
   Authors   
    
    
    
     
  Enquire before Buying   
  Send to a Friend   

The Look-Up Table (LUT) method for inverse
halftoning is fast and computation-free technique
employed to obtain good quality images. In this book
we propose six algorithms to parallelize the LUT
method so that more pixels can be concurrently
inverse halftone using minimum additional hardware.
The proposed algorithms partition the single LUT of
serial LUT method into N smaller Look-Up Tables (s-
LUTs) such that the total number of contents in all
s-LUTs remain equal to the number of contents in the
single LUT of serial LUT method. The proposed
parallel algorithms have image quality equal to the
serial LUT method when gain in clock cycles over the
serial method is less and have lesser image quality
comparetively to serial LUT method when gain in
clock cycles over the serial method is very high.
The parallel algorithms can be implemented on FPGA
(Field Programmable Gate Arrays) devices with
external CAM (Content Addressable Memories) and ROM
(Read Only Memories)



For enquiries please call us on:
  +353-1-415-1241 (GMT Office Hours)
  1-917-300-0470 (EST Office Hours)

   All rights reserved. © Copyright 2012 Research and Markets
   Terms and conditions Privacy Policy Publishers Employment Opportunities Site Map Link to us Webmaster Affiliate Network


Research and Markets RSS Feeds