Optimal templates for image data embedding
View Patent ↗A method for creating a message template used for embedding hidden messages, the method includes the steps of determining a message template performance metric comprising a dispersal measure having both a spatial domain function and a frequency domain function; developing a numerical optimization algorithm containing the message template performance metric as a basis for optimization; determining the message template geometric configuration comprising: (i) determining a message template capacity; (ii) determining a message template area; and applying the numerical optimization algorithm to the message template geometric configuration which results in an optimal message template.
1. A method for creating a message template used for embedding hidden messages, the method comprising the steps of:
(a) determining a message template performance metric;
(b) determining a message template geometric configuration comprising:
(i) determining a message template capacity;
(ii) determining a message template area; and
(c) developing a numerical optimization algorithm containing the message template performance metric as a basis for optimization comprising:
(i) initializing a current configuration that is randomly selected; and
(ii) applying simulated annealing to the current configuration.
2. The method as a claim 1 , wherein step (a) includes providing a spatial domain component as a requirement to disperse ones within the message template and providing the frequency domain component as a requirement as to eliminate replicating shifts.
3. The method as in claim 1 further comprising the step of storing the optimal message template.
4. The method as in claim 1 further comprising using
Disp
(
T
)
=
∑
i
=
1
k
min
(
Tor
(
ρ
i
,
ρ
j
)
,
1
≤
j
≤
k
,
j
≠
i
)
as a spatial domain component.
5. The method as in claim 1 further comprising the step of using
F Disp( T )=log 2 (| A |)
as a frequency domain component.