Invariability of Remainder Based Reversible Watermarking
|
|
- Magnus Ryan
- 5 years ago
- Views:
Transcription
1 Joural of Network Itelligece c 16 ISSN (Olie) Taiwa Ubiquitous Iformatio Volume 1, Number 1, February 16 Ivariability of Remaider Based Reversible Watermarkig Shao-Wei Weg School of Iformatio Egieerig Guagdog Uiversity of Techology wswweiwei@126.com Jeg-Shyag Pa Iovative Iformatio Idustrial Research Ceter Shezhe Graduate School Harbi Istitute of Techology jegshyagpa@gmail.com Jie-Hag Deg School of Computers Guagdog Uiversity of Techology Received February 15; revised December 15 Abstract. A ovel ad simple iteger trasform is proposed i this letter. This trasform ca also be cosidered a predictio process, i which the mea value of a -sized block is used to predict each pixel i this block so that two bits are embedded ito each of ( 1) pixels. By employig the ivariability of the remider produced by the mea value divided by a give embeddig parameter, we ca achieve reversibility. The embeddig distortio ca be greatly cotrolled by embeddig 2( 1) bits ito blocks with strog itra-block correlatio while keepig the others ualtered. Experimetal results reveal the proposed algorithm is effective. Keywords: Ivariability of remaider, Reversible watermarkig. 1. Itroductio. Reversible watermarkig based o differece expasio was proposed by Tia [1]. The differeces betwee two pixels were expaded to carry watermark iformatio if either overflow or uderflow occurred. Alattar [2] geeralized the DE techique by takig a set cotaiig multiple pixels rather tha a pair. I Thodi s work [3], histogram shiftig was icorporated ito Tia s method to produce a ew algorithm called Alg. D2 with a overflow map. Weg et al. proposed a iteger trasform based o ivariability of the sum of pixel pairs []. I Wag et al. s method [5], a geeralized iteger trasform ad a payload-depedet locatio map were costructed to exted the DE techique to the pixel blocks of arbitrary legth. Whe the embeddig rule of Alattar s method is reformulated as a iteger trasform, this trasform ca be deemed to cotai a additioal term ad a predictio process which uses the mea value of a block to predict each pixel i this block. This additioal term is ecessarily a guaratee of ivariability of the mea value before ad after embeddig. However, its existece will result i great decrease of PSNR (peak sigal to oise ratio) value i Alattar s method. This is also the reaso that the performace of Alattar s method is ot capable of exceedig that of Wag et al. s. 16
2 Ivariability of Remaider Based Reversible Watermarkig 17 To solve this problem above, a ovel ad simple iteger trasform that ca remove the redudat term is proposed i this letter. Therefore, this iteger trasform ca be cosidered a pure predictio process, i which the mea value of a -sized block is used to predict each pixel i this block so that two bits are embedded ito each of ( 1) pixels. By employig the ivariability of the remider of the mea value divided by a give embeddig parameter, we ca achieve reversibility. Sice the proposed iteger trasform ca embed 2( 1) (rather tha (-1)) bits ito a -sized block which itroduces less distortio, we ca obtai a better performace tha Wag et al. at lager embeddig rates. 2. The related methods. The iteger trasform defied i Eq. (3) of the paper [5] (proposed by Wag et al.) is listed i Eq. (1). y 1 = 2x 1 a(x) y 2 = 2x 2 2f(a(x)) + w 1 = 2x 2 (a(x) + LSB(a(x))) + w 1 y = 2x 2f(a(x)) + w 1 = 2x (a(x) + LSB(a(x))) + w 1 where x = (x 1,, x ) Z ad y = (y 1,, y ) Z respectively represet a -sized pixel array ad its correspodig watermarked oe, x = 1 { x i, a(x) = x if x x < 0.5, f(x) = x otherwise x, ad w 2 i (i {0, 1,, 1}) deotes 1-bit watermark ad w i {0, 1}, ad LSB( ) represets the least sigificat bit (LSB). a(x) is actually the rouded value of x. Eq. (1) is rearraged as follows y 1 = a(x) + 2(x 1 a(x)) y 2 = a(x) + 2(x 2 a(x)) + w 1 LSB(a(x)) y = a(x) + 2(x a(x)) + w 1 LSB(a(x)) The iteger trasform defied i the paper [2] (proposed by Alattar) ca be summarized i Eq. (3). y 1 = x 2(x2 x 1 )+w (x x 1 )+w 1 = x 2 x i + 1 w i 2x 1 (3) y 2 = y (x 2 x 1 ) + w 1 y = y (x x 1 ) + w 1 Suppose k 2 = x i x, ad the k 2 {0,, 1}. Substitute x i ito Eq. (3), we have y 1 = x + 2(x 1 x ) 2k 2+ 1 y 2 = x + 2(x 2 x ) + w 1 2k 2+ 1 y = x + 2(x x ) + w 1 2k 2+ 1 Comparig Eq. (2) with Eq. (), we see that the iteger trasform proposed by Alattar has its ow disadvatage: it itroduces the higher distortio tha the trasform proposed (1) (2) ()
3 18 S. W. Weg, J. S. Pa, ad J. H. Deg Capacity vs. Distortio Compariso o Lea Prop. Alg. sigle embeddig Wag s Alg. sigle embeddig Alattar s Alg. double embeddig 55 Capacity vs. Distortio Compariso o Baboo Prop. Alg. sigle embeddig Wag s Alg., sigle embeddig Alattar s Alg., double embeddig Quality Measuremet PSNR (db) Quality Measuremet PSNR (db) (a) Lea (b) Baboo Capacity vs. Distortio Compariso o Plae Prop. Alg. sigle embeddig Wag s Alg., sigle embeddig Alattar s Alg., double embeddig Quality Measuremet PSNR (db) (c) Plae Figure 1. Performace compariso of our method with the other two methods. by Wag et al.. Alattar s method ca be deemed to cotai a additioal term ad a process which uses the mea value of a block to predict each pixel i the block. Specially, for each y i (i {0, 1,, }) i Eq. (), it has a term, i.e., 2k Sice k 2 {0, 1,, 1} ad w i {0, 1}, 0 2k ( 1) = 3 1 = 2, i.e., 2k 2+ 1 {0, 1, 2}. For istace, whe k 2 reaches its maximum value (i.e., 1), if all to-be-embedded bits are set to 1, the this term will reach its maximum value (amely 2). Similarly, Wag et al. s method cotais a term, i.e., LSB(a(x)) {0, 1} except the process which uses a(x) to predict each pixel i the block. Therefore, relative to this term i Wag et al. s method, the existece of the oe i Alattar s method will result i greater reductio of PSNR value. Abudat experimets also demostrate that Wag et al. s method has superior performace to Alattar s. For the purpose of icreasig algorithm performace, we propose a ovel ad simple iteger trasform that ca remove the redudat term. Therefore, this iteger trasform ca be cosidered a pure predictio process, i which the mea value of a -sized block is used to predict each pixel i this block so that two bits are embedded ito each of ( 1) pixels. By employig the ivariability of the remider of the mea value divided by a give embeddig parameter, we ca achieve reversibility. Sice the proposed iteger trasform ca embed 2( 1) (rather tha (-1)) bits ito a -sized block which itroduces less distortio, we ca achieve a better performace tha Wag et al. at lager embeddig rates. 3. The proposed method A iteger trasform. I the proposed method, a grayscale image is partitioed ito o-overlappig m m-sized sub-blocks, where = m m. A iteger trasform exploitig ivariability of the remaider produced by dividig the mea value by a give
4 embeddig parameter is proposed below Ivariability of Remaider Based Reversible Watermarkig 19 y 1 = x + (x 1 x ) + e 1 = x 1 3 x + e 1 y 1 = x + (x 1 x ) + e 1 = x 1 3 x + e 1 y = x + (x x ) = x 3 x where e i represets 2-bit watermark for each i {1,, 1}, amely e i {0, 1, 2, 3}, the umber idicates the give embeddig parameter. This iteger trasform ca also be cosidered as a predictio process, i which the mea value is used to predict each pixel i a -sized block so that two bits are embedded ito each of ( 1) pixels (see Eq. (5)). I this trasform, mod( x, ) remais ualtered before ad after embeddig, where the modulo fuctio mod(a, b) returs the remaider of a divided by b, which is expressed by the followig formula: mod(a, b) = a b a. This ivariability is the sigle b most importat elemet to retrieve the origial pixel values. Next, we will itroduce i detail how to correctly extract watermark bits. Firstly, subtractig y from y i for each i {1,, 1} is to obtai the differece values as follows y i y = (x i x ) + e i (6) Sice e i is a positive iteger smaller tha or equal to 3, i.e., e i {0, 1, 2, 3}, ad meawhile, (x i x ) is a multiple of, the remaider will remai ivariat whe e i ad (x i x ) + e i are divided by, respectively. That is to say, mod(y i y, ) = mod(e i, ) = e i. Cosequetly, watermark bits e i ca be correctly extracted. We subtract the correctly extracted bits e i from y i for each i {1,, 1} so as to be capable of correctly retrievig the origial block x. The differece value y i betwee y i ad e i is calculated via the followig equatio Eq.(7) (5) y i = x i 3 x (7) For the coveiece of descriptio, we use y = (y 1,, y 1, y ) represets the pixelvalue-array via Eq. (7). Suppose x = k 1 + k 2, where k 1 R ad k 2 {0, 1, 2, 3}. Notice that, mod( x, ) = k 2. Substitute x ito Eq. (7) ad y, we have y i = (x i 3k 1 ) 3k 2 = x i 3k 2 y = (x 3k 1 ) 3k 2 = x 3k 2 (8) We use x i to replace (x i 3k 1 ) so as to further simplify Eq. (8). We will prove that mod(x i 3k 2, ) is idetical to k 2 whe x i is set as some iteger usig the followig equatio mod(x i 3k 2, ) = mod( 3k 2, ) = mod(k 2 3k 2, ) = mod(k 2, ) = k 2 (9) I a word, mod(x i 3k 2 ) = mod( x, ). O the decodig side, after we ca correctly get the remaider of x divided by, i.e., k 2, each pixel value of y is subtracted by k 2 to get the differece value i accordig to the followig equatio i = y i k 2 = x i k 2 = x i 3 x k 2 (10)
5 S. W. Weg, J. S. Pa, ad J. H. Deg After both sides of Eq.(10) is divided by, y i = x i 3 x +k 2 for each i {1,, }. We have It yields that 1 i = 1 i = x i 3 x + k 2 x i 3 x +k 2 = x k 2 x = 1 = k 1. So (11) i + k 2 (12) Substitute x via Eq. (12) ito Eq. (5), we ca correctly retrieve x. Ad the, x is substituted ito Eq. (7) so as to retrieve x i for each i {0, 1,, 1} Data Embeddig. To prevet the overflow/uderflow, each watermarked pixel value should be cotaied i [0, 5]. We defie { } x A : 0 xi 3 x 2(1 i 1), D = 0 x 3 x 5 where A = {x = (x 1,, x ) Z : 0 x i 5}. For a pixel-value array x A, it is classified ito oe of two sets: E t = {x D : v(x) T h } ad O t = {x A E t : v(x) > T h }, where T h is a give threshold, v(x) represets the variatio of a block, i.e., v(x) = 1 (x i x) 2, E t ad O t are used to deote the sets of pixels which are altered so as to carry 2( 1) bits or kept ualtered, respectively. A locatio map is geerated i which the locatios of the pixel arrays belogig to E t are marked by 1 while the others are marked by 0. The locatio map is compressed losslessly by a arithmetic ecoder ad the resultig bitstream is deoted by L. L S is the bit legth of L. For each x E t, it ca carry 2( 1) watermark bits, so the maximum hidig capacity is C ap = 2( 1) E t L S bits, where represets the cardiality of a set. Namely, the size of the payload equals C ap. For each x O t, the it is kept ualtered, i.e., y = x. For each x, if it belogs to E t, the 2( 1) bits are embedded ito it accordig to Eq. (5). After the first L S pixel arrays have bee processed (meaig either altered to carry 2( 1) bits or kept ualtered), the LSBs of the first L S pixels of their correspodig watermarked pixel arrays y are firstly appeded to the payload P, ad the replaced by the compressed locatio map L. After all the sub-blocks are processed, a ew marked image I w is obtaied Data Extractio ad Image Restoratio. The LSBs of the pixels i I w are collected ito a bitstream B accordig to the same order as i embeddig. B is decompressed by a arithmetic decoder to retrieve the locatio map. For each watermarked pixel array y = (y 1,, y ), if its locatio is associated with 0 i the locatio map, the it is igored, i.e., x = y. Otherwise, the watermark ca be extracted usig the followig formula: e i = mod(y i y, ) for each i {0,, 1}. Ad meawhile, the origial mea value is retrieved by Eq. (12). Fially, the origial image is recovered.. Experimetal results. The capacity vs. distortio comparisos amog the proposed method, Wag et al. s, Alattar s are show i Figs. 1 ad 2. Three stadard sized grayscale images are used i our experimets: Lea, Baboo ad Plae. Suppose the thresholds correspodig to sigle embeddig ad double embeddig are T 1 ad T 2,
6 Ivariability of Remaider Based Reversible Watermarkig 21 Capacity vs. Distortio Compariso o Lea Prop. Alg. sigle embeddig Prop. Alg. double embeddig Wag s Alg. sigle embeddig Wag s Alg. double embeddig Capacity vs. Distortio Compariso o Baboo Prop. Alg. sigle embeddig Prop. Alg. double embeddig Wag s Alg. sigle embeddig Wag s Alg. double embeddig Quality Measuremet PSNR (db) Quality Measuremet PSNR (db) (a) Lea (b) Baboo Quality Measuremet PSNR (db) Capacity vs. Distortio Compariso o Plae Prop. Alg. sigle embeddig Prop. Alg. double embeddig Wag s Alg. sigle embeddig Wag s Alg. double embeddig (c) Plae Figure 2. Performace compariso of our method with Wag et al.s method, for sigle ad double embeddig. respectively. Suppose also that T 1 has a iitial value which is set to a value capable of esurig the embeddig rate larger tha 0. The, T 1 is gradually icreased from this iitial value util the give embeddig rate is achieved. Oce T 1 is determied, its correspodig PSNR value uder the give embeddig rate is obtaied experimetally. These obtaied umerical results o three test images are plotted i Fig. 1, respectively. For double embeddig, T 2 is set to half of T 1. Whe T 1 is gradually icreased from the iitial value, T 2 is also accordigly raised. Similarly, oce T 1 ad T 2 is determied, each correspodig data pair cotaiig a give embeddig rate ad its PSNR value is plotted i Fig. 2 o three test images, respectively. From Fig. 1, it ca be see that the two curves correspodig to the proposed method ad Wag et al. s are very close whe the embeddig rate is low. Whe the embeddig rate is icreased, the proposed method outperforms Wag et al. s for Lea ad Plae. Moreover, the embeddig capacity i Wag et al. s method is upper bouded by (1 1 ) bpp for a sigle embeddig process. However, we ca get a bpp close to 2(1 1 ) without multiple embeddig. As illustrated i Fig. 1, we get a sigificat performace icrease relative to Alattar s. Sice the correlatios betwee the eighborig pixels i Baboo ot as high as i the others so that little improvemet was made by the proposed method. So, the proposed method has almost the same performace as Wag et al. s, while provide a better performace tha Alatter s (see Figs 1 ad 2). Double embeddig is the process of embeddig data ito a always embedded image. We also perform double embeddig for three test images. As show i 2, we ca achieve the same performace as Wag et al. s whe the embeddig rate is smaller tha 1.6 bpp for Lea or 1. bpp for Plae. Our superiority becomes more obvious whe the embeddig rates gradually approach to 2.0 bpp, especially for Lea ad Plae. Whe the threshold
7 22 S. W. Weg, J. S. Pa, ad J. H. Deg value is set to a large iteger, ad correspodigly, the umber of pixel arrays used for embeddig is greatly icreases. Therefore, we ca obtai higher embeddig rates tha Wag et al. s. Sice double embeddig that embeds more data ito blocks with high correlatio will lead to lower distortio, double embeddig may be better tha sigle embeddig. 5. Coclusios. A ovel iteger trasform is proposed i this letter. This trasform ca also be cosidered a predictio process, i which the mea value of a -sized block is used to predict each pixel i this block so that two bits are embedded ito each of the ( 1) pixels. Experimetal results reveal the proposed algorithm is effective. Ackowledgmet. This work was supported i part by Natioal NSF of Chia (No , No ), New Star of Pearl River o Sciece ad Techology of Guagzhou (No. 1J20085). REFERENCES [1] J. Tia, Reversible data embeddig usig a differece expasio, IEEE Tras. Circuits Syst. Video Techol., vol. 13, o. 8, pp , 03. [2] A. M. Alattar, Reversible watermark usig the differece expasio of a geeralized iteger trasform, IEEE Tras. Image Process., vol. 13, o. 8, pp , 0. [3] D. M. Thodi ad J. J. Rodrguez, Expasio embeddig techiques for reversible watermarkig, IEEE Tras. Image Process., vol. 16, o. 3, pp , 07. [] S. W. Weg, Y. Zhao, J. S. Pa, ad R. R. Ni, Reversible watermarkig based o ivariability ad adjustmet o pixel pairs, IEEE Sigal Process. Lett., vol., o., pp , 08. [5] X. Wag, X. L. Li, B. Yag, ad Z. M. Guo, Efficiet geeralized iteger trasform for reversible watermarkig, IEEE Sigal Process. Lett., vol. 17, o. 6, pp , 10.
Encoding-Assisted Temporal Direct Mode Decision for B Pictures in H.264/AVC
Ecodig-Assisted Temporal Direct Mode Decisio for B Pictures i H.64/AVC Ya-Neg Fag ad Yiyi Li Hui-Jae Hsieh Departmet of Commuicatio Egieerig Departmet of Iformatio Maagemet Natioal Cetral Uiversity, Taiwa
More informationThe multiplicative structure of finite field and a construction of LRC
IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio
More informationModule 5 EMBEDDED WAVELET CODING. Version 2 ECE IIT, Kharagpur
Module 5 EMBEDDED WAVELET CODING Versio ECE IIT, Kharagpur Lesso 4 SPIHT algorithm Versio ECE IIT, Kharagpur Istructioal Objectives At the ed of this lesso, the studets should be able to:. State the limitatios
More informationInjections, Surjections, and the Pigeonhole Principle
Ijectios, Surjectios, ad the Pigeohole Priciple 1 (10 poits Here we will come up with a sloppy boud o the umber of parethesisestigs (a (5 poits Describe a ijectio from the set of possible ways to est pairs
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationSOME TRIBONACCI IDENTITIES
Mathematics Today Vol.7(Dec-011) 1-9 ISSN 0976-38 Abstract: SOME TRIBONACCI IDENTITIES Shah Devbhadra V. Sir P.T.Sarvajaik College of Sciece, Athwalies, Surat 395001. e-mail : drdvshah@yahoo.com The sequece
More informationA proposed discrete distribution for the statistical modeling of
It. Statistical Ist.: Proc. 58th World Statistical Cogress, 0, Dubli (Sessio CPS047) p.5059 A proposed discrete distributio for the statistical modelig of Likert data Kidd, Marti Cetre for Statistical
More informationINFINITE SEQUENCES AND SERIES
11 INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES 11.4 The Compariso Tests I this sectio, we will lear: How to fid the value of a series by comparig it with a kow series. COMPARISON TESTS
More informationDiscrete-Time Systems, LTI Systems, and Discrete-Time Convolution
EEL5: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we begi our mathematical treatmet of discrete-time s. As show i Figure, a discrete-time operates or trasforms some iput sequece x [
More informationA Block Cipher Using Linear Congruences
Joural of Computer Sciece 3 (7): 556-560, 2007 ISSN 1549-3636 2007 Sciece Publicatios A Block Cipher Usig Liear Cogrueces 1 V.U.K. Sastry ad 2 V. Jaaki 1 Academic Affairs, Sreeidhi Istitute of Sciece &
More informationChimica Inorganica 3
himica Iorgaica Irreducible Represetatios ad haracter Tables Rather tha usig geometrical operatios, it is ofte much more coveiet to employ a ew set of group elemets which are matrices ad to make the rule
More informationDiscrete Orthogonal Moment Features Using Chebyshev Polynomials
Discrete Orthogoal Momet Features Usig Chebyshev Polyomials R. Mukuda, 1 S.H.Og ad P.A. Lee 3 1 Faculty of Iformatio Sciece ad Techology, Multimedia Uiversity 75450 Malacca, Malaysia. Istitute of Mathematical
More informationOn Random Line Segments in the Unit Square
O Radom Lie Segmets i the Uit Square Thomas A. Courtade Departmet of Electrical Egieerig Uiversity of Califoria Los Ageles, Califoria 90095 Email: tacourta@ee.ucla.edu I. INTRODUCTION Let Q = [0, 1] [0,
More informationNUMERICAL METHOD FOR SINGULARLY PERTURBED DELAY PARABOLIC PARTIAL DIFFERENTIAL EQUATIONS
THERMAL SCIENCE, Year 07, Vol., No. 4, pp. 595-599 595 NUMERICAL METHOD FOR SINGULARLY PERTURBED DELAY PARABOLIC PARTIAL DIFFERENTIAL EQUATIONS by Yula WANG *, Da TIAN, ad Zhiyua LI Departmet of Mathematics,
More informationFundamentals. Relative data redundancy of the set. C.E., NCU, Taiwan Angela Chih-Wei Tang,
Image Compressio Agela Chih-Wei Tag ( 唐之瑋 ) Departmet of Commuicatio Egieerig Natioal Cetral Uiversity JhogLi, Taiwa 2012 Sprig Fudametals Compressio ratio C R / 2, 1 : origial, 2 1 : compressed Relative
More informationCHAPTER 10 INFINITE SEQUENCES AND SERIES
CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece
More informationThe Local Harmonious Chromatic Problem
The 7th Workshop o Combiatorial Mathematics ad Computatio Theory The Local Harmoious Chromatic Problem Yue Li Wag 1,, Tsog Wuu Li ad Li Yua Wag 1 Departmet of Iformatio Maagemet, Natioal Taiwa Uiversity
More informationUsing the IML Procedure to Examine the Efficacy of a New Control Charting Technique
Paper 2894-2018 Usig the IML Procedure to Examie the Efficacy of a New Cotrol Chartig Techique Austi Brow, M.S., Uiversity of Norther Colorado; Bryce Whitehead, M.S., Uiversity of Norther Colorado ABSTRACT
More informationSeed and Sieve of Odd Composite Numbers with Applications in Factorization of Integers
IOSR Joural of Mathematics (IOSR-JM) e-issn: 78-578, p-issn: 319-75X. Volume 1, Issue 5 Ver. VIII (Sep. - Oct.01), PP 01-07 www.iosrjourals.org Seed ad Sieve of Odd Composite Numbers with Applicatios i
More informationRun-length & Entropy Coding. Redundancy Removal. Sampling. Quantization. Perform inverse operations at the receiver EEE
Geeral e Image Coder Structure Motio Video (s 1,s 2,t) or (s 1,s 2 ) Natural Image Samplig A form of data compressio; usually lossless, but ca be lossy Redudacy Removal Lossless compressio: predictive
More informationProduct measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.
Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the
More informationThe z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j
The -Trasform 7. Itroductio Geeralie the complex siusoidal represetatio offered by DTFT to a represetatio of complex expoetial sigals. Obtai more geeral characteristics for discrete-time LTI systems. 7.
More informationThe standard deviation of the mean
Physics 6C Fall 20 The stadard deviatio of the mea These otes provide some clarificatio o the distictio betwee the stadard deviatio ad the stadard deviatio of the mea.. The sample mea ad variace Cosider
More informationDISTRIBUTION LAW Okunev I.V.
1 DISTRIBUTION LAW Okuev I.V. Distributio law belogs to a umber of the most complicated theoretical laws of mathematics. But it is also a very importat practical law. Nothig ca help uderstad complicated
More informationLecture 2 Clustering Part II
COMS 4995: Usupervised Learig (Summer 8) May 24, 208 Lecture 2 Clusterig Part II Istructor: Nakul Verma Scribes: Jie Li, Yadi Rozov Today, we will be talkig about the hardess results for k-meas. More specifically,
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationarxiv: v1 [math.nt] 10 Dec 2014
A DIGITAL BINOMIAL THEOREM HIEU D. NGUYEN arxiv:42.38v [math.nt] 0 Dec 204 Abstract. We preset a triagle of coectios betwee the Sierpisi triagle, the sum-of-digits fuctio, ad the Biomial Theorem via a
More informationLecture 14. Discrete Fourier Transforms (cont d) The Discrete Cosine Transform (DCT) (cont d)
Lecture 14 Discrete Fourier Trasforms (cot d) The Discrete Cosie Trasform (DCT) (cot d) I the previous lecture, we arrived at the followig formula for the discrete cosie trasform (DCT) of a -dimesioal
More informationAn Improved Proportionate Normalized Least Mean Square Algorithm with Orthogonal Correction Factors for Echo Cancellation
202 Iteratioal Coferece o Electroics Egieerig ad Iformatics (ICEEI 202) IPCSI vol. 49 (202) (202) IACSI Press, Sigapore DOI: 0.7763/IPCSI.202.V49.33 A Improved Proportioate Normalized Least Mea Square
More informationThe DOA Estimation of Multiple Signals based on Weighting MUSIC Algorithm
, pp.10-106 http://dx.doi.org/10.1457/astl.016.137.19 The DOA Estimatio of ultiple Sigals based o Weightig USIC Algorithm Chagga Shu a, Yumi Liu State Key Laboratory of IPOC, Beijig Uiversity of Posts
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationChannel coding, linear block codes, Hamming and cyclic codes Lecture - 8
Digital Commuicatio Chael codig, liear block codes, Hammig ad cyclic codes Lecture - 8 Ir. Muhamad Asial, MSc., PhD Ceter for Iformatio ad Commuicatio Egieerig Research (CICER) Electrical Egieerig Departmet
More informationAlgorithm of Superposition of Boolean Functions Given with Truth Vectors
IJCSI Iteratioal Joural of Computer Sciece Issues, Vol 9, Issue 4, No, July ISSN (Olie: 694-84 wwwijcsiorg 9 Algorithm of Superpositio of Boolea Fuctios Give with Truth Vectors Aatoly Plotikov, Aleader
More informationLecture 11: Pseudorandom functions
COM S 6830 Cryptography Oct 1, 2009 Istructor: Rafael Pass 1 Recap Lecture 11: Pseudoradom fuctios Scribe: Stefao Ermo Defiitio 1 (Ge, Ec, Dec) is a sigle message secure ecryptio scheme if for all uppt
More informationChapter 2 Descriptive Statistics
Chapter 2 Descriptive Statistics Statistics Most commoly, statistics refers to umerical data. Statistics may also refer to the process of collectig, orgaizig, presetig, aalyzig ad iterpretig umerical data
More informationPROPERTIES OF AN EULER SQUARE
PROPERTIES OF N EULER SQURE bout 0 the mathematicia Leoard Euler discussed the properties a x array of letters or itegers ow kow as a Euler or Graeco-Lati Square Such squares have the property that every
More informationSection 5.1 The Basics of Counting
1 Sectio 5.1 The Basics of Coutig Combiatorics, the study of arragemets of objects, is a importat part of discrete mathematics. I this chapter, we will lear basic techiques of coutig which has a lot of
More informationChapter 7 z-transform
Chapter 7 -Trasform Itroductio Trasform Uilateral Trasform Properties Uilateral Trasform Iversio of Uilateral Trasform Determiig the Frequecy Respose from Poles ad Zeros Itroductio Role i Discrete-Time
More informationRecursive Algorithm for Generating Partitions of an Integer. 1 Preliminary
Recursive Algorithm for Geeratig Partitios of a Iteger Sug-Hyuk Cha Computer Sciece Departmet, Pace Uiversity 1 Pace Plaza, New York, NY 10038 USA scha@pace.edu Abstract. This article first reviews the
More informationRank Modulation with Multiplicity
Rak Modulatio with Multiplicity Axiao (Adrew) Jiag Computer Sciece ad Eg. Dept. Texas A&M Uiversity College Statio, TX 778 ajiag@cse.tamu.edu Abstract Rak modulatio is a scheme that uses the relative order
More informationChapter 13, Part A Analysis of Variance and Experimental Design
Slides Prepared by JOHN S. LOUCKS St. Edward s Uiversity Slide 1 Chapter 13, Part A Aalysis of Variace ad Eperimetal Desig Itroductio to Aalysis of Variace Aalysis of Variace: Testig for the Equality of
More informationAN OPEN-PLUS-CLOSED-LOOP APPROACH TO SYNCHRONIZATION OF CHAOTIC AND HYPERCHAOTIC MAPS
http://www.paper.edu.c Iteratioal Joural of Bifurcatio ad Chaos, Vol. 1, No. 5 () 119 15 c World Scietific Publishig Compay AN OPEN-PLUS-CLOSED-LOOP APPROACH TO SYNCHRONIZATION OF CHAOTIC AND HYPERCHAOTIC
More information[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms.
[ 11 ] 1 1.1 Polyomial Fuctios 1 Algebra Ay fuctio f ( x) ax a1x... a1x a0 is a polyomial fuctio if ai ( i 0,1,,,..., ) is a costat which belogs to the set of real umbers ad the idices,, 1,...,1 are atural
More informationThe Choquet Integral with Respect to Fuzzy-Valued Set Functions
The Choquet Itegral with Respect to Fuzzy-Valued Set Fuctios Weiwei Zhag Abstract The Choquet itegral with respect to real-valued oadditive set fuctios, such as siged efficiecy measures, has bee used i
More informationCommutativity in Permutation Groups
Commutativity i Permutatio Groups Richard Wito, PhD Abstract I the group Sym(S) of permutatios o a oempty set S, fixed poits ad trasiet poits are defied Prelimiary results o fixed ad trasiet poits are
More informationLecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =
COMPSCI 230: Discrete Mathematics for Computer Sciece April 8, 2019 Lecturer: Debmalya Paigrahi Lecture 22 Scribe: Kevi Su 1 Overview I this lecture, we begi studyig the fudametals of coutig discrete objects.
More informationSequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet
More informationComplex Algorithms for Lattice Adaptive IIR Notch Filter
4th Iteratioal Coferece o Sigal Processig Systems (ICSPS ) IPCSIT vol. 58 () () IACSIT Press, Sigapore DOI:.7763/IPCSIT..V58. Complex Algorithms for Lattice Adaptive IIR Notch Filter Hog Liag +, Nig Jia
More informationAn Alternative Scaling Factor In Broyden s Class Methods for Unconstrained Optimization
Joural of Mathematics ad Statistics 6 (): 63-67, 00 ISSN 549-3644 00 Sciece Publicatios A Alterative Scalig Factor I Broyde s Class Methods for Ucostraied Optimizatio Muhammad Fauzi bi Embog, Mustafa bi
More informationSession 5. (1) Principal component analysis and Karhunen-Loève transformation
200 Autum semester Patter Iformatio Processig Topic 2 Image compressio by orthogoal trasformatio Sessio 5 () Pricipal compoet aalysis ad Karhue-Loève trasformatio Topic 2 of this course explais the image
More informationComparison Study of Series Approximation. and Convergence between Chebyshev. and Legendre Series
Applied Mathematical Scieces, Vol. 7, 03, o. 6, 3-337 HIKARI Ltd, www.m-hikari.com http://d.doi.org/0.988/ams.03.3430 Compariso Study of Series Approimatio ad Covergece betwee Chebyshev ad Legedre Series
More informationCHAPTER 4 BIVARIATE DISTRIBUTION EXTENSION
CHAPTER 4 BIVARIATE DISTRIBUTION EXTENSION 4. Itroductio Numerous bivariate discrete distributios have bee defied ad studied (see Mardia, 97 ad Kocherlakota ad Kocherlakota, 99) based o various methods
More informationUC Berkeley CS 170: Efficient Algorithms and Intractable Problems Handout 17 Lecturer: David Wagner April 3, Notes 17 for CS 170
UC Berkeley CS 170: Efficiet Algorithms ad Itractable Problems Hadout 17 Lecturer: David Wager April 3, 2003 Notes 17 for CS 170 1 The Lempel-Ziv algorithm There is a sese i which the Huffma codig was
More informationNumber Representation
Number Represetatio 1 Number System :: The Basics We are accustomed to usig the so-called decimal umber system Te digits :: 0,1,2,3,4,5,6,7,8,9 Every digit positio has a weight which is a power of 10 Base
More information7. Modern Techniques. Data Encryption Standard (DES)
7. Moder Techiques. Data Ecryptio Stadard (DES) The objective of this chapter is to illustrate the priciples of moder covetioal ecryptio. For this purpose, we focus o the most widely used covetioal ecryptio
More informationStatistical Analysis on Uncertainty for Autocorrelated Measurements and its Applications to Key Comparisons
Statistical Aalysis o Ucertaity for Autocorrelated Measuremets ad its Applicatios to Key Comparisos Nie Fa Zhag Natioal Istitute of Stadards ad Techology Gaithersburg, MD 0899, USA Outlies. Itroductio.
More informationStudy on Coal Consumption Curve Fitting of the Thermal Power Based on Genetic Algorithm
Joural of ad Eergy Egieerig, 05, 3, 43-437 Published Olie April 05 i SciRes. http://www.scirp.org/joural/jpee http://dx.doi.org/0.436/jpee.05.34058 Study o Coal Cosumptio Curve Fittig of the Thermal Based
More informationThe Random Walk For Dummies
The Radom Walk For Dummies Richard A Mote Abstract We look at the priciples goverig the oe-dimesioal discrete radom walk First we review five basic cocepts of probability theory The we cosider the Beroulli
More informationChapter 4. Fourier Series
Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,
More informationResearch on real time compensation of thermal errors of CNC lathe based on linear regression theory Qiu Yongliang
d Iteratioal Coferece o Machiery, Materials Egieerig, Chemical Egieerig ad Biotechology (MMECEB 015) Research o real time compesatio of thermal errors of CNC lathe based o liear regressio theory Qiu Yogliag
More informationA New Class of Ternary Zero Correlation Zone Sequence Sets Based on Mutually Orthogonal Complementary Sets
IOSR Joural of Electroics ad Commuicatio Egieerig (IOSR-JECE) e-issn: 2278-2834,p- ISSN: 2278-8735.Volume 0, Issue 3, Ver. I (May - Ju.205), PP 08-3 www.iosrjourals.org A New Class of Terary Zero Correlatio
More informationSimilarity Solutions to Unsteady Pseudoplastic. Flow Near a Moving Wall
Iteratioal Mathematical Forum, Vol. 9, 04, o. 3, 465-475 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/0.988/imf.04.48 Similarity Solutios to Usteady Pseudoplastic Flow Near a Movig Wall W. Robi Egieerig
More informationCEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering
CEE 5 Autum 005 Ucertaity Cocepts for Geotechical Egieerig Basic Termiology Set A set is a collectio of (mutually exclusive) objects or evets. The sample space is the (collectively exhaustive) collectio
More informationDirection of Arrival Estimation Method in Underdetermined Condition Zhang Youzhi a, Li Weibo b, Wang Hanli c
4th Iteratioal Coferece o Advaced Materials ad Iformatio Techology Processig (AMITP 06) Directio of Arrival Estimatio Method i Uderdetermied Coditio Zhag Youzhi a, Li eibo b, ag Hali c Naval Aeroautical
More informationOrthogonal Gaussian Filters for Signal Processing
Orthogoal Gaussia Filters for Sigal Processig Mark Mackezie ad Kiet Tieu Mechaical Egieerig Uiversity of Wollogog.S.W. Australia Abstract A Gaussia filter usig the Hermite orthoormal series of fuctios
More informationNumber of fatalities X Sunday 4 Monday 6 Tuesday 2 Wednesday 0 Thursday 3 Friday 5 Saturday 8 Total 28. Day
LECTURE # 8 Mea Deviatio, Stadard Deviatio ad Variace & Coefficiet of variatio Mea Deviatio Stadard Deviatio ad Variace Coefficiet of variatio First, we will discuss it for the case of raw data, ad the
More information6.003 Homework #3 Solutions
6.00 Homework # Solutios Problems. Complex umbers a. Evaluate the real ad imagiary parts of j j. π/ Real part = Imagiary part = 0 e Euler s formula says that j = e jπ/, so jπ/ j π/ j j = e = e. Thus the
More informationProbability of error for LDPC OC with one co-channel Interferer over i.i.d Rayleigh Fading
IOSR Joural of Electroics ad Commuicatio Egieerig (IOSR-JECE) e-issn: 2278-2834,p- ISSN: 2278-8735.Volume 9, Issue 4, Ver. III (Jul - Aug. 24), PP 59-63 Probability of error for LDPC OC with oe co-chael
More information3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,
3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationChapter 6 Infinite Series
Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat
More informationEnd-of-Year Contest. ERHS Math Club. May 5, 2009
Ed-of-Year Cotest ERHS Math Club May 5, 009 Problem 1: There are 9 cois. Oe is fake ad weighs a little less tha the others. Fid the fake coi by weighigs. Solutio: Separate the 9 cois ito 3 groups (A, B,
More informationHow to Maximize a Function without Really Trying
How to Maximize a Fuctio without Really Tryig MARK FLANAGAN School of Electrical, Electroic ad Commuicatios Egieerig Uiversity College Dubli We will prove a famous elemetary iequality called The Rearragemet
More informationCOMM 602: Digital Signal Processing
COMM 60: Digital Sigal Processig Lecture 4 -Properties of LTIS Usig Z-Trasform -Iverse Z-Trasform Properties of LTIS Usig Z-Trasform Properties of LTIS Usig Z-Trasform -ve +ve Properties of LTIS Usig Z-Trasform
More informationA sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as
More informationAxioms of Measure Theory
MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that
More informationIntroduction to Signals and Systems, Part V: Lecture Summary
EEL33: Discrete-Time Sigals ad Systems Itroductio to Sigals ad Systems, Part V: Lecture Summary Itroductio to Sigals ad Systems, Part V: Lecture Summary So far we have oly looked at examples of o-recursive
More informationQuick Review of Probability
Quick Review of Probability Berli Che Departmet of Computer Sciece & Iformatio Egieerig Natioal Taiwa Normal Uiversity Refereces: 1. W. Navidi. Statistics for Egieerig ad Scietists. Chapter 2 & Teachig
More informationQuick Review of Probability
Quick Review of Probability Berli Che Departmet of Computer Sciece & Iformatio Egieerig Natioal Taiwa Normal Uiversity Refereces: 1. W. Navidi. Statistics for Egieerig ad Scietists. Chapter & Teachig Material.
More informationAlgebra of Least Squares
October 19, 2018 Algebra of Least Squares Geometry of Least Squares Recall that out data is like a table [Y X] where Y collects observatios o the depedet variable Y ad X collects observatios o the k-dimesioal
More informationSolutions to Math 347 Practice Problems for the final
Solutios to Math 347 Practice Problems for the fial 1) True or False: a) There exist itegers x,y such that 50x + 76y = 6. True: the gcd of 50 ad 76 is, ad 6 is a multiple of. b) The ifiimum of a set is
More informationSimilarity between quantum mechanics and thermodynamics: Entropy, temperature, and Carnot cycle
Similarity betwee quatum mechaics ad thermodyamics: Etropy, temperature, ad Carot cycle Sumiyoshi Abe 1,,3 ad Shiji Okuyama 1 1 Departmet of Physical Egieerig, Mie Uiversity, Mie 514-8507, Japa Istitut
More informationA NEW CLASS OF 2-STEP RATIONAL MULTISTEP METHODS
Jural Karya Asli Loreka Ahli Matematik Vol. No. (010) page 6-9. Jural Karya Asli Loreka Ahli Matematik A NEW CLASS OF -STEP RATIONAL MULTISTEP METHODS 1 Nazeeruddi Yaacob Teh Yua Yig Norma Alias 1 Departmet
More informationAlternating Series. 1 n 0 2 n n THEOREM 9.14 Alternating Series Test Let a n > 0. The alternating series. 1 n a n.
0_0905.qxd //0 :7 PM Page SECTION 9.5 Alteratig Series Sectio 9.5 Alteratig Series Use the Alteratig Series Test to determie whether a ifiite series coverges. Use the Alteratig Series Remaider to approximate
More informationAPPENDIX F Complex Numbers
APPENDIX F Complex Numbers Operatios with Complex Numbers Complex Solutios of Quadratic Equatios Polar Form of a Complex Number Powers ad Roots of Complex Numbers Operatios with Complex Numbers Some equatios
More informationWHAT IS THE PROBABILITY FUNCTION FOR LARGE TSUNAMI WAVES? ABSTRACT
WHAT IS THE PROBABILITY FUNCTION FOR LARGE TSUNAMI WAVES? Harold G. Loomis Hoolulu, HI ABSTRACT Most coastal locatios have few if ay records of tsuami wave heights obtaied over various time periods. Still
More informationThere is no straightforward approach for choosing the warmup period l.
B. Maddah INDE 504 Discrete-Evet Simulatio Output Aalysis () Statistical Aalysis for Steady-State Parameters I a otermiatig simulatio, the iterest is i estimatig the log ru steady state measures of performace.
More informationThe Discrete Fourier Transform
The iscrete Fourier Trasform The discrete-time Fourier trasform (TFT) of a sequece is a cotiuous fuctio of!, ad repeats with period. I practice we usually wat to obtai the Fourier compoets usig digital
More informationSeries III. Chapter Alternating Series
Chapter 9 Series III With the exceptio of the Null Sequece Test, all the tests for series covergece ad divergece that we have cosidered so far have dealt oly with series of oegative terms. Series with
More informationMAT1026 Calculus II Basic Convergence Tests for Series
MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real
More informationCIS Spring 2018 (instructor Val Tannen)
CIS 160 - Sprig 2018 (istructor Val Tae) Lecture 5 Thursday, Jauary 25 COUNTING We cotiue studyig how to use combiatios ad what are their properties. Example 5.1 How may 8-letter strigs ca be costructed
More informationOPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES
OPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES Peter M. Maurer Why Hashig is θ(). As i biary search, hashig assumes that keys are stored i a array which is idexed by a iteger. However, hashig attempts to bypass
More informationPolynomial Functions and Their Graphs
Polyomial Fuctios ad Their Graphs I this sectio we begi the study of fuctios defied by polyomial expressios. Polyomial ad ratioal fuctios are the most commo fuctios used to model data, ad are used extesively
More informationThe axial dispersion model for tubular reactors at steady state can be described by the following equations: dc dz R n cn = 0 (1) (2) 1 d 2 c.
5.4 Applicatio of Perturbatio Methods to the Dispersio Model for Tubular Reactors The axial dispersio model for tubular reactors at steady state ca be described by the followig equatios: d c Pe dz z =
More informationREGRESSION (Physics 1210 Notes, Partial Modified Appendix A)
REGRESSION (Physics 0 Notes, Partial Modified Appedix A) HOW TO PERFORM A LINEAR REGRESSION Cosider the followig data poits ad their graph (Table I ad Figure ): X Y 0 3 5 3 7 4 9 5 Table : Example Data
More informationZeros of Polynomials
Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree
More informationImage Segmentation on Spiral Architecture
Image Segmetatio o Spiral Architecture Qiag Wu, Xiagjia He ad Tom Hitz Departmet of Computer Systems Uiversity of Techology, Sydey PO Box 3, Broadway Street, Sydey 007, Australia {wuq,sea,hitz}@it.uts.edu.au
More informationEquivalence Between An Approximate Version Of Brouwer s Fixed Point Theorem And Sperner s Lemma: A Constructive Analysis
Applied Mathematics E-Notes, 11(2011), 238 243 c ISSN 1607-2510 Available free at mirror sites of http://www.math.thu.edu.tw/ame/ Equivalece Betwee A Approximate Versio Of Brouwer s Fixed Poit Theorem
More information1 6 = 1 6 = + Factorials and Euler s Gamma function
Royal Holloway Uiversity of Lodo Departmet of Physics Factorials ad Euler s Gamma fuctio Itroductio The is a self-cotaied part of the course dealig, essetially, with the factorial fuctio ad its geeralizatio
More informationSequences of Definite Integrals, Factorials and Double Factorials
47 6 Joural of Iteger Sequeces, Vol. 8 (5), Article 5.4.6 Sequeces of Defiite Itegrals, Factorials ad Double Factorials Thierry Daa-Picard Departmet of Applied Mathematics Jerusalem College of Techology
More information