Cluster-Based Cumulative Ensembles
|
|
- Scott Wood
- 5 years ago
- Views:
Transcription
1 Cluster-Based Cumulative Ensembles Hanan G. Ayad and Mohamed S. Kamel Pattern Analysis and Mahine Intelligene Lab, Eletrial and Computer Engineering, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada {hanan, Abstrat. In this paper, we propose a luster-based umulative representation for luster ensembles. Cluster labels are mapped to inrementally aumulated lusters, and a mathing riterion based on maximum similarity is used. The ensemble method is investigated with bootstrap re-sampling, where the k-means algorithm is used to generate high granularity lusterings. For ombining, group average hierarhial metalustering is applied and the Jaard measure is used for luster similarity omputation. Patterns are assigned to ombined meta-lusters based on estimated luster assignment probabilities. The luster-based umulative ensembles are more ompat than o-assoiation-based ensembles. Experimental results on artifiial and real data show redution of the aross varying ensemble parameters and luster strutures. 1 Introdution Motivated by the advanes in lassifier ensembles, whih ombine the preditions of multiple lassifiers; luster ensembles that ombine multiple data partitionings have started to gain an inreasing interest [1 8]. Cluster ensembles an be illustrated by the shemati model in Figure 1. The model inludes two main elements, the ensemble generation and the ombination sheme. The ensemble generation takes as input a dataset of d-dimensional pattern vetors represented by an N d matrix X = {x (i) } N i=1, where N is the number of patterns and the row vetor x (i) represents the ith pattern. The ensemble generation generates multiple lusterings, represented here by luster label vetors {y (b) } B b=1. The ombining sheme (or the onsensus funtion [1]), an be thought of as omprising two sub-elements. The first is the ensemble mapping whih defines a representation Z of the ensemble outputs and an assoiated mapping method. The lak of diret orrespondene between the labels generated by the individual lusterings leads to the need for this mapping omponent. For instane, the o-assoiation (or o-ourrene) matrix [2] is an example of a representation generated by an ensemble mapping that side-steps the label orrespondene problem, at a omputational ost of O(N 2 ). The maximum likelihood mapping [8] is another example of ensemble mapping in whih the re-labelling problem is formulated as a weighted bipartite mathing problem and is solved
2 2 H. G. Ayad and M. S. Kamel using the Hungarian method [9] with a omputational ost of O(k 3 ) where k is the number of lusters. Combination Sheme (1) y Input dataset X Ensemble Generation (2) y Ensemble Mapping Z Combining Algorithm Estimated luster labels (ombined lustering) ŷ pˆ (B) y Estimated probabilities (ombined lustering) Fig.1. Shemati model of luster ensembles The seond sub-element of a ombining sheme is the ombining algorithm whih uses Z to generate the ombined lustering ŷ. A potential derivative of the luster ensemble is the estimation of the probabilities ˆp with whih data points belong to the ombined lusters. The ombining algorithm often lends itself to a lustering problem, where the data is given by the new representation Z. It is noted that if the label orrespondene problem is resolved and the number of lusters in the base lusterings {y (i) } B i=1 is the same as the number of lusters k in the ombined lustering ŷ, majority voting [6] or maximum likelihood lassifiation [8] an be readily applied. However, if k, o-assoiation-based onsensus funtions are often applied [2 4]. While allowing arbitrary luster strutures to be disovered, o-assoiation-based onsensus funtions are omputationally expensive and hene not pratial for large datasets. Re-sampling methods are well established approahes for estimating improved data statistis [1]. In partiular, bagging [11] has been introdued in regression and lassifiation. In bagging, the training dataset of size N is perturbed using bootstrap re-sampling to generate learning datasets by randomly sampling N patterns with replaement. This yields dupliate patterns in a bootstrap dataset. The bootstrap re-sampling proess is independently repeated B times and the B datasets are treated as independent learning sets. Dudoit and Fridlyand [6] used bagging with the Partitioning Around Medoids (PAM) lustering method to improve the auray of lustering. They use two methods for ombining multiple partitions. The first applies voting and the seond reates a new dissimilarity matrix similar to the o-assoiation matrix used in [2]. In the voting method, the same number of lusters is used for lustering and ombining, and the input dataset is lustered one to reate a referene lustering. The luster labels of eah bootstrap repliation are permuted suh that they fit best to the referene lustering. They reported that the bagged lustering were generally as aurate and often signifiantly more aurate than
3 Cluster-Based Cumulative Ensembles 3 a single lustering. Fisher and Buhmann [8] applied bagging to improve the quality of the path-based lustering method. They ritiqued the use of a referene lustering in the mapping method of Dudoit and Fridlyand [6], arguing that it imposes undesirable influene. Instead, they seleted a re-labelling out of all k! permutations for a lustering, suh that it maximizes the sum over the empirial luster assignment probabilities estimated from previous mappings, over all objets of the new mapping onfiguration. The problem of finding the best permutation is formulated as a weighted bipartite mathing problem and the Hungarian method is used to solve a maximum bipartite mathing problem. They reported that bagging inreases the reliability of the results and provides a measure of unertainty of the luster assignment. Again, in this method, the number of lusters used in the ensemble is the same as the number of ombined lusters. Minaei, Tophy and Punh [7] empirially investigated the effetiveness of bootstrapping with several onsensus funtions by examining the auray of the ombined lustering for varied resolution of partitions (i.e., number of lusters) and ensemble size. They report that lustering of bootstrapping leads to improved onsensus lustering of the data. They further onlude that the the best onsensus funtion remains an open question, as different onsensus funtions seem to suit different luster strutures. In this paper, we propose an ensemble mapping representation based on the generated lusters, as high-level data granules. Re-labelling of lusters is based on maximizing individual luster similarity to inrementally-aumulated lusters. Based on this representation, different ombining algorithms an be used suh as hierarhial lustering algorithms, for instane. Here, group average (i.e. average link) hierarhial meta-lustering is applied. We experimentally investigate the effetiveness of the proposed onsensus funtion, with bootstrap re-sampling, and the k-means as the underlying lustering algorithm. 2 Cluster-Based Cumulative Ensemble 2.1 Ensemble Mapping The ensemble representation onsists of a umulative N matrix Z summarising the ensemble outputs, where is a given number of lusters that is used in generating multiple lusterings, suh that k N where k is the number of ombined lusters. The data values in Z reflet the frequeny of ourrene of eah pattern in eah of the aumulated lusters. The k-means algorithm with the Eulidean distane is used to generate a lustering y (b) = π(x (b), ) of a bootstrapped learning set in {X (b) } B b=1, where B is the size of the ensemble, and y (b) is an N-dimensional labeling vetor. That is, π is a mapping funtion π : X (b) {,,}, where label is assigned to patterns that didn t appear in the bootstrap learning set X (b). Eah instane of the N matrix, denoted by Z (b), is inrementally updated from the ensemble {y (b) } B b=1 as follows. 1. Z (1) is initialized using y (1), as given below. Re-labelling and aumulation start by proessing lustering y (2).
4 4 H. G. Ayad and M. S. Kamel { z (1) 1 if objet j is in luster i aording to lustering y (1) ij = otherwise 2. Let eah luster in a given lustering y (b+1) be represented by a binary N- dimensional vetor v with 1 s in entries orresponding to the luster members and s otherwise. Let eah luster extrated from the rows z (b) i of Z (b) be represented by the binary N-dimensional vetor w whose entries are 1 s for non-zero olumns of z (b) i and s otherwise. Compute the similarity between eah pair of vetors v and w using the Jaard measure given as J(v,w) = vw/( v 2 + w 2 vw) 3. Map eah luster label i {1,, } in lustering y (b+1) to its most similar luster labelled j {1,, } of the previously aumulated lusters represented by the rows of Z (b). Hene, inrement the entries of row j of Z (b) orresponding to members of the luster labelled i in lustering y (b+1). 4. Z (b+1) Z (b). The mapping proess is repeated until Z (B) is omputed. The umulative luster-based mapping of the ensemble ulminates in the matrix Z = Z (B), as a voting struture that summarises the ensemble. While in the maximum likelihood mapping [8], the best luster label permutation is found and = k is used, in this paper, eah luster is re-labelled to math its most similar luster from the aumulated lusters. This is done for the following reasons. First, sine the base lusterings represent high resolution partitions of non-idential bootstrap learning sets, this leads to highly diverse lusterings, suh that finding the best permutation beomes less meaningful. For quantitative measures of diversity in luster ensembles, the reader is referred to [5]. Seond, sine the aumulated lusters will be merged in a later stage by the ombining algorithm, we are most onerned at this stage in a mapping whih maximizes the similarities and hene minimizes the variane of the mapped lusters. We found that this mathing method an oasionally result in a umulative luster to beome singled out when no subsequently added lusters are mapped to it. If a hierarhial lustering algorithm is used, this problem an lead to a degenerate dendrogram and empty luster(s) in the ombined lustering. Therefore, we detet this ondition, and the orresponding solution is disarded. Usually, a good solution is reahed in a few iterations. An alternative remedy is to math eah of the umulative lusters to its most similar luster from eah subsequently mapped lustering, instead of the reverse way. This ensures that the above mentioned ondition does not our, but it an introdue influene from earlier lusterings and less inorporation of the diversity in the ensemble. An advantage of this representation is that it allows several alternative views (interpretations) to be onsidered by the ombining algorithm. For instane, Z may be treated as a pattern matrix. This allows different distane/similarity measures and ombining algorithms to be applied to generate the ombined lustering. Alternatively, Z may be treated as the joint probability distribution of two disrete random variables indexing the rows and olumns of Z. This allows for information theoreti formulations for finding of the ombined lusters.
5 Cluster-Based Cumulative Ensembles 5 Furthermore, the size of this representation is N versus N 2 for the oassoiation-based representation, where N. While, in the ase of the oassoiation matrix, the hierarhial lustering algorithm runs on the N N matrix, in the ase of the luster-based umulative representation, it runs on a distane matrix omputed from the N matrix Z. 2.2 Combining Using Hierarhial Group Average Meta-lustering Motivated by what is believed to be a reasonable disriminating strategy based on the average of a hosen distane measure between lusters, the proposed algorithm is the group average hierarhial lustering. The ombining algorithm starts by omputing the distanes between the rows of Z (i.e. the umulative lusters). This is a total of ( 2) distanes, and one minus the binary Jaard measure, given in Setion 2.1, is used to ompute the distanes. The group-average hierarhial lustering is used to luster the lusters, hene the name metalustering. In this algorithm, the distane between a pair of lusters d(c 1, C 2 ) is defined as the average distane between the objets in eah luster, where the objets in this ase are the umulative lusters. It is omputed as follows, d(c 1, C 2 ) = mean (z1,z 2) C 1 C 2 d(z 1,z 2 ), where d(z 1,z 2 ) = 1 J(z 1,z 2 ) The dendrogram is ut to generate k meta-lusters {M j } k j=1 representing a partitioning of the umulative lusters {z i } i=1. The merged lusters are averaged in a k N matrix M = {m ji } for j {1,,k} and i {1,,N}. So far, only the binary version of the umulative matrix has been used for distane omputations. Now, in determining the final lustering, the frequeny values aumulated in Z are averaged in the meta-luster matrix M and used to ompute the luster assignment probabilities. Then, eah objet is assigned to its most likely meta-luster. Let M be a random variable indexing the meta-lusters and taking values in {1,,k}, let X be a random variable indexing the patterns and taking values in {1,,N}, and let ˆp(M = j X = i) be the onditional probability of eah of the k meta-lusters, given an objet i, whih we also write as p(m j x i ). Here, we use x i to denote the objet index of the pattern x (i), and we use M j to denote a meta-luster represented by the row j in M. The probability estimates ˆp(M j x i ) are omputed as ˆp(M j x i ) = mji. 3 Experimental Analysis k m li l=1 Performane is evaluated based on the s whih are omputed by solving the orrespondene problem between the labels of a lustering solution and the true lustering using the Hungarian method. 3.1 Experiments with Artifiial Data The artifiial datasets are shown in Figure 2. The first, alled Elongatedellipses onsists of 1 2D points in 2 equal lusters. The Cresents dataset
6 6 H. G. Ayad and M. S. Kamel onsists of 1 2D points in 2 equal lusters. The Differing-ellipses onsists of 25 2D points in 2 lusters of sizes 5 and 2. The dataset alled 8D5K was generated and used in [1]. It onsists of 1 points from 8D Gaussian distributions (2 points eah). For visualization, the 8D5K data is projeted onto the first two prinipal omponents. 6 Elongated ellipses dataset 2 Cresents dataset X 2 X X X 1 6 Differing ellipses dataset 1 8D5K dataset 5.5 X PC X PC 1 Fig. 2. Satter plots of the artifiial datasets. The last 8 dimensional dataset is projeted on the first 2 prinipal omponents For eah dataset, we use B = 1, and vary. We measure the of the orresponding bagged ensemble at the true number of lusters k and ompare it to the k-means at the same k. The results in Figure 3 show that the proposed bagging ensemble signifiantly lowers the for varied luster strutures. In order to illustrate the luster-based umulative ensemble, we show in Figure 4 (a) a plot of the points frequenies in eah of the aumulated lusters at = 4 for the elongated-ellipses dataset. The points are ordered suh that the first 5 points belong to the first luster followed by 5 from the seond luster. The dendrogram orresponding to the hierarhial group average meta-lustering on the 4 umulative lusters is shown in Figure 4 (b). 3.2 Experiments with Real Data We use six datasets from the UCI mahine learning repository. Sine the Eulidean distane is not sale invariant, we standardize the features for those datasets in whih the sales widely vary for the different features. The datasets used are, (1) the iris plant dataset, (2) the wine reognition dataset, (3) the Wisonsin
7 Cluster-Based Cumulative Ensembles 7.25 Elongated ellipses dataset.35.3 Cresents dataset Differing ellipses dataset Ensemble K means D5K dataset Fig. 3. Error rates for artifiial datasets using the bagged luster ensembles and the k-means algorithm at given k Points freq in C1 Points freq in C2 Frequeny Frequeny Points labels X Points freq in C3 Frequeny Frequeny Points labels X Points freq in C4 Height Cluster Dendrogram Points labels X (a) Points labels X lusters aggregation hlust (*, "average") (b) Fig.4. (a) Aumulated lusters. (b) Generated dendrogram.
8 8 H. G. Ayad and M. S. Kamel breast aner dataset, (4) the Wisonsin diagnosti breast aner (WDBC), (5) a random sample of size 5 from the optial reognition of handwritten digits dataset, and (6) a random sample of size 5 from the pen-based reognition of handwritten digits dataset. We standardized the features for the wine reognition and the WDBC datasets. The mean s of the k-means (over 1 runs), at the true k, for the above datasets are,.27,.378,.395,.923,.288,.3298, respetively..8 Iris Plant luster-based - alink pattern-based - alink pattern-based - slink pattern-based.8 - link Wine Breast Caner Optial digits WDBC Pen-based digits Fig. 5. Error rates on the real datasets for the proposed ensemble versus oassoiations-based ensembles using single, omplete and average link. Figure 5 shows a omparison of the luster-based umulative ensembles with hierarhial group average (denoted in Figure 5 by luster-based alink) to pattern o-assoiation-based ensembles, when single, omplete and average link variants of the hierarhial lustering are applied (denoted by pattern-based slink, link, and alink, respetively). In the experiments, we use B = 1 and k orresponding to the true number of lusters. The results show that the luster-based alink ensembles perform ompetitively well ompared to pattern-based alink ensembles. On the other hand, the o-assoiation-based single and omplete link ensembles showed poor performane.
9 Cluster-Based Cumulative Ensembles 9 mean µ e Iris Plant =3 =5 =7 =9 =11 mean µ e Wine =4 =6 =8 =1 = B B mean µ e Cresents =4 =6 =8 =9 =1 mean µ e Differing-ellipses =4 =6 =8 =1 = B B Fig.6. Effet of ensemble size B. The X-axis is log sale. 3.3 Varying The Ensemble Size We study the effet of the ensemble size B, for values of B 1. Figure 6 shows the mean s on real and artifiial datasets for B = 5, 1, 25, 5, and 1, and for varying number of base lusters. Eah ensemble at a given and B is repeated r = 5 times and the mean is omputed. There is a general trend of redution in s as B inreases. However, we observe that most gain in auray ours for B = 25, and 5. We also observe that the differenes between the s of ensembles of varying values of tend to derease as B inreases, i.e., the variability of the s orresponding to different values of is redued when B is inreased. However, in some ases, it is noted that that amount of redution in the error depends on. For instane, this an be observed for = 4 in the resents and differing-ellipses datasets. 4 Conlusion The proposed luster-based umulative representation is more ompat than the o-assoiation matrix. Experimental results on artifiial datasets emphasised the potential of the proposed ensemble method in substantially lowering the error rate, and in finding arbitrary luster strutures. For the real datasets, the
10 1 H. G. Ayad and M. S. Kamel luster-based umulative ensembles, using group average hierarhial lustering, signifiantly outperformed o-assoiation-based ensembles, using the single and omplete link algorithms. They showed ompetitive performane ompared to o-assoiation-based ensembles, using the group average algorithm. In [12], the group average algorithm is shown to approximately minimize the maximum luster variane. Suh model seems to represent a better fit to the data summarised in Z. A further potential benefit of this paper is that o-assoiation-based onsensus funtions other than hierarhial methods, suh as [3, 4], an also be adapted to the luster-based umulative representation, rendering them more effiient. This will be investigated in future work. Aknowledgments This work was partially funded by an NSERC strategi grant. Referenes 1. A. Strehl and J. Ghosh. Cluster ensembles - a knowledge reuse framework for ombining multiple partitions. Journal on Mahine Learning Researh (JMLR), 3: , Deember A. Fred and A.K. Jain. Data lustering using evidene aumulation. In Proeedings of the 16th International Conferene on Pattern Reognition. ICPR 22, volume 4, pages , Quebe City, Quebe, Canada, August H. Ayad and M. Kamel. Finding natural lusters using multi-lusterer ombiner based on shared nearest neighbors. In Multiple Classifier Systems: Fourth International Workshop, MCS 23, UK, Proeedings., pages , H. Ayad, O. Basir, and M. Kamel. A probabilisti model using information theoreti measures for luster ensembles. In Multiple Classifier Systems: Fifth International Workshop, MCS 24, Cagliari, Italy, Proeedings, pages , L. I. Kunheva and S.T. Hadjitodorov. Using diversity in luster ensembles. In IEEE International Conferene on Systems, Man and Cybernetis, Proeedings, The Hague, The Netherlands., S. Dudoit and J. Fridlyand. Bagging to improve the auray of a lustering proedure. Bioinformatis, 19(9):19 199, B. Minaei, A. Tophy, and W. Punh. Ensembles of partitions via data resampling. In Intl. Conf. on Information Tehnology: Coding and Computing, ITCC4, Proeedings, Las Vegas, April B. Fisher and J.M. Buhmann. Bagging for path-based lustering. IEEE Transations on Pattern Analysis and Mahine Intelligene, 25(11): , H. Kuhn. The hungarian method for the assignment problem. Naval Researh Logisti Quarterly, 2:83 97, R.O. Duda, P.E. Hart, and D.G. Stork. Pattern Classifiation. John Wiley & Sons, Leo Breiman. Bagging preditors. Mahine Learning, 26(2):123 14, S. Kamvar, D. Klein, and C. Manning. Interpreting and extending lassial agglomerative lustering algorithms using a model-based approah. In Proeedings of the 19th Int. Conf. Mahine Learning, pages , 22.
the data. Structured Principal Component Analysis (SPCA)
Strutured Prinipal Component Analysis Kristin M. Branson and Sameer Agarwal Department of Computer Siene and Engineering University of California, San Diego La Jolla, CA 9193-114 Abstrat Many tasks involving
More informationA Novel Validity Index for Determination of the Optimal Number of Clusters
IEICE TRANS. INF. & SYST., VOL.E84 D, NO.2 FEBRUARY 2001 281 LETTER A Novel Validity Index for Determination of the Optimal Number of Clusters Do-Jong KIM, Yong-Woon PARK, and Dong-Jo PARK, Nonmembers
More informationLearning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract
CS 9 Projet Final Report: Learning Convention Propagation in BeerAdvoate Reviews from a etwork Perspetive Abstrat We look at the way onventions propagate between reviews on the BeerAdvoate dataset, and
More informationThe Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines
The Minimum Redundany Maximum Relevane Approah to Building Sparse Support Vetor Mahines Xiaoxing Yang, Ke Tang, and Xin Yao, Nature Inspired Computation and Appliations Laboratory (NICAL), Shool of Computer
More informationarxiv: v1 [cs.db] 13 Sep 2017
An effiient lustering algorithm from the measure of loal Gaussian distribution Yuan-Yen Tai (Dated: May 27, 2018) In this paper, I will introdue a fast and novel lustering algorithm based on Gaussian distribution
More informationA Coarse-to-Fine Classification Scheme for Facial Expression Recognition
A Coarse-to-Fine Classifiation Sheme for Faial Expression Reognition Xiaoyi Feng 1,, Abdenour Hadid 1 and Matti Pietikäinen 1 1 Mahine Vision Group Infoteh Oulu and Dept. of Eletrial and Information Engineering
More informationBoosted Random Forest
Boosted Random Forest Yohei Mishina, Masamitsu suhiya and Hironobu Fujiyoshi Department of Computer Siene, Chubu University, 1200 Matsumoto-ho, Kasugai, Aihi, Japan {mishi, mtdoll}@vision.s.hubu.a.jp,
More informationAbstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1.
Fuzzy Weighted Rank Ordered Mean (FWROM) Filters for Mixed Noise Suppression from Images S. Meher, G. Panda, B. Majhi 3, M.R. Meher 4,,4 Department of Eletronis and I.E., National Institute of Tehnology,
More informationPipelined Multipliers for Reconfigurable Hardware
Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,
More informationA New RBFNDDA-KNN Network and Its Application to Medical Pattern Classification
A New RBFNDDA-KNN Network and Its Appliation to Medial Pattern Classifiation Shing Chiang Tan 1*, Chee Peng Lim 2, Robert F. Harrison 3, R. Lee Kennedy 4 1 Faulty of Information Siene and Tehnology, Multimedia
More informationAn Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index
IJCSES International Journal of Computer Sienes and Engineering Systems, ol., No.4, Otober 2007 CSES International 2007 ISSN 0973-4406 253 An Optimized Approah on Applying Geneti Algorithm to Adaptive
More informationRotation Invariant Spherical Harmonic Representation of 3D Shape Descriptors
Eurographis Symposium on Geometry Proessing (003) L. Kobbelt, P. Shröder, H. Hoppe (Editors) Rotation Invariant Spherial Harmoni Representation of 3D Shape Desriptors Mihael Kazhdan, Thomas Funkhouser,
More informationGradient based progressive probabilistic Hough transform
Gradient based progressive probabilisti Hough transform C.Galambos, J.Kittler and J.Matas Abstrat: The authors look at the benefits of exploiting gradient information to enhane the progressive probabilisti
More informationEvolutionary Feature Synthesis for Image Databases
Evolutionary Feature Synthesis for Image Databases Anlei Dong, Bir Bhanu, Yingqiang Lin Center for Researh in Intelligent Systems University of California, Riverside, California 92521, USA {adong, bhanu,
More informationExtracting Partition Statistics from Semistructured Data
Extrating Partition Statistis from Semistrutured Data John N. Wilson Rihard Gourlay Robert Japp Mathias Neumüller Department of Computer and Information Sienes University of Strathlyde, Glasgow, UK {jnw,rsg,rpj,mathias}@is.strath.a.uk
More informationOne Against One or One Against All : Which One is Better for Handwriting Recognition with SVMs?
One Against One or One Against All : Whih One is Better for Handwriting Reognition with SVMs? Jonathan Milgram, Mohamed Cheriet, Robert Sabourin To ite this version: Jonathan Milgram, Mohamed Cheriet,
More informationNew Fuzzy Object Segmentation Algorithm for Video Sequences *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 521-537 (2008) New Fuzzy Obet Segmentation Algorithm for Video Sequenes * KUO-LIANG CHUNG, SHIH-WEI YU, HSUEH-JU YEH, YONG-HUAI HUANG AND TA-JEN YAO Department
More informationCapturing Large Intra-class Variations of Biometric Data by Template Co-updating
Capturing Large Intra-lass Variations of Biometri Data by Template Co-updating Ajita Rattani University of Cagliari Piazza d'armi, Cagliari, Italy ajita.rattani@diee.unia.it Gian Lua Marialis University
More informationOn - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2
On - Line Path Delay Fault Testing of Omega MINs M. Bellos, E. Kalligeros, D. Nikolos,2 & H. T. Vergos,2 Dept. of Computer Engineering and Informatis 2 Computer Tehnology Institute University of Patras,
More informationDetection and Recognition of Non-Occluded Objects using Signature Map
6th WSEAS International Conferene on CIRCUITS, SYSTEMS, ELECTRONICS,CONTROL & SIGNAL PROCESSING, Cairo, Egypt, De 9-31, 007 65 Detetion and Reognition of Non-Oluded Objets using Signature Map Sangbum Park,
More informationNONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION. Ken Sauer and Charles A. Bouman
NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION Ken Sauer and Charles A. Bouman Department of Eletrial Engineering, University of Notre Dame Notre Dame, IN 46556, (219) 631-6999 Shool of
More informationWeak Dependence on Initialization in Mixture of Linear Regressions
Proeedings of the International MultiConferene of Engineers and Computer Sientists 8 Vol I IMECS 8, Marh -6, 8, Hong Kong Weak Dependene on Initialization in Mixture of Linear Regressions Ryohei Nakano
More informationFUZZY WATERSHED FOR IMAGE SEGMENTATION
FUZZY WATERSHED FOR IMAGE SEGMENTATION Ramón Moreno, Manuel Graña Computational Intelligene Group, Universidad del País Vaso, Spain http://www.ehu.es/winto; {ramon.moreno,manuel.grana}@ehu.es Abstrat The
More informationUsing Augmented Measurements to Improve the Convergence of ICP
Using Augmented Measurements to Improve the onvergene of IP Jaopo Serafin, Giorgio Grisetti Dept. of omputer, ontrol and Management Engineering, Sapienza University of Rome, Via Ariosto 25, I-0085, Rome,
More informationImproved Vehicle Classification in Long Traffic Video by Cooperating Tracker and Classifier Modules
Improved Vehile Classifiation in Long Traffi Video by Cooperating Traker and Classifier Modules Brendan Morris and Mohan Trivedi University of California, San Diego San Diego, CA 92093 {b1morris, trivedi}@usd.edu
More informationTUMOR DETECTION IN MRI BRAIN IMAGE SEGMENTATION USING PHASE CONGRUENCY MODIFIED FUZZY C MEAN ALGORITHM
TUMOR DETECTION IN MRI BRAIN IMAGE SEGMENTATION USING PHASE CONGRUENCY MODIFIED FUZZY C MEAN ALGORITHM M. Murugeswari 1, M.Gayathri 2 1 Assoiate Professor, 2 PG Sholar 1,2 K.L.N College of Information
More informationSelf-Adaptive Parent to Mean-Centric Recombination for Real-Parameter Optimization
Self-Adaptive Parent to Mean-Centri Reombination for Real-Parameter Optimization Kalyanmoy Deb and Himanshu Jain Department of Mehanial Engineering Indian Institute of Tehnology Kanpur Kanpur, PIN 86 {deb,hjain}@iitk.a.in
More informationA Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks
A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks Abouberine Ould Cheikhna Department of Computer Siene University of Piardie Jules Verne 80039 Amiens Frane Ould.heikhna.abouberine @u-piardie.fr
More information3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT?
3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT? Bernd Girod, Peter Eisert, Marus Magnor, Ekehard Steinbah, Thomas Wiegand Te {girod eommuniations Laboratory, University of Erlangen-Nuremberg
More informationA Novel Bit Level Time Series Representation with Implication of Similarity Search and Clustering
A Novel Bit Level Time Series Representation with Impliation of Similarity Searh and lustering hotirat Ratanamahatana, Eamonn Keogh, Anthony J. Bagnall 2, and Stefano Lonardi Dept. of omputer Siene & Engineering,
More information2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media,
2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any urrent or future media, inluding reprinting/republishing this material for advertising
More informationGraph-Based vs Depth-Based Data Representation for Multiview Images
Graph-Based vs Depth-Based Data Representation for Multiview Images Thomas Maugey, Antonio Ortega, Pasal Frossard Signal Proessing Laboratory (LTS), Eole Polytehnique Fédérale de Lausanne (EPFL) Email:
More informationCluster Centric Fuzzy Modeling
10.1109/TFUZZ.014.300134, IEEE Transations on Fuzzy Systems TFS-013-0379.R1 1 Cluster Centri Fuzzy Modeling Witold Pedryz, Fellow, IEEE, and Hesam Izakian, Student Member, IEEE Abstrat In this study, we
More informationTime delay estimation of reverberant meeting speech: on the use of multichannel linear prediction
University of Wollongong Researh Online Faulty of Informatis - apers (Arhive) Faulty of Engineering and Information Sienes 7 Time delay estimation of reverberant meeting speeh: on the use of multihannel
More informationPlot-to-track correlation in A-SMGCS using the target images from a Surface Movement Radar
Plot-to-trak orrelation in A-SMGCS using the target images from a Surfae Movement Radar G. Golino Radar & ehnology Division AMS, Italy ggolino@amsjv.it Abstrat he main topi of this paper is the formulation
More informationA {k, n}-secret Sharing Scheme for Color Images
A {k, n}-seret Sharing Sheme for Color Images Rastislav Luka, Konstantinos N. Plataniotis, and Anastasios N. Venetsanopoulos The Edward S. Rogers Sr. Dept. of Eletrial and Computer Engineering, University
More informationNaïve Bayesian Rough Sets Under Fuzziness
IJMSA: Vol. 6, No. 1-2, January-June 2012, pp. 19 25 Serials Publiations ISSN: 0973-6786 Naïve ayesian Rough Sets Under Fuzziness G. GANSAN 1,. KRISHNAVNI 2 T. HYMAVATHI 3 1,2,3 Department of Mathematis,
More informationAn Efficient and Scalable Approach to CNN Queries in a Road Network
An Effiient and Salable Approah to CNN Queries in a Road Network Hyung-Ju Cho Chin-Wan Chung Dept. of Eletrial Engineering & Computer Siene Korea Advaned Institute of Siene and Tehnology 373- Kusong-dong,
More informationUnsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks
Unsupervised Stereosopi Video Objet Segmentation Based on Ative Contours and Retrainable Neural Networks KLIMIS NTALIANIS, ANASTASIOS DOULAMIS, and NIKOLAOS DOULAMIS National Tehnial University of Athens
More informationSimulation of Crystallographic Texture and Anisotropie of Polycrystals during Metal Forming with Respect to Scaling Aspects
Raabe, Roters, Wang Simulation of Crystallographi Texture and Anisotropie of Polyrystals during Metal Forming with Respet to Saling Aspets D. Raabe, F. Roters, Y. Wang Max-Plank-Institut für Eisenforshung,
More informationA Descriptive Framework for the Multidimensional Medical Data Mining and Representation
Journal of Computer Siene 7 (4): 519-55, 011 ISSN 1549-3636 011 Siene Publiations A Desriptive Framework for the Multidimensional Medial Data Mining and Representation Veeramalai Sankaradass and Kannan
More informationA scheme for racquet sports video analysis with the combination of audio-visual information
A sheme for raquet sports video analysis with the ombination of audio-visual information Liyuan Xing a*, Qixiang Ye b, Weigang Zhang, Qingming Huang a and Hua Yu a a Graduate Shool of the Chinese Aadamy
More informationDetecting Outliers in High-Dimensional Datasets with Mixed Attributes
Deteting Outliers in High-Dimensional Datasets with Mixed Attributes A. Koufakou, M. Georgiopoulos, and G.C. Anagnostopoulos 2 Shool of EECS, University of Central Florida, Orlando, FL, USA 2 Dept. of
More informationSemi-Supervised Affinity Propagation with Instance-Level Constraints
Semi-Supervised Affinity Propagation with Instane-Level Constraints Inmar E. Givoni, Brendan J. Frey Probabilisti and Statistial Inferene Group University of Toronto 10 King s College Road, Toronto, Ontario,
More informationPerformance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application
World Aademy of Siene, Engineering and Tehnology 8 009 Performane of Histogram-Based Skin Colour Segmentation for Arms Detetion in Human Motion Analysis Appliation Rosalyn R. Porle, Ali Chekima, Farrah
More informationAn Alternative Approach to the Fuzzifier in Fuzzy Clustering to Obtain Better Clustering Results
An Alternative Approah to the Fuzziier in Fuzzy Clustering to Obtain Better Clustering Results Frank Klawonn Department o Computer Siene University o Applied Sienes BS/WF Salzdahlumer Str. 46/48 D-38302
More informationDiscrete sequential models and CRFs. 1 Case Study: Supervised Part-of-Speech Tagging
0-708: Probabilisti Graphial Models 0-708, Spring 204 Disrete sequential models and CRFs Leturer: Eri P. Xing Sribes: Pankesh Bamotra, Xuanhong Li Case Study: Supervised Part-of-Speeh Tagging The supervised
More informationExploiting Enriched Contextual Information for Mobile App Classification
Exploiting Enrihed Contextual Information for Mobile App Classifiation Hengshu Zhu 1 Huanhuan Cao 2 Enhong Chen 1 Hui Xiong 3 Jilei Tian 2 1 University of Siene and Tehnology of China 2 Nokia Researh Center
More informationModel Based Approach for Content Based Image Retrievals Based on Fusion and Relevancy Methodology
The International Arab Journal of Information Tehnology, Vol. 12, No. 6, November 15 519 Model Based Approah for Content Based Image Retrievals Based on Fusion and Relevany Methodology Telu Venkata Madhusudhanarao
More informationMeasurement of the stereoscopic rangefinder beam angular velocity using the digital image processing method
Measurement of the stereosopi rangefinder beam angular veloity using the digital image proessing method ROMAN VÍTEK Department of weapons and ammunition University of defense Kouniova 65, 62 Brno CZECH
More informationExploring the Commonality in Feature Modeling Notations
Exploring the Commonality in Feature Modeling Notations Miloslav ŠÍPKA Slovak University of Tehnology Faulty of Informatis and Information Tehnologies Ilkovičova 3, 842 16 Bratislava, Slovakia miloslav.sipka@gmail.om
More informationFace and Facial Feature Tracking for Natural Human-Computer Interface
Fae and Faial Feature Traking for Natural Human-Computer Interfae Vladimir Vezhnevets Graphis & Media Laboratory, Dept. of Applied Mathematis and Computer Siene of Mosow State University Mosow, Russia
More informationIMPROVED FUZZY CLUSTERING METHOD BASED ON INTUITIONISTIC FUZZY PARTICLE SWARM OPTIMIZATION
Journal of Theoretial and Applied Information Tehnology IMPROVED FUZZY CLUSTERING METHOD BASED ON INTUITIONISTIC FUZZY PARTICLE SWARM OPTIMIZATION V.KUMUTHA, 2 S. PALANIAMMAL D.J. Aademy For Managerial
More informationMultiple-Criteria Decision Analysis: A Novel Rank Aggregation Method
3537 Multiple-Criteria Deision Analysis: A Novel Rank Aggregation Method Derya Yiltas-Kaplan Department of Computer Engineering, Istanbul University, 34320, Avilar, Istanbul, Turkey Email: dyiltas@ istanbul.edu.tr
More informationIncremental Mining of Partial Periodic Patterns in Time-series Databases
CERIAS Teh Report 2000-03 Inremental Mining of Partial Periodi Patterns in Time-series Dataases Mohamed G. Elfeky Center for Eduation and Researh in Information Assurane and Seurity Purdue University,
More informationHIGHER ORDER full-wave three-dimensional (3-D) large-domain techniques in
FACTA UNIVERSITATIS (NIŠ) SER.: ELEC. ENERG. vol. 21, no. 2, August 2008, 209-220 Comparison of Higher Order FEM and MoM/SIE Approahes in Analyses of Closed- and Open-Region Eletromagneti Problems Milan
More informationChemical, Biological and Radiological Hazard Assessment: A New Model of a Plume in a Complex Urban Environment
hemial, Biologial and Radiologial Haard Assessment: A New Model of a Plume in a omplex Urban Environment Skvortsov, A.T., P.D. Dawson, M.D. Roberts and R.M. Gailis HPP Division, Defene Siene and Tehnology
More informationHEXA: Compact Data Structures for Faster Packet Processing
Washington University in St. Louis Washington University Open Sholarship All Computer Siene and Engineering Researh Computer Siene and Engineering Report Number: 27-26 27 HEXA: Compat Data Strutures for
More informationMulti-modal Clustering for Multimedia Collections
Multi-modal Clustering for Multimedia Colletions Ron Bekkerman and Jiwoon Jeon Center for Intelligent Information Retrieval University of Massahusetts at Amherst, USA {ronb jeon}@s.umass.edu Abstrat Most
More informationFuzzy Meta Node Fuzzy Metagraph and its Cluster Analysis
Journal of Computer Siene 4 (): 9-97, 008 ISSN 549-3636 008 Siene Publiations Fuzzy Meta Node Fuzzy Metagraph and its Cluster Analysis Deepti Gaur, Aditya Shastri and Ranjit Biswas Department of Computer
More informationINTERPOLATED AND WARPED 2-D DIGITAL WAVEGUIDE MESH ALGORITHMS
Proeedings of the COST G-6 Conferene on Digital Audio Effets (DAFX-), Verona, Italy, Deember 7-9, INTERPOLATED AND WARPED -D DIGITAL WAVEGUIDE MESH ALGORITHMS Vesa Välimäki Lab. of Aoustis and Audio Signal
More informationMulti-hop Fast Conflict Resolution Algorithm for Ad Hoc Networks
Multi-hop Fast Conflit Resolution Algorithm for Ad Ho Networks Shengwei Wang 1, Jun Liu 2,*, Wei Cai 2, Minghao Yin 2, Lingyun Zhou 2, and Hui Hao 3 1 Power Emergeny Center, Sihuan Eletri Power Corporation,
More informationFast Rigid Motion Segmentation via Incrementally-Complex Local Models
Fast Rigid Motion Segmentation via Inrementally-Complex Loal Models Fernando Flores-Mangas Allan D. Jepson Department of Computer Siene, University of Toronto {mangas,jepson}@s.toronto.edu Abstrat The
More informationVideo Data and Sonar Data: Real World Data Fusion Example
14th International Conferene on Information Fusion Chiago, Illinois, USA, July 5-8, 2011 Video Data and Sonar Data: Real World Data Fusion Example David W. Krout Applied Physis Lab dkrout@apl.washington.edu
More informationAnalysis of input and output configurations for use in four-valued CCD programmable logic arrays
nalysis of input and output onfigurations for use in four-valued D programmable logi arrays J.T. utler H.G. Kerkhoff ndexing terms: Logi, iruit theory and design, harge-oupled devies bstrat: s in binary,
More informationAnd, the (low-pass) Butterworth filter of order m is given in the frequency domain by
Problem Set no.3.a) The ideal low-pass filter is given in the frequeny domain by B ideal ( f ), f f; =, f > f. () And, the (low-pass) Butterworth filter of order m is given in the frequeny domain by B
More informationCOST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY
COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY Dileep P, Bhondarkor Texas Instruments Inorporated Dallas, Texas ABSTRACT Charge oupled devies (CCD's) hove been mentioned as potential fast auxiliary
More informationFOREGROUND OBJECT EXTRACTION USING FUZZY C MEANS WITH BIT-PLANE SLICING AND OPTICAL FLOW
FOREGROUND OBJECT EXTRACTION USING FUZZY C EANS WITH BIT-PLANE SLICING AND OPTICAL FLOW SIVAGAI., REVATHI.T, JEGANATHAN.L 3 APSG, SCSE, VIT University, Chennai, India JRF, DST, Dehi, India. 3 Professor,
More informationFacility Location: Distributed Approximation
Faility Loation: Distributed Approximation Thomas Mosibroda Roger Wattenhofer Distributed Computing Group PODC 2005 Where to plae ahes in the Internet? A distributed appliation that has to dynamially plae
More informationTrajectory Tracking Control for A Wheeled Mobile Robot Using Fuzzy Logic Controller
Trajetory Traking Control for A Wheeled Mobile Robot Using Fuzzy Logi Controller K N FARESS 1 M T EL HAGRY 1 A A EL KOSY 2 1 Eletronis researh institute, Cairo, Egypt 2 Faulty of Engineering, Cairo University,
More informationTransition Detection Using Hilbert Transform and Texture Features
Amerian Journal of Signal Proessing 1, (): 35-4 DOI: 1.593/.asp.1.6 Transition Detetion Using Hilbert Transform and Texture Features G. G. Lashmi Priya *, S. Domni Department of Computer Appliations, National
More informationContour Box: Rejecting Object Proposals Without Explicit Closed Contours
Contour Box: Rejeting Objet Proposals Without Expliit Closed Contours Cewu Lu, Shu Liu Jiaya Jia Chi-Keung Tang The Hong Kong University of Siene and Tehnology Stanford University The Chinese University
More informationMicro-Batching Growing Neural Gas for Clustering Data Streams using Spark Streaming
Proedia Computer Siene Volume 53, 2015, Pages 158 166 2015 INNS Conferene on Big Data Miro-Bathing Growing Neural Gas for Clustering Data Streams using Spark Streaming Mohammed Ghesmoune, Mustapha Lebbah,
More informationDOMAIN ADAPTATION BY ITERATIVE IMPROVEMENT OF SOFT-LABELING AND MAXIMIZATION OF NON-PARAMETRIC MUTUAL INFORMATION. M.N.A. Khan, Douglas R.
DOMAIN ADAPTATION BY ITERATIVE IMPROVEMENT OF SOFT-LABELING AND MAXIMIZATION OF NON-PARAMETRIC MUTUAL INFORMATION M.N.A. Khan, Douglas R. Heisterkamp Department of Computer Siene Oklahoma State University,
More information特集 Road Border Recognition Using FIR Images and LIDAR Signal Processing
デンソーテクニカルレビュー Vol. 15 2010 特集 Road Border Reognition Using FIR Images and LIDAR Signal Proessing 高木聖和 バーゼル ファルディ Kiyokazu TAKAGI Basel Fardi ヘンドリック ヴァイゲル Hendrik Weigel ゲルド ヴァニーリック Gerd Wanielik This paper
More informationAccommodations of QoS DiffServ Over IP and MPLS Networks
Aommodations of QoS DiffServ Over IP and MPLS Networks Abdullah AlWehaibi, Anjali Agarwal, Mihael Kadoh and Ahmed ElHakeem Department of Eletrial and Computer Department de Genie Eletrique Engineering
More informationCleanUp: Improving Quadrilateral Finite Element Meshes
CleanUp: Improving Quadrilateral Finite Element Meshes Paul Kinney MD-10 ECC P.O. Box 203 Ford Motor Company Dearborn, MI. 8121 (313) 28-1228 pkinney@ford.om Abstrat: Unless an all quadrilateral (quad)
More informationIncomplete Multi-Modal Visual Data Grouping
Proeedings of the Twenty-ifth International Joint Conferene on Artifiial Intelligene (IJCAI-16) Inomplete Multi-Modal Visual Data Grouping Handong Zhao, Hongfu Liu and Yun u Department of Eletrial and
More informationSegmentation of brain MR image using fuzzy local Gaussian mixture model with bias field correction
IOSR Journal of VLSI and Signal Proessing (IOSR-JVSP) Volume 2, Issue 2 (Mar. Apr. 2013), PP 35-41 e-issn: 2319 4200, p-issn No. : 2319 4197 Segmentation of brain MR image using fuzzy loal Gaussian mixture
More informationContents Contents...I List of Tables...VIII List of Figures...IX 1. Introduction Information Retrieval... 8
Contents Contents...I List of Tables...VIII List of Figures...IX 1. Introdution... 1 1.1. Internet Information...2 1.2. Internet Information Retrieval...3 1.2.1. Doument Indexing...4 1.2.2. Doument Retrieval...4
More informationA Comprehensive Review of Overlapping Community Detection Algorithms for Social Networks
International Journal of Engineering Researh and Appliations (IJERA) ISSN: 2248-9622 National Conferene on Advanes in Engineering and Tehnology (AET- 29th Marh 2014) RESEARCH ARTICLE OPEN ACCESS A Comprehensive
More informationAccurate Odometry and Error Modelling for a Mobile Robot
Aurate Odometry and Error Modelling for a Mobile Robot Ko Seng CHONG Lindsay KLEEMAN o.seng.hong@eng.monash.edu.au lindsay.leeman@eng.monash.edu.au Intelligent Robotis Researh Centre (IRRC Department of
More informationAn Edge-based Clustering Algorithm to Detect Social Circles in Ego Networks
JOURNAL OF COMPUTERS, VOL. 8, NO., OCTOBER 23 2575 An Edge-based Clustering Algorithm to Detet Soial Cirles in Ego Networks Yu Wang Shool of Computer Siene and Tehnology, Xidian University Xi an,77, China
More informationAutomatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425)
Automati Physial Design Tuning: Workload as a Sequene Sanjay Agrawal Mirosoft Researh One Mirosoft Way Redmond, WA, USA +1-(425) 75-357 sagrawal@mirosoft.om Eri Chu * Computer Sienes Department University
More informationDr.Hazeem Al-Khafaji Dept. of Computer Science, Thi-Qar University, College of Science, Iraq
Volume 4 Issue 6 June 014 ISSN: 77 18X International Journal of Advaned Researh in Computer Siene and Software Engineering Researh Paper Available online at: www.ijarsse.om Medial Image Compression using
More informationWhat are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study
What are Cyle-Stealing Systems Good For? A Detailed Performane Model Case Study Wayne Kelly and Jiro Sumitomo Queensland University of Tehnology, Australia {w.kelly, j.sumitomo}@qut.edu.au Abstrat The
More informationSmooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints
Smooth Trajetory Planning Along Bezier Curve for Mobile Robots with Veloity Constraints Gil Jin Yang and Byoung Wook Choi Department of Eletrial and Information Engineering Seoul National University of
More informationDeep Rule-Based Classifier with Human-level Performance and Characteristics
Deep Rule-Based Classifier with Human-level Performane and Charateristis Plamen P. Angelov 1,2 and Xiaowei Gu 1* 1 Shool of Computing and Communiations, Lanaster University, Lanaster, LA1 4WA, UK 2 Tehnial
More informationPartial Character Decoding for Improved Regular Expression Matching in FPGAs
Partial Charater Deoding for Improved Regular Expression Mathing in FPGAs Peter Sutton Shool of Information Tehnology and Eletrial Engineering The University of Queensland Brisbane, Queensland, 4072, Australia
More informationCompressed Sensing mm-wave SAR for Non-Destructive Testing Applications using Side Information
Compressed Sensing mm-wave SAR for Non-Destrutive Testing Appliations using Side Information Mathias Bequaert 1,2, Edison Cristofani 1,2, Gokarna Pandey 2, Marijke Vandewal 1, Johan Stiens 2,3 and Nikos
More informationSpatial-Aware Collaborative Representation for Hyperspectral Remote Sensing Image Classification
Spatial-Aware Collaborative Representation for Hyperspetral Remote Sensing Image ifiation Junjun Jiang, Member, IEEE, Chen Chen, Member, IEEE, Yi Yu, Xinwei Jiang, and Jiayi Ma Member, IEEE Representation-residual
More informationRelevance for Computer Vision
The Geometry of ROC Spae: Understanding Mahine Learning Metris through ROC Isometris, by Peter A. Flah International Conferene on Mahine Learning (ICML-23) http://www.s.bris.a.uk/publiations/papers/74.pdf
More informationDrawing lines. Naïve line drawing algorithm. drawpixel(x, round(y)); double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx; double y = y0;
Naïve line drawing algorithm // Connet to grid points(x0,y0) and // (x1,y1) by a line. void drawline(int x0, int y0, int x1, int y1) { int x; double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx;
More informationHello neighbor: accurate object retrieval with k-reciprocal nearest neighbors
Hello neighbor: aurate objet retrieval with -reiproal nearest neighbors Danfeng Qin Stephan Gammeter Luas Bossard Till Qua,2 Lu van Gool,3 ETH Zürih 2 Kooaba AG 3 K.U. Leuven {ind,gammeter,bossard,tua,vangool}@vision.ee.ethz.h
More informationMicro-Doppler Based Human-Robot Classification Using Ensemble and Deep Learning Approaches
Miro-Doppler Based Human-Robot Classifiation Using Ensemble and Deep Learning Approahes Sherif Abdulatif, Qian Wei, Fady Aziz, Bernhard Kleiner, Urs Shneider Department of Biomehatroni Systems, Fraunhofer
More informationMulti-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality
INTERNATIONAL CONFERENCE ON MANUFACTURING AUTOMATION (ICMA200) Multi-Piee Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality Stephen Stoyan, Yong Chen* Epstein Department of
More informationNaïve Bayes Slides are adapted from Sebastian Thrun (Udacity ), Ke Chen Jonathan Huang and H. Witten s and E. Frank s Data Mining and Jeremy Wyatt,
Naïve Bayes Slides are adapted from Sebastian Thrun (Udaity ), Ke Chen Jonathan Huang and H. Witten s and E. Frank s Data Mining and Jeremy Wyatt, Bakground There are three methods to establish a lassifier
More informationSequential Incremental-Value Auctions
Sequential Inremental-Value Autions Xiaoming Zheng and Sven Koenig Department of Computer Siene University of Southern California Los Angeles, CA 90089-0781 {xiaominz,skoenig}@us.edu Abstrat We study the
More informationWide-baseline Multiple-view Correspondences
Wide-baseline Multiple-view Correspondenes Vittorio Ferrari, Tinne Tuytelaars, Lu Van Gool, Computer Vision Group (BIWI), ETH Zuerih, Switzerland ESAT-PSI, University of Leuven, Belgium {ferrari,vangool}@vision.ee.ethz.h,
More informationmahines. HBSP enhanes the appliability of the BSP model by inorporating parameters that reet the relative speeds of the heterogeneous omputing omponen
The Heterogeneous Bulk Synhronous Parallel Model Tiani L. Williams and Rebea J. Parsons Shool of Computer Siene University of Central Florida Orlando, FL 32816-2362 fwilliams,rebeag@s.uf.edu Abstrat. Trends
More information