# Patent

## Title
Full-color visibility model using CSF which varies spatially with local luminance

## Abstract

The present disclosure relate generally to color science and digital watermarking. A full color visibility model has been developed which has good correlation to subjective visibility tests for color patches degraded with a watermark. A relatively better correlation can be achieved with a model that applies a luminance correction to the contrast sensitivity functions (CSF). The model can be applied during the watermark embed process, using a pyramid based method, to obtain equal visibility. Better robustness and visibility can be obtained with equal visibility embed than uniform strength embed. Of course, other features, combinations and claims are disclosed as well.

## Background
RELATED APPLICATION DATA
This patent application claims the benefit of US Provisional Patent Application No. 61/923,060, filed Jan. 2, 2014, which is hereby incorporated herein by reference.
This application is related to U.S. Pat. No. 8,199,969, US Published Patent Application No. US 2010-0150434 A1; U.S. patent application Ser. No. 13/975,919, filed Aug. 26, 2013; and US Provisional Application Nos. 61/693,106, filed Aug. 24, 2012; 61/716,591, filed Oct. 21, 2012; and 61/719,920, filed Oct. 29, 2012; and 61/749,767, filed Jan. 7, 2013.
The above patent documents are each hereby incorporated herein by reference in their entirety.


TECHNICAL FIELD
The present disclosure relates generally to color science, image processing, steganographic data hiding and digital watermarking.
BACKGROUND AND SUMMARY
The term “steganography” generally means data hiding. One form of data hiding is digital watermarking. Digital watermarking is a process for modifying media content to embed a machine-readable (or machine-detectable) signal or code into the media content. For the purposes of this application, the data may be modified such that the embedded code or signal is imperceptible or nearly imperceptible to a user, yet may be detected through an automated detection process. Most commonly, digital watermarking is applied to media content such as images, audio signals, and video signals.
Digital watermarking systems may include two primary components: an embedding component that embeds a watermark in media content, and a reading component that detects and reads an embedded watermark. The embedding component (or “embedder” or “encoder”) may embed a watermark by altering data samples representing the media content in the spatial, temporal or some other domain (e.g., Fourier, Discrete Cosine or Wavelet transform domains). The reading component (or “reader” or “decoder”) analyzes target content to detect whether a watermark is present. In applications where the watermark encodes information (e.g., a message or payload), the reader may extract this information from a detected watermark.
A watermark embedding process may convert a message, signal or payload into a watermark signal. The embedding process then combines the watermark signal with media content and possibly another signals (e.g., an orientation pattern or synchronization signal) to create watermarked media content. The process of combining the watermark signal with the media content may be a linear or non-linear function. The watermark signal may be applied by modulating or altering signal samples in a spatial, temporal or some other transform domain.
A watermark encoder may analyze and selectively adjust media content to give it attributes that correspond to the desired message symbol or symbols to be encoded. There are many signal attributes that may encode a message symbol, such as a positive or negative polarity of signal samples or a set of samples, a given parity (odd or even), a given difference value or polarity of the difference between signal samples (e.g., a difference between selected spatial intensity values or transform coefficients), a given distance value between watermarks, a given phase or phase offset between different watermark components, a modulation of the phase of the host signal, a modulation of frequency coefficients of the host signal, a given frequency pattern, a given quantizer (e.g., in Quantization Index Modulation) etc.
The present assignee's work in steganography, data hiding and digital watermarking is reflected, e.g., in U.S. Pat. Nos. 6,947,571; 6,912,295; 6,891,959. 6,763,123; 6,718,046; 6,614,914; 6,590,996; 6,408,082; 6,122,403 and 5,862,260, and in published specifications WO 9953428 and WO 0007356 (corresponding to U.S. Pat. Nos. 6,449,377 and 6,345,104). Each of these patent documents is hereby incorporated by reference herein in its entirety. Of course, a great many other approaches are familiar to those skilled in the art. The artisan is presumed to be familiar with a full range of literature concerning steganography, data hiding and digital watermarking.
One possible combination of the inventive teaching is a method including: receiving a color image or video; transforming the color image or video signal by separating the color image or video into at least first data representing a first color channel of the color image or video and second data representing a second color channel of the color image or video, where the first data comprises a digital watermark signal embedded therein and the second data comprises the digital watermark signal embedded therein with a signal polarity that is inversely related to the polarity of the digital watermark signal in the first data; subtracting the second data from the first data to yield third data; using at least a processor or electronic processing circuitry, analyzing the third data to detect the digital watermark signal; once detected, providing information associated with the digital watermark signal.
Another combination is a method including: obtaining first data representing a first chrominance channel of a color image or video, where the first data comprises a watermark signal embedded therein; obtaining second data representing a second chrominance channel of the color image or video, the second data comprising the watermark signal embedded therein but with a signal polarity that is inversely related to the polarity of the watermark signal in the first data; combining the second data with the first data in manner that reduces image or video interference relative to the watermark signal, said act of combining yielding third data; using at least a processor or electronic processing circuitry, processing the third data to obtain the watermark signal; once obtained, providing information associated with the watermark signal.
Still another combination is an apparatus comprising: a processor or electronic processing circuitry to control: (a) handling of first data representing a first color channel of a color image or video, where the first data comprises a watermark signal embedded therein; (b) handling of second data representing a second color channel of the color image or video, the second data comprising the watermark signal embedded therein but with a signal polarity that is inversely related to the polarity of the watermark signal in the first data; (c) combining the second data with the first data in manner that reduces image or video interference relative to the watermark signal, the combining yielding third data; (d) processing the third data to obtain the watermark signal; and (e) once obtained, providing information associated with the watermark signal.
Yet another possible combination is a method including: a method including: obtaining first data representing a first chrominance channel of a color image or video signal; obtaining second data representing a second chrominance channel of the color image or video signal; using a processor or electronic processing circuitry, embedding a watermark signal in the first data with a first signal polarity; using a processor or electronic processing circuitry, transforming the second data by embedding the watermark signal in the second data so that when embedded in the second data the watermark signal comprises a second signal polarity that is inversely related to the first signal polarity of the watermark signal in the first data; combining the watermarked first data and the watermarked second data to yield a watermarked version of the color image or video signal, whereby during detection of the watermark signal from the watermarked version of the color image or video signal, the second data is combined with the first data in a manner that reduces image or video signal interference relative to the watermark signal.
Still a further combination is a digital watermarking method comprising: using a programmed electronic processor, modeling a first color ink and a second color ink in terms of CIE Lab values; modulating the values with a watermarking signal; scaling the modulated values in a spatial frequency domain; spatially masking the scaled, modulated values; providing the spatially masked, scaled, modulated values, such values carrying the watermark signal.
Further combinations, aspects, features and advantages will become even more apparent with reference to the following detailed description and accompanying drawings.



BRIEF DESCRIPTION OF THE DRAWINGS
The patent or application file contains at least one drawing executed in color. Copies of this patent or patent application publication with color drawing(s) will be provided by the Office upon request and payment of the necessary fee.
FIG. 1 represents a color image.
FIG. 2 represents a first color channel (‘a’ channel) of the color image representation shown in FIG. 1.
FIG. 3 represents a second color channel (‘b’ channel) of the color image representation shown in FIG. 1.
FIG. 4 is a representation of the sum of the first color channel of FIG. 2 and the second color channel of FIG. 3 (e.g., a+b).
FIG. 5 is a graph showing a histogram standard deviation of FIG. 4.
FIG. 6 is a representation of the difference between the first color channel of FIG. 2 and the second color channel of FIG. 3 (a−b).
FIG. 7 is a graph showing a histogram standard deviation of FIG. 6.
FIG. 8 is an image representation of the difference between the first color channel of FIG. 2 (including a watermark signal embedded therein) and the second color channel of FIG. 3 (including the watermark signal embedded therein).
FIG. 9 is a graph showing a histogram standard deviation of FIG. 8.
FIGS. 10a and 10b are block diagrams showing, respectively, an embedding process and a detection process.
FIG. 11 is a diagram showing watermarks embedded in first and second video frames.
FIG. 12 is a diagram showing a detailed signal size view with ink increments of 2%, and the addition of press visibility constraints.
FIG. 13a corresponds to Appendix D's FIG. 1, which shows a quality ruler increasing in degradation from B (slight) to F (strong).
FIG. 13b corresponds to Appendix D's FIG. 2, which shows thumbnails of the 20 color patch samples with a watermark applied.
FIG. 14 corresponds to Appendix D's FIG. 3, which shows a mean observer responses with 95% confidence intervals for color patches.
FIG. 15 corresponds to Appendix D's FIG. 4, which shows mean observer response compared with a proposed visibility model.
FIG. 16 corresponds to Appendix D's FIG. 5, which shows mean observer response compared with the proposed visibility model with luminance adjustment.
FIG. 17 corresponds to Appendix D's FIG. 6, which shows mean observer response compared with S-CIELAB.
FIG. 18 corresponds to Appendix D's FIG. 7, which shows watermark embedding with uniform signal strength (left) and equal visibility from a visibility model (right). The insets are magnified to show image detail.
FIG. 19 corresponds to Appendix D's FIG. 8, which shows visibility map from uniform signal strength embedding (left) and equal visibility embedding (right) from FIG. 18.
FIG. 20 corresponds with Appendix D's FIG. 9, which shows Apple tart, Giraffe stack and Pizza puff design used in tests.



DETAILED DESCRIPTION
Portions of the following disclosure discusses a digital watermarking technique that utilizes at least two chrominance channels (also called “color planes,” “color channels” and/or “color direction”). Chrominance is generally understood to include information, data or signals representing color components of an image or video. In contrast to a color image or video, a grayscale (monochrome) image or video has a chrominance value of zero.
Media content that includes a color image (or color video) is represented in FIG. 1. An industry standard luminance and chrominance color space is called “Lab” (for Lightness (or luminance), plus ‘a’ and ‘b’ color channels) that can be used to separate components of images and video. FIG. 2 is an ‘a’ channel representation of FIG. 1 (shown in grayscale), and FIG. 3 is a ‘b’ channel representation of FIG. 1 (shown in grayscale). Of course, our inventive methods and apparatus will apply to and work with other color schemes and techniques as well. For example, alternative luminance and chrominance color schemes include “Yuv” (Y=luma, and ‘u’ and ‘v’ represent chrominance channels) and “Ycc.” (also a dual chrominance space representation).
Let's first discuss the additive and subtractive effects on FIGS. 2 and 3. FIG. 4 illustrates a representation of the result of adding the ‘a’ channel (FIG. 2) with the ‘b’ channel (FIG. 3). FIG. 6 illustrates a representation of the result of subtracting the ‘b’ channel (FIG. 3) from the ‘a’ channel (FIG. 2). The result of subtracting the ‘b’ channel from the ‘a’ channel yields reduced image content relative to adding the two channels since the ‘a’ and ‘b’ color planes have correlated image data in the Lab scheme. (In typical natural imagery, the ‘a’ and ‘b’ chrominance channels tend to be correlated. That is to say where ‘a’ increases, ‘b’ also tends to increase. One measure of this is to measure the histogram of the two chrominance planes when they are added (see FIG. 5), and compare that to the histogram when the two color planes are subtracted (see FIG. 7). The fact that the standard deviation of FIG. 7 is about half that of FIG. 5 also supports this conclusion, and illustrates the reduction in image content when ‘b’ is subtracted from ‘a’.) In this regard, FIG. 4 provides enhanced or emphasized image content due to the correlation. Said another way, the subtraction of the FIG. 3 image from FIG. 2 image provides less image interference or reduces image content. The histogram representations of FIG. 4 and FIG. 6 (shown in FIGS. 5 and 7, respectively) further support this conclusion.
Now let's consider watermarking in the context of FIGS. 2 and 3.
In a case where a media signal includes (or may be broken into) at least two chrominance channels, a watermark embedder may insert digital watermarking in both the ‘a’ color direction (FIG. 2) and ‘b’ color direction (FIG. 3). This embedding can be preformed in parallel (if using two or more encoders) or serial (if using one encoder). The watermark embedder may vary the gain (or signal strength) of the watermark signal in the ‘a’ and ‘b’ channel to achieve improved hiding of the watermark signal. For example, the ‘a’ channel may have a watermark signal embedded with signal strength that greater or less than the watermark signal in the ‘b’ channel. Alternatively, the watermark signal may be embedded with the same strength in both the ‘a’ and ‘b’ channels. Regardless of the watermark embedding strength, watermark signal polarity is preferably inverted in the ‘b’ color plane relative to the ‘a’ color plane. The inverted signal polarity is represented by a minus (“−”) sign in equations 1 and 2.

WMa=a(channel)+wm  (1)

WMb=b(channel)−wm  (2)

WMa is a watermarked ‘a’ channel, WMb is a watermarked ‘b’ channel, and wm represents a watermark signal. A watermarked color image (including L and WMb and WMa) can be provided, e.g., for printing, digital transfer or viewing.
An embedded color image is obtained (from optical scan data, memory, transmission channel, etc.), and data representing the color image is communicated to a watermark detector for analysis. The detector (or a process, processor or electronic processing circuitry used in conjunction with the detector) subtracts WMb from WMa resulting in WMres as shown below:

WMres=WMa−WMb  (3)

WMres=(a+wm)−(b−wm)  (4)

WMres=(a−b)+2*wm  (5)

This subtraction operation yields reduced image content (e.g., FIG. 6) as discussed above. The subtraction or inverting operation of the color channels also emphasizes or increases the watermark signal (2*wm), producing a stronger watermark signal for watermark detection. Indeed, subtracting the color channels increases the watermark signal-to-media content ratio: WMres=(a−b)+2*wm.
FIG. 8 illustrates the result of equation 5 (with respect to watermarked versions of FIG. 2 and FIG. 3). As shown, the perceptual “graininess” or “noise” in the image corresponds to the emphasized watermark signal. The image content is also reduced in FIG. 8. A histogram representation of FIG. 8 is shown in FIG. 9 and illustrates a favorable reduction of image content.
A watermark detector may extract or utilize characteristics associated with a synchronization signal (if present) from a frequency domain representation of WMres. The detector may then use this synchronization signal to resolve scale, orientation, and origin of the watermark signal. The detector may then detect the watermark signal and obtain any message or payload carried thereby.
To even further illustrate the effects of improving the watermark signal-to-media content ratio with our inventive processes and systems, we provide some additive and subtractive examples in the content of watermarking.
For the following example, a watermark signal with the same polarity is embedded in each of the ‘a’ color channel and the ‘b’ color channel. The same signal polarity is represented by a plus (“+”) sign in equations 6 and 7.

WMa=a+wm  (6)

WMb=b+wm  (7)

WMa is a watermarked ‘a’ channel, WMb is a watermarked ‘b’ channel, and wm represents a watermark signal. A watermarked color image (including L and WMb and WMa) can be provided, e.g., for printing, digital transfer or viewing.
An embedded color image is obtained, and data representing the color image is communicated to a watermarked detector for analysis. The detector (or a process, processor, or electronic processing circuitry used in conjunction with the detector) adds the ‘a’ and ‘b’ color channels to one another (resulting in WMres) as shown below:

WMres=WMa+WMb  (8)

WMres=(a+wm)+(b+wm)  (9)

WMres=(a+b)+2*wm  (10)

This addition operation results in increased image content (e.g., FIG. 4). Indeed, image interference during watermark detection will be greater since the two correlated ‘a’ and ‘b’ color channels tend to reinforce each other.
By way of further example, if WMb is subtracted from WMa (with watermark signals having the same polarity), the following results:

WMres=WMa−WMb  (11)

WMres=(a+wm)−(b+wm)  (12)

WMres=(a−b)+≈0*wm  (13)

A subtraction or inverting operation in a case where a watermark signal includes the same polarity decreases image content (e.g., FIG. 4), but also significantly decreases the watermark signal. This may result in poor—if any—watermark detection.
FIGS. 10a and 10b are flow diagrams illustrating some related processes and methods. These processes may be carried out, e.g., via a computer processor, electronic processing circuitry, printer, handheld device such as a smart cell phone, etc.
With reference to FIG. 10a, a color image (or video) is obtained and separated into at least two (2) color channels or planes (10). A watermark signal is determined for the color image or video (12). Of course, the watermark signal for the color image or video may be determined prior to or after color plane separation. The determined watermark signal is embedded in a first of the color planes (14). An inverse polarity version of the watermark signal is embedded in a second color plane. The color planes are recombined (perhaps with data representing luminance) to form a composite color image.
With reference to FIG. 10b, a watermarked color image or video is obtained or received (11). The color image (or video) has or can be separated into at least two (2) color planes or channels (13). A first color plane includes a watermark signal embedded therein. A second color plane includes the watermark signal embedded therein with a polarity that is inversely related to the watermark signal in the first color plane. The watermarked second color plane is subtracted from the watermarked first color (15). The result of the subtraction is analyzed to detect the watermark signal. A detected watermark message, signal or payload can be provided (19), e.g., to a remote database to obtain related metadata or information, to a local processor, for display, to a rights management system, to facilitate an online transaction, etc.
In addition to the Lab color scheme discussed above, a watermark signal may be embedded in color image (or video) data represented by RGB, Yuv, Ycc, CMYK or other color schemes, with, e.g., a watermark signal inserted in a first chrominance direction (e.g., red/green direction, similar to that discussed above for the ‘a’ channel) and a second chrominance direction (e.g., a blue/yellow direction, similar to that discussed above for the ‘b’ channel). For watermark signal detection with an alterative color space, e.g., an RGB or CMYK color space, an image can be converted to Lab (or other color space), or appropriate weights of, e.g., RGB or CMY channels, can be used. For example, the following RGB weights may be used to calculate ‘a’−‘b’: Chrominance Difference=0.35*R−1.05*G+0.70*B+128, where R, G and B are 8-bit integers.
Further Considerations of Video
The human contrast sensitivity function curve shape with temporal frequency (e.g., relative to time) has a very similar shape to the contrast sensitivity with spatial frequency.
Successive frames in a video are typically cycled at about at least 60 Hz to avoid objectionable visual flicker. So-called “flicker” is due to the high sensitivity of the human visual system (HVS) to high temporal frequency changes in luminance. The human eye is about ten (10) times less sensitive to high temporal frequency chrominance changes.
Consider a video sequence with frames as shown in FIG. 11. A chrominance watermark can be added to frame 1 per the above description for images. In a similar way, a watermark is added to frame 2 but the polarity is inverted as shown in FIG. 11.
In order to recover the watermark, pairs of frames are processed by a watermark detector, and the ‘a’ channels are subtracted from each other as shown below.

Det_a=(a1+wm)−(a2−wm)=(a1−a2)+2*wm  (14)

Det_a refers to watermark detection processing of the ‘a’ channel. Because of the temporal correlation between frames, the image content in equation 14 is reduced while the watermark signal is reinforced.
In a similar way the ‘b’ channels are also subtracted from each other

Det_b=(b1−wm)−(b2+wm)=(b1−b2)−2*wm  (15)

Det_a refers to watermark detection processing of the ‘b’ channel. Equation 14 and 15 are then subtracted from each other as shown below in equation 16.




  
    
      
        
          
            
              
                
                  Det_a
                  -
                  Det_b
                
                =
                
                  
                    (
                    
                      
                        a
                        ⁢
                        
                          
                        
                        ⁢
                        1
                      
                      -
                      
                        a
                        ⁢
                        
                          
                        
                        ⁢
                        2
                      
                      +
                      
                        2
                        *
                        wm
                      
                    
                    )
                  
                  -
                  
                    (
                    
                      
                        b
                        ⁢
                        
                          
                        
                        ⁢
                        1
                      
                      -
                      
                        b
                        ⁢
                        
                          
                        
                        ⁢
                        2
                      
                      -
                      
                        2
                        *
                        wm
                      
                    
                    )
                  
                
              
            
          
          
            
              
                =
                
                  
                    (
                    
                      
                        a
                        ⁢
                        
                          
                        
                        ⁢
                        1
                      
                      -
                      
                        a
                        ⁢
                        
                          
                        
                        ⁢
                        2
                      
                    
                    )
                  
                  -
                  
                    (
                    
                      
                        b
                        ⁢
                        
                          
                        
                        ⁢
                        1
                      
                      -
                      
                        b
                        ⁢
                        
                          
                        
                        ⁢
                        2
                      
                    
                    )
                  
                  +
                  
                    4
                    *
                    wm
                  
                
              
            
          
        
         
      
    
    
      
        (
        16
        )
      
    
  




In generally, related (but not necessarily immediately adjacent) frames will have spatially correlated content. Because of the spatial correlation between the ‘a’ and ‘b’ frames, the image content is reduced while the watermark signal is reinforced. See equation 16.
For any one pair of frames selected by a watermark detector, the polarity of the watermark could be either positive or negative. To allow for this, the watermark detector may examine both polarities.
Watermark Embedding for Spot Colors
Product packaging is usually printed in one of two ways:
1. Process color printing using cyan, magenta yellow and/or black (CMYK)
2. Spot color printing (e.g., using special Pantone color or other ink sets)
The majority of packaging is printed using spot colors mainly for reasons of cost and color consistency, and to achieve a wide color gamut over various packaging. Some conventional watermarking techniques embed digital watermarks in either CMYK for printed images or RGB for digital images that are being displayed. But how to embed a watermark with a spot color?
An improvement addresses problem associated with watermarking spot color images. Preferably, packaging contains two (2) or more spot colors (e.g., printed cooperatively to achieve a certain color consistency). Each different color is altered to collectively carry a watermark signal. A maximum signal strength within a user selectable visibility constraint with watermark in at least two (2) of the spot.
A maximized watermark signal is embedded preferably by modulating the spot color inks within a certain visibility constraint across the image. The approach models a color (ink) in terms of CIE Lab values. Lab is a uniform perceptual color space where a unit difference in any color direction corresponds to an equal perceptual difference.
The Lab axes are then scaled for the spatial frequency of the watermark being added to the image, in a similar manner to the Spatial CieLab model by X. Zhang and B. A. Wandell, e.g., “A spatial extension of CIELAB for digital color image reproduction,” in Proceedings of the Society of Information Display Sumposium (SID '96), vol. 27, pp. 731-734, San Jose, Calif., USA, June 1996. This is a uniform perceptual color space which we will call SLAB, where a unit difference in any color direction corresponds to an equal perceptual difference due to the addition of a watermark signal at that spatial frequency.
The allowable visibility magnitude in SLAB is scaled by spatial masking of the cover image. Spatial masking of the cover image can include the techniques described by Watson in US Published Patent Application No. US 2006-0165311 A1, which is hereby incorporated by reference in its entirety, and can be used to scale the allowable visibility across the image. This is a uniform perceptual color space which we will call VLAB, where the visibility circle is scaled to correspond to an equal perceptual difference due to the addition of a watermark signal at that spatial frequency for that particular image.
The chrominance embedding techniques discussed above forms the foundation for the present watermark embedding techniques. Bradley et al. (Appendix A, which is hereby incorporated by reference in its entirety from U.S. patent application Ser. No. 13/975,919, filed Aug. 26, 2013) further developed this work to use an iterative embed technique to insert the maximum watermark signal into CMYK images.
The spot color technique described extends this work to embedding that supports special color inks (e.g., spot colors) used in packaging and uses a full color visibility model with spatial masking. A geometric enumerated embed approach can be used to evaluate a range of possible ink changes, which meet the user selected visibility constraint and press constraints. The set of allowable ink changes are evaluated to choose the pair of ink changes which result in the maximum signal strength while meeting the visibility and press constraints.
FIG. 12 shows a detailed signal size view with ink increments of 2%, and the addition of press constraints.
A user can insert a maximum watermark signal, while meeting any pre-required visibility constraint. The method has been applied to the case of two spot colors and images have been produced which are more than twice as robust to Gaussian noise as a single color image which is embedded using a luminance only watermark to the same visibility.
A method has been described which allows an image containing 2 or more spot colors to be embedded with a watermark in 2 of the spot colors, with the maximum signal strength within a user selectable visibility constraint.
A look-up table based approach can be used for given colors at given locations, and can easily be extended to 3 or more dimensions while still being computationally reasonable.
Additional related disclosure is found in Appendix B & Appendix C, which are each hereby incorporated herein by reference in its entirety from U.S. patent application Ser. No. 13/975,919, filed Aug. 26, 2013.
Full-Color Visibility Model
A full color visibility model has been developed that uses separate contrast sensitivity functions (CSFs) for contrast variations in luminance and chrominance (red-green and blue-yellow) channels. The width of the CSF in each channel can be varied spatially depending on the luminance of the local image content. The CSF can be adjusted so that relatively more blurring occurs as the luminance of the local region decreases. The difference between the contrast of the blurred original and marked image can be measured using a color difference metric.
This spatially varying CSF performed better than a fixed CSF in the visibility model, approximating subjective measurements of a set of test color patches ranked by human observers for watermark visibility.
A full color visibility model can be a powerful tool to measure visibility of an image watermark. Watermarks used for packaging can be inserted in the chrominance domain to obtain the best robustness per unit visibility. A chrominance image watermark is preferably embedded in a way that the color component in the cover image is minimally altered and is hardly noticeable, due to human vision system's low sensitivity to color changes.
One example of a color visibility model is discussed relative to Spatial CIELAB (S-CIELAB). The accuracy of this model was tested by comparing it to human subjective tests on a set of watermarked color patches. The model was found to significantly overestimate the visibility of some dark color patches. A correction can be applied to the model for the variation of the human contrast sensitivity function (CSF) with luminance. After luminance correction, better correlation was obtained with the subjective tests.
The luminance and chrominance CSF of the human visual system has been measured for various retinal illumination levels. The luminance CSF variation was measured by Van Nes (1967) and the chrominance CSF variation by van der Horst (1969). These measurements show a variation in peak sensitivity of about a factor of 8 for luminance and 5 for chrominance over retinal illumination levels which change by about a factor of 100.
Since the retinal illumination can change by about a factor of 100 between the lightest to darkest area on a page, the CSF peak sensitivity and shape can change significantly. The function is estimated by the average local luminance on the page, and a spatially dependent CSF is applied to the image. This correction is similar to the luminance masking in adaptive image dependent compression.
The luminance dependent CSF performed better than a fixed CSF in the visibility model, when compared to subjective measurements of a set of test color patches ranked by human observers for watermark visibility. In some cases, we use a method of applying a spatially dependent CSF which depends on local image luminance.
The visibility model can be used to embed watermark into images with equal visibility. During the embedding stage, the visibility model can predict the visibility of the watermark signal and then adjust the embedding strength. The result will be an embedded image with a uniform watermark signal visibility, with the embedding strength varying depending on the cover image's content.
The following documents are hereby incorporated herein by reference: Lyons, et al. “Geometric chrominance watermark embed for spot color,” Proc. Of SPIE, vol. 8664, Imaging and Printing in a Web 2.0 World IV, 2013; Zhang et al. “A spatial extension of CIELAB for digital color-image reproduction” Journal of the Society for Information Display 5.1 (1997): 61-63; Van Nes et al. “Spatial modulation transfer in the human eye,” Journal of Optical Society of America, vol. 57, issue 3, pp. 401-406, 1967; Van der Horst et al. “Spatiotemporal chromaticity discrimination,” Journal of Optical Society of America, vol. 59, issue 11, 1969; and Watson, “DCTune,” Society for information display digest of technical papers XXIV, pp. 946-949, 1993.
In some cases, even better results can be achieved by combining an attention model with our above visibility model when embedding watermarks in color image data. An attention model generally predicts where the human eye is drawn to when viewing an image. For example, the eye may seek out flesh tone colors and sharp contrast areas. One example attention model is described in Itti et al., “A Model of Saliency-Based Visual Attention for Rapid Scene Analysis,” IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 20, NO. 11, NOVEMBER 1998, pgs. 1254-1259, which is hereby incorporated herein by reference.
High visual traffic areas identified by the attention model, which would otherwise be embedded with a relatively strong or equal watermark signal, can be avoided or minimized by a digital watermark embedder.
Additional related disclosure is found in Appendix D, included as part of this specification, and which is hereby incorporated herein by reference in its entirety.
Disclosure from Appendix D is provided below:
Full-Color Visibility Model Using CSF which Varies Spatially with Local Luminance
ABSTRACT: A full color visibility model has been developed that uses separate contrast sensitivity functions (CSFs) for contrast variations in luminance and chrominance (red-green and blue-yellow) channels. The width of the CSF in each channel is varied spatially depending on the luminance of the local image content. The CSF is adjusted so that more blurring occurs as the luminance of the local region decreases. The difference between the contrast of the blurred original and marked image is measured using a color difference metric.
This spatially varying CSF performed better than a fixed CSF in the visibility model, approximating subjective measurements of a set of test color patches ranked by human observers for watermark visibility. The effect of using the CIEDE2000 color difference metric compared to CIEDE1976 (i.e., a Euclidean distance in CIELAB) was also compared.
Introduction
A full color visibility model is a powerful tool to measure the visibility of the image watermark. Image watermarking is a technique that covertly embeds additional information in a cover image, such that the ownership, copyright and other details about the cover image can be communicated. Watermarks used for packaging are inserted in the chrominance domain to obtain the best robustness per unit visibility. See Robert Lyons, Alastair Reed and John Stach, “Geometric chrominance watermark embed for spot color,” Proc. Of SPIE, vol. 8664, Imaging and Printing in a Web 2.0 World IV, 2013. The chrominance image watermark is embedded in a way that the color component in the cover image is minimally altered and is hardly noticeable, due to human vision system's low sensitivity to color changes.
This visibility model is similar to Spatial CIELAB (S-CIELAB). See Xuemei Zhang and Brian A. Wandell, “A spatial extension of CIELAB for digital color-image reproduction” Journal of the Society for Information Display 5.1 (1997): 61-63. The accuracy of this model was tested by comparing it to subjective tests on a set of watermarked color patches. The model was found to significantly overestimate the visibility of some dark color patches. A correction was applied to the model for the variation of the human contrast sensitivity function (CSF) with luminance as described below. After luminance correction, good correlation was obtained with the subjective tests.
The luminance and chrominance CSF of the human visual system has been measured for various retinal illumination levels. The luminance CSF variation was measured by Floris L. Van Nes and Maarten Bouman, “Spatial modulation transfer in the human eye,” Journal of Optical Society of America, vol. 57, issue 3, pp. 401-406, 1967 and the chrominance CSF variation by GJ Van der Horst and Maarten Bouman, “Spatiotemporal chromaticity discrimination,” Journal of Optical Society of America, vol. 59, issue 11, 1969. These measurements show a variation in peak sensitivity of about a factor of 8 for luminance and 5 for chrominance over retinal illumination levels which change by about a factor of 100.
Since the retinal illumination can change by about a factor of 100 between the lightest to darkest area on a page, the CSF peak sensitivity and shape can change significantly. The function is estimated by the average local luminance on the page, and a spatially dependent CSF is applied to the image. This correction is similar to the luminance masking in adaptive image dependent compression. See GJ Van der Horst and Maarten Bouman, “Spatiotemporal chromaticity discrimination,” Journal of Optical Society of America, vol. 59, issue 11, 1969.
The luminance dependent CSF performed better than a fixed CSF in the visibility model, when compared to subjective measurements of a set of test color patches ranked by human observers for watermark visibility. Results of our model with and without luminance correction are compared to S-CIELAB in Section 2, Visual Model Comparison. The method of applying a spatially dependent CSF which depends on local image luminance is described in Section 3, Pyramid Processing Method.
The visibility model is then used to embed watermark into images with equal visibility. During the embedding stage, the visibility model can predict the visibility of the watermark signal and then adjust the embedding strength. The result will be an embedded image with a uniform watermark signal visibility, with the embedding strength varying depending on the cover image's content. This method was compared to a uniform strength embed in terms of both visibility and robustness, and the results are shown in Section 4, Watermark Equal Visibility Embed.
Visual Model Comparison
Psychophysical Experiment
To test the full-color visibility model a psychophysical experiment was conducted. The percept of degradation caused by the watermark was compared to the results of the visibility model, as well as to the S-CIELAB metric.
A set of observers were asked to rate their perception of the image degradation of 20 color patch samples using a quality ruler. The quality ruler (illustrated in FIG. 13a) increases in watermark strength from left (B) to right (F). The color samples were viewed one at a time at a viewing distance of approximately 12 inches. The samples were presented using the Latin square design (see Geoffrey Keppel and Thomas Wickens, “Design and analysis: A researcher's handbook.” Prentice Hall, pp. 381-386, 2004) to ensure a unique viewing order for each observer.
FIG. 13a shows quality ruler increasing in degradation from B (slight) to F (strong).
All 22 participants passed the Ishihara color test. There were eight female and 14 male participants, with an average age of 43. Their professions and experience varied. Four people had never participated in a visibility experiment, 12 had some experience and six had participated on several occasions.
Thumbnails of the 20 color patches are illustrated in FIG. 13b. The color samples were chosen largely based on the results of a previous experiment; where it was observed that the visibility model had difficulty accurately predicting the observer response with darker color patches. Additionally, one color patch had a much higher perceived and predicted degradation. Ten of the original samples were included in the second experiment. Dark patches, patches which were expected to have a higher perception of degradation and memory colors were added to complete the set of 20 patches. The experiment and the quality ruler patches were all printed with an Epson Stylus 4880 on Epson professional photo semi-gloss 16 inch paper.
FIG. 13b shows thumbnails of the 20 color patch samples with the watermark applied.
The mean observer scores for the 20 color samples are plotted in FIG. 14. In general the colors on the far right are lighter. As discussed in the previous experiment, the cyan1 patch was observed to have a higher level of degradation. In this second experiment, other colors with similar properties were determined to have a similarly high perception of degradation.
FIG. 14 shows the mean observer responses with 95% confidence intervals.
Validation of the Visibility Model
The motivation for the psychophysical experiment is to test how well the proposed full-color visibility model correlates to the perception of the degradation caused by the watermark signal. The model without and with the luminance adjustment are plotted in FIG. 15 and FIG. 16, respectively.
FIG. 15 shows mean observer response compared with the proposed visibility model. The solid black line is the polynomial trendline.
FIG. 16 shows mean observer response compared with the proposed visibility model with luminance adjustment.
The addition of the luminance adjustment primarily affected the darker color patches, darkgreen, foliage and darkblue1. CIEDE94 and CIEDE2000 color difference models were also considered, however there was not a clear advantage to using the more complex formulas.
FIG. 17 shows Mean observer response compared with S-CIELAB.
The S-CIELAB values are also plotted against the mean observer response FIG. 17.
Two different methods were used to compare the different metrics to the observer data, Pearson's correlation and the coefficient of determination (R2). Both correlation techniques describe the relationship between the metric and observer scores. The coefficient indicates the relationship between two variables on a scale of +/−1, the closer the values are to 1 the stronger the correlation is between the objective metric and subjective observer results. The correlations are summarized in Table 1.











TABLE 1










Visibility model using CIE ΔE76














No Adjust
With Adjust
S-CIELAB







Pearson
0.81
0.86
0.61



R2
0.70
0.85
0.38










Table 1: Pearson and R2 correlation between the observers' mean responses and the objective metrics. For both tests, the proposed full-color visibility model with the luminance adjustment shows the highest correlation.
As shown in Table 1, all three objective methods have a positive correlation to the subjective results with both correlation methods. The full-color visibility model with the luminance adjustment had the highest correlation with both the Pearson and R2 correlation tests, while S-CIELAB had the lowest.
Pyramid Processing Method
In image fidelity measures, the CSF is commonly used as a linear filter to normalize spatial frequencies such that they have perceptually equal contrast thresholds. This can be described by the following shift invariant convolution:




  
    
      
        
          
            
              f
              ~
            
            ⁡
            
              (
              
                x
                ,
                y
              
              )
            
          
          =
          
            
              
                h
                ⁡
                
                  (
                  
                    x
                    ,
                    y
                  
                  )
                
              
              *
              
                f
                ⁡
                
                  (
                  
                    x
                    ,
                    y
                  
                  )
                
              
            
            =
            
              
                ∑
                m
              
              ⁢
              
                
                  ∑
                  n
                
                ⁢
                
                  
                    h
                    ⁡
                    
                      (
                      
                        m
                        ,
                        n
                      
                      )
                    
                  
                  ⁢
                  
                    f
                    ⁡
                    
                      (
                      
                        
                          x
                          -
                          m
                        
                        ,
                        
                          y
                          -
                          n
                        
                      
                      )
                    
                  
                
              
            
          
        
        ,
      
    
    
      
        (
        1
        )
      
    
  




where f(x,y) is an input image, h(x,y) is the spatial domain CSF, and {tilde over (f)}(x,y) is the frequency normalized output image.

For our luminance dependent CSF model, we allow the CSF to vary spatially according to the local luminance of the image, i.e.:




  
    
      
        
          
            f
            ~
          
          ⁡
          
            (
            
              x
              ,
              y
            
            )
          
        
        =
        
          
            ∑
            m
          
          ⁢
          
            
              ∑
              n
            
            ⁢
            
              
                h
                ⁡
                
                  (
                  
                    m
                    ,
                    
                      n
                      ;
                      x
                    
                    ,
                    y
                  
                  )
                
              
              ⁢
              
                
                  f
                  ⁡
                  
                    (
                    
                      
                        x
                        -
                        m
                      
                      ,
                      
                        y
                        -
                        n
                      
                    
                    )
                  
                
                .
              
            
          
        
      
    
    
      
        (
        2
        )
      
    
  




Since evaluating this shift variant convolution directly can be computationally expensive, we seek an approximation that is more efficient.
The use of image pyramids for fast image filtering is well-established. An image pyramid can be constructed as a set of low-pass filtered and down-sampled images fl(x,y), typically defined recursively as follows:




  
    
      
        
          
            f
            0
          
          ⁡
          
            (
            
              x
              ,
              y
            
            )
          
        
        =
        
          
            f
            ⁡
            
              (
              
                x
                ,
                y
              
              )
            
          
          ⁢
          
            
          
          ⁢
          and
        
      
    
    
      
        (
        3
        )
      
    
  
  
    
      
        
          
            f
            l
          
          ⁡
          
            (
            
              x
              ,
              y
            
            )
          
        
        =
        
          
            ∑
            m
          
          ⁢
          
            
              ∑
              n
            
            ⁢
            
              
                
                  h
                  0
                
                ⁡
                
                  (
                  
                    m
                    ,
                    n
                  
                  )
                
              
              ⁢
              
                
                  f
                  
                    l
                    -
                    1
                  
                
                ⁡
                
                  (
                  
                    
                      
                        2
                        ⁢
                        
                          
                        
                        ⁢
                        x
                      
                      -
                      m
                    
                    ,
                    
                      
                        2
                        ⁢
                        
                          
                        
                        ⁢
                        y
                      
                      -
                      n
                    
                  
                  )
                
              
            
          
        
      
    
    
      
        (
        4
        )
      
    
  




for l>0 and generating kernel h0(m,n). It is easily shown from this definition that each level fl(x,y) of an image pyramid can also be constructed iteratively by convolving the input image with a corresponding effective kernel hl(m,n) and down-sampling directly to the resolution of the level, as follows:





  
    
      
        
          
            
              f
              l
            
            ⁡
            
              (
              
                x
                ,
                y
              
              )
            
          
          =
          
            
              ∑
              m
            
            ⁢
            
              
                ∑
                n
              
              ⁢
              
                
                  h
                  ⁡
                  
                    (
                    
                      m
                      ,
                      n
                    
                    )
                  
                
                ⁢
                
                  
                    f
                    0
                  
                  ⁡
                  
                    (
                    
                      
                        
                          
                            2
                            l
                          
                          ⁢
                          x
                        
                        -
                        m
                      
                      ,
                      
                        
                          
                            2
                            l
                          
                          ⁢
                          y
                        
                        -
                        n
                      
                    
                    )
                  
                
              
            
          
        
        ,
      
    
    
      
        (
        5
        )
      
    
  




where hl(m,n) is an l-repeated convolution of h0(m,n) with itself.

For image filtering, the various levels of an image pyramid are used to construct basis images of a linear decomposition representing the point-spread response of the desired filtering, i.e.:




  
    
      
        
          
            
              f
              ~
            
            ⁡
            
              (
              
                x
                ,
                y
              
              )
            
          
          =
          
            
              ∑
              l
            
            ⁢
            
              
                α
                l
              
              ⁢
              
                
                  
                    f
                    ~
                  
                  l
                
                ⁡
                
                  (
                  
                    x
                    ,
                    y
                  
                  )
                
              
            
          
        
        ,
      
    
    
      
        (
        6
        )
      
    
  




where al is the coefficient of the basis function {tilde over (f)}l(x,y) obtained by up-sampling the corresponding pyramid level fl(x,y) back to the base resolution.

We use the effective convolution kernel hl(x,y) as an interpolating kernel, i.e.,




  
    
      
        
          
            
              
                f
                ~
              
              l
            
            ⁡
            
              (
              
                x
                ,
                y
              
              )
            
          
          =
          
            
              4
              l
            
            ⁢
            
              
                ∑
                m
              
              ⁢
              
                
                  ∑
                  n
                
                ⁢
                
                  
                    
                      h
                      l
                    
                    ⁡
                    
                      (
                      
                        
                          x
                          -
                          
                            
                              2
                              l
                            
                            ⁢
                            m
                          
                        
                        ,
                        
                          y
                          -
                          
                            
                              2
                              l
                            
                            ⁢
                            n
                          
                        
                      
                      )
                    
                  
                  ⁢
                  
                    
                      f
                      l
                    
                    ⁡
                    
                      (
                      
                        m
                        ,
                        n
                      
                      )
                    
                  
                
              
            
          
        
        ,
      
    
    
      
        (
        7
        )
      
    
  




such that each basis function {tilde over (f)}l(x,y) can be described by a simple shift-invariant convolution of the input image with a composite kernel {tilde over (h)}l(x,y):

{tilde over (f)}l(x,y)={tilde over (h)}l(x,y)*f(x,y),  (8)

where {tilde over (h)}l(x,y)=hl(x,y)*hl(x,y). Thus, considering Eq. (6), we assert that the optimal representation is obtained by minimizing the sum of the squared error between the desired CSF and the Gaussian representation; i.e.,





  
    
      
        
          
            a
            =
            
              arg
              ⁢
              
                
              
              ⁢
              
                
                  min
                  a
                
                ⁢
                E
              
            
          
          ,
          where
        
        ⁢
        
          

        
      
    
    
      
        (
        8
        )
      
    
  
  
    
      
        
          E
          =
          
            
              ∑
              x
            
            ⁢
            
              
                ∑
                y
              
              ⁢
              
                
                  (
                  
                    h
                    ,
                    
                      
                        (
                        
                          x
                          ,
                          y
                        
                        )
                      
                      -
                      
                        
                          ∑
                          l
                        
                        ⁢
                        
                          
                            a
                            l
                          
                          ⁢
                          
                            
                              
                                h
                                ~
                              
                              l
                            
                            ⁡
                            
                              (
                              
                                x
                                ,
                                y
                              
                              )
                            
                          
                        
                      
                    
                  
                  )
                
                2
              
            
          
        
        ,
      
    
    
      
        (
        9
        )
      
    
  




and a=[a1, a2, . . . ]. This is a standard linear least-squares problem and can be solved using standard software packages, like Matlab® or GNU Octave. Further, the optimization can be pre-calculated for each local luminance of interest and stored in a look-up table, noting that for our application each coefficient is spatially varying according to the local luminance level Lf=Lf(x,y) of f(x,y), i.e.,

al=al(Lf)=al(Lf(x,y)).

While the development of our approach has been conducted for basis image at the resolution of the input image, the procedure can be conducted within a multi-resolution scheme, reducing the calculation of the spatially variant convolution in Eq. (3.2) into a pyramid reconstruction with spatially variant analysis coefficients.
Watermark Equal Visibility Embed
FIG. 18 shows an example from a cover image mimicking a package design. The design has two embedding schemes: on the left the watermark signal strength is uniform across the whole image, and on the right the watermark signal strength is adjusted based on the prediction from the visibility model. Since the human visual system is approximately a peak error detector, the image degradation caused by the watermark signal is determined by the most noticeable area. In this example, the hilly area in the background has the most noticeable degradation, as shown in the magnified insets. The visibility model is used to find this severe degradation. The signal strength in this area is reduced which improves the overall visibility of the embedded image, making it more acceptable. The total watermark signal on the right is 40% more than that on the left, but visually, the marked image on the right is preferable to the left one, because the degradation in the most noticeable area is reduced significantly.
FIG. 19 shows the calculated visibility for the uniform signal strength embedding (left) and the visibility model adjusted embedding (right). Notice that the visibility map is smoother on the right than on the left.
In terms of watermark detection, the embedding scheme with visibility model based adjustment can accommodate more watermark signal without creating a very noticeable degradation, thus making the detection more robust. To demonstrate the powerfulness of applying the visibility model, we performed a stress test with captures of 4 images from the two embedding schemes at various distances and perspectives. The other 3 images from the uniform visibility embedding are shown in FIG. 20. Their visibility maps are not included but instead the standard deviation of each visibility map is listed in Table 2. The percentage of successful detection is shown in Table 3.
These two tables show that the equal visibility embedding showed a significant visibility improvement over the uniform strength embedding scheme, together with robustness that was about the same or better.
FIG. 18 shows watermark embedding with uniform signal strength (left) and equal visibility from the visibility model (right). The insets are magnified to show image detail.
FIG. 19 shows visibility map from uniform signal strength embedding (left) and equal visibility embedding (right).
FIG. 20 shows Apple tart, Giraffe stack and Pizza puff design used in tests.
Table 2 shows standard deviation of the visibility maps on the 4 images from the two embedding schemes.









TABLE 2





Test image
Uniform strength embedding
Equal visibility embedding

















Granola
18.32
9.71


Apple Tart
8.19
4.96


Giraffe Stack
16.89
11.91


Pizza Puff
11.81
8.27









Table 3 shows detection rate on 4 images from the two embedding schemes, out of 1000 captures each image/embedding.









TABLE 3





Test image
Uniform strength embedding
Equal visibility embedding







Granola
18%
47%


Apple Tart
50%
58%


Giraffe Stack
47%
49%


Pizza Puff
63%
61%









CONCLUSIONS
A full color visibility model has been developed which has good correlation to subjective visibility tests for color patches degraded with a watermark. The best correlation was achieved with a model that applied a luminance correction to the CSF.
The model was applied during the watermark embed process, using a pyramid based method, to obtain equal visibility. Better robustness and visibility was obtained with equal visibility embed than uniform strength embed.
CONCLUDING REMARKS
Having described and illustrated the principles of the technology with reference to specific implementations, it will be recognized that the technology can be implemented in many other, different, forms. To provide a comprehensive disclosure without unduly lengthening the specification, applicant hereby incorporates by reference each of the above referenced patent documents in its entirety.
The methods, processes, components, apparatus and systems described above may be implemented in hardware, software or a combination of hardware and software. For example, the watermark encoding processes and embedders may be implemented in software, firmware, hardware, combinations of software, firmware and hardware, a programmable computer, electronic processing circuitry, with a processor, parallel processors or other multi-processor configurations, and/or by executing software or instructions with one or more processors or dedicated circuitry. Similarly, watermark data decoding or decoders may be implemented in software, firmware, hardware, combinations of software, firmware and hardware, a programmable computer, electronic processing circuitry, and/or by executing software or instructions with a processor, parallel processors or other multi-processor configurations.
The methods and processes described above (e.g., watermark embedders and detectors) also may be implemented in software programs (e.g., written in C, C++, Visual Basic, Java, Python, Tcl, Perl, Scheme, Ruby, executable binary files, etc.) stored in memory (e.g., a computer readable medium, such as an electronic, optical or magnetic storage device) and executed by a processor (or electronic processing circuitry, hardware, digital circuit, etc.).
While one embodiment discusses inverting the polarity in a second color channel (e.g., a ‘b’ channel), one could also invert the polarity in the first color channel (e.g., an ‘a’ channel) instead. In such a case, the first color channel is then preferably subtracted from the second color channel.
The particular combinations of elements and features in the above-detailed embodiments (including Appendices A, B, C & D) are exemplary only; the interchanging and substitution of these teachings with other teachings in this and the incorporated-by-reference patent documents are also contemplated.

## Claims

1. A digital watermarking method comprising:
receiving color image data;
using one or more programmed processors: i) degrading luminance data representing the color image data with a first contrast sensitivity function (CSF1) to predict visibility changes attributable to an application of digital watermarking to the color image data, in which the CSF1 varies depending on luminance values associated with local regions of the color image data, and in which said degrading luminance data yields first results for image areas within the color image data, and ii) degrading chrominance data representing the color image data with a second contrast sensitivity function (CSF2), in which the CSF2 is separate from the CSF1, to predict visibility changes attributable to an application of digital watermarking to the color image data, and in which said degrading chrominance data yields second results for image areas within the color image data; and
using one or more programmed processors, transforming the color image data by digital watermarking plural-bit information therein, in which signal embedding strength of the digital watermarking within different image areas varies based on the first results and the second results.

2. The method of claim 1 in which the luminance data degrading of the data representing the color image data with the CSF1 introduces image blurring, and in which the CSF1 varies so that relatively more blurring occurs as luminance of a local image region decreases.

3. The method of claim 1 in which varying embedding strength across different image regions of the color image data yields uniform predicted visibility of the digital watermarking across the color image data.

4. The method of claim 1 in which the CSF1 varies spatially.

5. The method of claim 4 in which the CSF1 varies spatially in terms of spatial width.

6. The method of claim 1 in which the second contrast sensitivity function (CSF2) comprises a blue-yellow contrast sensitivity function and a red-green contrast sensitivity function.

7. The method of claim 1 in which the CSF2 varies spatially depending on luminance values associated with local regions of the obtained color image data.

8. An apparatus comprising:
an input to obtain color image data;
memory storing a visibility model comprising a luminance contrast sensitivity function (CSF1) and a chrominance contrast sensitivity function (CSF2), in which CSF1 and CSF2 are separate contrast sensitivity functions; and

one or more processors configured for:
processing data representing obtained color image data with the CSF1 and the CSF2 to predict degradation of image areas associated with an application of digital watermarking, in which the CSF1 varies depending on luminance values associated with local regions of the obtained color image data and in which the CSF1 is used for processing luminance data and the CSF2 is used for processing chrominance data;
transforming the obtained color image data with digital watermarking, in which the digital watermarking is guided based on results obtained from the processing including predicted degradation of image areas.

9. The apparatus of claim 8 in which the CSF1 varies spatially.

10. The apparatus of claim 9 in which the CSF1 varies spatially in terms of spatial width.

11. The apparatus of claim 9 in which the CSF2 varies spatially in terms of spatial width.

12. The apparatus of claim 8 in which the processing of the obtained color image data with the CSF1 produces image blurring as the predicted degradation, in which the CSF1 varies so that relatively more blurring occurs as luminance of a local image region decreases.

13. The apparatus of claim 8 in which the digital watermarking is guided based on results obtained from the processing by varying embedding strength across different image areas of the obtained color image data based on predicted degradation of the different image areas.

14. The apparatus of claim 13 in which predicted visibility of the digital watermarking across the different image areas comprises uniform predicted visibility.

15. The apparatus of claim 8 in which said one or more processors are configured for processing the obtained color image data with an attention model to predict visual traffic areas.

16. The apparatus of claim 15 in which the digital watermarking is guided based on the results obtained from the processing including predicted degradation of image areas and on predictions of visual traffic areas obtained from processing the obtained color image data with the attention model.

17. The apparatus of claim 8 in which the chrominance contrast sensitivity function (CSF2) comprises a blue-yellow contrast sensitivity function and a red-green contrast sensitivity function.

18. The apparatus of claim 8 in which the CSF2 varies depending on luminance values associated with local regions of the obtained color image data.

19. An method comprising:
obtaining data representing a color image;
using one or more programmed processors, processing the data representing the color image with a luminance contrast sensitivity function (CSF1) and a chrominance contrast sensitivity function (CSF2) to predict degradation of image areas associated with an application of information encoding of the data representing the color image, in which the CSF1 varies depending on luminance values associated with local regions of the data representing the color image, and in which the CSF1 is used for processing luminance data and the CSF2 is used for processing chrominance data; and
using one or more programmed processors, transforming the data representing the color image by encoding plural-bit information therein, in which the encoding is guided based on results obtained from the processing including predicted degradation of image areas.

20. The method of claim 19 in which the CSF1 varies spatially.

21. The method of claim 20 in which the CSF1 varies spatially in terms of spatial width.

22. The method of claim 20 in which the CSF2 varies spatially in terms of spatial width.

23. The method of claim 19 in which the processing of the data representing the color image with the CSF1 produces image blurring as the predicted degradation, in which the CSF1 varies so that relatively more blurring occurs as luminance of a local image region decreases.

24. The method of claim 19 in which the encoding is guided based on results obtained from the processing by varying embedding strength across different image areas of the data representing the color image based on predicted degradation of the different image areas.

25. The method of claim 24 in which predicted visibility of the encoding across the different image areas comprises uniform predicted visibility.

26. The method of claim 19 further comprising processing the data representing the color image with an attention model to predict visual traffic areas.

27. The method of claim 26 in which the encoding is guided based on the results obtained from the processing including predicted degradation of image areas and on predictions of visual traffic areas obtained from processing the obtained color image data with the attention model.

28. The method of claim 19 in which the encoding comprising digital watermarking.

29. The method of claim 19 in which the chrominance contrast sensitivity function (CSF2) comprises a blue-yellow contrast sensitivity function and a red-green contrast sensitivity function.

30. The method of claim 19 in which the CSF2 varies depending on luminance values associated with local regions of the data representing a color image.

31. An apparatus comprising:
an input to obtain color image data;
memory storing a luminance contrast sensitivity function (CSF1) and a chrominance contrast sensitivity function (CSF2); and
one or more processors configured for:
degrading data representing obtained color image data with the luminance contrast sensitivity function (CSF1) and the chrominance contrast sensitivity function (CSF2) to predict visibility changes attributable to encoding plural-bit information in the obtained color image data, in which the CSF1 varies depending on luminance values associated with local regions of the color image data, in which said degrading data representing the obtained color image data yields results for different image areas within the obtained color image data, and in which the CSF1 is used for degrading luminance data and the CSF2 is used for degrading chrominance data; and
transforming the obtained color image data by encoding plural-bit information therein, in which signal embedding strength of the encoding within the different image areas varies based on the results.

32. The apparatus of claim 31 in which the degrading of the data representing the obtained color image data with the CSF1 introduces image blurring, and in which the CSF1 varies so that relatively more blurring occurs as luminance of a local image region decreases.

33. The apparatus of claim 31 in which the varying embedding strength across different image regions of the color image data yields uniform predicted visibility of the encoding across the data representing the obtained color image data.

34. The apparatus of claim 31 in which the CSF1 varies spatially.

35. The apparatus of claim 34 in which the CSF1 varies spatially in terms of spatial width.

36. The apparatus of claim 31 in which the CSF2 varies spatially in terms of spatial width.

37. The apparatus of claim 31 in which the chrominance contrast sensitivity function (CSF2) comprises a blue-yellow contrast sensitivity function and a red-green contrast sensitivity function.

38. The apparatus of claim 31 in which the CSF2 varies depending on luminance values associated with local regions of the obtained color image data.