Lec 12 Rate-Distortion Optimization (RDO) in Video Coding-II
|
|
- Jared Skinner
- 5 years ago
- Views:
Transcription
1 Sprng 07: Multmeda Communcaton Lec ate-dstorton Optmzaton (DO) n Vdeo Codng-II Zhu L Course Web: Z. L Multmeda Communcaton, Sprng 07 p.
2 Outlne Lec ecap Lagrangan Method HW-3 Lagrangan Optmzed Mode Decson and ate COntrol Mode Decson n Vdeo Codng ate Control n Vdeo Codng Z. L Multmeda Communcaton, Sprng 07 p.
3 Lagrangan elaxaton Method Prmal Problem: Lagrangan: KKT Condton: Statonary: mn x Complementary Slackness: D(x) s. t. x C L x, λ = D x + λ( x C) L(x, λ ) x = 0, λ = D(x ) (x ) Slope s D/ gradent λ D x = 0, λ = 0, x < C Constrant not tght λ > 0, x = C, λ = δd(x )/δ(x ) Constrant tght Z. L Multmeda Communcaton, Sprng 07 p.3
4 Operatonal ate-dstorton Theory Operatonal -D optmzaton: D C D functon OD functon operatng ponts OD convex hull Gves the operatonal -D performance curve. {Q j }: operatng ponts assocated wth codng decsons and parameters Optmzaton: select operatng ponts that mnmzes dstorton for a gven rate, or mnmzng rate for a gven dstorton. Lagrangan method reduced the DoF to mn x k D x k, s. t, x k C mn x k x k, s. t, D x k D max Z. L Multmeda Communcaton, Sprng 07 p.4
5 Dualty Gap Dualty problem solves the prmal problem when dualty gap s zero. Feasble regon: (u, t) n F F :{( u, t) u f( x), t f0( x), x DOM f0} Dual problem: max g( ) 0 Searchng on a set of supportng hyper planes wth slope - Dualty gap: p*- q* max{nf ( t 0 u, tf u)} p* p* mn f0( x), s. t. f( x) 0 xc f 0 (x) F q* f (x) Convex Hull approxmaton typcal n most Lagrangan relaxed -D Optmzaton solutons. Penalty s ths dualty gap * Z. L Multmeda Communcaton, Sprng 07 p.5
6 HW-/3 HW-3: Any questons? Tentatvely due next Monday. evew of Multmeda Communcaton Part I Entropy and Entropy Codng Huffman Codng, Golomb Codng, Arthmetc Codng Transforms, Quantzaton Vdeo Sgnal Processng: Moton, Inter and Intra Predcton ate-dstorton Optmzaton Quz week: Quz - (03/08) o Q. Ture/False o Q. Multple Choces o Q3~Q5. Computng and Program Solvng o Close book but allow one-page cheatng sheet, whch wll be graded. Z. L Multmeda Communcaton, Sprng 07 p.6
7 Outlne Lec ecap Lagrangan Method HW-3 Mode Decson n Vdeo Codng ate Control n Vdeo Codng Z. L Multmeda Communcaton, Sprng 07 p.7
8 Mode Decson n H.63 TMN0 G. Sullvan and T. Wegand, ate-dstorton optmzaton for vdeo compresson, IEEE Sgnal Processng Magazne, Vol. 5, No.6, pp , Nov T. Wegand and B. Grod, Lagrange multpler selecton n hybrd vdeo coder control, Proceedngs of 00 Internatonal Conference on Image Processng, Vol. 3, pp , Oct. 00. Possble MB Codng Modes n H.63: INTA: code the MB as ntra block, no moton estmaton. SKIP: Use the co-located MB n the prevous frame as the reconstructon for the current MB. INTE MV: Use moton vector for the MB, encode the MV and resdual. INTE 4MV: Use 4 moton vectors for the MB. One for each 8x8 block. Quantzaton Parameter (QP) for each MB: QP of prevous MB wth a mnor adjustment: only 5 choces o QP, QP+, QP-, QP+, QP-. Fndng the best QP for each MB s part of the rate control. Z. L Multmeda Communcaton, Sprng 07 p.8
9 Mode Decson n H.63 TMN0 -D optmzed Codng Mode Decson for the k-th MB: Assume QP has been determned by rate control algorthm: Mnmze the Lagrangan codng mode cost: J D EC EC D EC ( MB ( MB ( MB k k k, MODE, MODE, MODE Q) : Q) : Q) MODE EC Dstorton of ( MB k, MODE Q) the k - th MBwth MODE ate for the MBwth MODE and stepq. and step Q. Possble values of MODE: INTA, SKIP, INTE MV, INTE 4MV λmode: Lagrangan multpler D functon OD functon operatng ponts OD convex hull 5 How to determne λ MODE from the Q step? λ MODE reflects the general slope of the -D functon Q provdes operatng range Z. L Multmeda Communcaton, Sprng 07 p.9
10 Mode Decson n H.63 TMN0 mn MODE J, J D EC ( MB k, MODE Q) MODE EC ( MB k, MODE Q) At hgh rate, the relatonshp between EC and DEC can be wrtten as ( D) a ln Larger λmode gves hgher prorty to the reducton of rate, leadng to soluton wth lower rate (and therefore larger dstorton). Smaller λmode gves hgher prorty to the reducton of dstorton, leadng to soluton wth less dstorton, but hgher rate. b D D Pont A: Larger λmode, larger Q step Pont B: Smaller λmode, smaller Q step Z. L Multmeda Communcaton, Sprng 07 p.0
11 Mode Decson n H.63 TMN0 Further nterpretaton of the Lagrangan multpler λ: ( D) a ln b D When J s mnmzed: J D D a ln b D D a dd d (The optmal λ s the neg slope of the curve) Proof: J 0 a D b( ) D 0 or D D b a b a aln / D D D Z. L Multmeda Communcaton, Sprng 07 p.
12 Mode Decson n H.63 TMN0 But the slope s dfferent at dfferent ponts of the curve It s better to represent the slope by Q step. In H.63, λmode s chosen as [Sullvan 98]: MODE Q) ( Q Justfcaton: At hgh rate, the dstorton has unform dstrbuton: Plug nto the (D) formula: ( D) a ln b D D( Q) Q ( Q) b a ln Q dd dd( Q) / dq / 6Q Q d d( Q) / dq a / Q a (can also be obtaned from 0.85 s an emprcal result n H.63. D / a drectly) Z. L Multmeda Communcaton, Sprng 07 p.
13 Mode Decson n H.63 TMN0 Code Mode Cost: Possble optons for MODEk: INTA, SKIP, INTE MV, INTE 4MV INTA mode cost: DEC(MBk, INTA Q): The sum of squared errors (SSE) between the orgnal MB and the reconstructed MB (after DCT, Quant, de-quant, nverse DCT). EC(MBk, INTA Q): Ths ncludes the bts needed to encode the mode decson, and the quantzed DCT coeffcents of the current MB. Entropy codng has to be called slow. Any better rate producton model? Later we wll study rho-doman rate control, can avod entropy codng. SKIP mode cost: DEC(MBk, INTA Q): For SKIP mode, the co-located MB n the prevous frame s used drectly as the reconstructed MB, so the dstorton s the sum of squared errors between the two MBs. The dstorton does not depend on the QP of the current frame. J D EC ( MB, MODE Q) ( MB, MODE Q) k MODE EC(MBk, INTA Q): Only ncludes the bt to sgnal the SKIP mode ( bt n H.63 standard). Z. L Multmeda Communcaton, Sprng 07 p.3 EC k
14 Mode Decson n H.63 TMN0 INTE MV and INTE 4MV cost: Need to fnd the best moton vector frst. Another Lagrangan optmzaton problem for the moton estmaton: Moton Est. Cost: v arg mn v D SAD ( S k, v) MOTION MOTION ( S k, v) S k : The block of nterest (6x6 n INTE MV and 8x8 n INTE 4MV). v: Moton vector canddate n the search wndow. DSAD: The Sum of Absolute Dfference (SAD) between S k and ts reference (as a measure of the moton estmaton effcency) MOTION: The bts to encode the moton vector (does not nclude the codng of the resdual). In H.63, λmotion s chosen heurstcally as: MOTION MODE n H.63. Z. L Multmeda Communcaton, Sprng 07 p.4
15 Mode Decson n H.63 TMN0 v arg mn v D SAD ( S, v) MOTION, v) The search of moton vector that mnmzes the moton estmaton cost above proceeds frst over nteger-pxel locatons. Half pxel moton estmaton s then performed around the optmal nteger moton vector. k MOTION After the MV (or MVs) for the current MB s selected, we can compute the codng mode cost for INTE MV or 4MV: ( S k J D EC ( MB, MODE Q) ( MB, MODE Q) k MODE EC k DEC for INTE modes: econstructon error: Sum of Squared Error between the orgnal MB and the reconstructed MB (usng the best MV found above). EC for INTE modes: Includes the bts to encode the MV, the quantzed DCT coeffcents of the moton estmaton resdual, and the mode decson. Z. L Multmeda Communcaton, Sprng 07 p.5
16 H.63 Model Decson Summary Possble modes: 4 INTA: code the MB as ntra block, no moton estmaton. SKIP: Use the co-located MB n the prevous frame as the reconstructon for the current MB. INTE MV: Use moton vector for the MB, encode the MV and resdual. INTE 4MV: Use 4 moton vectors for the MB. One for each 8x8 block. Model decson objectve functon J D EC ( MB, MODE Q) ( MB, MODE Q) k MODE EC k Lagrangan Estmaton from QP MODE Q) ( Q Z. L Multmeda Communcaton, Sprng 07 p.6
17 Outlne Mode decson: Mode decson n H.63+ TMN0 Mode decson n H.64 ate Control: ate Control n MPEG-4 VM5 ate Control n H.63+ TMN8 and MPEG4 VM8 ρ-doman rate control Z. L Multmeda Communcaton, Sprng 07 p.7
18 Mode Decson n H.64 Based on H.63 TMN0, but more complcated. Summary of Codng Modes n H.64: Intra slces: o INTA 4X4 (9 cases), INTA 6X6 (4 cases). o Intra Chroma mode (4 cases) P-slces: o INTA 4X4 (9 cases), INTA 6X6 (4 cases), o SKIP, 6x6, 6x8, 8x6, Tree 8x8 (4 cases). o For each MB, fnd the best ref frame after ME wrt all ref frames. B-slces: o DIECT mode o INTA 4X4 (9 cases), INTA 6X6 (4 cases), o FWD: 6x6, 6x8, 8x6, Tree 8x8 (4 cases) o BWD: 6x6, 6x8, 8x6, Tree 8x8 (4 cases) o B-drectonal predcton. o For each partton, fnd the best fwd and best bwd ref frames wrt all ref frames, then decde the best predcton drectons: fwd, bwd, or b-dr. Z. L Multmeda Communcaton, Sprng 07 p.8
19 Mode Decson n H.64 General formula: J Dstorton MODEate For INTA mode testng and P slce INTE mode testng: For B slce testng: MODE, B Moton vector decson: When SSE s When SAD s ( QP)/3 MODE, I, P 0.85 max, mn 4, used n ME, Between [, 4] used n ME, QP- 6 MOTION MOTION MODE, I, P MODE, I, P. MODE, I, P Z. L Multmeda Communcaton, Sprng 07 p.9.
20 ate Control for Vdeo Encodng Goal: Maxmze the vdeo qualty under a gven rate constrant. ate control at dfferent levels: GOP level Pcture/Frame level Macro Block (MB)/Codng Tree level Vdeo bt rate may be adapted by: Varyng the quantzaton: most useful Varyng the frame rate Varyng the spatal resoluton Addng/droppng layers (for scalable codng) Z. L Multmeda Communcaton, Sprng 07 p.0
21 ate Control n MPEG4 VM5 T. Chang and Y.-Q. Zhang, A new rate control scheme usng quadratc rate dstorton model, IEEE Trans. Crcuts and Systems for Vdeo Technology, Vol. 7, No., pp , Feb Adopted by MPEG Verfcaton Model (VM) 5.0 n Nov The ate-quantzaton step model: atonale: At hgh rate: aq bq D ( ) ln D Q α: content dependent Taylor expanson: Let x ln( x) D ' / x '' / x. ( D) 0 3 ( D) D D 3 D D 3( D) Z. L Multmeda Communcaton, Sprng 07 p.
22 ate Control n MPEG4 VM5 Use three sets of parameters, {a, b }, {a, b }, and {a 3, b 3 }, for I, P, B frames, respectvely. Use lnear regresson to get a, b : Collect j, Q j : the bts and Q step of each prevously encoded frame n each category... n n n Q b a Q b Q a Q b Q a Q r or, b a A b a Q Q Q Q Q Q n n n r A A A b a T T Drawbacks:. Only good for hgh rate;. Frame-level QP control only. 3. hgh cost n computng Z. L Multmeda Communcaton, Sprng 07 p. [a, b ] wll be the best parameter for ths partcular seq s I frames
23 Outlne Mode decson: Mode decson n H.63+ TMN0 Mode decson n H.64 ate Control: ate Control n MPEG-4 VM5 ate Control n H.63+ TMN8 and MPEG4 VM8 ρ-doman rate control Z. L Multmeda Communcaton, Sprng 07 p.3
24 ate Control n H.63+ TMN8 and MPEG4 VM8 TMN: Test Model Near-term, ef: J. bas-corbera and S. Le, ate control n DCT vdeo codng for low-delay communcatons, IEEE Trans. Crcuts and Systems for Vdeo Technology, Vol. 9, No., pp. 7-85, Feb Advantages: Macro-block level rate control Sutable for low bt rate ate model for low bt rate: Algorthm: B ( Q) A K Q c Q C, : varance of a DCT coeffcent. Assgn QP based on the standard devaton σ of each macroblock: σ Q B : The total bts generated by the -th macro-block. A: 56, # of pxels n each MB C: overhead by moton vectors. K, C can be estmated, content dependent. Z. L Multmeda Communcaton, Sprng 07 p.4
25 ate Control n H.63+ TMN8 and MPEG4 VM8 Dstorton Model: Assumng unform quantzer Average dstorton: D N N Q N: total number of macroblocks. Problem formulaton: argmn Q, Q,... Q N subject to N N B N B. Select Q for each MB such that the total bts for the current frame s B. Z. L Multmeda Communcaton, Sprng 07 p.5 Q
26 ate Control n H.63+ TMN8 and MPEG4 VM8 Use Lagrangan multpler: B C Q K A Q N B B Q N Q J N N N N ) ( Set the dervatve wth respect to Q to be 0: AKN Q Plug n to the bt rate constrant B B N ANC B AKN AK N N k k ANC B AK Q Z. L Multmeda Communcaton, Sprng 07 p.6
27 ate Control n H.63+ TMN8 and MPEG4 VM8 Problems: Does not model the cost of moton vectors accurately. Modern vdeo codng uses deadzone quantzer. The dstorton model s not very accurate ether. Z. L Multmeda Communcaton, Sprng 07 p.7
28 Outlne Mode decson: Mode decson n H.63+ TMN0 Mode decson n H.64 ate Control: ate Control n MPEG-4 VM5 ate Control n H.63+ TMN8 and MPEG4 VM8 ρ-doman rate control o Orgnal algorthm o Generalzaton to H.64 Z. L Multmeda Communcaton, Sprng 07 p.8
29 ρ-doman ate Control Z. He, S.Mtra, "A Unfed ate-dstorton Analyss Framework for Transform Codng," IEEE Transactons on Crcuts and Systems for Vdeo Technology, vol., no., Dec. 00, pp. -36 (00 Best Paper Award) Z. He, S. Mtra, A lnear source model and a unfed rate control algorthm for DCT vdeo codng, IEEE CSVT, (), pp , Nov. 00. Problems of prevous rate-control algorthms: Complcated non-lnear (Q) and D(Q) expressons Large control errors Performance degradaton at scene changes Targeted for a specfc vdeo codng system ρ: The percentage of zero coeffcents after quantzaton. ρ-doman rate control: break up (Q) nto (ρ) and ρ(q). (ρ) s lnear of ρ. ρ(q) can be easly obtaned. More accurate and robust rate control. No need to run entropy codng faster Z. L Multmeda Communcaton, Sprng 07 p.9
30 ρ-doman ate Control ρ: The percentage of zeros n all quantzed coeffcents. There exsts -to- mappng between Q and ρ: Can be obtaned from the dstrbutons of coeffcents. Example: deadzone quantzer -3q0 -q0 -q0 0 q0 q0 3q0 q( X ) 0 q Pr 0 If the hstogram of transform coeffcents, D(x), s known: ( q0) M x q A lookup table can be created to map Q to ρ. 0 q 0 q 0 f ( x) dx D( x), M : total# of coeffs. Z. L Multmeda Communcaton, Sprng 07 p.30
31 ate Producton Model: q-doman vs p-doman quantzer doman rate model: Dffcult to estmate, very content dependent X: quantzer, Y: ate (q) Z. L Multmeda Communcaton, Sprng 07 p.3
32 ate Producton Model: q-doman vs p-doman Tranform doman rate model: Very good lnearty, easy to estmate X: p, Y: ate (p) Z. L Multmeda Communcaton, Sprng 07 p.3
33 ρ-doman Lnear ate Model It has been observed that the bt rate of all typcal transform codng systems, such as JPEG, SPIHT, H.63 and MPEG- can be modeled as a lnear functon of ρ: ( ) ( ) (ρ) Ө s related to source content. How to estmate Ө? The lne passes the pont (,0). Only need another pont n order to estmate Ө. Quantze the mage or moton estmaton resdual usng one QP value, compute the correspondng ρ and (ρ), then ( ) ρ Can also adaptvely estmate Ө MB by MB. Z. L Multmeda Communcaton, Sprng 07 p.33
34 ρ-doman Lnear ate Model Estmaton of ө usng statstcs of prevously encoded MBs: N m : Number of coded MBs n the current frame. m : Number of bts used to encode the prevous Nm MBs. ρ m : Number (not rato) of zeros produced by the prevous Nm MBs. Snce each 6x6 MB has 384 pxels (56 luma, 64 Cr-chroma, 64 Cb-chroma) ө for the current MB s estmated as: m /(384Nm) /(384N Determnng QP for each MB: t : bt budget for the current frame t m : bt budget for the remanng MBs M: total number of MBs per frame Bt rate for the remanng MBs: m m ) 384N t m 384( M Nm) m m Z. L Multmeda Communcaton, Sprng 07 p.34 m
35 ρ-doman Lnear ate Model From ( ) ( ) The fracton of zeros that need to be produced by the remanng MBs s / Gven the desred fracton of zeros, and usng the relatonshp between QP and the fracton of zeros, we can fnd the desred QP for the current MB. Z. L Multmeda Communcaton, Sprng 07 p.35
36 ρ-doman ate Control Wth the adaptve estmaton of ө and the lnear rate mode, the rate control becomes straghtforward. Defne: T: Target bt rate (bts) per frame BT: Encoder buffer sze B0: Number of bts n the buffer α: Target buffer level percentage. αbt: Target buffer level n bts. The avalable bts for codng the current frame can be found by: B 0 T B T T B0 B T Z. L Multmeda Communcaton, Sprng 07 p.36
37 ρ-doman ate Control for H.64 Z. He and D. O. Wu, Lnear rate control and optmum statstcal multplexng for H.64 vdeo broadcast, IEEE Trans. Multmeda, 0(7), 37-49, Nov H.64 poses some dffcultes for rho-doman rate control:. H.64 has sgnfcant amount of overhead bts for moton vectors, MB modes, pcture headers, QP parameters Can be as hgh as 50% of all bt streams The fracton of overhead bts changes dramatcally from frame to frame. The ntra-predcton n H.64 creates recursve dependency between dfferent MBs. Orgnal rho-doman rate control assumes ndependent MB codng. Therefore the frame-level statstcs of coeffcent dstrbutons can be collected before the rate control. It s found n the paper above that n H.64, the overhead bts are also lnear functon of rho. Therefore the lnear source model s stll vald. Z. L Multmeda Communcaton, Sprng 07 p.37
38 ρ-doman ate Control for H.64 To collect the frame-level statstcs requred by the rho-doman rate control, a two-loop method s proposed. In the frst loop, moton compensaton of all MB modes and ntra-predcton are performed for all MBs. However, the ntra-predcton uses orgnal neghborng pxels nstead of reconstructed pxels. The purpose s to break up the dependency between the codng of neghborng MBs. Block transform s then appled to the moton compensaton resdual and ntra predcton resdual, and the frame-level statstcs s collected. The second loop uses the standard H.64 encodng for each MB: The ntra predcton s checked agan usng reconstructed neghborng pxels. If codng mode of the MB s selected to be ntra, then the block transform s appled agan. The added complexty s the ntra-predcton and the correspondng block transform. Note: H.64 apples dfferent deadzone quantzers for ntra and nter MBs, so we need to mantan dfferent statstcs for ntra and nter MBs. Z. L Multmeda Communcaton, Sprng 07 p.38
39 ρ-doman ate Control for H.64 Step : Collectng frame-level statstcs usng the smplfed method. Step : Intalzaton Nm = m = ρm = 0. Set ө to be ts value n the prevous frame of the same type. Step 3: t m Use the followng to fnd : Use the map between QP and ρ to fnd the QP for the current MB. Step 4: Update Fnd number of zeros (ρ0) and number of bts (0) produced by the current MB. Set Update ө by emove the frequences of the DCT coeffcents of the current MB from the statstcs. Step 5: Loop. epeat Step 3 and 4 for all MBs. 384( M Nm) m m 0 m m 0 /( 384 m m N m / N m N m ) Z. L Multmeda Communcaton, Sprng 07 p.39
40 λ-doman rate control for HEVC λ s the key factor to determne both the btrate and dstorton λ s the slope of the -D curve and thus there exsts a one-to-one correspondence between D and λ λ can both determne the resdue and non-resdue bts, whle QP s unable to determne the non-resdue bts B. L, H. L, L L, J.Zhang: λ Doman ate Control Algorthm for Hgh Effcency Vdeo Codng. IEEE Trans. on Image Processng 3(9): (04) Z. L Multmeda Communcaton, Sprng 07 p.40
41 λ-doman rate control algorthm Bt allocaton Pcture level bt allocaton o The λ rato of dfferent pctures should be nversely proportonal to ts nfluence to the whole sequence Block level bt allocaton o The λ of dfferent BUs should be equal to acheve the best -D performance Achevng of the target btrate D C K D CK K Z. L Multmeda Communcaton, Sprng 07 p.4
42 Expermental esults How well the rates stck to target Z. L Multmeda Communcaton, Sprng 07 4
43 Summary Mode Decson QP s gven by outer loop of control (ate Control) Lagrangan relaxed formulaton of the model objectve functon Lagrangan multpler reflects the operatng range on the -D curve ate-control Accurate ate Producton model? Lnear model va rho doman work Dstorton model: quantzer related Herarchcal allocaton: GoP level, Frame Level, and then Block level, lke a long term short term hgh frequency tradng company. Next Class: evew of the Part I: Vdeo Codng. Z. L Multmeda Communcaton, Sprng 07 p.43
Module 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 informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
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 informationTransform Coding. Transform Coding Principle
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
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 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 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 informationAssortment Optimization under MNL
Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.
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 informationMACHINE APPLIED MACHINE LEARNING LEARNING. Gaussian Mixture Regression
11 MACHINE APPLIED MACHINE LEARNING LEARNING MACHINE LEARNING Gaussan Mture Regresson 22 MACHINE APPLIED MACHINE LEARNING LEARNING Bref summary of last week s lecture 33 MACHINE APPLIED MACHINE LEARNING
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 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 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 informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationMaximal Margin Classifier
CS81B/Stat41B: Advanced Topcs n Learnng & Decson Makng Mamal Margn Classfer Lecturer: Mchael Jordan Scrbes: Jana van Greunen Corrected verson - /1/004 1 References/Recommended Readng 1.1 Webstes www.kernel-machnes.org
More informationWhich Separator? Spring 1
Whch Separator? 6.034 - Sprng 1 Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng 3 Margn of a pont " # y (w $ + b) proportonal
More informationLagrange Multipliers Kernel Trick
Lagrange Multplers Kernel Trck Ncholas Ruozz Unversty of Texas at Dallas Based roughly on the sldes of Davd Sontag General Optmzaton A mathematcal detour, we ll come back to SVMs soon! subject to: f x
More informationSolutions to exam in SF1811 Optimization, Jan 14, 2015
Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationPHYS 705: Classical Mechanics. Calculus of Variations II
1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary
More informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationOn balancing multiple video streams with distributed QoS control in mobile communications
On balancng multple vdeo streams wth dstrbuted QoS control n moble communcatons Arjen van der Schaaf, José Angel Lso Arellano, and R. (Inald) L. Lagendjk TU Delft, Mekelweg 4, 68 CD Delft, The Netherlands
More informationChapter 13: Multiple Regression
Chapter 13: Multple Regresson 13.1 Developng the multple-regresson Model The general model can be descrbed as: It smplfes for two ndependent varables: The sample ft parameter b 0, b 1, and b are used to
More informationFeature Selection: Part 1
CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?
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 informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationSolutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.
Solutons HW #2 Dual of general LP. Fnd the dual functon of the LP mnmze subject to c T x Gx h Ax = b. Gve the dual problem, and make the mplct equalty constrants explct. Soluton. 1. The Lagrangan s L(x,
More informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 31 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 6. Rdge regresson The OLSE s the best lnear unbased
More informationTracking with Kalman Filter
Trackng wth Kalman Flter Scott T. Acton Vrgna Image and Vdeo Analyss (VIVA), Charles L. Brown Department of Electrcal and Computer Engneerng Department of Bomedcal Engneerng Unversty of Vrgna, Charlottesvlle,
More informationCIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M
CIS56: achne Learnng Lecture 3 (Sept 6, 003) Preparaton help: Xaoyng Huang Lnear Regresson Lnear regresson can be represented by a functonal form: f(; θ) = θ 0 0 +θ + + θ = θ = 0 ote: 0 s a dummy attrbute
More informationComputing Correlated Equilibria in Multi-Player Games
Computng Correlated Equlbra n Mult-Player Games Chrstos H. Papadmtrou Presented by Zhanxang Huang December 7th, 2005 1 The Author Dr. Chrstos H. Papadmtrou CS professor at UC Berkley (taught at Harvard,
More informationCorrelation and Regression. Correlation 9.1. Correlation. Chapter 9
Chapter 9 Correlaton and Regresson 9. Correlaton Correlaton A correlaton s a relatonshp between two varables. The data can be represented b the ordered pars (, ) where s the ndependent (or eplanator) varable,
More informationNew rate adaptation method for JPEG2000-based SNR Scalable Video Coding with Integer Linear Programming models
New rate adaptaton method for JPEG2000-based SNR Scalable Vdeo Codng wth Integer Lnear Programmng models Lvo Lma #1, Renata Mansn, Rccardo Leonard #2 # Sgnal Processng Group Department of Electroncs for
More informationResource Allocation and Decision Analysis (ECON 8010) Spring 2014 Foundations of Regression Analysis
Resource Allocaton and Decson Analss (ECON 800) Sprng 04 Foundatons of Regresson Analss Readng: Regresson Analss (ECON 800 Coursepak, Page 3) Defntons and Concepts: Regresson Analss statstcal technques
More informationLOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin
Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence
More informationCOS 521: Advanced Algorithms Game Theory and Linear Programming
COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton
More informationComparison of Regression Lines
STATGRAPHICS Rev. 9/13/2013 Comparson of Regresson Lnes Summary... 1 Data Input... 3 Analyss Summary... 4 Plot of Ftted Model... 6 Condtonal Sums of Squares... 6 Analyss Optons... 7 Forecasts... 8 Confdence
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
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 informationNegative Binomial Regression
STATGRAPHICS Rev. 9/16/2013 Negatve Bnomal Regresson Summary... 1 Data Input... 3 Statstcal Model... 3 Analyss Summary... 4 Analyss Optons... 7 Plot of Ftted Model... 8 Observed Versus Predcted... 10 Predctons...
More informationPsychology 282 Lecture #24 Outline Regression Diagnostics: Outliers
Psychology 282 Lecture #24 Outlne Regresson Dagnostcs: Outlers In an earler lecture we studed the statstcal assumptons underlyng the regresson model, ncludng the followng ponts: Formal statement of assumptons.
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
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 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 informationCS 3710: Visual Recognition Classification and Detection. Adriana Kovashka Department of Computer Science January 13, 2015
CS 3710: Vsual Recognton Classfcaton and Detecton Adrana Kovashka Department of Computer Scence January 13, 2015 Plan for Today Vsual recognton bascs part 2: Classfcaton and detecton Adrana s research
More informationFUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM
Internatonal Conference on Ceramcs, Bkaner, Inda Internatonal Journal of Modern Physcs: Conference Seres Vol. 22 (2013) 757 761 World Scentfc Publshng Company DOI: 10.1142/S2010194513010982 FUZZY GOAL
More informationThe Study of Teaching-learning-based Optimization Algorithm
Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute
More informationADVANCED MACHINE LEARNING ADVANCED MACHINE LEARNING
1 ADVANCED ACHINE LEARNING ADVANCED ACHINE LEARNING Non-lnear regresson technques 2 ADVANCED ACHINE LEARNING Regresson: Prncple N ap N-dm. nput x to a contnuous output y. Learn a functon of the type: N
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationRegression Analysis. Regression Analysis
Regresson Analyss Smple Regresson Multvarate Regresson Stepwse Regresson Replcaton and Predcton Error 1 Regresson Analyss In general, we "ft" a model by mnmzng a metrc that represents the error. n mn (y
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationResource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud
Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal
More informationStatistics for Economics & Business
Statstcs for Economcs & Busness Smple Lnear Regresson Learnng Objectves In ths chapter, you learn: How to use regresson analyss to predct the value of a dependent varable based on an ndependent varable
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 informationAdaptive Pre-Interpolation Filter for Motion-Compensated Prediction
Adaptve Pre-Interpolaton Flter for Moton-Compensated Predcton Je Dong and Kng Ng Ngan Department of Electronc Engneerng The Chnese Unverst of Hong Kong ISCAS011 Ma 15-18 011 Ro de Janero Brazl Motvaton
More informationCalculation of time complexity (3%)
Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add
More informationChapter 6. Supplemental Text Material
Chapter 6. Supplemental Text Materal S6-. actor Effect Estmates are Least Squares Estmates We have gven heurstc or ntutve explanatons of how the estmates of the factor effects are obtaned n the textboo.
More informationMean Field / Variational Approximations
Mean Feld / Varatonal Appromatons resented by Jose Nuñez 0/24/05 Outlne Introducton Mean Feld Appromaton Structured Mean Feld Weghted Mean Feld Varatonal Methods Introducton roblem: We have dstrbuton but
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationWeek 5: Neural Networks
Week 5: Neural Networks Instructor: Sergey Levne Neural Networks Summary In the prevous lecture, we saw how we can construct neural networks by extendng logstc regresson. Neural networks consst of multple
More informationEconomics 130. Lecture 4 Simple Linear Regression Continued
Economcs 130 Lecture 4 Contnued Readngs for Week 4 Text, Chapter and 3. We contnue wth addressng our second ssue + add n how we evaluate these relatonshps: Where do we get data to do ths analyss? How do
More informationLaboratory 3: Method of Least Squares
Laboratory 3: Method of Least Squares Introducton Consder the graph of expermental data n Fgure 1. In ths experment x s the ndependent varable and y the dependent varable. Clearly they are correlated wth
More informationINF 5860 Machine learning for image classification. Lecture 3 : Image classification and regression part II Anne Solberg January 31, 2018
INF 5860 Machne learnng for mage classfcaton Lecture 3 : Image classfcaton and regresson part II Anne Solberg January 3, 08 Today s topcs Multclass logstc regresson and softma Regularzaton Image classfcaton
More informationPHYS 450 Spring semester Lecture 02: Dealing with Experimental Uncertainties. Ron Reifenberger Birck Nanotechnology Center Purdue University
PHYS 45 Sprng semester 7 Lecture : Dealng wth Expermental Uncertantes Ron Refenberger Brck anotechnology Center Purdue Unversty Lecture Introductory Comments Expermental errors (really expermental uncertantes)
More informationPop-Click Noise Detection Using Inter-Frame Correlation for Improved Portable Auditory Sensing
Advanced Scence and Technology Letters, pp.164-168 http://dx.do.org/10.14257/astl.2013 Pop-Clc Nose Detecton Usng Inter-Frame Correlaton for Improved Portable Audtory Sensng Dong Yun Lee, Kwang Myung Jeon,
More informationThe written Master s Examination
he wrtten Master s Eamnaton Opton Statstcs and Probablty SPRING 9 Full ponts may be obtaned for correct answers to 8 questons. Each numbered queston (whch may have several parts) s worth the same number
More informationSTATISTICS QUESTIONS. Step by Step Solutions.
STATISTICS QUESTIONS Step by Step Solutons www.mathcracker.com 9//016 Problem 1: A researcher s nterested n the effects of famly sze on delnquency for a group of offenders and examnes famles wth one to
More informationLogistic Regression. CAP 5610: Machine Learning Instructor: Guo-Jun QI
Logstc Regresson CAP 561: achne Learnng Instructor: Guo-Jun QI Bayes Classfer: A Generatve model odel the posteror dstrbuton P(Y X) Estmate class-condtonal dstrbuton P(X Y) for each Y Estmate pror dstrbuton
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More information1 Convex Optimization
Convex Optmzaton We wll consder convex optmzaton problems. Namely, mnmzaton problems where the objectve s convex (we assume no constrants for now). Such problems often arse n machne learnng. For example,
More informationAppendix B: Resampling Algorithms
407 Appendx B: Resamplng Algorthms A common problem of all partcle flters s the degeneracy of weghts, whch conssts of the unbounded ncrease of the varance of the mportance weghts ω [ ] of the partcles
More informationStatistics II Final Exam 26/6/18
Statstcs II Fnal Exam 26/6/18 Academc Year 2017/18 Solutons Exam duraton: 2 h 30 mn 1. (3 ponts) A town hall s conductng a study to determne the amount of leftover food produced by the restaurants n the
More informationDepartment of Quantitative Methods & Information Systems. Time Series and Their Components QMIS 320. Chapter 6
Department of Quanttatve Methods & Informaton Systems Tme Seres and Ther Components QMIS 30 Chapter 6 Fall 00 Dr. Mohammad Zanal These sldes were modfed from ther orgnal source for educatonal purpose only.
More informationLaboratory 1c: Method of Least Squares
Lab 1c, Least Squares Laboratory 1c: Method of Least Squares Introducton Consder the graph of expermental data n Fgure 1. In ths experment x s the ndependent varable and y the dependent varable. Clearly
More informationPredictive Analytics : QM901.1x Prof U Dinesh Kumar, IIMB. All Rights Reserved, Indian Institute of Management Bangalore
Sesson Outlne Introducton to classfcaton problems and dscrete choce models. Introducton to Logstcs Regresson. Logstc functon and Logt functon. Maxmum Lkelhood Estmator (MLE) for estmaton of LR parameters.
More informationLecture 10 Support Vector Machines. Oct
Lecture 10 Support Vector Machnes Oct - 20-2008 Lnear Separators Whch of the lnear separators s optmal? Concept of Margn Recall that n Perceptron, we learned that the convergence rate of the Perceptron
More informationReal-Time Systems. Multiprocessor scheduling. Multiprocessor scheduling. Multiprocessor scheduling
Real-Tme Systems Multprocessor schedulng Specfcaton Implementaton Verfcaton Multprocessor schedulng -- -- Global schedulng How are tasks assgned to processors? Statc assgnment The processor(s) used for
More informationSDMML HT MSc Problem Sheet 4
SDMML HT 06 - MSc Problem Sheet 4. The recever operatng characterstc ROC curve plots the senstvty aganst the specfcty of a bnary classfer as the threshold for dscrmnaton s vared. Let the data space be
More informationSTATISTICAL MECHANICS
STATISTICAL MECHANICS Thermal Energy Recall that KE can always be separated nto 2 terms: KE system = 1 2 M 2 total v CM KE nternal Rgd-body rotaton and elastc / sound waves Use smplfyng assumptons KE of
More informationGlobal Sensitivity. Tuesday 20 th February, 2018
Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values
More information4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA
4 Analyss of Varance (ANOVA) 5 ANOVA 51 Introducton ANOVA ANOVA s a way to estmate and test the means of multple populatons We wll start wth one-way ANOVA If the populatons ncluded n the study are selected
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 informationCurve Fitting with the Least Square Method
WIKI Document Number 5 Interpolaton wth Least Squares Curve Fttng wth the Least Square Method Mattheu Bultelle Department of Bo-Engneerng Imperal College, London Context We wsh to model the postve feedback
More informationx yi In chapter 14, we want to perform inference (i.e. calculate confidence intervals and perform tests of significance) in this setting.
The Practce of Statstcs, nd ed. Chapter 14 Inference for Regresson Introducton In chapter 3 we used a least-squares regresson lne (LSRL) to represent a lnear relatonshp etween two quanttatve explanator
More informationStatistics Chapter 4
Statstcs Chapter 4 "There are three knds of les: les, damned les, and statstcs." Benjamn Dsrael, 1895 (Brtsh statesman) Gaussan Dstrbuton, 4-1 If a measurement s repeated many tmes a statstcal treatment
More informationA Novel Joint Rate Allocation Scheme of Multiple Streams
A ovel Jont Rate Allocaton Scheme of Multple Streams Hongfe Fan, Ln Dng, Huzhu Ja*, Xaodong Xe Abstract Encodng multple vdeos n parallel and transmttng them as one jont stream over a lmted bandwdth have
More informationBasic Statistical Analysis and Yield Calculations
October 17, 007 Basc Statstcal Analyss and Yeld Calculatons Dr. José Ernesto Rayas Sánchez 1 Outlne Sources of desgn-performance uncertanty Desgn and development processes Desgn for manufacturablty A general
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 informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationMicrowave Diversity Imaging Compression Using Bioinspired
Mcrowave Dversty Imagng Compresson Usng Bonspred Neural Networks Youwe Yuan 1, Yong L 1, Wele Xu 1, Janghong Yu * 1 School of Computer Scence and Technology, Hangzhou Danz Unversty, Hangzhou, Zhejang,
More informationLinear Feature Engineering 11
Lnear Feature Engneerng 11 2 Least-Squares 2.1 Smple least-squares Consder the followng dataset. We have a bunch of nputs x and correspondng outputs y. The partcular values n ths dataset are x y 0.23 0.19
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More information10-701/ Machine Learning, Fall 2005 Homework 3
10-701/15-781 Machne Learnng, Fall 2005 Homework 3 Out: 10/20/05 Due: begnnng of the class 11/01/05 Instructons Contact questons-10701@autonlaborg for queston Problem 1 Regresson and Cross-valdaton [40
More informationParametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010
Parametrc fractonal mputaton for mssng data analyss Jae Kwang Km Survey Workng Group Semnar March 29, 2010 1 Outlne Introducton Proposed method Fractonal mputaton Approxmaton Varance estmaton Multple mputaton
More informationOriginated from experimental optimization where measurements are very noisy Approximation can be actually more accurate than
Surrogate (approxmatons) Orgnated from expermental optmzaton where measurements are ver nos Approxmaton can be actuall more accurate than data! Great nterest now n applng these technques to computer smulatons
More informationPROBLEM SET 7 GENERAL EQUILIBRIUM
PROBLEM SET 7 GENERAL EQUILIBRIUM Queston a Defnton: An Arrow-Debreu Compettve Equlbrum s a vector of prces {p t } and allocatons {c t, c 2 t } whch satsfes ( Gven {p t }, c t maxmzes βt ln c t subject
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 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 informationVARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES
VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue
More information