Identification of multi-scale hierarchical brain functional networks using deep matrix factorization
|
|
- Beatrix Waters
- 5 years ago
- Views:
Transcription
1 Identfcaton of mult-scale herarchcal bran functonal networks usng deep matrx factorzaton Hongmng L, Xaofeng Zhu, Yong Fan Center for Bomedcal Image Computng and Analytcs, Department of Radology, Perelman School of Medcne, Unversty of Pennsylvana Abstract. We present a deep sem-nonnegatve matrx factorzaton method for dentfyng subject-specfc functonal networks (FNs) at multple spatal scales wth a herarchcal organzaton from restng state fmri data. Our method s bult upon a deep sem-nonnegatve matrx factorzaton framework to jontly detect the FNs at multple scales wth a herarchcal organzaton, enhanced by group sparsty regularzaton that helps dentfy subject-specfc FNs wthout loss of nter-subject comparablty. The proposed method has been valdated for predctng subject-specfc functonal actvatons based on functonal connectvty measures of the herarchcal mult-scale FNs of the same subjects. Expermental results have demonstrated that our method could obtan subject-specfc mult-scale herarchcal FNs and ther functonal connectvty measures across dfferent scales could better predct subject-specfc functonal actvatons than those obtaned by alternatve technques. Keywords: bran functonal networks, mult-scale, herarchcal, subjectspecfc, deep matrx factorzaton 1 Introducton The human bran can be represented as a multscale herarchcal network [1, 2]. However, exstng functonal bran network analyss studes of restng-state functonal magnetc resonance magng (rsfmri) data typcally defne network nodes at a specfc scale, based on regons of nterest (ROIs) obtaned from anatomcal atlases or functonal bran parcellatons [3-5]. Recent work has demonstrated mportant subjectspecfc varaton n the functonal neuroanatomy of large-scale bran networks [6], emphaszng the need for tools whch can flexbly adapt to ndvduals varaton whle smultaneously mantanng correspondence for group-level analyses. To capture subject-specfc FC wthout loss of nter-subject comparablty, datadrven bran decomposton methods have been wdely adopted to dentfy spatal ntrnsc functonal networks (FNs) and estmate functonal network connectvty. In order to obtan subject-specfc FNs from rsfmri data of ndvdual subjects whle facltatng groupwse nference, ndependent vector analyss (IVA) and groupnformaton guded ICA (GIGICA) methods have been proposed [7, 8]. More recently, several methods have been proposed to dscover FNs from rsfmri data wth nonndependence assumptons [9-11], and drectly work on ndvdual subject fmri data
2 and smultaneously enforce correspondence across FNs of dfferent subjects by assumng that loadngs of correspondng FNs of dfferent subjects follow Gaussan [9] or delta-gaussan [10] dstrbutons. Non-negatve matrx decomposton technques have been adopted to smultaneously compute subject-specfc FNs for a group of subjects regularzed by group sparsty n order to separate ant-correlated FNs properly so that ant-correlaton nformaton between them could be preserved [11, 12]. However, these methods are not equpped to characterze mult-scale herarchcal organzaton of the bran networks [2]. Although clusterng and module detecton algorthms could be adopted to detect the herarchcal organzaton of bran networks, ther performance s hnged on the network nodes/fns used [13, 14]. To address the aforementoned lmtatons of exstng technques, we develop a novel bran decomposton model based on a collaboratve sparse bran decomposton approach [11] and deep matrx factorzaton technques [15], amng to dentfy subject-specfc, mult-scale herarchal FNs from rsfmri data. Based on rsfmri data and task actvaton maps of unrelated subjects from the HCP dataset [16], we have quanttatvely evaluated our method for predctng subject-specfc functonal actvatons based on functonal connectvty measures of the herarchcal mult-scale FNs of the same subjects. Expermental results have demonstrated that the mult-scale herarchcal subject-specfc FNs dentfed by our method from rsfmri data could better predct the subject-specfc functonal actvatons evoked by dfferent tasks than those dentfed by alternatve technques. Fg. 1. Framework of the deep decomposton model for dentfyng mult-scale herarchcal subject-specfc functonal networks (a two-scale decomposton s llustrated). 2 Methods A deep matrx decomposton framework s proposed to dentfy FNs at multple scales as schematcally llustrated n Fg. 1. Partcularly, a deep sem-nonnegatve matrx factorzaton s adopted to jontly detect a herarchy of FNs from fne to coarse spatal scales n a data-drven way, and a group sparsty regularzaton term s adopted for FNs of dfferent subjects at each scale to ensure the subject-specfc FNs to share smlar spatal patterns. Besdes enforcng the groupwse correspondence of FNs across subjects, the group sparsty term also encourages FNs at the fnest scale to have sparse spatal patterns and FNs at coarse scales to comprse functonally correlated FNs at fner scales. Our decomposton model s further enhanced by a data localty
3 regularzaton term that makes the decomposton robust to magng nose and mproves spatal smoothness and functonal coherences of the subject specfc FNs. 2.1 Deep sem-nonnegatve matrx factorzaton for bran decomposton Gven rsfmri data X R T S of subject, consstng of S voxels and T tme ponts, we am to fnd K j nonnegatve FNs V K j = (V j:k,s ) R j S + and ther correspondng tme courses U j = (U j:t,k ) R T K j at j = 1,, h scales, so that X U 1 V 1 ; X U 2 V 2 V 1, V 2 = V 2 V 1 ; ; X U h V h V 1, V h = V h V 1. The FNs V j at 1 j h scales are constraned to have a herarchcal structure and to be non-negatve so that each FN does not contan any ant-correlated functonal unts. A deep sem-nonnegatve matrx factorzaton (DSNMF) framework smlar to [15] s adopted to dentfy the mult-scale herarchcal FNs by optmzng mn X U h V h V 1 2 {U j,v j } F, s. t. V j 0, V 1 = V 1, 1 j h. (1) The FNs at dfferent scales are represented by V h = V h V 1, 1 j h for subject, and the FNs at 2 consecutve scales are lnked herarchcally accordng to weghts determned durng the jont decomposton. The decomposton model does not constran tme courses U h to be non-negatve so that t can be appled to preprocessed fmri data wth negatve values. 2.2 DSNMF based collaboratve bran decomposton Gven a group of n subjects, each havng fmri data X R T S, = 1,, n, we dentfy subject-specfc, multscale herarchcal FNs by optmzng a jont model wth ntegrated data fttng and regularzaton terms as llustrated n Fg. 1: n mn X U h V h V 1 2 F + λ c,j R c,j + λ M R M, {U j,v j } =1 s. t. V j 0, V j:kj, = 1, 1 k j K j, 1 n, 1 j h, where λ c,j = α n T T and λ K M = β are parameters for balancng data fttng and j K 1 n M regularzaton terms, T s the number of tme ponts, K j s the number of FNs at scale j, n M s the number of spatally neghborng voxels at voxel level, α and β are 2 parameters, R c,j and R M are regularzaton terms. Partcularly, R c,j s an nter-subject group sparsty term that enforces FNs of dfferent subjects to have common spatal structures at the same scale j. The group sparsty regularzaton term s defned as S j K R c,j = j K ( (V j:k,s ) k=1 V j:k, = n s=1 =1 2 ) 1/2 j k=1 S j for each row of V j, 1 n, 1 j h, 1,..,n 2,1 h ( s=1 n =1(V j:k,s ) 2 ) 1/2 where S j = K j 1 when j > 1 and S 1 = S. The group sparsty regularzaton (term 1 n Fg.1) enforces correspondng FNs of dfferent subjects to have non-zero elements at the same spatal locatons. Moreover, t encourages FNs to have spatally localzed loadngs. It s worth notng that the group sparsty term does not force dfferent FNs to be non-overlappng, thus certan functonal unts may be ncluded n multple FNs j n =1 (2)
4 smultaneously at each scale. We also adopt a data localty regularzaton term (term 2 n Fg.1), R M, to encourage spatal smoothness and functonal coherence of the FNs usng a graph regularzaton technque [17] at the fnest spatal scale, whch s defned as R M = Tr(V 1 L M (V 1 ) ), where L M = D M W M s a Laplacan matrx for subject, W M s a parwse affnty matrx to measure spatal closeness or functonal smlarty between voxels, and D M s ts correspondng degree matrx, the affnty between each par of spatally connected voxels s calculated as (1 + corr(x,a, X,b ))/2, where corr(x,a, X,b ) s the Pearson correlaton coeffcent between ther rsfmri sgnals, and others are set to zero so that W M had a sparse structure. We optmze the jont model usng an alternatve update strategy. When U h and V k (k j) are fxed, V j s updated as V j = V j [U j X ] + V j +[U j U j ] V j V jvj +λ c,j V j G L21 j /(G L2 j ) 3 [U j X ] V j +[U j U j ] + V j V j Vj +λ c,j V j /(G j G j L2 ) f j > 1 and V 1 = V 1 [U 1 X ] + +[U 1 U 1 ] V 1 +λ M V 1 W M +λ c,1 V 1 G L21 1 /(G L2 1 ) 3 f j = 1 [U 1 X ] +[U 1 U 1 ] + V 1 +λ M V 1 D M +λ c,1 V 1 /(G 1 G L2 1 ) L21 S = repmat( ( n =1 (V j:k,s G j:k, G j:k, s=1 ) 2 ) 1/2, 1, S), S s=1 n =1 ) 2 ) 1/2, 1, S), L2 = repmat(( (V j:k,s G j:k,s = ( n =1 (V j:k,s ) 2 ) 1/2, V j = V j 1 V j 2 V 1, where denotes element-wse multplcaton, repmat(b, r, c) denotes matrx obtaned by replcatng r and c copes of vector b n the row and column dmensons, [a] + = abs(a)+a, [a] 2 = abs(a) a, M 2 j:k, denotes the k-th row of matrx M j, and M j:k,s denotes the (k, s)-th element n the matrx. V j s normalzed by the row-wse maxmum value along the row dmenson after each update teraton. When V k, 1 k j are fxed, U j s updated as U j = X j (V j V j 1 V 1 ), (4) where M denotes the Moore-Penrose pseudo-nverse of matrx M. To expedte the convergence of the optmzaton, a pre-tranng step at group level s adopted before the jont optmzaton. In partcular, we compute (U 1, V 1 ) sparsenmf(x) frst, where X denotes the temporal concatenated data of { X, = 1,.., n}, and (U 2, V 2) sparsenmf(u 1 ),, (U h, V h) sparsenmf(u h 1 ), respectvely. {V 1, V 2,, V h} are then used to ntalze {V j, = 1,, n, j = 1,, h} for the jont optmzaton. {V 1, V 2,, V h} contans a herarchcal structure wth overlappng as they are obtaned by decomposton n a greedy manner. Once the ntalzaton s done, all FNs at dfferent scales are optmzed jontly. We set the parameters α to 1, and β to 10 accordng to [11] n the present study. (3) 3 Expermental results We evaluated our method based on rsfmri data and task actvaton maps of 40 unrelated subjects obtaned from the Human Connectome Project (HCP) [16], amng to evaluate the performance of predctng task-evoked actvaton responses based on
5 functonal connectvty measures of FNs at multple scales. The FNs derved from rsfmri data have demonstrated promsng performance for predctng task-evoked bran actvatons [18]. The proposed decomposton model was appled to the mnmal-preprocessed, cortcal gray-coordnates based rsfmri data. The number of scales was set to 3, and the number of FNs at the frst scale was set to 90, whch was estmated by MELODIC automatcally [19], the numbers of FNs at the 2 nd and 3 rd scales were set to 50 and 25 respectvely, whch were decreased by half approxmately along the scales. We compared the proposed model wth two alternatve decomposton strateges: mult-scale decomposton performed ndependently at dfferent scales, and greedy agglomeratve herarchcal mult-scale decomposton, wth the same settng of scales and the same numbers of FNs. For the ndependent decomposton, the collaboratve sparse decomposton model was adopted to obtan subject-specfc FNs ndependent at 3 scales (wth ndependent ntalzaton). For the agglomeratve one, the ntalzaton obtaned by greedy decomposton as descrbed secton 2.2 was adopted for each scale, but the fnal decomposton at each scale was obtaned usng the collaboratve sparse model separately. (a) (b) Fg. 2. Mult-scale functonal networks dentfed by dfferent methods. (a) A herarchy of FNs obtaned by the proposed method correspondng to sensormotor networks. FNs at dfferent scales are denoted by boundng boxes n dfferent colors. (b) Sensormotor regons n separate FNs at the coarsest scale (the 3 rd ) dentfed ndependently of other scales. 3.1 Mult-scale bran functonal networks wth a herarchcal organzaton An example herarchy of FNs (mean of 40 subjects) correspondng to sensormotor functon obtaned by the proposed method s llustrated n Fg. 2 (a). The FN at the 3 rd scale (top left) comprsed the sensormotor networks and part of vsual networks, and was a weghted composton of FNs at the 2 nd scale whle the FNs at the 2 nd scale were composed of FNs at the 1 st scale. Ths example herarchy of FNs llustrated that FNs correspondng to sensormotor functon gradually merged from fne to coarse scales n the herarchy. However, no clear herarchcal organzaton was observed for
6 FNs ndependently dentfed at dfferent scales. Partcularly, as shown n Fg. 2 (b) sensormotor regons appeared n separate FNs at the coarsest scale (the 3 rd ), nstead of formng a sngle FN. We postulated that the ndependent decomposton at dfferent scales favored to better data-fttng and therefore was affected by data nose, whle the jont decomposton model was more robust to data nose, facltatng accurate dentfcaton of FNs wth coherent functons, such as the FN comprsng sensormotor regons shown n Fg. 2 (a). 3.2 Predcton of task evoked actvatons based on mult-scale FN connectvty As no ground truth s avalable for FNs derved from rsfmri data, we evaluated the mult-scale herarchcal FNs for predctng functonal actvatons evoked by dfferent tasks based on ther functonal connectvty measures wth an assumpton that better FNs could provde more dscrmnatve nformaton for predctng the bran actvatons. We also compared FNs obtaned usng dfferent strateges n terms of ther predcton performance. Fg. 3. Quanttatve comparson of predcton performance for functonal actvatons of dfferent tasks (top: motor task events ncludng left foot, left hand, and tongue; bottom: workng memory task events ncludng 2bk_body, 2bk_face, and 0bk_tool). s1 to s3, g1 to g3, and h1 to h3 denote models traned based on FNs at sngle scale dentfed ndependently, n a greedy agglomeratve manner, and herarchcally by our method, respectvely, whle m_s, m_g and m_h denote models traned based on correspondng mult-scale FNs. The models bult upon FNs obtaned by our method performed sgnfcantly better than others (Wlcoxon sgned rank test, p < 0.02). Partcularly, a whole bran voxelwse functonal connectvty (FC) map was obtaned for each FN by computng voxelwse Pearson correlaton coeffcent between the FN s tme course and every cortcal gray-coordnate s tme course of the rsfmri data. All the FC maps were then transferred to z-score maps usng Fsher Z transformaton. All the z-score values of FNs on each cortcal gray-coordnate were used as features to predct ts actvaton measures under dfferent tasks of the same subject. Smlar to [18], the whole cortcal surface was dvded nto 90 parcels accordng to FNs obtaned at the fnest scale, and one ordnary least square model was traned for each parcel and every task event. The predcton performance was evaluated usng a
7 leave-one-subject-out cross-valdaton, where one subject s actvaton was predcted by a model bult upon data of the remanng 39 subjects. The predcton was conducted usng sngle-scale FNs (90, 50, 25) or mult-scale FNs (165) obtaned usng dfferent strateges respectvely, and the predcton accuracy was evaluated as the Pearson correlaton coeffcents between the predcted and real actvaton maps of 47 task events from 7 tasks categores. The predcton performance of 6 randomly selected task events s llustrated n Fg. 3. For all task events and FNs dentfed by dfferent strateges, the predcton models bult upon mult-scale FNs outperformed all predcton models bult upon any sngle scale FNs alone, ndcatng that mult-scale FNs could provde complementary nformaton for the task actvaton predcton. The predcton models bult upon mult-scale herarchcal FNs obtaned by our method had sgnfcantly better performance than those buld upon mult-scale FNs obtaned by ether the ndependent decomposton or the greedy agglomeratve decomposton (Wlcoxon sgned rank test, p < 0.02), ndcatng that the jont optmzaton of mult-scale herarchcal FNs could beneft from each other and characterze the ntrnsc FNs better. 4 Conclusons In ths study, we have developed a deep decomposton model to dentfy mult-scale, herarchcal, subject-specfc FNs wth group level correspondence across dfferent subjects. Our method s bult upon deep sem-nonnegatve matrx factorzaton framework, enhanced by a group sparsty regularzaton and graph regularzaton for mantanng nter-subject correspondence and better functonal coherence. Expermental results based on rsfmri data and task actvaton maps of the same subjects have demonstrated that the mult-scale herarchcal subject-specfc FNs could capture nformatve ntrnsc functonal networks and mprove the predcton performance of task actvatons evoked by dfferent tasks, compared to FNs dentfed at dfferent scales ndependently or n a greedy agglomeratve way. In concluson, our method provdes an mproved soluton for characterzng subject-specfc, mult-scale herarchcal organzaton of the bran functonal networks. 5 Acknowledgements Ths work was supported n part by Natonal Insttutes of Health grants [CA223358, EB022573, DK114786, DA039215, and DA039002]. References 1. Doucet, G., et al., Bran actvty at rest: a multscale herarchcal functonal organzaton. J Neurophysol, (6): p Park, H.J. and K. Frston, Structural and functonal bran networks: from connectons to cognton. Scence, (6158): p
8 3. Bullmore, E. and O. Sporns, Complex bran networks: graph theoretcal analyss of structural and functonal systems. Nat Rev Neurosc, (3): p Honnorat, N., et al., GraSP: geodesc Graph-based Segmentaton wth Shape Prors for the functonal parcellaton of the cortex. Neuromage, : p L, H. and Y. Fan. Indvdualzed bran parcellaton wth ntegrated functonal and morphologcal nformaton. n 2016 IEEE 13th Internatonal Symposum on Bomedcal Imagng (ISBI) Satterthwate, T.D. and C. Davatzkos, Towards an Indvdualzed Delneaton of Functonal Neuroanatomy. Neuron, (3): p Du, Y. and Y. Fan, Group nformaton guded ICA for fmri data analyss. Neuromage, : p Lee, J.H., et al., Independent vector analyss (IVA): multvarate approach for fmri group study. Neuromage, (1): p Abraham, A., et al., Extractng bran regons from rest fmri wth total-varaton constraned dctonary learnng. Med Image Comput Comput Assst Interv, (Pt 2): p Harrson, S.J., et al., Large-scale probablstc functonal modes from restng state fmri. Neuromage, : p L, H., T.D. Satterthwate, and Y. Fan, Large-scale sparse functonal networks from restng state fmri. Neuromage, : p L, H., T. Satterthwate, and Y. Fan. Identfcaton of subject-specfc bran functonal networks usng a collaboratve sparse nonnegatve matrx decomposton method. n 2016 IEEE 13th Internatonal Symposum on Bomedcal Imagng (ISBI) L, H. and Y. Fan. Herarchcal organzaton of the functonal bran dentfed usng floatng aggregaton of functonal sgnals. n 2014 IEEE 11th Internatonal Symposum on Bomedcal Imagng (ISBI) L, H. and Y. Fan. Functonal bran atlas constructon for bran network analyss. n SPIE Medcal Imagng SPIE. 15. Trgeorgs, G., et al., A deep matrx factorzaton method for learnng attrbute representatons. IEEE transactons on pattern analyss and machne ntellgence, (3): p Glasser, M.F., et al., The mnmal preprocessng ppelnes for the Human Connectome Project. Neuromage, : p Ca, D., et al., Graph regularzed nonnegatve matrx factorzaton for data representaton. IEEE Transactons on Pattern Analyss and Machne Intellgence, (8): p Tavor, I., et al., Task-free MRI predcts ndvdual dfferences n bran actvty durng task performance. Scence, (6282): p Jenknson, M., et al., Fsl. Neuromage, (2): p
Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationDiscriminative Dictionary Learning with Pairwise Constraints
Dscrmnatve Dctonary Learnng wth Parwse Constrants Humn Guo Zhuoln Jang LARRY S. DAVIS UNIVERSITY OF MARYLAND Nov. 6 th, Outlne Introducton/motvaton Dctonary Learnng Dscrmnatve Dctonary Learnng wth Parwse
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 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 informationCollaboratively Regularized Nearest Points for Set Based Recognition
Academc Center for Computng and Meda Studes, Kyoto Unversty Collaboratvely Regularzed Nearest Ponts for Set Based Recognton Yang Wu, Mchhko Mnoh, Masayuk Mukunok Kyoto Unversty 9/1/013 BMVC 013 @ Brstol,
More informationSmoothing 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 informationSteps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices
Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between
More 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 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 informationAn 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 informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationOutline. 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 informationLearning a Class-Specific Dictionary for Facial Expression Recognition
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 16, No 4 Sofa 016 Prnt ISSN: 1311-970; Onlne ISSN: 1314-4081 DOI: 10.1515/cat-016-0067 Learnng a Class-Specfc Dctonary for
More informationClassifying Acoustic Transient Signals Using Artificial Intelligence
Classfyng Acoustc Transent Sgnals Usng Artfcal Intellgence Steve Sutton, Unversty of North Carolna At Wlmngton (suttons@charter.net) Greg Huff, Unversty of North Carolna At Wlmngton (jgh7476@uncwl.edu)
More informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
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 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 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 informationLearning 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 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 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 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 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 informationA B-Snake Model Using Statistical and Geometric Information - Applications to Medical Images
A B-Snake Model Usng Statstcal and Geometrc Informaton - Applcatons to Medcal Images Yue Wang, Eam Khwang Teoh and Dnggang Shen 2 School of Electrcal and Electronc Engneerng, Nanyang Technologcal Unversty
More informationComputer 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 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 informationDetermining 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 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 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 informationAdaptive Transfer Learning
Adaptve Transfer Learnng Bn Cao, Snno Jaln Pan, Yu Zhang, Dt-Yan Yeung, Qang Yang Hong Kong Unversty of Scence and Technology Clear Water Bay, Kowloon, Hong Kong {caobn,snnopan,zhangyu,dyyeung,qyang}@cse.ust.hk
More informationPositive Semi-definite Programming Localization in Wireless Sensor Networks
Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer
More 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 informationMachine 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 informationA Hierarchical Deformable Model Using Statistical and Geometric Information
A Herarchcal Deformable Model Usng Statstcal and Geometrc Informaton Dnggang Shen 3 and Chrstos Davatzkos Department of adology Department of Computer Scence 3 Center for Computer-Integrated Surgcal Systems
More informationData Mining: Model Evaluation
Data Mnng: Model Evaluaton Aprl 16, 2013 1 Issues: Evaluatng Classfcaton Methods Accurac classfer accurac: predctng class label predctor accurac: guessng value of predcted attrbutes Speed tme to construct
More informationEfficient Segmentation and Classification of Remote Sensing Image Using Local Self Similarity
ISSN(Onlne): 2320-9801 ISSN (Prnt): 2320-9798 Internatonal Journal of Innovatve Research n Computer and Communcaton Engneerng (An ISO 3297: 2007 Certfed Organzaton) Vol.2, Specal Issue 1, March 2014 Proceedngs
More informationLecture 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 informationModeling, Manipulating, and Visualizing Continuous Volumetric Data: A Novel Spline-based Approach
Modelng, Manpulatng, and Vsualzng Contnuous Volumetrc Data: A Novel Splne-based Approach Jng Hua Center for Vsual Computng, Department of Computer Scence SUNY at Stony Brook Talk Outlne Introducton and
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 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 informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More informationReal-time Joint Tracking of a Hand Manipulating an Object from RGB-D Input
Real-tme Jont Tracng of a Hand Manpulatng an Object from RGB-D Input Srnath Srdhar 1 Franzsa Mueller 1 Mchael Zollhöfer 1 Dan Casas 1 Antt Oulasvrta 2 Chrstan Theobalt 1 1 Max Planc Insttute for Informatcs
More informationDirectional Clustering through Matrix Factorisation
VERSION: NOVEMBER 30, 205 Drectonal Clusterng through Matrx Factorsaton Thomas Blumensath Member, IEEE Abstract Ths paper deals wth a clusterng problem where feature vectors are clustered dependng on the
More informationMulti-View Face Alignment Using 3D Shape Model for View Estimation
Mult-Vew Face Algnment Usng 3D Shape Model for Vew Estmaton Yanchao Su 1, Hazhou A 1, Shhong Lao 1 Computer Scence and Technology Department, Tsnghua Unversty Core Technology Center, Omron Corporaton ahz@mal.tsnghua.edu.cn
More informationSimulation: 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 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 informationCS 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 informationFeature 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 informationOptimizing Document Scoring for Query Retrieval
Optmzng Document Scorng for Query Retreval Brent Ellwen baellwe@cs.stanford.edu Abstract The goal of ths project was to automate the process of tunng a document query engne. Specfcally, I used machne learnng
More informationUnsupervised Learning and Clustering
Unsupervsed Learnng and Clusterng Supervsed vs. Unsupervsed Learnng Up to now we consdered supervsed learnng scenaro, where we are gven 1. samples 1,, n 2. class labels for all samples 1,, n Ths s also
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 informationCoil Sensitivity Estimation for Optimal SNR Reconstruction and Intensity Inhomogeneity Correction in Phased Array MR Imaging
Col Senstvty Estmaton for Optmal SNR Reconstructon and Intensty Inhomogenety Correcton n Phased Array MR Imagng Prashanth Vemur 1, Eugene G. Kholmovsk 1, Denns L. Parker 1, Bran E. Chapman 2 1 UCAIR, Department
More informationGraph-based Clustering
Graphbased Clusterng Transform the data nto a graph representaton ertces are the data ponts to be clustered Edges are eghted based on smlarty beteen data ponts Graph parttonng Þ Each connected component
More informationClassifier 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 informationA Similarity-Based Prognostics Approach for Remaining Useful Life Estimation of Engineered Systems
2008 INTERNATIONAL CONFERENCE ON PROGNOSTICS AND HEALTH MANAGEMENT A Smlarty-Based Prognostcs Approach for Remanng Useful Lfe Estmaton of Engneered Systems Tany Wang, Janbo Yu, Davd Segel, and Jay Lee
More informationHuman 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 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 informationTerm Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task
Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto
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 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 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 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 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 informationKeywords - Wep page classification; bag of words model; topic model; hierarchical classification; Support Vector Machines
(IJCSIS) Internatonal Journal of Computer Scence and Informaton Securty, Herarchcal Web Page Classfcaton Based on a Topc Model and Neghborng Pages Integraton Wongkot Srura Phayung Meesad Choochart Haruechayasak
More informationIN recent years, recommender systems, which help users discover
Heterogeneous Informaton Network Embeddng for Recommendaton Chuan Sh, Member, IEEE, Bnbn Hu, Wayne Xn Zhao Member, IEEE and Phlp S. Yu, Fellow, IEEE 1 arxv:1711.10730v1 [cs.si] 29 Nov 2017 Abstract Due
More informationUsing Fuzzy Logic to Enhance the Large Size Remote Sensing Images
Internatonal Journal of Informaton and Electroncs Engneerng Vol. 5 No. 6 November 015 Usng Fuzzy Logc to Enhance the Large Sze Remote Sensng Images Trung Nguyen Tu Huy Ngo Hoang and Thoa Vu Van Abstract
More informationIntegrated Expression-Invariant Face Recognition with Constrained Optical Flow
Integrated Expresson-Invarant Face Recognton wth Constraned Optcal Flow Chao-Kue Hseh, Shang-Hong La 2, and Yung-Chang Chen Department of Electrcal Engneerng, Natonal Tsng Hua Unversty, Tawan 2 Department
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 informationCS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 15
CS434a/541a: Pattern Recognton Prof. Olga Veksler Lecture 15 Today New Topc: Unsupervsed Learnng Supervsed vs. unsupervsed learnng Unsupervsed learnng Net Tme: parametrc unsupervsed learnng Today: nonparametrc
More informationKernel Collaborative Representation Classification Based on Adaptive Dictionary Learning
Internatonal Journal of Intellgent Informaton Systems 2018; 7(2): 15-22 http://www.scencepublshnggroup.com/j/js do: 10.11648/j.js.20180702.11 ISSN: 2328-7675 (Prnt); ISSN: 2328-7683 (Onlne) Kernel Collaboratve
More informationMulti-View Surveillance Video Summarization via Joint Embedding and Sparse Optimization
IEEE TRANSACTIONS ON MULTIMEDIA, VOL. XX, NO. XX, DECEMBER 20XX 1 Mult-Vew Survellance Vdeo Summarzaton va Jont Embeddng and Sparse Optmzaton Rameswar Panda and Amt K. Roy-Chowdhury, Senor Member, IEEE
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationThe Nottingham eprints service makes this work by researchers of the University of Nottingham available open access under the following conditions.
Da, Wujao and Lu, Bn and Meng, Xaoln and Huang, D. () Spato-temporal modellng of dam deformaton usng ndependent component analyss. Survey Revew, 6 (9). pp. 7-. ISSN 7-76 Access from the Unversty of Nottngham
More informationA Bilinear Model for Sparse Coding
A Blnear Model for Sparse Codng Davd B. Grmes and Rajesh P. N. Rao Department of Computer Scence and Engneerng Unversty of Washngton Seattle, WA 98195-2350, U.S.A. grmes,rao @cs.washngton.edu Abstract
More information7/12/2016. GROUP ANALYSIS Martin M. Monti UCLA Psychology AGGREGATING MULTIPLE SUBJECTS VARIANCE AT THE GROUP LEVEL
GROUP ANALYSIS Martn M. Mont UCLA Psychology NITP AGGREGATING MULTIPLE SUBJECTS When we conduct mult-subject analyss we are tryng to understand whether an effect s sgnfcant across a group of people. Whether
More informationAn 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 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 informationInverse-Polar Ray Projection for Recovering Projective Transformations
nverse-polar Ray Projecton for Recoverng Projectve Transformatons Yun Zhang The Center for Advanced Computer Studes Unversty of Lousana at Lafayette yxz646@lousana.edu Henry Chu The Center for Advanced
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 informationFace Recognition using 3D Directional Corner Points
2014 22nd Internatonal Conference on Pattern Recognton Face Recognton usng 3D Drectonal Corner Ponts Xun Yu, Yongsheng Gao School of Engneerng Grffth Unversty Nathan, QLD, Australa xun.yu@grffthun.edu.au,
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 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 informationReducing Frame Rate for Object Tracking
Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg
More informationRecommended Items Rating Prediction based on RBF Neural Network Optimized by PSO Algorithm
Recommended Items Ratng Predcton based on RBF Neural Network Optmzed by PSO Algorthm Chengfang Tan, Cayn Wang, Yuln L and Xx Q Abstract In order to mtgate the data sparsty and cold-start problems of recommendaton
More informationUnsupervised Co-segmentation of 3D Shapes via Functional Maps
Unsupervsed Co-segmentaton of 3D Shapes va Functonal aps Jun Yang School of Electronc and Informaton Engneerng, Lanzhou Jaotong Unversty, Lanzhou 730070, P. R. Chna yangj@mal.lzjtu.cn Zhenhua Tan School
More informationFingerprint matching based on weighting method and SVM
Fngerprnt matchng based on weghtng method and SVM Ja Ja, Lanhong Ca, Pnyan Lu, Xuhu Lu Key Laboratory of Pervasve Computng (Tsnghua Unversty), Mnstry of Educaton Bejng 100084, P.R.Chna {jaja}@mals.tsnghua.edu.cn
More informationFitting & 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 informationIEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. *, NO. *, Dictionary Pair Learning on Grassmann Manifolds for Image Denoising
IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. *, NO. *, 2015 1 Dctonary Par Learnng on Grassmann Manfolds for Image Denosng Xanhua Zeng, We Ban, We Lu, Jale Shen, Dacheng Tao, Fellow, IEEE Abstract Image
More informationIEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 1. SSDH: Semi-supervised Deep Hashing for Large Scale Image Retrieval
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY SSDH: Sem-supervsed Deep Hashng for Large Scale Image Retreval Jan Zhang, and Yuxn Peng arxv:607.08477v2 [cs.cv] 8 Jun 207 Abstract Hashng
More informationFace 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 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 informationOutline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1
4/14/011 Outlne Dscrmnatve classfers for mage recognton Wednesday, Aprl 13 Krsten Grauman UT-Austn Last tme: wndow-based generc obect detecton basc ppelne face detecton wth boostng as case study Today:
More informationThe Research of Support Vector Machine in Agricultural Data Classification
The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou
More informationPalmprint Feature Extraction Using 2-D Gabor Filters
Palmprnt Feature Extracton Usng 2-D Gabor Flters Wa Kn Kong Davd Zhang and Wenxn L Bometrcs Research Centre Department of Computng The Hong Kong Polytechnc Unversty Kowloon Hong Kong Correspondng author:
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 informationOverlapping Clustering with Sparseness Constraints
2012 IEEE 12th Internatonal Conference on Data Mnng Workshops Overlappng Clusterng wth Sparseness Constrants Habng Lu OMIS, Santa Clara Unversty hlu@scu.edu Yuan Hong MSIS, Rutgers Unversty yhong@cmc.rutgers.edu
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 informationTitle: A Novel Protocol for Accuracy Assessment in Classification of Very High Resolution Images
2009 IEEE. Personal use of ths materal s permtted. Permsson from IEEE must be obtaned for all other uses, n any current or future meda, ncludng reprntng/republshng ths materal for advertsng or promotonal
More informationICA Denoising for Event-Related fmri Studies
Proceedngs of the 005 IEEE Engneerng n Medcne and Bology 7th Annual Conference Shangha, Chna, September -4, 005 ICA Denosng for Event-Related fmri Studes Martn J. McKeown -3, Yong-e Hu, and Z. Jane Wang
More informationFusion Performance Model for Distributed Tracking and Classification
Fuson Performance Model for Dstrbuted rackng and Classfcaton K.C. Chang and Yng Song Dept. of SEOR, School of I&E George Mason Unversty FAIRFAX, VA kchang@gmu.edu Martn Lggns Verdan Systems Dvson, Inc.
More information