 Research Article
 Open Access
 Published:
OneTime Key Based Phase Scrambling for PhaseOnly Correlation between Visually Protected Images
EURASIP Journal on Information Security volume 2009, Article number: 841045 (2009)
Abstract
Onetime key based phase scrambling is proposed for privacyprotected image matching. The image matching is performed using invisible templates that are protected by phase scrambling. A key for phase scrambling is not required for the image matching, and the key can even be discarded after scrambling if the template does not need to be reconstructed. Theoretical analyses are presented to provide guidelines for designing key parameters that affect the visual effect and image matching. Experimental results demonstrate the effectiveness and appropriateness of the proposed method.
1. Introduction
A number of approaches to image matching, such as correlation in the space domain and using features as typified by corners and edges, have been investigated. Phaseonly correlation (POC) is a frequency domain approach to image matching. Phaseonly correlation with discrete Fourier transform (DFT) was first proposed by Kuglin and Hines [1]. The translation between signals and the direct measure of the degree of signal congruence can be simultaneously estimated by POC based on the Fourier shift property. In addition, the rotation and scaling can be estimated using the magnitude of DFT coefficients that are mapped into logpolar coordinates [2]. Highaccuracy estimation by POC has been developed [3–5].
Generally, image matching using POC requires visual protection of templates in order to secure privacy [6, 7]. Typically, encryption is used for the protection of signals [8]. However, decryption is required before image matching using POC. In order to address these problems, we previously proposed a method for image matching that used synchronized phase scrambling [9, 10]. The previously proposed method enables direct image matching between protected images. However, a key is required for both scrambling and image matching, and the key must be kept secret from attackers.
In onetime key based phase scrambling, a key is used once for scrambling but is not required for image matching. Moreover, after scrambling, the key can be discarded if the template does not need to be reconstructed. Under the limited twomember set, the effect of scrambling on POC values and the visual effect are analyzed theoretically, and these analyses provide a guideline for designing key parameters. A key for which the parameters have been chosen appropriately enables keyless image matching to be performed by phase scrambling. Finally, experimental results demonstrate the effectiveness and appropriateness of the proposed scrambling.
2. Preliminary
The goal of the proposed image matching method is described in this section. Phaseonly correlation and phase scrambling for POC, which are elements of the proposed method, are then explained. In the present paper, for the sake of brevity, the onedimensional case is considered. Let , , and denote the sets of complex, real, and integer numbers, respectively.
2.1. Goal of the Proposed Image Matching
Phase scrambling protects the original information of images visually, as shown in Figure 1. The phase scrambling for POC is performed in the frequency domain. The DFT coefficients of a signal are scrambled by multiplying the coefficients with random phase terms. The inverse DFT of the scrambled DFT coefficients does not reveal the original information of the image, whereas the inverse DFT of the DFT coefficients reveals the information of the original image.
The proposed image matching uses phase scrambling in order to protect the original information of templates visually in case there is leakage of the template. Image matching between the phasescrambled template and the query can be performed by POC even if the sensed image that is used as a query has translation, rotation, and scaling for the corresponding template.
The difference between the previously proposed image matching and the image matching proposed herein is shown in Figure 2. In the previous method, the key used for the phase scrambling of templates must be saved securely and reused in the image matching by POC. On the other hand, in the proposed method, the key used for phase scrambling of templates is not required for image matching and does not need to be saved. Independent keys are used for all templates and the key is a oneuse key.
2.2. POC
2.2.1. Translation
Let , , be the point DFT coefficients of point signal, , . The phase term is defined as
where denotes the absolute value of . If , then is replaced by .
Let be the shifted signal of . The normalized cross spectrum, , between and is defined in terms of their corresponding phase terms and as follows:
where denotes the complex conjugate of . The POC function, , is defined by the inverse DFT of as
where denotes and denotes [1]. The translation between two signals is estimated by the location of the peak of in (3). In addition, the value of the peak is used as a measure of the signal congruence.
2.2.2. Rotation and Scaling
Rotation and scaling between two images are estimated by POC using the magnitude of DFT coefficients that are mapped into logpolar coordinates [2]. Logpolar transform reduces the rotation angle and scale factor in the Cartesian coordinates to horizontal and vertical translation in logpolar coordinates.
2.3. Phase Scrambling for POC
2.3.1. Phase Scrambling and PhaseScrambled Signal
Phase scrambling for POC is performed in the frequency domain. The phasescrambled DFT coefficients, , are defined as
where denotes a key sequence and denotes an identifier for the key sequence. Phase scrambling affects only the phase term, that is, the scrambled phase term, , is given as
The phasescrambled signal, , is defined by the inverse DFT of as
The phasescrambled image is a twodimensional expression of the phasescrambled signal.
A key sequence is constructed from a set of members, , and the length of the key sequence is the same as that of the DFT coefficients. That is, an ary key sequence, , is expressed with a set, , as
where, for convenience, the superscript and subscript of the term denote the number of members and the first member, respectively. A key sequence can be generated using a cryptographically secure pseudorandom number generator, in which the random numbers are related to each member of specified by the users. As increases, the key space increases, whereas the determination of members becomes more complicated.
2.3.2. Image Matching under Synchronized Phase Scrambling
The phase scrambled signal can be used directly for image matching using POC.
Let and be a template and a query, respectively. According to (4), is scrambled by and then stored in the form of phasescrambled DFT coefficients in a system. When the system is queried with respect to , is scrambled by , and the POC between and is then performed. In other words, and are given as
The normalized cross spectrum is calculated as
The POC function is then obtained as
When the key sequence for the template and that for the query are the same, the POC under phase scrambling and the POC between nonscrambled signals are identical. Namely, if for all , , then by substituting (5) into (9), we obtain the following:
From (3), (10), and (11), we therefore obtain
Thus, a key sequence is used for both the template and the query, and these two key sequences are synchronized. In the proposed method, a key sequence is used for a template only.
3. Proposed Image Matching and Visual Information Protection
Onetime key based phase scrambling is proposed and analyzed statistically. In the present paper, the set for key sequences is limited to a twomember set.
3.1. OneTime Key Based Phase Scrambling for POC
A binary key sequence is used only once for scrambling a template and is not required for image matching.
The binary key sequence is constructed from a set of only two members, and , that is,
For an point signal, a binary key sequence of length is generated using a cryptographically secure pseudo random number generator, the output of which belongs to either or . Let be the occurrence probability of , and let be the difference of phases, , examples of which are shown in Figure 3.
Let and be a template and a query, respectively. In a system, is scrambled by according to (4) and is stored in the form of . When the system is queried with respect to , its DFT coefficients, , are multiplied by a constant, that is,
The POC between and is calculated according to (9) and (10).
Although (12) is not satisfied under onetime key based phase scrambling, the peak value of , which is used as a measure of signal congruence, is estimated from using parameters that are explained in the following section.
3.2. Effect of OneTime Key Based Phase Scrambling
The effect on the peak value of POC is considered in terms of the average value of POC under the proposed scrambling.
From (5), (9), (14) and (15), is expressed as
Here, we assume that the key sequence is a single value, that is, if for all , , then
and since is a constant, from (10), can be obtained as
Under the above assumption, if , then
and if , then
From (19) and (20), the average value of , that is, , is defined in terms of as follows:
Since is a complex number, the real and imaginary parts of can be expressed as
where and denote the operations to obtain the real and imaginary parts, respectively, of signals, and their peak values can be given as
where denotes the peak value of , which is referred to as the original peak value.
The peak value of POC under onetime key based phase scrambling is approximated by the average value of POC under onetime key based phase scrambling. That is,
Based on the above consideration, we observe the following.
Adjustment of the Peak Value
The peak value of can be controlled using the occurrence probability, , and the difference of phases, , as parameters. If queries are expected to contain noise, which causes a lower peak value, the peak value can be adjusted using parameters and to be higher within (23) and (24).
Invalid Parameters for the Proposed Scrambling
There is a set of invalid parameters for onetime key based phase scrambling. From (24), we obtain , such that, for , . From (23), we obtain such that, for , . The set of invalid parameters is thus given as
Estimation of the Original Peak Value
The original peak value, , can be estimated from using parameters and , and thereby the effect of scrambling can be practically avoided. From (23) and (24), the original peak value, , can be estimated from the observed peak value using the above parameters as follows:
3.3. Effect on Visual Information
We consider the error energy between the phase scrambled signal and the nonscrambled signal, in which the larger error energy provides greater visual protection.
Let be the scrambled signal of the original signal, , obtained using the key sequence , that is,
Here, we assume that the key sequence is a single value, that is, if for all , , then
Under the above assumption, since is a complex number, the real and imaginary parts of are expressed accordingly as
The real part of the error energy, , between the original signal and the real part of the phase scrambled signal is defined as
Under the above assumption, from (30), (32) is expressed as
where
If , then
and if , then
The average, , of the real part of the error energy, , is defined in terms of the occurrence probability, , as
The average of the imaginary part of the error energy is defined in a similar manner. The imaginary part of the error energy, , between the original signal and the imaginary part of phase scrambled signal is defined as
The average, , of is defined with as
The visual effect of phasescrambled signals can be estimated from (37) and (39), as will be shown in Section 4.2.
The parameters for key sequence are selected based on both the average error energy and the effect on the peak value discussed in Section 3.2.
3.4. Security Consideration
A key sequence based on a userspecified key is generated using a cryptographically secure pseudorandom number generator. A key sequence is used only once for scrambling a template. If the scrambled template does not need to be reconstructed in a system, the key sequence can be discarded after scrambling, and, consequently, its protection is not required. In the following, we focus on the knownplaintext attack and the ciphertextonly attack.
3.4.1. KnownPlaintext Attack
This model assumes that an attacker has samples of both a plaintext and its ciphertext and uses them to reveal further secret information, such as secret keys and code books.
In a system using the proposed scrambling, each template is scrambled by an independent key sequence. Accordingly, even if an attacker obtains sets of a plaintext and its ciphertext, the other key sequences cannot be inferred by these sets.
3.4.2. CiphertextOnly Attack
This model assumes that an attacker accesses only a ciphertext.
In this model, there are two approaches by which to deduce the original template:

(1)
using a local image possessed by an attacker.

(2)
guessing a key sequence.
With respect to the former approach, although the original template can be inferred using the signal congruence from the POC between a scrambled template and a local image possessed by an attacker, or through other methods using such a local image, even if an attack is successful, the attacker has already had access to a closely related image; the contents of which are already known to the attacker prior to the attack. Namely, the situation is considered as a case in which the information has been already leaked. The aim of the proposed scrambling is to prevent the information leakage from a template itself. The inference by using a local image is therefore excluded from the scope of the protection of the proposed scrambling.
With respect to the latter approach, theoretically, even if in the case of a brute force attack, as in the case of the onetime pad, which is unconditionally secure and theoretically unbreakable, it is impossible to confirm whether an inferred key sequence is correct. Since not a binary bit but a coherent unit of phase is changed, the scrambled template can be practically inferred by brute force attack although complete restoration is impossible for the abovedescribed reason. Consequently, the proposed scrambling protects the visual information of the original template within the scope of key space and completely protects the original template. If the size of a template is , the key space is . We assume the size of a template to be adequate.
When a system requires much higher security, the proposed scrambling can be combined with other cryptographic techniques. Even if decryption is required for image matching, the effect of the proposed scrambling remains valid.
4. Simulations
4.1. POC under the Proposed Scrambling
We performed POC between two images under onetime key based phase scrambling to show that both translation and signal congruence can be estimated even under scrambling.
In the following simulations, we used a section of a , 8bits/pixel image called "pentagon", as a template and a query, as shown in Figure 4. The template and query were translated by 20 pixels in the horizontal and vertical directions. The template was scrambled by a key sequence, , according to (4). After the query was processed according to (15), POC was performed between the template and the query. The translation and signal congruence were then estimated from the observed peak of the POC surface.
4.1.1. Without Noise
First, we evaluated the peak value by controlling the parameters for key sequences. The key sequence was generated using the sets of , that is, with to 0.95, and , to with , respectively. The original peak value, , which is the peak value of the POC between the nonprocessed template and query, was .
The real parts of POC surfaces for the cases in which with , , and , are shown in Figures 5(a), 5(b), and 5(c), respectively. Peaks appeared on the POC surfaces, and the observed peak values were 0.3291, 0.1675, and 0.0062, respectively. The observed peak value was confirmed to decrease according to (23) as approaches for , and, for the case in which and , that is, the set of invalid parameters, a distinct peak did not appear on the POC surface.
The real and imaginary parts are shown in Figures 6(a) and 6(b), respectively, of the POC surface for the case in which , that is, , with . A peak appears in both the real and imaginary parts of the POC surface.
The error between the observed and calculated peak values are presented in Tables 1 and 2. The observed peak values in the tables denote the average peak values observed on the POC surface for a total of 20 different key sequences. The peak value of POC under the proposed scrambling can be adjusted by controlling the parameters according to (23) and (24), which also means that the original peak value can be estimated from the observed peak value using the parameters according to (27).
Next, we investigated the peak location on the POC surface. A total of 1,000 different key sequences, which were generated using the sets of with , with , and with , were considered.
The estimated locations for different key sequences are shown in Figure 7. For the case in which with , that is, the set of invalid parameters, the translation was not estimated correctly, as shown in Figure 7(a). For the cases in which with and with , the translation was estimated correctly, as shown in Figures 7(b) and 7(c), respectively. Estimation of the translation from POC under the proposed scrambling has been demonstrated to be possible for all but the set of invalid parameters.
4.1.2. With Noise
We evaluated the noise version of POC under the proposed scrambling. The key sequence was generated by the set of with and 0.5. The POC surface between the template and the query that was corrupted by additive noise is shown in Figure 8(a). The noise consists of Gaussian random numbers with zero mean and a standard deviation of 25. Under this condition, the original peak value was 0.2433. The POC surface between the template and the query that was corrupted by JPEG quantization noise is shown in Figure 8(b). The factor was 200.(8 × 8 DCT coefficients are divided by the quantization step , which is generated by , where , and denotes a predefined quantization table and a factor, resp.). Under this condition, the original peak value was 0.1779. When , a peak that expresses the translation appeared on the POC surface at the location (20, 20) in both conditions and the peak values were 0.0982 and 0.0714, respectively. We confirmed that even when the query is corrupted by noise, the original peak value under the condition can be estimated from the observed peak value on the POC surface under the proposed scrambling.
4.2. Visual Effect and the Average Error Energy
We compared the visual effect of a phasescrambled image with the average error energy in order to demonstrate the validity of the discussion in Section 3.3. We used a , 8 bits/pixel image called "Lena". The key sequence was generated from the set of , with , 0.6, 0.7, 0.8, and 0.9. The average error energy was calculated according to (37) and (39) using the parameters , that is, , for to and , 0.6, 0.7, 0.8, and 0.9.
The real and imaginary parts of the phasescrambled images are shown in Figures 9(a) and 9(b), respectively. The real part of the phasescrambled images is invisible and shows almost no variation, whereas the imaginary part of the phasescrambled images is degraded as the occurrence probability approaches 0.5. The real and imaginary parts of the average error energy calculated from (37) and (39) are shown in Figures 10(a) and 10(b), respectively. When , the average of the real part of the error energy is constant regardless of the occurrence probability, whereas the average of the imaginary part of the error energy increases as the occurrence probability approaches 0.5. The average error energy is confirmed to coincide with the visual effect of the phasescrambled image.
If templates are required to be invisible, the parameters should be set as close to the set of invalid parameters as possible.
5. Conclusion
We have proposed onetime key based phase scrambling for image matching. Protecting the original information of the template visually for privacy and security, the proposed method enables keyless image matching. The occurrence probability of a member and the difference of phases were discussed for the onetime key based phase scrambling. These parameters can control the effect of visual protection and the peak value of POC. The effectiveness of visual protection has been demonstrated by the error energy between the phasescrambled image and the original image. The peak value of onetime key based phase scrambling for the case of the twomember set has been explained theoretically. Experimental results revealed the effectiveness and appropriateness of the proposed method. In the future, a theoretical explanation for the case of a multiplemember set and the degree of robustness against attacks will be considered.
References
Kuglin CD, Hines DC: The phase correlation image alignment method. Proceedings of the International Conference on Cybernetics and Society, September 1975 163165.
Chen Q, Defrise M, Deconinck F: Symmetric phaseonly matched filtering of FourierMellin transforms for image registration and recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence 1994, 16(12):11561168. 10.1109/34.387491
Foroosh H, Zerubia J, Berthod M: Extension of phase correlation to subpixel registration. IEEE Transactions on Image Processing 2002, 11(3):188200. 10.1109/83.988953
Hoge WS: A subspace identification extension to the pulse correlation method. IEEE Transactions on Medical Imaging 2003, 22(2):277280. 10.1109/TMI.2002.808359
Takita K, Aoki T, Sasaki Y, Higuchi T, Kobayashi K: Highaccuracy subpixel image registration based on phaseonly correlation. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 2003, E86A(8):19251934.
Jain AK, Ross A, Pankanti S: Biometrics: a tool for information security. IEEE Transactions on Information Forensics and Security 2006, 1(2):125143. 10.1109/TIFS.2006.873653
Miyazawa K, Ito K, Aoki T, Kobayashi K, Nakajima H: An effective approach for Iris recognition using phasebased image matching. IEEE Transactions on Pattern Analysis and Machine Intelligence 2008, 30(10):17411756. 10.1109/TPAMI.2007.70833
Fujiyoshi M, Saitou W, Watanabe O, Kiya H: Hierarchical encryption of multimedia contents for access control. Proceedings of the International Conference on Image Processing (ICIP '06), October 2006, Atlanta, Ga, USA 19771980.
Kiya H, Ito I: Image matching between scrambled images for secure data management. Proceedings of the 16th European Signal Processing Conference (EUSIPCO '08), August 2008, Lausanne, Switzerland
Ito I, Kiya H: Phase scrambling for blind image matching. Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '09), April 2009, Taipei, Taiwan 15211524.
Acknowledgment
This study was supported in part by a GrantinAid for Scientific Research C, no. 20560361, from the Japan Society for the Promotion of Science (JSPS).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License ( https://creativecommons.org/licenses/by/2.0 ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Ito (EURASIP Member), I., Kiya (EURASIP Member), H. OneTime Key Based Phase Scrambling for PhaseOnly Correlation between Visually Protected Images. EURASIP J. on Info. Security 2009, 841045 (2009). https://doi.org/10.1155/2009/841045
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1155/2009/841045
Keywords
 Discrete Fourier Transform
 Occurrence Probability
 Image Match
 Error Energy
 Inverse Discrete Fourier Transform