Blind watermark processing

Abstract

Embodiments of the present disclosure provide a blind watermark processing method and device, a storage medium, and a program. The method comprises: acquiring a first brightness image composed of brightness components in a first image, and watermark information, the first image having a set color format; performing edge detection on the first brightness image to determine a target edge line contained in the first brightness image; embedding the watermark information into the first brightness image on the basis of the target edge line; and converting the first brightness image embedded with the watermark information into a second image in the set color format. According to the present application, an edge line is detected in a brightness image, and watermark information is embedded into the image on the basis of a more obvious "line" structure such as the edge line, so that the embedded watermark information has better robustness.

Description

[0001] Blind watermark processing technology field

[0002]

[0001] The present disclosure relates to the field of Internet technology, and in particular to blind watermark processing.

[0003] Adding watermark information to data such as images and videos for data security protection has become a widely adopted data security protection measure. Compared with explicit watermarks, blind watermarks (also known as dark watermarks) have the advantage of being less perceptible and can provide better data security protection, thus being more widely adopted.

[0004]

[0003] In traditional solutions, blind watermarking is usually performed in the frequency domain, that is, the image is transformed in the frequency domain, and then the watermark information is added in the frequency domain. The frequency domain watermarking method can make the naked eye less perceptible to the presence of the watermark, but it is not conducive to the correct interpretation of the watermark. When a watermarked image A is attacked by means of attacks such as screenshots and photos, an image B that needs to be watermarked will be generated. Since the screenshot operation generally does not change the clarity of the image, the watermark contained therein can generally be correctly interpreted. However, the photo operation will make unpredictable modifications to the frequency domain information of image A, which will introduce chromatic distortion. In particular, when image B is an image obtained by taking a photo of the display screen showing image A, moiré patterns will also exist in image B, further affecting the quality of image B. At this time, it will be difficult to interpret the watermark information from image B. Summary of the invention

[0005]

[0004] The embodiments of the present disclosure provide a blind watermark processing method, device, storage medium and program, which add blind watermarks based on edge lines in the spatial domain to better resist the interference of image quality on the correct parsing of watermarks during watermark parsing.

[0006]

[0005] In a first aspect, an embodiment of the present disclosure provides a blind watermark processing method, the method comprising: obtaining a first luminance image and watermark information composed of luminance components in a first image, wherein the first image has a set color format; performing edge detection processing on the first luminance image to determine a target edge line contained in the first luminance image; embedding the watermark information into the first luminance image according to the target edge line; and converting the first luminance image embedded with the watermark information into a second image in the set color format.

[0007]

[0006] In a second aspect, an embodiment of the present disclosure provides a blind watermark processing device, the device comprising: an acquisition module for acquiring a first luminance image and watermark information composed of luminance components in a first image, wherein the first image has a set color format; a detection module for performing edge detection processing on the first luminance image to determine a target edge line contained in the first luminance image; an embedding module for embedding the watermark information into the first luminance image according to the target edge line; and a conversion module for converting the first luminance image embedded with the watermark information into a second image in the set color format.

[0008]

[0007] In a third aspect, an embodiment of the present disclosure provides a blind watermark processing method, the method comprising: obtaining a brightness image and watermark information composed of brightness components in a first image, wherein the first image is an image with a set color format that needs to be transmitted to a cloud desktop client for display, and the watermark information corresponds to the cloud desktop client; performing edge detection processing on the brightness image to determine a target edge line contained in the brightness image; embedding the watermark information into the brightness image according to the target edge line; converting the brightness image embedded with the watermark information into a second image in the set color format; and transmitting the second image to the cloud desktop client for display.

[0009]

[0008] In a fourth aspect, an embodiment of the present disclosure provides an electronic device, comprising: a memory, a processor, and a communication interface; wherein the memory stores executable code, and when the executable code is executed by the processor, the processor can at least implement the blind watermark processing method as described in the first aspect or the third aspect.

[0010]

[0009] In a fifth aspect, an embodiment of the present disclosure provides a non-transitory machine-readable storage medium, on which executable code is stored. When the executable code is executed by a processor of an electronic device, the processor can at least implement the blind watermark processing method described in the first aspect or the third aspect.

[0011]

[0010] In a sixth aspect, an embodiment of the present disclosure provides a computer program product, which includes a computer program. When the computer program is executed by a processor of an electronic device, the processor executes the blind watermark processing method as described in the first aspect or the third aspect.

[0012]

[0011] In an embodiment of the present disclosure, when watermark information needs to be embedded into a first image in a predetermined color format (e.g., RGB format), the luminance component of the first image is first extracted to obtain a first luminance image. Edge detection is then performed on the first luminance image to obtain a target edge line, which serves as a reference line for embedding the watermark information. The watermark information is then embedded into the first luminance image based on the target edge line, and the first luminance image with the embedded watermark information is finally converted into a second image in a predetermined color format (e.g., RGB format). In this embodiment, embedding the watermark information based on the spatial luminance image prevents the embedded watermark information from being clearly perceived by the user's eye, thereby ensuring a better user experience. Furthermore, by detecting edge lines in the luminance image and embedding the watermark information into the image based on the more obvious "line" structure of the edge line, the embedded watermark information can be made more robust, effectively resisting interference with the watermark information caused by, for example, chromatic aberration and moiré patterns introduced by activities such as photographing. [Drawing Description]

[0013]

[0012] In order to more clearly illustrate the technical solutions in the embodiments of the present disclosure, the following briefly introduces the drawings required for describing the embodiments. Obviously, the drawings described below are some embodiments of the present disclosure. For those skilled in the art, other drawings can be obtained based on these drawings without creative work.

[0014] FIG1 is a flow chart of a blind watermark processing method provided by an embodiment of the present disclosure;

[0015] FIG2 is a flow chart of a watermark information embedding method provided in an embodiment of the present disclosure;

[0016] FIG3 is a schematic diagram of a watermark embedding line determination process provided by an embodiment of the present disclosure;

[0017] FIG. 4 is a schematic diagram of embedding watermark information along an embedding direction according to an embodiment of the present disclosure;

[0018] FIG5 is a flow chart of a watermark parsing method provided in an embodiment of the present disclosure;

[0019] FIG6 is a flow chart of another blind watermark processing method provided in an embodiment of the present disclosure;

[0020] FIG7 is a schematic diagram of a structure of a blind watermark processing device provided in an embodiment of the present disclosure;

[0021]

[0020] FIG8 is a schematic diagram of the structure of an electronic device provided in an embodiment of the present disclosure.

[0022] To make the objectives, technical solutions, and advantages of the embodiments of the present disclosure more clear, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the accompanying drawings. Obviously, the described embodiments are only some of the embodiments of the present disclosure, but not all of them. All other embodiments obtained by persons of ordinary skill in the art based on the embodiments of the present disclosure without creative effort are within the scope of protection of the present disclosure.

[0023]

[0022] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved in the embodiments of the present disclosure are all information and data authorized by the user or fully authorized by all parties, and the collection, use and processing of relevant data must comply with the relevant laws, regulations and standards of relevant countries and regions, and corresponding operation portals are provided for users to choose to authorize or refuse.

[0024]

[0023] Some embodiments of the present disclosure are described in detail below with reference to the accompanying drawings. The following embodiments and features thereof may be combined with one another unless they conflict with each other. Furthermore, the sequence of steps in the following method embodiments is provided for illustrative purposes only and is not intended to be a strict limitation.

[0025]

[0024] First, a concept involved in the embodiment of the present disclosure is explained.

[0026]

[0025] Blind watermark: Reversible encrypted data embedded in media such as images or videos in the form of digital information. It does not affect the visual experience of the human eye and has a certain resistance to attacks such as screenshots, compression, and photography. It is also used to ensure data security, copyright management, and data traceability.

[0027] Edge artifacts: In digital image processing, a phenomenon in which false grayscale changes occur at the edges of an image. These artifacts typically manifest as discontinuities in grayscale values, changes in brightness, or distortion of image details. While edge artifacts can affect image quality to a certain extent, they do not affect the human eye's understanding of the image content.

[0028]

[0027] Spatial domain: refers to the distribution of pixel values ​​of an image in two-dimensional space, also known as the original image domain or pixel domain.

[0029]

[0028] Frequency domain: refers to converting an image from the spatial domain to the frequency domain, that is, converting the pixel values ​​of the image into digital frequencies, thereby obtaining relevant information about the frequency distribution.

[0030] As previously mentioned, conventional solutions for data security protection using blind watermarks can employ frequency-domain embedding to embed watermark information into images. This embedding method involves frequency-domain transformation calculations, resulting in high complexity and potentially inadequate protection against photo-snap attacks. Specifically, photographing an image embedded with the watermark may introduce interference such as chromatic distortion and moiré, resulting in poor image quality and making it difficult to accurately extract the watermark information. Alternatively, embedding watermark information within the spatial domain of an image can be employed in practical applications. One implementation involves adding a transparent layer to the image and modifying the pixel values ​​of certain pixels within the transparent layer to embed the watermark information. However, this watermark embedding method is ineffective against photo-snap attacks because, when the image with the transparent layer is photographed, the resulting image will not contain the transparent layer, making it impossible to perform watermark analysis on the photographed image.

[0031]

[0030] Based on this, the embodiments of the present disclosure provide a new method for embedding watermark information in the spatial domain of an image. This method eliminates the need for frequency domain transformation, reduces computational complexity, and protects against photo-taking attacks. In summary, the solution provided by the embodiments of the present disclosure detects specific lines, called "edge lines," in an image, and directly embeds watermark information in the spatial domain of the image based on these edge lines. Because the pixel values ​​of pixels on edge lines differ significantly in brightness from those of surrounding pixels, the features of these pixels are not disturbed by attacks such as photo-taking. Furthermore, "line" features are more stable than "point" features, resulting in a watermark embedded based on edge lines that is more robust.

[0032]

[0031] The blind watermark processing solution provided by the embodiment of the present disclosure is introduced and explained below.

[0033]

[0032] FIG1 is a flow chart of a blind watermark processing method provided in an embodiment of the present disclosure. As shown in FIG1, the method includes the following steps.

[0034]

[0033] 101. Obtain a first brightness image and watermark information composed of brightness components in a first image, wherein the first image has a set color format.

[0035]

[0034] 102. Perform edge detection on the first brightness image to determine a target edge line contained in the first brightness image.

[0035] 103. Embed watermark information into the first brightness image according to the target edge line.

[0036]

[0036] 104. Convert the first brightness image embedded with the watermark information into a second image in a set color format.

[0037] In the embodiments of the present disclosure, the first image refers to an image in which watermark information is to be embedded, and may be a frame of image in video data or a separate image. In practical applications, the color format of the first image is typically RGB. Of course, the color format of the first image may also be other color formats.

[0038]

[0038] In the disclosed embodiments, to ensure that the user's naked eye does not notice the presence of the watermark after embedding it, thus achieving a blind watermarking effect, the watermark can be embedded in the brightness component of the first image. In this way, the embedded watermark only changes the brightness of some pixels, without changing their color, thus ensuring a consistent user experience.

[0039] Based on this, assuming that the first image is an image in RGB color format, it can be converted into an image in YUV or YCbCr color format, where Y is the luminance component. Thus, the luminance component is extracted from the converted image to form a first luminance image. However, it is understandable that if the color format of the first image itself is YUV or YCbCr color format, the luminance component can be directly extracted to form the first luminance image.

[0040] In the disclosed embodiments, the process for acquiring the watermark information to be embedded may include: acquiring original watermark information in a non-binary string format (e.g., consisting of letters, numbers, and other symbols); performing binary encoding conversion on the original watermark information to obtain an initial binary string; and then, optionally, processing the initial binary string using an error correction algorithm or other identifier addition method to obtain a target binary string with a head / tail identifier field added, wherein the head / tail identifier field is composed of multiple bit values. For example, if the initial binary string is: 01100110, and the head / tail identifier fields are both: 110, then the target binary string is: 11001 ...101110111011101110111011111111111111111111111111111111111111111111111111

[0041]

[0041] After obtaining the first brightness image, edge detection processing may be performed on the first brightness image to determine the target edge line contained in the first brightness image.

[0042]

[0042] Optionally, the process of determining the target edge line can be implemented as follows: performing edge detection processing on the first brightness image to obtain a binary image used to reflect whether each pixel in the first brightness image is located at an edge position; performing line detection and / or contour detection processing on the binary image to obtain at least one edge line; and determining the target edge line from the at least one edge line.

[0043] In practical applications, a preset edge detection algorithm can be used to perform edge detection processing on the first luminance image to output a binary image. The preset edge detection algorithm can be, for example, a Canny edge detection algorithm. The binary image can be an image of the same size as the first luminance image, and each pixel in the binary image has a one-to-one correspondence with a pixel in the first luminance image. The pixel value of any pixel i in the binary image can reflect whether the corresponding pixel in the first luminance image is located at the edge of an object. It should be noted that the pixel value in the binary image includes two values: a first value can be used to indicate that the current pixel is located at an edge, and a second value can be used to indicate that the current pixel is not located at an edge. For example, a pixel value of 255 can be set to indicate that the current pixel is located at an edge, and a pixel value of 0 can be set to indicate that the current pixel is not located at an edge.

[0044]

[0044] After the binary image is determined, line detection and / or contour detection processing can be performed on the binary image to obtain at least one edge line.

[0045] Regarding line detection, in an optional embodiment, a probabilistic Hough transform can be used to perform line detection on the binary image to determine the straight lines contained in the first luminance image, and the detected straight lines are used as the aforementioned edge lines. The detection principle of the probabilistic Hough transform can be simply understood as follows: if a predetermined number of pixels arranged in the same row, column, or diagonal line in the binary image are all located at edge positions, then these pixels constitute a straight line.

[0046] Regarding contour detection processing, the contour detection processing performed on the binary image is used to obtain the outer contour line, and the detected outer contour line can be used as the aforementioned edge line. It is worth noting that the contour lines of the object contained in the image include two types, namely, the outer contour line and the contour line of the internal texture. Since the outer contour line has higher stability, in the embodiment of the present disclosure, the contour detection processing is selected to filter out the contour line of the internal texture, and only the outer contour line is retained.

[0047] In practical applications, optionally, line detection may be performed on the binarized image first to obtain all the lines in the first brightness image. If the line detection result is not empty, or the number of detected lines is greater than a set threshold, contour detection may not be performed on the binarized image. Alternatively, contour detection may be performed on the binarized image regardless of the line detection result. Alternatively, contour detection may be performed only on the binarized image.

[0048]

[0048] After at least one edge line is determined using the above method, one or more edge lines can be determined from the at least one edge line as a target edge line. In practice, it is desirable to select an edge line that is more recognizable, more iconic, and more stable from the at least one edge line as the target edge line.

[0049] In an optional embodiment, one or more edge lines whose lengths are greater than the length of the watermark information can be selected as target edge lines based on the lengths of the edge lines and the length of the watermark information (i.e., the bit length of the binary string). The edge line length refers to the number of pixels contained in the edge line. Furthermore, when selecting multiple target edge lines, the distance between the target edge lines can be greater than a set distance, i.e., the target edge lines can be relatively dispersed. Furthermore, if no edge line among the edge lines is longer than the length of the watermark information, this means that the watermark information cannot be embedded in the first image based on the edge line. In this case, other watermark embedding methods can be used to embed the watermark information.

[0050]

[0050] In another optional embodiment, the process of determining the target edge line can be implemented as follows: detecting multiple key points contained in the first brightness image, and determining the target edge line from the at least one edge line based on the length of the at least one edge line, the length of the watermark information, and the distance between the at least one edge line and the multiple key points.

[0051] In practical applications, key points contained in the first brightness image can be detected and used to assist in locating the target edge line. Specifically, based on whether key points are near each edge line, edge lines that have key points nearby and simultaneously meet other conditions (for example, the edge line length must be greater than the length of the watermark information) can be selected as target edge lines. This allows the selected target edge lines to be subsequently located using key points, thereby improving positioning accuracy. In certain optional embodiments, key point detection methods such as ORB (Oriented FAST and Rotated BRIEF, abbreviated as ORB) feature point detection and Shift feature point detection can be used to detect key points in the first brightness image.

[0052] In a specific embodiment, the edge lines can be sorted in descending order based on their lengths. Then, based on the sorting results, the edge lines are traversed sequentially. For the currently traversed edge line p, the distances between the edge line p and each key point can be obtained. If the distance between the edge line p and a key point is less than a set distance threshold, it is considered that a key point exists near the edge line p. If the length of the edge line p is greater than the length of the watermark information, the edge line p can be used as a target edge line. Of course, if only one target edge line is set, the traversal of subsequent edge lines will be stopped at this point. Otherwise, the traversal will continue to the next edge line.

[0053]

[0053] Since the subsequent method of embedding watermark information based on the target edge line is the same regardless of whether there is one target edge line or multiple target edge lines, only one target edge line is used as an example for explanation below.

[0054]

[0054] After determining the target edge line, the watermark information can be embedded into the first brightness image according to the target edge line. Thereafter, the first brightness image with the embedded watermark information is converted into a second image of a set color format (such as RGB color format) to complete the embedding of the watermark information in the first image. That is, the first image with the embedded watermark information is referred to as the second image.

[0055]

[0055] Optionally, embedding the watermark information into the first brightness image according to the target edge line can be implemented as follows: determining the correspondence between the pixel points on the target edge line and the different bit values ​​in the binary string serving as the watermark information, and embedding the target feature value into the corresponding pixel point by modifying the pixel value of the pixel point corresponding to the target bit value according to the set embedding rule, wherein the target bit value is the value of any bit in the binary string.

[0056] Using the method provided by the embodiments of the present disclosure, edge detection performed on the luminance component has higher robustness, resulting in greater stability of the detected target edge line. This allows for resistance to attacks such as screenshots, photographs, and image compression. This means that the target edge line can still be detected in images obtained through these attacks. Robust edge line features in the luminance image are used as the embedding location for the blind watermark. This allows the watermark embedding location to be found based on the same features, even when attacked by screenshots or photographs, thereby recovering the watermark information. The edge line features in the image space can resist distortion effects such as radial transformation and moiré when the camera captures the image, and are effective in both screenshots and photographs. Furthermore, embedding the watermark information in the luminance component can better demonstrate the effect of edge artifacts.

[0057]

[0057] An optional implementation method of "embedding watermark information into the first brightness image according to the target edge line" is introduced below in conjunction with FIG. 2.

[0058]

[0058] FIG2 is a flow chart of a watermark information embedding method provided by an embodiment of the present disclosure. As shown in FIG2, the method includes the following steps.

[0059]

[0059] 201. Move the target edge line along the set direction by a set distance to obtain a watermark embedding line, the target edge line and the watermark embedding line have the same first length, the target edge line corresponds to the pixel points on the watermark embedding line, and the binary string serving as the watermark information has a second length.

[0060]

[0060] 202. Determine, based on the first length and the second length, a plurality of first pixel points corresponding to a target bit value in the binary string in the watermark embedding line and a plurality of second pixel points corresponding to the target edge line, wherein the target bit value is the value of any bit in the binary string, and the plurality of first pixel points correspond one-to-one to the plurality of second pixel points.

[0061]

[0061] 203. Update the pixel values ​​of the multiple first pixel points according to the target bit value, the pixel values ​​of the multiple first pixel points, and the pixel values ​​of the multiple second pixel points.

[0062] After determining the target edge line, the target edge line can be moved along a set direction by a set distance to obtain a watermark embedding line. The set direction can be upward, downward, upper left, upper right, lower left, lower right, etc. Taking the upper left as an example, as shown in FIG3 , the irregular solid line in FIG3 is the target edge line determined using the above method. The target edge line can be moved to the upper left by a set distance. The position of the target edge line after the movement is the position of the watermark embedding line. The watermark embedding line can have the same shape and length as the target edge line.

[0063] It is understood that the position coordinates of each pixel point on the target edge line are known. The target edge line is moved along a set direction by a set distance, that is, the position coordinates of each pixel point on the target edge line obtained by moving the pixel point along the set direction by the set distance are sequentially determined. These pixel points constitute a watermark embedding line. As a result, the target edge line and the watermark embedding line have the same first length, and the target edge line and the watermark embedding line have a one-to-one correspondence.

[0064] After determining the watermark embedding line, the watermark information can be embedded into the watermark embedding line, thereby embedding the watermark information into the first luminance image. Specifically, it is first necessary to determine the multiple first pixel points in the watermark embedding line and the multiple second pixel points in the target edge line corresponding to the target bit value in the binary string serving as the watermark information. In other words, it is necessary to determine the correspondence between each bit value in the binary string and the pixel points on the target edge line and the watermark embedding line.

[0065]

[0065] Specifically, the process of determining the multiple first pixel points corresponding to the target bit value in the watermark embedding line and the multiple second pixel points corresponding to the target edge line can be implemented as follows: according to the height and width of the watermark embedding line, determine the embedding direction of the watermark information in the watermark embedding line; then according to the first length, the second length and the embedding direction, determine the multiple first pixel points corresponding to the target bit value in the binary string in the watermark embedding line and the multiple second pixel points corresponding to the target edge line.

[0066] It is understood that since the watermark embedding line has two endpoints, it is necessary to determine which endpoint is used as the starting point for embedding the watermark information. In other words, it is necessary to first determine the embedding direction of the watermark information. Based on this, in the subsequent watermark information parsing process, the embedding direction will also be determined based on the same embedding direction determination method, and the watermark information will be parsed according to the embedding direction.

[0067] Specifically, the height and width of the watermark embedding line can be determined first. If the height is greater than the width, the embedding direction is determined to be the height direction, i.e., from top to bottom. If the height is less than the width, the embedding direction is determined to be the horizontal direction, i.e., from left to right. It is understood that the position coordinates of each pixel point on the watermark embedding line are known, so the position coordinates of the two endpoints of the watermark embedding line can be determined. The width of the watermark embedding line can be determined by the difference in the horizontal coordinates of the two endpoints, and the height of the watermark embedding line can be determined by the difference in the vertical coordinates.

[0068]

[0068] After determining the embedding direction of the watermark embedding line, the multiple first pixel points corresponding to the target bit value in the binary string in the watermark embedding line and the multiple second pixel points corresponding to the target edge line can be determined based on the first length of the watermark embedding line, the second length of the binary string serving as the watermark information and the embedding direction.

[0069] First, based on the first length and the second length, the number of pixels corresponding to a bit value in the binary string in the watermark embedding line is determined. Similarly, the number of pixels corresponding to a bit value in the target edge line is also determined. For example, if the first length is 20 and the second length is 5, the ratio of the first length to the second length is rounded down as the number of pixels corresponding to each bit value. In this example, each bit value can occupy 4 pixels in the watermark embedding line.

[0070]

[0070] In addition, since there is a one-to-one correspondence between the pixels in the target edge line and the pixels in the watermark embedding line, when the target bit values ​​in the binary string are determined to correspond to the multiple first pixels in the watermark embedding line, the target bit values ​​in the target edge line can be correspondingly determined to correspond to the multiple second pixels in the target edge line. For example, as shown in FIG4 , taking the binary string “11001100110110” as an example, assuming that the target bit value is the first bit value “1” therein, and assuming that each bit value occupies 4 pixels in the watermark embedding line, based on the determined top-down embedding direction, it can be determined that the target bit value “1” in the watermark embedding line corresponds to the first to fourth pixels arranged along the embedding direction on the watermark embedding line, and the target bit value “1” in the target edge line also corresponds to the first to fourth pixels arranged along the embedding direction on the target edge line. That is to say, it is necessary to complete the embedding of the target feature value "1" on the watermark embedding line based on the four pixel points corresponding to the target edge line and the watermark embedding line.

[0071]

[0071] The above introduces the process of determining the multiple first pixel points corresponding to the target bit value in the watermark embedding line and the multiple second pixel points corresponding to the target edge line. After determining the multiple first pixel points and the multiple second pixel points, the pixel values ​​of the multiple first pixel points can be updated according to the target bit value, the pixel values ​​of the multiple first pixel points and the pixel values ​​of the multiple second pixel points to complete the embedding of the target bit value in the multiple first pixel points.

[0072]

[0072] Optionally, the process of updating the pixel values ​​of multiple first pixel points can be implemented as follows: if the target bit value is a first binary value, the pixel values ​​of the multiple first pixel points are updated accordingly with the weighted sum of the pixel values ​​of each corresponding pixel point in the multiple first pixel points and the multiple second pixel points; if the target bit value is a second binary value, the pixel values ​​of the multiple first pixel points are updated accordingly with the weighted difference of the pixel values ​​of each corresponding pixel point in the multiple first pixel points and the multiple second pixel points.

[0073]

[0073] Optionally, the first binary value may be 1, and the second binary value may be 0. The first binary value may also be 0, and the second binary value may be 1 accordingly.

[0074]

[0074] Taking the example that the first binary value can be 1 and the second binary value can be 0, the pixel value of each pixel point in the watermark embedding line can be updated by the following formula: bit=1

[0075] Ymask — 5 bit=°

[0076]

[0075] Wherein, ymask on the left side of the equal sign is the pixel value of any first pixel on the watermark embedding line after the update, and ymask on the right side of the equal sign is the pixel value of the corresponding first pixel before the update; yedge is the pixel value of the second pixel on the target edge line corresponding to the first pixel; 0C and 0 are two weight values, which are preset values. The values ​​of a and 0 can be adjusted according to actual needs, but the sum of a and 0 must be 1. bit=1 indicates a bit value of 1; bit=0 indicates a bit value of 0.

[0077]

[0076] The following is a detailed description of the process of updating the pixel value of the first pixel point using a specific example. Assume that the bit value "1" of the first bit position in the watermark information "11001100110110" currently needs to be embedded. It has been determined that the first pixel points corresponding to the bit value "1" of the first bit position in the watermark embedding line are the first pixel point to the fourth pixel point: A1-A4, and the corresponding second pixel points in the target edge line are also the first pixel point to the fourth pixel point: B1-B4. The updated pixel value of the first pixel point A1 in the watermark embedding line is: a - Bl + p - Al o The updated pixel value of the second pixel point A2 on the watermark embedding line is: a・B2 + [3・A2. Similarly, the updated pixel values ​​corresponding to the pixel points A1-A4 on the watermark embedding line can be calculated.

[0078] For another example, the bit value "0" of the third bit position in the watermark information "11001100110110" needs to be embedded. It has been determined that the third bit value "0" corresponds to the ninth to twelfth pixel points A9-A12 in the watermark embedding line, and the corresponding second pixel points in the target edge line are also the ninth to twelfth pixel points B9-B12. The updated pixel value of the ninth pixel point A9 in the watermark embedding line is: a - B9 - p - A9. The updated pixel value of the tenth pixel point A10 in the watermark embedding line is: a - B10 - p - A10. o By analogy, the updated pixel values ​​corresponding to the pixel points A9-A12 on the watermark embedding line can be calculated.

[0079] By referring to the above method, the updated pixel values ​​of each pixel in the watermark embedding line can be determined, thereby completing the embedding of the watermark information in the first luminance image. Since the pixel value adjustment is performed in the first luminance image, the pixel value here represents brightness. The above adjustment process actually refers to the brightness of the pixels on the target edge line to update the brightness of the pixels on the watermark embedding line. Specifically, when the bit value to be embedded is the first binary value, referring to the above formula, the corresponding second pixel on the target edge line is brightened to a certain degree, and then the pixel value of the first pixel on the watermark embedding line is updated. When the bit value to be embedded is the second binary value, referring to the above formula, the corresponding second pixel on the target edge line is dimmed to a certain degree, and then the pixel value of the first pixel on the watermark embedding line is updated.

[0080]

[0079] The above describes a method for embedding watermark information. After embedding the watermark information in a first image, a second image can be obtained. When a set operation (such as taking a screenshot or a photo) is performed on the second image, a third image is generated. To determine whether the third image contains the watermark information, the third image needs to be watermark parsed. The following describes a method for performing watermark parsing on the third image.

[0081]

[0080] FIG5 is a flow chart of a watermark parsing method provided in an embodiment of the present disclosure. As shown in FIG5, the method includes the following steps.

[0082]

[0081] 501. Obtain a third image obtained by performing a setting operation on the second image, where the third image has a set color format.

[0083]

[0082] 502. Obtain a second luminance image composed of luminance components in the third image.

[0084]

[0083] 503. Perform edge detection processing on the second brightness image to determine multiple candidate edge lines contained in the second brightness image.

[0085]

[0084] 504. For a target candidate edge line, move the target candidate edge line along a set direction and a set distance to obtain a watermark parsing line, where the target candidate edge line is any one of the multiple candidate edge lines.

[0086]

[0085] 505. Determine whether the watermark parsing line contains watermark information.

[0087]

[0086] The setting operation may be a screenshot operation, a photo taking operation, or the like. The second image is generated by adding watermark information to the first image using the method described in the previous embodiment. The set color format may be an RGB color format. The third image obtained after performing the setting operation may also be in an RGB color format. To extract its luminance component, it may be converted to a YCbCr color format or a YUV color format to obtain a second luminance image.

[0088] Then, edge detection processing can be performed on the second brightness image to determine multiple candidate edge lines contained in the second brightness image. The edge detection algorithm used is the same as the edge detection algorithm used in the watermark information embedding process. The specific detection process can be referred to the relevant description in the above embodiment and will not be repeated here.

[0089]

[0088] It is understandable that, since it is not known in advance where the watermark information is added in the third image during the watermark parsing process, the same edge line detection method as in the watermark information adding process can be used to determine the positions of all candidate edge lines in the third image. Through these candidate edge lines, all possible positions for adding watermark information can be determined.

[0090] After determining the plurality of candidate edge lines included in the second brightness image, for a target candidate edge line 1 among the plurality of candidate edge lines, the target candidate edge line 1 can be moved along a set direction by a set distance to obtain a watermark parsing line. It is understood that the set direction for moving the target candidate edge line 1 during the watermark parsing process should be consistent with the set direction for moving the target edge line during the watermark adding process, for example, both are moved toward the upper left. Furthermore, the set distance for moving the target candidate edge line 1 during the watermark parsing process should be consistent with the set distance for moving the target edge line during the watermark adding process. Thus, only when the set direction and set distance for moving the target edge line during the watermark parsing process and the watermark adding process are consistent can the watermark embedding line of the watermark information be found in the third image.

[0091] Finally, it is possible to determine whether the watermark parsing line contains watermark information. It should be noted that since there are multiple watermark parsing lines, it is necessary to sequentially detect whether these watermark parsing lines contain watermark information. The following uses the example of determining whether a watermark parsing line contains watermark information to illustrate the watermark information parsing process.

[0092]

[0091] Optionally, the process of determining whether the watermark parsing line contains watermark information can be implemented as follows: determining the degree of difference between the pixel values ​​of multiple pixel points contained in the watermark parsing line; if the degree of difference is less than a set threshold, determining that the watermark parsing line does not contain watermark information; if the degree of difference is greater than or equal to the set threshold, determining whether the watermark parsing line contains multiple head and tail identification bit values ​​based on the pixel values ​​of a target number of head and tail pixel points of the watermark parsing line and the target candidate edge line, and the target number matches the number of the multiple head and tail identification bit values; if the watermark parsing line contains multiple head and tail identification bit values, determining other bit values ​​in the watermark information contained in the watermark parsing line based on the pixel values ​​of other pixel points of the watermark parsing line and the target candidate edge line, and the other pixel points refer to pixel points other than the target number of pixel points.

[0093] As described in the aforementioned embodiment, during the watermarking process, the pixel values ​​of the corresponding pixels in the watermark embedding line can be updated accordingly, with reference to the brightness of the target edge line and the currently embedded bit value. Thus, the brightness changes of the watermark embedding line are directly related to the changes in the bit value in the watermark information. When the bit value in the watermark information is a first binary value, the brightness of the first pixel in the watermark embedding line is higher than the brightness of the second pixel corresponding to the target edge line. When the bit value in the watermark information is a second binary value, the brightness of the first pixel in the watermark embedding line is lower than the brightness of the second pixel corresponding to the target edge line. Generally speaking, the pixel values ​​in the target edge line are unadjusted, and their brightness (i.e., pixel values) change naturally. The brightness changes of adjacent pixels in the target edge line are relatively slow. However, because the pixel values ​​in the watermark embedding line are adjusted in a step-by-step manner with reference to the pixel values ​​on the target edge line, the brightness changes of the adjusted pixel values ​​in the watermark embedding line are more prominent and intense.

[0094] Based on this, whether the watermark parsing line contains watermark information can be preliminarily determined based on whether there is an edge artifact phenomenon with obvious changes in brightness on the watermark parsing line. Specifically, the degree of difference between the pixel values ​​of multiple pixels (all or part) included in the watermark parsing line can be determined. If the degree of difference is less than a set threshold, it means that there is no obvious brightness change phenomenon on the watermark parsing line, and it is directly determined that the watermark parsing line does not contain watermark information. Conversely, if the degree of difference is greater than or equal to the set threshold, it means that there is an obvious brightness change phenomenon on the watermark parsing line, and the watermark parsing line may contain watermark information. Further testing is required to determine whether the watermark parsing line actually contains watermark information. The above-mentioned degree of difference can be determined by the difference between the minimum pixel value and the maximum pixel value, but is not limited to this.

[0095] When the difference is greater than or equal to a set threshold, whether the watermark parsing line contains multiple head and tail identification bit values ​​can be determined based on the pixel values ​​of the target number of pixels at the beginning and end of the watermark parsing line and the target candidate edge line. As described above, when the original watermark information of a non-binary string is converted into binary code, an initial binary string is obtained. A set number of identification bit values ​​are added to the beginning and end of the initial binary string to obtain the target binary string, such as the head and tail identification bit values ​​of 110 in the example above. In addition, during the watermark information embedding process, it is determined how many pixels in the watermark embedding line a bit value corresponds to. For example, one bit value corresponds to four pixels. In this example, the head and tail target number of pixels of the watermark parsing line and the target candidate edge line are determined based on the product of the number of identification bit values ​​corresponding to the head and tail, respectively, and the number of pixels corresponding to one bit value: 3*4=12 pixels at the beginning and 3*4=12 pixels at the end.

[0096]

[0095] Next, based on the pixel values ​​of the first and last target number of pixel points, it can be determined whether the watermark parsing line contains multiple first and last identification bit values.

[0097]

[0096] Optionally, the above process of determining whether the watermark parsing line contains multiple head and tail identification bit values ​​can be implemented as follows: determining multiple third pixel points corresponding to the target identification bit from the head and tail target number of pixel points of the watermark parsing line, and determining multiple fourth pixel points corresponding to the target identification bit from the head and tail target number of pixel points of the target candidate edge line, the multiple third pixel points correspond one-to-one to the multiple fourth pixel points, and the target identification bit is any one of the multiple identification bits corresponding to the multiple head and tail identification bit values; if the pixel values ​​of the multiple third pixel points are greater than the pixel values ​​of the multiple fourth pixel points, then the bit value of the target identification bit is determined to be a first binary value; if the pixel values ​​of the multiple third pixel points are less than the pixel values ​​of the multiple fourth pixel points, then the bit value of the target identification bit is determined to be a second binary value; if the bit values ​​of the parsed multiple identification bits match the multiple head and tail identification bit values, then it is determined that the watermark parsing line contains multiple head and tail identification bit values.

[0098]

[0097] It is understood that the watermark information may include multiple first and last identification bit values, such as the first and last identification bit values ​​are both "110." Assuming that during the watermarking process, a single bit value in the watermark information occupies A pixels in the watermark embedding line, then for the target identification bit among all bits corresponding to the first and last identification bit values, the target identification bit corresponds to A third pixels within the target number of pixels at the beginning and end of the watermark parsing line. That is, the pixel values ​​of these A pixels can all be used to reflect the bit value of the target identification bit. Taking the first bit of the first identification bit value "110" as an example, the first pixel to the Ath pixel within the target number of pixels at the beginning and end of the watermark parsing line can be used as the third pixels corresponding to the first bit. Since the pixels in the watermark parsing line have a one-to-one correspondence with the pixels in the target candidate edge line, after determining the multiple third pixels in the watermark parsing line, the corresponding multiple fourth pixels in the target candidate edge line can be determined accordingly.

[0099]

[0098] It is understandable that when there are head and tail identification bit values, the parsing direction of the watermark parsing line may not be distinguished when parsing the head and tail identification bit values, because both ends need to be parsed. However, if only the head or tail has an identification bit value, or when the subsequent watermark parsing is performed to determine whether other bit values ​​in the watermark information are included, the parsing direction must be known. This parsing direction is the embedding direction during the watermark embedding process.

[0100] After determining the plurality of third pixel points and the plurality of fourth pixel points, the pixel values ​​of the plurality of third pixel points and the plurality of fourth pixel points may be correspondingly compared. If the pixel values ​​of the plurality of third pixel points are greater than the plurality of fourth pixel values, the bit value of the target identification bit may be determined to be a first binary value. If the pixel values ​​of the plurality of third pixel points are less than the plurality of fourth pixel values, the bit value of the target identification bit may be determined to be a second binary value.

[0101]

[0100] For example, assuming that a bit value corresponds to 4 pixels, for the four pixel points at the head of the watermark parsing line: A1-A4, assuming that the four pixel points corresponding to the head of the target candidate edge line are: B1-B4, the above parsing process can be described as: comparing the pixel values ​​of pixel A1 and pixel B1, comparing the pixel values ​​of pixel A2 and pixel B2, comparing the pixel values ​​of pixel A3 and pixel B3, comparing the pixel values ​​of pixel A4 and pixel B4, if the pixel values ​​of pixel Ai are all greater than the pixel values ​​of the corresponding pixel Bi, then determining that the bit values ​​corresponding to pixel A1-A4 are the first binary value (for example, 1), if the pixel values ​​of pixel Ai are all less than the pixel values ​​of the corresponding pixel Bi, then determining that the bit values ​​corresponding to pixel A1-A4 are the second binary value (for example, 0), wherein the value range of i in this example is [1,4].

[0102]

[0101] In practical applications, a threshold value may also be set. For example, if the pixel values ​​of more than a set number of pixel points Ai among the above-mentioned pixel points A1-A4 are greater than the pixel value of the corresponding pixel point Bi, the bit value corresponding to the pixel points A1-A4 is determined to be a first binary value (for example, 1); otherwise, the bit value corresponding to the pixel points A1-A4 is determined to be a second binary value (for example, 0).

[0103]

[0102] Based on the above method, assuming that the multiple bit values ​​parsed from the first and last target number of pixel points in the watermark parsing line are consistent with the multiple first and last identification bit values ​​(such as "110") used in the watermark embedding process, it is determined that the watermark parsing line contains the above watermark information, and other bit values ​​contained in the watermark information can be further parsed from the watermark parsing line. The parsing process is similar to the process of parsing the first and last identification bit values. Both determine multiple pixel points corresponding to the same bit value from the watermark parsing line and the target candidate edge line, and perform corresponding size comparison of the pixel values ​​of the pixel points. The specific process will not be repeated here.

[0104]

[0103] After completing the above-mentioned parsing process for all pixels in the watermark parsing line, a binary string can be obtained. If the parsed binary string matches the binary string serving as the watermark information, it indicates that the watermark parsing line contains the watermark information, i.e., it is determined that the third image contains the watermark information.

[0105]

[0104] FIG6 is a flow chart of another blind watermark processing method provided in an embodiment of the present disclosure, which can be applied to a cloud desktop server. As shown in FIG6, the method includes the following steps.

[0106]

[0105] 601. Obtain a brightness image and watermark information composed of brightness components in a first image, where the first image is an image with a set color format that needs to be transmitted to a cloud desktop client for display, and the watermark information corresponds to the cloud desktop client.

[0107]

[0106] 602. Perform edge detection processing on the brightness image to determine the target edge line contained in the brightness image.

[0108]

[0107] 603. Embed the watermark information into the brightness image according to the target edge line.

[0109]

[0108] 604. Convert the brightness image embedded with the watermark information into a second image in a set color format.

[0110]

[0109] 605. Transmit the second image to the cloud desktop client for display.

[0111]

[0110] In actual applications, many enterprise users use cloud desktop services. In a cloud desktop scenario, the cloud desktop server can transmit a video stream to the cloud desktop client in the form of a video stream, and the video stream is composed of frames of images. For the purpose of enterprise information security, enterprise managers may require that the images displayed on the cloud desktop client are embedded with watermark information set by themselves, and even different watermark information can be set for different employees' cloud desktop clients. Therefore, before transmitting the video stream to the cloud desktop client, the cloud desktop server needs to embed watermark information into each frame of the image contained therein. The process of embedding the target watermark information by the cloud desktop server can be implemented with reference to the other embodiments described above and will not be repeated here.

[0112]

[0111] The blind watermark processing device of one or more embodiments of the present disclosure will be described in detail below. Those skilled in the art will understand that these devices can be configured using commercially available hardware components through the steps taught in this solution.

[0113]

[0112] FIG7 is a schematic structural diagram of a blind watermark processing device provided in an embodiment of the present disclosure. As shown in FIG7 , the device includes: an acquisition module 11, a detection module 12, an embedding module 13, and a conversion module 14.

[0114]

[0113] The acquisition module 11 is used to acquire a first brightness image and watermark information composed of brightness components in a first image, wherein the first image has a set color format.

[0115]

[0114] The detection module 12 is used to perform edge detection processing on the first brightness image to determine the target edge line contained in the first brightness image.

[0116]

[0115] An embedding module 13, configured to embed the watermark information into the first brightness image according to the target edge line.

[0117]

[0116] A conversion module 14 is used to convert the first brightness image embedded with the watermark information into the second image in the set color format.

[0118]

[0117] The device shown in FIG7 can execute the steps provided in the aforementioned embodiments. For detailed execution process and technical effects, please refer to the description in the aforementioned embodiments and will not be repeated here.

[0119] In one possible design, the structure of the blind watermark processing device shown in FIG8 can be implemented as an electronic device. As shown in FIG8 , the electronic device may include: a processor 21, a memory 22, and a communication interface 23. The memory 22 stores executable code. When the executable code is executed by the processor 21, the processor 21 can at least implement the blind watermark processing method provided in the aforementioned embodiment.

[0120]

[0119] In addition, an embodiment of the present disclosure provides a non-transitory machine-readable storage medium, on which executable code is stored. When the executable code is executed by a processor of an electronic device, the processor can at least implement the blind watermark processing method provided in the aforementioned embodiment.

[0121]

[0120] The device embodiments described above are merely illustrative, and the network elements described as separate components may or may not be physically separate. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. A person of ordinary skill in the art can understand and implement the present invention without inventive effort.

[0122] Through the description of the above embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by adding a necessary general hardware platform, or can also be implemented by a combination of hardware and software. Based on this understanding, the above technical solution, or the portion that contributes to the relevant art, can be embodied in the form of a computer product. The present disclosure can take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to magnetic disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0123]

[0122] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present disclosure, rather than to limit them. Although the present disclosure has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the various embodiments of the present disclosure.

Claims

Claims 1. A blind watermark processing method, comprising: Acquire a first luminance image composed of luminance components in a first image and watermark information, wherein the first image has a set color format; performing edge detection processing on the first brightness image to determine a target edge line contained in the first brightness image; The watermark information is embedded into the first brightness image according to the target edge line; and the first brightness image embedded with the watermark information is converted into a second image in the set color format.

2. The method according to claim 1, wherein: The performing edge detection processing on the first luminance image to determine a target edge line contained in the first luminance image includes: performing edge detection processing on the first luminance image to obtain a binary image used to reflect whether each pixel in the first luminance image is located at an edge position; performing line detection and / or contour detection processing on the binary image to obtain at least one edge line; and determining a target edge line from the at least one edge line.

3. The method according to claim 2, wherein: Determining a target edge line from the at least one edge line includes: detecting a plurality of key points contained in the first brightness image; and determining a target edge line from the at least one edge line based on a length of the at least one edge line, a length of the watermark information, and a distance between the at least one edge line and the plurality of key points.

4. The method according to claim 1, wherein: Embedding the watermark information into the first brightness image according to the target edge line includes: moving the target edge line along a set direction and a set distance to obtain a watermark embedding line; and embedding the watermark information into the watermark embedding line.

5. The method according to claim 4, wherein: The target edge line and the watermark embedding line have the same first length, the target edge line corresponds to a pixel point on the watermark embedding line, and the watermark information is a binary string of a second length; Embedding the watermark information into the watermark embedding line includes: determining, based on the first length and the second length, a plurality of first pixel points in the watermark embedding line corresponding to a target bit value in the binary string and a plurality of second pixel points in the target edge line, wherein the target bit value is a value of any bit in the binary string, and the plurality of first pixel points correspond one-to-one to the plurality of second pixel points; The pixel values ​​of the plurality of first pixel points are updated according to the target bit value, the pixel values ​​of the plurality of first pixel points, and the pixel values ​​of the plurality of second pixel points.

6. The method according to claim 5, wherein: The method of determining, based on the first length and the second length, a plurality of first pixel points in the watermark embedding line and a plurality of second pixel points in the target edge line corresponding to the target bit value in the binary string includes: determining, based on the height and width of the watermark embedding line, an embedding direction of the watermark information in the watermark embedding line; and determining, based on the first length, the second length and the embedding direction, a plurality of first pixel points in the watermark embedding line and a plurality of second pixel points in the target edge line corresponding to the target bit value in the binary string.

7. The method according to claim 5, wherein: The updating of the pixel values ​​of the multiple first pixel points according to the target bit value, the pixel values ​​of the multiple first pixel points and the pixel values ​​of the multiple second pixel points includes: if the target bit value is a first binary value, correspondingly updating the pixel values ​​of the multiple first pixel points with the weighted sum of the pixel values ​​of each corresponding pixel point in the multiple first pixel points and the multiple second pixel points; if the target bit value is a second binary value, correspondingly updating the pixel values ​​of the multiple first pixel points with the weighted difference of the pixel values ​​of each corresponding pixel point in the multiple first pixel points and the multiple second pixel points.

8. The method according to any one of claims 4 to 7, further comprising: Acquire a third image obtained by performing a setting operation on the second image, wherein the third image has the set color format; Acquiring a second luminance image composed of luminance components in the third image; performing edge detection processing on the second luminance image to determine a plurality of candidate edge lines contained in the second luminance image; moving a target candidate edge line by a set distance along a set direction to obtain a watermark resolution line, wherein the target candidate edge line is any one of the plurality of candidate edge lines; and determining whether the watermark resolution line contains the watermark information.

9. The method according to claim 8, wherein: The binary string serving as the watermark information includes a plurality of head and tail identification bit values; determining whether the watermark information is included in the watermark parsing line includes: determining a degree of difference in pixel values ​​of a plurality of pixels included in the watermark parsing line; and determining that the watermark information is not included in the watermark parsing line if the degree of difference is less than a set threshold; If the degree of difference is greater than or equal to the set threshold, then determine whether the watermark parsing line contains the multiple head and tail identification bit values ​​based on the pixel values ​​of the first and last target number of pixel points on the watermark parsing line and the target candidate edge line, and the target number matches the number of the multiple head and tail identification bit values; if the watermark parsing line contains the multiple head and tail identification bit values, then determine the other bit values ​​in the watermark information contained on the watermark parsing line based on the pixel values ​​of other pixel points on the watermark parsing line and the target candidate edge line, and the other pixel points refer to pixel points other than the target number of pixel points.

10. The method according to claim 9, wherein: The determining, based on the pixel values ​​of the first and last target number of pixel points of the watermark parsing line and the target candidate edge line, whether the watermark parsing line contains the multiple head and tail identification bit values ​​includes: determining a plurality of third pixel points corresponding to target identification bits from the first and last target number of pixel points of the watermark parsing line, and determining a plurality of fourth pixel points corresponding to the target identification bits from the first and last target number of pixel points of the target candidate edge line, wherein the plurality of third pixel points correspond to the plurality of fourth pixel points in a one-to-one manner, and the target identification bit is any one of the plurality of identification bits corresponding to the plurality of head and tail identification bit values; if the pixel values ​​of the plurality of third pixel points are greater than the pixel values ​​of the plurality of fourth pixel points, determining the bit value of the target identification bit to be a first binary value; if the pixel values ​​of the plurality of third pixel points are less than the pixel values ​​of the plurality of fourth pixel points, determining the bit value of the target identification bit to be a second binary value; and if the parsed bit values ​​of the plurality of identification bits match the plurality of head and tail identification bit values, determining that the watermark parsing line contains the plurality of head and tail identification bit values.

11. A blind watermark processing method, applied to a cloud desktop server, comprising: Obtaining a luminance image composed of luminance components of a first image and watermark information, wherein the first image is an image having a set color format to be transmitted to a cloud desktop client for display, and the watermark information corresponds to the cloud desktop client; performing edge detection processing on the luminance image to determine a target edge line contained in the luminance image; The watermark information is embedded in the brightness image according to the target edge line; the brightness image embedded with the watermark information is converted into a second image in the set color format; and the second image is transmitted to the cloud desktop client for display.

12. An electronic device, comprising: A memory, a processor, and a communication interface; wherein the memory stores an executable code, and when the executable code is executed by the processor, the processor executes the blind watermark processing method according to any one of claims 1 to 11.

13. A non-transitory machine-readable storage medium, wherein: The non-transitory machine-readable storage medium stores executable code. When the executable code is executed by a processor of an electronic device, the processor is caused to execute the following 21. The blind watermark processing method according to any one of claims 1 to 11.

14. A computer program product comprising: A computer program, wherein when the computer program is executed by a processor of an electronic device, the processor is caused to execute the blind watermark processing method according to any one of claims 1 to 11.

Images