Mikel Stanich

Learn More
Recently, several watermarking schemes have been proposed that embed a watermark into two halftone images such that the watermark can be extracted by overlaying these halftone images. The watermark images in these schemes are binary images and the pixels in the two halftone images are correlated or not depending on whether the corresponding pixel in the(More)
Programmable Graphics Processing Unit (GPU) has emerged as a powerful parallel processing architecture for various applications requiring a large amount of CPU cycles. In this paper, we study the feasibility for using this architecture for image halftoning, in particular implementing computationally intensive neighborhood halftoning algorithms such as error(More)
Multi-bit screening is an extension of binary screening, in which every pixel in continuous-tone image can be rendered to one among multiple absorptance levels. Many multi-bit screen algorithms face the problem of contouring artifacts due to sudden changes in the majority absorptance level between gray levels. In this paper, we have extended the direct(More)
We present a unified algorithmic framework for some classes of digital halftoning algorithms including Direct Binary Search (DBS) and dither mask generation algorithms such as Void and Cluster, BIPPSMA, and clustered dot with blue noise interpolation. Although these algorithms are different and used in different ways, e.g. Direct Binary Search is a global(More)
We illustrate how employing Graphics Processing Units (GPU) can speed-up intensive image processing operations. In particular, we demonstrate the use of the NVIDIA CUDA architecture to implement a color digital binary halftoning algorithm based on Direct Binary Search (DBS). Halftoning a color image is more computationally expensive than the single color(More)
  • 1