ABSTRACT
This chapter shows that the proposed watermarking algorithm is optimized in terms the three major properties required for any digital image watermarking scheme. These are data hiding capacity, imperceptibility, and robustness. It utilizes several full-reference-based image quality metrics to assess imperceptibility by computing the differences, distortions, or correlations between the original cover image and the watermarked image. The hardware system is also evaluated in terms of computation speed, complexity, and utilization of logic components. The chapter presents many of the existing watermarking schemes in term of payload, data embedding, or data hiding capacity. An important feature of a good watermarking scheme is the data hiding capacity or payload capacity. Imperceptibility in digital watermarking stands for the visual transparency of the watermark data embedded into the cover image. The watermarked pixels, acquired in the bit-inserting process, are consecutively applied to the input of the extraction system.
