Nicht lieferbar
Andere Kunden interessierten sich auch für
![Development Of An Efficient Grid Based Partitioning -Around -Medoids]( "Development Of An Efficient Grid Based Partitioning -Around -Medoids")
Development Of An Efficient Grid Based Partitioning -Around -Medoids35,99 €![3D Mesh Geometry Compression with a Set Partitioning Approach]( "3D Mesh Geometry Compression with a Set Partitioning Approach")
3D Mesh Geometry Compression with a Set Partitioning Approach35,99 €![Fact checking by data partitioning]( "Fact checking by data partitioning")
Fact checking by data partitioning29,99 €![Population of Data in Extracted Web Table Schema]( "Population of Data in Extracted Web Table Schema")
Population of Data in Extracted Web Table Schema26,99 €![Distributed Hash Table]( "Distributed Hash Table")
Distributed Hash Table37,99 €![Information systems]( "Information systems")
Information systems27,99 €
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)
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)