Help for Time-Resolved Analysis TRI2 version 2.4 P Barber,
|
|
- Jasmin Heath
- 6 years ago
- Views:
Transcription
1 Help for Tme-Resolved Analyss TRI2 verson 2.4 P Barber, Introducton Tme-resolved Analyss (TRA) becomes avalable under the processng menu once you have loaded and selected an mage that contans sutable mult-dmensonal data. Ths s typcally an cs fle. When such an mage s loaded the ntensty or sum mage s shown n the usual mage wndow. If the mage has been dentfed as a tme-resolved mage then the words Tme Resolved appear n the extra text below the ntensty mage. There are many processng optons avalable, please be aware that many of them may not be relevant to TRA and many only work on the 2D ntensty mage. One process that does work on 3D data s the arthmetc functon. TRA allows you to ft functons to sngle pxel or bnned data and also to perform functons to whole mages. Such as performng a ft at every pxel, or bn of pxels, or usng all pxels together n some form of global analyss. More detal can be found n the followng document, but for detals about the fttng functons please refer to: Tme Resolved Fttng (Detal).pdf NEW As of verson 2.4 we now have a Bayesan method for mono-exponental fttng and we hope bexponental wll follow soon. Ths analyss accounts for the Possonan nature of low photon count data and s more accurate and robust n these stuatons. Another beneft of ths technque s that the errors reported for the ftted parameters are now realstc error ntervals, gvng you drectly the confdence n the values. Unfortunately nothng s free, and the Bayesan algorthm s much slower to run than the Marquardt methods. Also parameter fxng and global methods are not avalable wth the Bayes method. 1
2 Contents Introducton... 1 Contents... 2 Tme-Resolved Analyss... 3 Inputs... 3 Pre-Processng... 4 Cursors... 4 Type of Ft... 5 Instrument Response/Exctaton/Prompt... 5 Parameter Freedom... 6 Fttng... 6 Outputs... 7 Errors... 7 Reduced Ch Square... 7 Iteratons... 8 Error... 8 Confdence Ellpsod... 8 Image Producton... 8 Support Plane Analyss Bayes Probablty Dstrbuton Analyss Macros Batch Processng Appendx B Global Fttng
3 Tme-Resolved Analyss Inputs Select an mage that has tme resolved data n any workspace to make t the subject of TRA. Choose Processng->Tme-Resolved Analyss from the workspace f the TRA wndow s not vsble. Image Chosen va workspace Has Pre-Processng optons Instrument response/exctaton/prompt Chosen va menu Has cursor optons Ft Type Chosen on ths panel Has optons on ths panel Parameter Freedom Chosen on ths panel Has free/fxed/restraned optons Selected Pxel & Data Chosen by clckng on ths mage or usng the X and Y controls. 3
4 Pre-Processng Thresholdng: Ths allows you to excluded pxels wth a low and/or a hgh ntensty. You can choose to use a threshold based on a % of the ntensty or on a fxed value. A fxed value s useful for batch processng when you want to exclude a background below a fxed ntensty. The mage demonstrates excludng all pxels wth an ntensty n the bottom 10% of all pxels. Maskng: If there s a mask assocated wth the mage n the workspace t can be appled to TRA by checkng the Apply Mask box. Bnnng: The tme-resolved data of the pxels n the neghbourhood of the selected pxel can be added together. Use Bnnng to select a 3x3 or 5x5 pxel area, for example. Checkng the All Pxels box adds all the data of all the pxels that have not been excluded va thresholdng or maskng (N.B. f ths box s checked that selected pxel become rrelevant). Cursors The cursors panel allows you to manually change to cursor postons. It also allows you to lock the cursors together so that: the mpulse delta (tme dfference between the start of the prompt 4
5 (exctaton) and the start of the transent (tme-resolved data) and the mpulse wdth are mantaned f the transent start s moved, or the mpulse delta s mantaned f the prompt start s moved. Estmate Cursors: Places all the cursors (prompt and data cursors, except prompt baselne) n sensble postons. Type of Ft Choose the model functon wth the Type of Ft control and the mathematcal functon assocated wth t wll be dsplayed. Estmate Intal Values: Uses a three ntegral ft to the data to estmate startng parameters for the current model. The values calculated are placed n the value boxes of the Ftted Parameters. Estmate Cursors: Places all the cursors (prompt and data cursors, except prompt baselne) n sensble postons. Pre-ft Estmaton: Ths control determnes where the startng parameters arse from. Integral Ft Estmate performs the Estmate Intal values before each ft. Estmate from last ft uses the ftted parameters from the last ft as startng values for the next. Estmate from panel values always uses the values that are n the Ftted Parameters value boxes as the startng values for a new ft. N.B. for sngle fts the last two optons wll be dentcal because the values from the last ft wll always be dsplayed n the Ftted Parameters value boxes. Ths s not the case, however, for makng mages based on pxel fts. Target ChSq: The Target Ch Square control can be used to determne how strngent the fttng engne should be. Ths value s used to determne how many tres (re-fts) are made to try and mprove the ft (the lower the ChSq, the better the ft) Instrument Response/Exctaton/Prompt You are able to load a fle that descrbes the response of the nstrument used to acqure the mage. Ths s also often called the exctaton functon or the prompt functon. Ths fle can be n cs or sdt format and contans a sngle tme-resolved sgnal. Ths must have been captured wth the same nstrument settngs as the mage and so has the same number of tme-resolved ponts (number of channels) over the same tme perod. 5
6 The exctaton functon wll be convolved wth the pure ft functon before comparng the result to the raw data when determnng the goodness of ft. A better estmate of the model parameters can thus be acheved. You can choose to not use an exctaton functon by selectng ths menu opton. X10 expands the y-axs of the exctaton graph for better settng of the Exctaton Baselne cursor. Parameter Freedom The freedom of each model parameter can be set. In other words constrants can be appled to fx or restran the value of certan parameters. Fxed Value Red background Free Value Whte background Restraned Value Orange background Freedom Optons Constrants can be appled by clckng the freedom button to call up the freedom optons panel for each parameter. Here you can free the parameter, fx t to any value by changng the Value box and checkng the Fx button, or restran the parameter between mnmum and maxmum values. The +/- button and % box allow you to quckly set mn and max lmts based on the current parameter value (.e. Clckng +/- wth 10 % sets the mn at value-10% and the max at value+10%). There are shortcuts to free and fx parameters from the man TRA panel. Just type a new value n the parameter value box to fx that parameter. To free a parameter, rght-clck on the value box or the freedom button. Fttng The Ft transent button wll perform a ft based on all the nputs provded and wll perform an ntal pre-ft estmaton of the parameters for Marquardt fttng. The Ft w/o estmaton Auto-Ft Red = on Green = off button performs a ft based on all the nputs provded but wll not perform an ntal pre-ft estmaton (.e. the current panel values wll be used as the ntal estmate for Marquardt fttng). N.B. Integrals fttng does not requre any pre-estmate of the parameters. The Parameter Modfed ndcator nforms of when the currently dsplayed ft and parameter values are no longer vald because somethng has been manually changed and a new ft should be performed. If the auto-ft button s on (red) then a new ft wll be performed whenever somethng changes and so the current values should always be vald. 6
7 See Appendx A for more detal on the Integral and Marquardt fttng procedures. Outputs Save Ft Data The Ft Ftted Parameters Reduced Ch Squared, Iteratons and Error Resduals Errors Indcates estmated errors n all the determned parameters. Reduced Ch Square The Reduced Ch Square (or Ch sq. / d.f. ) s gven by: 7
8 2 n [ I( tk ) Ic ( tk )] I( t ) k=1 χ r = = χ 2 / (n - p) n p where: I(t k )= the data at tme pont k I(t k )= the ft at tme pont k n = number of tme ponts p = number of varable ft parameters n p = d. f. (degrees of freedom) and the lower the Reduced Ch Square the better the ft. In the absence of nose ChSq should approach zero; for Posson-lmted nose, expect a value around 1. k Iteratons The reported number of teratons (or # ters ) s, for Marquardt fttng, the total number of teratons of Marquardt fttng. If re-fts occur, the numbers of teratons of each ft are added together. For ntegral fttng the number of teratons ndcates the number of re-fts (See appendx A) Error Indcates f there was an error n the fttng. Confdence Ellpsod 2 The confdence ellpsod descrbes our confdence n the ftted values by ndcatng the shape of the Ch Square support plane around the mnmum (around the ftted soluton). Image Producton The drop-down menu lets you choose between pxel fts, a global ft or a mult-mage global ft. Pxel Fts allow you to use the nputs you have provded and perform a ft on every pxel n the mage that has not been excluded through thresholdng or maskng. Bnnng also apples to pxel fts. Take care snce bnnng All Pxels wll result n all the pxels beng the same! The ftted parameters and the ChSq values wll be used to form mages whch wll appear n a new mage workspace wndow. Global Ft performs a global ft usng all the pxels that have not been excluded through thresholdng or maskng. A Mult-Image Global Ft wll use all the tme-resolved mages n the current workspace 8
9 and ft them all smultaneously. In short, global analyss s a powerful technque n whch some parameters of the fttng functon are restraned to be the same for every pxel (globally ftted parameters) and others are free to be dfferent for each pxel (locally ftted parameters). All the tmeresolved mage data are consdered smultaneously when the best ft s determned (see appendx B for a more detaled descrpton of how ths global fttng s performed). The table below detals whch parameters are consdered global and local for the current software: Parameter Mono-exponental B-exponental Tr-exponental Stretched Exponental Z Local Local Local Local A 1 Local Local Local Local Tau 1 Global Global Global Global A 2 Local Local Tau 2 Global Global A 3 Local Tau 3 Global h Global The locally ftted parameters and the local ChSq values wll be used to form mages whch wll appear n a new mage workspace wndow. The globally ftted values and global ChSq wll appear as extra text on approprate mages n the workspace. Example workspace outputs: The global Reduced ChSq s defned as the sum of all the local ChSq s dvded by the global degrees of freedom: df global = [N.(n p l free)] - p g free, where: N = number of transents (pxels); p l free = number of free local parameters; p g free= number of free global parameters. 9
10 Support Plane Analyss Once we have a ft, wth resultng ftted parameters and a ChSq value, we can nvestgate the local map of ChSq and ask questons lke (for example): What s the ChSq f tau was forced to be 1.9 rather than 1.8? What s the lkely error n tau? How lkely s t that tau s 1.9 rather than 1.8? Ths s where support plane analyss (SPA) s useful. Support plane analyss s avalable from the wndow menu of TRA. SPA for: allows you to choose between SPA for the sngle transent on the TRA panel or global fttng on the whole mage. Global SPA may tme some tme snce a global ft must be performed at every pont on the graph. Analyse: selects one (1D support plane) or two (2D support plane) parameters to vary. Parameter1 and Parameter 2: allow you to choose whch parameters to vary, over what range and n how many steps. Normalse to mnma: dvdes every pont on the graph by the mnmum ChSq calculated. Add Plot: Performs the calculatons and add a plot to the graph. Many plots can be added each wth the same or dfferent range, or from dfferent pxels (select a dfferent pxel on the man TRA panel 10
11 and then clck Add Plot. If you change the parameters to vary n between plots you may get some strange results. You can change each plot s appearance by clckng Propertes to access the propertes panel. Clear Graph: Clears all plots from the graph. : Orentate the graph : Change the vew of the graph to orthographc or to perspectve, respectvely. Hnt: For a more usual vew of a 1D support plane, clck and then. Hnt: For a contour map of a 2D support plane, clck and then. Propertes: Opens the graphs propertes panel. Help: Informs about how to control the vew of the graph. Copy Graph: Copes the current vew of the graph to the wndows clpboard for pastng n other applcatons (e.g. MS Word or PowerPont). Save Data: Saves a text fle contanng the last plot s data ponts n a format that can be mported nto MS Excel to use t s 3D graphng functons. 11
12 Bayes Probablty Dstrbuton Analyss Smlar to the Support Plane Analyss, the Bayes Probablty Dstrbuton Analyss panel can be used to vew and explore the resultng probablty densty functon when Bayesan fttng s performed. Most functon on ths work n the same way as the SPA panel. The numbers reported are the maxmum a posteror (MAP) value,.e. the most probable, peak value, of the dstrbuton, the average (AVE) or frst moment of the dstrbuton and the error nterval (ERR), whch s the second moment or standard devaton of the dstrbuton. Macros From the man workspace menu several macros are avalable for TRA. These macros wll search for sutable mages n the current workspace on whch to perform the operaton (.e. those named A1, tau1 etc.). New mages wll be created n the workspace from the result(s). You wll be told f a sutable set of mages could not be found. Fractonal Intensty: Produces a F mage for every A found (to a max of 3) accordng to: 12
13 F Fractonal Contrbuton: Produces a f mage for every A and tau par found (to a max of 3) accordng to: Aτ f = A τ = j Average Lfetme: Produces one mage show the contrbuton-weghted average lfetme from all A and tau mage pars found (max of 3) accordng to: 2 Aτ τ = fτ = Aτ Lfetme-Weghted Quantum Yeld: Produces one mage from all A and tau mage pars found (max of 3) accordng to: τ A τ j = j FRET Effcency: Produces one mage from the tau 1 and tau 2 mages accordng to: A A j j j τ E = 1 2 τ where tau 1 wll be the longer lfetme (.e. the lfetme of the FRET donor) and tau 2 the shorter (.e. the lfetme of the FRET donor n the presence of the acceptor). All defntons are from: Lakowcz, J. R. Prncples of Fluorescence Spectroscopy (Plenum Publshers, New York, 1999). j 1 j 13
14 Batch Processng Batch processng allows you to form a lst of mage fles and leave the computer to process them one by one. You must frst setup all the nputs to your TRA on any mage so the computer knows the startng pont for each mage. Ths ncludes any mask but currently only one mask per batch can be specfed. Hopefully, the operaton of batch processng panel s obvous so I wll not go nto t here, except to say The output of batch processng wll be a number of fles. These may be mages and/or text fles of data. They can be saved nto the drectory whence the mage came or nto another specfed drectory. If your mages are read from a CD, the computer may not be able to wrte the output fles to t, so you must specfy a dfferent drectory n that case. Dfferent batch operatons may appear n future. At the tme of wrtng, there s only one TRA batch operaton whch performs the followng: Load the tme resolved mage Copy any mask from the startng mage to ths mage Do a ft on the mage of the chosen type Save all resultng mages Save raw ft data Close/dscard the pxel ft workspace created Do a sngle nvarance ft where all the pxels are bnned together Save raw ft data Close/dscard the tme resolved mage It s possble to select whch parameters to output data on but you must have processed an example mage for the system to know what outputs are avalable to choose from. 14
15 Appendx A The Fttng Engnes Trple Integral Fttng Engne Dvdes the data n three and does a 3-ntegral ft. If the chsq target s not met the ft s repeated untl t s OR tres => 10 WHILE the chsq contnues to mprove Wth each reft the data s dvded more (nto 4, 5, 6 etc.) and the frst three dvsons taken Checks that the last ft was not worse than the prevous best Returns the number of fts performed. Marquardt Fttng Engne Does a ft startng from the ntal parameters gven If the chsq target s not met, the ft s repeated untl t s OR tres => 10 WHILE the chsq contnues to mprove The prevous ft s used as a startng pt for the next one whch should never be worse. Returns the total number of teratons from all the refts added together. More detal can be found on the fttng functons n the document: Tme Resolved Fttng (Detal).pdf 15
16 Appendx B Global Fttng The steps nvolved n global fttng are: 1) Estmate the global parameters. Sum all the pxels together. Trple ntegral estmate of Z est, A est, tau est. (If ths fals Z est =0, A est =max of summed data, tau est =2.0) Set sutable values for mult-exp fts, e.g.: Parameter Mono-exponental B-exponental Tr-exponental Stretched Exponental Z Z est Z est Z est Z est A 1 A est ¾ x A est ¾ x A est A est Tau 1 tau est tau est tau est tau est A 2 ¼ x A est 1/6 x A est Tau 2 2/3 x tau est 2/3 x tau est A 3 1/6 x A est Tau 3 1/3 x tau est h 1.5 2) Perform Marquardt ft to get good values for the global parameters. 3) Fx these parameters for every pxel. 4) Estmate ntal values for all the ndvdual transents. Trple ntegral estmate of Z est, A est, tau est. (If ths fals Z est =0, A est =max of transent) 5) Calculate the exponental functons and convolve wth the nstrument response whch only needs to be done once. (Local fts are now lnear fts f all the taus are global!) 6) For each transent (pxel) call perform a Marquardt ft. One re-ft s tred f chsq s partcularly bad. 7) Do the actual global ft. Julan Glbey says, It s bascally smlar to a sngle Marquardt ft, except that now we handle the extra ntrcaces nvolved n global fttng, n partcular, the much larger alpha matrx s handled n a specal way. 8) Calculate the number of degrees of freedom and report the global reduced ChSq. More detal can be found on the fttng functons n the document: Tme Resolved Fttng (Detal).pdf 16
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 informationTN348: 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 informationProgramming 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 informationSLAM 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 informationA 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 informationBITPLANE AG IMARISCOLOC. Operating Instructions. Manual Version 1.0 January the image revolution starts here.
BITPLANE AG IMARISCOLOC Operatng Instructons Manual Verson 1.0 January 2003 the mage revoluton starts here. Operatng Instructons BITPLANE AG Copyrght Ths document contans propretary nformaton protected
More informationNAG 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 informationWishing you all a Total Quality New Year!
Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma
More informationLife Tables (Times) Summary. Sample StatFolio: lifetable times.sgp
Lfe Tables (Tmes) Summary... 1 Data Input... 2 Analyss Summary... 3 Survval Functon... 5 Log Survval Functon... 6 Cumulatve Hazard Functon... 7 Percentles... 7 Group Comparsons... 8 Summary The Lfe Tables
More information11. HARMS How To: CSV Import
and Rsk System 11. How To: CSV Import Preparng the spreadsheet for CSV Import Refer to the spreadsheet template to ad algnng spreadsheet columns wth Data Felds. The spreadsheet s shown n the Appendx, an
More informationExercises (Part 4) Introduction to R UCLA/CCPR. John Fox, February 2005
Exercses (Part 4) Introducton to R UCLA/CCPR John Fox, February 2005 1. A challengng problem: Iterated weghted least squares (IWLS) s a standard method of fttng generalzed lnear models to data. As descrbed
More informationCMPS 10 Introduction to Computer Science Lecture Notes
CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not
More informationREFRACTIVE INDEX SELECTION FOR POWDER MIXTURES
REFRACTIVE INDEX SELECTION FOR POWDER MIXTURES Laser dffracton s one of the most wdely used methods for partcle sze analyss of mcron and submcron sze powders and dspersons. It s quck and easy and provdes
More informationSubspace 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 informationA DATA ANALYSIS CODE FOR MCNP MESH AND STANDARD TALLIES
Supercomputng n uclear Applcatons (M&C + SA 007) Monterey, Calforna, Aprl 15-19, 007, on CD-ROM, Amercan uclear Socety, LaGrange Par, IL (007) A DATA AALYSIS CODE FOR MCP MESH AD STADARD TALLIES Kenneth
More informationSupport 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 informationLobachevsky 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 informationUnsupervised Learning
Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and
More informationParallelism 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 informationOutline. Type of Machine Learning. Examples of Application. Unsupervised Learning
Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton
More informationA 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 informationFor instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)
Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A
More informationy 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 informationNGPM -- A NSGA-II Program in Matlab
Verson 1.4 LIN Song Aerospace Structural Dynamcs Research Laboratory College of Astronautcs, Northwestern Polytechncal Unversty, Chna Emal: lsssswc@163.com 2011-07-26 Contents Contents... 1. Introducton...
More informationCourse 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 informationSimulation 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 informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More informationActive 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 informationmquest Quickstart Version 11.0
mquest Quckstart Verson 11.0 cluetec GmbH Emmy-Noether-Straße 17 76131 Karlsruhe Germany www.cluetec.de www.mquest.nfo cluetec GmbH Karlsruhe, 2016 Document verson 5 27.04.2016 16:59 > Propretary notce
More informationSynthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007
Syntheszer 1.0 A Varyng Coeffcent Meta Meta-Analytc nalytc Tool Employng Mcrosoft Excel 007.38.17.5 User s Gude Z. Krzan 009 Table of Contents 1. Introducton and Acknowledgments 3. Operatonal Functons
More information6.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 informationVRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) ,
VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual
More informationAP PHYSICS B 2008 SCORING GUIDELINES
AP PHYSICS B 2008 SCORING GUIDELINES General Notes About 2008 AP Physcs Scorng Gudelnes 1. The solutons contan the most common method of solvng the free-response questons and the allocaton of ponts for
More informationEECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science
EECS 730 Introducton to Bonformatcs Sequence Algnment Luke Huan Electrcal Engneerng and Computer Scence http://people.eecs.ku.edu/~huan/ HMM Π s a set of states Transton Probabltes a kl Pr( l 1 k Probablty
More informationHierarchical 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 informationMathematics 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 informationProblem Set 3 Solutions
Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,
More informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More informationUser Authentication Based On Behavioral Mouse Dynamics Biometrics
User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA
More informationNUMERICAL 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 informationEdge Detection in Noisy Images Using the Support Vector Machines
Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona
More informationAPPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA
RFr"W/FZD JAN 2 4 1995 OST control # 1385 John J Q U ~ M Argonne Natonal Laboratory Argonne, L 60439 Tel: 708-252-5357, Fax: 708-252-3 611 APPLCATON OF A COMPUTATONALLY EFFCENT GEOSTATSTCAL APPROACH TO
More informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More information3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationSome Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.
Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,
More informationParameter estimation for incomplete bivariate longitudinal data in clinical trials
Parameter estmaton for ncomplete bvarate longtudnal data n clncal trals Naum M. Khutoryansky Novo Nordsk Pharmaceutcals, Inc., Prnceton, NJ ABSTRACT Bvarate models are useful when analyzng longtudnal data
More informationFEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur
FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents
More informationAutomatic selection of reference velocities for recursive depth migration
Automatc selecton of mgraton veloctes Automatc selecton of reference veloctes for recursve depth mgraton Hugh D. Geger and Gary F. Margrave ABSTRACT Wave equaton depth mgraton methods such as phase-shft
More informationLS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract
12 th Internatonal LS-DYNA Users Conference Optmzaton(1) LS-TaSC Verson 2.1 Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2.1,
More informationBiostatistics 615/815
The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts
More informationModule 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 informationIntro. Iterators. 1. Access
Intro Ths mornng I d lke to talk a lttle bt about s and s. We wll start out wth smlartes and dfferences, then we wll see how to draw them n envronment dagrams, and we wll fnsh wth some examples. Happy
More informationIP Camera Configuration Software Instruction Manual
IP Camera 9483 - Confguraton Software Instructon Manual VBD 612-4 (10.14) Dear Customer, Wth your purchase of ths IP Camera, you have chosen a qualty product manufactured by RADEMACHER. Thank you for the
More informationProblem 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 informationANSYS FLUENT 12.1 in Workbench User s Guide
ANSYS FLUENT 12.1 n Workbench User s Gude October 2009 Copyrght c 2009 by ANSYS, Inc. All Rghts Reserved. No part of ths document may be reproduced or otherwse used n any form wthout express wrtten permsson
More informationA New Token Allocation Algorithm for TCP Traffic in Diffserv Network
A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network S. Sudha and N. Ammasagounden Natonal Insttute of Technology, Truchrappall,
More informationETAtouch RESTful Webservices
ETAtouch RESTful Webservces Verson 1.1 November 8, 2012 Contents 1 Introducton 3 2 The resource /user/ap 6 2.1 HTTP GET................................... 6 2.2 HTTP POST..................................
More informationSolutions to Programming Assignment Five Interpolation and Numerical Differentiation
College of Engneerng and Coputer Scence Mechancal Engneerng Departent Mechancal Engneerng 309 Nuercal Analyss of Engneerng Systes Sprng 04 Nuber: 537 Instructor: Larry Caretto Solutons to Prograng Assgnent
More informationCluster 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 informationLearning 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 informationVirtual 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 informationCSCI 104 Sorting Algorithms. Mark Redekopp David Kempe
CSCI 104 Sortng Algorthms Mark Redekopp Davd Kempe Algorthm Effcency SORTING 2 Sortng If we have an unordered lst, sequental search becomes our only choce If we wll perform a lot of searches t may be benefcal
More informationPerformance 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 informationFitting: 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 informationAssignment # 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 informationCircuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL)
Crcut Analyss I (ENG 405) Chapter Method of Analyss Nodal(KCL) and Mesh(KVL) Nodal Analyss If nstead of focusng on the oltages of the crcut elements, one looks at the oltages at the nodes of the crcut,
More informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationParallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016)
Technsche Unverstät München WSe 6/7 Insttut für Informatk Prof. Dr. Thomas Huckle Dpl.-Math. Benjamn Uekermann Parallel Numercs Exercse : Prevous Exam Questons Precondtonng & Iteratve Solvers (From 6)
More informationSVM-based Learning for Multiple Model Estimation
SVM-based Learnng for Multple Model Estmaton Vladmr Cherkassky and Yunqan Ma Department of Electrcal and Computer Engneerng Unversty of Mnnesota Mnneapols, MN 55455 {cherkass,myq}@ece.umn.edu Abstract:
More informationA 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 informationImage Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline
mage Vsualzaton mage Vsualzaton mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and
More informationA 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 informationLECTURE NOTES Duality Theory, Sensitivity Analysis, and Parametric Programming
CEE 60 Davd Rosenberg p. LECTURE NOTES Dualty Theory, Senstvty Analyss, and Parametrc Programmng Learnng Objectves. Revew the prmal LP model formulaton 2. Formulate the Dual Problem of an LP problem (TUES)
More informationAn 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 informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationGSLM 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 informationParallel matrix-vector multiplication
Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more
More informationMachine Learning. Topic 6: Clustering
Machne Learnng Topc 6: lusterng lusterng Groupng data nto (hopefully useful) sets. Thngs on the left Thngs on the rght Applcatons of lusterng Hypothess Generaton lusters mght suggest natural groups. Hypothess
More informationContent 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 informationBrave New World Pseudocode Reference
Brave New World Pseudocode Reference Pseudocode s a way to descrbe how to accomplsh tasks usng basc steps lke those a computer mght perform. In ths week s lab, you'll see how a form of pseudocode can be
More informationImprovement 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 informationMulti-view 3D Position Estimation of Sports Players
Mult-vew 3D Poston Estmaton of Sports Players Robbe Vos and Wlle Brnk Appled Mathematcs Department of Mathematcal Scences Unversty of Stellenbosch, South Afrca Emal: vosrobbe@gmal.com Abstract The problem
More informationWe Two Seismic Interference Attenuation Methods Based on Automatic Detection of Seismic Interference Moveout
We 14 15 Two Sesmc Interference Attenuaton Methods Based on Automatc Detecton of Sesmc Interference Moveout S. Jansen* (Unversty of Oslo), T. Elboth (CGG) & C. Sanchs (CGG) SUMMARY The need for effcent
More informationEfficient Distributed File System (EDFS)
Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate
More informationRange 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 informationK-means and Hierarchical Clustering
Note to other teachers and users of these sldes. Andrew would be delghted f you found ths source materal useful n gvng your own lectures. Feel free to use these sldes verbatm, or to modfy them to ft your
More informationComputer models of motion: Iterative calculations
Computer models o moton: Iteratve calculatons OBJECTIVES In ths actvty you wll learn how to: Create 3D box objects Update the poston o an object teratvely (repeatedly) to anmate ts moton Update the momentum
More information3. 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 informationCable optimization of a long span cable stayed bridge in La Coruña (Spain)
Computer Aded Optmum Desgn n Engneerng XI 107 Cable optmzaton of a long span cable stayed brdge n La Coruña (Span) A. Baldomr & S. Hernández School of Cvl Engneerng, Unversty of Coruña, La Coruña, Span
More informationCompiler 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 informationSIGGRAPH Interactive Image Cutout. Interactive Graph Cut. Interactive Graph Cut. Interactive Graph Cut. Hard Constraints. Lazy Snapping.
SIGGRAPH 004 Interactve Image Cutout Lazy Snappng Yn L Jan Sun Ch-Keung Tang Heung-Yeung Shum Mcrosoft Research Asa Hong Kong Unversty Separate an object from ts background Compose the object on another
More informationSum 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 informationTopology Design using LS-TaSC Version 2 and LS-DYNA
Topology Desgn usng LS-TaSC Verson 2 and LS-DYNA Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2, a topology optmzaton tool
More informationSkew 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 informationA 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 informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
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 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationMULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION
MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and
More informationHelsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)
Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute
More information