Figure 1. LBP in the field of texture analysis operators.
|
|
- Dominic Andrews
- 5 years ago
- Views:
Transcription
1 L MEHODOLOGY he loal inary pattern (L) texture analysis operator is defined as a gray-sale invariant texture measure, derived from a general definition of texture in a loal neighorhood. he urrent form of the L operator is quite different from its asi version: the original definition is extended to aritrary irular neighourhoods, and a numer of extensions have een developed. he asi idea is however the same: a inary ode that desries the loal texture pattern is uilt y thresholding a neighourhood y the gray value of its enter. he operator is related to many well-known texture analysis methods. he relations and summarized in Figure. Figure. L in the field of texture analysis operators. he Original L he loal inary pattern (L) operator was first introdued as a omplementary measure for loal image ontrast (Ojala et al. 996). he first inarnation of the operator worked with the eight-neighors of a pixel, using the value of the enter pixel as a threshold. An L ode for a neighorhood was produed y multiplying the thresholded values with weights given to the orresponding pixels, and summing up the result (Figure 2). Sine the L was, y definition, invariant to monotoni hanges in gray sale, it was supplemented y an orthogonal measure of loal ontrast. Figure 2 shows how the ontrast measure (C) was derived. he average of the gray levels elow the enter pixel is sutrated from that of the gray levels aove (or equal to) the enter pixel. wo-dimensional distriutions of the L and loal ontrast measures were used as features. he operator was alled L/C. example thresholded weights Figure 2. Calulating the original L ode and a ontrast measure attern L C ( )/5 - (5+2+)/3 4.7
2 Derivation he derivation of the L follows that represented y Ojala et al. (22). Let us define texture as the joint distriution + > image pixels: of the gray levels of ( ) t( g g,..., g ),, p where g orresponds to the gray value of the enter pixel of a loal neighorhood. g p ( p,..., ) orrespond to the gray values of equally spaed pixels on a irle of radius R ( R > ) that form a irularly symmetri set of neighors. Figure 3 illustrates three irularly symmetri neighor sets for different values of and R. Without losing information, Figure 3. Cirularly symmetri neighor sets. g an e sutrated from g p : t( g g g,..., g g )., p Assuming that the differenes are independent of g, the distriution an e fatorized: ( g ) t( g g g g ). t,..., p Sine t ( g ) desries the overall luminane of an image, whih is unrelated to loal image texture, it an e ignored: t( g g,..., g p g ). Although invariant against gray sale shifts, the differenes are affeted y saling. o ahieve invariane with respet to any monotoni transformation of the gray sale, only the signs of the differenes are onsidered: ( s( g g ) s( g g )), t,..., p where s ( x), x, x <.
3 Now, a inomial weight unique L ode: L ( g g ), R s p 2. p p 2 is assigned to eah sign ( ) s g p g, transforming the differenes in a neighorhood into a Non-parametri Classifiation riniple In lassifiation, the dissimilarity etween a sample and a model L distriution is measured with a non-parametri statistial test. his approah has the advantage that no assumptions aout the feature distriutions need to e made. Originally, the statistial test hosen for this purpose was the ross-entropy priniple introdued y Kullak (968) (Ojala et al. 996). Later, Sokal & Rohlf (969) have alled this measure the G statisti: G S M ) 2 S log 2[ S log S S log M ], M where S and M denote (disrete) sample and model distriutions, respetively. S and proaility of in in the sample and model distriutions. is the numer of ins in the distriutions. he G statisti an e used in lassifiation in a modified form: L M ) S log M. M orrespond to the Model textures an e treated as random proesses whose properties are aptured y their L distriutions. In a simple i lassifiation setting, eah lass is represented with a single model distriution M. Similarly, an unidentified sample texture an e desried y the distriution S. L is a pseudo-metri that measures the likelihood that the sample S is from lass i. he most likely lass C of an unknown sample an thus e desried y a simple nearest-neighor rule: C arg min i i L M ). Apart from a log-likelihood statisti, L an also e seen as a dissimilarity measure. herefore, it an e used in onjuntion with many lassifiers, like the k-nn lassifier or the self-organizing map (SOM). he log-likelihood measure works well in many situations, ut may e unstale with small sample sizes. With small samples, the Chi square distane usually works etter (Ahonen et al. 24): 2 χ M ) ( S M ) S + M 2. Almost equivalent auray an e ahieved with the histogram intersetion, with a signifiantly smaller omputational overhead: H M ) min(, ). S M
4 Rotation Invariane o remove the effet of rotation, eah L ode must e rotated ak to a referene position, effetively making all rotated versions of a inary ode the same. his transformation an e defined as follows: { ROR( L, i) i,,..., } ri L, R min, R where the supersript ri stands for rotation invariant. he funtion ( x i) numer x i times to the right ( i < ). ROR, irularly shifts the it inary he onept of uniform patterns was introdued in Mäenpää et al (2). It was oserved that ertain patterns seem to e fundamental properties of texture, providing the vast majority of patterns, sometimes over 9%. hese patterns are alled uniform eause they have one thing in ommon: at most two one-to-zero or zero-to-one transitions in the irular inary ode. o formally define the uniformity of a neighorhood G, a uniformity measure U is needed: U p p p ( G ) s( g g ) s( g g ) + s( g g ) s( g g ). atterns with a U value of less than or equal to two are designated as uniform. For a value an e alulated effiiently as follows: U p ( x) F x xor ROR( x, ), ( p), where x is a inary numer. he funtion ( x i) ( x, i) ROR( x, i) and. F riu F, extrats the i th it from a inary numer x : it inary numer, the U he rotation invariant uniform ( 2 ) pattern ode for any uniform pattern is alulated y simply ounting ones in the inary numer. All other patterns are laeled misellaneous and ollapsed into one value: L riu2, R ( g g ), U ( G ) s p p +, otherwise. 2 In pratie, L is est implemented y reating a look-up tale that onverts the asi L odes into their riu2, R riu2 L orrespondents.
5 Contrast and exture atterns exture an e regarded as a two dimensional phenomenon haraterized y two orthogonal properties: spatial struture (patterns) and ontrast (the strength of the patterns). Rotation invariant loal ontrast an e measured in a irularly symmetri neighor set just like the L: ( g p µ ) 2, R, where g p. p p o VAR µ VAR,R is, y definition, invariant against shifts in the gray sale. A rotation invariant desription of texture in terms of texture patterns and their strength is otained with the joint distriution of L and loal variane, denoted as L VAR. riu 2, R 2, R2 Multi-Resolution L Comining Operators A straightforward way of enlarging the spatial support area is to omine the information provided y N L operators with varying and R values. his way, eah pixel in an image gets N different L odes. he aggregate dissimilarity etween a sample and a model an e alulated as a sum of the dissimilarities etween the marginal distriutions: L N N n L n n ( S, M ), n n where S and M orrespond to the sample and model distriutions extrated y the n th operator. Of ourse, the Chi square distane or histogram intersetion an also e used instead of the log-likelihood measure. Filtering and Cellular Automata he L operator an e omined with multi-sale filtering in a straightforward way. Using Gaussian low-pass filters, eah sample in the neighorhood an e made to ollet intensity information from an area larger than the original single pixel. he length of the final feature vetor soon eomes a limiting fator in using a large numer of different sales. he aility to enode a large neighorhood ompatly while preserving important information is a ruial issue in uilding a multisale extension of the L operator. Cellular automata may provide a solution to this prolem. he relation etween multi-sale L and ellular automata may not e quite ovious. It eomes so if we think of the thresholded irular neighorhoods as one-dimensional irular inary signals. In Figure 4, two L odes are dressed to form the two topmost rows of a two-dimensional pattern. he notation of time in the evolution of the ellular automaton pattern is thus replaed y the radius of the irular neighorhood. Sine the rows are treated irularly, the reakpoint (dashed line) plays no role. his property has an important onsequene: the ellular automata are always invariant with respet to rotation, irrespetive of the L version used as the input signal. Any numer of L sales an e added to the pattern. he prolem of enoding a neighorhood now eomes one of finding a rule that most proaly produed the oserved pattern, i.e. inversion. 8, R
6 he inversion prolem an e solved with a simple algorithm ased on majority voting (Mäenpää 23). Aritrarily large inary neighorhoods an thus e enoded with the input signal ( its) and a ellular automaton rule (eight its). he marginal distriutions of the input signal and the ellular automaton rule ode an e used as a texture desriptor. he L, onatenated with the marginal distriution of the ellular automaton odes dedued from S o-entri L, R odes is denoted y LCA, S. Figure 4. urning a multi-resolution L into a two-dimensional pattern. Opponent Color L he opponent olor L (OCL) operator was developed as a joint olor-texture operator for omparing gray-sale and olor texture features (Mäenpää et al. 22). he mehanism with whih the OCL feature is extrated is motivated y Jain & Healey (998). Also the use of the term opponent olor follows the onvention adopted y them: all pairs of olor hannels are alled opponent olors. In the opponent olor L, the L operator is applied on eah olor hannel separately. In addition, eah pair of olor hannels is used in olleting opponent olor patterns so that the enter pixel for a neighorhood and the neighorhood itself are taken from different olor hannels. Referenes Ahonen, Hadid A & ietikäinen M (24) Fae reognition with loal inary patterns. Computer Vision, ECCV 24 roeedings, Leture Notes in Computer Siene 32, Springer, Jain A & Healey G (998) A multisale representation inluding opponent olor features for texture reognition. IEEE ransations on Image roessing, 7(): Kullak S (968) Information theory and statistis. Dover uliations, New York. Mäenpää (23) he loal inary pattern approah to texture analysis extensions and appliations. Dissertation, Ata Univ Oul C 87, University of Oulu, 78 p + App.
7 Mäenpää, Ojala, ietikäinen M & Soriano M (2) Roust texture lassifiation y susets of loal inary patterns. ro. 5th International Conferene on attern Reognition, arelona, Spain, 3: Mäenpää & ietikäinen M (24) exture analysis with loal inary patterns. In: Chen CH & Wang S (eds) Handook of attern Reognition & Computer Vision, 3rd ed, World Sientifi, Singapore, in press (invited hapter). Mäenpää, ietikäinen M & Viertola J (22) Separating olor and pattern information for olor texture disrimination. ro. 6th International Conferene on attern Reognition, August 5, Vol., Ojala, ietikäinen M & Harwood D (996) A omparative study of texture measures with lassifiation ased on featured distriution. attern Reognition, 29():5-59. Ojala, ietikäinen M & Mäenpää (22) Multiresolution gray-sale and rotation invariant texture lassifiation with loal inary patterns. IEEE ransations on attern Analysis and Mahine Intelligene, 24(7): Sokal R & Rohlf F (969) iometry. W.H. Freeman.
Machine Vision. Laboratory Exercise Name: Student ID: S
Mahine Vision 521466S Laoratory Eerise 2011 Name: Student D: General nformation To pass these laoratory works, you should answer all questions (Q.y) with an understandale handwriting either in English
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 informationKERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION
KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION Cuiui Kang 1, Shengai Liao, Shiming Xiang 1, Chunhong Pan 1 1 National Laboratory of Pattern Reognition, Institute of Automation, Chinese
More informationOn Optimal Total Cost and Optimal Order Quantity for Fuzzy Inventory Model without Shortage
International Journal of Fuzzy Mathemat and Systems. ISSN 48-9940 Volume 4, Numer (014, pp. 193-01 Researh India Puliations http://www.ripuliation.om On Optimal Total Cost and Optimal Order Quantity for
More informationTEXTURE CLASSIFICATION BY LOCAL SPATIAL PATTERN MAPPING BASED ON COMPLEX NETWORK MODEL. Srisupang Thewsuwan and Keiichi Horio
International Journal of Innovative Computing, Information and Control ICIC International c 2018 ISSN 1349-4198 Volume 14, Numer 3, June 2018 pp. 1113 1121 TEXTURE CLASSIFICATION BY LOCAL SPATIAL PATTERN
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 informationthe 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 informationConstrained Extreme Learning Machines: A Study on Classification Cases
> REPLACE HIS LINE IH YOUR PAPER IDENIFICAION NUMBER (DOUBLE-CLICK HERE O EDI) < Constrained Extreme Learning Mahines: A Study on Classifiation Cases entao Zhu, Jun Miao, and Laiyun Qing Astrat Extreme
More informationMultivariate Texture-based Segmentation of Remotely Sensed. Imagery for Extraction of Objects and Their Uncertainty
Multivariate Texture-based Segmentation of Remotely Sensed Imagery for Extration of Objets and Their Unertainty Arko Luieer*, Alfred Stein* & Peter Fisher** * International Institute for Geo-Information
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 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 informationPath Sharing and Predicate Evaluation for High-Performance XML Filtering*
Path Sharing and Prediate Evaluation for High-Performane XML Filtering Yanlei Diao, Mihael J. Franklin, Hao Zhang, Peter Fisher EECS, University of California, Berkeley {diaoyl, franklin, nhz, fisherp}@s.erkeley.edu
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 informationEfficient and scalable trie-based algorithms for computing set containment relations
Effiient and salale trie-ased algorithms for omputing set ontainment relations Yongming Luo #1, George H. L. Flether #2, Jan Hidders 3, Paul De Bra #4 # Eindhoven University of Tehnology, The Netherlands
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 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 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 informationMulti-Level Modeling of Concurrent and Distributed Systems
Multi-Level Modeling of Conurrent and Distriuted Systems Peter Taeling Hasso-Plattner-Institute for Software Systems Engineering P.O. Box 90 04 60, 14440 Potsdam, Germany taeling@hpi.uni-potsdam.de strat
More informationSystem-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications
System-Level Parallelism and hroughput Optimization in Designing Reonfigurable Computing Appliations Esam El-Araby 1, Mohamed aher 1, Kris Gaj 2, arek El-Ghazawi 1, David Caliga 3, and Nikitas Alexandridis
More informationMining Edge-Weighted Call Graphs to Localise Software Bugs
Mining Edge-Weighted Call Graphs to Loalise Software Bugs Frank Eihinger, Klemens Böhm, and Matthias Huer Institute for Program Strutures and Data Organisation (IPD), Universität Karlsruhe (TH), Germany
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 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 informationExploiting Longer Cycles for Link Prediction in Signed Networks
Exploiting Longer Cyles for Link Predition in Signed Networks Kai-Yang Chiang kyhiang@s.utexas.edu Nagarajan Natarajan naga86@s.utexas.edu Inderjit S. Dhillon inderjit@s.utexas.edu Amuj Tewari amuj@s.utexas.edu
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 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 informationINTEGRATING PHOTOGRAMMETRY AND INERTIAL SENSORS FOR ROBOTICS NAVIGATION AND MAPPING
INTEGRATING PHOTOGRAMMETRY AND INERTIAL SENSORS FOR ROBOTICS NAVIGATION AND MAPPING Fadi Bayoud, Jan Skaloud, Bertrand Merminod Eole Polytehnique Fédérale de Lausanne (EPFL) Geodeti Engineering Laoratory
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 informationA Practical Tool for Visualizing and Data Mining Medical Time Series
A Pratial Tool for Visualizing and Data Mining Medial Time Series Astrat The inreasing interest in time series data mining in the last deade has had surprisingly little impat on real world medial appliations.
More informationCluster-Based Cumulative Ensembles
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,
More informationAbstract. We describe a parametric hybrid Bezier patch that, in addition. schemes are local in that changes to part of the data only aect portions of
A Parametri Hyrid Triangular Bezier Path Stephen Mann and Matthew Davidhuk Astrat. We desrie a parametri hyrid Bezier path that, in addition to lending interior ontrol points, lends oundary ontrol points.
More informationTracking Table Tennis Balls in Real Match Scenes for Umpiring Applications
British Journal of Mathematis & Computer Siene 1(4): 228-241, 2011 SCIENCEDOMAIN international www.sienedomain.org Traking Tale Tennis Balls in Real Math Senes for Umpiring Appliations K. C. P. Wong 1*
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 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 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 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 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 informationStructural Topology Optimization Based on the Smoothed Finite Element Method
378 Strutural Topology Optimization Based on the Smoothed Finite Element Method Astrat In this paper, the smoothed finite element method, inorporated with the level set method, is employed to arry out
More informationTriangle LMN and triangle OPN are similar triangles. Find the angle measurements for x, y, and z.
1 Use measurements of the two triangles elow to find x and y. Are the triangles similar or ongruent? Explain. 1a Triangle LMN and triangle OPN are similar triangles. Find the angle measurements for x,
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 informationRapid, accurate particle tracking by calculation of radial symmetry centers
Rapid, aurate partile traing by alulation of radial symmetry enters Raghuveer Parthasarathy Supplementary Text and Figures Supplementary Figures Supplementary Figure 1 Supplementary Figure Supplementary
More informationLesson 2: Right Triangle Trigonometry
Lesson : Right Triangle Trigonometry lthough Trigonometry is used to solve many prolems, historially it was first applied to prolems that involve a right triangle. This an e extended to non-right triangles
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 Support-Based Algorithm for the Bi-Objective Pareto Constraint
Proeedings of the Twenty-Eighth AAAI Conferene on Artifiial Intelligene A Support-Based Algorithm for the Bi-Ojetive Pareto Constraint Renaud Hartert and Pierre Shaus UCLouvain, ICTEAM, Plae Sainte Bare
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 informationAn Experimental Study of Fractional Cooperation in Wireless Mesh Networks
An Experimental tudy of Frational Cooperation in Wireless Mesh Networks Anthony Cale, Nariman Farsad, and Andrew W. Ekford Dept. of Computer iene and Engineering, York University 47 Keele treet, Toronto,
More informationAutomated Test Generation from Vulnerability Signatures
Automated Test Generation from Vulneraility Signatures Adulaki Aydin, Muath Alkhalaf, and Tevfik Bultan Computer Siene Department University of California, Santa Barara Email: {aki,muath,ultan}@s.us.edu
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 informationUniversity of California - Riverside Department of Computer Science & Engineering Riverside, CA 92521, USA
Trak Title: Paper Title: Authors: Speial Trak on Data Mining A Pratial Tool for Visualizing and Data Mining Medial Time Series Li Wei (wli@s.ur.edu) Nitin Kumar (nkumar@s.ur.edu) Venkata Nishanth Lolla
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 informationImage Interpolation Using Classification-based Neural Networks
Image Interpolation Using Classifiation-ased eural etworks Hao Hu, Student Memer, IEEE, Paul M. Hofman and Gerard de Haan, Senior Memer, IEEE Astrat Standard interpolation metods generally use a uniform
More informationA Compressed Breadth-First Search for Satisfiability
A Compressed Breadth-First Searh for Satisfiaility DoRon B. Motter and Igor L. Markov Department of EECS, University of Mihigan, 1301 Beal Ave, Ann Aror, MI 48109-2122 dmotter, imarkov @ees.umih.edu Astrat.
More informationGray Codes for Reflectable Languages
Gray Codes for Refletable Languages Yue Li Joe Sawada Marh 8, 2008 Abstrat We lassify a type of language alled a refletable language. We then develop a generi algorithm that an be used to list all strings
More information1. Inversions. A geometric construction relating points O, A and B looks as follows.
1. Inversions. 1.1. Definitions of inversion. Inversion is a kind of symmetry about a irle. It is defined as follows. he inversion of degree R 2 entered at a point maps a point to the point on the ray
More informationA Dictionary based Efficient Text Compression Technique using Replacement Strategy
A based Effiient Text Compression Tehnique using Replaement Strategy Debashis Chakraborty Assistant Professor, Department of CSE, St. Thomas College of Engineering and Tehnology, Kolkata, 700023, India
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 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 informationA Support-Based Algorithm for the Bi-Objective Pareto Constraint
A Support-Based Algorithm for the Bi-Ojetive Pareto Constraint Renaud Hartert and Pierre Shaus UCLouvain, ICTEAM, Plae Sainte Bare 2, 1348 Louvain-la-Neuve, Belgium {renaud.hartert, pierre.shaus,}@ulouvain.e
More informationA DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR
Malaysian Journal of Computer Siene, Vol 10 No 1, June 1997, pp 36-41 A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Md Rafiqul Islam, Harihodin Selamat and Mohd Noor Md Sap Faulty of Computer Siene and
More information15th Special Course on Image Processing for Industrial Applications October, 2000, Delft, The Netherlands. 1. Lab exercises: Mathematical Morphology
1. La exercises: Mathematical Morphology In these la exercises we will use matla and the SDC morphology toolox, a special lirary for mathematical morphological image processing. A demo version of this
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 informationMenu. X + /X=1 and XY+X /Y = X(Y + /Y) = X
Menu K-Maps and Boolean Algera >Don t ares >5 Variale Look into my... 1 Karnaugh Maps - Boolean Algera We have disovered that simplifiation/minimization is an art. If you see it, GREAT! Else, work at it,
More informationCircular Pruning for Lazy Diagnosis of Active Systems
Cirular Pruning for Lazy Diagnosis of Ative Systems Andrea Duoli, Gianfrano Lamperti, Emanuele Piantoni, Marina Zanella Dipartimento di Elettronia per l Automazione, Università di Bresia, Italy Astrat:
More informationPolyhedron Volume-Ratio-based Classification for Image Recognition
Polyhedron Volume-Ratio-based Classifiation for Image Reognition Qingxiang Feng, Jeng-Shyang Pan, Senior Member, IEEE, Jar-Ferr Yang, Fellow, IEEE and Yang-ing Chou Abstrat In this paper, a novel method,
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 informationRouting Protocols for Wireless Ad Hoc Networks Hybrid routing protocols Theofanis Kilinkaridis
Routing Protools for Wireless Ad Ho Networks Hyrid routing protools Theofanis Kilinkaridis tkilinka@.hut.fi Astrat This paper presents a partiular group of routing protools that aim to omine the advantages
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 informationAlgorithms, Mechanisms and Procedures for the Computer-aided Project Generation System
Algorithms, Mehanisms and Proedures for the Computer-aided Projet Generation System Anton O. Butko 1*, Aleksandr P. Briukhovetskii 2, Dmitry E. Grigoriev 2# and Konstantin S. Kalashnikov 3 1 Department
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 informationInternational Journal of Advancements in Research & Technology, Volume 3, Issue 3, March-2014 ISSN
International Journal of Advanements in Researh & Tehnology, Volume 3, Issue 3, Marh-204 ISSN 2278-773 47 Phrase Based Doument Retrieving y Comining Suffix Tree index data struture and Boyer- Moore faster
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 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 informationAlgorithms for External Memory Lecture 6 Graph Algorithms - Weighted List Ranking
Algorithms for External Memory Leture 6 Graph Algorithms - Weighted List Ranking Leturer: Nodari Sithinava Sribe: Andi Hellmund, Simon Ohsenreither 1 Introdution & Motivation After talking about I/O-effiient
More informationSupplementary Material: Geometric Calibration of Micro-Lens-Based Light-Field Cameras using Line Features
Supplementary Material: Geometri Calibration of Miro-Lens-Based Light-Field Cameras using Line Features Yunsu Bok, Hae-Gon Jeon and In So Kweon KAIST, Korea As the supplementary material, we provide detailed
More information4.1.1 Design quality. 4.Normalization: Quality of relational designs. Informal guidelines (2) Informal guidelines (1)
.Normalization: Quality of relational designs. Funtional Dependenies.. Design quality.. Update anomalies.. Funtional Dependenies: definition.. Properties of Funtional Dependenies. Normal forms.. Informal
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 information1 Disjoint-set data structure.
CS 124 Setion #4 Union-Fin, Greey Algorithms 2/20/17 1 Disjoint-set ata struture. 1.1 Operations Disjoint-set ata struture enale us to effiiently perform operations suh as plaing elements into sets, querying
More informationData we are discussing in the class. Scalar/vector/tensor. Heterogeneous. Scientific data. 3D+time (n<4) Information data
Data we are disussing in the lass Soure: VIS, Universit of Stuttgart Sientifi data 3D+time (n3 Heterogeneous Salar Data Analsis Salar Fields The approimation
More informationUnsupervised color film restoration using adaptive color equalization
Unsupervised olor film restoration using adaptive olor equalization A. Rizzi 1, C. Gatta 1, C. Slanzi 1, G. Cioa 2, R. Shettini 2 1 Dipartimento di Tenologie dell Informazione Università degli studi di
More informationOutline. CS38 Introduction to Algorithms. Administrative Stuff. Administrative Stuff. Motivation/Overview. Administrative Stuff
Outline CS38 Introdution to Algorithms Leture 1 April 1, 2014 administrative stuff motivation and overview of the ourse stale mathings example graphs, representing graphs graph traversals (BFS, DFS) onnetivity,
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 informationIntroduction to Seismology Spring 2008
MIT OpenCourseWare http://ow.mit.edu 1.510 Introdution to Seismology Spring 008 For information about iting these materials or our Terms of Use, visit: http://ow.mit.edu/terms. 1.510 Leture Notes 3.3.007
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 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 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 informationtimestamp, if silhouette(x, y) 0 0 if silhouette(x, y) = 0, mhi(x, y) = and mhi(x, y) < timestamp - duration mhi(x, y), else
3rd International Conferene on Multimedia Tehnolog(ICMT 013) An Effiient Moving Target Traking Strateg Based on OpenCV and CAMShift Theor Dongu Li 1 Abstrat Image movement involved bakground movement and
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 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 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 informationChromaticity-matched Superimposition of Foreground Objects in Different Environments
FCV216, the 22nd Korea-Japan Joint Workshop on Frontiers of Computer Vision Chromatiity-mathed Superimposition of Foreground Objets in Different Environments Yohei Ogura Graduate Shool of Siene and Tehnology
More informationTowards Optimal Naive Bayes Nearest Neighbor
Towards Optimal Naive Bayes Nearest Neighbor Régis Behmo 1, Paul Marombes 1,2, Arnak Dalalyan 2,andVéronique Prinet 1 1 NLPR / LIAMA, Institute of Automation, Chinese Aademy of Sienes 2 IMAGINE, LIGM,
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 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 informationTexture Enhanced Histogram Equalisation Using TV-L 1 Image Decomposition
1 Texture Enhaned Histogram Equalisation Using TV-L 1 Image Deomposition Ovidiu Ghita, Dana E. Ilea, and Paul F. Whelan, Senior Member, IEEE Abstrat Histogram transformation defines a lass of image proessing
More informationStable Road Lane Model Based on Clothoids
Stable Road Lane Model Based on Clothoids C Gakstatter*, S Thomas**, Dr P Heinemann*, Prof Gudrun Klinker*** *Audi Eletronis Venture GmbH, **Leibniz Universität Hannover, ***Tehnishe Universität Münhen
More informationAn Improved Brain Mr Image Segmentation using Truncated Skew Gaussian Mixture
(IJACSA International Journal of Advaned Computer Siene and Appliations, Vol. 6, No. 7, 25 An Improved Brain Mr Image Segmentation using Gaussian Mixture Nagesh Vadaparthi Department of Information Tehnology
More informationEnd mills are widely used in industry for high-speed machining. End milling cutters are C H A P T E R 2
C H A P T E R End Mill End mills are widely used in industry for high-speed mahining. End milling utters are multi-point milling utters with utting edges both on the fae end as well as on the periphery,
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 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 informationCracked Hole Finite Element Modeling
Craked Hole Finite Element Modeling (E-20-F72) Researh Report Submitted to: Lokheed Martin, Program Manager: Dr. Stephen P. Engelstad Prinipal Investigator: Dr. Rami M. Haj-Ali Shool of Civil and Environmental
More information