Processing system and method for adding invisible watermark to WEB page

Abstract

The invention discloses a processing system and method for adding an invisible watermark to a WEB page, the processing system is applied to the WEB page, and the processing system comprises a conversion module, a processing module and a watermark adding module; the conversion module is used for converting the text content in the watermark into a character string; the processing module is used for adding preset first information to the character string; adding corresponding identification information to a preset first position and a preset second position of the character string; the watermark adding module is used for creating an intermediate picture with the same size as a WEB window; circularly mapping the content in the character string into the middle picture line by line in a single pixel form according to a preset adding rule; setting the intermediate picture, and overlapping the intermediate picture with the content of the WEB page; the method has the beneficial effects that the defects that the existing solution is poor in shielding and concealment and can bring discomfort to a user are overcome.

Description

Technical Field

[0001] The present invention relates to the technical field of invisible watermarks, and in particular to a processing system and method for adding invisible watermarks to WEB pages. Background Art

[0002] At present, a large number of watermarking applications are involved in scenarios such as anti-piracy, copyright and business promotion. However, the existing solutions have occlusion and poor concealment, which will cause a certain degree of interference and discomfort to the viewer's visual viewing; therefore, a solution that can reduce the discomfort caused by traditional explicit watermarks to users is urgently needed. Summary of the invention

[0003] In order to overcome the deficiencies in the prior art, the present invention aims to provide a processing system and method for adding invisible watermarks to WEB pages.

[0004] The technical solution provided by the present invention is:

[0005] In a first aspect, a processing system for adding invisible watermarks to a WEB page is applied to a WEB page, and the processing system includes a conversion module, a processing module, and a watermark adding module;

[0006] The conversion module is used to: convert the text content in the watermark into a character string;

[0007] The processing module is used for:

[0008] Adding preset first information to the character string;

[0009] Adding corresponding identification information to the preset first position and second position of the character string;

[0010] The watermark adding module is used for:

[0011] Create an intermediate image of the same size as the WEB window;

[0012] According to a preset adding rule, the content in the string is cyclically mapped to the intermediate image in the form of a single pixel, row by row;

[0013] The middle picture is set and overlapped with the content of the WEB page.

[0014] Preferably, the string is a binary string; the first information is verification information

[0015] Preferably, the first position is the beginning of the string, and the second position is the end of the string.

[0016] Preferably, the adding of corresponding identification information specifically includes:

[0017] Add 00000000 to the beginning and 11111111 to the end.

[0018] Preferably, setting the middle picture includes placing it at the top of the web page, setting its transparency, and setting the picture pointer state to: none.

[0019] Preferably, the preset adding rules include:

[0020] The RGB color (0, 0, 0) is represented by 0 in the binary string, and the RGB color (255, 255, 255) is represented by 1 in the binary string.

[0021] Preferably, the processing system for adding invisible watermarks to WEB pages further includes a parsing module, which is used to:

[0022] Cut off any area of ​​the WEB page with invisible watermark added as a sample; wherein the invisible watermark is the added binary string;

[0023] Read the value of each pixel in the sample line by line, and add the RGB value of each pixel as the reference parameter;

[0024] Identify the start and end markers embedded in the binary string, and store the text content between the start and end markers in a temporary storage area;

[0025] Compare all the text contents identified in the temporary storage area, and select the binary string with the highest repetition rate as the final identified binary string;

[0026] The final recognized binary string is decoded to obtain the text content of the invisible watermark.

[0027] Preferably, the identifying of the start and end marks embedded in the binary string specifically includes:

[0028] Compare the reference parameters line by line in order. If there are 16 consecutive parameters, the difference between the first 8 parameter values ​​is within ±2, and the average of the first 8 values ​​is rounded up as the first parameter; the difference between the last 8 values ​​is within ±2, and the average of the last 8 values ​​is rounded up as the second parameter, and the second parameter is smaller than the first parameter, then the first 8 parameters are considered to be the end of the previous string and recorded as the first position, and the last 8 parameters are considered to be the beginning of the current string and recorded as the second position;

[0029] Then continue to search backwards. When 16 consecutive parameters are found again, the first 8 parameter values ​​differ within ±2, and the corresponding average of the first 8 values ​​is rounded to an integer as the third parameter, and the third parameter is equal to the first parameter. The last 8 values ​​differ within ±2, and the corresponding average of the last 8 values ​​is rounded to an integer as the fourth parameter, and the fourth parameter is equal to the second parameter. The first 8 parameters are considered to be the end of this string, recorded as the third position, and the last 8 parameters are considered to be the beginning of the next string, recorded as the fourth position.

[0030] Compare the reference parameter between the second position and the third position with the second parameter and the third parameter one by one. If the difference with the second parameter is within ±2, mark the reference parameter as 0; if the difference with the third parameter is within ±2, mark the reference parameter as 1; if neither condition is met, the entire string is deemed invalid; if the entire reference parameter is successfully marked as 0 or 1, store the string after the parameters between the second position and the third position are converted to 0 or 1 in the temporary storage area;

[0031] After the comparison is completed, the third position is marked as the first position, the fourth position is marked as the second position, the third parameter is marked as the first parameter, and the fourth parameter is marked as the second parameter, and the above steps are repeated for subsequent identification;

[0032] If the current row reference parameter comparison is completed and the next row comparison is required, the marked position and parameters need to be cleared and marked again.

[0033] In a second aspect, the present invention further provides a processing method based on an invisible watermark of an image, which is applied to a processing system for adding an invisible watermark to a WEB page as described in the first aspect, and the processing method comprises:

[0034] Convert the text content in the watermark into a string;

[0035] Adding preset first information to the character string;

[0036] Adding corresponding identification information to the preset first position and second position of the character string;

[0037] Create an intermediate image of the same size as the WEB window;

[0038] According to a preset adding rule, the content in the string is cyclically mapped to the intermediate image in the form of a single pixel, row by row;

[0039] The middle picture is set and overlapped with the content of the WEB page.

[0040] Through the above technical solution, the present invention can bring the following beneficial effects:

[0041] The present invention converts the text content in the watermark into a character string, adds corresponding identification information to the preset first position and second position of the character string, creates an intermediate image with the same size as the WEB window, and maps the content in the character string to the intermediate image line by line in a circular manner in the form of a single pixel according to a preset adding rule, and then adds an invisible watermark to the WEB page through settings; thereby overcoming the defects of the current solution that there is occlusion, the concealment is not strong, and it will cause discomfort to users. BRIEF DESCRIPTION OF THE DRAWINGS

[0042] Figure 1 A structural block diagram of a processing system for adding invisible watermarks to a WEB page provided by an embodiment of the present invention;

[0043] Figure 2 A process flow chart of adding an invisible watermark provided by an embodiment of the present invention;

[0044] Figure 3 A processing flow chart of invisible watermark analysis provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0045] The specific embodiments of the present invention will be described in detail below. It should be noted that the embodiments described herein are only for illustration and are not intended to limit the present invention. In the following description, a large number of specific details are set forth in order to provide a thorough understanding of the present invention. However, it is apparent to those of ordinary skill in the art that these specific details need not be adopted to implement the present invention.

[0046] It should be noted that the terms "first", "second", etc. in the specification and claims of the present application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequential order. It should be understood that the data used in this way can be interchanged where appropriate, so that the embodiments of the present application described here. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device comprising a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0047] In the present application, the terms "upper", "lower", "left", "right", "front", "back", "top", "bottom", "inner", "outer", "middle", "vertical", "horizontal", "lateral", "longitudinal" and the like indicate positions or positional relationships based on the positions or positional relationships shown in the drawings. These terms are mainly used to better describe the present application and its embodiments, and are not used to limit the indicated devices, elements or components to have a specific orientation, or to be constructed and operated in a specific orientation.

[0048] In addition, some of the above terms may be used to express other meanings in addition to indicating orientation or positional relationship. For example, the term "on" may also be used to express a certain dependency or connection relationship in some cases. For those of ordinary skill in the art, the specific meanings of these terms in this application can be understood according to specific circumstances.

[0049] Throughout the specification, references to "one embodiment," "an embodiment," "an example," or "an example" mean that a particular feature, structure, or characteristic described in conjunction with the embodiment or example is included in at least one embodiment of the present invention. Therefore, the phrases "in one embodiment," "in an embodiment," "an example," or "an example" appearing in various places throughout the specification do not necessarily all refer to the same embodiment or example. Furthermore, particular features, structures, or characteristics may be combined in one or more embodiments or examples in any appropriate combinations and / or subcombinations.

[0050] It should be noted that, unless otherwise specified, the technical terms in this embodiment have the common meanings understood in the relevant technical field.

[0051] like Figure 1 , Figure 2 As shown, a processing system for adding invisible watermarks to a WEB page provided by an embodiment of the present invention is applied to a WEB page, and the processing system includes a conversion module, a processing module and a watermark adding module;

[0052] The conversion module is used to: convert the text content in the watermark into a character string;

[0053] The processing module is used for:

[0054] Adding preset first information to the character string;

[0055] Adding corresponding identification information to the preset first position and second position of the character string;

[0056] The watermark adding module is used for:

[0057] Create an intermediate image of the same size as the WEB window;

[0058] According to a preset adding rule, the content in the string is cyclically mapped to the intermediate image in the form of a single pixel, row by row;

[0059] The middle picture is set and overlapped with the content of the WEB page.

[0060] When applied, the WEB page includes media content such as web pages and documents with certain pure color areas; the watermark content to be added and the address of the page can be received through the input interface of the system;

[0061] The processing system can be deployed on the front end or the server end, and there is no limitation here.

[0062] In this embodiment, the converted character string is a binary character string; the first information is check information; that is, a Hamming code check bit is added to the binary character string.

[0063] In this embodiment, the first position is the beginning of the string, and the second position is the end of the string; the adding of the corresponding identification information specifically includes:

[0064] Add 00000000 at the beginning and 11111111 at the end. When applied, add corresponding identifiers to the beginning and end of the binary string, add 00000000 at the beginning and 11111111 at the end.

[0065] Furthermore, to achieve the addition of invisible watermarks, the preset adding rules include:

[0066] The 0 in the binary string represents the RGB color (0, 0, 0), and the 1 in the binary string represents the RGB color (255, 255, 255), thereby realizing the implantation of black and white colors.

[0067] Finally, the created middle image is overlapped with the WEB content and placed in the topmost layer of the WEB page; the image transparency is set to 0.390625%, and the image pointer event is set to: None, so as to avoid affecting the normal operation of the web page.

[0068] For ease of understanding, the intermediate image can be understood as a blank canvas with the same pixel size as the browser window created, and pixel points are drawn one by one on the blank canvas in an order from left to right and from top to bottom; the color of each pixel point is drawn according to the value of each character of the final binary string read in a loop, wherein when the character value is 0, the RGB color (0, 0, 0) is drawn, and when the string value is 1, the RGB color (255, 255, 255) is drawn.

[0069] The above scheme converts the text content in the watermark into a character string, adds corresponding identification information to the preset first position and second position of the character string, creates an intermediate image of the same size as the WEB window, and maps the content in the character string to the intermediate image in a row-by-row cyclic manner in the form of a single pixel according to a preset adding rule, and then adds an invisible watermark to the WEB page through settings; thereby overcoming the defects of the current solution that the solution is blocked, the concealment is not strong, and it will cause discomfort to users.

[0070] Further, refer to Figure 3 On the basis of the above technical solution, in order to realize the recognition and analysis of invisible watermark, the processing system further includes a parsing module, and the parsing module is used to:

[0071] Cut off any area of ​​the WEB page with invisible watermark added as a sample; wherein the invisible watermark is the added binary string;

[0072] Read the value of each pixel in the sample line by line, and add the RGB value of each pixel as the reference parameter;

[0073] Identify the start and end markers embedded in the binary string, and store the text content between the start and end markers in a temporary storage area;

[0074] Compare all the text contents identified in the temporary storage area, and select the binary string with the highest repetition rate as the final identified binary string;

[0075] The final recognized binary string is decoded to obtain the text content of the invisible watermark.

[0076] During implementation, the identification of the start and end marks embedded in the binary string specifically includes:

[0077] Compare the reference parameters line by line in order. If there are 16 consecutive parameters, the difference between the first 8 parameter values ​​is within ±2, and the average of the first 8 values ​​is rounded up as the first parameter; the difference between the last 8 values ​​is within ±2, and the average of the last 8 values ​​is rounded up as the second parameter, and the second parameter is smaller than the first parameter, then the first 8 parameters are considered to be the end of the previous string and recorded as the first position, and the last 8 parameters are considered to be the beginning of the current string and recorded as the second position;

[0078] Then continue to search backwards. When 16 consecutive parameters are found again, the first 8 parameter values ​​differ within ±2, and the corresponding average of the first 8 values ​​is rounded to an integer as the third parameter, and the third parameter is equal to the first parameter. The last 8 values ​​differ within ±2, and the corresponding average of the last 8 values ​​is rounded to an integer as the fourth parameter, and the fourth parameter is equal to the second parameter. The first 8 parameters are considered to be the end of this string, recorded as the third position, and the last 8 parameters are considered to be the beginning of the next string, recorded as the fourth position.

[0079] Compare the reference parameter between the second position and the third position with the second parameter and the third parameter one by one. If the difference with the second parameter is within ±2, mark the reference parameter as 0; if the difference with the third parameter is within ±2, mark the reference parameter as 1; if neither condition is met, the entire string is deemed invalid; if the entire reference parameter is successfully marked as 0 or 1, store the string after the parameters between the second position and the third position are converted to 0 or 1 in the temporary storage area;

[0080] After the comparison is completed, the third position is marked as the first position, the fourth position is marked as the second position, the third parameter is marked as the first parameter, and the fourth parameter is marked as the second parameter, and the above steps are repeated;

[0081] If the current row reference parameter comparison is completed and the next row comparison is required, the marked position and parameters need to be cleared and marked again.

[0082] In this embodiment, after all row parameters are identified, all text contents identified in the temporary storage area are compared, and the value with the highest character length repetition rate is used as the final string length. All binary strings of equal length are selected, and the characters in the same position of each string are compared. The character with the highest occurrence frequency is used as the final recognized binary character. After all comparisons are completed, the string composed of binary characters is used as the final recognized binary string.

[0083] For ease of understanding, the following analysis is provided.

[0084] After repeating this process, many binary strings will be stored in the temporary storage area, as shown in the following table.

[0085]

[0086]

[0087] Due to interference factors such as color changes in web pages and image compression after screenshots, there will be certain data inaccuracies. In order to solve this problem, we need to analyze the multiple strings obtained and parse the final binary string.

[0088] Step 1: Confirm the string length

[0089] The length of each string in the temporary storage area is counted, and the length with the highest frequency is taken as the target length.

[0090] For example, the statistical results show that the length of 123 bits appears 40 times, the length of 67 bits appears 2 times, and the length of 87 bits appears 6 times, so we determine that 123 is the final length.

[0091] Step 2: Confirm the final characters

[0092] There are two methods here, and the preferred method in this application is method 2; this is because the Hamming code has a certain error correction capability and a high accuracy rate.

[0093] Method 1: Averaging method

[0094] After determining the final character length, separate the string with a length of 123 in the temporary storage area;

[0095] Compare the frequencies of occurrence of the same position value in all strings in order, and take the character with the highest frequency as the final character of this position.

[0096] 00110001100101111…… 00110001100101111…… 10110001100101111…… ……

[0097] For example:

[0098] First position: the character appears 0:39 times, appears 1:1 times, and the final character is 0;

[0099] The second position: the character appears 0:35 times, appears 1:5 times, and the final character is 0;

[0100] …

[0101] 123rd position: character appears 0:1 times, appears 1:39 times, and the final character is 1;

[0102] Combine the final characters to get the final string: 00110001100101111…

[0103] Finally, the final string is parsed through Hamming code to obtain a binary string, and then the binary string is converted into a plaintext string to obtain the final watermark plaintext content.

[0104] Method 2: Calculation frequency method

[0105] After determining the final character length, separate the string with a length of 123 in the temporary storage area;

[0106] 00110001100101111…… 00110001100101111…… 10110001100101111…… ……

[0107] All strings are parsed using the Hamming code parsing method to obtain binary strings, and then the parsed binary strings are converted into plaintext strings.

[0108] admin20240926 admin20240926 qdmin20240926 ……

[0109] Then all plaintext strings are compared, and the string with the highest repetition frequency is taken as the final recognized string.

[0110] Based on the same inventive concept, an embodiment of the present invention further provides a method for processing a web page to add an invisible watermark, which is applied to the aforementioned processing system for processing a web page to add an invisible watermark. The processing method includes:

[0111] Convert the text content in the watermark into a string;

[0112] Adding preset first information to the character string;

[0113] Adding corresponding identification information to the preset first position and second position of the character string;

[0114] Create an intermediate image of the same size as the WEB window;

[0115] According to a preset adding rule, the content in the string is cyclically mapped to the intermediate image in the form of a single pixel, row by row;

[0116] The middle picture is set and overlapped with the content of the WEB page.

[0117] The converted character string is a binary character string; the first information is check information; that is, a Hamming code check bit is added to the binary character string.

[0118] In this embodiment, the first position is the beginning of the string, and the second position is the end of the string; the adding of the corresponding identification information specifically includes:

[0119] Add 00000000 to the beginning and 11111111 to the end.

[0120] Furthermore, the preset adding rules include:

[0121] The RGB color (0, 0, 0) is represented by 0 in the binary string, and the RGB color (255, 255, 255) is represented by 1 in the binary string.

[0122] The middle picture is set up by placing it at the top of the web page, setting its transparency, and setting the picture pointer state to: none.

[0123] In another embodiment, the processing method further comprises:

[0124] Cut off any area of ​​the WEB page with invisible watermark added as a sample; wherein the invisible watermark is the added binary string;

[0125] Read the value of each pixel in the sample line by line, and add the RGB value of each pixel as the reference parameter;

[0126] Identify the start and end markers embedded in the binary string, and store the text content between the start and end markers in a temporary storage area;

[0127] Compare all the text contents identified in the temporary storage area, and select the binary string with the highest repetition rate as the final identified binary string;

[0128] The final recognized binary string is decoded to obtain the text content of the invisible watermark.

[0129] It should be noted that for a more specific description of the workflow of the method embodiment, please refer to the aforementioned system embodiment part, which will not be repeated here.

[0130] In the several embodiments provided in the present application, it should be understood that the disclosed processing system for adding invisible watermarks to WEB pages can be implemented in other ways. For example, the embodiments described above are only schematic. For example, the division of the modules can be divided in other ways in actual implementation, such as multiple units or components can be combined or integrated into another system or device, or some features can be ignored or not executed. In addition, the mutual coupling or direct coupling or communication connection shown or discussed can be an indirect coupling or communication connection through some interfaces, devices or units, or can be electrical, mechanical or other forms of connection.

[0131] The above is only a specific embodiment of the present invention, but the protection scope of the present invention is not limited thereto. Any technician familiar with the technical field can easily think of various equivalent modifications or replacements within the technical scope disclosed by the present invention, and these modifications or replacements should be included in the protection scope of the present invention. Therefore, the protection scope of the present invention shall be based on the protection scope of the claims.

Claims

1. A processing system for adding invisible watermarks to WEB pages, characterized in that: Applied to WEB pages, the processing system includes a conversion module, a processing module and a watermark adding module; The conversion module is used to: convert the text content in the watermark into a character string; The processing module is used for: Adding preset first information to the character string; Adding corresponding identification information to the preset first position and second position of the character string; The watermark adding module is used for: Create an intermediate image of the same size as the WEB window; According to a preset adding rule, the content in the string is cyclically mapped to the intermediate image in the form of a single pixel, row by row; The middle picture is set and overlapped with the content of the WEB page.

2. A processing system for adding invisible watermarks to WEB pages according to claim 1, characterized in that: The character string is a binary character string; the first information is verification information.

3. A processing system for adding invisible watermarks to WEB pages according to claim 2, characterized in that: The first position is the beginning of the string, and the second position is the end of the string.

4. A processing system for adding invisible watermarks to WEB pages according to claim 3, characterized in that: The adding of corresponding identification information specifically includes: Add 00000000 to the beginning and 11111111 to the end.

5. A processing system for adding invisible watermarks to a WEB page according to any one of claims 1 to 4, characterized in that: The setting of the middle picture includes placing it at the top of the web page, setting its transparency, and setting the picture pointer state to: none.

6. A processing system for adding invisible watermarks to WEB pages according to claim 1, characterized in that: The preset adding rules include: The RGB color (0, 0, 0) is represented by 0 in the binary string, and the RGB color (255, 255, 255) is represented by 1 in the binary string.

7. A processing system for adding invisible watermarks to WEB pages according to claim 4, characterized in that: Also included is a parsing module, the parsing module is used to: Cut off any area of ​​the WEB page with invisible watermark added as a sample; wherein the invisible watermark is the added binary string; Read the value of each pixel in the sample line by line, and add the RGB value of each pixel as the reference parameter; Identify the start and end markers embedded in the binary string, and store the text content between the start and end markers in a temporary storage area; Compare all the text contents identified in the temporary storage area, and select the binary string with the highest repetition as the final identified binary string; The final recognized binary string is decoded to obtain the text content of the invisible watermark.

8. A processing system for adding invisible watermarks to WEB pages according to claim 7, characterized in that: The identification of the start and end marks embedded in the binary string specifically includes: Compare the reference parameters line by line in order. If there are 16 consecutive parameters, the difference between the first 8 parameter values ​​is within ±2, and the average of the first 8 values ​​is rounded up as the first parameter; the difference between the last 8 values ​​is within ±2, and the average of the last 8 values ​​is rounded up as the second parameter, and the second parameter is smaller than the first parameter, then the first 8 parameters are considered to be the end of the previous string and recorded as the first position, and the last 8 parameters are considered to be the beginning of the current string and recorded as the second position; Then continue to search backwards. When 16 consecutive parameters are found again, the first 8 parameter values ​​differ within ±2, and the corresponding average of the first 8 values ​​is rounded to an integer as the third parameter, and the third parameter is equal to the first parameter. The last 8 values ​​differ within ±2, and the corresponding average of the last 8 values ​​is rounded to an integer as the fourth parameter, and the fourth parameter is equal to the second parameter. The first 8 parameters are considered to be the end of this string, recorded as the third position, and the last 8 parameters are considered to be the beginning of the next string, recorded as the fourth position. Compare the reference parameter between the second position and the third position with the second parameter and the third parameter one by one. If the difference with the second parameter is within ±2, mark the reference parameter as 0; if the difference with the third parameter is within ±2, mark the reference parameter as 1; if neither condition is met, the entire string is deemed invalid; if the entire reference parameter is successfully marked as 0 or 1, store the string after the parameters between the second position and the third position are converted to 0 or 1 in the temporary storage area; After the comparison is completed, the third position is marked as the first position, the fourth position is marked as the second position, the third parameter is marked as the first parameter, and the fourth parameter is marked as the second parameter, and the above steps are repeated; If the current row reference parameter comparison is completed and the next row comparison is required, the marked position and parameters need to be cleared and marked again.

9. A method for adding invisible watermark to a WEB page, characterized in that: A processing system for adding invisible watermarks to a WEB page as described in claim 1, wherein the processing method comprises: Convert the text content in the watermark into a string; Adding preset first information to the character string; Adding corresponding identification information to the preset first position and second position of the character string; Create an intermediate image of the same size as the WEB window; According to a preset adding rule, the content in the string is cyclically mapped to the intermediate image in the form of a single pixel, row by row; The middle picture is set and overlapped with the content of the WEB page.

10. A method for adding invisible watermark to a WEB page according to claim 9, characterized in that: The processing method also includes: Cut off any area of ​​the WEB page with invisible watermark added as a sample; wherein the invisible watermark is the added binary string; Read the value of each pixel in the sample line by line, and add the RGB value of each pixel as the reference parameter; Identify the start and end markers embedded in the binary string, and store the text content between the start and end markers in a temporary storage area; Compare all the text contents identified in the temporary storage area, and select the binary string with the highest repetition as the final identified binary string; The final recognized binary string is decoded to obtain the text content of the invisible watermark.

Images