CLIAMS:1. A method for embedding a watermark in a digital media, the method comprising:
dividing a portion of digital media into a plurality of groups of N*N blocks, wherein N is an odd number; and
embedding a set of watermark bits into one or more of the N*N blocks of a group, from amongst the plurality of groups, by a local binary pattern (LBP) synthesis process, the LBP synthesis process comprising:
changing a value of a neighbor of a central pixel of a N*N block, from amongst the one or more of the N*N blocks, to make the value of the neighbor greater than a value of the central pixel when a watermark bit, from amongst the set of watermark bits, corresponding to the neighbor is '1'; and
changing the value of the neighbor of the central pixel of the N*N block to make the value of the neighbor lesser than the value of the central pixel when the watermark bit corresponding to the neighbor is '0'.

2. The method as claimed in claim 1 further comprising applying de-blocking filtration to remove distortion at boundaries of the one or more of the N*N blocks.

3. The method as claimed in claim 1, wherein the LBP synthesis process further comprises determining a variance of each of the one or more of the N*N blocks to be in a predefined threshold range.

4. The method as claimed in claim 1 further comprising converting the watermark into a series of watermark bits comprising the set of watermark bits.

5. The method as claimed in claim 1 further comprising:
determining a first neighbor of the central pixel in the N*N block to correspond to a most significant bit (MSB) position of the set of watermark bits; and
traversing in a predefined order to move to a second neighbor of the central pixel, wherein the second neighbor corresponds a (MSB-1) position of the set of watermark bits.

6. The method as claimed in claim 1, wherein the digital media comprises audio, video, and image.

7. A method for extracting a watermark from a watermarked digital media, the method comprising:
dividing the watermarked digital media into a plurality of groups of N*N blocks, wherein N is an odd number;
computing a local binary pattern of each of the N*N blocks in a group from amongst the plurality of groups;
determining the local binary pattern that occurs most frequently in the group, wherein the local binary pattern that occurs most frequently in the group corresponds to a set of watermark bits inserted in the N*N blocks of the group; and
extracting the local binary pattern that occurs most frequently in the group from the watermarked digital media.

8. The method as claimed in claim 7, wherein the dividing is same as done for embedding the set of watermark bits in the watermarked digital media.

9. The method as claimed in claim 7, wherein the computing comprises comparing neighbors of a central pixel of a N*N block to the central pixel of the N*N block.

10. The method as claimed in claim 7, wherein the determining comprises making a histogram mapping the local binary pattern of the N*N blocks in the group against a number of times of occurrence of the local binary pattern.

11. A watermarking system (102) comprising:
a processor(108);
a memory (112) coupled to the processor, the memory comprising:
a watermark generation module (118) configured to convert a watermark to be embedded to a digital media into a string of bits;
a segregation module (120) to divide the digital media into a plurality of groups of N*N blocks, wherein N is an odd number; and
a local binary pattern (LBP) synthesis module (122) configured to insert a set of bits of the watermark, from amongst the string of bits, into one or more N*N blocks in a group of N*N blocks, from amongst the plurality groups, wherein the LBP synthesis module (122) is to
change a value of a neighbor of a central pixel of a N*N block to make the value of the neighbor greater than a value of the central pixel when a watermark bit in the set of bits corresponding to the neighbor is '1'; and
change the value of the neighbor of the central pixel of the N*N block to make the value of the neighbor lesser than the value of the central pixel, when the watermark bit in the set of bits corresponding to the neighbor is '0'.

12. The watermarking system (102) as claimed in claim 11, wherein the memory (112) further comprises a de-blocking filter (124-1) configured to remove distortion occurring at boundaries of each of the one or more N*N blocks.

13. The watermarking system (102) as claimed in claim 11, wherein the memory (112) further comprises a imperceptibility module (122-1) configured to determine variance of each of the one or more N*N blocks, and wherein the LBP synthesis module is to insert the set of bits of the watermark based on the variance.

14. The watermarking system (102) as claimed in claim 11, wherein the memory (112) further comprises a forward LBP module (124) configured to
compute a local binary pattern of each of the N*N blocks in a group from amongst the plurality of groups;
determine a local binary pattern that occurs most frequently in the group, wherein the local binary pattern that occurs most frequently in the group corresponds to the set of watermark bits inserted in the N*N blocks of the group; and
extract the local binary pattern that occurs most frequently in the group.

15. The watermarking system (102) as claimed in claim 14, wherein the forward LBP module (124) is configured to compute the local binary pattern of each of the N*N

blocks based on a forward LBP process comprising comparing neighbors of a central pixel of a N*N block to the central pixel of the N*N block.
,TagSPECI:As Attached