Cross-reference is made to the following co-pending application, which is also hereby incorporated by reference in its entirety:
U.S. patent application Ser. No. 11/034,131 (Publ. No. 20050123194 A1) for “METHOD OF EMBEDDING COLOR INFORMATION IN PRINTED DOCUMENTS USING WATERMARKING,” by Z. Fan et al., filed Jan. 12, 2005, a divisional of U.S. patent application Ser. No. 10/082,535, filed Feb. 21, 2002.
Disclosed is a system and method for determining preferred image locations for placing watermark information for both hidden and obvious marks, and more particularly the use of at least one of three criteria (image similarity, contrast, and image value range) to determine the best area of hiding or showing the watermark, depending upon the user's intent for the mark.
It is known to use digital watermarks, and to obtain such marks by embedding a digital string into an image. The digital watermarks can be created either in a spatial domain or in a transform domain. In transform domain digital watermarking, the digital string is embedded using a transformation space, such as Fourier transform or the like, to obtain a spread spectrum characteristic of noise insensitivity. Correspondingly, the digital watermark is not an image and can not be simply reconstructed or verified optically, though the actually encoded digital watermark data can be arbitrary, thus also an image in some other transform domain. An example of spatial domain digital watermarking is found in U.S. Pat. No. 6,252,971 to S. Wang, for “DIGITAL WATERMARKING USING PHASE-SHIFTED STOCLUSTIC SCREENS,” issued Jun. 26, 2001, where the watermark can be reconstructed as image directly in the space domain.
Classical watermarks are image-wise watermarks, meaning that they can be viewed by a user, normally to verify authenticity, but often only to establish a perception of value or beauty. Image-wise digital watermarks exist in the form of glossmarks, correlation marks and embedded image watermarks as described, for example in U.S. patent application Ser. No. 11/034,131 (above), as well as U.S. patent application Ser. No. 10/876,001 (U.S. Publ. 20050128524 A1), for “ENHANCEMENT OF GLOSSMARK IMAGES AT LOW AND HIGH DENSITIES,” by Liu et al., filed Jun. 24, 2004, also incorporated herein by reference in its entirety.
The advantage of such watermarks is that they more closely resemble classical watermarks, albeit with the added capability of variable content. This variable content, however, also directly interacts with the background image and a truly automated use of variable watermarks requires the correct positioning (or identification of the watermark location) based on the watermark content and the image content. In other words, when an image-wise watermark is to be employed, and it is desirable to either make the mark visible or to hide the mark, the “best” or preferred position at which such a mark should be reproduced in the image is strongly dependent upon the nature of the mark as well as the image—where simply repositioning the mark within an image may significantly alter the detectability (desired/undesired) of a mark.
U.S. Pat. No. 6,956,958, by Z. Fan et al. “METHOD OF EMBEDDING COLOR INFORMATION IN PRINTED DOCUMENTS USING WATERMARKING”, issued Oct. 18, 2005, describes a method of enhancing color fidelity in multi-reproduction that includes an encoding part, which usually resides in a printer (or the printing part of a copier, but may also be resident in software stored in a computer) and a decoding part which usually resides in a scanner (or the scanning part of a copier, but may also be resident in software stored in a computer) so as to add color fidelity information directly to the output print. Each part can be divided into layers where the top layers are responsible for management of color information while the bottom layers are responsible for embedding/detection of digital watermarks containing the color information.
Accordingly, the present disclosure is directed to a system and a method for determining preferred image locations for placing watermark information for both hidden and obvious marks. Preferred locations provide either a high degree of hiding or visibility depending on the goal. At least three metrics may be employed in making a determination of a preferred position of a watermark, including (i) image value, (ii) image/watermark value similarity, and (iii) image/watermark contrast similarity.
Disclosed in embodiments herein is a method for determining a location for an image-wise watermark in relation to a target image, comprising: analyzing the target image by dividing the target image into a plurality of smaller areas and determining a characteristic metric for the areas thereof; and determining, based upon the characteristic metric, at least one location for the watermark image to be overlaid onto the target image.
Also disclosed in embodiments herein is a print production system for determining a location for an image-wise watermark in relation to a target image, comprising: a processor for analyzing the target image by dividing the target image into a plurality of smaller areas and determining a characteristic metric for the areas thereof; memory for recording the characteristic metric data for each of the areas analyzed by the processor; said processor further determining, based upon the characteristic metric, at least one location for a watermark image to be overlaid onto the target image, and overlaying said watermark image on the target image in the at least one location; and a printing engine for receiving the target image with the overlaid watermark image and rendering the image on a substrate.
Further disclosed in embodiments herein is a method for printing variable data with a watermark, comprising: receiving a target image into which an image-wise watermark is to be embedded; receiving a watermark image; analyzing the target image by dividing the target image into a plurality of smaller areas and determining a characteristic metric for the areas thereof; analyzing the watermark image by dividing the watermark image into a plurality of smaller areas and determining a characteristic metric for the areas thereof; and determining, based upon at least one of the characteristic metrics, at least one location for the watermark image to be overlaid onto the target image.
In the case of image-wise watermarking, two possible applications/intentions can be considered as the extreme cases, and all intermediate cases can be derived from two end points established by the extreme cases. In the first case, the watermark is intended to be as unobtrusive as possible, and in the second case, the watermark is intended to be clearly visible. An example of the first scenario is where the image-wise watermark is intended to be completely hidden. An example of the second scenario is a variable data glossmark storing, for example a serial number, on a photo.
The “best” area for embedding a watermark can generally be found following a combination of one or more of three criteria: (i) image/watermark value similarity; (ii) image/watermark contrast similarity; and (iii) image value range. As will be appreciated based upon the following discussion, the use of the criteria may be independent of one another, or two or more criteria may be combined using a weighted average or similar approach so as to optimize the placement of the watermark in order to achieve a desired objective of the watermark (e.g., maximize or minimize visibility).
Generally speaking, with respect to the image/watermark value similarity criteria, if the target image and the watermark image information are similar, the watermark will be more subtle or less detectable. On the other hand, if they are dissimilar, the watermark will be more obvious or apparent. As for the image/watermark contrast similarity, if the contrast of the target image is high, watermark contrast will be lost, and vice versa. Lastly, for the image value range criteria, since all watermarks are created by modulating the input image, sufficient image data must be present locally to serve as an information carrier (to carry the overlaid watermark image).
Having described the general considerations used to select locations for a watermark to be overlaid on a target image, attention is now directed to a more detailed discussion relative to each of the possible criteria used to determine a location. Referring to
In a similar manner, the watermark image 140, having been received and/or stored in memory, operation 144, is also reduced in size to a substantially smaller number of areas, say 4×4, as depicted at 154. The divided watermark image is characterized as indicated by reference numeral 150, and the associated characteristic metric data indicated as 158. An example of a watermark image is depicted in
Processing of the images in this manner can be justified by the application, where the watermark only covers a certain area of the image, or is replicated at several points in a target image, with one of the replications being in an optimized spot, or by identifying important and not so important areas of the watermark. In general, it can be said that if a position can be chosen, it also means that the watermark must be smaller than the target image; otherwise, no choice would be available. Moreover, while the disclosed embodiment is directed to particular images and relative number of areas or sections it should be recognized that these are illustrative examples, and that the systems and methods described relative to the examples have broad application and are not necessarily limited by the example images or the exemplary analysis details set forth.
In order to embed or overlay the watermark image shown in
Returning to
A similar processing can be performed for the contrast criteria at operations 128 and 170 if
Yet a third embodiment for the method by which an optimal watermark location is determined involves the image value range characteristic as noted above. In this embodiment, perhaps the simplest, area selection is based on the input image value range. The basis for this characteristic is the assumption that any coding or modulation of the image data to embed a watermark in the target image data requires that the target image act as an information carrier. Hence, the data of the target image must provide sufficient image data in a local area to serve as the information carrier for the watermark. The image value range is simply defined based on the watermark criteria, and in general will limit the useful area to exclude the extreme ends of the image. In other words, areas of the target image that would be most suitable for coding a watermark are mid-tone areas, whereas the totally white areas or fully saturated color areas would be the least suitable.
The following example illustrates the importance of the system and methods disclosed herein to automatically identify preferred or “best” watermark locations in a target digital image. Consider the scenario, in which a unique ID number is to be placed visibly over an image. In order to understand this example the reader is referred to
Knowledge of the watermark size, as well as knowledge of the optimized watermark areas would allow an automated system to assure that the complete ID is readable, even though parts of the ID are obscured in every instance of the ID number string (e.g.: the first portion of the ID is visible in one region of the image, a second portion in another region, and a last portion in yet a further region). This will encapsulate sufficient overlap to uniquely read the entire ID number even though there might not be a single area in the target image sufficiently large to hold the entire watermarked ID number.
As briefly mentioned above, the three criteria described in detail above may be employed, alone or in combination with one another (or other criteria) to determine a preferred location within an image to apply a watermark. Use of the system and method described above also requires that an instruction or requirement be established to indicate whether the process is to optimize visibility or “invisibility” of the watermark (i.e. overlaying in dissimilar or similar image areas). Next, a determination must be made as to which of the criteria will be employed to make the location determination. If more than one criterion is employed, the weighting of each criterion should also be established in relation to the particular intent of the watermark. Such weighting or other parameters (e.g., thresholds for contrast, variance, etc.) are then employed during the processing of the target image and/or the watermark image. Both, as indicated in
As a further example, consider the situation where a glossmark is to be embedded into a target image so that upon printing of the target with the glossmark, the mark will be visually unobtrusive, but nonetheless detectable. In such a situation, the image value range criteria is of particular import because areas with too much or too little toner are undesirable for the embedding of glossmarks. Hence, the image value range criteria would be used to rule out certain areas of the target image. Next, the contrast similarity criteria would be applied, but in this case to the target image only; assuming that even low contrast portions of the glossmark should be visible results in a “constant” contrast map for the glossmark image. The result of the contrast similarity criteria would then be employed to select areas with minimal variance as preferred locations for embedding the mark.
In yet a further application of the methods described herein, the areas identified for embedding the mark may be further employed to control the size of the watermark to be applied. For example, if a plurality of adjacent areas are suitable (e.g., above a contrast variance threshold), then it may also be possible to agglomerate the areas so as to provide a larger region (consisting of adjacent analysis areas) in which the watermark may be embedded. In other words, the size (magnification) of the watermark may be increased to cover more than a single area.
The disclosed system and method further find application in the production of variable or on-demand documents as depicted for example in
Those knowledgeable with variable data printing system will recognize that the schematic illustration of
It will be appreciated that various of the above-disclosed and other features and functions, or alternatives thereof, may be desirably combined into many other different systems or applications. Also that various presently unforeseen or unanticipated alternatives, modifications, variations or improvements therein may be subsequently made by those skilled in the art which are also intended to be encompassed by the following claims.
Number | Name | Date | Kind |
---|---|---|---|
3784289 | Wicker | Jan 1974 | A |
4149194 | Holladay | Apr 1979 | A |
4210346 | Mowry et al. | Jul 1980 | A |
4310180 | Mowry et al. | Jan 1982 | A |
5087507 | Heinzer | Feb 1992 | A |
5181254 | Schweizer et al. | Jan 1993 | A |
5234783 | Ng | Aug 1993 | A |
5284364 | Jain | Feb 1994 | A |
5450502 | Eschbach et al. | Sep 1995 | A |
5487567 | Volpe | Jan 1996 | A |
5488649 | Schellinger | Jan 1996 | A |
5583660 | Rylander | Dec 1996 | A |
5678133 | Siegel | Oct 1997 | A |
5695220 | Phillips | Dec 1997 | A |
5710636 | Curry | Jan 1998 | A |
5734752 | Knox | Mar 1998 | A |
5751432 | Gwaltney | May 1998 | A |
5788285 | Wicker | Aug 1998 | A |
5790703 | Wang | Aug 1998 | A |
5825892 | Braudaway et al. | Oct 1998 | A |
5853197 | Mowry et al. | Dec 1998 | A |
5901224 | Hecht | May 1999 | A |
5905819 | Daly | May 1999 | A |
5946103 | Curry | Aug 1999 | A |
5946414 | Cass et al. | Aug 1999 | A |
5949055 | Fleet et al. | Sep 1999 | A |
5995638 | Amidror et al. | Nov 1999 | A |
6031914 | Tewfik et al. | Feb 2000 | A |
6036233 | Braun et al. | Mar 2000 | A |
6061793 | Tewfik et al. | May 2000 | A |
6108512 | Hanna | Aug 2000 | A |
6192138 | Yamadaji | Feb 2001 | B1 |
6252971 | Wang | Jun 2001 | B1 |
6268866 | Shibata | Jul 2001 | B1 |
6304345 | Patton et al. | Oct 2001 | B1 |
6332194 | Bloom et al. | Dec 2001 | B1 |
6439465 | Bloomberg | Aug 2002 | B1 |
6456745 | Bruton et al. | Sep 2002 | B1 |
6572025 | Nishikado et al. | Jun 2003 | B1 |
6606168 | Rylander | Aug 2003 | B1 |
6707928 | Acharya et al. | Mar 2004 | B2 |
6714320 | Nakahara et al. | Mar 2004 | B1 |
6731775 | Ancin | May 2004 | B1 |
6741758 | Hayashi et al. | May 2004 | B2 |
6744448 | Bernard et al. | Jun 2004 | B1 |
6763121 | Shaked et al. | Jul 2004 | B1 |
6813710 | Wu et al. | Nov 2004 | B1 |
6823075 | Perry | Nov 2004 | B2 |
6873711 | Murakami et al. | Mar 2005 | B1 |
6882737 | Lofgren et al. | Apr 2005 | B2 |
6906825 | Nakahara et al. | Jun 2005 | B1 |
6956958 | Fan et al. | Oct 2005 | B2 |
7020349 | Brunk | Mar 2006 | B2 |
7092128 | Wang et al. | Aug 2006 | B2 |
7126721 | Wang et al. | Oct 2006 | B2 |
7139101 | Loce et al. | Nov 2006 | B2 |
7139521 | Ng et al. | Nov 2006 | B2 |
7148999 | Xu et al. | Dec 2006 | B2 |
7180631 | Ide et al. | Feb 2007 | B2 |
7180635 | Wang et al. | Feb 2007 | B2 |
7193751 | Wang et al. | Mar 2007 | B2 |
7352493 | Liu et al. | Apr 2008 | B2 |
7515732 | Fan et al. | Apr 2009 | B2 |
20010026616 | Tanaka | Oct 2001 | A1 |
20020090107 | Acharya et al. | Jul 2002 | A1 |
20020178362 | Kwon | Nov 2002 | A1 |
20030123661 | Oh et al. | Jul 2003 | A1 |
20030152225 | Kunisa | Aug 2003 | A1 |
20030210784 | Noridomi et al. | Nov 2003 | A1 |
20040052401 | Suzaki | Mar 2004 | A1 |
20050025333 | Fujii et al. | Feb 2005 | A1 |
20050031160 | Shaked et al. | Feb 2005 | A1 |
20050123194 | Fan et al. | Jun 2005 | A1 |
20050128523 | Liu et al. | Jun 2005 | A1 |
20050128524 | Liu et al. | Jun 2005 | A1 |
20050135851 | Ng et al. | Jun 2005 | A1 |
20050259844 | Kot et al. | Nov 2005 | A1 |
20050286083 | Wang et al. | Dec 2005 | A1 |
20060044617 | Wang et al. | Mar 2006 | A1 |
20060072159 | Eschbach et al. | Apr 2006 | A1 |
20060127117 | Eschbach et al. | Jun 2006 | A1 |
20070047760 | Sharma et al. | Mar 2007 | A1 |
20070139714 | McElvain | Jun 2007 | A1 |
20080270801 | Levy et al. | Oct 2008 | A1 |
Number | Date | Country |
---|---|---|
0859506 | Aug 1998 | EP |
0926897 | Jun 1999 | EP |
1316917 | Jun 2003 | EP |
1705531 | Mar 2005 | EP |
1705529 | Sep 2006 | EP |
2217258 | Oct 1989 | GB |
2001-320569 | Nov 2001 | JP |
WO9963443 | Dec 1999 | WO |
WO2005122080 | Dec 2005 | WO |
Number | Date | Country | |
---|---|---|---|
20070177759 A1 | Aug 2007 | US |