OPTIMAL VIDEO SUMMARY GENERATION AND ENCODING. (ICIP Draft v0.2, )

Size: px
Start display at page:

Download "OPTIMAL VIDEO SUMMARY GENERATION AND ENCODING. (ICIP Draft v0.2, )"

Transcription

1 OPTIMAL VIDEO SUMMARY GENERATION AND ENCODING + Zhu L, * Aggelos atsaggelos and + Bhavan Gandh (ICIP Draft v.2, -2-23) + Multmeda Communcaton Research Lab, Motorola Labs, Schaumburg * Department of Electrcal & Computer Engneerng, Northwestern Unversty, Evanston ABSTRACT Vdeo summary work orgnates from vew tme constrant; a shorter verson of orgnal vdeo sequence s desrable n some applcatons. Our work s based on vsual sgnfcance analyss, whch s a functon of vsual features of nterests over tme. Once the frames n a sequence are labeled wth vsual sgnfcance, one-pass or two-pass frame selecton algorthms are proposed to generate perceptually optmal vdeo summary accordng to the vsual sgnfcance functon. We also proposed several optmal bt allocaton strategy for encodng of the vdeo summary.. INTRODUCTION The demand for vdeo summary work orgnates from securty, mltary and entertanment applcatons. Vew tme constrant s essental n many applcatons. In mltary stuaton, a battalon commander may request a 5 mnutes summary of Company B s fghtng at mountan pass for the last 2 mnutes; or n a securty applcaton, a supervsor want to see a 2 mnutes summary of what happened at arport gate B2, from camera #22, n the last mnutes; or n an entertanment scenaro a vewer ust want to spend hour to vew a.5 hour move. A shorter verson of the orgnal vdeo sequence also has the beneft of requrng less bts to encode. Ths makes t also attractve as a mechansm n rate control. Examples of recent works n vdeo summary are n [] [2][3][4]. People have used varous vsual features and the statstcs of vsual features to dentfy vdeo shot boundares and determne key frames by thresholdng and clusterng. Generally they are very complcated n computaton and requre a two-pass approach. They do not address the temporal resoluton wthn a vdeo shot gracefully. Our approach s based on vsual sgnfcance analyss. Vsual sgnfcance s a real functon defned for each frame to ndcate how vsually mport a frame s for user to comprehend the event n a vdeo sequence. We obtan our vsual sgnfcance value from color layout changes from the prevous frame and moton actvty wthn the frame. Wth some predetermned threshold T on vsual sgnfcance, we can dvde vdeo sequence up nto vdeo shots and pck the very frst frame as key frame. Wthn each vdeo shot, a cumulatve vsual sgnfcance functon s computed from vsual sgnfcance. Then a step sze s pcked to select the temporal enhancement frames. Note that the vsual sgnfcance and cumulatve vsual sgnfcance functons are causal functons. The paper s organzed nto the followng sectons: In secton 2, vsual sgnfcance analyss; secton 3, vdeo summary frame selecton, one-pass approach; secton 4, vdeo summary generaton, two-pass approach, and n secton 5, optmal codng. 2. VISUAL SIGNIFICANCE ANALYSIS Vsual Sgnfcance (VS) functon characterzes the mportance of frames n the orgnal vdeo sequence n helpng users understand the events. VS for frame s computed as weghted sum of color changes and moton: CLD VS wvs + w2 = VS () MAD where color change VS s the L2 dstance between two MPEG-7 [5] defned Color Layout Descrptors (CLD) [6] of frames and -: VS CLD = L Dst( CLD, CLD ) (2) 2 n whch CLD for frame s the 8x8 DCT transform coeffcents of the 8x8 pxel thumbnal mage downsampled from the orgnal frame. DCT n effect performs a Prncple Component Analyss (PCA) to capture most energy of the frame, whle the L2 dstance provdes metrc for how much has changed from frame to frame.

2 Moton actvty VS s based on MPEG-7 s Moton Actvty Descrptor (MAD) [7]: VS MAD VAR ( MV = (3) whch s the varance of the magntude of the moton vectors (MV) n frame. Note that f frame s a scene change frame, then the moton VS s set to zero. Examples of vsual sgnfcance analyss are shown n fgure vsual sgnfcance : bond sequence ) vsual sgnfcance : foreman sequence Fgure. Vsual Sgnfcance Analyss Examples When compares the VS plot wth the actual vdeo sequence, t s clear that VS captures the mportance of frames well. For example, n foreman sequence, spkes before frame 2 correspond to the head shakng and spkes around frame 25 correspond to the hand wavng and around 3 s the camera pannng. In another sequence bond, whch contans several scene cut and hgh moton actvty scenes, VS captures them accurately as well. Note that the moton VS s not requred n vsual sgnfcance analyss, snce the CLD based VS captures most of the nformaton and s computatonally much smpler. We fnd only n dense moton sequences lke soccer, where there are not much color layout change, MAD based VS wll be needed. By a thresholdng operaton on VS functons, orgnal vdeo sequence s chopped up nto vdeo shots,.e. the perceptually consstent groups of vdeo frames. In our experment we pcked threshold T = 2. for VS functons. Then the foreman sequence s a sngle shot and the bond sequence s broken nto 6 shots. Note that T can be changed to sut dfferent applcatons. Wthn a vdeo shot, the Cumulatve Vsual Sgnfcance (CVS) s computed as the summaton of VS of frames: CVS VS, f : VS < T = = n, n =, f : VS T In (4), n s the last key frame, T s the threshold. (4) Examples of CVS functons are shown n fgure 2 for foreman and bond sequences cumulatve vsual sgnfcance : foreman seq cumulatve vsual sgnfcance : bond seq Fgure 2. Cumulatve Vsual Sgnfcance Analyss Note that the slope of CVS functon ndcates the rate of vsual sgnfcance at frame tme. The steeper the slope the more nformaton s contaned. We wll desgn our frame selecton mechansm accordngly n the next secton. 3. FRAME SELECTION: ONE PASS APPROACH The VS and CVS functon gve us an approxmaton of how vsually sgnfcant events or nformaton s dstrbuted among frames. Wth ths nformaton, vdeo sequence s break up nto vdeo shots, and for each vdeo shot, a vdeo summary conssts of a key frame and multple temporal enhancement frames s selected. The overall operaton s llustrated n the psuedo code lsted below, n whch CVS[] s the cumulatve VS value for frame, and F_SEL[] s the frame selecton ndcator: V = ; = ; Whle ( < n) { If ( CVS[] == )

3 } F_SEL[] = ; #key frame V = ; Else f (CVS[]-V > ) F_SEL[] = E ; #enh frame V = CVS[]; Else F_SEL[] = ; #skp The start of a vdeo shot s dentfed by threshold on VS functon. The frst frame n a vdeo shot s always pcked as key frame for the shot, note that key frame here may have dfferent meanng from some prevous works. The total number of key frames of a vdeo sequence s determned by threshold T, pre-determned by experment. A steppng operaton s performed on CVS functon to select temporal enhancement frames for the shot. The ncrement of CVS from last frame selecton tme s computed, f t s greater than the step sze, then the frame s selected as a temporal enhancement frame. Example of ths operaton of vdeo summary frame selecton for foreman and bond sequences are llustrated n Fgure 3 and Fgure 4: cumulatve vsual sgnfcance 5 enh frame key frame Threshold T = 2. Stepsze Delta = 2. Frame Selecton : "Bond" Sequence Fgure 3. Vdeo Summary Frame Selecton For Bond enh frame key frame Threshold T=2. Stepsze Delta = 2. cumulatve vsual sgnfcance Frame Selecton : "Foreman" Sequence Fgure 4. Vdeo Summary Frame Selecton For Foreman Note that more frames are selected on steeper slopes of CVS functon. Ths s reasonable snce more nformaton s conveyed at those nstances. For a one-pass soluton, an ntal wll be pcked by the system, and accordng to vew-tme and bandwdth constrants, t can be adusted on the fly. 4. FRAME SELECTION: TWO-PASS APPROACH For a two-pass soluton, we have the luxury of fully analyze the sequence before generatng ts summary. For a gven sequence of N frames, f we want to reduce t to a vdeo summary of M frames, then the step sze can be determned precsely as the total vsual sgnfcance conveyed dvded by total frames avalable for temporal enhancement: CVSn = M = (5) where s total number of shots n the sequence, thus we wll have key frames and M- total enhancement frames; and n s the last frame n vdeo shot. Note that can also serve as a temporal dstorton metrc for the vdeo summary. 5. OPTIMAL CODING OF THE VIDEO SUMMARY For any gven vdeo coder, the optmal codng of vdeo summary becomes a frame level optmal bt allocaton problem. Ths needs accurate modelng of frame level Rate-Dstorton functon. Attempts to model the rate

4 dstorton curve of vdeo coder are lsted n [8][9]. However these approaches suffered from naccuracy when try to employ them n real vdeo coder. In [] a numercal soluton s proposed, the computaton cost nvolved s qute hgh. We try to solve ths problem wth a compromse of pure model based approach and operatonal rate-dstorton optmzaton approach. An analytcal dstorton model s assumed for both Intra and Inter frames, wth parameters provdng extra freedom to ft the actual operatonal Rate-Dstorton (R- D) curve of the chosen coder. For ntra frames, we assume: d = f b : X ) (6) ( and for nter frames, we assume: d = g b ; Y ) (7) ( where the dstorton of ntra frame or s a functon of bts spent b and codng complexty parameter vector X and Y. Functons f and g are convex functons and can be nverse proportonal or exponental type. Parameter vectors X and Y are solved from encodng an nter and ntra frame wth dfferent QPs. A recent work [] showed that a fast R-D operaton pont estmaton s possble by computng the rato of zeros n the transform coeffcents. Note also that the actvty of codng complexty parameter vectors X and Y are strongly correlated to that of the VS functon. So we only update X and Y after VS actvty s above certan threshold. Then we formulate the optmal codng problem as: arg mn f ( b ; X { b, b } M ) + = = sub. to : b + b = B = = M g( b ; Y ) (8) whch mnmze the average dstorton among vdeo summary frames wth bt budget constrant B. Snce functons f and g are convex and dfferentable, by ntroducng Lagrangan Multpler we can reduce (8) nto an un-constraned problem of mnmzng J: + [ f ( b ; X ) λb ] J ( λ) = + M [ g( b ; Y ) λb ] + = = (9) To satsfy frst order requrement, set the dervatve of J to zero: J b J b = f ' ( b ; X ' = g ( b ; Y ) + λ = ) + λ = () Solve () and wth total bt budget constrant n (8) we can fnd the optmal bt allocaton {b, b }. If constant dstorton s desred, an alternatve formulaton s for a gven bt budget B, fnd the mnmum constant dstorton d and the optmal bt allocaton {b, b } that wll meet the bt budget: arg sub. to : d () M f ( d ; X ) + = = g ( d ; Y ) = B Ths can be acheved by b-secton searchng. Work s underway to mplement ths method wth H.263 reference software TMN8 [2]. Varous models and codng complexty parameter estmaton methods are under nvestgaton. 6. SPATIAL AND TEMPORAL DISTORTION TRADE OFF When encodng a sequence of pctures, we need to consder both temporal and spatal dstortons. If we defne as a temporal dstorton metrc and average MSE dstorton D as the spatal dstorton metrc for a vdeo sequence, then the Rate-Dstorton functon becomes a convex surface defned on temporal and spatal dstorton axs: R h(, D) = (2) For any gven R=B, admssble (, D) pars are on a curve n -D plane. To fnd an optmal soluton a utlty functon for perceptual qualty s defned as: Q = (3) q(, D)

5 Whch s concave over -D plane. An optmal soluton can be found by solvng the constraned optmzaton problem: arg max q(, D), sub. to : h(, D) = B {, D} (4) Once s pcked by solvng (4), along wth VS functon threshold T, we can select frames to the optmal vdeo summary, and by solvng () and bt budget constrant (8) we can fnd the optmal bt allocaton among vdeo summary frames. Work s underway to fnd parameterzed analytc forms of functons h and q. For q, subectve evaluaton experment need to be set up. 7. EXPERIMENTAL RESULTS We encoded vdeo summary of foreman and bond sequences wth fxed threshold T=2., and varous step sze. It shows that the vdeo summary gracefully degrades the perceptual qualty wth the ncreasng of. Ths observaton s subectve, but an analytcal explanaton can be found from Fgure 3 and Fgure 4. For any gven, we always pck up enhancement frames for summary after a fxed amount of vsual nformaton, or sgnfcant events are conveyed. Ths ensures the temporal smoothness of the vdeo summary as compared wth some prevous clusterng approach. It s dffcult to fnd an obectve temporal dstorton measurement, but a plot of bts spent encodng the sequence as a functon of may demonstrate some ntutve clue, as shown n Fgure 5: Some sample vdeo summares wth dfferent are avalable on the web for evaluaton at: emo.html. 7. CONCLUSION AND FUTURE WORS In ths paper we demonstrated a vsual sgnfcance analyss based vdeo summary generaton method. It s computatonally smple and can operate n one-pass and two-pass scenaros. The summary generated by ths method acheves the graceful degradaton of perceptual qualty wth vew tme reducton and can be used n a varety of applcatons n securty, mltary and entertanment stuatons. Work s underway to fnd optmal encodng strategy for vdeo summary; good compromse between temporal resoluton and spatal PSNR qualty; subectve/obectve metrcs for vdeo summary qualty evaluaton. 7. REFERENCES [] Y. Wang, Z. Lu and J-C. Huang, Multmeda Content Analyss, IEEE Sgnal Processng Magazne, vol. 7, November 2. [2] H. Sundaram and S-F. Chang, Constraned Utlty Maxmzaton for Generatng Vsual Skms, IEEE Workshop on Content-Based Access of Image & Vdeo Lbrary, 2. [3] A. Grgenshohn and J. Boreczky, Tme-Constraned ey frame Selecton Technque, Proc. of IEEE Multmeda Computng and Systems (ICMCS), 999. bts bts expendture as functon of delta: bond sequence [4] Y. Gong and X. Lu, Vdeo Summarzaton wth Mnmal Vsual Content Redundances, Proc. of Int l Conference on Image Processng, 2. [5], Informaton Technology Multmeda Content Descrpton Interface Part 3: Vsual, ISO/IEC FCD [6] B. S. Manunath, J-R. Ohm, V. V. Vasudevan and A. Yamada, Color and Texture Descrptors, IEEE Trans. on Crcuts and Systems for Vdeo Technology, vol., June 2. [7] S. Jeannn and A. Dvakaran, MPEG-7 Vsual Moton Descrptors, IEEE Trans. on Crcuts and Systems for Vdeo Technology, vol., June delta Fgure 5. Bts Functon of, Bond Sequence [8] T. Chang and Y-Q. Zhang, A New Rate Control Scheme Usng Quadratc Rate Dstorton Model, IEEE Trans. on Crcuts and Systems for Vdeo Technology, vol.7, February 997.

6 [9] H-M. Hang and J-J. Chen, Source Model for Transform Vdeo Coder and Its Applcaton Part I: Fundamental Theory, IEEE Trans. on Crcuts and Systems for Vdeo Technology, vol.7, Aprl 997. [] L-J. Ln and A. Ortega, Bt-Rate Control Usng Pecewse Approxmaton Rate-Dstorton Characterstcs, IEEE Trans. on Crcuts and Systems for Vdeo Technology, vol.8, August 998. [] Z. He, J. Ca and C-W. Chen, Jont Source Channel Rate- Dstorton Analyss for Adaptve Mode Selecton and Rate Control n Wreless Vdeo Codng, IEEE Trans. on Crcuts and Systems for Vdeo Technology, vol.2, June 22. [2] Unversty of Brtsh Columba, H.263 Reference Software Model: TMN8.

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,

More information

Combined Rate Control and Mode Decision Optimization for MPEG-2 Transcoding with Spatial Resolution Reduction

Combined Rate Control and Mode Decision Optimization for MPEG-2 Transcoding with Spatial Resolution Reduction MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Combned Rate Control and Mode Decson Optmzaton for MPEG-2 Transcodng wth Spatal Resoluton Reducton TR2003-7 December 2003 Abstract Ths paper

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

More information

Video Content Representation using Optimal Extraction of Frames and Scenes

Video Content Representation using Optimal Extraction of Frames and Scenes Vdeo Content Representaton usng Optmal Etracton of rames and Scenes Nkolaos D. Doulam Anastasos D. Doulam Yanns S. Avrths and Stefanos D. ollas Natonal Techncal Unversty of Athens Department of Electrcal

More information

Support Vector Machines. CS534 - Machine Learning

Support Vector Machines. CS534 - Machine Learning Support Vector Machnes CS534 - Machne Learnng Perceptron Revsted: Lnear Separators Bnar classfcaton can be veed as the task of separatng classes n feature space: b > 0 b 0 b < 0 f() sgn( b) Lnear Separators

More information

ALGORITHM FOR H.264/AVC

ALGORITHM FOR H.264/AVC ISSN 1392 124X INFORMATION TECHNOLOGY AND CONTROL, 2010 Vol. 38, No. ISSN 1392 124X INFORMATION TECHNOLOGY AND CONTROL, 2011, Vol.40, No.3 1, 5 7 A NOVEL Novel Varance-Based VARIANCE-BASED Intra-FrameINTRA-FRAME

More information

End-to-end Distortion Estimation for RD-based Robust Delivery of Pre-compressed Video

End-to-end Distortion Estimation for RD-based Robust Delivery of Pre-compressed Video End-to-end Dstorton Estmaton for RD-based Robust Delvery of Pre-compressed Vdeo Ru Zhang, Shankar L. Regunathan and Kenneth Rose Department of Electrcal and Computer Engneerng Unversty of Calforna, Santa

More information

Efficient Video Coding with R-D Constrained Quadtree Segmentation

Efficient Video Coding with R-D Constrained Quadtree Segmentation Publshed on Pcture Codng Symposum 1999, March 1999 Effcent Vdeo Codng wth R-D Constraned Quadtree Segmentaton Cha-Wen Ln Computer and Communcaton Research Labs Industral Technology Research Insttute Hsnchu,

More information

CS 534: Computer Vision Model Fitting

CS 534: Computer Vision Model Fitting CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More information

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

More information

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for

More information

Performance Evaluation of Information Retrieval Systems

Performance Evaluation of Information Retrieval Systems Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence

More information

An Image Compression Algorithm based on Wavelet Transform and LZW

An Image Compression Algorithm based on Wavelet Transform and LZW An Image Compresson Algorthm based on Wavelet Transform and LZW Png Luo a, Janyong Yu b School of Chongqng Unversty of Posts and Telecommuncatons, Chongqng, 400065, Chna Abstract a cylpng@63.com, b y27769864@sna.cn

More information

An Improved Image Segmentation Algorithm Based on the Otsu Method

An Improved Image Segmentation Algorithm Based on the Otsu Method 3th ACIS Internatonal Conference on Software Engneerng, Artfcal Intellgence, Networkng arallel/dstrbuted Computng An Improved Image Segmentaton Algorthm Based on the Otsu Method Mengxng Huang, enjao Yu,

More information

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems

More information

Classification Based Mode Decisions for Video over Networks

Classification Based Mode Decisions for Video over Networks Classfcaton Based Mode Decsons for Vdeo over Networks Deepak S. Turaga and Tsuhan Chen Advanced Multmeda Processng Lab Tranng data for Inter-Intra Decson Inter-Intra Decson Regons pdf 6 5 6 5 Energy 4

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

Efficient Content Representation in MPEG Video Databases

Efficient Content Representation in MPEG Video Databases Effcent Content Representaton n MPEG Vdeo Databases Yanns S. Avrths, Nkolaos D. Doulams, Anastasos D. Doulams and Stefanos D. Kollas Department of Electrcal and Computer Engneerng Natonal Techncal Unversty

More information

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.

More information

Wavelet-Based Image Compression System with Linear Distortion Control

Wavelet-Based Image Compression System with Linear Distortion Control Je-Hung Lu, Kng-Chu Hung Wavelet-Based Image Compresson System wth Lnear Dstorton Control Je-Hung Lu, Kng-Chu Hung Insttute of Engneerng Scence and Technology Natonal Kaohsung Frst Unversty of Scence and

More information

Optimal Scheduling of Capture Times in a Multiple Capture Imaging System

Optimal Scheduling of Capture Times in a Multiple Capture Imaging System Optmal Schedulng of Capture Tmes n a Multple Capture Imagng System Tng Chen and Abbas El Gamal Informaton Systems Laboratory Department of Electrcal Engneerng Stanford Unversty Stanford, Calforna 9435,

More information

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

Positive Semi-definite Programming Localization in Wireless Sensor Networks

Positive Semi-definite Programming Localization in Wireless Sensor Networks Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer

More information

y and the total sum of

y and the total sum of Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton

More information

Active Contours/Snakes

Active Contours/Snakes Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng

More information

Discrete Cosine Transform Optimization in Image Compression Based on Genetic Algorithm

Discrete Cosine Transform Optimization in Image Compression Based on Genetic Algorithm 015 8th Internatonal Congress on Image and Sgnal Processng (CISP 015) Dscrete Cosne Transform Optmzaton n Image Compresson Based on Genetc Algorthm LIU Yuan-yuan 1 CHE He-xn 1 College of Communcaton Engneerng,

More information

Enhanced AMBTC for Image Compression using Block Classification and Interpolation

Enhanced AMBTC for Image Compression using Block Classification and Interpolation Internatonal Journal of Computer Applcatons (0975 8887) Volume 5 No.0, August 0 Enhanced AMBTC for Image Compresson usng Block Classfcaton and Interpolaton S. Vmala Dept. of Comp. Scence Mother Teresa

More information

GSLM Operations Research II Fall 13/14

GSLM Operations Research II Fall 13/14 GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are

More information

Fitting: Deformable contours April 26 th, 2018

Fitting: Deformable contours April 26 th, 2018 4/6/08 Fttng: Deformable contours Aprl 6 th, 08 Yong Jae Lee UC Davs Recap so far: Groupng and Fttng Goal: move from array of pxel values (or flter outputs) to a collecton of regons, objects, and shapes.

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning the Kernel Parameters in Kernel Minimum Distance Classifier Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department

More information

Improved H.264 Rate Control by Enhanced MAD-Based Frame Complexity Prediction

Improved H.264 Rate Control by Enhanced MAD-Based Frame Complexity Prediction Journal of Vsual Communcaton and Image Representaton (Specal Issue on Emergng H.64/AVC Vdeo Codng Standard), Elsever Scence, May 005 Improved H.64 Rate Control by Enhanced -Based Frame Complexty Predcton

More information

SAO: A Stream Index for Answering Linear Optimization Queries

SAO: A Stream Index for Answering Linear Optimization Queries SAO: A Stream Index for Answerng near Optmzaton Queres Gang uo Kun-ung Wu Phlp S. Yu IBM T.J. Watson Research Center {luog, klwu, psyu}@us.bm.com Abstract near optmzaton queres retreve the top-k tuples

More information

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan

More information

Classifier Selection Based on Data Complexity Measures *

Classifier Selection Based on Data Complexity Measures * Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.

More information

Intra-Parametric Analysis of a Fuzzy MOLP

Intra-Parametric Analysis of a Fuzzy MOLP Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

Recognizing Faces. Outline

Recognizing Faces. Outline Recognzng Faces Drk Colbry Outlne Introducton and Motvaton Defnng a feature vector Prncpal Component Analyss Lnear Dscrmnate Analyss !"" #$""% http://www.nfotech.oulu.f/annual/2004 + &'()*) '+)* 2 ! &

More information

2 optmal per-pxel estmate () whch we had proposed for non-scalable vdeo codng [5] [6]. The extended s shown to accurately account for both temporal an

2 optmal per-pxel estmate () whch we had proposed for non-scalable vdeo codng [5] [6]. The extended s shown to accurately account for both temporal an Scalable Vdeo Codng wth Robust Mode Selecton Ru Zhang, Shankar L. Regunathan and Kenneth Rose Department of Electrcal and Computer Engneerng Unversty of Calforna Santa Barbara, CA 906 Abstract We propose

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

An Attention Based Method For Motion Detection And Estimation

An Attention Based Method For Motion Detection And Estimation An Attenton Based Method For Moton Detecton And Estmaton Shje Zhang and Fred Stentford Department of Electronc and Electrcal Engneerng Unversty College London, Adastral Par Campus, Ross Buldng Martlesham

More information

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth

More information

Fast Intra- and Inter-Prediction Mode Decision in H.264 Advanced Video Coding

Fast Intra- and Inter-Prediction Mode Decision in H.264 Advanced Video Coding Fast Intra- and Inter-Predcton Mode Decson n H.264 Advanced Vdeo Codng Mehd Jafar Islamc Azad Unversty, S and R Branch Department of Communcaton Engneerng P.O.Box 455-775, Tehran, Iran mjafar@mal.uk.ac.r

More information

Outline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1

Outline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1 4/14/011 Outlne Dscrmnatve classfers for mage recognton Wednesday, Aprl 13 Krsten Grauman UT-Austn Last tme: wndow-based generc obect detecton basc ppelne face detecton wth boostng as case study Today:

More information

A DCVS Reconstruction Algorithm for Mine Video Monitoring Image Based on Block Classification

A DCVS Reconstruction Algorithm for Mine Video Monitoring Image Based on Block Classification 1 3 4 5 6 7 8 9 10 11 1 13 14 15 16 17 18 19 0 1 Artcle A DCVS Reconstructon Algorthm for Mne Vdeo Montorng Image Based on Block Classfcaton Xaohu Zhao 1,, Xueru Shen 1,, *, Kuan Wang 1, and Wanme L 1,

More information

Related-Mode Attacks on CTR Encryption Mode

Related-Mode Attacks on CTR Encryption Mode Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory

More information

Network Coding as a Dynamical System

Network Coding as a Dynamical System Network Codng as a Dynamcal System Narayan B. Mandayam IEEE Dstngushed Lecture (jont work wth Dan Zhang and a Su) Department of Electrcal and Computer Engneerng Rutgers Unversty Outlne. Introducton 2.

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on

More information

An Optimal Bandwidth Allocation and Data Droppage Scheme for Differentiated Services in a Wireless Network

An Optimal Bandwidth Allocation and Data Droppage Scheme for Differentiated Services in a Wireless Network Purdue Unversty Purdue e-pubs ECE Techncal Reports Electrcal and Computer Engneerng 3--7 An Optmal Bandwdth Allocaton and Data Droppage Scheme for Dfferentated Servces n a Wreless Network Waseem Shekh

More information

BITRATE ALLOCATION FOR MULTIPLE VIDEO STREAMS AT COMPETITIVE EQUILIBRIA

BITRATE ALLOCATION FOR MULTIPLE VIDEO STREAMS AT COMPETITIVE EQUILIBRIA BITRATE ALLCATIN FR MULTIPLE VIDE STREAMS AT CMPETITIVE EQUILIBRIA Mayank Twar, Theodore Groves, and Pamela Cosman Department of Electrcal and Computer Engneerng, Department of Economcs, Unversty of Calforna,

More information

Hybrid Non-Blind Color Image Watermarking

Hybrid Non-Blind Color Image Watermarking Hybrd Non-Blnd Color Image Watermarkng Ms C.N.Sujatha 1, Dr. P. Satyanarayana 2 1 Assocate Professor, Dept. of ECE, SNIST, Yamnampet, Ghatkesar Hyderabad-501301, Telangana 2 Professor, Dept. of ECE, AITS,

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and

More information

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process

More information

Fast Intra- and Inter-Prediction Mode Decision in H.264 Advanced Video Coding

Fast Intra- and Inter-Prediction Mode Decision in H.264 Advanced Video Coding 130 IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.8 No.5, May 2008 Fast Intra- and Inter-Predcton Mode Decson n H.264 Advanced Vdeo Codng Mehd Jafar and Shohreh Kasae, Islamc

More information

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty

More information

Programming in Fortran 90 : 2017/2018

Programming in Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values

More information

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques

More information

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

An Image Fusion Approach Based on Segmentation Region

An Image Fusion Approach Based on Segmentation Region Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua

More information

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information

LOOP ANALYSIS. The second systematic technique to determine all currents and voltages in a circuit

LOOP ANALYSIS. The second systematic technique to determine all currents and voltages in a circuit LOOP ANALYSS The second systematic technique to determine all currents and voltages in a circuit T S DUAL TO NODE ANALYSS - T FRST DETERMNES ALL CURRENTS N A CRCUT AND THEN T USES OHM S LAW TO COMPUTE

More information

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

More information

ARTICLE IN PRESS. Signal Processing: Image Communication

ARTICLE IN PRESS. Signal Processing: Image Communication Sgnal Processng: Image Communcaton 23 (2008) 754 768 Contents lsts avalable at ScenceDrect Sgnal Processng: Image Communcaton journal homepage: www.elsever.com/locate/mage Dstrbuted meda rate allocaton

More information

High-Boost Mesh Filtering for 3-D Shape Enhancement

High-Boost Mesh Filtering for 3-D Shape Enhancement Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,

More information

Private Information Retrieval (PIR)

Private Information Retrieval (PIR) 2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stock-market

More information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A New Approach For the Ranking of Fuzzy Sets With Different Heights New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays

More information

Optimal Workload-based Weighted Wavelet Synopses

Optimal Workload-based Weighted Wavelet Synopses Optmal Workload-based Weghted Wavelet Synopses Yoss Matas School of Computer Scence Tel Avv Unversty Tel Avv 69978, Israel matas@tau.ac.l Danel Urel School of Computer Scence Tel Avv Unversty Tel Avv 69978,

More information

What are the camera parameters? Where are the light sources? What is the mapping from radiance to pixel color? Want to solve for 3D geometry

What are the camera parameters? Where are the light sources? What is the mapping from radiance to pixel color? Want to solve for 3D geometry Today: Calbraton What are the camera parameters? Where are the lght sources? What s the mappng from radance to pel color? Why Calbrate? Want to solve for D geometry Alternatve approach Solve for D shape

More information

Lecture 13: High-dimensional Images

Lecture 13: High-dimensional Images Lec : Hgh-dmensonal Images Grayscale Images Lecture : Hgh-dmensonal Images Math 90 Prof. Todd Wttman The Ctadel A grayscale mage s an nteger-valued D matrx. An 8-bt mage takes on values between 0 and 55.

More information

Dynamic Code Block Size for JPEG 2000

Dynamic Code Block Size for JPEG 2000 Dynamc Code Block Sze for JPEG 2000 Png-Sng Tsa a, Yann LeCornec b a Dept. of Computer Scence, Unv. of Texas Pan Amercan, 1201 W. Unv. Dr., Ednburg, TX USA 78539-2999; b Sgma Desgns, Inc., 1778 McCarthy

More information

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero

More information

Rate-Complexity Scalable Multi-view Image Coding with Adaptive Disparity-Compensated Wavelet Lifting

Rate-Complexity Scalable Multi-view Image Coding with Adaptive Disparity-Compensated Wavelet Lifting SSN 746-7659, England, UK Journal of nformaton and Computng Scence Vol. 4, No. 3, 9, pp. -3 Rate-Complext Scalable Mult-vew mage Codng wth Adaptve Dspart-Compensated Wavelet ftng Pongsak asang, Chang-su

More information

Object-Based Techniques for Image Retrieval

Object-Based Techniques for Image Retrieval 54 Zhang, Gao, & Luo Chapter VII Object-Based Technques for Image Retreval Y. J. Zhang, Tsnghua Unversty, Chna Y. Y. Gao, Tsnghua Unversty, Chna Y. Luo, Tsnghua Unversty, Chna ABSTRACT To overcome the

More information

On the Efficiency of Swap-Based Clustering

On the Efficiency of Swap-Based Clustering On the Effcency of Swap-Based Clusterng Pas Fränt and Oll Vrmaok Department of Computer Scence, Unversty of Joensuu, Fnland {frant, ovrma}@cs.oensuu.f Abstract. Random swap-based clusterng s very smple

More information

A Robust Method for Estimating the Fundamental Matrix

A Robust Method for Estimating the Fundamental Matrix Proc. VIIth Dgtal Image Computng: Technques and Applcatons, Sun C., Talbot H., Ourseln S. and Adraansen T. (Eds.), 0- Dec. 003, Sydney A Robust Method for Estmatng the Fundamental Matrx C.L. Feng and Y.S.

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

A Background Subtraction for a Vision-based User Interface *

A Background Subtraction for a Vision-based User Interface * A Background Subtracton for a Vson-based User Interface * Dongpyo Hong and Woontack Woo KJIST U-VR Lab. {dhon wwoo}@kjst.ac.kr Abstract In ths paper, we propose a robust and effcent background subtracton

More information

Face Recognition University at Buffalo CSE666 Lecture Slides Resources:

Face Recognition University at Buffalo CSE666 Lecture Slides Resources: Face Recognton Unversty at Buffalo CSE666 Lecture Sldes Resources: http://www.face-rec.org/algorthms/ Overvew of face recognton algorthms Correlaton - Pxel based correspondence between two face mages Structural

More information

Repeater Insertion for Two-Terminal Nets in Three-Dimensional Integrated Circuits

Repeater Insertion for Two-Terminal Nets in Three-Dimensional Integrated Circuits Repeater Inserton for Two-Termnal Nets n Three-Dmensonal Integrated Crcuts Hu Xu, Vasls F. Pavlds, and Govann De Mchel LSI - EPFL, CH-5, Swtzerland, {hu.xu,vasleos.pavlds,govann.demchel}@epfl.ch Abstract.

More information

Hierarchical clustering for gene expression data analysis

Hierarchical clustering for gene expression data analysis Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally

More information

Network Intrusion Detection Based on PSO-SVM

Network Intrusion Detection Based on PSO-SVM TELKOMNIKA Indonesan Journal of Electrcal Engneerng Vol.1, No., February 014, pp. 150 ~ 1508 DOI: http://dx.do.org/10.11591/telkomnka.v1.386 150 Network Intruson Detecton Based on PSO-SVM Changsheng Xang*

More information

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research

More information

Shape-adaptive DCT and Its Application in Region-based Image Coding

Shape-adaptive DCT and Its Application in Region-based Image Coding Internatonal Journal of Sgnal Processng, Image Processng and Pattern Recognton, pp.99-108 http://dx.do.org/10.14257/sp.2014.7.1.10 Shape-adaptve DCT and Its Applcaton n Regon-based Image Codng Yamn Zheng,

More information

Query Clustering Using a Hybrid Query Similarity Measure

Query Clustering Using a Hybrid Query Similarity Measure Query clusterng usng a hybrd query smlarty measure Fu. L., Goh, D.H., & Foo, S. (2004). WSEAS Transacton on Computers, 3(3), 700-705. Query Clusterng Usng a Hybrd Query Smlarty Measure Ln Fu, Don Hoe-Lan

More information

7/12/2016. GROUP ANALYSIS Martin M. Monti UCLA Psychology AGGREGATING MULTIPLE SUBJECTS VARIANCE AT THE GROUP LEVEL

7/12/2016. GROUP ANALYSIS Martin M. Monti UCLA Psychology AGGREGATING MULTIPLE SUBJECTS VARIANCE AT THE GROUP LEVEL GROUP ANALYSIS Martn M. Mont UCLA Psychology NITP AGGREGATING MULTIPLE SUBJECTS When we conduct mult-subject analyss we are tryng to understand whether an effect s sgnfcant across a group of people. Whether

More information

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples

More information

3. CR parameters and Multi-Objective Fitness Function

3. CR parameters and Multi-Objective Fitness Function 3 CR parameters and Mult-objectve Ftness Functon 41 3. CR parameters and Mult-Objectve Ftness Functon 3.1. Introducton Cogntve rados dynamcally confgure the wreless communcaton system, whch takes beneft

More information