ANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION
|
|
- Caitlin Sutton
- 6 years ago
- Views:
Transcription
1 ANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION A. Váque-Nava * Ecuela de Ingeniería. CENTRO UNIVERSITARIO MEXICO. DIVISION DE ESTUDIOS SUPERIORES J. Figueroa Nauno & E. Varga Medina Laboratorio de Sitema Complejo UNIVERSIDAD DEL VALLE DE MEXICO - LOMAS VERDES Av. Paeo de la ave #1. Fracc. Loma Verde Naucalpan Edo. de México MEXICO FAX: (915) Publihed. CLEI ITESM Campu Etado de México. MEXICO September 19-23, 1994 ABSTRACT The behavior of the firt layer of a weightle artificial neural network i analyed in thi paper. The way in which the neural network receive external information change accordingly to different probability ditribution function that control data ampling from many different pattern. Thi paper decribe the architecture of thi ytem and how the effect of the different probability ditribution function over 3_dimenional pattern recognition. 1. INTRODUCTION Conidering contemporary reearch in neural network, it i known that combining a certain paradigm and hidden layer of neural network give a a reult a powerful tool for pattern recognition and claification. However, there ha been little development and interet in tudying the firt or receiving layer of artificial neural network. Implicitly, it ha been aumed that the firt layer ha an homogeneou (and almot an irrelevant) behavior which i aociated to the global performance of the neural network. Thi fact i againt a big amount of phyiological evidence indicating that the type and organiation of receiver of biological neural network have a great importance in their phyiological behavior. It i known that pecific phenomena of full generality are aociated to the behavior of the firt layer (or receiving layer) of neural network; the mot known cae i lateral inhibition. Earlier work have experimentally demontrated the effect on pattern recognition and claiffication when the way in which the firt layer of an artificial neural network receive external information i changed 4,5,6,7. Thi paper decribe a ytem compoed by a fixed weightle neural network (Alekander` model) 1,2,5,7. Thi ytem i capable of changing the way in which it receive external information. Pattern to be claified are ampled in many way through the ue of different probability ditribution function. Thee probability ditribution function determine the way in which the firt layer i activated. The effect of the different probability ditribution function over 3-dimenional pattern recognition i tudied in thi paper. 2. PROCEDURE The following are the neceary element of a geneneralied weightle Neural Network (baed on Alekander` Model) for 2D (2-dimenional) and 3D (3-dimenional) pattern learning and recognition. Thee element are: Pattern repreentation array, Control array and probability ditribution function for data ampling, Mapping function, and Learning/Recognition array.
2 2D 2.1 Pattern Repreentation Array: Thi array tore the color code of the point that belong to the learned/recognied pattern. In the cae of pattern learning/recognition, thi array i repreented by: [ i, j] : c V = (1) where i, j are integer repreenting the coordinate of a point P(i,j) and c repreent the color code for point P. Generaliing for 3D, thi array i repreented by uing a et of 2D array. Thi et i alo an array: [ i, j, ] : c W = (2) thi array i made of p matrixe of the ame type a V : [ i, j, ] : = V [ i, j] : = c ( 1, 2, 3,..., p) W = (3) 2.2 Control Matrixe and probability ditribution function for data ampling: Thee matrixe are required to perform the pattern learning and pattern recognition phae. The point of a pattern are ampled by uing the value tored in the Control Matrixe. Different probability ditribution function ( P(X) ) compute thee value that determine the way in which the firt layer of the neural network i activated. The effect of the different probability ditribution function over 2D & 3D pattern recognition i tudied in the next ection. For 2D pattern learning/recognition, 2 matrixe ( & MJ ) tore the coordinate of the point to be ampled. Matrix tore the value of coordinate i and matrix MJ tore the value of coordinate j of ampled element from the Repreentation array V. For 3D, there are 2 Control Matrixe ( & MJ ) that are aociated to each array V belonging to et W. The following expreion compute the value tored by Control Matrixe: MJ [ i, jmj ]: = INT( ( m + 1) * P( X )) [ i, j ]: = INT (( n+ 1) * P( X) ) MJ (4) & (5) where m repreent the number of row of V and n repreent the number of column of the ame array. P(X) i a probability ditribution function with X a a random variable and 0 <=P(X)<= 1. The dimenion of matrixe and MJ i computed a a function of the dimenion of matrix V. Given V whoe capacity i m*n, then: m n = m = n MJ MJ : = m * 2 : = m / 2 (6) & (7) where m i the number of row belonging to and MJ ; n i the number of column belonging to thee matrixe. 2.3 Mapping : The main purpoe of the Control Matrixe i to control the ampling of element belonging to matrix V (for 2D pattern learning and recognition) or matrixe V (for 3D). Thee ampled element are the input for computing a Mapping f. The Mapping f map the ampled element of V to element belonging to the Learning/Recognition array. Thi Mapping compute the addre of the a th element of the Learning/Recognition array. Thi mapping i performed with value k, l and matrixe, MJ & V a input. The Mapping ha the following tructure: ( V [ [ k, l], MJ[ k, l], maxcod, k l] ) Addre := f, For 2D pattern learning and recognition, the Mapping f i propoed a: (8)
3 a : = 1 + n l ( * maxcod ) n ( k 1) * maxcod + V[ [ k, l], MJ[ k, l ] l= 0 (9) where k, l are the coordinate of the element of matrixe and MJ. maxcod i the maximun number of color code ued for pattern repreentation. V[ [k,l], MJ[k,l] ] i an element which i ampled from V uing the pecified coordinate in matrixe & MJ. For 3D pattern learning and recognition, the Mapping f i propoed a: a : = 1 + n l ( * maxcod ) n ( k 1) * maxcod + V [ [ k, l], MJ [ k, l ] l= 0 where k, l are coordinate of element belonging to matrixe & MJ. maxcod repreent the maximum number of color code for pattern repreentation. V [ [k,l], MJ[k,l] ] i a ampled element from the " th " matrix V which belong to et W. (10) 2.4 Learning/Recognition Array and Learning Phae: During the learning phae, the Mapping f i computed in uch a way that the content of the mapped element of the Learning/Recognition Array (array A ) will be updated. Thee element are referenced by the addree which are computed by the Mapping f. For 2D, each element of thi array i compoed by a et of bit, each one i related to a pattern cla. If the k th bit of an element i et on, then thi fact implie that thi element belong to the pattern cla k. A ingle element of A may have everal bit et on at different poition. Thi ituation mean that a ingle element of A may belong to different pattern clae. For 3D, the ame approach i followed. However, the Learning/Recognition array i compoed by column, each column repreent a ingle array A. Therefore, for 3D pattern learning and recognition, the Learning/Recognition array B i a et of array of type A. The value a,which are computed by the mapping function, repreent the addree of mapped element belonging to the th column of B (ee fig. 1). 2.5 Mechanim for pattern learning: The pattern, which i to be learned by the Weightle Neural Network, i tored in the Pattern Repreentation Array ( V for 2D, W for 3D). The coordinate of ampled element belonging to the pattern are computed uing a probability ditribution function P(X). Thee coordinate are tored in the Control Matrixe for data ampling ( & MJ for 2D, & MJ for 3D). Thee matrixe control the ampling of element from the Pattern Repreentation Array. The ampled element are ued a input for the Mapping ( f for 2D, f for 3D), o the addree of element belonging to the Learning/Recognition Array are computed. The content of thee mapped element are updated by etting on the aociated bit to the cla. The learned pattern belong to thi cla. In cae of 2D pattern learning, n element of the Learning/Recognition Array will be updated (ee fig. 1 & 2). For 2D, thi update i performed by uing the following expreion: [] a:= Aa [] OR A 2 (11) where repreent the cla to which the learned pattern belong, and a i the addre which i computed by the Mapping f. In cae of 3D pattern learning, p * n element of the Learning/Recognition Array will be updated. For 3D, thi update i performed by: [ a, ] : = B[ a, ] OR B 2 (12) where repreent the cla to which the learned pattern belong, and a repreent the addre of the element to be updated in the th column of array B.
4 2.6 Mechanim for pattern recognition: The pattern, which i to be claiffied by the neural network, i tored in the Pattern Repreentation Array ( V for 2D, W for 3D). Uing the ame Control Matrixe for data ampling ( & MJ for 2D, & MJ for 3D), which were computed during the learning phae, the element of the pattern are elected to be input for the Mapping (ee fig. 2). For each mapped element belonging to the Learning/Recognition Array, whoe addre i computed by the Mapping, it content i analyed. Thi analyi conit in checking the bit which are et on in each mapped element. The number of bit of a given cla i counted. For 2D, the following expreion count the number of bit et on for each cla: count count [] [] : : = p n = n r= 1 = 1 r= 1 B [ ] A a r [ a ], r AND 2 2 AND 2 2 For =0, 1,, maxcla-1 (13) where a i computed by uing the Mapping f. maxcla i the maximum number of pattern clae pecified during learning phae. For 3D, the following expreion compute the count: For =0, 1,, maxcla-1 (14) where p i the number of matrixe V contained in et W, and B i the Learning/Recognition array. a, r i the addre of the mapped element which i computed by the Mapping f. Once the count for each pattern cla ha been computed, the count are compared among each other. The highet count for a given pattern cla k implie that the weightle neural network recognice the input pattern a belonging to cla k. Pattern recognition may be meaured by a core which range from 0 to 1. Each core i computed a a function of each count. For 2D, the core related to each pattern cla i computed by the following expreion: count core : = [] n [] For =0, 1,, maxcla-1 (15) For 3D, the following expreion compute each core: core [] count := p * [] n For =0, 1,, maxcla-1 (16) 3. EXPERIMENTS AND RESULTS A factorial experimental deign 3 * 3 * 4 (3 learned clae, 3 training condition and 4 probability ditribution function) wa implemented for teting the decribed artificial neural network. Each pattern wa drawn with 3 different color and uing a 16 * 16 * 5 Pattern Repreentation Array. The percentage and mean core of properly recognied pattern, and alo tandard deviation were meaured for each experimental condition. The reult of thi analyi are hown in table 1. The content of table 1 were ued a input for a Three-way Analyi of Variance (ANOVA). The reult of thi analyi clearly how that pattern recognition (performed by the weightle artificial neural network in thi paper) i affected by the number of learned clae (F=6.717, p<0.0001), the number of training pattern (F= , p<0.0001) and the Probability Ditribution ued for data ampling (F=15.014, p<0.0001). Thi analyi ha alo hown highly ignificant effect over pattern recognition due to the number of training pattern that interact with the type of probability ditribution (F=6.716, p<0.001); minor ignificant effect are aociated with interaction between number of learned clae and number of training pattern (F=2.188, p<0.05). Thee effect can clearly be een in fig. 3,4,5.
5 The number of learned pattern (for each cla) ha a direct relationhip with the performance aociated with pattern recognition and with the mean core of recognied clae. A the number of learned pattern increae, the percentage and mean core of recognied clae alo increae. It alo can be noted that the percentage and mean core are not affected (in a negative way) a the number of ued clae during learning phae increae. 4. CONCLUSIONS AND DISCUSSION The reult, which are decribed above, how in a very clear manner that different type of data ampling (ued for activating the firt layer of neural network) have important and ytematic effect on the global behavior of neural network. It ha been aumed that the firt layer ha a paive and unimportant behavior aociated to the performance of the neural network. However, thi and earlier work 4,5,6 how the way in which experimental manipulation of the firt layer affect and make eaier pattern recognition made by a neural network. Thi fact not only ha experimental importance but alo it how that thee theorie and formal analyi about neural network hould be reconidered in a theoretical way.
6 Mechanim for 3D pattern learning in a weightle artificial neural (1) Generating coordinate of element to be ampled from Pattern Repreentation Array V P(X) Probability Ditribution 7 Control Matrixe MJ for data ampling (2) Storing pattern to be learned and belonging to a pecific cla (3) Sampling element from the 3D Pattern Repreentation Array Mapping 5 3D Pattern Repreentation Array V (4) Calculating mapped element into Learning/Recognition Array by uing Mappging Control Matrixe MJ for data ampling (5) Updating mapped element Pattern Learning/Recognition Array B FIG. 1 Cla 0 Cla 1 Cla maxcla-1
7 Mechanim for 3D pattern recognition in a weightle artificial neural Control Matrixe MJ for data ampling 7 (1) Storing pattern to be claified (2) Sampling element from the 3D Pattern Repreentation Array Mapping 5 3D Pattern Repreentation Array V (3) Calculating mapped element into Learning/Recognition Array by uing Mappging Control Matrixe MJ for data ampling (4) Calculating Hamming ditance from each cla, according to each addre (5) Claifying input pattern a belonging to the cla with the highet core Pattern Learning/Recognition Array B FIG. 2 Cla 0 Cla 1 Cla maxcla-1
8 Effect over pattern recognition due to different Probability Ditribution under variou experimental condition. % of properly claified pattern % of properly claified pattern % of properly claified pattern Number of pattern for neural network training Effect over pattern recognition when 2 clae are learned Fig Number of pattern for neural network training Effect over pattern recognition when 3 clae are learned Fig Number of pattern for neural network training Effect over pattern recognition when 6 clae are learned Fig. 5 Simbology: Normal Ditribution Uniform Ditribution Cauchy Ditribution Beta Ditribution
9 Probability Ditribution NORMAL UNIFORM CAUCHY BETA Amount of tet pattern to be claified % % n=20 Number of learned clae: % % % n= % % % % n= % % % % n=30 Number of learned clae: % % % n= % % % % n= % % % % n=60 Number of learned clae: % % % % % % n=70 n=70 Note: - Each cell of the table ha the following tructure: 92.85% Percentage of tet pattern that were uccefully claified Mean Score of recognied pattern clae Standard Deviation - The lat column repreent the number of pattern to be claified in each Probability Ditribution Table 1
10 5. REFERENCES 1.- Alekander, I. Microcircuit Learning Computer, Mill & Boon Limited Alekander, I. & Marton, H. An Introduction to Neural Computing, Chapman & Hall Barlow, H.B. "Retina and central factor in human viion limited by noie." In. H.B. Varlow & P. Fatt. Vertebrate photoreception, pp London, Academic Pre Figueroa Nauno, J.; Flore, C.; Varga, E. & Romero, M. " mapping and it relationhip with the pychopyical function in the theory of neural network." International Joint-Conference on Neural Network. Wahington, D.C. January 15-19, Figueroa-Nauno, J.; Váque-Nava, A.; Varga-Medina, E. "3-Dimenional Pattern Recognition Uing Wightle Neural Network (Alekander' Model)." International Joint-Conference on Neural Network. Baltimore, Maryland. June 7-11, Flore Garc!a, C. ; Varga Medina, E. & Figueroa Nauno, J. "Modelo formale que predicen el reconocimiento de patrone en humano." Congreo Mexicón '95. México D.F. del 18 al 22 de eptiembre, Foryth Richard and Naylor Chri. The Hitch Hiver' guide to Artificial Intelligence, Chapman and Mall/Methven, London Geiler, W.S. "Sequential Ideal-Oberver Analyi of Viual Dicrimination." Pychological Review, vol. 96, 2, pp William, D.R. "Topography of the foveal cone moaic in the living human eye". Viion Reearch, 28, pp
Universität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart.
Univerität Augburg à ÊÇÅÍÆ ËÀǼ Approximating Optimal Viual Senor Placement E. Hörter, R. Lienhart Report 2006-01 Januar 2006 Intitut für Informatik D-86135 Augburg Copyright c E. Hörter, R. Lienhart Intitut
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each type of circuit will be implemented in two
More informationOn combining Learning Vector Quantization and the Bayesian classifiers for natural textured images
On combining Learning Vector Quantization and the Bayeian claifier for natural textured image María Guiarro Dept. Ingeniería del Software e Inteligencia Artificial Facultad Informática Univeridad Complutene
More informationA TOPSIS based Method for Gene Selection for Cancer Classification
Volume 67 No17, April 2013 A TOPSIS baed Method for Gene Selection for Cancer Claification IMAbd-El Fattah,WIKhedr, KMSallam, 1 Department of Statitic, 3 Department of Deciion upport, 2 Department of information
More informationMAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc
MAT 155: Decribing, Exploring, and Comparing Data Page 1 of 8 001-oteCh-3.doc ote for Chapter Summarizing and Graphing Data Chapter 3 Decribing, Exploring, and Comparing Data Frequency Ditribution, Graphic
More informationAn Approach to a Test Oracle for XML Query Testing
An Approach to a Tet Oracle for XML Query Teting Dae S. Kim-Park, Claudio de la Riva, Javier Tuya Univerity of Oviedo Computing Department Campu of Vieque, /n, 33204 (SPAIN) kim_park@li.uniovi.e, claudio@uniovi.e,
More informationPerformance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks
Performance of a Robut Filter-baed Approach for Contour Detection in Wirele Senor Network Hadi Alati, William A. Armtrong, Jr., and Ai Naipuri Department of Electrical and Computer Engineering The Univerity
More informationHow to Select Measurement Points in Access Point Localization
Proceeding of the International MultiConference of Engineer and Computer Scientit 205 Vol II, IMECS 205, March 8-20, 205, Hong Kong How to Select Meaurement Point in Acce Point Localization Xiaoling Yang,
More informationDistributed Packet Processing Architecture with Reconfigurable Hardware Accelerators for 100Gbps Forwarding Performance on Virtualized Edge Router
Ditributed Packet Proceing Architecture with Reconfigurable Hardware Accelerator for 100Gbp Forwarding Performance on Virtualized Edge Router Satohi Nihiyama, Hitohi Kaneko, and Ichiro Kudo Abtract To
More informationPlanning of scooping position and approach path for loading operation by wheel loader
22 nd International Sympoium on Automation and Robotic in Contruction ISARC 25 - September 11-14, 25, Ferrara (Italy) 1 Planning of cooping poition and approach path for loading operation by wheel loader
More informationImage authentication and tamper detection using fragile watermarking in spatial domain
International Journal of Advanced Reearch in Computer Engineering & Technology (IJARCET) Volume 6, Iue 7, July 2017, ISSN: 2278 1323 Image authentication and tamper detection uing fragile watermarking
More informationelse end while End References
621-630. [RM89] [SK76] Roenfeld, A. and Melter, R. A., Digital geometry, The Mathematical Intelligencer, vol. 11, No. 3, 1989, pp. 69-72. Sklanky, J. and Kibler, D. F., A theory of nonuniformly digitized
More informationThe norm Package. November 15, Title Analysis of multivariate normal datasets with missing values
The norm Package November 15, 2003 Verion 1.0-9 Date 2002/05/06 Title Analyi of multivariate normal dataet with miing value Author Ported to R by Alvaro A. Novo . Original by Joeph
More information3D SMAP Algorithm. April 11, 2012
3D SMAP Algorithm April 11, 2012 Baed on the original SMAP paper [1]. Thi report extend the tructure of MSRF into 3D. The prior ditribution i modified to atify the MRF property. In addition, an iterative
More informationAN INTELLIGENT SCHEME FOR FACIAL EXPRESSION RECOGNITION
AN INTELLIGENT SCHEME FOR FACIAL EXPRESSION RECOGNITION A. Raouzaiou, S. Ioannou, K. Karpouzi, N. Tapatouli, S. Kollia 1, R. Cowie 2 1 Department of Electrical and Computer Engineering National Technical
More informationEdits in Xylia Validity Preserving Editing of XML Documents
dit in Xylia Validity Preerving diting of XML Document Pouria Shaker, Theodore S. Norvell, and Denni K. Peter Faculty of ngineering and Applied Science, Memorial Univerity of Newfoundland, St. John, NFLD,
More informationA DIVISIVE HIERARCHICAL CLUSTERING- BASED METHOD FOR INDEXING IMAGE INFORMATION
A DIVISIVE HIERARCHICAL CLUSTERING- BASED METHOD FOR INDEXING IMAGE INFORMATION ABSTRACT Najva Izadpanah Department of Computer Engineering, Ilamic Azad Univerity, Qazvin Branch, Qazvin, Iran In mot practical
More informationA Novel Feature Line Segment Approach for Pattern Classification
12th International Conference on Information Fuion Seattle, WA, USA, July 6-9, 2009 A Novel Feature Line Segment Approach for Pattern Claification Yi Yang Intitute of Integrated Automation Xi an Jiaotong
More informationA NEW APPROACH IN MEASURING OF THE ROUGHNESS FOR SURFACE CONSTITUTED WITH MACHINING PROCESS BY MATERIAL REMOVAL
International Journal of Mechanical and Production Engineering Reearch and Development (IJMPERD) ISSN 49-689 Vol. 3, Iue, Mar 3, 4-5 TJPRC Pvt. Ltd. A NEW APPROACH IN MEASURING OF THE ROUGHNESS FOR SURFACE
More informationKeywords Cloud Computing, Service Level Agreements (SLA), CloudSim, Monitoring & Controlling SLA Agent, JADE
Volume 5, Iue 8, Augut 2015 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Verification of Agent
More informationNew DSP to measure acoustic efficiency of road barriers. Part 2: Sound Insulation Index
New DSP to meaure acoutic efficiency of road barrier. Part 2: Sound Inulation Index LAMBERTO TRONCHIN 1, KRISTIAN FABBRI 1, JELENA VASILJEVIC 2 1 DIENCA CIARM, Univerity of Bologna, Italy 2 Univerity of
More informationBuilding a Compact On-line MRF Recognizer for Large Character Set using Structured Dictionary Representation and Vector Quantization Technique
202 International Conference on Frontier in Handwriting Recognition Building a Compact On-line MRF Recognizer for Large Character Set uing Structured Dictionary Repreentation and Vector Quantization Technique
More informationMinimum congestion spanning trees in bipartite and random graphs
Minimum congetion panning tree in bipartite and random graph M.I. Otrovkii Department of Mathematic and Computer Science St. John Univerity 8000 Utopia Parkway Queen, NY 11439, USA e-mail: otrovm@tjohn.edu
More informationHassan Ghaziri AUB, OSB Beirut, Lebanon Key words Competitive self-organizing maps, Meta-heuristics, Vehicle routing problem,
COMPETITIVE PROBABIISTIC SEF-ORGANIZING MAPS FOR ROUTING PROBEMS Haan Ghaziri AUB, OSB Beirut, ebanon ghaziri@aub.edu.lb Abtract In thi paper, we have applied the concept of the elf-organizing map (SOM)
More informationService and Network Management Interworking in Future Wireless Systems
Service and Network Management Interworking in Future Wirele Sytem V. Tountopoulo V. Stavroulaki P. Demeticha N. Mitrou and M. Theologou National Technical Univerity of Athen Department of Electrical Engineering
More informationLaboratory Exercise 2
Laoratory Exercie Numer and Diplay Thi i an exercie in deigning cominational circuit that can perform inary-to-decimal numer converion and inary-coded-decimal (BCD) addition. Part I We wih to diplay on
More informationOn successive packing approach to multidimensional (M-D) interleaving
On ucceive packing approach to multidimenional (M-D) interleaving Xi Min Zhang Yun Q. hi ankar Bau Abtract We propoe an interleaving cheme for multidimenional (M-D) interleaving. To achieved by uing a
More informationAalborg Universitet. Published in: Proceedings of the Working Conference on Advanced Visual Interfaces
Aalborg Univeritet Software-Baed Adjutment of Mobile Autotereocopic Graphic Uing Static Parallax Barrier Paprocki, Martin Marko; Krog, Kim Srirat; Kritofferen, Morten Bak; Krau, Martin Publihed in: Proceeding
More informationDrawing Lines in 2 Dimensions
Drawing Line in 2 Dimenion Drawing a traight line (or an arc) between two end point when one i limited to dicrete pixel require a bit of thought. Conider the following line uperimpoed on a 2 dimenional
More informationPerformance Evaluation of an Advanced Local Search Evolutionary Algorithm
Anne Auger and Nikolau Hanen Performance Evaluation of an Advanced Local Search Evolutionary Algorithm Proceeding of the IEEE Congre on Evolutionary Computation, CEC 2005 c IEEE Performance Evaluation
More informationA PROBABILISTIC NOTION OF CAMERA GEOMETRY: CALIBRATED VS. UNCALIBRATED
A PROBABILISTIC NOTION OF CAMERA GEOMETRY: CALIBRATED VS. UNCALIBRATED Jutin Domke and Yianni Aloimono Computational Viion Laboratory, Center for Automation Reearch Univerity of Maryland College Park,
More informationImplementation of a momentum-based distance metric for motion graphs. Student: Alessandro Di Domenico (st.no ), Supervisor: Nicolas Pronost
Implementation of a momentum-baed ditance metric for motion graph Student: Aleandro Di Domenico (t.no 3775682), Supervior: Nicola Pronot April 3, 2014 Abtract Thi report preent the procedure and reult
More informationLecture 14: Minimum Spanning Tree I
COMPSCI 0: Deign and Analyi of Algorithm October 4, 07 Lecture 4: Minimum Spanning Tree I Lecturer: Rong Ge Scribe: Fred Zhang Overview Thi lecture we finih our dicuion of the hortet path problem and introduce
More informationDomain-Specific Modeling for Rapid System-Wide Energy Estimation of Reconfigurable Architectures
Domain-Specific Modeling for Rapid Sytem-Wide Energy Etimation of Reconfigurable Architecture Seonil Choi 1,Ju-wookJang 2, Sumit Mohanty 1, Viktor K. Praanna 1 1 Dept. of Electrical Engg. 2 Dept. of Electronic
More informationKeywords: Defect detection, linear phased array transducer, parameter optimization, phased array ultrasonic B-mode imaging testing.
Send Order for Reprint to reprint@benthamcience.ae 488 The Open Automation and Control Sytem Journal, 2014, 6, 488-492 Open Acce Parameter Optimization of Linear Phaed Array Tranducer for Defect Detection
More informationApplication of Social Relation Graphs for Early Detection of Transient Spammers
Radolaw rendel and Henryk Krawczyk Application of Social Relation raph for Early Detection of Tranient Spammer RADOSLAW RENDEL and HENRYK KRAWCZYK Electronic, Telecommunication and Informatic Department
More informationCompressed Sensing Image Processing Based on Stagewise Orthogonal Matching Pursuit
Senor & randucer, Vol. 8, Iue 0, October 204, pp. 34-40 Senor & randucer 204 by IFSA Publihing, S. L. http://www.enorportal.com Compreed Sening Image Proceing Baed on Stagewie Orthogonal Matching Puruit
More informationLinkGuide: Towards a Better Collection of Hyperlinks in a Website Homepage
Proceeding of the World Congre on Engineering 2007 Vol I LinkGuide: Toward a Better Collection of Hyperlink in a Webite Homepage A. Ammari and V. Zharkova chool of Informatic, Univerity of Bradford anammari@bradford.ac.uk,
More informationKinematics Programming for Cooperating Robotic Systems
Kinematic Programming for Cooperating Robotic Sytem Critiane P. Tonetto, Carlo R. Rocha, Henrique Sima, Altamir Dia Federal Univerity of Santa Catarina, Mechanical Engineering Department, P.O. Box 476,
More informationThe Association of System Performance Professionals
The Aociation of Sytem Performance Profeional The Computer Meaurement Group, commonly called CMG, i a not for profit, worldwide organization of data proceing profeional committed to the meaurement and
More informationA reduced reference image quality metric based on feature fusion and neural networks
Univerity of Wollongong Reearch Online Faculty of Engineering and Information Science - Paper: Part A Faculty of Engineering and Information Science 2011 A reduced reference image quality metric baed on
More informationxy-monotone path existence queries in a rectilinear environment
CCCG 2012, Charlottetown, P.E.I., Augut 8 10, 2012 xy-monotone path exitence querie in a rectilinear environment Gregory Bint Anil Mahehwari Michiel Smid Abtract Given a planar environment coniting of
More informationA User-Attention Based Focus Detection Framework and Its Applications
A Uer-Attention Baed Focu Detection Framework and It Application Chia-Chiang Ho, Wen-Huang Cheng, Ting-Jian Pan, Ja-Ling Wu Communication and Multimedia Laboratory, Department of Computer Science and Information
More informationAnalysis of the results of analytical and simulation With the network model and dynamic priority Unchecked Buffer
International Reearch Journal of Applied and Baic Science 218 Available online at www.irjab.com ISSN 2251-838X / Vol, 12 (1): 49-53 Science Explorer Publication Analyi of the reult of analytical and imulation
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in VHL and implemented
More informationA Load Balancing Model based on Load-aware for Distributed Controllers. Fengjun Shang, Wenjuan Gong
4th International Conference on Machinery, Material and Computing Technology (ICMMCT 2016) A Load Balancing Model baed on Load-aware for Ditributed Controller Fengjun Shang, Wenjuan Gong College of Compute
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in Verilog and implemented
More informationMulti-Target Tracking In Clutter
Multi-Target Tracking In Clutter John N. Sander-Reed, Mary Jo Duncan, W.B. Boucher, W. Michael Dimmler, Shawn O Keefe ABSTRACT A high frame rate (0 Hz), multi-target, video tracker ha been developed and
More informationDynamically Reconfigurable Neuron Architecture for the Implementation of Self- Organizing Learning Array
Dynamically Reconfigurable Neuron Architecture for the Implementation of Self- Organizing Learning Array Januz A. Starzyk,Yongtao Guo, and Zhineng Zhu School of Electrical Engineering & Computer Science
More informationES205 Analysis and Design of Engineering Systems: Lab 1: An Introductory Tutorial: Getting Started with SIMULINK
ES05 Analyi and Deign of Engineering Sytem: Lab : An Introductory Tutorial: Getting Started with SIMULINK What i SIMULINK? SIMULINK i a oftware package for modeling, imulating, and analyzing dynamic ytem.
More informationIMPROVED JPEG DECOMPRESSION OF DOCUMENT IMAGES BASED ON IMAGE SEGMENTATION. Tak-Shing Wong, Charles A. Bouman, and Ilya Pollak
IMPROVED DECOMPRESSION OF DOCUMENT IMAGES BASED ON IMAGE SEGMENTATION Tak-Shing Wong, Charle A. Bouman, and Ilya Pollak School of Electrical and Computer Engineering Purdue Univerity ABSTRACT We propoe
More informationAnisotropic filtering on normal field and curvature tensor field using optimal estimation theory
Aniotropic filtering on normal field and curvature tenor field uing optimal etimation theory Min Liu Yuhen Liu and Karthik Ramani Purdue Univerity, Wet Lafayette, Indiana, USA Email: {liu66 liu28 ramani}@purdue.edu
More informationModeling of underwater vehicle s dynamics
Proceeding of the 11th WEA International Conference on YTEM, Agio Nikolao, Crete Iland, Greece, July 23-25, 2007 44 Modeling of underwater vehicle dynamic ANDRZEJ ZAK Department of Radiolocation and Hydrolocation
More information/06/$ IEEE 364
006 IEEE International ympoium on ignal Proceing and Information Technology oie Variance Etimation In ignal Proceing David Makovoz IPAC, California Intitute of Technology, MC-0, Paadena, CA, 95 davidm@ipac.caltech.edu;
More informationChapter 13 Non Sampling Errors
Chapter 13 Non Sampling Error It i a general aumption in the ampling theory that the true value of each unit in the population can be obtained and tabulated without any error. In practice, thi aumption
More informationA New Approach to Pipeline FFT Processor
A ew Approach to Pipeline FFT Proceor Shouheng He and Mat Torkelon Department of Applied Electronic, Lund Univerity S- Lund, SWEDE email: he@tde.lth.e; torkel@tde.lth.e Abtract A new VLSI architecture
More informationAn Intro to LP and the Simplex Algorithm. Primal Simplex
An Intro to LP and the Simplex Algorithm Primal Simplex Linear programming i contrained minimization of a linear objective over a olution pace defined by linear contraint: min cx Ax b l x u A i an m n
More information3-D Visualization of a Gene Regulatory Network: Stochastic Search for Layouts
3-D Viualization of a Gene Regulatory Network: Stochatic Search for Layout Naoki Hooyama Department of Electronic Engineering, Univerity of Tokyo, Japan hooyama@iba.k.u-tokyo.ac.jp Abtract- In recent year,
More informationPosition Control of Manipulator s Links Using Artificial Neural Network with Backpropagation Training Algorithm
Poition Control of Manipulator Link Uing Artificial Neural Network with Backpropagation Training Algorith Thiang, Handry Khowanto, Tan Hendra Sutanto Electrical Engineering Departent, Petra Chritian Univerity
More informationA Study of a Variable Compression Ratio and Displacement Mechanism Using Design of Experiments Methodology
A Study of a Variable Compreion Ratio and Diplacement Mechanim Uing Deign of Experiment Methodology Shugang Jiang, Michael H. Smith, Maanobu Takekohi Abtract Due to the ever increaing requirement for engine
More informationCENTER-POINT MODEL OF DEFORMABLE SURFACE
CENTER-POINT MODEL OF DEFORMABLE SURFACE Piotr M. Szczypinki Iintitute of Electronic, Technical Univerity of Lodz, Poland Abtract: Key word: Center-point model of deformable urface for egmentation of 3D
More informationTrainable Context Model for Multiscale Segmentation
Trainable Context Model for Multicale Segmentation Hui Cheng and Charle A. Bouman School of Electrical and Computer Engineering Purdue Univerity Wet Lafayette, IN 47907-1285 {hui, bouman}@ ecn.purdue.edu
More informationLearning-Based Quality Control for Cardiac MR Images
1 Learning-Baed Quality Control for Cardiac MR Image Giacomo Tarroni, Ozan Oktay, Wenjia Bai, Andrea Schuh, Hideaki Suzuki, Jonathan Paerat-Palmbach, Antonio de Marvao, Declan P. O Regan, Stuart Cook,
More informationDAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications
DAROS: Ditributed Uer-Server Aignment And Replication For Online Social Networking Application Thuan Duong-Ba School of EECS Oregon State Univerity Corvalli, OR 97330, USA Email: duongba@eec.oregontate.edu
More informationLocating Brain Tumors from MR Imagery Using Symmetry
ocating rain Tumor from M magery Uing Symmetry Nilanjan ay aidya Nath Saha and Matthew obert Graham rown {nray1 baidya mbrown}@cualbertaca epartment of Computing Science Univerity of lberta Canada btract
More informationSee chapter 8 in the textbook. Dr Muhammad Al Salamah, Industrial Engineering, KFUPM
Goal programming Objective of the topic: Indentify indutrial baed ituation where two or more objective function are required. Write a multi objective function model dla a goal LP Ue weighting um and preemptive
More informationMulticlass Road Sign Detection using Multiplicative Kernel
Proceeding of the Croatian Computer Viion Workhop, Year 1 Multicla Road Sign Detection uing Multiplicative Kernel Valentina Zadrija Mireo d. d. Zagreb, Croatia valentina.zadrija@mireo.hr Siniša Šegvić
More informationOperational Semantics Class notes for a lecture given by Mooly Sagiv Tel Aviv University 24/5/2007 By Roy Ganor and Uri Juhasz
Operational emantic Page Operational emantic Cla note for a lecture given by Mooly agiv Tel Aviv Univerity 4/5/7 By Roy Ganor and Uri Juhaz Reference emantic with Application, H. Nielon and F. Nielon,
More informationAnalyzing Hydra Historical Statistics Part 2
Analyzing Hydra Hitorical Statitic Part Fabio Maimo Ottaviani EPV Technologie White paper 5 hnode HSM Hitorical Record The hnode i the hierarchical data torage management node and ha to perform all the
More informationA New Approach for In-Vehicle Camera Traffic Sign Detection and Recognition.
A New Approach for In-Vehicle Camera Traffic Sign Detection and Recognition. Andrzej Ruta, Yongmin Li School of Information Sytem, Computing & Mathematic Brunel Univerity Uxbridge, Middleex UB8 3PH, United
More informationFocused Video Estimation from Defocused Video Sequences
Focued Video Etimation from Defocued Video Sequence Junlan Yang a, Dan Schonfeld a and Magdi Mohamed b a Multimedia Communication Lab, ECE Dept., Univerity of Illinoi, Chicago, IL b Phyical Realization
More informationComputer Arithmetic Homework Solutions. 1 An adder for graphics. 2 Partitioned adder. 3 HDL implementation of a partitioned adder
Computer Arithmetic Homework 3 2016 2017 Solution 1 An adder for graphic In a normal ripple carry addition of two poitive number, the carry i the ignal for a reult exceeding the maximum. We ue thi ignal
More informationPARALLEL knn ON GPU ARCHITECTURE USING OpenCL
PARALLEL knn ON GPU ARCHITECTURE USING OpenCL V.B.Nikam 1, B.B.Mehram 2 1 Aociate Profeor, Department of Computer Engineering and Information Technology, Jijabai Technological Intitute, Matunga, Mumbai,
More informationGray-level histogram. Intensity (grey-level) transformation, or mapping. Use of intensity transformations:
Faculty of Informatic Eötvö Loránd Univerity Budapet, Hungary Lecture : Intenity Tranformation Image enhancement by point proceing Spatial domain and frequency domain method Baic Algorithm for Digital
More informationCS201: Data Structures and Algorithms. Assignment 2. Version 1d
CS201: Data Structure and Algorithm Aignment 2 Introduction Verion 1d You will compare the performance of green binary earch tree veru red-black tree by reading in a corpu of text, toring the word and
More informationA Multi-objective Genetic Algorithm for Reliability Optimization Problem
International Journal of Performability Engineering, Vol. 5, No. 3, April 2009, pp. 227-234. RAMS Conultant Printed in India A Multi-objective Genetic Algorithm for Reliability Optimization Problem AMAR
More informationA SIMPLE IMPERATIVE LANGUAGE THE STORE FUNCTION NON-TERMINATING COMMANDS
A SIMPLE IMPERATIVE LANGUAGE Eventually we will preent the emantic of a full-blown language, with declaration, type and looping. However, there are many complication, o we will build up lowly. Our firt
More informationShortest Paths Problem. CS 362, Lecture 20. Today s Outline. Negative Weights
Shortet Path Problem CS 6, Lecture Jared Saia Univerity of New Mexico Another intereting problem for graph i that of finding hortet path Aume we are given a weighted directed graph G = (V, E) with two
More informationKey Terms - MinMin, MaxMin, Sufferage, Task Scheduling, Standard Deviation, Load Balancing.
Volume 3, Iue 11, November 2013 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Tak Aignment in
More informationDelaunay Triangulation: Incremental Construction
Chapter 6 Delaunay Triangulation: Incremental Contruction In the lat lecture, we have learned about the Lawon ip algorithm that compute a Delaunay triangulation of a given n-point et P R 2 with O(n 2 )
More informationKS3 Maths Assessment Objectives
KS3 Math Aement Objective Tranition Stage 9 Ratio & Proportion Probabilit y & Statitic Appreciate the infinite nature of the et of integer, real and rational number Can interpret fraction and percentage
More informationComputer Graphics. Transformation
(SBE 36) Dr. Aman Eldeib Spring 2 SBE 36 i a fundamental corner tone of computer graphic and i a central to OpenGL a well a mot other graphic tem.(2d and 3D ) Given an object, tranformation i to change
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier a a The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each b c circuit will be decribed in Verilog
More informationThe LLAhclust Package
Verion 0.2-1 Date 2007-31-08 The LLAhclut Package September 1, 2007 Title Hierarchical clutering of variable or object baed on the likelihood linkage analyi method Author Ivan Kojadinovic, Iraël-Céar Lerman,
More informationWeb Science and additionality
Admin tuff... Lecture 1: EITN01 Web Intelligence and Information Retrieval Meage, lide, handout, lab manual and link: http://www.eit.lth.e/coure/eitn01 Contact: Ander Ardö, Ander.Ardo@eit.lth.e, room:
More informationA System Dynamics Model for Transient Availability Modeling of Repairable Redundant Systems
International Journal of Performability Engineering Vol., No. 3, May 05, pp. 03-. RAMS Conultant Printed in India A Sytem Dynamic Model for Tranient Availability Modeling of Repairable Redundant Sytem
More informationRefining SIRAP with a Dedicated Resource Ceiling for Self-Blocking
Refining SIRAP with a Dedicated Reource Ceiling for Self-Blocking Mori Behnam, Thoma Nolte Mälardalen Real-Time Reearch Centre P.O. Box 883, SE-721 23 Väterå, Sweden {mori.behnam,thoma.nolte}@mdh.e ABSTRACT
More informationData Mining with Linguistic Thresholds
Int. J. Contemp. Math. Science, Vol. 7, 22, no. 35, 7-725 Data Mining with Linguitic Threhold Tzung-Pei Hong Department of Electrical Engineering National Univerity of Kaohiung Kaohiung, Taiwan, R.O.C.
More informationarxiv: v1 [cs.ar] 31 Aug 2017
Advanced Datapath Synthei uing Graph Iomorphim Cunxi Yu, Mihir Choudhury 2, Andrew Sullivan 2, Maciej Cieielki ECE Department, Univerity o Maachuett, Amhert IBM T.J Waton Reearch Center 2 ycunxi@uma.edu,
More informationToday s Outline. CS 561, Lecture 23. Negative Weights. Shortest Paths Problem. The presence of a negative cycle might mean that there is
Today Outline CS 56, Lecture Jared Saia Univerity of New Mexico The path that can be trodden i not the enduring and unchanging Path. The name that can be named i not the enduring and unchanging Name. -
More informationUC Berkeley International Conference on GIScience Short Paper Proceedings
UC Berkeley International Conference on GIScience Short Paper Proceeding Title A novel method for probabilitic coverage etimation of enor network baed on 3D vector repreentation in complex urban environment
More information1 The secretary problem
Thi i new material: if you ee error, pleae email jtyu at tanford dot edu 1 The ecretary problem We will tart by analyzing the expected runtime of an algorithm, a you will be expected to do on your homework.
More informationIMPLEMENTATION OF CHORD LENGTH SAMPLING FOR TRANSPORT THROUGH A BINARY STOCHASTIC MIXTURE
Nuclear Mathematical and Computational Science: A Century in Review, A Century Anew Gatlinburg, Tenneee, April 6-, 003, on CD-ROM, American Nuclear Society, LaGrange Park, IL (003) IMPLEMENTATION OF CHORD
More information[N309] Feedforward Active Noise Control Systems with Online Secondary Path Modeling. Muhammad Tahir Akhtar, Masahide Abe, and Masayuki Kawamata
he 32nd International Congre and Expoition on Noie Control Engineering Jeju International Convention Center, Seogwipo, Korea, Augut 25-28, 2003 [N309] Feedforward Active Noie Control Sytem with Online
More informationE-APPLAB #1
E-APPLAB-93-069850 #1 Ultrafat tomography experiment etup at D-1 Beamline at CHESS The experiment etup conit of three major part: x-ray ource, injection chambe and detecto a hown chematically in Fig. EPAPS1a.
More informationReporting Checklist for Nature Neuroscience
Correponding Author: Manucript Number: Manucript Type: Jeremy Elman NNBC48172A Brief Communication Reporting Checklit for Nature Neurocience # Figure: 2 # Figure: 5 # Table: 6 # Video: 0 Thi checklit i
More informationMirror shape recovery from image curves and intrinsic parameters: Rotationally symmetric and conic mirrors. Abstract. 2. Mirror shape recovery
Mirror hape recovery from image curve and intrinic parameter: Rotationally ymmetric and conic mirror Nuno Gonçalve and Helder Araújo Λ Intitute of Sytem and Robotic Univerity of Coimbra Pinhal de Marroco
More information3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES
MAKARA, TEKNOLOGI, VOL. 9, NO., APRIL 5: 3-35 3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES Mochammad Zulianyah Informatic Engineering, Faculty of Engineering, ARS International Univerity,
More informationTracking Articulator Movements Using Orientation Measurements
Tracking Articulator Movement Uing Orientation Meaurement An Ji, Michael T. Johnon, and Jeffrey Berry Marquette Univerity Department of Electrical and Computer Engineering Speech and Signal Proceing Laboratory
More informationANALYSIS OF PILE DRIVING IN VERTICAL AND HORIZONTAL DIRECTIONS USING A HYBRID MODEL
ANALYSIS OF PILE DRIVING IN VERTICAL AND HORIZONTAL DIRECTIONS USING A HYBRID MODEL TATSUNORI MATSUMOTO i) PASTSAKORN KITIYODOM ii) EIJI KOJIMA iii) HIROMICHI KUMAGAI iv) SATOSHI NISHIMOTO v) and KOUICHI
More information