Fast and Automatic Watermark Resynchronization based on Zernike. Moments
|
|
- Owen Baker
- 5 years ago
- Views:
Transcription
1 Fast and Automatic Watermark Resynchronization based on Zernike Moments Xiangui Kang a, Chunhui Liu a, Wenjun Zeng b, Jiwu Huang a, Congbai Liu a a Dept. of ECE., Sun Yat-Sen Univ. (Zhongshan Univ.), Guangzhou , China. b Dept. of CS, University of Missouri-Columbia, MO65211, USA. ABSTRACT In some applications such as real-time video applications, watermark detection needs to be performed in real time. To address image watermark robustness against geometric transformations such as the combination of rotation, scaling, translation and/or cropping (RST), many prior works choose exhaustive search method or template matching method to find the RST distortion parameters, then reverse the distortion to resynchronize the watermark. These methods typically impose huge computation burden because the search space is typically a multiple dimensional space. Some other prior works choose to embed watermarks in an RST invariant domain to meet the real time requirement. But it might be difficult to construct such an RST invariant domain. Zernike moments are useful tools in pattern recognition and image watermarking due to their orthogonality and rotation invariance property. In this paper, we propose a fast watermark resynchronization method based on Zernike moments, which requires only search over scaling factor to combat RST geometric distortion, thus significantly reducing the computation load. We apply the proposed method to circularly symmetric watermarking. According to Plancherel's Theorem and the rotation invariance property of Zernike moments, the rotation estimation only requires performing DFT on Zernike moments correlation value once. Thus for RST attack, we can estimate both rotation angle and scaling factor by searching for the scaling factor to find the overall maximum DFT magnitude mentioned above. With the estimated rotation angle and scaling factor parameters, the watermark can be resynchronized. In watermark detection, the normalized correlation between the watermark and the DFT magnitude of the test image is used. Our experimental results demonstrate the advantage of our proposed method. The watermarking scheme is robust to global RST distortion as well as JPEG compression. In particular, the watermark is robust to print-rescanning and randomization-bending local distortion in Stirmark 3.1. Keywords: Watermarking, Resynchronization, Robustness, Geometric distortion, Zernike moments 1. Introduction In some applications such as real-time video applications, watermark detection needs to be performed in real time. There are two general approaches to address image watermark robustness against geometric transformations such as the combination of scaling, rotation and translation (RST). One is to do exhaustive search [1] or template matching [2, 3] to find the RST distortion parameters, and then reverse the distortion to resynchronize the watermark. This approach, isskxg@mail.sysu.edu.cn, zengw@missouri.edu, isshjw@ mail.sysu.edu.cn Security, Steganography, and Watermarking of Multimedia Contents IX, edited by Edward J. Delp III, Ping Wah Wong, Proc. of SPIE-IS&T Electronic Imaging, SPIE Vol. 6505, 65050E, 2007 SPIE-IS&T X/07/$18 SPIE-IS&T/ Vol E-1
2 however, introduces huge computation load because the search space is multiple dimensional, e.g., including scaling parameter γ, rotation parameter θ, translation parameter x, y. Another general approach is to embed watermark in an RST invariant domain [4]. This approach has the advantage that watermark detection can be done in real time. But it might be difficulty to construct such an RST invariant domain. Zernike moments are useful tools in pattern recognition and image watermarking due to their orthogonality and rotation invariance property [5-9]. In [5], a watermarking scheme is proposed that achieves invariance to rotation, but is not robust to RST distortion in general. In [6], watermark rotation invariance is achieved by taking into account the magnitude of the Zernike moments. Image normalization method is used for scale and translation invariance, that is, the origin of a test image is moved to its centroid, and is scaled to a standard size before watermark detection. This in general is not sufficiently robust as, for example, image cropping may cause a deviated centroid with respect to the normalized original image, and thus cause a scale distortion with respect to the normalized original image when they are scaled to the same standard size. As a result, the watermark can not be robust to RST distortion. In this paper, we propose a new watermark resynchronization method using Zernike moments, which requires only search over scaling factor to address RST transformations, thus the computation load can be dramatically reduced. We apply the proposed method to circularly symmetric watermarking [1]. The circularly symmetric watermark is embedded in the Discrete Fourier Transform (DFT) domain, which achieves translation invariance. According to Plancherel's Theorem and the rotation invariance property of Zernike moments, the rotation estimation only requires performing DFT on Zernike moments correlation value once. Thus for RST attack, we can estimate both rotation angle and scaling factor by simply searching for the scaling factor. With the estimated rotation angle and scaling factor parameters, the watermark can be resynchronized. For watermark detection, the normalized correlation between the watermark and the DFT magnitude of the test image is used. We demonstrate the advantage of our proposed method through simulations. The proposed watermarking scheme is robust to global RST distortion as well as JPEG compression. In particular, the watermark is robust to print-rescanning and randomization-bending local distortion in Stirmark 3.1 [10]. In the next section, Zernike moments is introduced. We present our watermarking scheme in Section 3. Simulation results are shown in Section 4. We provide some discussions and concluding remarks in Section Zernike Moments The Zernike basis [6, 8] is a set of complex polynomials which form a complete and orthogonal set on the unit disk. The form of these polynomials is defined as: jm V ( x, y) = V ( ρθ, ) = R ( ρ) e θ (1) where 2 2 ρ = x + y, θ = arctan( y/ x), n is a non-negative integer; m is an integer subject to the constraint that n- m is even, and m n, the radial Zernike polynomial R ( ρ ) is defined as follows: R ( n m )/2 s n 2 s n+ 1 ( 1) ( n s)! ρ ( ρ) = (2) π n+ m n m s= 0 s!( s)!( s)! 2 2 SPIE-IS&T/ Vol E-2
3 These polynomials are orthogonal and normal basis, satisfy: * [ V( x, y)] Vpq ( x, y) dxdy = δ x y npδmq With 1 { a = δ b ab 0 otherwise =. The Zernike moment of order n with repetition m for an analog image function f(x, y) is defined as: 2 x + y 2 1 * A f( x, yv ) ( x, y) dxdy where * denotes complex conjugate. For digital image, the integrals should be substituted with summations: = (3) * 2 2 f ( x, y) V ( x, y) dxdy, + A = x y 1 (4) x y 3. Proposed Scheme We describe our proposed watermarking scheme in details in this section. A: Watermark Embedding Let f(x, y) be an N N grayscale image, its Discrete Fourier Transformation (DFT) can be given as follows: N 1 N 1 j2π ( xk1/ N+ yk2/ N) e x= 0 y= 0 = (5) Fk (, k) f( xy, ), k1, k [1, N ] Let M(k 1,k 2 ) = F(k 1,k 2 ) be the magnitude of F(k 1,k 2 ). Similar to [1], we design a circularly symmetric watermark that will be embedded in the DFT domain. We choose a binary antipodal pseudorandom sequence as the watermark Fig. 1. The watermark Fig. 2. The value of c Z obtained by performing FFT on F(m). SPIE-IS&T/ Vol E-3
4 sequence, which is composed of 1s and -1s. The watermark possesses a ring disk (R 1 R R 2 ) (Fig.1). 2 2 W( k1, k2) =± 1, if R1 k1 + k2 R2, otherwise W( k1, k 2) = 0. The ring disk is separated into (R 2 - R 1 )/3 homocentric sub-rings uniformly, and each sub-ring is divided into 120 sectors evenly. In each sector, the value of watermark is the same (1 or -1) as shown in Fig.1. We use keys to generate different watermarks. The watermark is embedded in the middle frequency band, thus it is expected to be robust and invisible. The embedding formula can be expressed as follows: M '( k, k ) = M( k, k )(1 + aw( k, k )) (6) where M (k 1, k 2 ) is the modified magnitude of DFT, W(k 1,k 2 ) is the watermark, and a is the embedding strength. In order to ensure that the IDFT of the modified magnitude is real, the watermark must preserve the following symmetry property: W( k, k ) = W( N + 1 k, N + 1 k ), k, k [1, R ] (7) B. Watermark detection Let M be the DFT magnitude of the test image. The correlation c: R2 R2 c = M '( k, k ) W( k, k ) (8) k1= 1k2= can be used to detect the watermark. Assuming that W and M are independent and identically distributed random variables, W has zero mean value. The mean value µ c of c is given by µ = Kaµ if the test image is watermarked c M with W; otherwise µ c =0. The variance σ c of c is given by σ = K[ µ + σ (1 + a )] if the test image is watermarked C M M with W; otherwise σ = K[ µ + σ ] [1]. Here C M M K = π ( R R ), M µ is the mean value of M(k 1,k 2 ), σ is the M variance of M(k 1,k 2 ). In practice, we use normalized correlation value c = c / µ, and we can use µ M instead of µ M [1]. We generate 500 different watermarks by a random number generator with different keys, which have been selected to have near zero mean value, then embed them in the Lena image respectively. We then calculate the normalized correlator output c n between the watermark and the DFT magnitude of the watermarked Lena image. The distribution of c n is shown in Fig. 4 in red. The normalized correlator output c n between the watermark and the DFT magnitude of the unwatermarked Lena is shown in Fig. 4 in green. Fig. 5 is the distribution of c n for the Baboon image. We choose a threshold T=0.17 empirically. If c n 0.17, it is concluded that the watermark W(k 1,k 2 ) is present in the test image; otherwise the test image might have undergone geometric distortion, so the watermark should be resynchronized before performing watermark detection. If c n <0.17 after watermark resynchronization, we conclude that the watermark is not present in the test image. n c SPIE-IS&T/ Vol E-4
5 C. Fast watermark resynchronization based on Zernike moments The image may potentially undergo a combination attack of rotation, scaling, translation and cropping (RST distortion). DFT has the shift invariance property, so image translation has no impact on the watermark. Rotation in the spatial domain by an angle causes rotation in the DFT domain by the same angle. Scaling in the spatial domain causes inverse scaling in the frequency domain, as illustrated below DFT[ f ( sx, sy)] = F( k, k ) (9) 2 s s s In order to resynchronize the watermark, the rotation and scaling distortion in the DFT domain should be reversed. An exhaustive two dimensional search for rotation and scaling parameters by searching for the maximum correlation value c may be performed [1]. But it introduces a heavy computation load. According to orthogonality of Zernike basis and Plancherel's Theorem [11], we have: M ' W * A ( A ) = '(, ) (, ) M k k W k k (10) n m k1 k2 where A M ' denotes the Zernike moment of M (k 1,k 2 ), and A denotes the Zernike moment of W(k 1,k 2 ), * denotes W complex conjugate. In other words, the correlation between M (k 1,k 2 ) and W(k 1,k 2 ) is equal to the correlation between their Zernike moments. So the search for the maximum correlation value c corresponds to the search for the maximum correlation between their Zernike moments. We take a look at a test image M t (k 1,k 2 ) which has undergone a rotation by α degree. According to the property of Zernike moments [6], the Zernike moments of M t (k 1,k 2 ) is: t jmα A Ae = (11) Equation (11) shows that each Zernike moment acquires a phase shift due to rotation. Now we search for the maximum Zernike moments correlation through rotating M t (k 1,k 2 ) by an angle of φ. The Zernike moments correlation c Z between the rotated M t (k 1,k 2 ) and W(k 1,k 2 ) may be calculated as c = = Z Fm ( ) t t M jmϕ W * M W * jmϕ = ( ) = ( ) n m n m M W * ( A ( A ) ) e m n m e A e A A A e t jmϕ M W * Where Fm ( ) = A ( A ) and φ [0, 360º]. Obviously, c Z is a one-dimensional DFT of F(m). According to n t Equation (10-12), searching for the maximum correlation value c through rotating the test image by different angles may be substituted by performing FFT on F(m), then find its maximum value. In Fig. 2, the x-axis denotes the rotation degree, and the Y-axis denotes c Z. We calculate the F(m) of M t (k 1,k 2 ), perform FFT on F(m), and obtain the value of c Z. In Fig. 2, there are two maximum c Z values due to the symmetric property of DFT. We can conclude that the test image has undergone a 10º (or 190º) rotation according to the maximum value of c Z. According to Eq. (10), the maximum value of jmϕ (12) SPIE-IS&T/ Vol E-5
6 c Z corresponds to the maximum correlation c. Thus we propose a new method that uses Fast Fourier Transform (FFT) to locate the rotation parameter based on the maximum Zernike moment correlation. If the image undergoes rotation combined with cropping and scaling attack, We only need to perform a numerical search over the scaling factor [1], while the rotation parameter can be determined simultaneously by performing FFT on F(m). We perform search for the maximum c Z between the watermark and a ring of DFT magnitude M t (k 1,k 2 ) of the test image whose size is bounded by γr 1 (inner radius) and γr 2 (outer radius) for every γ (0<γ<1). The flowchart for resynchronization is illustrated in Fig. 3. test image FFT2 M t (k 1,k 2 ) Frequency resample in different step Zernike Moment correlation Reverse rotation and scale Roation and scale parameter find maximum c Z FFT F(m) Fig. 3. The flowchart of watermark resynchronization Fig. 4. Distribution of the normalized correlator output for unwatermarked Lena (left) and watermarked Lena (right) with 500 different watermarks ID L I 1.2 Fig. 5. Distribution of the normalized correlator output for unwatermarked Baboon (left) and watermarked Baboon (right) with 500 different watermarks. SPIE-IS&T/ Vol E-6
7 (a) Fig.6. (a) Original Lena of size (b) (b) Watermarked Lena (PSNR: 38.8dB) -F "i:: L: ' (a) Fig.7. (a) Original Baboon ( ) (b) Watermarked Baboon (PSNR: 34.7dB). (b) 4. Simulation Results We applied the proposed scheme on many images. We report some representative results here. In our work, we choose α=0.3, R 1 =52, R 2 =128, and the watermark is a 1560 bits pseudorandom sequence generated by a random number generator with a key. We use Zernike Moments lower than 41 order in this paper. Fig. 6 shows the original Lena image and the watermarked Lena image. The Peak Signal-to-Noise Ratio (PSNR) of the watermarked Lena image is 38.8dB. Fig.7 shows the original Baboon image and watermarked Baboon image. The PSNR of the watermarked Baboon image is 34.7dB. The watermark is robust to JPEG compression, anisotropic cropping and scaling etc. In particular, the scheme is robust to RST geometric distortion, print-rescanning, randomization-bending (RB) in Stirmark 3.1 etc. SPIE-IS&T/ Vol E-7
8 .,_-c- 7', < (a) (b) (c) ioj Fig. 8. (a) JPEG-50 and RST distorted Lena image. (b) JPEG-50 and RST distorted Baboon image. (c) The distribution of the correlation output for the unwatermarked RST distorted Lena image and watermarked RST distorted Lena images with 500 watermarks; (d) The distribution of the correlation output for the unwatermarked RST distorted Baboon image and watermarked RST distorted Baboon images with 500 watermarks. (d) (a) Normalized correlator output value c n =0.59 (b) c n =0.47 Fig. 9. Printing and rescanning watermarked image SPIE-IS&T/ Vol E-8
9 Fig. 8 (a) and (b) show the test images that have undergone a combination of JPEG compression with quality factor of 50 (JPEG-50) and RST distortion. The watermark resynchronization is performed first, then the normalized correlation value c n is calculated. The test results are shown in Fig. 8 (c) and (d) respectively. For 500 different watermarks which are generated using different keys, the watermarks can all be detected. The empirical false positive rate and false negative rate for this combination attack is 0 for 2000 times tests shown in Fig. 8 (c) and (d). Fig. 9 shows the print and rescanning watermarked Lena images. Note that the image in Fig. 9 (b) is with slight rotation and scaling. The normalized correlation value c n is 0.59 and 0.47 for these two images respectively. It is noted that the watermark is also robust to randomization and bending distortion (Fig. 10) in Stirmark 3.1 [11]. Fig. 11 is the distribution of the correlation output for 1000 unwatermarked RB distorted images and 1000 watermarked RB distorted images. The empirical false positive rate for RB is 0, while empirical false negative for RB is Fig. 10 Stirmark_random_bend distorted Lena image ID -02 -DI Fig. 11. The distribution of the correlation output for 1000 unwatermarked RB distorted images and 1000 watermarked RB distorted images. 5. Discussion and conclusions We only need to compute Zernike basis V once in our proposed scheme. Zernike Moments may be computed via an efficient method as proposed in [9]. Once R 2 is fixed, V may be stored in a lookup table to further save computation. In our proposed scheme, we use 3º sector, and the watermark can be detected after a rotation of ± 1º. Using the exhaustive search method used in [1] to detect the watermark, one needs 180 times 2D-Matrix rotation interpolation. SPIE-IS&T/ Vol E-9
10 While using our proposed method, one needs only one-time rotation interpolation. Thus computation time of the proposed scheme is about 1/180 of the exhaustive search method [1]. We take a look at a watermarked image is rotated by an angle, cropped to (a cropping of more than 22%), then scaled back to (Fig. 8a). The number of changing the scaling factor search depends on the cropped image portion. If the search step is 6, the total number of searches is ( )/6+1=11. So the watermark resynchronization calculation is very fast. The main contribution of this paper is that we propose a fast automatic watermark resynchronization method based on Zernike moments. With the proposed scheme, the watermark can be detected automatically within very reasonable time even if the watermarked images undergo the global RST distortion or printing-rescanning or local RB distortion. Reference [1] Vassilios Solachidis and Ioannis Pitas, Circularly Symmetric Watermark Embedding in 2-D DFT Domain, IEEE Transaction on Image Processing, vol. 10, No. 11, November [2] S. Pereia and T. Pun, Robust template matching for affine resistant image watermarks, IEEE Trans. Image Processing, vol. 9, pp , [3] X. Kang, J. Huang, and Y. Q. Shi, Y. Lin: A DWT-DFT composite watermarking scheme robust to both affine transform and JPEG compression. IEEE Trans. on Circuits and Systems for Video Technology, vol. 13, no. 8, pp , Aug [4] J. J. K. O Ruanaidh and T. Pun, Rotation, scale, and translation invariant spread spectrum digital image watermarking, Signal Processing, vol. 66, pp , [5] M. Farzam and S. Shahram Shirani, A robust multimedia watermarking technique using Zernike transform, in Proc. IEEE Int. Workshop Multimedia Signal Processing, 2001, pp [6] H. S. Kim and Heung-Kyu Lee, Invariant Image Watermark Using Zernike Moments, IEEE Transaction on Circuits and Systems for Video Technology, vol. 13, No. 8, August [7] C. H. Teh and R. T. Chin, On image analysis by the methods of moments, IEEE Trans. Pattern Anal. Machine Intell., vol. 10, pp , Apr [8] A. Khotanzad and Y. H. Hong, Invariant image recognition by Zernike moments, IEEE Trans. Pattern Anal. Machine Intell., vol. 12, pp , May [9] Gholam Reza Amayeh, Ali Erol, George Bebis, and Mircea Nocolescu, Accurate and efficient computation of high order Zernike moments, International Symposium on Visual Computing, LNCS, vol. 3804, Lake Tahoe, NV, December [10] F. A. P. Petitcolas, R. J. Anderson, and M. G. Kuhn, Attacks on copyright marking systems, in Proc. 2nd Int.Workshop Information Hiding,, pp , [11] Bracewell, R. "Rayleigh's Theorem." The Fourier Transform and Its Applications. New York: McGraw-Hill, pp , Acknowledgments Authors appreciate the support by NSFC ( , , ), 973 Program (2006CB303104), NSF of Guangdong ( , ), NSF of Guangzhou (2006Z3-D3041). SPIE-IS&T/ Vol E-10
Invariant Image Watermark Using Zernike Moments
766 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 13, NO. 8, AUGUST 2003 Invariant Image Watermark Using Zernike Moments Hyung Shin Kim and Heung-Kyu Lee, Member, IEEE Abstract This
More informationROTATION, TRANSLATION AND SCALING INVARIANT WATERMARKING USING A GENERALIZED RADON TRANSFORMATION
ROTATION, TRANSLATION AND SCALING INVARIANT WATERMARKING USING A GENERALIZED RADON TRANSFORMATION D. SIMITOPOULOS, A. OIKONOMOPOULOS, AND M. G. STRINTZIS Aristotle University of Thessaloniki Electrical
More information1. INTRODUCTION. Yen-Chung Chiu. Wen-Hsiang Tsai.
Copyright Protection by Watermarking for Color Images against Rotation and Scaling Attacks Using Coding and Synchronization of Peak Locations in DFT Domain Yen-Chung Chiu Department of Computer and Information
More informationImage Recognition Using Modified Zernike Moments
Sensors & Transducers 204 by IFSA Publishing S. L. http://www.sensorsportal.com Image Recognition Using Modified ernike Moments Min HUANG Yaqiong MA and Qiuping GONG School of Computer and Communication
More informationUniversity of Siena. Multimedia Security. Watermark extraction. Mauro Barni University of Siena. M. Barni, University of Siena
Multimedia Security Mauro Barni University of Siena : summary Optimum decoding/detection Additive SS watermarks Decoding/detection of QIM watermarks The dilemma of de-synchronization attacks Geometric
More informationA Modified Moment-Based Image Watermarking Method Robust to Cropping Attack
A Modified Moment-Based Watermarking Method Robust to Cropping Attack Tianrui Zong, Yong Xiang, and Suzan Elbadry School of Information Technology Deakin University, Burwood Campus Melbourne, Australia
More informationGeometric Invariant Semi-fragile Image Watermarking Using Real Symmetric Matrix
Tamkang Journal of Science and Engineering, Vol. 10, No. 3, pp. 211220 (2007) 211 Geometric Invariant Semi-fragile Image Watermarking Using Real Symmetric Matrix Ching-Tang Hsieh 1 *, Yeh-Kuang Wu 1 and
More informationIEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 20, NO. 8, AUGUST
IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL 20, NO 8, AUGUST 2011 2189 Affine Legendre Moment Invariants for Image Watermarking Robust to Geometric Distortions Hui Zhang, Member, IEEE, Huazhong Shu, Senior
More informationWavelet Packet Based Digital Image Watermarking
Wavelet Packet Based Digital Image ing A.Adhipathi Reddy, B.N.Chatterji Department of Electronics and Electrical Communication Engg. Indian Institute of Technology, Kharagpur 72 32 {aar, bnc}@ece.iitkgp.ernet.in
More informationWatermarking in the Space/Spatial-Frequency Domain Using Two-Dimensional Radon Wigner Distribution
650 IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 10, NO. 4, APRIL 2001 Watermarking in the Space/Spatial-Frequency Domain Using Two-Dimensional Radon Wigner Distribution Srdjan Stanković, Member, IEEE,
More informationRotation, scale and translation invariant digital image watermarking. O'RUANAIDH, Joséph John, PUN, Thierry. Abstract
Proceedings Chapter Rotation, scale and translation invariant digital image watermarking O'RUANAIDH, Joséph John, PUN, Thierry Abstract A digital watermark is an invisible mark embedded in a digital image
More informationEmpirical Analysis of Invariance of Transform Coefficients under Rotation
International Journal of Engineering Research and Development e-issn: 2278-67X, p-issn: 2278-8X, www.ijerd.com Volume, Issue 5 (May 25), PP.43-5 Empirical Analysis of Invariance of Transform Coefficients
More informationAccurate Orthogonal Circular Moment Invariants of Gray-Level Images
Journal of Computer Science 7 (5): 75-722, 20 ISSN 549-3636 20 Science Publications Accurate Orthogonal Circular Moment Invariants of Gray-Level Images Khalid Mohamed Hosny Department of Computer Science,
More informationMichal Kuneš
A (Zernike) moment-based nonlocal-means algorithm for image denoising Michal Kuneš xkunes@utia.cas.cz ZOI UTIA, ASCR, Friday seminar 13.03.015 Introduction - Uses nonlocal (NL) means filter - Introduce
More informationObject Recognition Using a Neural Network and Invariant Zernike Features
Object Recognition Using a Neural Network and Invariant Zernike Features Abstract : In this paper, a neural network (NN) based approach for translation, scale, and rotation invariant recognition of objects
More informationScience Insights: An International Journal
Available online at http://www.urpjournals.com Science Insights: An International Journal Universal Research Publications. All rights reserved ISSN 2277 3835 Original Article Object Recognition using Zernike
More informationStudy of Wavelet Functions of Discrete Wavelet Transformation in Image Watermarking
Study of Wavelet Functions of Discrete Wavelet Transformation in Image Watermarking Navdeep Goel 1,a, Gurwinder Singh 2,b 1ECE Section, Yadavindra College of Engineering, Talwandi Sabo 2Research Scholar,
More informationDigital Image Watermarking Algorithm Based on Wavelet Packet
www.ijcsi.org 403 Digital Image ing Algorithm Based on Wavelet Packet 1 A.Geetha, 2 B.Vijayakumari, 3 C.Nagavani, 4 T.Pandiselvi 1 3 4 Faculty of Kamaraj College of Engineering and Technology Department
More informationVarious Shape Descriptors in Image Processing A Review
Various Shape Descriptors in Image Processing A Review Preetika D Silva 1, P. Bhuvaneswari 2 1 PG Student, Department of Electronics and Communication, Rajarajeswari College of Engineering, Bangalore,
More informationMOMENT functions are used in several computer vision
IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 13, NO. 8, AUGUST 2004 1055 Some Computational Aspects of Discrete Orthonormal Moments R. Mukundan, Senior Member, IEEE Abstract Discrete orthogonal moments
More informationDetection of Copy-Rotate-Move Forgery Using Zernike Moments
Detection of Copy-Rotate-Move Forgery Using Zernike Moments Seung-Jin Ryu, Min-Jeong Lee, and Heung-Kyu Lee Department of Computer Science, Korea Advanced Institute of Science and Technology, Daejeon,
More informationFeature Extraction Using Zernike Moments
Feature Extraction Using Zernike Moments P. Bhaskara Rao Department of Electronics and Communication Engineering ST.Peter's Engineeing college,hyderabad,andhra Pradesh,India D.Vara Prasad Department of
More informationSCALE INVARIANT AND ROTATION INVARIANT IMAGE WATERMARKING. Spandana Bodapati. Bachelor of Science. Jawaharlal Nehru Technological University
SCALE INVARIANT AND ROTATION INVARIANT IMAGE WATERMARKING By Spandana Bodapati Bachelor of Science Jawaharlal Nehru Technological University Hyderabad, India 200 Submitted to the Faculty of the Graduate
More informationA Method for Blur and Similarity Transform Invariant Object Recognition
A Method for Blur and Similarity Transform Invariant Object Recognition Ville Ojansivu and Janne Heikkilä Machine Vision Group, Department of Electrical and Information Engineering, University of Oulu,
More informationQuantization Index Modulation using the E 8 lattice
1 Quantization Index Modulation using the E 8 lattice Qian Zhang and Nigel Boston Dept of Electrical and Computer Engineering University of Wisconsin Madison 1415 Engineering Drive, Madison, WI 53706 Email:
More informationAn Efficient Algorithm for Fast Computation of Pseudo-Zernike Moments
An Efficient Algorithm for Fast Computation of Pseudo-Zernike Moments Chong, Chee-Way Fac. of Engg & Tech., Multimedia University, Jalan Air Keroh Lama, 75450 Melaka, Malaysia. (Email:cwayc@pc.jaring.my)
More informationQISLSQb: A Quantum Image Steganography Scheme Based on Least Significant Qubit
06 International Conference on Mathematical, Computational and Statistical Sciences and Engineering (MCSSE 06) ISBN: 978--60595-396-0 QISLSQb: A Quantum Image Steganography Scheme Based on Least Significant
More informationRole of Assembling Invariant Moments and SVM in Fingerprint Recognition
56 Role of Assembling Invariant Moments SVM in Fingerprint Recognition 1 Supriya Wable, 2 Chaitali Laulkar 1, 2 Department of Computer Engineering, University of Pune Sinhgad College of Engineering, Pune-411
More informationSecurity Analysis of ISS Watermarking Using Natural Scene Statistics
Security Analysis of ISS Watermarking Using Natural Scene Statistics Dong Zhang 1, Jiangqun Ni 1, Qiping Zeng 1, Dah-Jye Lee 2, and Jiwu Huang 1 1 School of Information Science and Technology, Sun Yat-sen
More informationDouble Sided Watermark Embedding and Detection with Perceptual Analysis
DOUBLE SIDED WATERMARK EMBEDDIG AD DETECTIO WITH PERCEPTUAL AALYSIS Double Sided Watermark Embedding and Detection with Perceptual Analysis Jidong Zhong and Shangteng Huang Abstract In our previous work,
More informationHalftone Image Watermarking by Content Aware Double-sided Embedding Error Diffusion
1 Halftone Image Watermarking by Content Aware Double-sided Embedding Error Diffusion Yuanfang Guo, Member, IEEE, Oscar C. Au, Fellow, IEEE, Rui Wang, Member, IEEE, Lu Fang, Member, IEEE, Xiaochun Cao,
More informationResearch Article Effect of Different Places in Applying Laplacian Filter on the Recovery Algorithm in Spatial Domain Watermarking
Research Journal of Applied Sciences, Engineering and Technology 7(24): 5157-5162, 2014 DOI:10.19026/rjaset.7.912 ISSN: 2040-7459; e-issn: 2040-7467 2014 Maxwell Scientific Publication Corp. Submitted:
More informationISeCure. Nowadays, copyright infringement, unauthorized. The ISC Int'l Journal of Information Security
The ISC Int'l Journal of Information Security July 216, Volume 8, Number 2 (pp. 131 139) http://www.isecure-journal.org Optimum Decoder for Multiplicative Spread Spectrum Image Watermarking with Laplacian
More informationAffine Normalization of Symmetric Objects
Affine Normalization of Symmetric Objects Tomáš Suk and Jan Flusser Institute of Information Theory and Automation, Academy of Sciences of the Czech Republic, Pod vodárenskou věží 4, 182 08 Prague 8, Czech
More informationEvaluation of OCR Algorithms for Images with Different Spatial Resolutions and Noises
Evaluation of OCR Algorithms for Images with Different Spatial Resolutions and Noises by Qing Chen A thesis submitted to the School of Graduate Studies and Research in partial fulfillment of the requirements
More informationDigital Watermark Detection in Visual Multimedia Content
Digital Watermark Detection in Visual Multimedia Content PhD Thesis Defense Peter Meerwald Dept. of Computer Sciences, University of Salzburg September 2010 Watermarking Watermarking is a technology to
More informationA Novel Activity Detection Method
A Novel Activity Detection Method Gismy George P.G. Student, Department of ECE, Ilahia College of,muvattupuzha, Kerala, India ABSTRACT: This paper presents an approach for activity state recognition of
More informationDetection of signal transitions by order statistics filtering
Detection of signal transitions by order statistics filtering A. Raji Images, Signals and Intelligent Systems Laboratory Paris-Est Creteil University, France Abstract In this article, we present a non
More information1782 IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 18, NO. 8, AUGUST 2009
1782 IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 18, NO. 8, AUGUST 2009 A New Statistical Detector for DWT-Based Additive Image Watermarking Using the Gauss Hermite Expansion S. M. Mahbubur Rahman, M.
More informationInvariant Pattern Recognition using Dual-tree Complex Wavelets and Fourier Features
Invariant Pattern Recognition using Dual-tree Complex Wavelets and Fourier Features G. Y. Chen and B. Kégl Department of Computer Science and Operations Research, University of Montreal, CP 6128 succ.
More informationAdaptive Audio Watermarking via the Optimization. Point of View on the Wavelet-Based Entropy
Adaptive Audio Watermarking via the Optimization Point of View on the Wavelet-Based Entropy Shuo-Tsung Chen, Huang-Nan Huang 1 and Chur-Jen Chen Department of Mathematics, Tunghai University, Taichung
More informationDetecting LSB Matching by Applying Calibration Technique for Difference Image
Detecting LSB atching by Applying Calibration Technique for Difference Image iaolong Li Institute of Computer Science & Technology Peking University 87, Beijing, P. R. China lixiaolong@icst.pku.edu.cn
More informationInformation Hiding and Covert Communication
Information Hiding and Covert Communication Andrew Ker adk @ comlab.ox.ac.uk Royal Society University Research Fellow Oxford University Computing Laboratory Foundations of Security Analysis and Design
More informationStego key searching for LSB steganography on JPEG decompressed image
. RESEARCH PAPER. SCIENCE CHINA Information Sciences March 2016, Vol. 59 032105:1 032105:15 doi: 10.1007/s11432-015-5367-x Stego key searching for LSB steganography on JPEG decompressed image Jiufen LIU
More informationA New Efficient Method for Producing Global Affine Invariants
A New Efficient Method for Producing Global Affine Invariants Esa Rahtu, Mikko Salo 2, and Janne Heikkilä Machine Vision Group, Department of Electrical and Information Engineering, P.O. Box 45, 94 University
More informationA New Two-dimensional Empirical Mode Decomposition Based on Classical Empirical Mode Decomposition and Radon Transform
A New Two-dimensional Empirical Mode Decomposition Based on Classical Empirical Mode Decomposition and Radon Transform Zhihua Yang and Lihua Yang Abstract This paper presents a new twodimensional Empirical
More informationRotation, Scale and Translation Resilient Public Watermarking for Images
Roaion Scale and Translaion Resilien Public Waermarking or Images Ching-Yung Lin a Min Wu b Jerey A. Bloom c Ma L. Miller c Ingemar J. Cox c Yui Man Lui d a Columbia Universiy New York NY b Princeon Universiy
More informationA Robust Modular Wavelet Network Based Symbol Classifier
A Robust Modular Wavelet Network Based Symbol Classifier A.K. Mishra, P.W. Fieguth, D.A. Clausi University of Waterloo, Vision and Image Processing Group akmishra, pfieguth, dclausi@uwaterloo.ca Abstract.
More informationAn Investigation of 3D Dual-Tree Wavelet Transform for Video Coding
MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com An Investigation of 3D Dual-Tree Wavelet Transform for Video Coding Beibei Wang, Yao Wang, Ivan Selesnick and Anthony Vetro TR2004-132 December
More information2. Definition & Classification
Information Hiding Data Hiding K-H Jung Agenda 1. Data Hiding 2. Definition & Classification 3. Related Works 4. Considerations Definition of Data Hiding 3 Data Hiding, Information Hiding Concealing secret
More informationQuantization Based Watermarking Methods Against Valumetric Distortions
International Journal of Automation and Computing 14(6), December 2017, 672-685 DOI: 10.1007/s11633-016-1010-6 Quantization Based Watermarking Methods Against Valumetric Distortions Zai-Ran Wang 1,2 Jing
More informationRounding Transform. and Its Application for Lossless Pyramid Structured Coding ABSTRACT
Rounding Transform and Its Application for Lossless Pyramid Structured Coding ABSTRACT A new transform, called the rounding transform (RT), is introduced in this paper. This transform maps an integer vector
More informationObject Recognition Using Local Characterisation and Zernike Moments
Object Recognition Using Local Characterisation and Zernike Moments A. Choksuriwong, H. Laurent, C. Rosenberger, and C. Maaoui Laboratoire Vision et Robotique - UPRES EA 2078, ENSI de Bourges - Université
More informationThe Efficient Discrete Tchebichef Transform for Spectrum Analysis of Speech Recognition
The Efficient Discrete Tchebichef Transform for Spectrum Analysis of Speech Recognition Ferda Ernawan 1, Nur Azman Abu 2 and Nanna Suryana 2 1 Faculty of Information and Communication Technology, Universitas
More informationNew Steganographic scheme based of Reed- Solomon codes
New Steganographic scheme based of Reed- Solomon codes I. DIOP; S.M FARSSI ;O. KHOUMA ; H. B DIOUF ; K.TALL ; K.SYLLA Ecole Supérieure Polytechnique de l Université Dakar Sénégal Email: idydiop@yahoo.fr;
More informationA Hypothesis Testing Approach for Achieving Semi-fragility in Multimedia Authentication
A Hypothesis Testing Approach for Achieving Semi-fragility in Multimedia Authentication Chuhong Fei a, Deepa Kundur b, and Raymond Kwong a a University of Toronto, 10 King s College Road, Toronto, ON Canada
More informationNew Traceability Codes against a Generalized Collusion Attack for Digital Fingerprinting
New Traceability Codes against a Generalized Collusion Attack for Digital Fingerprinting Hideki Yagi 1, Toshiyasu Matsushima 2, and Shigeichi Hirasawa 2 1 Media Network Center, Waseda University 1-6-1,
More informationContent-based document signature: ongoing work
Content-based document signature: ongoing work Anh Thu Phan Ho, Petra-Krämer Gomez and Mickaël Coustaty L3i laboratory, University of La Rochelle GDR Sécurité Informatique réunion 31 Mai Outline 1 Motivation
More informationThis is a repository copy of The effect of quality scalable image compression on robust watermarking.
This is a repository copy of The effect of quality scalable image compression on robust watermarking. White Rose Research Online URL for this paper: http://eprints.whiterose.ac.uk/7613/ Conference or Workshop
More informationConstraint relationship for reflectional symmetry and rotational symmetry
Journal of Electronic Imaging 10(4), 1 0 (October 2001). Constraint relationship for reflectional symmetry and rotational symmetry Dinggang Shen Johns Hopkins University Department of Radiology Baltimore,
More informationA New Quantum Watermarking Based on Quantum Wavelet Transforms
Commun. Theor. Phys. 67 207 732 742 Vol. 67, No. 6, June, 207 A New Quantum Watermarking Based on Quantum Wavelet Transforms Shahrokh Heidari, Mosayeb Naseri, 2, Reza Gheibi, 3 Masoud Baghfalaki, 4 Mohammad
More information446 SCIENCE IN CHINA (Series F) Vol. 46 introduced in refs. [6, ]. Based on this inequality, we add normalization condition, symmetric conditions and
Vol. 46 No. 6 SCIENCE IN CHINA (Series F) December 003 Construction for a class of smooth wavelet tight frames PENG Lizhong (Λ Π) & WANG Haihui (Ξ ) LMAM, School of Mathematical Sciences, Peking University,
More informationarxiv: v1 [cs.mm] 2 Feb 2017 Abstract
DCT-like Transform for Image Compression Requires 14 Additions Only F. M. Bayer R. J. Cintra arxiv:1702.00817v1 [cs.mm] 2 Feb 2017 Abstract A low-complexity 8-point orthogonal approximate DCT is introduced.
More informationA METHOD OF FINDING IMAGE SIMILAR PATCHES BASED ON GRADIENT-COVARIANCE SIMILARITY
IJAMML 3:1 (015) 69-78 September 015 ISSN: 394-58 Available at http://scientificadvances.co.in DOI: http://dx.doi.org/10.1864/ijamml_710011547 A METHOD OF FINDING IMAGE SIMILAR PATCHES BASED ON GRADIENT-COVARIANCE
More informationA Low-Error Statistical Fixed-Width Multiplier and Its Applications
A Low-Error Statistical Fixed-Width Multiplier and Its Applications Yuan-Ho Chen 1, Chih-Wen Lu 1, Hsin-Chen Chiang, Tsin-Yuan Chang, and Chin Hsia 3 1 Department of Engineering and System Science, National
More informationOSCILLATION OF THE MEASUREMENT ACCURACY OF THE CENTER LOCATION OF AN ELLIPSE ON A DIGITAL IMAGE
OSCILLATION OF THE MEASUREMENT ACCURACY OF THE CENTER LOCATION OF AN ELLIPSE ON A DIGITAL IMAGE R. Matsuoka a, b a Research and Development Division, Kokusai Kogyo Co., Ltd., -4-1 Harumi-cho, Fuchu, Tokyo
More informationImproved Adaptive LSB Steganography based on Chaos and Genetic Algorithm
Improved Adaptive LSB Steganography based on Chaos and Genetic Algorithm Lifang Yu, Yao Zhao 1, Rongrong Ni, Ting Li Institute of Information Science, Beijing Jiaotong University, BJ 100044, China Abstract
More informationCapacity-Approaching Codes for Reversible Data Hiding
Capacity-Approaching Codes for Reversible Data Hiding Weiming Zhang 1,2,BiaoChen 1, and Nenghai Yu 1, 1 Department of Electrical Engineering & Information Science, University of Science and Technology
More informationarxiv: v2 [cs.cr] 6 Aug 2017
Cryptanalyzing an Image Scrambling Encryption Algorithm of Pixel Bits Chengqing Li a,, Dongdong Lin a, Jinhu Lü b a Hunan Province Cooperative Innovation Center for Wind Power Equipment and Energy Conversion,
More information- An Image Coding Algorithm
- An Image Coding Algorithm Shufang Wu http://www.sfu.ca/~vswu vswu@cs.sfu.ca Friday, June 14, 2002 22-1 Agenda Overview Discrete Wavelet Transform Zerotree Coding of Wavelet Coefficients Successive-Approximation
More informationNoise Reduction of JPEG Images by Sampled-Data H Optimal ε Filters
SICE Annual Conference 25 in Okayama, August 8-1, 25 Okayama University, Japan Noise Reduction of JPEG Images by Sampled-Data H Optimal ε Filters H. Kakemizu,1, M. Nagahara,2, A. Kobayashi,3, Y. Yamamoto,4
More informationPhase-Correlation Motion Estimation Yi Liang
EE 392J Final Project Abstract Phase-Correlation Motion Estimation Yi Liang yiliang@stanford.edu Phase-correlation motion estimation is studied and implemented in this work, with its performance, efficiency
More informationResearch Article A Steganographic Method Based on Pixel-Value Differencing and the Perfect Square Number
Applied Mathematics Volume 013, Article ID 189706, 8 pages http://dx.doi.org/10.1155/013/189706 Research Article A Steganographic Method Based on Pixel-Value Differencing and the Perfect Square Number
More informationFARSI CHARACTER RECOGNITION USING NEW HYBRID FEATURE EXTRACTION METHODS
FARSI CHARACTER RECOGNITION USING NEW HYBRID FEATURE EXTRACTION METHODS Fataneh Alavipour 1 and Ali Broumandnia 2 1 Department of Electrical, Computer and Biomedical Engineering, Qazvin branch, Islamic
More informationOriginal Article Design Approach for Content-Based Image Retrieval Using Gabor-Zernike Features
International Archive of Applied Sciences and Technology Volume 3 [2] June 2012: 42-46 ISSN: 0976-4828 Society of Education, India Website: www.soeagra.com/iaast/iaast.htm Original Article Design Approach
More informationOpen Access Measuring Method for Diameter of Bearings Based on the Edge Detection Using Zernike Moment
Send Orders for Reprints to reprints@benthamscience.ae 114 The Open Automation and Control Systems Journal, 2015, 7, 114-119 Open Access Measuring Method for Diameter of Bearings Based on the Edge Detection
More informationNoisy Word Recognition Using Denoising and Moment Matrix Discriminants
Noisy Word Recognition Using Denoising and Moment Matrix Discriminants Mila Nikolova Département TSI ENST, rue Barrault, 753 Paris Cedex 13, France, nikolova@tsi.enst.fr Alfred Hero Dept. of EECS, Univ.
More informationA WAVELET BASED CODING SCHEME VIA ATOMIC APPROXIMATION AND ADAPTIVE SAMPLING OF THE LOWEST FREQUENCY BAND
A WAVELET BASED CODING SCHEME VIA ATOMIC APPROXIMATION AND ADAPTIVE SAMPLING OF THE LOWEST FREQUENCY BAND V. Bruni, D. Vitulano Istituto per le Applicazioni del Calcolo M. Picone, C. N. R. Viale del Policlinico
More informationCopy-Move Forgery Detection Using Zernike and Pseudo Zernike Moments
039 The International Arab Journal of Information Technology, Vol. 13, No. 6A, 2016 Copy-Move Forgery Detection Using Zernike and Pseudo Zernike Moments Khaled Mahmoud and Arwa Abu-AlRukab Computer Science
More informationUsing Entropy and 2-D Correlation Coefficient as Measuring Indices for Impulsive Noise Reduction Techniques
Using Entropy and 2-D Correlation Coefficient as Measuring Indices for Impulsive Noise Reduction Techniques Zayed M. Ramadan Department of Electronics and Communications Engineering, Faculty of Engineering,
More informationResearch Article Improved Adaptive LSB Steganography Based on Chaos and Genetic Algorithm
Hindawi Publishing Corporation EURASIP Journal on Advances in Signal Processing Volume 2010, Article ID 876946, 6 pages doi:10.1155/2010/876946 Research Article Improved Adaptive LSB Steganography Based
More informationHalf-Pel Accurate Motion-Compensated Orthogonal Video Transforms
Flierl and Girod: Half-Pel Accurate Motion-Compensated Orthogonal Video Transforms, IEEE DCC, Mar. 007. Half-Pel Accurate Motion-Compensated Orthogonal Video Transforms Markus Flierl and Bernd Girod Max
More informationA Vision-Based Masking Model for Spread-Spectrum Image Watermarking
A Vision-Based Masking Model for Spread-Spectrum Image Watermarking Martin Kutter and Stefan Winkler Signal Processing Laboratory Swiss Federal Institute of Technology 5 Lausanne, Switzerland http://ltswww.epfl.ch/
More informationShape Classification Using Zernike Moments
Shape Classification Using Zernike Moments Michael Vorobyov icamp at University of California Irvine August 5, 20 Abstract Zernike moments have mathematical properties, make them ideal image features to
More informationAnalysis of Hu's Moment Invariants on Image Scaling and Rotation
Edith Cowan University Research Online ECU Publications Pre. 11 1 Analysis of Hu's Moent Invariants on Iage Scaling and Rotation Zhihu Huang Edith Cowan University Jinsong Leng Edith Cowan University 1.119/ICCET.1.548554
More informationLogo Recognition System Using Angular Radial Transform Descriptors
Journal of Computer Science 7 (9): 1416-1422, 2011 ISSN 1549-3636 2011 Science Publications Logo Recognition System Using Angular Radial Transform Descriptors Omar Mohammed Wahdan, Khairuddin Omar and
More informationSCALABLE AUDIO CODING USING WATERMARKING
SCALABLE AUDIO CODING USING WATERMARKING Mahmood Movassagh Peter Kabal Department of Electrical and Computer Engineering McGill University, Montreal, Canada Email: {mahmood.movassagh@mail.mcgill.ca, peter.kabal@mcgill.ca}
More informationWitsenhausen s counterexample and its links with multimedia security problems
Witsenhausen s counterexample and its links with multimedia security problems Pedro Comesaña-Alfaro Fernando Pérez-González Chaouki T. Abdallah IWDW 2011 Atlantic City, New Jersey Outline Introduction
More informationChapter 3. Load and Stress Analysis
Chapter 3 Load and Stress Analysis 2 Shear Force and Bending Moments in Beams Internal shear force V & bending moment M must ensure equilibrium Fig. 3 2 Sign Conventions for Bending and Shear Fig. 3 3
More informationMETRIC. Ming-Te WU and Shiunn-Jang CHERN
REDUCTION of ARTIFACT EFFECT by UING MULTI-CALE UBBAND FILTER BAED on ENERGY METRIC Ming-Te WU and hiunn-jang CHERN Department of Electrical Engineering, National un Yat-en University, Kaohsiung, 80 Taiwan.
More informationA Recognition System for 3D Embossed Digits on Non-Smooth Metallic Surface
2011 International Conference on elecommunication echnology and Applications Proc.of CSI vol.5 (2011) (2011) IACSI Press, Singapore A Recognition System for 3D Embossed Digits on Non-Smooth Metallic Surface
More informationWatermark Extraction Optimization Using PSO Algorithm
Research Journal of Applied Sciences, Engineering and Technology 5(12): 3312-3319, 2013 ISS: 2040-7459; e-iss: 2040-7467 Maxwell Scientific Organization, 2013 Submitted: June 09, 2012 Accepted: July 18,
More informationROC Curves for Steganalysts
ROC Curves for Steganalysts Andreas Westfeld Technische Universität Dresden Institut für Systemarchitektur 01062 Dresden mailto:westfeld@inf.tu-dresden.de 1 Introduction There are different approaches
More informationAudio Zero-Watermarking Based on Discrete Hartley Transform and Non-Negative Matrix Factorization
IJCSNS International Journal of Computer Science and Networ Security, VOL7 No8, August 207 Audio Zero-Watermaring Based on Discrete Hartley Transform and Non-Negative Matrix Factorization Pranab Kumar
More informationGaussian-Shaped Circularly-Symmetric 2D Filter Banks
Gaussian-Shaped Circularly-Symmetric D Filter Bans ADU MATEI Faculty of Electronics and Telecommunications Technical University of Iasi Bldv. Carol I no.11, Iasi 756 OMAIA Abstract: - In this paper we
More informationLecture 8: Interest Point Detection. Saad J Bedros
#1 Lecture 8: Interest Point Detection Saad J Bedros sbedros@umn.edu Review of Edge Detectors #2 Today s Lecture Interest Points Detection What do we mean with Interest Point Detection in an Image Goal:
More informationCryptanalysis of a Multistage Encryption System
Cryptanalysis of a Multistage Encryption System Chengqing Li, Xinxiao Li, Shujun Li and Guanrong Chen Department of Mathematics, Zhejiang University, Hangzhou, Zhejiang 310027, China Software Engineering
More informationLecture 2: Introduction to Audio, Video & Image Coding Techniques (I) -- Fundaments
Lecture 2: Introduction to Audio, Video & Image Coding Techniques (I) -- Fundaments Dr. Jian Zhang Conjoint Associate Professor NICTA & CSE UNSW COMP9519 Multimedia Systems S2 2006 jzhang@cse.unsw.edu.au
More informationPractical Watermarking scheme based on Wide Spread Spectrum and Game Theory
Practical Watermarking scheme based on Wide Spread Spectrum and Game Theory Stéphane Pateux,Gaëtan Le Guelvouit IRISA / INRIA-Rennes Campus de Beaulieu 35042 Rennes Cedex, FRANCE. Abstract In this paper,
More informationConverting DCT Coefficients to H.264/AVC
MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Converting DCT Coefficients to H.264/AVC Jun Xin, Anthony Vetro, Huifang Sun TR2004-058 June 2004 Abstract Many video coding schemes, including
More information