Pictures at an Exhibition
|
|
- Elfreda Leonard
- 6 years ago
- Views:
Transcription
1 1 Pctures at an Exhbton Stephane Kwan and Karen Zhu Department of Electrcal Engneerng Stanford Unversty, Stanford, CA 9405 Emal: {skwan1, Abstract An mage processng algorthm s desgned and mplemented to dentfy pctures at an exhbton. The algorthm frst performs segmentaton to obtan the pantng n the nput mage by lookng at both the lumnance and chromnance components of the nput mage. The lumnance ratos and color hstograms are computed to dentfy the pantng accordng to a set of pre-calculated statstcs. The algorthm s able to dentfy mages taken from dfferent angle and dfferent llumnaton condtons. The algorthm correctly dentfes all mages n a gven tranng set. The average speed of the algorthm s 20-0 seconds per nput mage. A. TRODUCTO DVACES n moble magng technology has enabled many nterestng applcatons of hand-held moble devces. One example s moble augmented realty. By amng a hand-held devce at an obect of nterest, the user can get nformaton regardng that obect from a remote database. Ths applcaton allows hand-held devces to serve as electronc museum gudes. For example, the user can use a camera phone to take a snapshot of a pantng of nterest, and lsten to commentares about the pantng. One of the crtcal components of such applcaton s the mage processng algorthm used to recognze the pantng from the pcture taken. How the snapshots of the pantngs look depend on camera angle, llumnaton and many other factors. Therefore, a combnaton of dfferent mage processng technques s requred to guarantee successful recognton of the pantngs. n ths proect, we developed a fast and robust algorthm for recognzng pantngs n the European Gallery of the Cantor Arts Center. The nput of our system s an RGB mage of a pantng from the European Gallery, and the output s the ttle of the pantng. We are also gven a set of tranng mages, so that we can tran our algorthm to set up approprate parameters and threshold before actual testng. We also tested the segmentaton part of our algorthm wth other test mages that we generated.. MAGE PROCESSG ALGORTHM Our algorthm conssts of three man stages. A) Segmentaton of nput RGB mage. B) Extracton of lumnance and color nformaton of the pantng. C) dentfcaton of Pantng. We frst segment the nput JPEG mage to obtan the part that only contans the pantng. We then dvde the lumnance component of the nput mage nto four quadrants, and obtan statstcs of the spatal dstrbuton of the lumnance component of the nput mage. We also computed the color hstograms of the R, G and B color components. Fnally, from the nformaton obtaned from the mage, namely the heght to wdth rato, lumnance statstcs and color hstograms, we fnd the best match from the pre-calculated pantng statstcs n our database, and dentfy the nput pantng to be the best matched pantng n the database. A. Segmentaton The obectve of the segmentaton process s to dentfy the part of the pcture that contans the pantng. We try to create a bnary mask of the nput mage, where the pantng regon s labeled as 1, and the other regon labeled as 0. Among the pantngs that the proect tres to dentfy, the pantng frames are black, brown or golden. Black frames have lumnance values lower than the overall mean of the lumnance component of the mage, whle brown and golden frames have Cb values lower than the overall mean of the Cb component, but Cr values hgher than the overall mean of the Cr component of the mage. Usng these propertes, we transform the RGB nput mage to the YCrCb doman, and bnarze the Y, Cr and Cb components of the mage, settng potental frame regons to 1, and non-frame regons to 0. From these three resultng bnary mages, we create two temporary bnary masks, one from the bnarzed lumnance mage (LuMas, and the other from combnng the Cr and Cb bnary mages (CrCbMas. The choce of one mask over the other s hghly dependent on the mage under test. Sometmes, the lumnance component dentfes the pantng regon more accurately, whle other tmes, the Cr and Cb components dentfy the pantng regon better. Fg. 2 shows the LuMask and Fg. shows the CrCbMask for one of the tranng mages. To make sure the entre pantng, but not only the frame are labeled as 1, we fll up holes n connected regons of 1s n the two masks. Then, we label the connected regons n the masks, and dentfy the largest regon. For each of the masks, base on the crtera that the maorty of the dentfed regon has to be labeled as 1 n the mask, we dentfy the largest regon that fulflls the crtera to be the pantng regon. We then set the pxels n the respectve dentfed pantng regons to 1, and other regon to 0. As the next step, we choose to use one of the masks by
2 2 determnng whether LuMask or CrCbMask gves a better estmate of the pantng regon base on crterons lsted below: 1) We know that the pantng has to be located at the center of the nput mage. Therefore, f one of the masks does not contan the center pxel, then the other mask s chosen. 2) Snce the pantng cannot resde at the corner of the nput mage, f at least one of the corners of one of the masks s labeled as part of the pantng, the other mask s used. ) f the heght of LuMask s shorter than CrCbMask, we choose the LuMask. The ratonal behnd s that the CrCbMask s usually shorter than the LuMask snce the LuMask sometmes ncludes shadows. However, f the CrCbMask s longer, ths means that t captured a lot of unnecessary parts ether at the top or bottom of the pantng, and therefore we do not want to use ths mask. 4) f the overlappng area of the dentfed pantng regons n the two masks s greater than 90% of the total dentfed pantng regon, then we choose the mask that gves a smaller panng regon. Snce the two masks are very smlar, and t s lkely that the smaller mask ncludes less unwanted regons besdes the pantng. However, f the overlappng area s less than 90%, then most lkely the smaller mask faled to capture the entre pantng. Thus, the larger mask s chosen. After choosng the mask, the mask s further refned to elmnate unwanted regons at the sdes of the dentfed pantng area. Fg. 4 shows the fnal mask of one of our tranng mages. The heght to wdth rato (HWR) of the pantng s also recorded at the end of ths process. Fnally, we overlay the mask wth the orgnal RGB mage, and extract the segmented pantng from the RGB mage. From ths pont onwards, we only work wth the segmented part of the mage. Ths reduces the sze of the mage we have to work wth, and speeds up the processng tme requred. Fg. 5 shows an example of a segmented pantng. Fg. 2. LuMask of The Panter. Fg.. CrCbMask of The Panter. Fg. 4. Fnal mask of The Panter. Fg. 1. Orgnal mage of The Panter.
3 TL TR BL BR Fg. 5. Fnal segmented mage of The Panter B. Extracton of Lumnance and Color nformaton The goal of extractng lumnance and color nformaton from the pantng s to collect relable statstcs about the pantng, so that t can be compared to the pre-calculated statstcs, and dentfy the nput pantng. The man reason for extractng lumnance and color nformaton from the pantng s that n a museum settng, lghtng s controlled. Therefore, by strategcally processng lumnance and color statstcs, varaton of these statstcs of the same pantng due to factors such as dfferent camera angles and dstance from pantng wll be smaller than varaton between dfferent pantngs. Hence we wll be able to dentfy the correct pantng usng these statstcs. B1. Lumnance Rato We separate the lumnance component of the segmented mage nto four quadrants: top left (TL), top rght (TR), bottom left (BL), and bottom rght (BR) as shown n Fg.6. Then, we calculate sx lumnance ratos of the lumnance mage: Fg. 6. llustraton of the four quadrants for lumnance rato calculaton. 1) mean(tl+tr) /mean (BL+BR) (TBR) 2) mean(tl + BL)/mean(TR + LR) (LRR) ) mean(tl)/mean(entre mage) (Q1R) 4) mean(tr)/mean(entre mage) (Q2R) 5) mean(bl)/mean(entre mage) (QR) 6) mean(br)/mean(entre mage) (Q4R) Although the absolute lumnance values of the overall segmented mage may vary sgnfcantly dependng on how the pcture was taken, provded that the pcture s not taken at an acute angle, the sx ratos we collect wll reman smlar snce lghtng s controlled. For nstance, the TBR of a pantng that has a brght top and dark bottom wll always be greater than one no matter how the pcture s taken. These ratos gve spatal nformaton about the pantng. B2. Color Hstogram Color n an mage convey a lot of nformaton and s often used to ad computer vson applcatons. The color hstogram method has been frst proposed by Swan and Ballard n [1]. Obects can be dentfed by matchng the color hstograms of each of the color channels between dfferent mages. The drawback of ths approach s that any slght varaton n lghtng condton can sgnfcantly nfluence the shape of the color hstogram and weaken ts robustness [2]. The Comprehensve Color mage ormalzaton method s therefore suggested by Fnlayson et al. n [] to dscount for lghtng geometry and llumnant color together at the same tme. Ths method utlzes an teratve approach, normalzng
4 4 lghtng geometry n one step and llumnant color n another, untl each color channel stablzes n ts values. ( ),, k 1, k R (1) C ),, ( (2) k 0 k, n equaton (1) and (2), s the * mage matrx of red, green, and blue values, wth each color channel havng values. R() s the row-normalzaton step to dscount for lghtng geometry. C() s the column-normalzaton step to dscount for llumnant color. t has been proven that ths process always converges, the convergent mage s unque and the convergence s very fast, n only four to fve teratons. [] n our mplementaton, we frst apply Comprehensve Color ormalzaton to the segmented mages by performng fve teratons of a two step process. n step 1, we normalze each pxel value for lghtng geometry by applyng equaton (1). n step 2, we normalze each pxel value for llumnant color by applyng equaton (2). Ths normalzaton process put the pxel values n the range of 0 to 1. Step1: r, g, b,, r g b r g b r g b Step 2: r, g, b r r 1, r r mean( R) 1 r, g, b,, g g, g g meang ( ) b 1 b b b mean( B) After normalzaton, we compute the color hstogram for each of the color channels. The hstograms are generated by usng 256 bns of equal wdth n the range of 0 to 1. Fnally, we normalze the hstogram by dvdng each bn n the hstogram wth the total number of pxels n the segmented mage to account for dfferent szes of mages. Three color hstograms are saved for each segmented mage for dentfcaton of the pantng. C. dentfcaton of Pantng After collectng all the necessary statstcs from the prevous stage, we proceed to comparng these data wth statstcs we pre-calculated about the pantngs we have to dentfy. n order to reduce the number of false postves, the algorthm frst attempts to elmnate as many mprobable pantngs as possble before choosng the most probable pantng n the last stage of the dentfcaton process. C1. Pre-Calculaton of Reference Lumnance Ratos and Color Hstograms from Tranng Set Reference lumnance ratos and color hstograms for each pantng are calculated and stored n our database. We compare the lumnance ratos and color hstograms of our nput test mage to these reference data to determne whch pantng the nput mage belongs to. To get the sx reference lumnance ratos and three reference color hstograms for each pantng, frst we run our segmentaton algorthm on each of the 99 mages n the tranng set, and calculate the lumnance ratos and color hstograms for each of these mages. Then, we group the mages accordng to the pantng they belong to (e. groups, each wth three mages), and take the average lumnance ratos and color hstograms of the three mages n the group to be the reference lumnance ratos and hstograms for the pantng. C2. Pre-Calculaton of Lumnance Ratos Thresholds for dentfyng Pantngs To elmnate pantngs that are defnte msmatches wth our nput test mage n the lumnance rato test, we have to set thresholds that represent the maxmum varatons allowed for lumnance ratos between pctures of the same pantng. n total, we need sx threshold values. To fnd the thresholds, we frst dvde our tranng set (99 mages) nto three groups, where each contans mages, wth one mage from each pantng. We then do three teratons of tranng and testng as descrbed below. n each teraton, we use two groups of mages as our tranng set, and the last group as our test set. The three teratons are 1. Tranng = Group 1,2, Testng = Group 2. Tranng = Group 1,, Testng = Group 2. Tranng = Group 2,, Testng = Group 1 For each teraton, we frst create our reference lumnance ratos R LumnanceRato usng the same method n C1. However, nstead of takng the average of three mages, we only take the average of the two mages n the tranng set for ths current teraton. Then, we compare the lumnance ratos of mage () n our test set wth the correspondng reference statstcs R LumnanceRato () of the same pantng we obtaned n ths teraton usng the equatons (), Test LuRatoVaraton(, Lu mn ancerato R (, R Lu mn ancerato Lu mn ancerato (, where {1...}, representng the pantng number, and k {1...6}, representng one of the sx lumnance ratos. We then record the maxmum varaton for each lumnance rato among the pantngs n each teraton. (, ()
5 5 After the three teratons, we get three sets of maxmum lumnance ratos varatons. For each lumnance rato, we then take the maxmum value of the three sets, further ncrease these maxmum values by a small amount, and use these numbers as the threshold values that we need. The reason for separatng our ntal tranng set nto three groups and obtan thresholds as descrbed above s two folded. Frst, f we use all three mages of the same pantng to set our reference, and obtan the thresholds by calculatng the maxmum varatons of the same three mages wth the reference, these thresholds are not lkely to be robust. The statstcs of our test mages are part of the reference. By separatng the tranng set and test set, statstcs of the reference and the test data are ndependent, thus the thresholds set usng ths method are lkely to be more robust. Second, varatons observed by averagng two pctures and testng on the thrd pcture are lkely to be larger than varatons observed by averagng three pctures and testng wth a forth one. Therefore, by settng the thresholds to be the maxmum varatons from the reference found by usng two mages per pantng, the thresholds should be large enough to ncorporate varatons from formng the reference usng three mages for each pantng, and testng wth a forth one. C. dentfyng the Pantng As a frst step of elmnatng unlkely pantngs, we look at the heght to wdth rato (HWR) of the nput pantng. f the HWR of our nput pantng s less than 1, then we elmnate all the pantngs n the tranng set that have HWR greater than 1. On the other hand, f the HWR s greater than 1.8, then we elmnate all the pantngs that have HWR less than 1. Unlke the prevous case where the HWR threshold s 1, we set the HWR threshold to be 1.8 n ths case to avod false postve conclusons. When a pcture of a pantng s taken at an angle, t s possble that the heght of the pantng n the segmented pcture s greater then ts wdth, although the wdth of the pantng s actually greater than ts heght n realty. Under normal vewng condtons of pantngs n a museum, ths dstorton caused by vewng angle only happens when the length of heght s relatvely close to the length of wdth. Therefore, f HWR s greater than 1.8, we can be sure that the pantng under test must have ts heght greater than ts wdth. n the second step of the dentfcaton algorthm, we calculate the varaton of the 6 lumnance ratos of the nput pantng from the pre-calculated reference lumnance ratos of the pantngs. Of the possble canddate pantngs, we only perform the sx lumnance ratos varaton calculaton f they have not been elmnated n the frst step. The lumnance ratos varatons are calculated usng equaton (), and the results are compared to the pre-set threshold. We elmnate the pantng f more than one of these lumnance ratos exceeds ther correspondng thresholds. For pantngs that are not elmnated, we store the mean of the resultng lumnance ratos varatons, and call t LuVar. LuVar s computed usng equaton (4), LuVar( ) mean( LuRatoVaraton(, Threshold( ) (4) where {1...}, representng the reference pantng number, and k {1...6}, representng one of the 6 lumnance ratos. The larger the LuVar s, the better match the nput test mage s to the reference pantng. ote that we only nclude LuRatoVaraton(, that s smaller than the threshold. So whle there are sx lumnance ratos, f one of the ratos s above the threshold, then we only take the average of the other fve lumnance rato varatons. n the thrd step, we compare the color hstograms of the nput pantng wth the reference color hstograms of the left over canddate pantngs. The varaton of the color hstograms of the nput pantng from the reference pantng s calculated usng equaton (5), ColorHstogramVaraton() meantestred _ hstogram( ) RRED _ hstogram( ) + meantestgree _ hstogram( ) RGREE _ hstogram( ) + meantest BLUE _ hstogram ( ) RBLUE _ hstogram ( ) (5) where {1...}, representng the reference pantng number. The smaller the ColorHstogramVaraton, the better match the nput test mage s to the reference pantng. Fnally, from the remanng reference pantng choces, we form a comparson metrc by dvdng LuVar values wth ColorHstograVaraton values. LuVar( ) ComparsonMetrc( ) (6) ColorHstogramVaraton( ) We dentfy the nput test mage as the reference pantng that gves the largest ComparsonMetrc value.. RESULTS We ran our algorthm on the gven 99 tranng mages, and all of them were recognzed accurately. The average processng tme for each nput mage s 20-0 seconds. V. COCLUSO We have desgned and mplemented a fast and robust algorthm for gallery pantng dentfcaton. The robustness s acheved by a combnaton of dfferent mage processng methods. By takng nto account both lumnance and chromnance nformaton of the nput mage n creatng the mask, segmentaton can successfully elmnate unwanted mage areas. Heght to wdth rato, lumnance rato, and color hstogram each focuses on a dfferent characterstc of a partcular pantng. Together they extract crtcal nformaton from the pantngs, and dfferentate them effectvely. The speed of our algorthm s due to ts smplcty. Each of the mage processng method s very smple and requres relatvely lttle computaton power.
6 6 V. DVSO OF WORK The followng s a rough breakdown of work for the proect: Stephane: - Segmentaton Algorthm - Lumnance Rato calculaton - dentfcaton of Pantng - Report Karen: - Color Hstogram calculaton - Generate new test set and testng - Report V. REFERECES [1] M. J. Swan and D. H. Ballard, Color ndexng, nternatonal Journal of Computer Vson, 7(1):11 2, [2] B. Schele and J. L. Crowley, Recognton wthout Correspondence usng Multdmensonal Receptve Feld Hstograms, nternatonal Journal of Computer Vson, 6(1): 1 5, [] G. D. Fnlayson, B. Schele and L. J. Crowley, Comprehensve Colour mage ormalzaton, ECCV 98 Ffth European Conference on Computer Vson, Volume : , [4] G. D. Fnlayson, and G. Y. Tan, Perfect Colour Constancy vs Colour ormalzaton for Obect Recognton, SPE, Vol. 826, 1999.
A Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationFEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur
FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationShape Representation Robust to the Sketching Order Using Distance Map and Direction Histogram
Shape Representaton Robust to the Sketchng Order Usng Dstance Map and Drecton Hstogram Department of Computer Scence Yonse Unversty Kwon Yun CONTENTS Revew Topc Proposed Method System Overvew Sketch Normalzaton
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationCorner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity
Journal of Sgnal and Informaton Processng, 013, 4, 114-119 do:10.436/jsp.013.43b00 Publshed Onlne August 013 (http://www.scrp.org/journal/jsp) Corner-Based Image Algnment usng Pyramd Structure wth Gradent
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationDetection of an Object by using Principal Component Analysis
Detecton of an Object by usng Prncpal Component Analyss 1. G. Nagaven, 2. Dr. T. Sreenvasulu Reddy 1. M.Tech, Department of EEE, SVUCE, Trupath, Inda. 2. Assoc. Professor, Department of ECE, SVUCE, Trupath,
More informationTN348: Openlab Module - Colocalization
TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages
More informationA Novel Adaptive Descriptor Algorithm for Ternary Pattern Textures
A Novel Adaptve Descrptor Algorthm for Ternary Pattern Textures Fahuan Hu 1,2, Guopng Lu 1 *, Zengwen Dong 1 1.School of Mechancal & Electrcal Engneerng, Nanchang Unversty, Nanchang, 330031, Chna; 2. School
More informationA Clustering Algorithm for Key Frame Extraction Based on Density Peak
Journal of Computer and Communcatons, 2018, 6, 118-128 http://www.scrp.org/ournal/cc ISSN Onlne: 2327-5227 ISSN Prnt: 2327-5219 A Clusterng Algorthm for Key Frame Extracton Based on Densty Peak Hong Zhao
More informationAn Image Fusion Approach Based on Segmentation Region
Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua
More informationA PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION
1 THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Seres A, OF THE ROMANIAN ACADEMY Volume 4, Number 2/2003, pp.000-000 A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION Tudor BARBU Insttute
More informationMULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION
MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and
More informationImage Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline
mage Vsualzaton mage Vsualzaton mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and
More informationSkew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach
Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationTsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance
Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationFace Detection with Deep Learning
Face Detecton wth Deep Learnng Yu Shen Yus122@ucsd.edu A13227146 Kuan-We Chen kuc010@ucsd.edu A99045121 Yzhou Hao y3hao@ucsd.edu A98017773 Mn Hsuan Wu mhwu@ucsd.edu A92424998 Abstract The project here
More informationLocal Quaternary Patterns and Feature Local Quaternary Patterns
Local Quaternary Patterns and Feature Local Quaternary Patterns Jayu Gu and Chengjun Lu The Department of Computer Scence, New Jersey Insttute of Technology, Newark, NJ 0102, USA Abstract - Ths paper presents
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationFeature Selection for Target Detection in SAR Images
Feature Selecton for Detecton n SAR Images Br Bhanu, Yngqang Ln and Shqn Wang Center for Research n Intellgent Systems Unversty of Calforna, Rversde, CA 95, USA Abstract A genetc algorthm (GA) approach
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationParallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016)
Technsche Unverstät München WSe 6/7 Insttut für Informatk Prof. Dr. Thomas Huckle Dpl.-Math. Benjamn Uekermann Parallel Numercs Exercse : Prevous Exam Questons Precondtonng & Iteratve Solvers (From 6)
More informationRecognizing Faces. Outline
Recognzng Faces Drk Colbry Outlne Introducton and Motvaton Defnng a feature vector Prncpal Component Analyss Lnear Dscrmnate Analyss !"" #$""% http://www.nfotech.oulu.f/annual/2004 + &'()*) '+)* 2 ! &
More informationA MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS
Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung
More informationProper Choice of Data Used for the Estimation of Datum Transformation Parameters
Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and
More informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More informationANALYSIS OF ADAPTIF LOCAL REGION IMPLEMENTATION ON LOCAL THRESHOLDING METHOD
Nusantara Journal of Computers and ts Applcatons ANALYSIS F ADAPTIF LCAL REGIN IMPLEMENTATIN N LCAL THRESHLDING METHD I Gust Agung Socrates Ad Guna 1), Hendra Maulana 2), Agus Zanal Arfn 3) and Dn Adn
More informationHuman Face Recognition Using Generalized. Kernel Fisher Discriminant
Human Face Recognton Usng Generalzed Kernel Fsher Dscrmnant ng-yu Sun,2 De-Shuang Huang Ln Guo. Insttute of Intellgent Machnes, Chnese Academy of Scences, P.O.ox 30, Hefe, Anhu, Chna. 2. Department of
More informationA Multi-step Strategy for Shape Similarity Search In Kamon Image Database
A Mult-step Strategy for Shape Smlarty Search In Kamon Image Database Paul W.H. Kwan, Kazuo Torach 2, Kesuke Kameyama 2, Junbn Gao 3, Nobuyuk Otsu 4 School of Mathematcs, Statstcs and Computer Scence,
More informationCircuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL)
Crcut Analyss I (ENG 405) Chapter Method of Analyss Nodal(KCL) and Mesh(KVL) Nodal Analyss If nstead of focusng on the oltages of the crcut elements, one looks at the oltages at the nodes of the crcut,
More informationUser Authentication Based On Behavioral Mouse Dynamics Biometrics
User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA
More informationAUTOMATED personal identification using biometrics
A 3D Feature Descrptor Recovered from a Sngle 2D Palmprnt Image Qan Zheng,2, Ajay Kumar, and Gang Pan 2 Abstract Desgn and development of effcent and accurate feature descrptors s crtcal for the success
More informationReducing Frame Rate for Object Tracking
Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg
More informationAn efficient method to build panoramic image mosaics
An effcent method to buld panoramc mage mosacs Pattern Recognton Letters vol. 4 003 Dae-Hyun Km Yong-In Yoon Jong-Soo Cho School of Electrcal Engneerng and Computer Scence Kyungpook Natonal Unv. Abstract
More informationFuzzy C-Means Initialized by Fixed Threshold Clustering for Improving Image Retrieval
Fuzzy -Means Intalzed by Fxed Threshold lusterng for Improvng Image Retreval NAWARA HANSIRI, SIRIPORN SUPRATID,HOM KIMPAN 3 Faculty of Informaton Technology Rangst Unversty Muang-Ake, Paholyotn Road, Patumtan,
More informationAccounting for the Use of Different Length Scale Factors in x, y and z Directions
1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,
More informationSix-Band HDTV Camera System for Color Reproduction Based on Spectral Information
IS&T's 23 PICS Conference Sx-Band HDTV Camera System for Color Reproducton Based on Spectral Informaton Kenro Ohsawa )4), Hroyuk Fukuda ), Takeyuk Ajto 2),Yasuhro Komya 2), Hdeak Hanesh 3), Masahro Yamaguch
More informationCOMPLEX WAVELET TRANSFORM-BASED COLOR INDEXING FOR CONTENT-BASED IMAGE RETRIEVAL
COMPLEX WAVELET TRANSFORM-BASED COLOR INDEXING FOR CONTENT-BASED IMAGE RETRIEVAL Nader Safavan and Shohreh Kasae Department of Computer Engneerng Sharf Unversty of Technology Tehran, Iran skasae@sharf.edu
More informationHigh Payload Reversible Data Hiding Scheme Using Difference Segmentation and Histogram Shifting
JOURNAL OF ELECTRONIC SCIENCE AND TECHNOLOGY, VOL. 11, NO. 1, MARCH 2013 9 Hgh Payload Reversble Data Hdng Scheme Usng Dfference Segmentaton and Hstogram Shftng Yung-Chen Chou and Huang-Chng L Abstract
More informationA Computer Vision System for Automated Container Code Recognition
A Computer Vson System for Automated Contaner Code Recognton Hsn-Chen Chen, Chh-Ka Chen, Fu-Yu Hsu, Yu-San Ln, Yu-Te Wu, Yung-Nen Sun * Abstract Contaner code examnaton s an essental step n the contaner
More informationResearch and Application of Fingerprint Recognition Based on MATLAB
Send Orders for Reprnts to reprnts@benthamscence.ae The Open Automaton and Control Systems Journal, 205, 7, 07-07 Open Access Research and Applcaton of Fngerprnt Recognton Based on MATLAB Nng Lu* Department
More information3D Face Reconstruction With Local Feature Refinement. Abstract
, pp.6-74 http://dx.do.org/0.457/jmue.04.9.8.06 3D Face Reconstructon Wth Local Feature Refnement Rudy Adpranata, Kartka Gunad and Wendy Gunawan 3, formatcs Department, Petra Chrstan Unversty, Surabaya,
More informationA new segmentation algorithm for medical volume image based on K-means clustering
Avalable onlne www.jocpr.com Journal of Chemcal and harmaceutcal Research, 2013, 5(12):113-117 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCRC5 A new segmentaton algorthm for medcal volume mage based
More informationClassifying Acoustic Transient Signals Using Artificial Intelligence
Classfyng Acoustc Transent Sgnals Usng Artfcal Intellgence Steve Sutton, Unversty of North Carolna At Wlmngton (suttons@charter.net) Greg Huff, Unversty of North Carolna At Wlmngton (jgh7476@uncwl.edu)
More informationGender Classification using Interlaced Derivative Patterns
Gender Classfcaton usng Interlaced Dervatve Patterns Author Shobernejad, Ameneh, Gao, Yongsheng Publshed 2 Conference Ttle Proceedngs of the 2th Internatonal Conference on Pattern Recognton (ICPR 2) DOI
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationObject-Based Techniques for Image Retrieval
54 Zhang, Gao, & Luo Chapter VII Object-Based Technques for Image Retreval Y. J. Zhang, Tsnghua Unversty, Chna Y. Y. Gao, Tsnghua Unversty, Chna Y. Luo, Tsnghua Unversty, Chna ABSTRACT To overcome the
More informationClassifier Selection Based on Data Complexity Measures *
Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.
More informationBOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET
1 BOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET TZU-CHENG CHUANG School of Electrcal and Computer Engneerng, Purdue Unversty, West Lafayette, Indana 47907 SAUL B. GELFAND School
More information3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres
More informationHistogram of Template for Pedestrian Detection
PAPER IEICE TRANS. FUNDAMENTALS/COMMUN./ELECTRON./INF. & SYST., VOL. E85-A/B/C/D, No. xx JANUARY 20xx Hstogram of Template for Pedestran Detecton Shaopeng Tang, Non Member, Satosh Goto Fellow Summary In
More informationCollaboratively Regularized Nearest Points for Set Based Recognition
Academc Center for Computng and Meda Studes, Kyoto Unversty Collaboratvely Regularzed Nearest Ponts for Set Based Recognton Yang Wu, Mchhko Mnoh, Masayuk Mukunok Kyoto Unversty 9/1/013 BMVC 013 @ Brstol,
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationPYTHON IMPLEMENTATION OF VISUAL SECRET SHARING SCHEMES
PYTHON IMPLEMENTATION OF VISUAL SECRET SHARING SCHEMES Ruxandra Olmd Faculty of Mathematcs and Computer Scence, Unversty of Bucharest Emal: ruxandra.olmd@fm.unbuc.ro Abstract Vsual secret sharng schemes
More informationBackground Removal in Image indexing and Retrieval
Background Removal n Image ndexng and Retreval Y Lu and Hong Guo Department of Electrcal and Computer Engneerng The Unversty of Mchgan-Dearborn Dearborn Mchgan 4818-1491, U.S.A. Voce: 313-593-508, Fax:
More informationDesign of a Real Time FPGA-based Three Dimensional Positioning Algorithm
Desgn of a Real Tme FPGA-based Three Dmensonal Postonng Algorthm Nathan G. Johnson-Wllams, Student Member IEEE, Robert S. Myaoka, Member IEEE, Xaol L, Student Member IEEE, Tom K. Lewellen, Fellow IEEE,
More informationParallel Inverse Halftoning by Look-Up Table (LUT) Partitioning
Parallel Inverse Halftonng by Look-Up Table (LUT) Parttonng Umar F. Sddq and Sadq M. Sat umar@ccse.kfupm.edu.sa, sadq@kfupm.edu.sa KFUPM Box: Department of Computer Engneerng, Kng Fahd Unversty of Petroleum
More informationFuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches
Proceedngs of the Internatonal Conference on Cognton and Recognton Fuzzy Flterng Algorthms for Image Processng: Performance Evaluaton of Varous Approaches Rajoo Pandey and Umesh Ghanekar Department of
More information3D Face Reconstruction With Local Feature Refinement
ternatonal Journal of Multmeda and Ubqutous Engneerng Vol.9, No.8 (014), pp.59-7 http://dx.do.org/10.1457/jmue.014.9.8.06 3D Face Reconstructon Wth Local Feature Refnement Rudy Adpranata 1, Kartka Gunad
More informationUnsupervised Learning
Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and
More informationModular PCA Face Recognition Based on Weighted Average
odern Appled Scence odular PCA Face Recognton Based on Weghted Average Chengmao Han (Correspondng author) Department of athematcs, Lny Normal Unversty Lny 76005, Chna E-mal: hanchengmao@163.com Abstract
More informationFast Feature Value Searching for Face Detection
Vol., No. 2 Computer and Informaton Scence Fast Feature Value Searchng for Face Detecton Yunyang Yan Department of Computer Engneerng Huayn Insttute of Technology Hua an 22300, Chna E-mal: areyyyke@63.com
More informationParallel matrix-vector multiplication
Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more
More informationA NEW FUZZY C-MEANS BASED SEGMENTATION STRATEGY. APPLICATIONS TO LIP REGION IDENTIFICATION
A NEW FUZZY C-MEANS BASED SEGMENTATION STRATEGY. APPLICATIONS TO LIP REGION IDENTIFICATION Mhaela Gordan *, Constantne Kotropoulos **, Apostolos Georgaks **, Ioanns Ptas ** * Bass of Electroncs Department,
More informationCS 534: Computer Vision Model Fitting
CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust
More informationA Modified Median Filter for the Removal of Impulse Noise Based on the Support Vector Machines
A Modfed Medan Flter for the Removal of Impulse Nose Based on the Support Vector Machnes H. GOMEZ-MORENO, S. MALDONADO-BASCON, F. LOPEZ-FERRERAS, M. UTRILLA- MANSO AND P. GIL-JIMENEZ Departamento de Teoría
More informationHelsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)
Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute
More informationAngle-Independent 3D Reconstruction. Ji Zhang Mireille Boutin Daniel Aliaga
Angle-Independent 3D Reconstructon J Zhang Mrelle Boutn Danel Alaga Goal: Structure from Moton To reconstruct the 3D geometry of a scene from a set of pctures (e.g. a move of the scene pont reconstructon
More informationOutline. Type of Machine Learning. Examples of Application. Unsupervised Learning
Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton
More informationOptimized Region Competition Algorithm Applied to the Segmentation of Artificial Muscles in Stereoscopic Images
Vol. 2, No. 3, Page 185-195 Copyrght 2008, TSI Press Prnted n the USA. All rghts reserved Optmzed Regon Competton Algorthm Appled to the Segmentaton of Artfcal Muscles n Stereoscopc Images Rafael Verdú-Monedero,
More informationRecognition of Handwritten Numerals Using a Combined Classifier with Hybrid Features
Recognton of Handwrtten Numerals Usng a Combned Classfer wth Hybrd Features Kyoung Mn Km 1,4, Joong Jo Park 2, Young G Song 3, In Cheol Km 1, and Chng Y. Suen 1 1 Centre for Pattern Recognton and Machne
More informationA Background Subtraction for a Vision-based User Interface *
A Background Subtracton for a Vson-based User Interface * Dongpyo Hong and Woontack Woo KJIST U-VR Lab. {dhon wwoo}@kjst.ac.kr Abstract In ths paper, we propose a robust and effcent background subtracton
More informationInsertion Sort. Divide and Conquer Sorting. Divide and Conquer. Mergesort. Mergesort Example. Auxiliary Array
Inserton Sort Dvde and Conquer Sortng CSE 6 Data Structures Lecture 18 What f frst k elements of array are already sorted? 4, 7, 1, 5, 1, 16 We can shft the tal of the sorted elements lst down and then
More information2 ZHENG et al.: ASSOCIATING GROUPS OF PEOPLE (a) Ambgutes from person re dentfcaton n solaton (b) Assocatng groups of people may reduce ambgutes n mat
ZHENG et al.: ASSOCIATING GROUPS OF PEOPLE 1 Assocatng Groups of People We-Sh Zheng jason@dcs.qmul.ac.uk Shaogang Gong sgg@dcs.qmul.ac.uk Tao Xang txang@dcs.qmul.ac.uk School of EECS, Queen Mary Unversty
More informationUsing Fuzzy Logic to Enhance the Large Size Remote Sensing Images
Internatonal Journal of Informaton and Electroncs Engneerng Vol. 5 No. 6 November 015 Usng Fuzzy Logc to Enhance the Large Sze Remote Sensng Images Trung Nguyen Tu Huy Ngo Hoang and Thoa Vu Van Abstract
More informationNAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics
Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson
More informationOptimizing Document Scoring for Query Retrieval
Optmzng Document Scorng for Query Retreval Brent Ellwen baellwe@cs.stanford.edu Abstract The goal of ths project was to automate the process of tunng a document query engne. Specfcally, I used machne learnng
More informationA CALCULATION METHOD OF DEEP WEB ENTITIES RECOGNITION
A CALCULATION METHOD OF DEEP WEB ENTITIES RECOGNITION 1 FENG YONG, DANG XIAO-WAN, 3 XU HONG-YAN School of Informaton, Laonng Unversty, Shenyang Laonng E-mal: 1 fyxuhy@163.com, dangxaowan@163.com, 3 xuhongyan_lndx@163.com
More informationA Clustering Algorithm for Chinese Adjectives and Nouns 1
Clusterng lgorthm for Chnese dectves and ouns Yang Wen, Chunfa Yuan, Changnng Huang 2 State Key aboratory of Intellgent Technology and System Deptartment of Computer Scence & Technology, Tsnghua Unversty,
More informationFace Recognition University at Buffalo CSE666 Lecture Slides Resources:
Face Recognton Unversty at Buffalo CSE666 Lecture Sldes Resources: http://www.face-rec.org/algorthms/ Overvew of face recognton algorthms Correlaton - Pxel based correspondence between two face mages Structural
More informationAnalysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
More informationDependence of the Color Rendering Index on the Luminance of Light Sources and Munsell Samples
Australan Journal of Basc and Appled Scences, 4(10): 4609-4613, 2010 ISSN 1991-8178 Dependence of the Color Renderng Index on the Lumnance of Lght Sources and Munsell Samples 1 A. EL-Bally (Physcs Department),
More informationHierarchical clustering for gene expression data analysis
Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally
More informationAn Entropy-Based Approach to Integrated Information Needs Assessment
Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology
More informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationFACE RECOGNITION USING MAP DISCRIMINANT ON YCBCR COLOR SPACE
FAC RCOGNIION USING MAP DISCRIMINAN ON YCBCR COLOR SPAC I Gede Pasek Suta Wjaya lectrcal ngneerng Department, ngneerng Faculty, Mataram Unversty. Jl. Majapaht 62 Mataram, West Nusa enggara, Indonesa. mal:
More informationElectrical analysis of light-weight, triangular weave reflector antennas
Electrcal analyss of lght-weght, trangular weave reflector antennas Knud Pontoppdan TICRA Laederstraede 34 DK-121 Copenhagen K Denmark Emal: kp@tcra.com INTRODUCTION The new lght-weght reflector antenna
More informationEdge Detection in Noisy Images Using the Support Vector Machines
Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona
More informationSteps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices
Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between
More informationRobust Face Recognition Using Eigen Faces and Karhunen-Loeve Algorithm
Robust Face Recognton Usng Egen Faces and Karhunen-Loeve Algorthm Parvnder S. Sandhu, Iqbaldeep Kaur, Amt Verma, Prateek Gupta Abstract The current research paper s an mplementaton of Egen Faces and Karhunen-Loeve
More informationA fault tree analysis strategy using binary decision diagrams
Loughborough Unversty Insttutonal Repostory A fault tree analyss strategy usng bnary decson dagrams Ths tem was submtted to Loughborough Unversty's Insttutonal Repostory by the/an author. Addtonal Informaton:
More informationEfficient Content Representation in MPEG Video Databases
Effcent Content Representaton n MPEG Vdeo Databases Yanns S. Avrths, Nkolaos D. Doulams, Anastasos D. Doulams and Stefanos D. Kollas Department of Electrcal and Computer Engneerng Natonal Techncal Unversty
More informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More information