Comparative approach between singular value decomposition and randomized singular value decomposition-based watermarking

Abstract

Threats and attacks on networks have increased significantly with the recent advancement of technologies. In order to avoid such problems, watermarking techniques was introduced. However, several popular watermarking techniques consume much more time to embed and extract the hidden message. In this current work, a randomized singular value decomposition (rSVD)-based watermarking technique has been proposed in order to avoid such problems. In this work, firstly, the watermark is embedded into the cover image using singular value decomposition, and then the rSVD is employed. Finally, the obtained results were compared to check the time complexity of both methods and to compare the quality of watermarked image and recovered watermarks.