GEMINI GEneric Multimedia INdexIng
|
|
- Lucinda Powers
- 5 years ago
- Views:
Transcription
1 GEMINI GEnerc Multmeda INdexIng Last lecture, LSH Is there another possble soluton? Do we need to perform ANN? 1
2 GEnerc Multmeda INdexIng dstance measure Sub-pattern Match quck and drty test Lower boundng lemma 1-D Tme Sequences Color hstograms Color auto-correlogram Shapes GEnerc Multmeda INdexIng Gven a database of multmeda objects Desgn fast search algorthms that locate objects that match a query object, exactly or approxmately Objects: 1-d tme sequences Dgtzed voce or musc 2-d color mages 2-d or 3-d gray scale medcal mages Vdeo clps E.g.: Fnd companes whose stock prces move smlarly 2
3 Applcatons tme seres: fnancal, marketng (clck-streams!), ECGs, sound; mages: medcne, dgtal lbrares, educaton, art hgher-d sgnals: scentfc db (eg., astrophyscs), medcne (MRI scans), entertanment (vdeo) Sample queres Fnd medcal cases smlar to Smth's Fnd pars of stocks that move n sync Fnd pars of documents that are smlar (plagarsm?) Fnd faces smlar to Tger Woods 3
4 $prce $prce $prce day day dstance functon: by expert day (eg, Eucldean dstance) Generc Multmeda Indexng 1 st step: provde a measure for the dstance between two objects Dstance functon d(): Gven two objects O 1, O 2 the dstance (=dssmlarty) of the two objects s denoted by d(o 1, O 2 ) E.g., Eucldean dstance (sum of squared dfferences) of two equal-length tme seres 4
5 ε-smlarty query Gven a query object Q, fnd all objects O from the database are ε-smlar (dentcal for ε = 0) to Q {O DB d(q, O ) < ε}. Types of Smlarty Queres Whole match queres: Gven a collecton of S objects O 1,, O s and a query object Q fnd data objects that are wthn dstance ε from Q 5
6 Types of Smlarty Queres Sub-pattern Match: Gven a collecton of S objects O 1,, O S and a query (sub-) object Q and a tolerance ε dentfy the parts of the data objects that match the query Q Idea method requrements Fast: sequental scannng and dstance calculaton wth each and every object too slow for large databases Dynamc: easy to nsert, delete, and update objects 6
7 Basc dea Focus on whole match queres Gven a collecton of S objects O 1,, O s, a dstance/ds-smlarty functon d(o, O j ), and a query object Q fnd data objects that are wthn dstance ε from Q Sequental scannng? May be too slow.. for the followng reasons: Dstance computaton s expensve (e.g., edtng dstance n DNA strngs) The Database sze S may be huge Faster alternatve? GEnerc Multmeda INdexIng Chrstos Faloutsos QBIC 1994 A feature extracton functon maps the hgh dmensonal objects nto a low dmensonal space Objects that are very dssmlar n the feature space, are also very dssmlar n the orgnal space 7
8 Basc dea Faster alternatve: Step 1: a quck and drty test to dscard quckly the vast majorty of non-qualfyng objects Step 2: use of SAMs (R-trees, Hlbert-Curve,..) to acheve faster than sequental searchng Example: Database of yearly stock prce movements Eucldean dstance functon Characterze wth a sngle number ( feature ) Or use two or more features Basc dea - llustraton S1 Feature2 F(S1) day F(Sn) Sn Feature day A query wth tolerance ε becomes a sphere wth radus ε 8
9 Basc dea cauton! The mappng F() from objects to k-dm. ponts should not dstort the dstances d(): dstance of two objects d feature (): dstance of ther correspondng feature vectors Ideally, perfect preservaton of dstances In practce, a guarantee of no false dsmssals How? Objects represented by vectors that are very dssmlar n the feature space are expected to be very dssmlar n the orgnal space If the dstances n the feature space are always smaller or equal than the dstances n the orgnal space, a bound whch s vald n both spaces can be determned 9
10 The dstance of smlar objects s smaller or equal to ε n the orgnal space and, consequently, t s smaller or equal to ε n the feature space as well... Lower boundng lemma f dstance of smlar objects s smaller or equal to ε n orgnal space then t s as well smaller or equal ε n the feature space 10
11 d feature (F(O 1 ),(O 2 )) d(o 1,O 2 ) ε o.k. d(o 1,O 2 ) ε d feature (F(O 1 ),F(O 2 )) WRONG! d feature (F(O 1 ),F(O 2 )) ε d(o 1,O 2 ) ε d feature (F(O 1 ),F(O 2 )) ε d(o 1,O 2 )? No object n the feature space wll be mssed (false dsmssals) n the feature space There wll be some objects that are not smlar n the orgnal space (false hnts/alarms) That means that we are guaranteed to have selected all the objects we wanted plus some addtonal false hts n the feature space In the second step, false hts have to be fltered from the set of the selected objects through comparson n the orgnal space 11
12 Tme sequences whte nose brown nose Fourer spectrum... n log-log Tme sequences Concluson: colored noses are well approxmated by ther frst few Fourer coeffcents Colored noses appear n nature 12
13 Tme sequences Eg.: GEMINI Important: Q: how to extract features? A: f I have only one number to descrbe my object, what should ths be? 13
14 1-D Tme Sequences Dstance functon: Eucldean dstance Fnd features that: Preserve/lower-bound the dstance Carry as much nformaton as possble(reduce false alarms) If we are allowed to use only one feature what would ths be? The average extendng t 1-D Tme Sequences... If we are allowed to use only one feature what would ths be? The average extendng t The average of 1st half, of the 2nd half, of the 1st quarter, etc. Coeffcents of the Fourer transform (DFT), wavelet transform, etc. 14
15 Feature extractng functon 1. Defne a dstance functon 2. Fnd a feature extracton functon F() that satsfes the boundng lemma Example: Dscrete Fourer Transform (DFT) preserve Eucldan dstances between sgnals (Parseval's theorem) F() = DTF whch keeps the frst coeffcents of the transform 1-D Tme Sequences Show that the dstance n feature space lower-bounds the actual dstance DFT? Parseval s Theorem: DFT preserves the energy of the sgnal as well as the dstances between two sgnals d(x,y) = d(x,y) where X and Y are the Fourer transforms of x and y If we keep the frst k n coeffcents of DFT we lower-bound the actual dstance d feature (F(x),F(y)) = k 1 2 X f Y f n 1 X f Y f f = 0 f = 0 = 0 2 n 1 = x y 2 d(x,y) 15
16 Tme sequences - results keep the frst 2-3 Fourer coeffcents faster than seq. scan no false dsmssals total tme cleanup-tme r-tree tme # coeff. kept Tme sequences - mprovements: could use Wavelets, or DCT could use segment averages 16
17 Images - color what s an mage? A: 2-d array 2-D color mages Color hstograms Each color mage a 2-d array of pxels Each pxel 3 color components (R,G,B) h colors each color denotng a pont n 3-d color space (as hgh as 2 24 colors) For each mage compute the h-element color hstogram each component s the percentage of pxels that are most smlar to that color The hstogram of mage I s defned as: For a color C, H c (I) represents the number of pxels of color C n mage I OR: For any pxel n mage I, H c (I) represents the possblty of that pxel havng color C. 17
18 2-D color mages Color hstograms Usually cluster smlar colors together and choose one representatve color for each color bn Most commercal CBIR systems nclude color hstogram as one of the features (e.g., QBIC of IBM) No space nformaton Color hstograms - dstance One method to measure the dstance between two hstograms x and y s: t d 2 ( x, y) = ( x y) A ( x y) = a ( x y )( x y ) h h h j j j j where the color-to-color smlarty matrx A has entres a j that descrbe the smlarty between color and color j 18
19 Images - color Mathematcally, the dstance functon s: Color hstograms lower boundng 1 st step: defne the dstance functon between two color mages d()=d h () 2 nd step: fnd numercal features (one or more) whose Eucldean dstance lower-bounds d h () If we allowed to use one numercal feature to descrbe the color mage what should t be? Avg. amount for each color component (R,G,B) t x = ( R, G, B ) avg R avg = (1/ P) avg P Where, and smlarly for G and B avg p= 1 R( p) Where P s the number of pxels n the mage, R(p) s the red component (ntensty) of the p-th pxel 19
20 Color hstograms lower boundng Gven the average color vectors and of two mages we defne d avg () as the Eucldean dstance between the 3-d average color vectors 3 2 t 2 davg ( x, y) = ( x y) ( x y) = ( x y ) = 1 3 rd step: to prove that the feature dstance d avg () lower-bounds the actual dstance d h ()......by the ``Quadratc Dstance Boundng'' theorem t s guaranteed that the dstance between vectors representng hstograms s bgger or equal as the dstance between hstograms of average color mages. The proof of the ``Quadratc Dstance Boundng'' theorem s based upon the unconstraned mnmzaton problem usng Langrange multplers Man dea of approach: Frst a flterng usng the average (R,G,B) color, then a more accurate matchng usng the full h-element hstogram x y Images - color tme seq scan performance: w/ avg RGB selectvty 20
21 Color auto-correlogram pck any pxel p1 of color C n the mage I at dstance k away from p1 pck another pxel p2 what s the probablty that p2 s also of color C? Red? k P2 P1 Image: I Color auto-correlogram The auto-correlogram of mage I for color C, dstance k: γ ( k ) C ( I) Pr[ p1 p2 = k, p2 IC p1 I C ] Integrate both color nformaton and space nformaton 21
22 Color auto-correlogram Implementatons Pxel Dstance Measures Use D8 dstance (also called chessboard dstance): d max ( p,q) = max( p x q x, p y q y ) Choose dstance k=1,3,5,7 Computaton complexty: Hstogram: Correlogram: Ο( n 2 ) Ο(134* n 2 ) 22
23 23 Implementatons Features Dstance Measures: D( f(i 1 ) - f(i 2 ) ) s small I 1 and I 2 are smlar m= R,G,B k=dstance or hstogram: For correlogram: + + ] [ ) ' ( ) ( 1 ') ( ) ( ' m C C C C h I h I h I h I h I I + + ] [ ], [ ) ( ) ( ) ( ) ( ') ( ) ( 1 ') ( ) ( ' d k m k C k C k C k C I I I I I I γ γ γ γ γ Color Hstogram vs Correlogram
24 Color Hstogram vs Correlogram Correlogram method: 1 st Hstogram method: 48 th Color Hstogram vs Correlogram Correlogram method: 1 st Hstogram method: 31 th 24
25 Color Hstogram vs Correlogram C: 178 th H: 230 th C: 1 st H: 1 st C: 1st H: 3 rd C: 5th H: 18 th Color Hstogram vs Correlogram The color correlogram descrbes the global dstrbuton of local spatal correlatons of colors. It s easy to compute It s more stable than the color hstogram method 25
26 Images - shapes Dstance functon: Eucldean, on the area Q: how to do dm. reducton? A: Karhunen-Loeve (PCA) Images - shapes Performance: ~10x faster log(# of I/Os) all kept # of features kept 26
27 Mutlmeda Indexng Conclusons GEMINI s a popular method Whole matchng problem Should pay attenton to: Dstance functons Feature Extracton functons Lower Boundng Partcular applcaton Conclusons GEMINI works for any settng (tme sequences, mages, etc) uses a quck and drty flter faster than seq. scan 27
28 GEnerc Multmeda INdexIng dstance measure Sub-pattern Match quck and drty test Lower boundng lemma 1-D Tme Sequences Color hstograms Color auto-correlogram Shapes 28
Tutorial 2. COMP4134 Biometrics Authentication. February 9, Jun Xu, Teaching Asistant
Tutoral 2 COMP434 ometrcs uthentcaton Jun Xu, Teachng sstant csjunxu@comp.polyu.edu.hk February 9, 207 Table of Contents Problems Problem : nswer the questons Problem 2: Power law functon Problem 3: Convoluton
More informationReport on Image warping
Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More 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 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 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 informationCS 468 Lecture 16: Isometry Invariance and Spectral Techniques
CS 468 Lecture 16: Isometry Invarance and Spectral Technques Justn Solomon Scrbe: Evan Gawlk Introducton. In geometry processng, t s often desrable to characterze the shape of an object n a manner that
More informationEfficient, General Point Cloud Registration with Kernel Feature Maps
Effcent, General Pont Cloud Regstraton wth Kernel Feature Maps Hanchen Xong, Sandor Szedmak, Justus Pater Insttute of Computer Scence Unversty of Innsbruck 30 May 2013 Hanchen Xong (Un.Innsbruck) 3D Regstraton
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 informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More 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 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 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 informationPulse Coded Modulation
Pulse Coded Modulaton PCM (Pulse Coded Modulaton) s a voce codng technque defned by the ITU-T G.711 standard and t s used n dgtal telephony to encode the voce sgnal. The frst step n the analog to dgtal
More informationInstance-Based Learning (a.k.a. memory-based learning) Part I: Nearest Neighbor Classification
Instance-Based earnng (a.k.a. memory-based learnng) Part I: Nearest Neghbor Classfcaton Note to other teachers and users of these sldes. Andrew would be delghted f you found ths source materal useful n
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 informationLecture 4: Universal Hash Functions/Streaming Cont d
CSE 5: Desgn and Analyss of Algorthms I Sprng 06 Lecture 4: Unversal Hash Functons/Streamng Cont d Lecturer: Shayan Oves Gharan Aprl 6th Scrbe: Jacob Schreber Dsclamer: These notes have not been subjected
More informationLecture 10: May 6, 2013
TTIC/CMSC 31150 Mathematcal Toolkt Sprng 013 Madhur Tulsan Lecture 10: May 6, 013 Scrbe: Wenje Luo In today s lecture, we manly talked about random walk on graphs and ntroduce the concept of graph expander,
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 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 informationAssessing inter-annual and seasonal variability Least square fitting with Matlab: Application to SSTs in the vicinity of Cape Town
Assessng nter-annual and seasonal varablty Least square fttng wth Matlab: Applcaton to SSTs n the vcnty of Cape Town Francos Dufos Department of Oceanography/ MARE nsttute Unversty of Cape Town Introducton
More informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More informationChapter 15 Student Lecture Notes 15-1
Chapter 15 Student Lecture Notes 15-1 Basc Busness Statstcs (9 th Edton) Chapter 15 Multple Regresson Model Buldng 004 Prentce-Hall, Inc. Chap 15-1 Chapter Topcs The Quadratc Regresson Model Usng Transformatons
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 informationUNIVERSITY OF TORONTO Faculty of Arts and Science. December 2005 Examinations STA437H1F/STA1005HF. Duration - 3 hours
UNIVERSITY OF TORONTO Faculty of Arts and Scence December 005 Examnatons STA47HF/STA005HF Duraton - hours AIDS ALLOWED: (to be suppled by the student) Non-programmable calculator One handwrtten 8.5'' x
More informationHomework Assignment 3 Due in class, Thursday October 15
Homework Assgnment 3 Due n class, Thursday October 15 SDS 383C Statstcal Modelng I 1 Rdge regresson and Lasso 1. Get the Prostrate cancer data from http://statweb.stanford.edu/~tbs/elemstatlearn/ datasets/prostate.data.
More informationLecture 3: Shannon s Theorem
CSE 533: Error-Correctng Codes (Autumn 006 Lecture 3: Shannon s Theorem October 9, 006 Lecturer: Venkatesan Guruswam Scrbe: Wdad Machmouch 1 Communcaton Model The communcaton model we are usng conssts
More information8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars
More informationFourier Transform. Additive noise. Fourier Tansform. I = S + N. Noise doesn t depend on signal. We ll consider:
Flterng Announcements HW2 wll be posted later today Constructng a mosac by warpng mages. CSE252A Lecture 10a Flterng Exampel: Smoothng by Averagng Kernel: (From Bll Freeman) m=2 I Kernel sze s m+1 by m+1
More 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 informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More 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 informationHandling Uncertain Spatial Data: Comparisons between Indexing Structures. Bir Bhanu, Rui Li, Chinya Ravishankar and Jinfeng Ni
Handlng Uncertan Spatal Data: Comparsons between Indexng Structures Br Bhanu, Ru L, Chnya Ravshankar and Jnfeng N Abstract Managng and manpulatng uncertanty n spatal databases are mportant problems for
More informationA Network Intrusion Detection Method Based on Improved K-means Algorithm
Advanced Scence and Technology Letters, pp.429-433 http://dx.do.org/10.14257/astl.2014.53.89 A Network Intruson Detecton Method Based on Improved K-means Algorthm Meng Gao 1,1, Nhong Wang 1, 1 Informaton
More informationAutomatic Object Trajectory- Based Motion Recognition Using Gaussian Mixture Models
Automatc Object Trajectory- Based Moton Recognton Usng Gaussan Mxture Models Fasal I. Bashr, Ashfaq A. Khokhar, Dan Schonfeld Electrcal and Computer Engneerng, Unversty of Illnos at Chcago. Chcago, IL,
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 informationWorkshop: Approximating energies and wave functions Quantum aspects of physical chemistry
Workshop: Approxmatng energes and wave functons Quantum aspects of physcal chemstry http://quantum.bu.edu/pltl/6/6.pdf Last updated Thursday, November 7, 25 7:9:5-5: Copyrght 25 Dan Dll (dan@bu.edu) Department
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 informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationLecture 21: Numerical methods for pricing American type derivatives
Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)
More informationarxiv:cs.cv/ Jun 2000
Correlaton over Decomposed Sgnals: A Non-Lnear Approach to Fast and Effectve Sequences Comparson Lucano da Fontoura Costa arxv:cs.cv/0006040 28 Jun 2000 Cybernetc Vson Research Group IFSC Unversty of São
More informationCHAPTER 17 Amortized Analysis
CHAPTER 7 Amortzed Analyss In an amortzed analyss, the tme requred to perform a sequence of data structure operatons s averaged over all the operatons performed. It can be used to show that the average
More informationCommunication with AWGN Interference
Communcaton wth AWG Interference m {m } {p(m } Modulator s {s } r=s+n Recever ˆm AWG n m s a dscrete random varable(rv whch takes m wth probablty p(m. Modulator maps each m nto a waveform sgnal s m=m
More informationRegularized Discriminant Analysis for Face Recognition
1 Regularzed Dscrmnant Analyss for Face Recognton Itz Pma, Mayer Aladem Department of Electrcal and Computer Engneerng, Ben-Guron Unversty of the Negev P.O.Box 653, Beer-Sheva, 845, Israel. Abstract Ths
More informationDigital Modems. Lecture 2
Dgtal Modems Lecture Revew We have shown that both Bayes and eyman/pearson crtera are based on the Lkelhood Rato Test (LRT) Λ ( r ) < > η Λ r s called observaton transformaton or suffcent statstc The crtera
More informationDEMO #8 - GAUSSIAN ELIMINATION USING MATHEMATICA. 1. Matrices in Mathematica
demo8.nb 1 DEMO #8 - GAUSSIAN ELIMINATION USING MATHEMATICA Obectves: - defne matrces n Mathematca - format the output of matrces - appl lnear algebra to solve a real problem - Use Mathematca to perform
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 information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationNumerical Solution of Ordinary Differential Equations
Numercal Methods (CENG 00) CHAPTER-VI Numercal Soluton of Ordnar Dfferental Equatons 6 Introducton Dfferental equatons are equatons composed of an unknown functon and ts dervatves The followng are examples
More informationPattern Matching Based on a Generalized Transform [Final Report]
Pattern Matchng ased on a Generalzed Transform [Fnal Report] Ram Rajagopal Natonal Instruments 5 N. Mopac Expwy., uldng, Austn, T 78759-354 ram.rajagopal@n.com Abstract In a two-dmensonal pattern matchng
More informationQuadratic speedup for unstructured search - Grover s Al-
Quadratc speedup for unstructured search - Grover s Al- CS 94- gorthm /8/07 Sprng 007 Lecture 11 001 Unstructured Search Here s the problem: You are gven a boolean functon f : {1,,} {0,1}, and are promsed
More informationCOMPARING NOISE REMOVAL IN THE WAVELET AND FOURIER DOMAINS
COMPARING NOISE REMOVAL IN THE WAVELET AND FOURIER DOMAINS Robert J. Barsant, and Jordon Glmore Department of Electrcal and Computer Engneerng The Ctadel Charleston, SC, 29407 e-mal: robert.barsant@ctadel.edu
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationQuantifying Uncertainty
Partcle Flters Quantfyng Uncertanty Sa Ravela M. I. T Last Updated: Sprng 2013 1 Quantfyng Uncertanty Partcle Flters Partcle Flters Appled to Sequental flterng problems Can also be appled to smoothng problems
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 informationp 1 c 2 + p 2 c 2 + p 3 c p m c 2
Where to put a faclty? Gven locatons p 1,..., p m n R n of m houses, want to choose a locaton c n R n for the fre staton. Want c to be as close as possble to all the house. We know how to measure dstance
More informationSupporting Information
Supportng Informaton The neural network f n Eq. 1 s gven by: f x l = ReLU W atom x l + b atom, 2 where ReLU s the element-wse rectfed lnear unt, 21.e., ReLUx = max0, x, W atom R d d s the weght matrx to
More informationLecture 3: Probability Distributions
Lecture 3: Probablty Dstrbutons Random Varables Let us begn by defnng a sample space as a set of outcomes from an experment. We denote ths by S. A random varable s a functon whch maps outcomes nto the
More informationImprovement of Histogram Equalization for Minimum Mean Brightness Error
Proceedngs of the 7 WSEAS Int. Conference on Crcuts, Systems, Sgnal and elecommuncatons, Gold Coast, Australa, January 7-9, 7 3 Improvement of Hstogram Equalzaton for Mnmum Mean Brghtness Error AAPOG PHAHUA*,
More informationGrover s Algorithm + Quantum Zeno Effect + Vaidman
Grover s Algorthm + Quantum Zeno Effect + Vadman CS 294-2 Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the
More informationProvable Security Signatures
Provable Securty Sgnatures UCL - Louvan-la-Neuve Wednesday, July 10th, 2002 LIENS-CNRS Ecole normale supéreure Summary Introducton Sgnature FD PSS Forkng Lemma Generc Model Concluson Provable Securty -
More informationIV. Performance Optimization
IV. Performance Optmzaton A. Steepest descent algorthm defnton how to set up bounds on learnng rate mnmzaton n a lne (varyng learnng rate) momentum learnng examples B. Newton s method defnton Gauss-Newton
More informationSecond Order Analysis
Second Order Analyss In the prevous classes we looked at a method that determnes the load correspondng to a state of bfurcaton equlbrum of a perfect frame by egenvalye analyss The system was assumed to
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 informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationChapter 4: Root Finding
Chapter 4: Root Fndng Startng values Closed nterval methods (roots are search wthn an nterval o Bsecton Open methods (no nterval o Fxed Pont o Newton-Raphson o Secant Method Repeated roots Zeros of Hgher-Dmensonal
More informationSpatial Statistics and Analysis Methods (for GEOG 104 class).
Spatal Statstcs and Analyss Methods (for GEOG 104 class). Provded by Dr. An L, San Dego State Unversty. 1 Ponts Types of spatal data Pont pattern analyss (PPA; such as nearest neghbor dstance, quadrat
More informationDepartment of Electrical & Electronic Engineeing Imperial College London. E4.20 Digital IC Design. Median Filter Project Specification
Desgn Project Specfcaton Medan Flter Department of Electrcal & Electronc Engneeng Imperal College London E4.20 Dgtal IC Desgn Medan Flter Project Specfcaton A medan flter s used to remove nose from a sampled
More informationImage Processing for Bubble Detection in Microfluidics
Image Processng for Bubble Detecton n Mcrofludcs Introducton Chen Fang Mechancal Engneerng Department Stanford Unverst Startng from recentl ears, mcrofludcs devces have been wdel used to buld the bomedcal
More informationISQS 6348 Final Open notes, no books. Points out of 100 in parentheses. Y 1 ε 2
ISQS 6348 Fnal Open notes, no books. Ponts out of 100 n parentheses. 1. The followng path dagram s gven: ε 1 Y 1 ε F Y 1.A. (10) Wrte down the usual model and assumptons that are mpled by ths dagram. Soluton:
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 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 informationComparison of Wiener Filter solution by SVD with decompositions QR and QLP
Proceedngs of the 6th WSEAS Int Conf on Artfcal Intellgence, Knowledge Engneerng and Data Bases, Corfu Island, Greece, February 6-9, 007 7 Comparson of Wener Flter soluton by SVD wth decompostons QR and
More informationComposite Hypotheses testing
Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter
More informationInvariant deformation parameters from GPS permanent networks using stochastic interpolation
Invarant deformaton parameters from GPS permanent networks usng stochastc nterpolaton Ludovco Bag, Poltecnco d Mlano, DIIAR Athanasos Dermans, Arstotle Unversty of Thessalonk Outlne Startng hypotheses
More 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 informationFTCS Solution to the Heat Equation
FTCS Soluton to the Heat Equaton ME 448/548 Notes Gerald Recktenwald Portland State Unversty Department of Mechancal Engneerng gerry@pdx.edu ME 448/548: FTCS Soluton to the Heat Equaton Overvew 1. Use
More informationHashing. Alexandra Stefan
Hashng Alexandra Stefan 1 Hash tables Tables Drect access table (or key-ndex table): key => ndex Hash table: key => hash value => ndex Man components Hash functon Collson resoluton Dfferent keys mapped
More informationStatistical analysis using matlab. HY 439 Presented by: George Fortetsanakis
Statstcal analyss usng matlab HY 439 Presented by: George Fortetsanaks Roadmap Probablty dstrbutons Statstcal estmaton Fttng data to probablty dstrbutons Contnuous dstrbutons Contnuous random varable X
More informationSTATS 306B: Unsupervised Learning Spring Lecture 10 April 30
STATS 306B: Unsupervsed Learnng Sprng 2014 Lecture 10 Aprl 30 Lecturer: Lester Mackey Scrbe: Joey Arthur, Rakesh Achanta 10.1 Factor Analyss 10.1.1 Recap Recall the factor analyss (FA) model for lnear
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 informationFormal solvers of the RT equation
Formal solvers of the RT equaton Formal RT solvers Runge- Kutta (reference solver) Pskunov N.: 979, Master Thess Long characterstcs (Feautrer scheme) Cannon C.J.: 970, ApJ 6, 55 Short characterstcs (Hermtan
More informationCase A. P k = Ni ( 2L i k 1 ) + (# big cells) 10d 2 P k.
THE CELLULAR METHOD In ths lecture, we ntroduce the cellular method as an approach to ncdence geometry theorems lke the Szemeréd-Trotter theorem. The method was ntroduced n the paper Combnatoral complexty
More informationOutline. Communication. Bellman Ford Algorithm. Bellman Ford Example. Bellman Ford Shortest Path [1]
DYNAMIC SHORTEST PATH SEARCH AND SYNCHRONIZED TASK SWITCHING Jay Wagenpfel, Adran Trachte 2 Outlne Shortest Communcaton Path Searchng Bellmann Ford algorthm Algorthm for dynamc case Modfcatons to our algorthm
More informationLecture 3. Ax x i a i. i i
18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest
More informationx = , so that calculated
Stat 4, secton Sngle Factor ANOVA notes by Tm Plachowsk n chapter 8 we conducted hypothess tests n whch we compared a sngle sample s mean or proporton to some hypotheszed value Chapter 9 expanded ths to
More informationCommon loop optimizations. Example to improve locality. Why Dependence Analysis. Data Dependence in Loops. Goal is to find best schedule:
15-745 Lecture 6 Data Dependence n Loops Copyrght Seth Goldsten, 2008 Based on sldes from Allen&Kennedy Lecture 6 15-745 2005-8 1 Common loop optmzatons Hostng of loop-nvarant computatons pre-compute before
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 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 informationImplicit Integration Henyey Method
Implct Integraton Henyey Method In realstc stellar evoluton codes nstead of a drect ntegraton usng for example the Runge-Kutta method one employs an teratve mplct technque. Ths s because the structure
More informationThe Geometry of Logit and Probit
The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.
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 informationA Fast Fractal Image Compression Algorithm Using Predefined Values for Contrast Scaling
Proceedngs of the World Congress on Engneerng and Computer Scence 007 WCECS 007, October 4-6, 007, San Francsco, USA A Fast Fractal Image Compresson Algorthm Usng Predefned Values for Contrast Scalng H.
More informationDEGREE REDUCTION OF BÉZIER CURVES USING CONSTRAINED CHEBYSHEV POLYNOMIALS OF THE SECOND KIND
ANZIAM J. 45(003), 195 05 DEGREE REDUCTION OF BÉZIER CURVES USING CONSTRAINED CHEBYSHEV POLYNOMIALS OF THE SECOND KIND YOUNG JOON AHN 1 (Receved 3 August, 001; revsed 7 June, 00) Abstract In ths paper
More informationImage Segmentation and Compression using Neural Networks
Image Segmentaton and Compresson usng Neural Networks Constantno Carlos Reyes-Aldasoro, Ana Laura Aldeco Departamento de Sstemas Dgtales Insttuto Tecnológco Autónomo de Méxco Río Hondo No. 1, Tzapán San
More informationMarkov Chain Monte Carlo Lecture 6
where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways
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 informationEstimating the Fundamental Matrix by Transforming Image Points in Projective Space 1
Estmatng the Fundamental Matrx by Transformng Image Ponts n Projectve Space 1 Zhengyou Zhang and Charles Loop Mcrosoft Research, One Mcrosoft Way, Redmond, WA 98052, USA E-mal: fzhang,cloopg@mcrosoft.com
More informationLecture 16 Statistical Analysis in Biomaterials Research (Part II)
3.051J/0.340J 1 Lecture 16 Statstcal Analyss n Bomaterals Research (Part II) C. F Dstrbuton Allows comparson of varablty of behavor between populatons usng test of hypothess: σ x = σ x amed for Brtsh statstcan
More informationLinear Regression Analysis: Terminology and Notation
ECON 35* -- Secton : Basc Concepts of Regresson Analyss (Page ) Lnear Regresson Analyss: Termnology and Notaton Consder the generc verson of the smple (two-varable) lnear regresson model. It s represented
More information