A Hybrid LWT-DWT Digital Image Watermarking Scheme using LSVR and QR-factorization

Size: px
Start display at page:

Download "A Hybrid LWT-DWT Digital Image Watermarking Scheme using LSVR and QR-factorization"

Transcription

1 International Journal of Alied Engineering Researh ISSN Volume, Number 6 ( Researh India Publiations. htt:// A Hybrid W-DW Digital Image Watermarking Sheme using SVR and QR-fatorization Koyi akshmi Prasad Researh Sholar, Deartment of CSE, Bharath Uniersity, Chennai, India. Dr.. Ch. Malleswara Rao Professor, Deartment of CSE, VBI, Hyderabad, India. Dr. V. Kannan Dean, Deartment of I, Bharath Uniersity, Chennai, India. Abstrat he digital image watermarking is an art of hiding seret image into soure image. he robust aroah of this watermarking ratie is to trade-off image quality (inisibility and embedding aaity. In this roosed artile we resent an effiient and hybrid aroah that integrates features of lifted waelet transform (W and disrete waelet transform (DW based on linear suort etor regression (SVR and QR-fatorization for watermarking. Initially, the QR-barode (watermark image grayed to ahiee maximum watermarking aaity. he orrelation feature of W is used to deomose image into nonoerlaing bloks. he QR fatorization is further deomose into Q and R matries. he SVR is obtain inut samles from R-matrix for training and learning urose. In the seond segment, we imlement the DW based multihannel fake-roof authentiity mehanism. Preisely the integrated hybrid aroah rodues less distortion rate. he exerimental results is analyzed with other models and offers high reliability on watermark embedding and authentiity along with less omutational ost. Keywords: Watermarking; QR-barode; ifted Waelet ransform (W; Disrete Waelet ransform (DW; authentiity; Introdution he theme of digital image watermarking is to hide the ruial information in the form of data bits inside the host image. he data bits or signifiant information suh as olor (RGB image, binary image, graysale image or seudo-random sequenes. In urrent deade attaining ownershi on multimedia ontent is quite omlex issue, sine duliation, illegal oying & stealing and rotetion against oyrights has beome most uzzling task. he extensie growth of data sharing and multimedia editing tehniques ould saliently damage these barriers []. he image watermarking utmost fouses only gray sale image watermarking, een most of the researh work is rimarily onentrate on these tehniques. Howeer olor image watermarking is rominent in terms of arrying more information than binary or gray sale images. Subsequently watermarking through QR bar ode rodues highest fidelity on hiding ruial information. Preisely the QR-bar ode watermarking uses strutural tuning sheme with the intention to embed watermarking information on rows and olumns. his method adots with sontaneous regressing methods to yield high reliability and auray with low roessing ost. Howeer it an be oied or forged at any stage sine this is not rytograhy tehnique to enryt the entire stuff. herefore there should be entailing of fake-roof identity or methodology in digital image watermarking [, 3]. Hiding or embedding original image into watermarked image is most tatial task. here are many researhes hae roosed on arious dimensions to ahiee highest reliability. Corresondingly the releant methods with our roosed model is inear Suort Vetor Regression (SVR along with QR-fatorization shemes [4]. his emloys statistial learning mehanisms suh as Suort Vetor Mahine (SVM. his hels in simlifying omlex strutures by lassifiations and regression aroahes. he foremost intention of regression model is to analyze and find an assoiation and relatiity between gien inut samle alues to the equialent target alues [5]. he SVR sheme uses learning and training aroah in order to find nonlinear relatiity between original host image with watermark image. his method rodues maximum robustness when omare with lassial SVR methods [6]. Related Works here are many researhes are ontributed towards digital image watermarking shemes. Neertheless while embedding watermark image should not damage the quality of original image, at the same time it should reah sureme inisibility to retain the serey on image [7]. Furthermore, the adoted watermarking sheme must be foreful enough to battle against ommon image roessing outbreaks. Simultaneously the watermarked image only be able to extrat by orresonding reiient. Similarly the tye of watermarked image is used for watermarking roess is again ruial fator. Sine sometimes this ould ause heti issues during extration roess [8]. 4335

2 International Journal of Alied Engineering Researh ISSN Volume, Number 6 ( Researh India Publiations. htt:// In another work [9] the QR fatorization is merged in the same method and offers hybrid sheme for embedding and extration. Author [0] deloyed the dual orthogonal matries along with singular matries for embedding and extration roess. he singular alue matries is engaged for embedding and orthogonal U and V matries is used to extration roess. Howeer this ould ause false-ositie issues during extration, sine author defined this sheme as non-blind []. Subsequently, in [7, 8] the singular alues are only alied on original image for embedding and extration. his method is used with olor image for watermarking. In another aer author [, 3] roosed a hybrid and robust watermarking algorithm using Singular Value Deomosition (SVD with Radon transform. Moreoer all the aboe mentioned models uses singular alues for watermarking roess, these are non-blind watermarking tehniques whih greatly affets quality of image during extration. Author [4] antiiated a watermarking method based on highest waelet oeffiient fator, in this model the quantization is alied on waelet oeffiients to grou into multile bloks with seletie sub-bands. Based on maximum oeffiient alue the watermark image is embedded. In turn this will aquire dierse energy leels with waelet oeffiients. Consequently at the reiient side Normalization Correlation (NC is emloyed for extration roess. his sheme ahiees maximum reliability on arious filtering and attaks as well. In another roosed model [5], the digital image watermarking for olor images is strutured. In this method original olor image is slit into 4 x 4 bloks and embedded along with watermark image. his algorithmi roedures alied on eah eight ixels alues of the blok, whih in turn yields lower rates on watermarking and also the leel of inisibility. Subsequently in another work [6], these drawbaks are retified by means of alying QRfatorization. In this method the two orthogonal matries (Q & R are used for watermarking roess. he first olumn elements of in the orthogonal Q-matrix are haing similar energy leels, based on similarity feature of these elements in orthogonal Q-matrix, the embedding is done. his method rodues reasonable inisibility after watermarking. In [6], author antiiated dual ombined DW algorithms, whih generates random sequenes with host image and finally embed with QR-ode. Neertheless this model doesn t roide surety on watermarking aaity. In order to oerome these drawbaks from reious model, author [7, ] desribed a ombined DC and DW algorithms for embedding roess. Similarly in another work [8], disussed the similarity between lassial satial transformation algorithms for information hiding sheme. In this aroah the reommendation towards watermarking by QR-bar ode. Howeer this model struggles with hiding and deoding aaity and during embedding roess. o emhasis watermarking roess and imeretibility, author [9] identified another ariety of satial domain watermarking method. his ideal methodology alulates the satial ositions of QR ode and aly minimal seurity feature by defining ubli keys. In addition author [0] worked on QRfatorization based on modified oeffiient alues embedding with first row of defined R-matrix, whereas eah image blok is diided into 8 x 8 bloks. Subsequently In [] roosed similar model, the diision 8 x 8 bloks using 3 x 3 gray sale image embedded with 5 x 5 original data image by onsidering modified elements in Q-matrix. he aboe ointed two aroahes imlements non-blind method, whih greatly affets inisibility leel. he Suort Vetor Mahine (SVM strethes high leel generalization and rodues better quality in watermarking. his method also ensures less bit error during reoery. Author [5], suggested a muh raid learning algorithm by means of modified SVR along with QR-fatorization sheme. his model insired from lifted waelet transform with QR-fatorization in digital image watermarking. It is better than lassial SVR models []. he watermarked image is segmented into non-oerlaing sub bands, based on their waelet oeffiients eah blok is again deomosed. Conersely this model doesn t yields seurity onstraints for illegal oying and modifiations. By onsidering all the aboe disussed aroahes, we roosed a noel and hybrid model, whih integrates the features of SVR and QR fatorization [6]. he seurity onstraints are retified by alying two haoti keys using DW algorithm []. he roosed model is embed the image in multile hannels and also roides high fidelity with inisibility leel. Watermark Deoding and Detetion In general the digital watermarking sheme, the resultant data embedding and extration has to be orretly roessed. Howeer QR image based watermarking needs more attention towards deoding and detetion rate. he deoding rate D and detetion rate D is exlained as follows [], D E R N i N N D R ( N[i] i DR ( N N Where the ND refers the suessful deoded QR ode, N refers number of exeriments onduted against QR ode. N[i] is number of extrated bits i that equialent to embedded QR ode. N refers total length of digital watermarking roess. In most of the ases the watermarking embedding and extration is orretly roessed, howeer in our roosed model we tend to resere these two arameters during watermarking roess. he Proosed Hybrid Watermarking Sheme he ombination of disrete waelet transform and lifting waelet transform rodues high effiay against QR rinted barode watermarking. he ifted Waelet ransform [W] gies owerful image analysis and faster roess in terms embedding and extration of images. he W also ensures the frequeny loalization when omared with other transform tehniques. In general the W roess omrise three fundamental stes. i. Segmentation ii. Foreasting iii. Udate. In the segmentation the gien signal is diided into non-oer laing sub-bands and generate twin samles suh as odd and een. he furating ste the odd and een are E R 4336

3 International Journal of Alied Engineering Researh ISSN Volume, Number 6 ( Researh India Publiations. htt:// orrelated with one another to redit aroriate samles. Finally based on the furating the udate ste, udates the required elements. In our roosed model enhane the feature of W along with inear Suort Vetor Regression (SVR sheme [6]. he SVR hels in training the samles and redit adequate elements during embedding roess. he QR-fatorization is used to deomose the sub-bands into two ariety of matrixes. Suh Q and R matrix. he low frequeny sub-band ( is used during embedding roess in order to attain maximum energy leels. he orrelation and assoiation feature of W reommends the seleted blok that again deomosed using QR method. Consequently the roosed unitary Q-matrix and uer triangular R-matrix shows orrelated elements. In this sequene the first row elements in R-matrix haing maximum energy leel and used for embedding roess. he detailed roess and roosed model deited in figure. he DW domain gies authentiity on QR ode and maintains the fakeroof QR ode using two haoti keys. he DW also ensures the deoding rate and detetion rate on QR ode. Before alying the watermarking the QR ode is undergone with binary image graying, where rinted image is grayed in order to attain maximum watermarking aaity. Algorithm: Watermark Embedding with Authentiity he watermarking QR barode is undergone with binary image graying, whih ensures maximum watermarking aaity. hen the host QR ode is onerted into -D etor formation, W ( l { l,... }, where denotes the length of watermark W ( l {0,}. he watermarking embedding roess inoles dual transformations. he first setion deals with lifting waelet transform (W along with QRfatorization and inear Suort Vetor Regression (SVR. he subsequent setion emloying authentiity mehanism (DW using seret keys. M Ste #: After onerting the QR-ode image ( I into one dimensional form (8-bit, he lifting waelet transform is alied to host image, after onersion the 8-bit QR-ode image (5 x 5 is deomose into four non-oerlaing sub bands (, H, H, HH. M M I { I ( a, b : a X, b Y} (3, H, H, HH X Y X X Y Y, leel of deomosition M Where alues a and b are loation oordinates of I, eah sub-band with the size X Y. he QR-fatorization is alied after segmenting I M into four sub-bands. he QRfatorization is lagiaristi through orthogonal triangular matrix O. X Y O Q. R (4 X Y X Y X Y From the aboe equation (4, the Q-matrix is unitary matrix. R-matrix defines uer triangular matrix. he Q-olumn matrix is obtained using Gram-Shmidt formulation [3]. QRfatorization is urely deends on R-matrix. he first olumn of R-matrix elements haing maximum energy of the signal. he SVR method is used to omute R-matrix. he inear Suort Vetor Regression (SVR he formulated SVR model is to goern the orrelation between obsered inut samles and orresonding target alues [6]. Aarently the inut samles is aroximated as set of Data sets D s s l l i {,,...,, },, D a b a b where a b he linear funtion, f ( a { w, a} g (5 Suh that, w is watermarking bit, g is a onstant. he otimal regression funtion is desribed by minimal funtion, min( w, S w I ( Si, Si (6 he slak ariables S, S to seifies uer and lower i i onstraints, I is re-seified arameter (onstants, alue is dimension alue of gien matrix (R. he intensie loss funtion is omuted by alying agrange multiliers on both side,, 0, for f ( a b ( b f ( a b, otherwise max( w (, max (, ( q, q,, q a aq b b, arg min ( ( q q ( a, aq, q (, ( ( ( (7 ( b ( (8 Figure : Model diagram of roosed watermarking sheme (Watermark Embedding and Extration 4337

4 International Journal of Alied Engineering Researh ISSN Volume, Number 6 ( Researh India Publiations. htt:// By relating artial deriaties on both side, then rimal ariables are zero. he duality of otimal alues with reset to minimization roblem an be defined as, W O ( G Est q ( q Where W, G are the solution of estimated etor Est of one dimension. O is orthogonal triangular matrix. he estimation funtion Est ( f ( x an be defined as, ( ( [,] ( q (9 Est f x a O Est he augmented matrix A M with reset O, Est an be defined as, min, q Q r (0 0, R G q q AM AM AM AM Q I AM AM AM AM I By alying kernel matrix ( KM on aboe Q matrix, that is ositie semi-symmetri in nature. he onergene funtion C is aquired by further exanding the below equation, KM ( AM AM KM ( AM AM Q I ( KM ( AM AM KM ( AM AM I AM, A, for linear M C (3 KM( AM, AM, for non linear Based on linear and non-linear onditions, the Q-matrix from the blok matrix an be written as, C C Q I (4 C C I he unitary Q-matrix and uer triangular R-matrix is aquired from the seleted bloks of sub-bands. In R- matrix, the first row elements haing maximum energy when omare with other elements. r, r, r,3 r,4 0 r, r,3 r,4 R (5 0 0 r3,3 r3, r 4,4 After referring arious filtering and attaks the r,3 element is onsidered as otimal element [6]. Howeer other elements in the matrix are gien as inut ariables for SVR training formation. Ste #: he seletion of Data set is to train the inear Suort Vetor Regression formation. 9 ( a, D R R :,,... Ds (6 r,3 ( other elements in R he desired outut D is defined as,,3 D { r :,3,5,... }, the odd samles are taken to train the SVR formation. he een samles are taken after obtaining redited outome, D { r :,3,6,... }. he general threshold arameter for imeretibility and robustness are defined to onlude the number of reetition. if w bit SVR r,3 max( r,3, r,3 else r min( r, r SVR,3,3,3 he r,3 is modified element after embedding roess, then it relae to the atual alue r,3 blok. r,3 SVR,3 element of R matrix of eah the redited outome after SVR training. Ste #3: One the watermarking is done with watermarking image, then inerse W and QR fatorization is alied to aomlish atual watermarked QR ode. Ste #4: he inerse W and QR-fatorization rodues effetie QR ode, howeer the authentiity with QR-ode is aomlished using DW formulation. In this omosition the QR-ode is again deomosed into non-oerlaing retangular ortions. Eah retangular segment is again watermarked with authentiity elements. hese elements are used to omute the distortion rate on watermarked QR-ode. his setion exemlifies that, eah non-oerlaing retangular segment is seified as indiidual watermark hannel. the waelet oeffiient f( of watermarking loation ( al, bl to be identified in order deide loation based keys of watermarking hannel. Subsequently the haoti keys Ca, Cbare determined. hese haoti keys are ket seret between two ommuniating entities. Eah watermarking hannel is embedded using the haoti keys C, C and quantization arameter in order to alulate the distortion rate D. inear Estimation of Authentiation he linear estimation on authentiity of eah watermarking hannel AU ( l and distortion rate of watermarked signal is omuted by the following equation. AU ( l. AU ( l (7 l Where, the is weighted waelet oeffiient of eah hannel. he weighted oeffiient is determined based on the distortion rate eah watermarked hannel. From the watermarked QRode the waelet oeffiient is assigned with large alue and distortion rate is smaller, in order to attain high robustness. Howeer the weighted waelet oeffiient has fulfil the following equation. (8 a b 4338

5 International Journal of Alied Engineering Researh ISSN Volume, Number 6 ( Researh India Publiations. htt:// After ertain analysis based on nature of QR-ode and distortion rate, the final weighted waelet oeffiient of eah watermarking hannel is desribed as follows, D D, for all l {,,... }, D 0 (9 l D l G D 0 G (0 Finally the fulfilment of authentiity is ahieed by getting distortion rate of any hannel G an satisfy the aboe equation. Prob( f ( Err( l D Prob Err ( l D ( (5 From the aboe equation the authentiity of watermark bit is onluded. his also determines the distortion rate of all resetie watermark hannels. he robability funtion is used to onfine less distortion rate with all watermarked hannels. Ste #3: One the authentiity of watermarked image is onfined, then again the image is disintegrated into four bands, suh as, H, H, HH Figure : Original watermark image (D Algorithm: Watermark Extration with Authentiity Ste #: In order to alidate the authentiity with watermarked hannels, there are two other omaratie oeffiients are defined in order to omute watermarking bit error. he Err ( l & ( Err l are error on indiidual hannel and error on indiidual bit. he following equations are reresented as follows, AU ( l is inorret Err ( l ( 0 AU ( l is orret AU ( l isinorret Err ( l ( 0 AU ( l is orret he watermark bit error an be omuted as follows, Err ( l AU( l AU ( l & Err ( l AU( l AU ( l By ombining all the aboe mentioned equations, Err( l AU ( l. AU( l. AU ( l AU( l. Err( l (3 Ste #: Calulating the Error robability he error rate robability funtion of eah watermark bit AU ( l is defined as follows, f ( Err( l. Err (4 Ste #4: he disintegrated sub band is undergone with W roess with sub-band. hen eah blok of sub-band is deomosed into Q-matrix and uer triangular R matrix using QR fatorization. Seifially the een data samles are taken for watermark extration. Ste #5: After aquiring the een numbered samles the trained SVR sequenes are omared with these samles, the desired extrated binary sequene is again omared with SVR trained samles. he final extrated watermarked bloks reresented using this following equation, SVR if r,3 r,3 W (6 0 otherwise Ste #6: he obtained watermarking sequene is again onerted into atual QR-ode. In order get atual sale of QR-ode, the geometrial orretion is further alied. Exerimental Results and Analysis In this segment, the erformane of roosed model for QR ode image is tested. In this ortion we omare our roosed model with many similar shemes and demonstrate imeretibility and robustness is justified. he antiiated sheme is erified through extensie ealuations with arious texture images, in general we hae onsidered Mario D image with the size of 3 x 3 as shown in figure.. he lifted waelet transform is used to deomose the QR ode image into four sub-bands. Moreoer the rearation of trained sequene inear Suort Vetor Regression (SVR is done through Radial Basis Funtion (RBF [6]. During the training of SVR there are two other arameters has to be defined by the user. (i. e. I = 80 and = In the exerimental benhmarking, the roosed model reflets both linear and olynomial kernel. he quality of watermarked QR-ode image is alidated through Peak Signal-to-Noise ratio (PSNR fator and embedding aaity of the image (i. e. bits. After the 4339

6 International Journal of Alied Engineering Researh ISSN Volume, Number 6 ( Researh India Publiations. htt:// suessful extration of D image (QR-ode along with watermarked image (original image again it is ealuated by two other methods, suh as Normalized Absolute Error (NAF and amer Assessment Fator (AF. et desribe the notation for all these ealuation methods. he D soure image SI ( x, y, Data image DI ( x, y, Watermarked image (after embedding WI ( x, y, retrieed watermarked QR-ode image RI ( x, y, extrated watermark imagew I ( x, y, restored image S I ( x, y, suh that x, y are the oordinates of the gien image. 55 PSNR 0log0 db MSE q MSE [ SI( x, y DI( x, y] q x y NAE q WI( x, y WI ( x, y x y q W ( x, y x y I q AF [ WI( x, y RI( x, y] q x y he extrated image is undergone with arious filters and attaks in order to alidate imeretibility and robustness of roosed model. Initially we ealuate PSNR (db and embedding aaity using our roosed model. he waelength alue is able : PSNR (db alue and embedding aaity (bits of roosed model Image PSNR Embedding Caaity (bits Vegetables Baboon Engine Mario Aerage he table shows the omarison between PSNR and embedding aaity with fixed waelength alue. hese images are analogous in nature (Figure. here is no artiular deiation with PSNR alues and embedding aaities. Howeer inrease of PSNR alue will also reflets on embedding aaity bits. he roosed model stabilize on PSNR (db. he ereied PSNR alues of roosed model is moderately aetable when omared with other shemes. R Xie et al [], in et al [4], R Xie et al [9], Yashar N et al [0]. ( Figure 3: he host watermark images (a. Vegetables (b. Baboon (. Engine (d. Mario (d (i (ii (iii Figure 4: Watermarked QR-ode (7 x 7 i six ii twele iii eighteenhannels (i (ii (iii Figure 5: Watermarked QR-ode (3 x 3 i six ii twele iii eighteen hannels able : Distortion rate of watermarked QR-ode Size of QR- Number of ength of watermark bits Image Channels 64% 8% 56% 5% 7 x x In this segment we desribed distortion rate based on number of hannels of roosed algorithm. In this tested domain the QR-ode is diided into three ariations, suh as six, twele, eighteen hannels (Figure. 4 and 5. he distortion rate is abrutly dereases when number of hannels inreases. Howeer this will reflets on maximum embedding aaity bits, it is better to kee moderate number of hannels to ahiee high fidelity. he effiay is benhmarked with another shemes R Xie et al [], in et al [4], R Xie et al [9], Yashar N et al [0], able 3: Error Fator of extrated watermarked image (a (b Image amer Assessment Normalized Fator (AF Error (NAE Vegetables Baboon Engine Mario Absolute 4340

7 International Journal of Alied Engineering Researh ISSN Volume, Number 6 ( Researh India Publiations. htt:// he table 4 reflets erformane measure of roosed model. In general the fator AF & NAE is based on the quality of the watermarked image and embedding roess. Aording to our roosed model the AF and NAE is reasonably idential. he aerage alue of AF and NAE able 4: AF alues of extrated watermark image, Gaussian Noise, Rotation, Sharening, Salt & Peer Noise, Ag. filtering, Median filtering and JPEG omression. Image Attaks & Filtering (Proosed Sheme Gaussian Noise (ariane : Rotation Sharening Salt & Peer Noise (density leel : Ag. Median filter filter (3 (3 x 3 x 3 Vegetables Baboon Blurring JPEG omression (Ratio: 60 % Engine Mario he robustness and imeretibility of roosed model is desribed in table 4. In this table we hae olleted arious attaks and filtering alied on watermarked QR-ode. Howeer there are ertain arameters like Gaussian noise and salt & eer noise, JPEG omression ratio are fixed with onstant range of alues. Rajesh et al [6], in et al [4], R Xie et al [9], he aboe table 4 shows the erformane metris after olleting data alues from table 3. It also reflets the stability of roosed model. Howeer the roosed model is highly robust when omare with other methods. Conlusion he roosed hybrid model omrises seeral attrations towards imeretibility and robustness on watermarking roess. his integrated aroah roides liberty on maximum watermarking aaity and less distortion rate when omare with other models, enough authentiity mehanism to aoid illegal oying and rotetion against oyrights. he orrelation roerty of W is used to deomose grayed QR-bar ode into non-oer laing bloks. he QR-fatorization is tend to further deomose the bloks into Q and R matries then the blok and element seletion from the first row elements from R matrix is done to ahiee imeretibility. he adoted SVR sheme is to train the inut samles in order to find the relationshi between nonlinear elements. he authentiity is deloyed in the roosed model through multi-hannel DW aroah. After embedding the soure image into watermark image again the watermark image is enryted using user defined keys and ket seret. he roosed model greatly inreases the deoding rate and detetion rate. he roosed model is omared with traditional waelet transform and lassial SVR shemes, and rodues more effiay in terms of faster roessing and omutational ost. Referenes [] An, Gao X, i X, ao D, Deng C, i J (0 Robust reersible watermarking ia lustering and enhaned ixel-wise masking. IEEE rans Image Proess (8: [] Rong sheng Xie, Chaoqun Hong, Shunzhi Zhu, Daeng ao, "Anti-ounterfeiting digital watermarking algorithm for rinted QR barode", Neuroomuting 67( [3] Gao Mei-feng, Sun Bing. Blind Watermark Algorithm Based on QR Barode. Foundations of intelligent systems, in: Proeedings of the Sixth International Conferene on Intelligent Systems and Knowledge Engineering (ISKE0. Shanghai: Sringer Berlin Heidelberg, 0, [4] Mangasarian O, Musiant DR (00 agrangian suort etor mahines. J Mah earn Res 00(: 6-77 [5] Balasundaram S, Kail (00 On agrangian suort etor regression. Exert Syst Al 37(: [6] Rajesh Mehta & Nain Rajal & Virendra P. Vishwakarma, " W-QR deomosition based robust and effiient image watermarking sheme using agrangian SVR", Multimed ools Al. DOI /s [7] Golea NEH, Seghir R, Benzid R (00 A bind RGB olor image watermarking based on singular alue deomosition. 00 IEEE/ACS International Conferene on Comuter Systems and Aliations,. -5 [8] Rastegar S, Namazi F, Yaghmaie K, Aliabadian A (0 Hybrid watermarking algorithm based on singular alue deomosition and radon transform. AEU Int J Eletron Commun 65(7: [9] Yashar N, Saied HK (04 Fast and robust watermarking in still images based on QR deomosition. Multimed ools Al 7: [0] Qingtang Su & Gang Wang & Xiaofeng Zhang & Gaohuan & Beijing Chen, "An imroed olor image watermarking algorithm based on QR deomosition", Multimed ools Al. DOI /s x [] Yin CQ, i, AQ, Qu (007 Color image watermarking algorithm based on DW-SVD. IEEE Int Conf Autom og [] Xing Y, an J (007 A olor watermarking sheme based on blok-svd and Arnold transformation. 007 I. E. Seond Worksho on Digital Media and its Aliation in Museum and Heritage,. 3-8 [3] Yin CQ, i, AQ, Qu (007 Color image watermarking algorithm based on DW-SVD. 007 I. E. International Conferene on Automation and ogistis, [4] in WH, Wang YR, Hong SJ, Kao W, Pan Y (009 A blind watermarking method using maximum waelet oeffiient quantization. Exert Syst Al 36(9:

8 International Journal of Alied Engineering Researh ISSN Volume, Number 6 ( Researh India Publiations. htt:// [5] Su Q, Niu Y, Zou H, Zhao Y, Yao (04 A blind double olor image watermarking algorithm based on QR deomosition. Multimed ools Al 7(: [6] Sun Ming, SiJi-bo, ZhangShu-huai, Researh on embedding and extrating methods for digital watermarks alied to QR ode images, N. Z. J. Agri. Res. 50 ( [7] Suat Rungraungsli, Mahasak Ketham, Pruh Surakote. Data hiding method for QR ode based on watermark by omaring DC with DW domain, in: International Conferene on Comuter and Communiation ehnologies (ICCC'0, 0 Phuket: [8] M. Osamah, Al-Qershi, B. E. Khoo, High aaity data hiding shemes for medial images based on differene exansion, J. Syst. Softw. 84( ( [9] Xie Rong-sheng, Zhao Huan-xi, ChenYu-ming, Researhing on anti-ounterfeiting E-tiketing digital watermarking algorithm based on QR D barode, J. Xiamen Uni. (Si. 5(3 ( [0] Yashar N, Saied HK (04 Fast and robust watermarking in still images based on QR deomosition. Multimed ools Al 7: [] Song W, Hou JJ, i ZH, Huang (0 Chaoti system and QR fatorization based robust digital image watermarking algorithm. J Cent South Uni ehnol 8(:6-4 [] Shen R, Fu Y, u H (005 A noel image watermarking sheme based on suort etor regression. J Syst Softw 78(:-8 [3] Wei S, Jian-jun H, Zhao-hong, iang H (0 Chaoti system and QR fatorization based robust digital image watermarking algorithm. J Cent S Uni ehnol. 8:

Bias Error Reduction of Digital Image Correlation Based on Kernel

Bias Error Reduction of Digital Image Correlation Based on Kernel Vol.81 (CST 15),.16- htt://dx.doi.org/1.1457/astl.15.81.4 Bias Error Redution of Digital Image Correlation Based on Kernel Huan Shen 1,, eize Zhang 1, and Xiang Shen 1 Energy and ower College, anjing Uniersity

More information

Abstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1.

Abstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1. Fuzzy Weighted Rank Ordered Mean (FWROM) Filters for Mixed Noise Suppression from Images S. Meher, G. Panda, B. Majhi 3, M.R. Meher 4,,4 Department of Eletronis and I.E., National Institute of Tehnology,

More information

Exponential Particle Swarm Optimization Approach for Improving Data Clustering

Exponential Particle Swarm Optimization Approach for Improving Data Clustering International Journal of Eletrial and Eletronis Engineering 3:4 9 Exonential Partile Swarm Otimization Aroah for Imroving Data Clustering eveen I. Ghali, ahed El-Dessoui, Mervat A.., and Lamiaa Barawi

More information

Reconfigurable Shape-Adaptive Template Matching Architectures

Reconfigurable Shape-Adaptive Template Matching Architectures Reonfigurable Shae-Adative Temlate Mathing Arhitetures Jörn Gause 1, Peter Y.K. Cheung 1, Wayne Luk 2 1 Deartment of Eletrial and Eletroni Engineering, Imerial College, London SW7 2BT, England. 2 Deartment

More information

Social Network Analysis Based on BSP Clustering Algorithm

Social Network Analysis Based on BSP Clustering Algorithm Communiations of the IIMA Volume 7 Issue 4 Artile 5 7 Soial Network Analysis Based on BSP Clustering Algorithm ong Shool of Business Administration China University of Petroleum Follow this and additional

More information

Event Detection Using Local Binary Pattern Based Dynamic Textures

Event Detection Using Local Binary Pattern Based Dynamic Textures Event Detetion Using Loal Binary Pattern Based Dynami Textures Abstrat Deteting susiious events from video surveillane ameras has been an imortant task reently. Many trajetory based desritors were develoed,

More information

Approximate Labeling via the Primal-Dual Schema

Approximate Labeling via the Primal-Dual Schema Aroximate Labeling via the Primal-Dual Shema Nikos Komodakis and Georgios Tziritas Tehnial Reort CSD-TR-2005-01 February 1, 2005 Aroximate Labeling via the Primal-Dual Shema Nikos Komodakis and Georgios

More information

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Malaysian Journal of Computer Siene, Vol 10 No 1, June 1997, pp 36-41 A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Md Rafiqul Islam, Harihodin Selamat and Mohd Noor Md Sap Faulty of Computer Siene and

More information

A {k, n}-secret Sharing Scheme for Color Images

A {k, n}-secret Sharing Scheme for Color Images A {k, n}-seret Sharing Sheme for Color Images Rastislav Luka, Konstantinos N. Plataniotis, and Anastasios N. Venetsanopoulos The Edward S. Rogers Sr. Dept. of Eletrial and Computer Engineering, University

More information

The Alpha Torque and Quantum Physics

The Alpha Torque and Quantum Physics The Alpha Torque and Quantum Physis Zhiliang Cao, Henry Cao williamao15000@yahoo.om, henry.gu.ao@gmail.om July 18, 010 Abstrat In the enter of the unierse, there isn t a super massie blak hole or any speifi

More information

A Novel Validity Index for Determination of the Optimal Number of Clusters

A Novel Validity Index for Determination of the Optimal Number of Clusters IEICE TRANS. INF. & SYST., VOL.E84 D, NO.2 FEBRUARY 2001 281 LETTER A Novel Validity Index for Determination of the Optimal Number of Clusters Do-Jong KIM, Yong-Woon PARK, and Dong-Jo PARK, Nonmembers

More information

Projector Calibration for 3D Scanning Using Virtual Target Images

Projector Calibration for 3D Scanning Using Virtual Target Images INTERNATIONAL JOURNAL OF RECISION ENGINEERING AND MANUFACTURING Vol. 13, No. 1,. 125-131 JANUARY 2012 / 125 DOI: 10.1007/s12541-012-0017-3 rojetor Calibration for 3D Sanning Using Virtual Target Images

More information

An Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index

An Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index IJCSES International Journal of Computer Sienes and Engineering Systems, ol., No.4, Otober 2007 CSES International 2007 ISSN 0973-4406 253 An Optimized Approah on Applying Geneti Algorithm to Adaptive

More information

The official electronic file of this thesis or dissertation is maintained by the University Libraries on behalf of The Graduate School at Stony Brook

The official electronic file of this thesis or dissertation is maintained by the University Libraries on behalf of The Graduate School at Stony Brook Stony Brook University The offiial eletroni file of this thesis or dissertation is maintained by the University Libraries on behalf of The Graduate Shool at Stony Brook University. Alll Rigghht tss Reesseerrvveedd

More information

Plot-to-track correlation in A-SMGCS using the target images from a Surface Movement Radar

Plot-to-track correlation in A-SMGCS using the target images from a Surface Movement Radar Plot-to-trak orrelation in A-SMGCS using the target images from a Surfae Movement Radar G. Golino Radar & ehnology Division AMS, Italy ggolino@amsjv.it Abstrat he main topi of this paper is the formulation

More information

A Load-Balanced Clustering Protocol for Hierarchical Wireless Sensor Networks

A Load-Balanced Clustering Protocol for Hierarchical Wireless Sensor Networks International Journal of Advanes in Computer Networks and Its Seurity IJCNS A Load-Balaned Clustering Protool for Hierarhial Wireless Sensor Networks Mehdi Tarhani, Yousef S. Kavian, Saman Siavoshi, Ali

More information

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines The Minimum Redundany Maximum Relevane Approah to Building Sparse Support Vetor Mahines Xiaoxing Yang, Ke Tang, and Xin Yao, Nature Inspired Computation and Appliations Laboratory (NICAL), Shool of Computer

More information

Dr.Hazeem Al-Khafaji Dept. of Computer Science, Thi-Qar University, College of Science, Iraq

Dr.Hazeem Al-Khafaji Dept. of Computer Science, Thi-Qar University, College of Science, Iraq Volume 4 Issue 6 June 014 ISSN: 77 18X International Journal of Advaned Researh in Computer Siene and Software Engineering Researh Paper Available online at: www.ijarsse.om Medial Image Compression using

More information

Robust Lossless Image Watermarking in Integer Wavelet Domain using SVD

Robust Lossless Image Watermarking in Integer Wavelet Domain using SVD Robust Lossless Image Watermarking in Integer Domain using SVD 1 A. Kala 1 PG scholar, Department of CSE, Sri Venkateswara College of Engineering, Chennai 1 akala@svce.ac.in 2 K. haiyalnayaki 2 Associate

More information

Skip Strips: Maintaining Triangle Strips for View-dependent Rendering

Skip Strips: Maintaining Triangle Strips for View-dependent Rendering Ski Stris: Maintaining Triangle Stris for View-deendent Rendering Jihad El-Sana ; Elvir Azanli Amitabh Varshney Deartment of Mathematis and Comuter Siene Deartment of Comuter Siene Ben-Gurion University

More information

p[4] p[3] p[2] p[1] p[0]

p[4] p[3] p[2] p[1] p[0] CMSC 425 : Sring 208 Dave Mount and Roger Eastman Homework Due: Wed, Marh 28, :00m. Submit through ELMS as a df file. It an either be distilled from a tyeset doument or handwritten, sanned, and enhaned

More information

Control CPR: A Branch Height Reduction Optimization for EPIC Architectures

Control CPR: A Branch Height Reduction Optimization for EPIC Architectures Control CPR: A Branh Height Redution Otimization for EPIC Arhitetures Mihael Shlansker, Sott Mahlke, Rihard Johnson HP Laboratories Palo Alto HPL-1999-34 February, 1999 E-mail: [shlansk,mahlke]@hl.h.om

More information

ICCGLU. A Fortran IV subroutine to solve large sparse general systems of linear equations. J.J. Dongarra, G.K. Leaf and M. Minkoff.

ICCGLU. A Fortran IV subroutine to solve large sparse general systems of linear equations. J.J. Dongarra, G.K. Leaf and M. Minkoff. http://www.netlib.org/linalg/ig-do 1 of 8 12/7/2009 11:14 AM ICCGLU A Fortran IV subroutine to solve large sparse general systems of linear equations. J.J. Dongarra, G.K. Leaf and M. Minkoff July, 1982

More information

Image Steganography Scheme using Chaos and Fractals with the Wavelet Transform

Image Steganography Scheme using Chaos and Fractals with the Wavelet Transform International Journal of Innovation, Management and Tehnology, Vol. 3, o. 3, June Image Steganography Sheme using Chaos and Fratals with the Wavelet Transform Yue Wu and Joseph P. oonan bstrat This paper

More information

On the Relationship Between Dual Photography and Classical Ghost Imaging

On the Relationship Between Dual Photography and Classical Ghost Imaging 1 On the Relationshi Between Dual Photograhy and Classial Ghost Imaging Pradee Sen University of California, Santa Barbara arxiv:1309.3007v1 [hysis.otis] 12 Se 2013 Abstrat Classial ghost imaging has reeived

More information

arxiv: v1 [cs.db] 13 Sep 2017

arxiv: v1 [cs.db] 13 Sep 2017 An effiient lustering algorithm from the measure of loal Gaussian distribution Yuan-Yen Tai (Dated: May 27, 2018) In this paper, I will introdue a fast and novel lustering algorithm based on Gaussian distribution

More information

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract CS 9 Projet Final Report: Learning Convention Propagation in BeerAdvoate Reviews from a etwork Perspetive Abstrat We look at the way onventions propagate between reviews on the BeerAdvoate dataset, and

More information

A Piecewise Linear Network Classifier

A Piecewise Linear Network Classifier Proeedings of International Joint Conferene on eural etworks, Orlando, Florida, USA, August -7, 007 A Pieewise Linear etwork Classifier Abdul A. Abdurrab, Mihael T. Manry, Jiang Li, Sanjee S. Malalur and

More information

A Flexible Scheme of Self Recovery for Digital Image Protection

A Flexible Scheme of Self Recovery for Digital Image Protection www.ijcsi.org 460 A Flexible Scheme of Self Recoery for Digital Image Protection Zhenxing Qian, Lili Zhao 2 School of Communication and Information Engineering, Shanghai Uniersity, Shanghai 200072, China

More information

Pipelined Multipliers for Reconfigurable Hardware

Pipelined Multipliers for Reconfigurable Hardware Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,

More information

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2 On - Line Path Delay Fault Testing of Omega MINs M. Bellos, E. Kalligeros, D. Nikolos,2 & H. T. Vergos,2 Dept. of Computer Engineering and Informatis 2 Computer Tehnology Institute University of Patras,

More information

Research Article Intuitionistic Fuzzy Possibilistic C Means Clustering Algorithms

Research Article Intuitionistic Fuzzy Possibilistic C Means Clustering Algorithms Hindawi Publishing Cororation Advanes in Fuzzy Systems Volume 2015, Artile ID 2827, 17 ages htt://dx.doi.org/10.1155/2015/2827 Researh Artile Intuitionisti Fuzzy Possibilisti C Means Clustering Algorithms

More information

Time delay estimation of reverberant meeting speech: on the use of multichannel linear prediction

Time delay estimation of reverberant meeting speech: on the use of multichannel linear prediction University of Wollongong Researh Online Faulty of Informatis - apers (Arhive) Faulty of Engineering and Information Sienes 7 Time delay estimation of reverberant meeting speeh: on the use of multihannel

More information

ARABIC OCR SYSTEM ANALOGOUS TO HMM-BASED ASR SYSTEMS; IMPLEMENTATION AND EVALUATION

ARABIC OCR SYSTEM ANALOGOUS TO HMM-BASED ASR SYSTEMS; IMPLEMENTATION AND EVALUATION ARABIC OCR SYSTEM ANALOGOUS TO HMM-BASED ASR SYSTEMS; IMPLEMENTATION AND EVALUATION M.A.A. RASHWAN, M.W.T. FAKHR, M. ATTIA, M.S.M. EL-MAHALLAWY 4 ABSTRACT Desite 5 years of R&D on the roblem of Otial harater

More information

Robust Dynamic Provable Data Possession

Robust Dynamic Provable Data Possession Robust Dynami Provable Data Possession Bo Chen Reza Curtmola Department of Computer Siene New Jersey Institute of Tehnology Newark, USA Email: b47@njit.edu, rix@njit.edu Abstrat Remote Data Cheking (RDC)

More information

Detection and Recognition of Non-Occluded Objects using Signature Map

Detection and Recognition of Non-Occluded Objects using Signature Map 6th WSEAS International Conferene on CIRCUITS, SYSTEMS, ELECTRONICS,CONTROL & SIGNAL PROCESSING, Cairo, Egypt, De 9-31, 007 65 Detetion and Reognition of Non-Oluded Objets using Signature Map Sangbum Park,

More information

Graph-Based vs Depth-Based Data Representation for Multiview Images

Graph-Based vs Depth-Based Data Representation for Multiview Images Graph-Based vs Depth-Based Data Representation for Multiview Images Thomas Maugey, Antonio Ortega, Pasal Frossard Signal Proessing Laboratory (LTS), Eole Polytehnique Fédérale de Lausanne (EPFL) Email:

More information

A Coarse-to-Fine Classification Scheme for Facial Expression Recognition

A Coarse-to-Fine Classification Scheme for Facial Expression Recognition A Coarse-to-Fine Classifiation Sheme for Faial Expression Reognition Xiaoyi Feng 1,, Abdenour Hadid 1 and Matti Pietikäinen 1 1 Mahine Vision Group Infoteh Oulu and Dept. of Eletrial and Information Engineering

More information

On Optimal Total Cost and Optimal Order Quantity for Fuzzy Inventory Model without Shortage

On Optimal Total Cost and Optimal Order Quantity for Fuzzy Inventory Model without Shortage International Journal of Fuzzy Mathemat and Systems. ISSN 48-9940 Volume 4, Numer (014, pp. 193-01 Researh India Puliations http://www.ripuliation.om On Optimal Total Cost and Optimal Order Quantity for

More information

Performance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application

Performance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application World Aademy of Siene, Engineering and Tehnology 8 009 Performane of Histogram-Based Skin Colour Segmentation for Arms Detetion in Human Motion Analysis Appliation Rosalyn R. Porle, Ali Chekima, Farrah

More information

A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks

A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks Abouberine Ould Cheikhna Department of Computer Siene University of Piardie Jules Verne 80039 Amiens Frane Ould.heikhna.abouberine @u-piardie.fr

More information

Accommodations of QoS DiffServ Over IP and MPLS Networks

Accommodations of QoS DiffServ Over IP and MPLS Networks Aommodations of QoS DiffServ Over IP and MPLS Networks Abdullah AlWehaibi, Anjali Agarwal, Mihael Kadoh and Ahmed ElHakeem Department of Eletrial and Computer Department de Genie Eletrique Engineering

More information

Supplementary Material: Geometric Calibration of Micro-Lens-Based Light-Field Cameras using Line Features

Supplementary Material: Geometric Calibration of Micro-Lens-Based Light-Field Cameras using Line Features Supplementary Material: Geometri Calibration of Miro-Lens-Based Light-Field Cameras using Line Features Yunsu Bok, Hae-Gon Jeon and In So Kweon KAIST, Korea As the supplementary material, we provide detailed

More information

Robust Image Watermarking based on Discrete Wavelet Transform, Discrete Cosine Transform & Singular Value Decomposition

Robust Image Watermarking based on Discrete Wavelet Transform, Discrete Cosine Transform & Singular Value Decomposition Advance in Electronic and Electric Engineering. ISSN 2231-1297, Volume 3, Number 8 (2013), pp. 971-976 Research India Publications http://www.ripublication.com/aeee.htm Robust Image Watermarking based

More information

the data. Structured Principal Component Analysis (SPCA)

the data. Structured Principal Component Analysis (SPCA) Strutured Prinipal Component Analysis Kristin M. Branson and Sameer Agarwal Department of Computer Siene and Engineering University of California, San Diego La Jolla, CA 9193-114 Abstrat Many tasks involving

More information

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc. Improvement of low illumination image enhancement algorithm based on physical mode

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc. Improvement of low illumination image enhancement algorithm based on physical mode [Type text] [Type text] [Type text] ISSN : 0974-7435 Volume 10 Issue 22 BioTehnology 2014 An Indian Journal FULL PAPER BTAIJ, 10(22), 2014 [13995-14001] Improvement of low illumination image enhanement

More information

Robust Multithreaded Object Tracker through Occlusions for Spatial Augmented Reality

Robust Multithreaded Object Tracker through Occlusions for Spatial Augmented Reality ETRI Journal, Volume 40, Number 2, Aril, 2018 246 Robust Multithreaded Objet Traker through Olusions for Satial Augmented Reality Ahyun Lee and Insung Jang A satial augmented reality (SAR) system enables

More information

Cluster-Based Cumulative Ensembles

Cluster-Based Cumulative Ensembles Cluster-Based Cumulative Ensembles Hanan G. Ayad and Mohamed S. Kamel Pattern Analysis and Mahine Intelligene Lab, Eletrial and Computer Engineering, University of Waterloo, Waterloo, Ontario N2L 3G1,

More information

An Efficient VLSI Architecture for Adaptive Rank Order Filter for Image Noise Removal

An Efficient VLSI Architecture for Adaptive Rank Order Filter for Image Noise Removal International Journal of Information and Electronics Engineering, Vol. 1, No. 1, July 011 An Efficient VLSI Architecture for Adative Rank Order Filter for Image Noise Removal M. C Hanumantharaju, M. Ravishankar,

More information

A rich discrete labeling scheme for line drawings of curved objects

A rich discrete labeling scheme for line drawings of curved objects A rih disrete labeling sheme for line drawings of urved objets Martin C. Cooer, IRIT, University of Toulouse III, 31062 Toulouse, Frane ooer@irit.fr Abstrat We resent a disrete labeling sheme for line

More information

Detecting Outliers in High-Dimensional Datasets with Mixed Attributes

Detecting Outliers in High-Dimensional Datasets with Mixed Attributes Deteting Outliers in High-Dimensional Datasets with Mixed Attributes A. Koufakou, M. Georgiopoulos, and G.C. Anagnostopoulos 2 Shool of EECS, University of Central Florida, Orlando, FL, USA 2 Dept. of

More information

Performance Improvement of TCP on Wireless Cellular Networks by Adaptive FEC Combined with Explicit Loss Notification

Performance Improvement of TCP on Wireless Cellular Networks by Adaptive FEC Combined with Explicit Loss Notification erformane Improvement of TC on Wireless Cellular Networks by Adaptive Combined with Expliit Loss tifiation Masahiro Miyoshi, Masashi Sugano, Masayuki Murata Department of Infomatis and Mathematial Siene,

More information

Batch Auditing for Multiclient Data in Multicloud Storage

Batch Auditing for Multiclient Data in Multicloud Storage Advaned Siene and Tehnology Letters, pp.67-73 http://dx.doi.org/0.4257/astl.204.50. Bath Auditing for Multilient Data in Multiloud Storage Zhihua Xia, Xinhui Wang, Xingming Sun, Yafeng Zhu, Peng Ji and

More information

Incremental Mining of Partial Periodic Patterns in Time-series Databases

Incremental Mining of Partial Periodic Patterns in Time-series Databases CERIAS Teh Report 2000-03 Inremental Mining of Partial Periodi Patterns in Time-series Dataases Mohamed G. Elfeky Center for Eduation and Researh in Information Assurane and Seurity Purdue University,

More information

A Robust Color Image Watermarking Using Maximum Wavelet-Tree Difference Scheme

A Robust Color Image Watermarking Using Maximum Wavelet-Tree Difference Scheme A Robust Color Image Watermarking Using Maximum Wavelet-Tree ifference Scheme Chung-Yen Su 1 and Yen-Lin Chen 1 1 epartment of Applied Electronics Technology, National Taiwan Normal University, Taipei,

More information

An Improved DCT Based Color Image Watermarking Scheme Xiangguang Xiong1, a

An Improved DCT Based Color Image Watermarking Scheme Xiangguang Xiong1, a International Symposium on Mechanical Engineering and Material Science (ISMEMS 2016) An Improved DCT Based Color Image Watermarking Scheme Xiangguang Xiong1, a 1 School of Big Data and Computer Science,

More information

Video Data and Sonar Data: Real World Data Fusion Example

Video Data and Sonar Data: Real World Data Fusion Example 14th International Conferene on Information Fusion Chiago, Illinois, USA, July 5-8, 2011 Video Data and Sonar Data: Real World Data Fusion Example David W. Krout Applied Physis Lab dkrout@apl.washington.edu

More information

Extracting Partition Statistics from Semistructured Data

Extracting Partition Statistics from Semistructured Data Extrating Partition Statistis from Semistrutured Data John N. Wilson Rihard Gourlay Robert Japp Mathias Neumüller Department of Computer and Information Sienes University of Strathlyde, Glasgow, UK {jnw,rsg,rpj,mathias}@is.strath.a.uk

More information

Acoustic Links. Maximizing Channel Utilization for Underwater

Acoustic Links. Maximizing Channel Utilization for Underwater Maximizing Channel Utilization for Underwater Aousti Links Albert F Hairris III Davide G. B. Meneghetti Adihele Zorzi Department of Information Engineering University of Padova, Italy Email: {harris,davide.meneghetti,zorzi}@dei.unipd.it

More information

KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION

KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION Cuiui Kang 1, Shengai Liao, Shiming Xiang 1, Chunhong Pan 1 1 National Laboratory of Pattern Reognition, Institute of Automation, Chinese

More information

Uplink Channel Allocation Scheme and QoS Management Mechanism for Cognitive Cellular- Femtocell Networks

Uplink Channel Allocation Scheme and QoS Management Mechanism for Cognitive Cellular- Femtocell Networks 62 Uplink Channel Alloation Sheme and QoS Management Mehanism for Cognitive Cellular- Femtoell Networks Kien Du Nguyen 1, Hoang Nam Nguyen 1, Hiroaki Morino 2 and Iwao Sasase 3 1 University of Engineering

More information

Smooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints

Smooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints Smooth Trajetory Planning Along Bezier Curve for Mobile Robots with Veloity Constraints Gil Jin Yang and Byoung Wook Choi Department of Eletrial and Information Engineering Seoul National University of

More information

-z c = c T - c T B B-1 A 1 - c T B B-1 b. x B B -1 A 0 B -1 b. (a) (b) Figure 1. Simplex Tableau in Matrix Form

-z c = c T - c T B B-1 A 1 - c T B B-1 b. x B B -1 A 0 B -1 b. (a) (b) Figure 1. Simplex Tableau in Matrix Form 3. he Revised Simple Method he LP min, s.t. A = b ( ),, an be represented by Figure (a) below. At any Simple step, with known and -, the Simple tableau an be represented by Figure (b) below. he minimum

More information

MULTI-SOURCE DEM EVALUATION AND INTEGRATION AT THE ANTARCTICA TRANSANTARCTIC MOUNTAINS PROJECT

MULTI-SOURCE DEM EVALUATION AND INTEGRATION AT THE ANTARCTICA TRANSANTARCTIC MOUNTAINS PROJECT MULTI-SOURCE DEM EVLUTION ND INTEGRTION T THE NTRCTIC TRNSNTRCTIC MOUNTINS PROJECT Yaron. Felus and Beata Csatho Byrd Polar Researh Center Sott Hall Room 8, 9 Carmak Road The Ohio State University Columbus,

More information

Figure 1. LBP in the field of texture analysis operators.

Figure 1. LBP in the field of texture analysis operators. L MEHODOLOGY he loal inary pattern (L) texture analysis operator is defined as a gray-sale invariant texture measure, derived from a general definition of texture in a loal neighorhood. he urrent form

More information

Using Augmented Measurements to Improve the Convergence of ICP

Using Augmented Measurements to Improve the Convergence of ICP Using Augmented Measurements to Improve the onvergene of IP Jaopo Serafin, Giorgio Grisetti Dept. of omputer, ontrol and Management Engineering, Sapienza University of Rome, Via Ariosto 25, I-0085, Rome,

More information

arxiv: v2 [cs.cv] 25 Nov 2015

arxiv: v2 [cs.cv] 25 Nov 2015 Pose-Guided Human Parsing with Dee-Learned Features Fangting Xia, Jun Zhu, Peng Wang, Alan Yuille University of California, Los Angeles arxiv:158.3881v2 [s.cv] 25 Nov 215 Abstrat Parsing human body into

More information

INTERPOLATED AND WARPED 2-D DIGITAL WAVEGUIDE MESH ALGORITHMS

INTERPOLATED AND WARPED 2-D DIGITAL WAVEGUIDE MESH ALGORITHMS Proeedings of the COST G-6 Conferene on Digital Audio Effets (DAFX-), Verona, Italy, Deember 7-9, INTERPOLATED AND WARPED -D DIGITAL WAVEGUIDE MESH ALGORITHMS Vesa Välimäki Lab. of Aoustis and Audio Signal

More information

A Dictionary based Efficient Text Compression Technique using Replacement Strategy

A Dictionary based Efficient Text Compression Technique using Replacement Strategy A based Effiient Text Compression Tehnique using Replaement Strategy Debashis Chakraborty Assistant Professor, Department of CSE, St. Thomas College of Engineering and Tehnology, Kolkata, 700023, India

More information

System-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications

System-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications System-Level Parallelism and hroughput Optimization in Designing Reonfigurable Computing Appliations Esam El-Araby 1, Mohamed aher 1, Kris Gaj 2, arek El-Ghazawi 1, David Caliga 3, and Nikitas Alexandridis

More information

3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT?

3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT? 3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT? Bernd Girod, Peter Eisert, Marus Magnor, Ekehard Steinbah, Thomas Wiegand Te {girod eommuniations Laboratory, University of Erlangen-Nuremberg

More information

AN EFFICIENT VIDEO WATERMARKING USING COLOR HISTOGRAM ANALYSIS AND BITPLANE IMAGE ARRAYS

AN EFFICIENT VIDEO WATERMARKING USING COLOR HISTOGRAM ANALYSIS AND BITPLANE IMAGE ARRAYS AN EFFICIENT VIDEO WATERMARKING USING COLOR HISTOGRAM ANALYSIS AND BITPLANE IMAGE ARRAYS G Prakash 1,TVS Gowtham Prasad 2, T.Ravi Kumar Naidu 3 1MTech(DECS) student, Department of ECE, sree vidyanikethan

More information

Pose-Guided Human Parsing by an AND/OR Graph Using Pose-Context Features

Pose-Guided Human Parsing by an AND/OR Graph Using Pose-Context Features Proeedings of the Thirtieth AAAI Conferene on Artifiial Intelligene (AAAI-16) Pose-Guided Human Parsing by an AND/OR Grah Using Pose-Context Features Fangting Xia and Jun Zhu and Peng Wang and Alan L.

More information

TUMOR DETECTION IN MRI BRAIN IMAGE SEGMENTATION USING PHASE CONGRUENCY MODIFIED FUZZY C MEAN ALGORITHM

TUMOR DETECTION IN MRI BRAIN IMAGE SEGMENTATION USING PHASE CONGRUENCY MODIFIED FUZZY C MEAN ALGORITHM TUMOR DETECTION IN MRI BRAIN IMAGE SEGMENTATION USING PHASE CONGRUENCY MODIFIED FUZZY C MEAN ALGORITHM M. Murugeswari 1, M.Gayathri 2 1 Assoiate Professor, 2 PG Sholar 1,2 K.L.N College of Information

More information

Australian Journal of Basic and Applied Sciences. A new Divide and Shuffle Based algorithm of Encryption for Text Message

Australian Journal of Basic and Applied Sciences. A new Divide and Shuffle Based algorithm of Encryption for Text Message ISSN:1991-8178 Australian Journal of Basi and Applied Sienes Journal home page: www.ajbasweb.om A new Divide and Shuffle Based algorithm of Enryption for Text Message Dr. S. Muthusundari R.M.D. Engineering

More information

DoS-Resistant Broadcast Authentication Protocol with Low End-to-end Delay

DoS-Resistant Broadcast Authentication Protocol with Low End-to-end Delay DoS-Resistant Broadast Authentiation Protool with Low End-to-end Delay Ying Huang, Wenbo He and Klara Nahrstedt {huang, wenbohe, klara}@s.uiu.edu Department of Computer Siene University of Illinois at

More information

Outline: Software Design

Outline: Software Design Outline: Software Design. Goals History of software design ideas Design priniples Design methods Life belt or leg iron? (Budgen) Copyright Nany Leveson, Sept. 1999 A Little History... At first, struggling

More information

Establishing Secure Ethernet LANs Using Intelligent Switching Hubs in Internet Environments

Establishing Secure Ethernet LANs Using Intelligent Switching Hubs in Internet Environments Establishing Seure Ethernet LANs Using Intelligent Swithing Hubs in Internet Environments WOEIJIUNN TSAUR AND SHIJINN HORNG Department of Eletrial Engineering, National Taiwan University of Siene and Tehnology,

More information

Capturing Large Intra-class Variations of Biometric Data by Template Co-updating

Capturing Large Intra-class Variations of Biometric Data by Template Co-updating Capturing Large Intra-lass Variations of Biometri Data by Template Co-updating Ajita Rattani University of Cagliari Piazza d'armi, Cagliari, Italy ajita.rattani@diee.unia.it Gian Lua Marialis University

More information

Transition Detection Using Hilbert Transform and Texture Features

Transition Detection Using Hilbert Transform and Texture Features Amerian Journal of Signal Proessing 1, (): 35-4 DOI: 1.593/.asp.1.6 Transition Detetion Using Hilbert Transform and Texture Features G. G. Lashmi Priya *, S. Domni Department of Computer Appliations, National

More information

A scheme for racquet sports video analysis with the combination of audio-visual information

A scheme for racquet sports video analysis with the combination of audio-visual information A sheme for raquet sports video analysis with the ombination of audio-visual information Liyuan Xing a*, Qixiang Ye b, Weigang Zhang, Qingming Huang a and Hua Yu a a Graduate Shool of the Chinese Aadamy

More information

Cross-layer Resource Allocation on Broadband Power Line Based on Novel QoS-priority Scheduling Function in MAC Layer

Cross-layer Resource Allocation on Broadband Power Line Based on Novel QoS-priority Scheduling Function in MAC Layer Communiations and Networ, 2013, 5, 69-73 http://dx.doi.org/10.4236/n.2013.53b2014 Published Online September 2013 (http://www.sirp.org/journal/n) Cross-layer Resoure Alloation on Broadband Power Line Based

More information

Drawing lines. Naïve line drawing algorithm. drawpixel(x, round(y)); double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx; double y = y0;

Drawing lines. Naïve line drawing algorithm. drawpixel(x, round(y)); double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx; double y = y0; Naïve line drawing algorithm // Connet to grid points(x0,y0) and // (x1,y1) by a line. void drawline(int x0, int y0, int x1, int y1) { int x; double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx;

More information

Gray Codes for Reflectable Languages

Gray Codes for Reflectable Languages Gray Codes for Refletable Languages Yue Li Joe Sawada Marh 8, 2008 Abstrat We lassify a type of language alled a refletable language. We then develop a generi algorithm that an be used to list all strings

More information

Weak Dependence on Initialization in Mixture of Linear Regressions

Weak Dependence on Initialization in Mixture of Linear Regressions Proeedings of the International MultiConferene of Engineers and Computer Sientists 8 Vol I IMECS 8, Marh -6, 8, Hong Kong Weak Dependene on Initialization in Mixture of Linear Regressions Ryohei Nakano

More information

Improved Vehicle Classification in Long Traffic Video by Cooperating Tracker and Classifier Modules

Improved Vehicle Classification in Long Traffic Video by Cooperating Tracker and Classifier Modules Improved Vehile Classifiation in Long Traffi Video by Cooperating Traker and Classifier Modules Brendan Morris and Mohan Trivedi University of California, San Diego San Diego, CA 92093 {b1morris, trivedi}@usd.edu

More information

Mining Association rules with Dynamic and Collective Support Thresholds

Mining Association rules with Dynamic and Collective Support Thresholds Mining Association rules with Dynamic and Collective Suort Thresholds C S Kanimozhi Selvi and A Tamilarasi Abstract Mining association rules is an imortant task in data mining. It discovers the hidden,

More information

BeautyGAN: Instance-level Facial Makeup Transfer with Deep Generative Adversarial Network

BeautyGAN: Instance-level Facial Makeup Transfer with Deep Generative Adversarial Network eautygan: Instane-level Faial Makeu Transfer with Dee Generative Adversarial Network Tingting Li Tsinghua-erkeley Shenzhen Institute, Tsinghua University litt.thu@foxmail.om Ruihe Qian Institue of Information

More information

An Alternative Approach to the Fuzzifier in Fuzzy Clustering to Obtain Better Clustering Results

An Alternative Approach to the Fuzzifier in Fuzzy Clustering to Obtain Better Clustering Results An Alternative Approah to the Fuzziier in Fuzzy Clustering to Obtain Better Clustering Results Frank Klawonn Department o Computer Siene University o Applied Sienes BS/WF Salzdahlumer Str. 46/48 D-38302

More information

特集 Road Border Recognition Using FIR Images and LIDAR Signal Processing

特集 Road Border Recognition Using FIR Images and LIDAR Signal Processing デンソーテクニカルレビュー Vol. 15 2010 特集 Road Border Reognition Using FIR Images and LIDAR Signal Proessing 高木聖和 バーゼル ファルディ Kiyokazu TAKAGI Basel Fardi ヘンドリック ヴァイゲル Hendrik Weigel ゲルド ヴァニーリック Gerd Wanielik This paper

More information

4. Principles of Picture taking 4 hours

4. Principles of Picture taking 4 hours Leture 4 - - 0/3/003 Conet Hell/Pfeiffer February 003 4. Priniles of Piture taking 4 hours Aim: riniles of iture taking (normal ase, onvergent for oint measurements, flight lanning) flight lanning (arameter,

More information

To Do. Assignment Overview. Outline. Mesh Viewer (3.1) Mesh Connectivity (3.2) Advanced Computer Graphics (Spring 2013)

To Do. Assignment Overview. Outline. Mesh Viewer (3.1) Mesh Connectivity (3.2) Advanced Computer Graphics (Spring 2013) daned Computer Graphis (Spring 23) CS 283, Leture 5: Mesh Simplifiation Rai Ramamoorthi http://inst.ees.berkeley.edu/~s283/sp3 To Do ssignment, Due Feb 22 Start reading and working on it now. This leture

More information

An Efficient Coding Method for Coding Region-of-Interest Locations in AVS2

An Efficient Coding Method for Coding Region-of-Interest Locations in AVS2 An Efficient Coding Method for Coding Region-of-Interest Locations in AVS2 Mingliang Chen 1, Weiyao Lin 1*, Xiaozhen Zheng 2 1 Deartment of Electronic Engineering, Shanghai Jiao Tong University, China

More information

Partial Character Decoding for Improved Regular Expression Matching in FPGAs

Partial Character Decoding for Improved Regular Expression Matching in FPGAs Partial Charater Deoding for Improved Regular Expression Mathing in FPGAs Peter Sutton Shool of Information Tehnology and Eletrial Engineering The University of Queensland Brisbane, Queensland, 4072, Australia

More information

Measurement of the stereoscopic rangefinder beam angular velocity using the digital image processing method

Measurement of the stereoscopic rangefinder beam angular velocity using the digital image processing method Measurement of the stereosopi rangefinder beam angular veloity using the digital image proessing method ROMAN VÍTEK Department of weapons and ammunition University of defense Kouniova 65, 62 Brno CZECH

More information

New Fuzzy Object Segmentation Algorithm for Video Sequences *

New Fuzzy Object Segmentation Algorithm for Video Sequences * JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 521-537 (2008) New Fuzzy Obet Segmentation Algorithm for Video Sequenes * KUO-LIANG CHUNG, SHIH-WEI YU, HSUEH-JU YEH, YONG-HUAI HUANG AND TA-JEN YAO Department

More information

Define - starting approximation for the parameters (p) - observational data (o) - solution criterion (e.g. number of iterations)

Define - starting approximation for the parameters (p) - observational data (o) - solution criterion (e.g. number of iterations) Global Iterative Solution Distributed proessing of the attitude updating L. Lindegren (21 May 2001) SAG LL 37 Abstrat. The attitude updating algorithm given in GAIA LL 24 (v. 2) is modified to allow distributed

More information

A NEW ROBUST IMAGE WATERMARKING SCHEME BASED ON DWT WITH SVD

A NEW ROBUST IMAGE WATERMARKING SCHEME BASED ON DWT WITH SVD A NEW ROBUST IMAGE WATERMARKING SCHEME BASED ON WITH S.Shanmugaprabha PG Scholar, Dept of Computer Science & Engineering VMKV Engineering College, Salem India N.Malmurugan Director Sri Ranganathar Institute

More information

Approximate logic synthesis for error tolerant applications

Approximate logic synthesis for error tolerant applications Approximate logi synthesis for error tolerant appliations Doohul Shin and Sandeep K. Gupta Eletrial Engineering Department, University of Southern California, Los Angeles, CA 989 {doohuls, sandeep}@us.edu

More information

Reading Object Code. A Visible/Z Lesson

Reading Object Code. A Visible/Z Lesson Reading Objet Code A Visible/Z Lesson The Idea: When programming in a high-level language, we rarely have to think about the speifi ode that is generated for eah instrution by a ompiler. But as an assembly

More information