Digital watermarking is a relatively young and a quickly developing branch of Information Technology. Basically the aim of digital watermarking is to hide data in a cover media. This media can be audio, video or picture, or any combination of these three. We should be able to collect these data from the cover media afterwards.
The first aim of this thesis is to give an insight to what digital watermarking is, to point out what we can do with it, what are the opportunities in this field, to introduce the basic algorithms, and to analyze them on their robustness, and on their resource needs.
I will briefly introduce the following algorithms: JSteg, F5, Zhao-Koch and Patchwork. After the introduction I discuss the robustness and resource needs of these algorithms.
In the second part of the thesis I design and implement a watermarking algorithm. I explain the steps of the designing phase.
Afterwards I run some tests on the algorithm using the StirMark benchmark program, and I evaluate the results.