Transform Coding. Transform Coding Principle
|
|
- Lesley Powell
- 5 years ago
- Views:
Transcription
1 Transform Codng Prncple of block-wse transform codng Propertes of orthonormal transforms Dscrete cosne transform (DCT) Bt allocaton for transform coeffcents Entropy codng of transform coeffcents Typcal codng artfacts Fast mplementaton of the DCT Thomas Wegand: Dgtal Image Communcaton Transform Codng - Transform Codng Prncple Structure u Τ U Quantzer V Τ v Transform coder (Τα) / decoder (βτ ) structure u U V Τ α β Τ v Insert entropy codng (γ) and transmsson channel u Τ U b b V α γ channel γ β Τ v Thomas Wegand: Dgtal Image Communcaton Transform Codng -
2 Transform Codng and Quantzaton u U V v u Τ U V Q U V Τ u v v Transformaton of vector u=(u,u,,u )ntou=(u,u,,u ) Quantzer Q maybe appled to coeffcents U separately (scalar quantzaton: low complexty) jontly (vector quantzaton, may requre hgh complexty, explotng of redundancy between U ) Inverse transformaton of vector V=(V,V,,V )ntov=(v,v,,v ) Why should we use a transform? Thomas Wegand: Dgtal Image Communcaton Transform Codng - 3 Geometrcal Interpretaton A lnear transform can decorrelate random varables An orthonormal transform s a rotaton of the sgnal vector around the orgn Parseval s Theorem holds for orthonormal transforms DC bass functon U u U u u u = = T = u AC bass functon U U 3 Tu U = = = = Thomas Wegand: Dgtal Image Communcaton Transform Codng -
3 Propertes of Orthonormal Transforms Forward transform transform coeffcents U=Tu Transform matrx of sze x nput sgnal block of sze Orthonormal transform property: nverse transform u=t U=TT U Lnearty: u s represented as lnear combnaton of bass functons Thomas Wegand: Dgtal Image Communcaton Transform Codng - 5 Transform Codng of Images Explot horzontal and vertcal dependences by processng blocks orgnal mage reconstructed mage Orgnal mage block Reconstructed mage block Transform T Transform coeffcents Quantzaton Entropy Codng Transmsson Inverse transform T - Quantzed transform coeffcents Thomas Wegand: Dgtal Image Communcaton Transform Codng -
4 Separable Orthonormal Transforms, I Problem: sze of vectors * (typcal value of : 8) An orthonormal transform s separable, f the transform of a sgnal block of sze *-can be expressed by U=TuT * transform coeffcents Orthonormal transform matrx of sze * * block of nput sgnal The nverse transform s u= TT UT Great practcal mportance: transform requres matrx multplcatons of sze * nstead one multplcaton of a vector of sze* wthamatrxofsze * Reducton of the complexty from O( )too( 3 ) Thomas Wegand: Dgtal Image Communcaton Transform Codng - 7 Separable Orthonormal Transforms, II Separable -D transform s realzed by two -D transforms along rows and columns of the sgnal block u column-wse Tu row-wse TuTT -transform -transform * block of pxels * block of transform coeffcents Thomas Wegand: Dgtal Image Communcaton Transform Codng - 8
5 Crtera for the Selecton of a Partcular Transform Decorrelaton, energy concentraton KLT, DCT, Transform should provde energy compacton Vsually pleasant bass functons pseudo-random-nose, m-sequences, lapped transforms, Quantzaton errors make bass functons vsble Low complexty of computaton Separablty n -D Smple quantzaton of transform coeffcents Thomas Wegand: Dgtal Image Communcaton Transform Codng - 9 Karhunen Loève Transform (KLT) Decorrelate elements of vector u R u =E{uu T }, U=Tu, R U =E{UU T }=TE{uu T }T T = TR u T T =dag{α } Bass functons are egenvectors of the covarance matrx of the nput sgnal. KLT acheves optmum energy concentraton. Dsadvantages: - KLT dependent on sgnal statstcs - KLT not separable for mage blocks - Transform matrx cannot be factored nto sparse matrces. Thomas Wegand: Dgtal Image Communcaton Transform Codng -
6 Comparson of Varous Transforms, I Comparson of D bass functons for block sze =8 () Karhunen Loève transform (98/9) () Haar transform (9) (3) Walsh-Hadamard transform (93) () Slant transform (Enomoto, Shbata, 97) () () (3) () (5) (5) Dscrete CosneTransform (DCT) (Ahmet, atarajan, Rao, 97) Thomas Wegand: Dgtal Image Communcaton Transform Codng - Comparson of Varous Transforms, II Energy concentraton measured for typcal natural mages, block sze x3 (Lohscheller) KLT s optmum DCT performs only slghtly worse than KLT Thomas Wegand: Dgtal Image Communcaton Transform Codng -
7 DCT - Type II-DCT of blocksze M x M - D bass functons of the DCT: s defned by transform matrx A contanng elements π (k + ) ak = α cos M k, =...( M ) wth α = M α = M Thomas Wegand: Dgtal Image Communcaton Transform Codng - 3 Dscrete Cosne Transform and Dscrete Fourer Transform Transform codng of mages usng the Dscrete Fourer Transform (DFT): edge For statonary mage statstcs, the energy folded concentraton propertes of the DFT converge aganst those of the KLT for large block szes. Problem of blockwse DFT codng: blockng effects DFT of larger symmetrc block -> DCT due to crcular topology of the DFT and Gbbs phenomena. pxel folded Remedy: reflect mage at block boundares Thomas Wegand: Dgtal Image Communcaton Transform Codng -
8 Hstograms of DCT Coeffcents: Image: Lena, 5x5 pxel DCT: 8x8 pxels DCT coeffcents are approxmately dstrbuted lke Laplacan pdf Thomas Wegand: Dgtal Image Communcaton Transform Codng - 5 Dstrbuton of the DCT Coeffcents Central Lmt Theorem requests DCT coeffcents to be Gaussan dstrbuted Model varance of Gaussan DCT coeffcents dstrbuton as random varable (Lam & Goodmann ) u pu ( σ ) = exp πσ σ Usng condtonal probablty pu ( ) = pu ( σ ) p( σ ) dσ Thomas Wegand: Dgtal Image Communcaton Transform Codng -
9 Dstrbuton of the Varance Exponental Dstrbuton { } p( σ ) = µ exp µσ Thomas Wegand: Dgtal Image Communcaton Transform Codng - 7 Dstrbuton of the DCT Coeffcents pu ( ) = pu ( σ ) p( σ ) dσ u = exp µ exp{ µσ } dσ πσ σ u = µ exp µσ dσ π σ π µ u = µ exp π µ µ = exp { µ u } Laplacan Dstrbuton Thomas Wegand: Dgtal Image Communcaton Transform Codng - 8
10 Bt Allocaton for Transform Coeffcents I Problem: dvde bt-rate R among transform coeffcents such that resultng dstorton D s mnmzed. DR ( ) = D ( R ), s.t. R R = = Average Average dstorton rate Dstorton contrbuted by coeffcent Rate for coeffcent Approach: mnmze Lagrangan cost functon d dd ( )! R D( R) + λ R = + λ= dr dr = = Soluton: Pareto condton dd( R) = λ dr Move bts from coeffcent wth small dstorton reducton per bt to coeffcent wth larger dstorton reducton per bt Thomas Wegand: Dgtal Image Communcaton Transform Codng - 9 Bt Allocaton for Transform Coeffcents II Assumpton: hgh rate approxmatons are vald dd ( R ) D R aσ a σ = λ R R ( ), ln dr aln R σ logσ + log R logσ logσ R log R λ + = σ + ( σ ) = = aln ln logσ + log = log a R R + log = = λ = λ log σ σ Operatonal Dstorton Rate functon for transform codng: DR ( ) = D( R) = = a σ σ σ σ log a R R a R σ = = = = Thomas Wegand: Dgtal Image Communcaton Transform Codng - Geometrc mean: σ = ( σ )
11 Entropy Codng of Transform Coeffcents Prevous dervaton assumes: AC coeffcents are very lkely to be zero Orderng of the transform coeffcents by zg-zag-scan Desgn Huffman code for event: # of zeros and coeffcent value Arthmetc code maybe smpler Probablty that coeffcent s not zero when quantzng wth: V =*round(u /).5 R 3 σ max[(log ),] = D bt DC coeffcent Thomas Wegand: Dgtal Image Communcaton Transform Codng - Entropy Codng of Transform Coeffcents II Encoder Orgnal 8x8 block DCT α zg-zag-scan ( EOB) run-level codng Mean of block: 85 (,3) (,) (,) (,) (,) (,-) (,) (,) (,) (,-3) (,) (,-) (,) (,-) (,-) (,-) (,) (9,-) (,-) (EOB) entropy codng & transmsson Thomas Wegand: Dgtal Image Communcaton Transform Codng -
12 Entropy Codng of Transform Coeffcents III Decoder transmsson Mean of block: 85 (,3) (,) (,) (,) (,) (,- ) (,) (,) (,) (,-3) (,) (,-) (,) (,-) (,-) (,-) (,) (9,-) (,-) (EOB) Inverse zg-zagscan run-leveldecodng ( EOB) Scalng and nverse DCT: β Reconstructed 8x8 block Thomas Wegand: Dgtal Image Communcaton Transform Codng - 3 Detal n a Block vs. DCT Coeffcents Transmtted mage block DCT coeffcents quantzed DCT block of block coeffcents reconstructed of block from quantzed coeffcents Thomas Wegand: Dgtal Image Communcaton Transform Codng -
13 Typcal DCT Codng Artfacts DCT codng wth ncreasngly coarse quantzaton, block sze 8x8 quantzer step sze quantzer step sze quantzer step sze for AC coeffcents: 5 for AC coeffcents: for AC coeffcents: Thomas Wegand: Dgtal Image Communcaton Transform Codng - 5 Influence of DCT Block Sze Effcency as a functon of blocksze x, measured for 8 bt Quantzaton n the orgnal doman and equvalent quantzaton n the transform doman. = Memoryless entropy of orgnal sgnal mean entropy of transform coeffcents Block sze 8x8 s a good compromse. Thomas Wegand: Dgtal Image Communcaton Transform Codng -
14 Fast DCT Algorthm I DCT matrx factored nto sparse matrces (Ara, Agu, and akajma; 988): y = M x = S P M M M 3 M M 5 M x S = s s s s3 s s5 s s7 P = M = - - M = - - M = 3 C -C C -C -C C M = - M = M = Thomas Wegand: Dgtal Image Communcaton Transform Codng - 7 Fast DCT Algorthm II Sgnal flow graph for fast (scaled) 8-DCT accordng to Ara, Agu, akajma: x s y scalng x s y x x 3 x x 5 a a a 3 s s s 5 s y y y 5 y only Multplcatons (drect matrx multplcaton: multplcatons) x a x 7 a 5 s 7 s 3 y 7 y 3 Multplcaton: u m m u Addton: u v u v u+v u-v a= C a = C C a3 = C a = C+ C a5 = C s = sk = ; k =... 7 CK CK = cos(ks ) Thomas Wegand: Dgtal Image Communcaton Transform Codng - 8
15 Transform Codng: Summary Orthonormal transform: rotaton of coordnate system n sgnal space Purpose of transform: decorrelaton, energy concentraton KLT s optmum, but sgnal dependent and, hence, wthout a fast algorthm DCT shows reduced blockng artfacts compared to DFT Bt allocaton proportonal to logarthm of varance Threshold codng + zg-zag-scan + 8x8 block sze s wdely used today (e.g. JPEG, MPEG, ITU-T H.3) Fast algorthm for scaled 8-DCT: 5 multplcatons, 9 addtons Thomas Wegand: Dgtal Image Communcaton Transform Codng - 9
Transform Coding. Transform Coding Principle
Transform Coding Principle of block-wise transform coding Properties of orthonormal transforms Discrete cosine transform (DCT) Bit allocation for transform coefficients Entropy coding of transform coefficients
More informationTransform coding - topics. Principle of block-wise transform coding
Transform coding - topics Principle of block-wise transform coding Properties of orthonormal transforms Discrete cosine transform (DCT) Bit allocation for transform Threshold coding Typical coding artifacts
More informationVQ widely used in coding speech, image, and video
at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationLossy Compression. Compromise accuracy of reconstruction for increased compression.
Lossy Compresson Compromse accuracy of reconstructon for ncreased compresson. The reconstructon s usually vsbly ndstngushable from the orgnal mage. Typcally, one can get up to 0:1 compresson wth almost
More informationPulse Coded Modulation
Pulse Coded Modulaton PCM (Pulse Coded Modulaton) s a voce codng technque defned by the ITU-T G.711 standard and t s used n dgtal telephony to encode the voce sgnal. The frst step n the analog to dgtal
More informationFlexible Quantization
wb 06/02/21 1 Flexble Quantzaton Bastaan Klejn KTH School of Electrcal Engneerng Stocholm wb 06/02/21 2 Overvew Motvaton for codng technologes Basc quantzaton and codng Hgh-rate quantzaton theory wb 06/02/21
More informationComposite Hypotheses testing
Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationError Probability for M Signals
Chapter 3 rror Probablty for M Sgnals In ths chapter we dscuss the error probablty n decdng whch of M sgnals was transmtted over an arbtrary channel. We assume the sgnals are represented by a set of orthonormal
More informationTutorial 2. COMP4134 Biometrics Authentication. February 9, Jun Xu, Teaching Asistant
Tutoral 2 COMP434 ometrcs uthentcaton Jun Xu, Teachng sstant csjunxu@comp.polyu.edu.hk February 9, 207 Table of Contents Problems Problem : nswer the questons Problem 2: Power law functon Problem 3: Convoluton
More informationLecture 3: Shannon s Theorem
CSE 533: Error-Correctng Codes (Autumn 006 Lecture 3: Shannon s Theorem October 9, 006 Lecturer: Venkatesan Guruswam Scrbe: Wdad Machmouch 1 Communcaton Model The communcaton model we are usng conssts
More informationChapter 7 Channel Capacity and Coding
Chapter 7 Channel Capacty and Codng Contents 7. Channel models and channel capacty 7.. Channel models Bnary symmetrc channel Dscrete memoryless channels Dscrete-nput, contnuous-output channel Waveform
More informationFourier Transform. Additive noise. Fourier Tansform. I = S + N. Noise doesn t depend on signal. We ll consider:
Flterng Announcements HW2 wll be posted later today Constructng a mosac by warpng mages. CSE252A Lecture 10a Flterng Exampel: Smoothng by Averagng Kernel: (From Bll Freeman) m=2 I Kernel sze s m+1 by m+1
More informationChapter 8 SCALAR QUANTIZATION
Outlne Chapter 8 SCALAR QUANTIZATION Yeuan-Kuen Lee [ CU, CSIE ] 8.1 Overvew 8. Introducton 8.4 Unform Quantzer 8.5 Adaptve Quantzaton 8.6 Nonunform Quantzaton 8.7 Entropy-Coded Quantzaton Ch 8 Scalar
More informationA NEW DISCRETE WAVELET TRANSFORM
A NEW DISCRETE WAVELET TRANSFORM ALEXANDRU ISAR, DORINA ISAR Keywords: Dscrete wavelet, Best energy concentraton, Low SNR sgnals The Dscrete Wavelet Transform (DWT) has two parameters: the mother of wavelets
More informationSTATISTICAL DISTRIBUTIONS OF DISCRETE WALSH HADAMARD TRANSFORM COEFFICIENTS OF NATURAL IMAGES
STATISTICAL DISTRIBUTIOS OF DISCRETE WALSH HADAMARD TRASFORM COEFFICIETS OF ATURAL IMAGES Vjay Kumar ath and Deepka Hazarka Department o Electroncs and Communcaton Engneerng, School o Engneerng, Tezpur
More informationChapter 7 Channel Capacity and Coding
Wreless Informaton Transmsson System Lab. Chapter 7 Channel Capacty and Codng Insttute of Communcatons Engneerng atonal Sun Yat-sen Unversty Contents 7. Channel models and channel capacty 7.. Channel models
More informationLec 12 Rate-Distortion Optimization (RDO) in Video Coding-II
Sprng 07: Multmeda Communcaton Lec ate-dstorton Optmzaton (DO) n Vdeo Codng-II Zhu L Course Web: http://l.web.umkc.edu/lzhu/ Z. L Multmeda Communcaton, Sprng 07 p. Outlne Lec ecap Lagrangan Method HW-3
More informationCommunication with AWGN Interference
Communcaton wth AWG Interference m {m } {p(m } Modulator s {s } r=s+n Recever ˆm AWG n m s a dscrete random varable(rv whch takes m wth probablty p(m. Modulator maps each m nto a waveform sgnal s m=m
More informationDigital Signal Processing
Dgtal Sgnal Processng Dscrete-tme System Analyss Manar Mohasen Offce: F8 Emal: manar.subh@ut.ac.r School of IT Engneerng Revew of Precedent Class Contnuous Sgnal The value of the sgnal s avalable over
More informationEGR 544 Communication Theory
EGR 544 Communcaton Theory. Informaton Sources Z. Alyazcoglu Electrcal and Computer Engneerng Department Cal Poly Pomona Introducton Informaton Source x n Informaton sources Analog sources Dscrete sources
More informationReport on Image warping
Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.
More informationCOMPUTATIONALLY EFFICIENT WAVELET AFFINE INVARIANT FUNCTIONS FOR SHAPE RECOGNITION. Erdem Bala, Dept. of Electrical and Computer Engineering,
COMPUTATIONALLY EFFICIENT WAVELET AFFINE INVARIANT FUNCTIONS FOR SHAPE RECOGNITION Erdem Bala, Dept. of Electrcal and Computer Engneerng, Unversty of Delaware, 40 Evans Hall, Newar, DE, 976 A. Ens Cetn,
More informationEntropy Coding. A complete entropy codec, which is an encoder/decoder. pair, consists of the process of encoding or
Sgnal Compresson Sgnal Compresson Entropy Codng Entropy codng s also known as zero-error codng, data compresson or lossless compresson. Entropy codng s wdely used n vrtually all popular nternatonal multmeda
More informationDigital Modems. Lecture 2
Dgtal Modems Lecture Revew We have shown that both Bayes and eyman/pearson crtera are based on the Lkelhood Rato Test (LRT) Λ ( r ) < > η Λ r s called observaton transformaton or suffcent statstc The crtera
More informationLec 07 Transforms and Quantization II
Outlne CS/EE 559 / ENG 4 Specal Topcs (784, 785, 78) Lec 7 Transforms and Quantzaton II Lecture 6 Re-Cap Scalar Quantzaton Vector Quantzaton Zhu L Course We: http://l.we.umkc.edu/lzhu/teachng/6sp.vdeo-communcaton/man.html
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationLec 13 Review of Video Coding
CS/EE 5590 / ENG 401 Specal Topcs (17804, 17815, 17803) Lec 13 Revew of Vdeo Codng Zhu L Course Web: http://l.web.umkc.edu/lzhu/teachng/016sp.vdeo-communcaton/man.html Z. L Multmeda Communcaton, 016 Sprng
More informationGEMINI GEneric Multimedia INdexIng
GEMINI GEnerc Multmeda INdexIng Last lecture, LSH http://www.mt.edu/~andon/lsh/ Is there another possble soluton? Do we need to perform ANN? 1 GEnerc Multmeda INdexIng dstance measure Sub-pattern Match
More informationSome Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)
Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998
More informationLec 13 Review of Video Coding
Sprng 017 Multmeda Communcaton Lec 13 Revew of Vdeo Codng Zhu L Course Web: http://l.web.umkc.edu/lzhu Z. L Multmeda Communcaton, Sprng 017 p.1 Outlne About the Quz Monday, 03/09, 5:30-6:45@Haag 309 Format:
More informationWhat would be a reasonable choice of the quantization step Δ?
CE 108 HOMEWORK 4 EXERCISE 1. Suppose you are samplng the output of a sensor at 10 KHz and quantze t wth a unform quantzer at 10 ts per sample. Assume that the margnal pdf of the sgnal s Gaussan wth mean
More informationLossless Compression Performance of a Simple Counter- Based Entropy Coder
ITB J. ICT, Vol. 5, No. 3, 20, 73-84 73 Lossless Compresson Performance of a Smple Counter- Based Entropy Coder Armen Z. R. Lang,2 ITB Research Center on Informaton and Communcaton Technology 2 Informaton
More informationAsymptotic Quantization: A Method for Determining Zador s Constant
Asymptotc Quantzaton: A Method for Determnng Zador s Constant Joyce Shh Because of the fnte capacty of modern communcaton systems better methods of encodng data are requred. Quantzaton refers to the methods
More informationA linear imaging system with white additive Gaussian noise on the observed data is modeled as follows:
Supplementary Note Mathematcal bacground A lnear magng system wth whte addtve Gaussan nose on the observed data s modeled as follows: X = R ϕ V + G, () where X R are the expermental, two-dmensonal proecton
More informationNatural Images, Gaussian Mixtures and Dead Leaves Supplementary Material
Natural Images, Gaussan Mxtures and Dead Leaves Supplementary Materal Danel Zoran Interdscplnary Center for Neural Computaton Hebrew Unversty of Jerusalem Israel http://www.cs.huj.ac.l/ danez Yar Wess
More informationCSE4210 Architecture and Hardware for DSP
4210 Archtecture and Hardware for DSP Lecture 1 Introducton & Number systems Admnstratve Stuff 4210 Archtecture and Hardware for DSP Text: VLSI Dgtal Sgnal Processng Systems: Desgn and Implementaton. K.
More informationWhy Bayesian? 3. Bayes and Normal Models. State of nature: class. Decision rule. Rev. Thomas Bayes ( ) Bayes Theorem (yes, the famous one)
Why Bayesan? 3. Bayes and Normal Models Alex M. Martnez alex@ece.osu.edu Handouts Handoutsfor forece ECE874 874Sp Sp007 If all our research (n PR was to dsappear and you could only save one theory, whch
More informationDFT with Planewaves pseudopotential accuracy (LDA, PBE) Fast time to solution 1 step in minutes (not hours!!!) to be useful for MD
LLNL-PRES-673679 Ths work was performed under the auspces of the U.S. Department of Energy by under contract DE-AC52-07NA27344. Lawrence Lvermore Natonal Securty, LLC Sequoa, IBM BGQ, 1,572,864 cores O(N)
More informationThe Gaussian classifier. Nuno Vasconcelos ECE Department, UCSD
he Gaussan classfer Nuno Vasconcelos ECE Department, UCSD Bayesan decson theory recall that we have state of the world X observatons g decson functon L[g,y] loss of predctng y wth g Bayes decson rule s
More informationMultigradient for Neural Networks for Equalizers 1
Multgradent for Neural Netorks for Equalzers 1 Chulhee ee, Jnook Go and Heeyoung Km Department of Electrcal and Electronc Engneerng Yonse Unversty 134 Shnchon-Dong, Seodaemun-Ku, Seoul 1-749, Korea ABSTRACT
More informationA Self-embedding Robust Digital Watermarking Algorithm with Blind Detection
Sensors & Transducers Vol 77 Issue 8 August 04 pp 50-55 Sensors & Transducers 04 by IFSA Publshng S L http://wwwsensorsportalcom A Self-embeddng Robust Dgtal Watermarkng Algorthm wth Blnd Detecton Gong
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationStatistical pattern recognition
Statstcal pattern recognton Bayes theorem Problem: decdng f a patent has a partcular condton based on a partcular test However, the test s mperfect Someone wth the condton may go undetected (false negatve
More informationLecture 3: Dual problems and Kernels
Lecture 3: Dual problems and Kernels C4B Machne Learnng Hlary 211 A. Zsserman Prmal and dual forms Lnear separablty revsted Feature mappng Kernels for SVMs Kernel trck requrements radal bass functons SVM
More informationNovel Pre-Compression Rate-Distortion Optimization Algorithm for JPEG 2000
Novel Pre-Compresson Rate-Dstorton Optmzaton Algorthm for JPEG 2000 Yu-We Chang, Hung-Ch Fang, Chung-Jr Lan, and Lang-Gee Chen DSP/IC Desgn Laboratory, Graduate Insttute of Electroncs Engneerng Natonal
More informationConversion Scheme for DCT-domain Transcoding of MPEG-2 to H.264/AVC
Converson Scheme for DC-doman ranscodng of MPEG-2 to H.26/AVC Joo-kyong Lee 1, K-dong Chung 1 1, Dept. of Computer Engneerng, Pusan Natonal Unv., Jangjeon-dong, Geumjeong-gu, Busan, 609-735, Korea jklee@melon.cs.pusan.ac.kr,
More informationA Fast Fractal Image Compression Algorithm Using Predefined Values for Contrast Scaling
Proceedngs of the World Congress on Engneerng and Computer Scence 007 WCECS 007, October 4-6, 007, San Francsco, USA A Fast Fractal Image Compresson Algorthm Usng Predefned Values for Contrast Scalng H.
More informationMemory ecient adaptation of vector quantizers to time-varying channels
Sgnal Processng 83 (3) 59 58 www.elsever.com/locate/sgpro Memory ecent adaptaton of vector quantzers to tme-varyng channels orbert Gortz a;,jorg Klewer b a Insttute for Communcatons Engneerng (LT), Munch
More informationConversion Scheme for DCT-Domain Transcoding of MPEG-2 to H.264/AVC
Converson Scheme for DC-Doman ranscodng of MPEG-2 to H.26/AVC Joo-kyong Lee and K-dong Chung Dept. of Computer Engneerng, Pusan Natonal Unv., Jangjeon-dong, Geumjeong-gu, Busan, 609-735, Korea jklee@melon.cs.pusan.ac.kr,
More informationLecture 14 (03/27/18). Channels. Decoding. Preview of the Capacity Theorem.
Lecture 14 (03/27/18). Channels. Decodng. Prevew of the Capacty Theorem. A. Barg The concept of a communcaton channel n nformaton theory s an abstracton for transmttng dgtal (and analog) nformaton from
More informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationGaussian Conditional Random Field Network for Semantic Segmentation - Supplementary Material
Gaussan Condtonal Random Feld Networ for Semantc Segmentaton - Supplementary Materal Ravtea Vemulapall, Oncel Tuzel *, Mng-Yu Lu *, and Rama Chellappa Center for Automaton Research, UMIACS, Unversty of
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationCSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography
CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve
More informationSwitched Quasi-Logarithmic Quantizer with Golomb Rice Coding
http://dx.do.org/10.5755/j01.ee.3.4.1877 Swtched Quas-Logarthmc Quantzer wth Golomb Rce Codng Nkola Vucc 1, Zoran Perc 1, Mlan Dncc 1 1 Faculty of Electronc Engneerng, Unversty of Ns, Aleksandar Medvedev
More informationECE 472/572 - Digital Image Processing. Roadmap. Questions. Lecture 6 Geometric and Radiometric Transformation 09/27/11
ECE 472/572 - Dgtal Image Processng Lecture 6 Geometrc and Radometrc Transformaton 09/27/ Roadmap Introducton Image format vector vs. btmap IP vs. CV vs. CG HLIP vs. LLIP Image acquston Percepton Structure
More informationCOMPARING NOISE REMOVAL IN THE WAVELET AND FOURIER DOMAINS
COMPARING NOISE REMOVAL IN THE WAVELET AND FOURIER DOMAINS Robert J. Barsant, and Jordon Glmore Department of Electrcal and Computer Engneerng The Ctadel Charleston, SC, 29407 e-mal: robert.barsant@ctadel.edu
More informationLecture 12: Classification
Lecture : Classfcaton g Dscrmnant functons g The optmal Bayes classfer g Quadratc classfers g Eucldean and Mahalanobs metrcs g K Nearest Neghbor Classfers Intellgent Sensor Systems Rcardo Guterrez-Osuna
More informationInvariant deformation parameters from GPS permanent networks using stochastic interpolation
Invarant deformaton parameters from GPS permanent networks usng stochastc nterpolaton Ludovco Bag, Poltecnco d Mlano, DIIAR Athanasos Dermans, Arstotle Unversty of Thessalonk Outlne Startng hypotheses
More informationFingerprint Enhancement Based on Discrete Cosine Transform
Fngerprnt Enhancement Based on Dscrete Cosne Transform Suksan Jrachaweng and Vutpong Areekul Kasetsart Sgnal & Image Processng Laboratory (KSIP Lab), Department of Electrcal Engneerng, Kasetsart Unversty,
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016
U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and
More informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More informationApplication of Nonbinary LDPC Codes for Communication over Fading Channels Using Higher Order Modulations
Applcaton of Nonbnary LDPC Codes for Communcaton over Fadng Channels Usng Hgher Order Modulatons Rong-Hu Peng and Rong-Rong Chen Department of Electrcal and Computer Engneerng Unversty of Utah Ths work
More informationChapter 11: Simple Linear Regression and Correlation
Chapter 11: Smple Lnear Regresson and Correlaton 11-1 Emprcal Models 11-2 Smple Lnear Regresson 11-3 Propertes of the Least Squares Estmators 11-4 Hypothess Test n Smple Lnear Regresson 11-4.1 Use of t-tests
More informationDynamic Programming. Preview. Dynamic Programming. Dynamic Programming. Dynamic Programming (Example: Fibonacci Sequence)
/24/27 Prevew Fbonacc Sequence Longest Common Subsequence Dynamc programmng s a method for solvng complex problems by breakng them down nto smpler sub-problems. It s applcable to problems exhbtng the propertes
More informationMath Review. CptS 223 Advanced Data Structures. Larry Holder School of Electrical Engineering and Computer Science Washington State University
Math Revew CptS 223 dvanced Data Structures Larry Holder School of Electrcal Engneerng and Computer Scence Washngton State Unversty 1 Why do we need math n a data structures course? nalyzng data structures
More informationC/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1
C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned
More informationTime-Varying Systems and Computations Lecture 6
Tme-Varyng Systems and Computatons Lecture 6 Klaus Depold 14. Januar 2014 The Kalman Flter The Kalman estmaton flter attempts to estmate the actual state of an unknown dscrete dynamcal system, gven nosy
More informationMulti-dimensional Central Limit Argument
Mult-dmensonal Central Lmt Argument Outlne t as Consder d random proceses t, t,. Defne the sum process t t t t () t (); t () t are d to (), t () t 0 () t tme () t () t t t As, ( t) becomes a Gaussan random
More informationMaximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models
ECO 452 -- OE 4: Probt and Logt Models ECO 452 -- OE 4 Maxmum Lkelhood Estmaton of Bnary Dependent Varables Models: Probt and Logt hs note demonstrates how to formulate bnary dependent varables models
More informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have
More informationConvergence of random processes
DS-GA 12 Lecture notes 6 Fall 216 Convergence of random processes 1 Introducton In these notes we study convergence of dscrete random processes. Ths allows to characterze phenomena such as the law of large
More informationAntenna Combining for the MIMO Downlink Channel
Antenna Combnng for the IO Downlnk Channel arxv:0704.308v [cs.it] 0 Apr 2007 Nhar Jndal Department of Electrcal and Computer Engneerng Unversty of nnesota nneapols, N 55455, USA Emal: nhar@umn.edu Abstract
More informationConsider the following passband digital communication system model. c t. modulator. t r a n s m i t t e r. signal decoder.
PASSBAND DIGITAL MODULATION TECHNIQUES Consder the followng passband dgtal communcaton system model. cos( ω + φ ) c t message source m sgnal encoder s modulator s () t communcaton xt () channel t r a n
More informationJohann Wolfgang Goethe-Universität Frankfurt am Main
Fachberech Informatk Johann Wolfgang Goethe-Unverstät Frankfurt am Man 7KH3ULQFLSDO,QGHSHQGHQW &RPSRQHQWVRI,PDJHV %$UOW5%UDXVH arlt@nformatk.un-frankfurt.de brause@nformatk.un-frankfurt.de,17(51$/5(357
More information3.1 ML and Empirical Distribution
67577 Intro. to Machne Learnng Fall semester, 2008/9 Lecture 3: Maxmum Lkelhood/ Maxmum Entropy Dualty Lecturer: Amnon Shashua Scrbe: Amnon Shashua 1 In the prevous lecture we defned the prncple of Maxmum
More informationExercises. 18 Algorithms
18 Algorthms Exercses 0.1. In each of the followng stuatons, ndcate whether f = O(g), or f = Ω(g), or both (n whch case f = Θ(g)). f(n) g(n) (a) n 100 n 200 (b) n 1/2 n 2/3 (c) 100n + log n n + (log n)
More informationMixed Noise Suppression in Color Images by Signal-Dependent LMS L-Filters
46 R. HUDEC MIXED OISE SUPPRESSIO I COLOR IMAGES BY SIGAL-DEPEDET LMS L-FILTERS Mxed ose Suppresson n Color Images by Sgnal-Dependent LMS L-Flters Róbert HUDEC Dept. of Telecommuncatons Unversty of Žlna
More informationAssuming that the transmission delay is negligible, we have
Baseband Transmsson of Bnary Sgnals Let g(t), =,, be a sgnal transmtted over an AWG channel. Consder the followng recever g (t) + + Σ x(t) LTI flter h(t) y(t) t = nt y(nt) threshold comparator Decson ˆ
More informationOPTIMAL COMBINATION OF FOURTH ORDER STATISTICS FOR NON-CIRCULAR SOURCE SEPARATION. Christophe De Luigi and Eric Moreau
OPTIMAL COMBINATION OF FOURTH ORDER STATISTICS FOR NON-CIRCULAR SOURCE SEPARATION Chrstophe De Lug and Erc Moreau Unversty of Toulon LSEET UMR CNRS 607 av. G. Pompdou BP56 F-8362 La Valette du Var Cedex
More informationThe Prncpal Component Transform The Prncpal Component Transform s also called Karhunen-Loeve Transform (KLT, Hotellng Transform, oregenvector Transfor
Prncpal Component Transform Multvarate Random Sgnals A real tme sgnal x(t can be consdered as a random process and ts samples x m (m =0; ;N, 1 a random vector: The mean vector of X s X =[x0; ;x N,1] T
More informationSignal space Review on vector space Linear independence Metric space and norm Inner product
Sgnal space.... Revew on vector space.... Lnear ndependence... 3.3 Metrc space and norm... 4.4 Inner product... 5.5 Orthonormal bass... 7.6 Waveform communcaton system... 9.7 Some examples... 6 Sgnal space
More informationEstimating the Fundamental Matrix by Transforming Image Points in Projective Space 1
Estmatng the Fundamental Matrx by Transformng Image Ponts n Projectve Space 1 Zhengyou Zhang and Charles Loop Mcrosoft Research, One Mcrosoft Way, Redmond, WA 98052, USA E-mal: fzhang,cloopg@mcrosoft.com
More informationOn MIMO Channel Capacity with Output Quantization Constraints
On MIMO Channel Capacty wth Output Quantzaton Constrants Abbas Khall NYU New York, USA ako74@nyu.edu Stefano Rn NCTU Hsnchu, Tawan stefano@nctu.edu.tw Luca Barletta Poltecnco d Mlano Mlano, Italy luca.barletta@polm.t
More informationPower Allocation for Distributed BLUE Estimation with Full and Limited Feedback of CSI
Power Allocaton for Dstrbuted BLUE Estmaton wth Full and Lmted Feedback of CSI Mohammad Fanae, Matthew C. Valent, and Natala A. Schmd Lane Department of Computer Scence and Electrcal Engneerng West Vrgna
More informationQuantum and Classical Information Theory with Disentropy
Quantum and Classcal Informaton Theory wth Dsentropy R V Ramos rubensramos@ufcbr Lab of Quantum Informaton Technology, Department of Telenformatc Engneerng Federal Unversty of Ceara - DETI/UFC, CP 6007
More informationP R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering /
Theory and Applcatons of Pattern Recognton 003, Rob Polkar, Rowan Unversty, Glassboro, NJ Lecture 4 Bayes Classfcaton Rule Dept. of Electrcal and Computer Engneerng 0909.40.0 / 0909.504.04 Theory & Applcatons
More informationLecture 4: Universal Hash Functions/Streaming Cont d
CSE 5: Desgn and Analyss of Algorthms I Sprng 06 Lecture 4: Unversal Hash Functons/Streamng Cont d Lecturer: Shayan Oves Gharan Aprl 6th Scrbe: Jacob Schreber Dsclamer: These notes have not been subjected
More informationS Advanced Digital Communication (4 cr) Targets today
S.72-3320 Advanced Dtal Communcaton (4 cr) Convolutonal Codes Tarets today Why to apply convolutonal codn? Defnn convolutonal codes Practcal encodn crcuts Defnn qualty of convolutonal codes Decodn prncples
More informationLimited Dependent Variables
Lmted Dependent Varables. What f the left-hand sde varable s not a contnuous thng spread from mnus nfnty to plus nfnty? That s, gven a model = f (, β, ε, where a. s bounded below at zero, such as wages
More informationECE 534: Elements of Information Theory. Solutions to Midterm Exam (Spring 2006)
ECE 534: Elements of Informaton Theory Solutons to Mdterm Eam (Sprng 6) Problem [ pts.] A dscrete memoryless source has an alphabet of three letters,, =,, 3, wth probabltes.4,.4, and., respectvely. (a)
More informationIntegrating Neural Networks and PCA for Fast Covert Surveillance
Integratng Neural Networks and PCA for Fast Covert Survellance Hazem M. El-Bakry, and Mamoon H. Mamoon Faculty of Computer Scence & Informaton Systems, Mansoura Unversty, EGYPT E-mal: helbakry0@yahoo.com
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationStatistical analysis using matlab. HY 439 Presented by: George Fortetsanakis
Statstcal analyss usng matlab HY 439 Presented by: George Fortetsanaks Roadmap Probablty dstrbutons Statstcal estmaton Fttng data to probablty dstrbutons Contnuous dstrbutons Contnuous random varable X
More informationComparison of Wiener Filter solution by SVD with decompositions QR and QLP
Proceedngs of the 6th WSEAS Int Conf on Artfcal Intellgence, Knowledge Engneerng and Data Bases, Corfu Island, Greece, February 6-9, 007 7 Comparson of Wener Flter soluton by SVD wth decompostons QR and
More informationLECTURE 9 CANONICAL CORRELATION ANALYSIS
LECURE 9 CANONICAL CORRELAION ANALYSIS Introducton he concept of canoncal correlaton arses when we want to quantfy the assocatons between two sets of varables. For example, suppose that the frst set of
More informationMulti-dimensional Central Limit Theorem
Mult-dmensonal Central Lmt heorem Outlne ( ( ( t as ( + ( + + ( ( ( Consder a sequence of ndependent random proceses t, t, dentcal to some ( t. Assume t = 0. Defne the sum process t t t t = ( t = (; t
More information