Information hiding method with reduced fuzziness
First Claim
Patent Images
1. An information hiding method with reduced fuzziness, which comprises the steps of:
- inputting the information to be embedded into a convolutional encoder and generating encoded information whose length is a multiple of the original information;
generating a random number sequence using interleaving encoding for permuting the encoded information, the seed of the random numbers being a first key;
selecting a pixel of a host image using a random number generator as an information embedding point of the encoded information, the seed of the random number generator being a second key, and embedding the encoded information into a B channel of the pixel of the host image;
further wherein the host image H is an image of m×
n pixels and the electronic signature to be embedded is information W with a size L, both the host image H and the embedded information W being expressed as;
H={hij|0≦
i<
m,0≦
j<
n, hij ε
[0,255]}, and W={wi|0≦
L, wi ε
[0,1]}; and
a set ASETij={hi+lj, hi−
lj+1, hij+1, hi+lj+1} being defined for four pixels surrounding and to the right of any pixel hij in the host image.
2 Assignments
0 Petitions
Accused Products
Abstract
An information hiding method with reduced fuzziness, which employs interleaving encoding, convolutional encoding and contrasts among neighboring pixels. Once the information is hidden, it can still be extracted without the original image from the generated image after a certain extent of fuzziness damage.
20 Citations
8 Claims
-
1. An information hiding method with reduced fuzziness, which comprises the steps of:
-
inputting the information to be embedded into a convolutional encoder and generating encoded information whose length is a multiple of the original information;
generating a random number sequence using interleaving encoding for permuting the encoded information, the seed of the random numbers being a first key;
selecting a pixel of a host image using a random number generator as an information embedding point of the encoded information, the seed of the random number generator being a second key, and embedding the encoded information into a B channel of the pixel of the host image;
further wherein the host image H is an image of m×
n pixels and the electronic signature to be embedded is information W with a size L, both the host image H and the embedded information W being expressed as;
H={hij|0≦
i<
m,0≦
j<
n, hij ε
[0,255]}, andW={wi|0≦
L, wi ε
[0,1]}; and
a set ASETij={hi+lj, hi−
lj+1, hij+1, hi+lj+1} being defined for four pixels surrounding and to the right of any pixel hij in the host image. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
Specification