Analisis Kombinasi Algoritma Watermarking Modified Least Significant Bit dengan Least Significant Bit +1

To protect someone's copyright on digital media such as digital image watermarking technique can be done, which is a technique to insert copyright marks into digital media. Algorithms commonly used in the watermark insertion is the Least Significant Bit (LSB).Insertion LSB algorithm is not no shortage. LSB algorithm requires one byte pixel image to insert a watermark bit. The more bytes pixels are inserted, the higher the difference watermarked image with the original image. Embedded watermark can also easily be known because it is definitely placed on the LSB bits of the pixel image. From these problems, in this research analysis algorithms to combine Modified Least Significant Bit (MLSB) algorithm +1 Least Significant Bit (LSB + 1) where MLSB have the advantage in placing the watermark to be inserted from eight bits per character into five bits per character watermark. +1 LSB algorithm will cover the shortfall MLSB easy-known location of the watermark bit, by inserting a watermark bits at random pixels. The results of this analysis of five samples tested by using different image sizes and dimensions, with five samples inserted watermark in the form of different text length to find three parameters comparison Mean Squared Error value (MSE), the size of the result and processing time. From this test it was concluded that the three parameters of the algorithm is a combination of MLSB-LSB + 1 better than the algorithm LSB + 1 but slightly worse than the algorithm MLSB. This happens due to a combination algorithm MLSB-LSB + 1 besides inheriting the advantages of each algorithm, also inherited deficiency of the algorithm LSB + 1 where the effect of the insertion is done at the bit before the last bit of the pixel image, the pixel value change is greater than the insertion of the last bit.