Introduction to Registration Problem for Functional Data

Size: px
Start display at page:

Download "Introduction to Registration Problem for Functional Data"

Transcription

1 Introducton to Regstraton Problem for Functonal Data Tan Wang Functonal Data Regstraton Mar / 24

2 Functonal Data Introducton to Regstraton Data avalable n R package fda Functonal Data Regstraton Mar / 24

3 Introducton to Regstraton Unallgned v.s. Allgned Functons Functonal Data Regstraton Mar / 24

4 Warpng Functon Introducton to Regstraton Functonal Data Regstraton Mar / 24

5 Warpng Functon Introducton to Regstraton Functonal Data Regstraton Mar / 24

6 Warpng Functon Introducton to Regstraton Functonal Data Regstraton Mar / 24

7 Warpng Functon Introducton to Regstraton Functonal Data Regstraton Mar / 24

8 Introducton to Regstraton Requrements on Warpng Functons h(0) = 0, h(1) = 1. Functonal Data Regstraton Mar / 24

9 Introducton to Regstraton Requrements on Warpng Functons h(t) s strctly monotone ncreasng. Functonal Data Regstraton Mar / 24

10 Introducton to Regstraton Landmarks Functonal Data Regstraton Mar / 24

11 Introducton to Regstraton Landmark Regstraton Lnear Warpng Functons Regstered Functons h(t) x(h(t)) t t Nonlnear Warpng Functons Regstered Functons h(t) x(h(t)) t t Functonal Data Regstraton Mar / 24

12 Introducton to Regstraton Regstered Functon Space Functonal Data Regstraton Mar / 24

13 Introducton to Regstraton Regstered Functon Space Goal: Regstered functons form a convex subspace. Functonal Data Regstraton Mar / 24

14 Decomposton of Total Varaton Phase Varaton and Ampltude Varaton Functonal Data Regstraton Mar / 24

15 Decomposton of Total Varaton Quantfyng Phase and Ampltude Varaton Regstered Functon: y(t) = x(h(t)) Cross-sectonal Mean: µ(t) = E[x(t)] Structural Mean: ν(t) = E[y(t)] Total Varance: MS total = E [x(t) µ(t)] 2 dt Constant C (Knep and Ramsay, 2008): C := E [x(t)] 2 dt cov[h E [y(t)] 2 dt = 1 + (t), y 2 (t)]dt E [y(t)] 2 dt Functonal Data Regstraton Mar / 24

16 Decomposton of Total Varaton Total Varance Decomposton MS total = E [x(t) µ(t)] 2 dt = (C E [y(t) ν(t)] 2 dt) + (C ν 2 (t)dt µ 2 (t)dt) Total Ampltude Varaton: MS amp = C E [y(t) ν(t)] 2 dt Total Phase Varaton: MS phase = C ν 2 (t)dt µ 2 (t)dt Functonal Data Regstraton Mar / 24

17 Regstraton Methods Combnng Regstraton and Functonal PCA #zeros(x ): the number of ponts τ [0, 1]wth x (τ) = 0. #feat(x): the number of strct local mnma/maxma. Concluson (Knep and Ramsay, 2008): Assume that for some 0 < k <, Pr (#feat(x ) k, #zeros(x ) k)=1. Then there exsts a consstent regstraton procedure such that for some p k + 2, the regstered functons y can be wrtten as x [h (t)] = y (t) = p θ j ξ j (t), t [0, 1] j=1 for some random coeffcents θ j R. Functonal Data Regstraton Mar / 24

18 Regstraton Methods Combnng Regstraton and Functonal PCA Algorthm (Knep and Ramsay, 2008): Iteraton 0: y (0) = x h (0) = I Iteraton l > 0: ν (l) = n 1 n =1 y (l 1) ŷ (l) = ν (l) + PCAAPPROX(y (l 1) ν (l) ) ŷ (l) y (l 1) h (l) nc (REGIST ) y (l) = y (l 1) h (l) nc Stoppng Rule: h (l) nc, (t) h d(t). Functonal Data Regstraton Mar / 24

19 Regstraton Methods Combnng Regstraton and Functonal PCA More Detals about REGIST : Deformaton Functon: d (l) (t) = h (l) nc, (t) t Frst-order Approxmaton at t: y (l) or alternatvely, (t) = y (l 1) ŷ (l) y (l 1) = y (l 1) [h (l) nc, (t)] (t) + y (l 1) (t)[h (l) (t) t] (t) + y (l 1) (t) y (l 1) (t) y (l 1) nc, (t)d (l) (t) (t)d (l) (t) Functonal Data Regstraton Mar / 24

20 Regstraton Methods Combnng Regstraton and Functonal PCA Representaton of d (l) (t): d (l) (t) = L s=1 d (l) s ψ s(t) = (d (l) ) T ψ(t) Goal: Mnmze the Integrated Squared Error SSE(d (l) ) = 1 0 PENSSE(d (l) [ŷ (l) (t) y (l 1) (t) y (l 1) λ) = SSE(d (l) ) + λ 1 0 (t)ψ T (t)d (l) ] 2 dt [ψ T (t)d (l) ] 2 dt Functonal Data Regstraton Mar / 24

21 Regstraton by Fsher-Rao Metrc Regstraton Usng Fsher-Rao Remannan Metrc Fsher-Rao Remannan Metrc (Srvastava, et al., 2011): v 1, v 2 T x (X), where T x (X) s the tangent space to X at x, then the Fsher-Rao Remannan metrc s defned as the nner product: v 1, v 2 x = v 1 (t)v 2 (t) 1 x (t) dt Property1: d FR (x 1, x 2 ) = d FR (x 1 h, x 2 h) for any h. Functonal Data Regstraton Mar / 24

22 Regstraton by Fsher-Rao Metrc Regstraton Usng Fsher-Rao Remannan Metrc Fsher-Rao Remannan Metrc (Srvastava, et al., 2011): v 1, v 2 T x (X), where T x (X) s the tangent space to X at x, then the Fsher-Rao Remannan metrc s defned as the nner product: v 1, v 2 x = v 1 (t)v 2 (t) 1 x (t) dt Property1: d FR (x 1, x 2 ) = d FR (x 1 h, x 2 h) for any h. Square-root Velocty Functon (SRVF): q(t) = sgn(x(t)) x (t) Property2: d FR (x 1, x 2 ) = q 1 q 2 L 2. Functonal Data Regstraton Mar / 24

23 Regstraton by Fsher-Rao Metrc Regstraton Usng Fsher-Rao Remannan Metrc SRVF of x h : (q, h) = (q h) h Elastc Dstance: d([q 1 ], [q 2 ]) = nf h q 1 (q 2, h) L 2 Functonal Data Regstraton Mar / 24

24 Regstraton by Fsher-Rao Metrc Regstraton Usng Fsher-Rao Remannan Metrc SRVF of x h : (q, h) = (q h) h Elastc Dstance: d([q 1 ], [q 2 ]) = nf h q 1 (q 2, h) L 2 Algorthm (Srvastava, et al., 2011): Step1: Compute the Karcher Mean [µ] n of [q 1 ], [q 2 ],..., [q n ]. Step2: Fnd the center µ n of [µ] n wth respect to {q }. Step3: For each, fnd h = argmn h µ n (q, h) L 2. Functonal Data Regstraton Mar / 24

25 Thank you! Functonal Data Regstraton Mar / 24

26 Reference Reference Knep A, Ramsay JO. Combnng regstraton and fttng for functonal model. Journal of the Amercan Statstcal Assocaton, 2008; 103: Marron JS, Ramsay JO, Sangall LM, Srvastava A. Functon data analyss of ampltude and phase varaton, 2015; arxv: Ramsay JO, Slverman BO. Functonal data analyss, Second ed. Sprnger, Srvastava A, Wu W, Kurtek S, Klassen E, Marron JS. Regstraton of functonal data usng Fsher-Rao metrc, 2011a; arxv: v2. Tucker JD, Wu W, Srvastava A. Generatve models for functonal data usng phase and ampltude separaton. Computatonal Statstcs and Data Analyss, 2013; 61: Pcture Source: Functonal Data Regstraton Mar / 24

S1 Note. Basis functions.

S1 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 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

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

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

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

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

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

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

X- Chart Using ANOM Approach

X- 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 information

Multi-stable Perception. Necker Cube

Multi-stable Perception. Necker Cube Mult-stable Percepton Necker Cube Spnnng dancer lluson, Nobuuk Kaahara Fttng and Algnment Computer Vson Szelsk 6.1 James Has Acknowledgment: Man sldes from Derek Hoem, Lana Lazebnk, and Grauman&Lebe 2008

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

Unsupervised Learning and Clustering

Unsupervised Learning and Clustering Unsupervsed Learnng and Clusterng Why consder unlabeled samples?. Collectng and labelng large set of samples s costly Gettng recorded speech s free, labelng s tme consumng 2. Classfer could be desgned

More information

An efficient method to build panoramic image mosaics

An efficient method to build panoramic image mosaics An effcent method to buld panoramc mage mosacs Pattern Recognton Letters vol. 4 003 Dae-Hyun Km Yong-In Yoon Jong-Soo Cho School of Electrcal Engneerng and Computer Scence Kyungpook Natonal Unv. Abstract

More information

A Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme

A Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme Mathematcal and Computatonal Applcatons Artcle A Fve-Pont Subdvson Scheme wth Two Parameters and a Four-Pont Shape-Preservng Scheme Jeqng Tan,2, Bo Wang, * and Jun Sh School of Mathematcs, Hefe Unversty

More information

Solitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis

Solitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis Internatonal Mathematcal Forum, Vol. 6,, no. 7, 8 Soltary and Travelng Wave Solutons to a Model of Long Range ffuson Involvng Flux wth Stablty Analyss Manar A. Al-Qudah Math epartment, Rabgh Faculty of

More information

Polyhedral Compilation Foundations

Polyhedral Compilation Foundations Polyhedral Complaton Foundatons Lous-Noël Pouchet pouchet@cse.oho-state.edu Dept. of Computer Scence and Engneerng, the Oho State Unversty Feb 8, 200 888., Class # Introducton: Polyhedral Complaton Foundatons

More information

LECTURE : MANIFOLD LEARNING

LECTURE : MANIFOLD LEARNING LECTURE : MANIFOLD LEARNING Rta Osadchy Some sldes are due to L.Saul, V. C. Raykar, N. Verma Topcs PCA MDS IsoMap LLE EgenMaps Done! Dmensonalty Reducton Data representaton Inputs are real-valued vectors

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

Radial Basis Functions

Radial Basis Functions Radal Bass Functons Mesh Reconstructon Input: pont cloud Output: water-tght manfold mesh Explct Connectvty estmaton Implct Sgned dstance functon estmaton Image from: Reconstructon and Representaton of

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

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

Lecture 4: Principal components

Lecture 4: Principal components /3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness

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 Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method Internatonal Journal of Computatonal and Appled Mathematcs. ISSN 89-4966 Volume, Number (07), pp. 33-4 Research Inda Publcatons http://www.rpublcaton.com An Accurate Evaluaton of Integrals n Convex and

More information

Barycentric Coordinates. From: Mean Value Coordinates for Closed Triangular Meshes by Ju et al.

Barycentric Coordinates. From: Mean Value Coordinates for Closed Triangular Meshes by Ju et al. Barycentrc Coordnates From: Mean Value Coordnates for Closed Trangular Meshes by Ju et al. Motvaton Data nterpolaton from the vertces of a boundary polygon to ts nteror Boundary value problems Shadng Space

More information

Exercises (Part 4) Introduction to R UCLA/CCPR. John Fox, February 2005

Exercises (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 information

Variance estimation in EU-SILC survey

Variance estimation in EU-SILC survey Varance estmaton n EU-SILC survey Mārtņš Lberts* * Mathematcal Support Dvson, Central Statstcal Bureau of Latva (Martns.Lberts@csb.gov.lv) bstract: The mplementaton of varance estmaton methods resamplng

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A 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 information

The Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole

The Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole Appled Mathematcs, 04, 5, 37-3 Publshed Onlne May 04 n ScRes. http://www.scrp.org/journal/am http://dx.do.org/0.436/am.04.584 The Research of Ellpse Parameter Fttng Algorthm of Ultrasonc Imagng Loggng

More information

C2 Training: June 8 9, Combining effect sizes across studies. Create a set of independent effect sizes. Introduction to meta-analysis

C2 Training: June 8 9, Combining effect sizes across studies. Create a set of independent effect sizes. Introduction to meta-analysis C2 Tranng: June 8 9, 2010 Introducton to meta-analyss The Campbell Collaboraton www.campbellcollaboraton.org Combnng effect szes across studes Compute effect szes wthn each study Create a set of ndependent

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

Outline. CHARM: An Efficient Algorithm for Closed Itemset Mining. Introductions. Introductions

Outline. CHARM: An Efficient Algorithm for Closed Itemset Mining. Introductions. Introductions CHARM: An Effcent Algorthm for Closed Itemset Mnng Authors: Mohammed J. Zak and Chng-Ju Hsao Presenter: Junfeng Wu Outlne Introductons Itemset-Tdset tree CHARM algorthm Performance study Concluson Comments

More information

Dimensionality Reduction and Clustering on Statistical Manifolds

Dimensionality Reduction and Clustering on Statistical Manifolds Dmensonalt Reducton and Clusterng on Statstcal Manfolds Sang-Mook Lee and A. Lnn Abbott Vrgna Poltechnc Insttute and State Unverst Blacksburg, VA 24061, USA LSMOOK@vt.edu, abbott@vt.edu Phlp A. Araman

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

Appearance-based Statistical Methods for Face Recognition

Appearance-based Statistical Methods for Face Recognition 47th Internatonal Symposum ELMAR-2005, 08-10 June 2005, Zadar, Croata Appearance-based Statstcal Methods for Face Recognton Kresmr Delac 1, Mslav Grgc 2, Panos Latss 3 1 Croatan elecom, Savsa 32, Zagreb,

More information

New Extensions of the 3-Simplex for Exterior Orientation

New Extensions of the 3-Simplex for Exterior Orientation New Extensons of the 3-Smplex for Exteror Orentaton John M. Stenbs Tyrone L. Vncent Wllam A. Hoff Colorado School of Mnes jstenbs@gmal.com tvncent@mnes.edu whoff@mnes.edu Abstract Object pose may be determned

More information

An Efficient Algorithm for High-Dimensional Log-Concave Maximum Likelihood

An Efficient Algorithm for High-Dimensional Log-Concave Maximum Likelihood An Effcent Algorthm for Hgh-Dmensonal Log-Concave Maxmum Lkelhood Bran Axelrod Stanford Unversty baxelrod@cs.stanford.edu Gregory Valant Stanford Unversty valant@stanford.edu Abstract The log-concave maxmum

More information

Human Skeleton Reconstruction for Optical Motion Capture

Human Skeleton Reconstruction for Optical Motion Capture Journal of Computatonal Informaton Systems 9: 0 (013) 8073 8080 Avalable at http://www.jofcs.com Human Skeleton Reconstructon for Optcal Moton Capture Guanghua TAN, Melan ZHOU, Chunmng GAO College of Informaton

More information

Hermite Splines in Lie Groups as Products of Geodesics

Hermite 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 information

Projection-Based Performance Modeling for Inter/Intra-Die Variations

Projection-Based Performance Modeling for Inter/Intra-Die Variations Proecton-Based Performance Modelng for Inter/Intra-De Varatons Xn L, Jayong Le 2, Lawrence. Plegg and Andrze Strowas Dept. of Electrcal & Computer Engneerng Carnege Mellon Unversty Pttsburgh, PA 523, USA

More information

Today Using Fourier-Motzkin elimination for code generation Using Fourier-Motzkin elimination for determining schedule constraints

Today Using Fourier-Motzkin elimination for code generation Using Fourier-Motzkin elimination for determining schedule constraints Fourer Motzkn Elmnaton Logstcs HW10 due Frday Aprl 27 th Today Usng Fourer-Motzkn elmnaton for code generaton Usng Fourer-Motzkn elmnaton for determnng schedule constrants Unversty Fourer-Motzkn Elmnaton

More information

Categories and Subject Descriptors B.7.2 [Integrated Circuits]: Design Aids Verification. General Terms Algorithms

Categories and Subject Descriptors B.7.2 [Integrated Circuits]: Design Aids Verification. General Terms Algorithms 3. Fndng Determnstc Soluton from Underdetermned Equaton: Large-Scale Performance Modelng by Least Angle Regresson Xn L ECE Department, Carnege Mellon Unversty Forbs Avenue, Pttsburgh, PA 3 xnl@ece.cmu.edu

More information

Fitting & Matching. Lecture 4 Prof. Bregler. Slides from: S. Lazebnik, S. Seitz, M. Pollefeys, A. Effros.

Fitting & Matching. Lecture 4 Prof. Bregler. Slides from: S. Lazebnik, S. Seitz, M. Pollefeys, A. Effros. Fttng & Matchng Lecture 4 Prof. Bregler Sldes from: S. Lazebnk, S. Setz, M. Pollefeys, A. Effros. How do we buld panorama? We need to match (algn) mages Matchng wth Features Detect feature ponts n both

More information

EXACT PRINCIPAL GEODESIC ANALYSIS FOR DATA ON SO(3)

EXACT PRINCIPAL GEODESIC ANALYSIS FOR DATA ON SO(3) 15th European Sgnal Processng Conference (EUSIPCO 27), Poznan, Poland, September 3-7, 27, copyrght by EURASIP EXACT PRINCIPAL GEODESIC ANALYSIS FOR DATA ON SO(3) Salem SAID (1), Ncolas COURTY (2), Ncolas

More information

Fuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches

Fuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches Proceedngs of the Internatonal Conference on Cognton and Recognton Fuzzy Flterng Algorthms for Image Processng: Performance Evaluaton of Varous Approaches Rajoo Pandey and Umesh Ghanekar Department of

More information

Announcements. Supervised Learning

Announcements. Supervised Learning Announcements See Chapter 5 of Duda, Hart, and Stork. Tutoral by Burge lnked to on web page. Supervsed Learnng Classfcaton wth labeled eamples. Images vectors n hgh-d space. Supervsed Learnng Labeled eamples

More information

Registration of Expressions Data using a 3D Morphable Model

Registration of Expressions Data using a 3D Morphable Model Regstraton of Expressons Data usng a 3D Morphable Model Curzo Basso DISI, Unverstà d Genova, Italy Emal: curzo.basso@ds.unge.t Thomas Vetter Departement Informatk, Unverstät Basel, Swtzerland Emal: thomas.vetter@unbas.ch

More information

Finite Element Analysis of Rubber Sealing Ring Resilience Behavior Qu Jia 1,a, Chen Geng 1,b and Yang Yuwei 2,c

Finite Element Analysis of Rubber Sealing Ring Resilience Behavior Qu Jia 1,a, Chen Geng 1,b and Yang Yuwei 2,c Advanced Materals Research Onlne: 03-06-3 ISSN: 66-8985, Vol. 705, pp 40-44 do:0.408/www.scentfc.net/amr.705.40 03 Trans Tech Publcatons, Swtzerland Fnte Element Analyss of Rubber Sealng Rng Reslence Behavor

More information

Lecture #15 Lecture Notes

Lecture #15 Lecture Notes Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal

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

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

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

MULTISCALE SPARSE APPEARANCE MODELING AND SIMULATION OF PATHOLOGICAL DEFORMATIONS

MULTISCALE SPARSE APPEARANCE MODELING AND SIMULATION OF PATHOLOGICAL DEFORMATIONS RAMI ZEWAIL AND AHMED HAG-ELSAFI: MULTISCALE SPARSE APPEARANCE MODELING AND SIMULATION OF PATHOLOGICAL DEFORMATIONS DOI: 10.21917/jvp.2017.0225 MULTISCALE SPARSE APPEARANCE MODELING AND SIMULATION OF PATHOLOGICAL

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

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

Learning Ensemble of Local PDM-based Regressions. Yen Le Computational Biomedicine Lab Advisor: Prof. Ioannis A. Kakadiaris

Learning Ensemble of Local PDM-based Regressions. Yen Le Computational Biomedicine Lab Advisor: Prof. Ioannis A. Kakadiaris Learnng Ensemble of Local PDM-based Regressons Yen Le Computatonal Bomedcne Lab Advsor: Prof. Ioanns A. Kakadars 1 Problem statement Fttng a statstcal shape model (PDM) for mage segmentaton Callosum segmentaton

More information

Fitting and Alignment

Fitting and Alignment Fttng and Algnment Computer Vson Ja-Bn Huang, Vrgna Tech Many sldes from S. Lazebnk and D. Hoem Admnstratve Stuffs HW 1 Competton: Edge Detecton Submsson lnk HW 2 wll be posted tonght Due Oct 09 (Mon)

More information

Human Face Recognition Using Generalized. Kernel Fisher Discriminant

Human Face Recognition Using Generalized. Kernel Fisher Discriminant Human Face Recognton Usng Generalzed Kernel Fsher Dscrmnant ng-yu Sun,2 De-Shuang Huang Ln Guo. Insttute of Intellgent Machnes, Chnese Academy of Scences, P.O.ox 30, Hefe, Anhu, Chna. 2. Department of

More information

On the diameter of random planar graphs

On the diameter of random planar graphs On the dameter of random planar graphs Gullaume Chapuy, CNRS & LIAFA, Pars jont work wth Érc Fusy, Pars, Omer Gménez, ex-barcelona, Marc Noy, Barcelona. Probablty and Graphs, Eurandom, Endhoven, 04. Planar

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

A NEW APPROACH FOR SUBWAY TUNNEL DEFORMATION MONITORING: HIGH-RESOLUTION TERRESTRIAL LASER SCANNING

A NEW APPROACH FOR SUBWAY TUNNEL DEFORMATION MONITORING: HIGH-RESOLUTION TERRESTRIAL LASER SCANNING A NEW APPROACH FOR SUBWAY TUNNEL DEFORMATION MONITORING: HIGH-RESOLUTION TERRESTRIAL LASER SCANNING L Jan a, Wan Youchuan a,, Gao Xanjun a a School of Remote Sensng and Informaton Engneerng, Wuhan Unversty,129

More information

Reading. 14. Subdivision curves. Recommended:

Reading. 14. Subdivision curves. Recommended: eadng ecommended: Stollntz, Deose, and Salesn. Wavelets for Computer Graphcs: heory and Applcatons, 996, secton 6.-6., A.5. 4. Subdvson curves Note: there s an error n Stollntz, et al., secton A.5. Equaton

More information

Vectorization in the Polyhedral Model

Vectorization in the Polyhedral Model Vectorzaton n the Polyhedral Model Lous-Noël Pouchet pouchet@cse.oho-state.edu Dept. of Computer Scence and Engneerng, the Oho State Unversty October 200 888. Introducton: Overvew Vectorzaton: Detecton

More information

Feature Extractions for Iris Recognition

Feature Extractions for Iris Recognition Feature Extractons for Irs Recognton Jnwook Go, Jan Jang, Yllbyung Lee, and Chulhee Lee Department of Electrcal and Electronc Engneerng, Yonse Unversty 134 Shnchon-Dong, Seodaemoon-Gu, Seoul, KOREA Emal:

More information

A METHOD FOR RANKING OF FUZZY NUMBERS USING NEW WEIGHTED DISTANCE

A METHOD FOR RANKING OF FUZZY NUMBERS USING NEW WEIGHTED DISTANCE Mathematcal and omputatonal pplcatons, Vol 6, No, pp 359-369, ssocaton for Scentfc Research METHOD FOR RNKING OF FUZZY NUMERS USING NEW WEIGHTED DISTNE T llahvranloo, S bbasbandy, R Sanefard Department

More information

An Ensemble Learning algorithm for Blind Signal Separation Problem

An Ensemble Learning algorithm for Blind Signal Separation Problem An Ensemble Learnng algorthm for Blnd Sgnal Separaton Problem Yan L 1 and Peng Wen 1 Department of Mathematcs and Computng, Faculty of Engneerng and Surveyng The Unversty of Southern Queensland, Queensland,

More information

Classification / Regression Support Vector Machines

Classification / Regression Support Vector Machines Classfcaton / Regresson Support Vector Machnes Jeff Howbert Introducton to Machne Learnng Wnter 04 Topcs SVM classfers for lnearly separable classes SVM classfers for non-lnearly separable classes SVM

More information

LOCALIZING USERS AND ITEMS FROM PAIRED COMPARISONS. Matthew R. O Shaughnessy and Mark A. Davenport

LOCALIZING USERS AND ITEMS FROM PAIRED COMPARISONS. Matthew R. O Shaughnessy and Mark A. Davenport 2016 IEEE INTERNATIONAL WORKSHOP ON MACHINE LEARNING FOR SIGNAL PROCESSING, SEPT. 13 16, 2016, SALERNO, ITALY LOCALIZING USERS AND ITEMS FROM PAIRED COMPARISONS Matthew R. O Shaughnessy and Mark A. Davenport

More information

Outline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like:

Outline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like: Self-Organzng Maps (SOM) Turgay İBRİKÇİ, PhD. Outlne Introducton Structures of SOM SOM Archtecture Neghborhoods SOM Algorthm Examples Summary 1 2 Unsupervsed Hebban Learnng US Hebban Learnng, Cntd 3 A

More information

Kernel-PCA Analysis of Surface Normals for Shape-from-Shading

Kernel-PCA Analysis of Surface Normals for Shape-from-Shading Kernel-PCA Analyss of Surface Normals for Shape-from-Shadng Patrc Snape Stefanos Zaferou Imperal College London {p.snape,s.zaferou}@mperal.ac.u Abstract We propose a ernel-based framewor for computng components

More information

CORRELATION ICP ALGORITHM FOR POSE ESTIMATION BASED ON LOCAL AND GLOBAL FEATURES

CORRELATION ICP ALGORITHM FOR POSE ESTIMATION BASED ON LOCAL AND GLOBAL FEATURES CORRELATION ICP ALGORITHM FOR POSE ESTIMATION BASED ON LOCAL AND GLOBAL FEATURES Marco A. Chavarra, Gerald Sommer Cogntve Systems Group. Chrstan-Albrechts-Unversty of Kel, D-2498 Kel, Germany {mc,gs}@ks.nformatk.un-kel.de

More information

Probability Base Classification Technique: A Preliminary Study for Two Groups

Probability Base Classification Technique: A Preliminary Study for Two Groups Mathematcal Theory and Modelng ISSN 4-5804 (Paper) ISSN 5-05 (Onlne) www.ste.org Probablty Base Classfcaton Technque: A Prelmnary Study for Two Groups Frday Znzendoff Okwonu,* Abdul Rahman Othman. Department

More information

LEAST SQUARES. RANSAC. HOUGH TRANSFORM.

LEAST SQUARES. RANSAC. HOUGH TRANSFORM. LEAS SQUARES. RANSAC. HOUGH RANSFORM. he sldes are from several sources through James Has (Brown); Srnvasa Narasmhan (CMU); Slvo Savarese (U. of Mchgan); Bll Freeman and Antono orralba (MI), ncludng ther

More information

Signature and Lexicon Pruning Techniques

Signature and Lexicon Pruning Techniques Sgnature and Lexcon Prunng Technques Srnvas Palla, Hansheng Le, Venu Govndaraju Centre for Unfed Bometrcs and Sensors Unversty at Buffalo {spalla2, hle, govnd}@cedar.buffalo.edu Abstract Handwrtten word

More information

Analysis of EEG of shooters

Analysis of EEG of shooters Analyss of EEG of shooters Nuno Bandera Computer Scence Dept. New Unversty of Lsbon Qunta da Torre 2825-114 Caparca Vctor Lobo Portuguese Naval Academy, Escola Naval, Alfete, 28 ALMADA Fernando Moura-Pres

More information

An Entropy-Based Approach to Integrated Information Needs Assessment

An Entropy-Based Approach to Integrated Information Needs Assessment Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology

More information

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume

More information

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline

Image 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 information

A CLASS OF TRANSFORMED EFFICIENT RATIO ESTIMATORS OF FINITE POPULATION MEAN. Department of Statistics, Islamia College, Peshawar, Pakistan 2

A CLASS OF TRANSFORMED EFFICIENT RATIO ESTIMATORS OF FINITE POPULATION MEAN. Department of Statistics, Islamia College, Peshawar, Pakistan 2 Pa. J. Statst. 5 Vol. 3(4), 353-36 A CLASS OF TRANSFORMED EFFICIENT RATIO ESTIMATORS OF FINITE POPULATION MEAN Sajjad Ahmad Khan, Hameed Al, Sadaf Manzoor and Alamgr Department of Statstcs, Islama College,

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

A unified library of nonlinear solution schemes

A unified library of nonlinear solution schemes A unfed lbrary of nonlnear soluton schemes Sofe E. Leon, Glauco H. Paulno, Anderson Perera, Ivan F. M. Menezes, Eduardo N. Lages 7/27/2011 Motvaton Nonlnear problems are prevalent n structural, flud, contnuum,

More information

Non-Rigid Registration and Correspondence Finding in Medical Image Analysis Using Multiple-Layer Flexible Mesh Template Matching

Non-Rigid Registration and Correspondence Finding in Medical Image Analysis Using Multiple-Layer Flexible Mesh Template Matching Non-Rgd Regstraton and Correspondence Fndng n Medcal Image Analyss Usng Multple-Layer Flexble Mesh Template Matchng Janhua Yao, Russell Taylor 2. Dagnostc Radology Department, Clncal Center, Natonal Insttutes

More information

ELEC 377 Operating Systems. Week 6 Class 3

ELEC 377 Operating Systems. Week 6 Class 3 ELEC 377 Operatng Systems Week 6 Class 3 Last Class Memory Management Memory Pagng Pagng Structure ELEC 377 Operatng Systems Today Pagng Szes Vrtual Memory Concept Demand Pagng ELEC 377 Operatng Systems

More information

Solving two-person zero-sum game by Matlab

Solving two-person zero-sum game by Matlab Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by

More information

AC : TEACHING SPREADSHEET-BASED NUMERICAL ANAL- YSIS WITH VISUAL BASIC FOR APPLICATIONS AND VIRTUAL IN- STRUMENTS

AC : TEACHING SPREADSHEET-BASED NUMERICAL ANAL- YSIS WITH VISUAL BASIC FOR APPLICATIONS AND VIRTUAL IN- STRUMENTS AC 2011-1615: TEACHING SPREADSHEET-BASED NUMERICAL ANAL- YSIS WITH VISUAL BASIC FOR APPLICATIONS AND VIRTUAL IN- STRUMENTS Nkunja Swan, South Carolna State Unversty Dr. Swan s currently a Professor at

More information

Structural Optimization Using OPTIMIZER Program

Structural Optimization Using OPTIMIZER Program SprngerLnk - Book Chapter http://www.sprngerlnk.com/content/m28478j4372qh274/?prnt=true ق.ظ 1 of 2 2009/03/12 11:30 Book Chapter large verson Structural Optmzaton Usng OPTIMIZER Program Book III European

More information

Probabilistic Multi-Shape Representation using an Isometric Log-Ratio Mapping

Probabilistic Multi-Shape Representation using an Isometric Log-Ratio Mapping Probablstc Mult-Shape Representaton usng an Isometrc Log-Rato Mappng Neda Changz and Ghassan Hamarneh Medcal Image Analyss Lab, Smon Fraser Unversty, Canada {nca19,hamarneh}@cs.sfu.ca Abstract. Several

More information

Line Clipping by Convex and Nonconvex Polyhedra in E 3

Line Clipping by Convex and Nonconvex Polyhedra in E 3 Lne Clppng by Convex and Nonconvex Polyhedra n E 3 Václav Skala 1 Department of Informatcs and Computer Scence Unversty of West Bohema Unverztní 22, Box 314, 306 14 Plzeò Czech Republc e-mal: skala@kv.zcu.cz

More information

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010 Smulaton: Solvng Dynamc Models ABE 5646 Week Chapter 2, Sprng 200 Week Descrpton Readng Materal Mar 5- Mar 9 Evaluatng [Crop] Models Comparng a model wth data - Graphcal, errors - Measures of agreement

More information

Array transposition in CUDA shared memory

Array transposition in CUDA shared memory Array transposton n CUDA shared memory Mke Gles February 19, 2014 Abstract Ths short note s nspred by some code wrtten by Jeremy Appleyard for the transposton of data through shared memory. I had some

More information

Human Action Recognition Using Dynamic Time Warping Algorithm and Reproducing Kernel Hilbert Space for Matrix Manifold

Human Action Recognition Using Dynamic Time Warping Algorithm and Reproducing Kernel Hilbert Space for Matrix Manifold IJCTA, 10(07), 2017, pp 79-85 Internatonal Scence Press Closed Loop Control of Soft Swtched Forward Converter Usng Intellgent Controller 79 Human Acton Recognton Usng Dynamc Tme Warpng Algorthm and Reproducng

More information

cos(a, b) = at b a b. To get a distance measure, subtract the cosine similarity from one. dist(a, b) =1 cos(a, b)

cos(a, b) = at b a b. To get a distance measure, subtract the cosine similarity from one. dist(a, b) =1 cos(a, b) 8 Clusterng 8.1 Some Clusterng Examples Clusterng comes up n many contexts. For example, one mght want to cluster journal artcles nto clusters of artcles on related topcs. In dong ths, one frst represents

More information

Loop Transformations, Dependences, and Parallelization

Loop Transformations, Dependences, and Parallelization Loop Transformatons, Dependences, and Parallelzaton Announcements Mdterm s Frday from 3-4:15 n ths room Today Semester long project Data dependence recap Parallelsm and storage tradeoff Scalar expanson

More information

Synthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007

Synthesizer 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 information

Learned Binary Spectral Shape Descriptor for 3D Shape Correspondence

Learned Binary Spectral Shape Descriptor for 3D Shape Correspondence Learned Bnary Spectral Shape Descrptor for 3D Shape Correspondence Jn Xe, Meng Wang, and Y Fang NYU Multmeda and Vsual Computng Lab, UAE Department of Electrcal and Computer Engneerng, New York 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

Machine Learning 9. week

Machine Learning 9. week Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below

More information

Statistical analysis on mean rainfall and mean temperature via functional data analysis technique

Statistical analysis on mean rainfall and mean temperature via functional data analysis technique Statstcal analyss on mean ranfall and mean temperature va functonal data analyss technque Jamaludn Suhala Ctaton: AIP Conference Proceedngs 1613, 368 (01); do: 10.1063/1.89361 Vew onlne: http://dx.do.org/10.1063/1.89361

More information

CLASSIFICATION OF ULTRASONIC SIGNALS

CLASSIFICATION OF ULTRASONIC SIGNALS The 8 th Internatonal Conference of the Slovenan Socety for Non-Destructve Testng»Applcaton of Contemporary Non-Destructve Testng n Engneerng«September -3, 5, Portorož, Slovena, pp. 7-33 CLASSIFICATION

More information

Speed of price adjustment with price conjectures

Speed of price adjustment with price conjectures Seed of rce adustment wh rce conectures Mchael Olve Macquare Unversy, Sydney, Australa Emal: molve@efs.mq.edu.au Abstract We derve a measure of frm seed of rce adustment that s drectly nversely related

More information