Escolar Documentos
Profissional Documentos
Cultura Documentos
'Dept. of EECS, KAIST, 373-1 Guseong Dong, Yuseong Gu, Daejeon 305701, Korea
jsseo@mail.kaist.ac.kr, cdyoo@ee.kaist.ac.kr
'Philips Research Eindhoven, Prof. Holstlaan 4,5656AA, Eindhoven, The Netherlands
{jaap.haitsma,ton.kalker} @philips.com
ABSTRACT obtained features. The affine invariant features used in this pa-
per have been successfully utilized in extracting speed-change re-
Affine transformations are a well-known robustness issue in many silient audio fingerprints [2]. This work is an extension of our
multimedia fingerprinting systems. Since it is quite easy with audio fingerprinting methods in [I] [2]. A different fingerprinting
modem computers to apply affine transformations to audio, image method based on Radon transform was proposed in [SI, where the
and video content, there is an obvious necessity for affine trans- medium point of each projection is used as a fingerprint. However,
formation resilient fingerprinting. In this paper we present a new it needs search and energy modification for rotation and scaling re-
method for affine transformation resilient fingerprints that is based spectively and does not provide keyed hash function [ 5 ] . The pro-
upon the auto-correlation of the Radon transform, the log map- posed method does not need any search or modification of finger-
ping and the Fourier transform. Besides robustness, we also ad- print bits, provides keyed hashing scheme by random permutation
dress other issues such as security, database search efficiency and and achieves collision-free property with relatively small amount
independence with perceptually different inputs. Experimental re- of fingerprint bits (400 bits per image).
sults show that the proposed fingerprints are highly robust to affine
This paper is organized as follows. Section 2 describes the re-
transformations.
quirements of image fingerprints. Section 3 describes the extrac-
tion of the affine invariant features used in the proposed method.
1. INTRODUCTION Section 4 evaluates the performance of the proposed fingerprint.
g(s,~) =Sm -m -_
f(z:y)s(zcosB+ysino-s)dxdy (1)
= e x p [ ~ ~ i ~ o g p - i C o 8 ~ . l C ( S 1 , < n ) . (5)
Then the magnitude IC'(Ci,C O ) ~and phase $ ' ( C l , Co) of the com-
plex signal C ' ( ~CO)
I , are given by:
where -co < s < 00, 0 5 0 < T . The Radon transform g(s, 8)
is the one-dimensional projection of f ( x , y ) at an angle 8. The IC'(Ci,Co)I = IC(Ci,<n)I (6)
Radon transform has the following useful properlies for the affine d'(Ci,Co) = CiIogp-CeOr+ LC(Ci,Cn)
transformations of an image. = C1h&!p-<o& +$(<I,<@) (7)
PI) The translation of an image by ( x o , go) causes the Radon where L C ( 6 ,C O ) is the phase of the complex signal C((l,C#).
transform to be translated in the direction of s, i. e., As shown above, the log mapping translates scaling into a
shift, and the subsequent Fourier transform translates the shift into
a phase change. By using the properties, we find features that are
f ( x - xo,y yo) H g(s - xocosO - yosin8,8).
invariant to scaling. From Eqn. (6). IC'(C1, CO)/ is affine invariant.
~
-
P3) The rotation of an image by an angle 0, causes the Radon
transform to be shifted through the same amount, i. e., .~
Dends on a kev K . For two different kevs K I and K ? .. , the fin-
gerpnnting function H should have the property that N K (~X ) #
H K , (X) for any image X. To satisfy this requirement, we use in-
f(xcos8, - ysinO,,xsin@, + y c O S 8 ~ ) g(s,8 - 87). terleaving. ThecoefficientsofC'(C1,Co) arerandomlyinterleaved
I11 - 62
in either <i or Cs direction by the permutation table (this is key in-
formation). After interleaving, the coefficienrs of log ~C’((I,CO)[ Table 1. BER for different kinds of signal degradations
and #‘(Si,<s) are filtered by a simple 2D filter Fc8.ca(along both Processing I AIR 1 BOAT I LENA I PEP
<I and Cs axes), of which the kemel Fc, ,cs equals
~ ~~~~~ ~ ~~
111 - 63
Table 2. Hits in the database for different kinds of signal degrada-
tions
[ I ] , the threshold for the BER was determined to be 0.3 with very 6. REFERENCES
low false positive rate. It means that out of 400 bits there must
J.A. Haitsma and T. Kalker, “A Highly Robust Audio Finger-
be less than 120 bits in error in order to decide that the fingerprint
printing System:’ Proc. lnrernnrional Conj on Music Infor-
blocks originate from the same image. Details of the false positive
marion Retrieval (ISMIR) 2002, Paris. Oct. 2002.
analysis are in [I].
To test security of the proposed method, we generated 100 fin- J.S. Seo, J.A. Haitsma and T. Kalker, “Linear Speed-Change
gerprints from the Lena image using different interleaving. Similar Resilient Audio Fingerprinting,” Proc. IEEE Benelur Work-
with the above analysis, the BER between all possible pairs of the shop on Model Based Processing and Coding of Audio
fingerprints were calculated. The histogram of the measured BER (MPCA) 2002, Leuven, Belgium, Nov. 2002.
is shown in Figure 3b. The mean and the standard deviation of 131 R. Venkatesan, S:M. Kaon, M. H. Jakubowski, and P.
the measured BER were 0.5002 and 0.0264 respectively. This re- Moulin, “Robust Image Hashing,” Proc. IEEE K I P 2000,
sult clearly shows the fingerprint is significantly dependent on the Vancouver, CA, Sept. 2000.
key information (interleaving). In terms of security, such a strong
dependency on the key is significant. Once a key is broken, the
[41 M. K. Mihcak and R. Venkatesan, “New Iterative Geometric
Methods for Robust Perceptual Image Hashing,” Proc. ACM
user can simply change it, like a password [3] without modifying Workshop on Security and Privacy in Digiral Rights Man-
overall system. agemenr, Philadelphia, PA, Nov. 2001.
151 E Lefebvre, B. Macq and J.-D. Legat, “RASHRadon Soft
Hash Algorithm,” Pmc. European Signal Processing Conf
5. CONCLUSION 2002, Toulouse, France, Sept. 2002.
A. Menezes, P. Oorshot, and S. Vanstone, Handbook of Ap-
For the multimedia fingerprinting, extracting features that allow plied Cryprography, CRC press, 1997.
direct access to the relevant distinguishing information is crucial.
The features used in fingerprint extraction are directly related to A.K. lain, Fundamenrals of Digital Image Processing,
the performance of the fingerprinting system. In this paper, we Prentice-Hall, 1989.
presented a new fingerprint extraction method that is resilient to M. Schneider and S.-F. Chang, “A Robust Content Based
affine transformations. The robustness against affine transforma- Digital Signature for Image Authentication,” Proc. IEEE
tions are essential because it is quite easy to impose affine transfor- K I P 96, Laussane, Switzerland, Oct. 1996.
mations to images with modem computers. The experimental re-
sults show that the proposed method is highly robust against affine [91 J. Fridrich, “Robust Bit Extraction from Images,” Proc. IEEE
Inremarional Con$ on Mulrimedia Computing and Sysrems
transformations and most of the other image processing steps. It
(ICMCS) 99, Florence, Italy, June 1999.
was experimentally verified that the proposed image fingerprints
satisfy the main requirements of fingerprints; robustness under 1101 F.A.P. Fetitcolas, “Watermarking Schemes Evaluation,”
quality preserving signal processing steps, pairwise independence IEEE Signal procssing Mag., vol. 17, no. 5 , Sept. 2000.
with different inputs and sufficient randomization (uniform distri-
bution) of fingerprint bits. Future work includes more robust image
fingerprinting and extension of the proposed method to video.
111 - 64