Link Graph Analysis for Adult Images Classification
|
|
- Nathan Chester Morrison
- 6 years ago
- Views:
Transcription
1 Lnk Graph Analyss for Adult Images Classfaton Evgeny Khartonov Insttute of Physs and Tehnology, Yandex LLC 90, 6 Lev Tolstoy st., khartonov@yandex-team.ru Anton Slesarev Insttute of Physs and Tehnology, Yandex LLC 90, 6 Lev Tolstoy st., slesarev@yandex-team.ru Ilya Muhnk Rutgers Unversty, Yandex LLC 90, 6 Lev Tolstoy st., muhnklya@yahoo.om edor Romanenko Yandex LLC 90, 6 Lev Tolstoy st., fedor@yandex-team.ru Dmtry Belyaev Yandex LLC 90, 6 Lev Tolstoy st., dvbelyaev@yandex-team.ru Dmtry Kotlyarov Yandex LLC 90, 6 Lev Tolstoy st., dmko@yandex-team.ru ABSTRACT In order to protet an mage searh engne s users from undesrable results adult mages lassfer should be bult. The nformaton about lnks from webstes to mages s employed to reate suh a lassfer. These lnks are represented as a bpartte webste-mage graph. Eah vertex s equpped wth sores of adultness and deentness. The sores for mage vertexes are ntalzed wth zero, those for webste vertexes are ntalzed aordng to a text-based webste lassfer. An teratve algorthm that propagates sores wthn a webste-mage graph s desrbed. The sores obtaned are used to lassfy mages by hoosng an approprate threshold. The experments on Internet-sale data have shown that the algorthm under onsderaton nreases lassfaton reall by 7% n omparson wth a smple algorthm whh lassfes an mage as adult f t s onneted wth at least one adult ste (at the same preson level). Keywords Lnk graph analyss, adult mages lassfaton. INTRODUCTION There are two knds of approahes whh an be used to detet adult mages,.e. text-based and mage-based. The text-based approah detets adult webpages usng ther text ontent and
2 propagates ths nformaton to the lnked mages and pages. On the other hand, mage-based approah uses the features ontaned n the mage tself suh as fae presene, skn-olor features, onneted omponents, et. The problem of adult webpages deteton problem s a speal ase of the automat text lassfaton problem. There are many papers n ths feld whh dffer n feature extraton and seleton methods, mahne learnng algorthms used and some other detals. Sebastan made a survey [] of the man approahes to text lassfaton and ategorzaton. Text-based approahes are full of sgnfant lmtatons. Texts on many webpages do not orrespond to ther mage ontents. or example, a webmaster an mslead searh engnes tryng to show adult mages n response to popular deent queres to attrat a user s attenton. Some pages lak texts for good lassfaton. Usually a speal dtonary for text lassfyng s needed. Beause of lmtatons on sze of a tranng set and varety of words used on adult webpages t an be dffult to make suh a dtonary. Another aspet s that many words and phrases may be obsene or deent dependng on the ontext. Thus a ontext analyss s a hard task. Text-based lassfers ould be appled to bgger strutures suh as webstes. In work [] webste adultness s defned by the number of adult webpages on ths webste. The use of webstes nstead of webpages dereases lassfaton nose. The problem of adult mage lassfaton usng mage ontent s wdely nvestgated n lterature. or example, Rowley et al. [3] used mage features and proposed algorthm that reah 90% preson and 50% reall. There are papers whh use a ombnaton of text and mages features, for example [4]. urther n the paper we wll frstly ntrodue some related work and then present our method. After that we wll provde some expermental results on a real dataset. nally, we wll pont out some possble dretons of our future work.. Related Work Consderng the adult mage lassfaton problem based on an adult webstes lassfer the noton of a bpartte mage-webste graph appears. An edge n ths graph ndates whether the webste and the mages are lnked. The problem we address s how to lassfy adult mages usng the nformaton about webstes adultness. The smplest lassfer supposes an mage to be adult f t appears on at least one adult webste. The dea to analyze nternet data by exploraton event movng on a huge graph appeared about 0 years ago. Most popular algorthms of ths type are PageRank [5] and HITS [6]. Sne the paper [5] was publshed the nternet data analyss usng teratonal proess on some graph (often suh proesses desrbe Markov random walks) has beome wdespread for data lassfaton. Castllo et al. [7] used ths dea to detet spam vertes n the graph of webpages. L et al. [8] used lk graphs to mprove query ntent lassfers. A lk graph s a bpartte graph representng lk-through data. The edges theren onnet queres and URLs and are weghed by the assoated lk ounts. The authors manually labeled a small set of seed queres n a lk graph and teratvely propagated the label nformaton to the other queres untl a global equlbrum state was reahed. The authors of [9] used modfed HITS algorthm to detet pad lnks. Szummer and Craswell [0] lassfed webpages by analyzng a bpartte query-url graph. The authors labeled a small set of webpages and proposed a proedure used to lassfy all webpages usng random walks on ths graph. Deng et al. (Deng, Lyu, and Kng 009) proposed a general CO-HITS algorthm. The authors appled ther algorthm to a query suggeston problem.
3 In the present work we desrbe an teratve proedure of webste adultness propagaton aross a bpartte mage-webste graph. Ths proedure s used as part of the adult mage flterng system n the mage searh serve of searh engne Yandex. 3. Data The goal of the researh s to lassfy mages as adult or deent provded the text-based ste lassfaton. The algorthm uses undreted bpartte graph G = ( V; = ( S; I; whh represents the lnks between webstes and mages n the Internet. The vertexes of the partte S represent the webstes named by ther URLs. All stes URLs are trunated to ther seond doman exept for several hostngs (there are about 0 hostngs n the exepton lst). or nstane, we do not dstngush.regularhost.om,.regularhost.om and regularhost.om and treat them as a sngle vertex, but user.lvejournal.om and user.lvejournal.om are mapped to dfferent vertexes. Partte I onssts of ndexed mages grouped nto lusters by ther vsual smlarty usng Dmtry Mkhalev s algorthm, so every vertex I represents a luster of smlar mages. Clusterzaton s used n order to group reszed and ompressed opes of an mage. Suh lusterzaton redues the graph sze and dereases sparseness of the graph s ndene matrx. V = S I s a set f vertexes of G. A vertex from the frst partte s onneted wth a vertex from the seond one f there s a lnk (html tags mg or a href ) from a page on a webste to at least one mage n a orrespondng mage luster. It should be noted that no dstnton s made between ases wth many and a few lnks between a ste and an mage luster. We also suppose that all stes have been already lassfed as adult or not. Ths ntal ste lassfaton mght have errors. In ths paper we use the results of ste lassfaton produed by the text-based ste lassfer desrbed n []. 4. Data Model and Algorthm We denote the mage-ste graph as G( V; = G( S + S ; I;, where + S stands for a set of adult webstes, S stands for the rest of webstes (regarded deent). The mage set (the set of mage lusters) s referred to as I. Our goal s to lassfy mages I nto two lasses. Wth the graph G we assoate a bnary adjaeny matrx W (G). w = f there s an edge between vertexes and j and w = 0 otherwse. j Let us onsder a matrx Y (V ) whh haraterzes ntal label dstrbuton on the set of vertexes. Its sze s V wth rows enumeratng graph vertexes and olumns orrespondng to lass labels. y, y 0 f vertex s labeled as adult and y, y, f s labeled as = = = y = = 0 = deent. y 0, f vertex has no label (ths holds for all mages I ). We are lookng for a V non-negatve matrx (V ). Vetor =, ) s j ( nterpreted as vertex s lass sore, and are adultness and deentness, respetvely. (0) (0) Y s taken as ntal value of : = Y, V The problem of omputng s an optmzaton problem. or every edge (, j) n the graph we are gong to fnd a vetor par ( ; j) suh that s lose to j. The ntuton behnd these rtera s that for every par of adjaent vertexes we want ther sores of label ntensty to be as lose as possble. We hoose the followng funton as a rteron: Unfortunately, the algorthm s detals have not been publshed. The average sze of a luster s.7.
4 Φ =, j V W j D j D jj + µ V ( Y ) Here D denotes a dagonal matrx wth elements D = and µ s the algorthm s W j j V parameter. We adopt ths funton from paper [8] where the authors onsder the problem of label propagaton on a set of searh queres. The frst term denotes our wsh for and j to be lose. It ontans three weght multples D, D jj andw j. W j shows that we summarze dsrepany only over the graph edges. D and D jj are used to derease lass sores for vertexes wth a lot of ndent edges. The seond term s used to lmt devaton of resultant weghts from ntal weghts. Coeffent µ regularzes the bounds of ths devaton. The optmzaton an be derved analytally: = arg mn Φ = ( α)( E αa) Y, A = D α =, + µ WD E = dag(,...,), But there s a onvenent teratve proedure to fnd that explots a sparse struture of W and allows us to avod expensve alulaton of the large nverse matrx: (0) = Y, ( n+ ) ( n) = αa + ( α) Y It an be shown ([8]) that ths proedure onverges to the analytal soluton. or eah vertex V we get a vetor (, ) as a result of alulaton = arg mn Φ. In the next step we sort all the vertexes n the dereasng order of. After that we label V k top vertexes wth maxmum value of rato as + ε + ε adult. Here ε s some small onstant and k s used to adjust the tradeoff between reall and preson. 5. Experments In our experments we use the mage-ste graph and the results of automat webste lassfaton bult on No addtonal nformaton s used. We remove the stes wthout mages, beause our goal s to lassfy mages. We also remove small mages. The resultant graph onssts of.6 0 stes, mage groups and edges. The average number of mages onneted wth a ste s 460. Images wth area less than Most of them are very unnformatve: ons, avatars, buttons, et.
5 To the estmate qualty of the mage lassfer we use an addtonal dataset. All mages n the dataset were labeled manually as adult or not. The dataset onssts of 9475 random mages olleted from the nternet. 7 of them are adult. We have performed 4 experments dependng on 3 parameters. These parameters are: the number of teratons (n), the parameter whh regularzes dsrepany of from Y (α ), the sze of adult mages lass (k) ε s a onstant n all experments. Its value s The followng sheme s used to hoose the parameters value. rst of all we hoose α = 0.5 from the problem s spefs (after that α was vared n ). We also take k = 0.04 as reasonable aordng to the problem spefs. We have performed experments wth these parameters wth n vared from up to 30 (g., g. ). After determnng the best value of n we vary α {0.,0.4,0.6,0.8} and k {0.0,0.0,0.03,0.04,0.06,0.08,0.0,0. }(3 ombnatons total) wth fxed n (g. 3). To estmate the lassfaton qualty we use two metrs,.e. preson and reall. Let us onsder a task of lassfyng nstanes S nto lasses {, }. Experts label S e S + as nstanes of lass and S e S as nstanes of lass. The lassfer splts set S nto two sets of nstanes S and S lassfed as + and -, orrespondngly. Then S preson = S reall = e S e S S e S., 6. Dsusson At frst t should be noted that the metrs onverged (g., ) after a few teratons were performed. ve teratons seem to be enough for all future experments. Moreover ths fat mples some pratal onsequenes, sne the teratons number affets omputatonal omplexty. As t an be seen from g. 3 the varaton of α wth fxed k produed a very weak effet on both reall and preson whle the varaton of parameter k allows us to hange reall and preson wthn a wde range. These experments allow us to ompare the algorthm under gure. Preson vs. Iteratons onsderaton wth the nave rule that lassfes all the mages wth at least one lnk from the adult ste as adult themselves and deent otherwse. The algorthm outperforms a smple (referred as baselne on g. 3) rule whh lassfes an mage as adult f t s onneted wth at
6 least one adult ste by 7% n reall wthout hanges n preson. The algorthm s reall s very mportant due to task spefs. 7. Conlusons and uture Work We have presented a new adult mage lassfaton algorthm that makes use of mage-webste lnk struture provded pror ste lassfaton results. The followng ntuton s behnd t: f a lot of suspous stes have a pture on ther pages, then the pture s a suspous one, f a ste ontans a lot of suspous mages, then t s suspous tself. gure. Reall vs. Iteratons In addton we luster mages. Ths makes the mage-ste graph less sparse, redues the vertexes number and provdes more nformaton about a sngle mage n the nternet. We beleve lusterng to be mportant n our task beause many adult stes opy adult mages from eah other. The novelty of the approah s the use of the mage-ste graph n order to solve the lassfaton problem. Our experments have shown that the system sales well and performs relably as part of a produton system. The desrbed proedure an be also appled to graph lassfaton tasks of dfferent nature. or nstane, the proedure an be used n order to detet spam stes gure 3. Preson vs. Reall usng the nternet lnk struture or to detet ommeral mages usng the webste-mage lnks. or future work our short term fous s to use textual apton-based mage lassfers. It would provde us wth labels for the mage partte of the graph that promses new resoures for the algorthm mprovement. We are gong to nvestgate how usng of ndvdual pages nstead of stes affets algorthm s performane. 8. REERENCES [] Sebastan,. 00. Mahne learnng n automated text ategorzaton. ACM Computng Surveys 34(): 47.
7 [] Maslov, M., Pyallng, A. and Trfonov, S Web stes automat ategorzaton. In RCDL 08: The Tenth Annversary of All-Russan Researh Conferene, [3] Rowley, H., Jng, Y. and Baluja, S Large sale mage-based adult-ontent flterng. In VISAPP (), INSTICC - Insttute for Systems and Tehnologes of Informaton, Control and Communaton. [4] Chen, R.-C. and Ho, C.-T A pornograph web page detetng method based on SVM model usng text and mage features. Internatonal Journal of Internet Protool Tehnology (4): [5] Page, L., Brn, S., Motwan, R. and Wnograd, T The PageRank taton rankng: Brngng order to the web. [6] Klenberg, J. M Authortatve soures n a hyperlnked envronment. Journal ACM 46(5): [7] Castllo, C., Donato, D., Gons, A., Murdok, V. and Slvestr, Know your neghbors: web spam deteton usng the web topology. In SIGIR 07: Proeedngs of the 30th annual nternatonal ACM SIGIR onferene on researh and development n nformaton retreval, New York, NY, USA: ACM. [8] L, X., Wang, Y.-Y. and Aero, A Learnng query ntent from regularzed lk graphs. In SIGIR 08: Proeedngs of the 3st annual nternatonal ACM SIGIR onferene on Researh and development n nformaton retreval, New York, NY, USA: ACM. [9] Nkolaev, K., Zudna, E. and Gorshkov, A Combnng anhor text ategorzaton and graph analyss for pad lnk deteton. In WWW 09: Proeedngs of the 8th nternatonal onferene on World wde web, New York, NY, USA: ACM. [0] Szummer, M. and Craswell, N Behavoral lassfaton on the lk graph. In WWW 08: Proeedng of the 7th nternatonal onferene on World Wde Web, 4 4. New York, NY, USA: ACM. [] Deng, H., Lyu, M. R. and Kng, I A generalzed o-hts algorthm and ts applaton to bpartte graphs. In KDD 09: Proeedngs of the 5th ACM SIGKDD nternatonal onferene on Knowledge dsovery and data mnng, New York, NY, USA: ACM.
LINK GRAPH ANALYSIS FOR ADULT IMAGES CLASSIFICATION
LINK GRAPH ANALYSIS FOR ADULT IMAGES CLASSIFICATION Evgeny Kharitonov *, ***, Anton Slesarev *, ***, Ilya Muchnik **, ***, Fedor Romanenko ***, Dmitry Belyaev ***, Dmitry Kotlyarov *** * Moscow Institute
More informationResearch on Neural Network Model Based on Subtraction Clustering and Its Applications
Avalable onlne at www.senedret.om Physs Proeda 5 (01 ) 164 1647 01 Internatonal Conferene on Sold State Deves and Materals Sene Researh on Neural Networ Model Based on Subtraton Clusterng and Its Applatons
More informationMultilabel Classification with Meta-level Features
Multlabel Classfaton wth Meta-level Features Sddharth Gopal Carnege Mellon Unversty Pttsburgh PA 523 sgopal@andrew.mu.edu Ymng Yang Carnege Mellon Unversty Pttsburgh PA 523 ymng@s.mu.edu ABSTRACT Effetve
More informationColor Texture Classification using Modified Local Binary Patterns based on Intensity and Color Information
Color Texture Classfaton usng Modfed Loal Bnary Patterns based on Intensty and Color Informaton Shvashankar S. Department of Computer Sene Karnatak Unversty, Dharwad-580003 Karnataka,Inda shvashankars@kud.a.n
More informationBoosting Weighted Linear Discriminant Analysis
. Okada et al. / Internatonal Journal of Advaned Statsts and I&C for Eonoms and Lfe Senes Boostng Weghted Lnear Dsrmnant Analyss azunor Okada, Arturo Flores 2, Marus George Lnguraru 3 Computer Sene Department,
More informationA Real-Time Detecting Algorithm for Tracking Community Structure of Dynamic Networks
A Real-Tme Detetng Algorthm for Trakng Communty Struture of Dynam Networks Jaxng Shang*, Lanhen Lu*, Feng Xe, Zhen Chen, Jaa Mao, Xueln Fang, Cheng Wu* Department of Automaton, Tsnghua Unversty, Beng,,
More informationFUZZY SEGMENTATION IN IMAGE PROCESSING
FUZZY SEGMENTATION IN IMAGE PROESSING uevas J. Er,, Zaldívar N. Danel,, Roas Raúl Free Unverstät Berln, Insttut für Inforat Tausstr. 9, D-495 Berln, Gerany. Tel. 0049-030-8385485, Fax. 0049-030-8387509
More informationFINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK
FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK L-qng Qu, Yong-quan Lang 2, Jng-Chen 3, 2 College of Informaton Scence and Technology, Shandong Unversty of Scence and Technology,
More informationAdaptive Class Preserving Representation for Image Classification
Adaptve Class Preservng Representaton for Image Classfaton Jan-Xun M,, Qankun Fu,, Wesheng L, Chongqng Key Laboratory of Computatonal Intellgene, Chongqng Unversty of Posts and eleommunatons, Chongqng,
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 informationSteganalysis of DCT-Embedding Based Adaptive Steganography and YASS
Steganalyss of DCT-Embeddng Based Adaptve Steganography and YASS Qngzhong Lu Department of Computer Sene Sam Houston State Unversty Huntsvlle, TX 77341, U.S.A. lu@shsu.edu ABSTRACT Reently well-desgned
More informationFuzzy Modeling for Multi-Label Text Classification Supported by Classification Algorithms
Journal of Computer Senes Orgnal Researh Paper Fuzzy Modelng for Mult-Label Text Classfaton Supported by Classfaton Algorthms 1 Beatrz Wlges, 2 Gustavo Mateus, 2 Slva Nassar, 2 Renato Cslagh and 3 Rogéro
More informationConnectivity in Fuzzy Soft graph and its Complement
IOSR Journal of Mathemats (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 1 Issue 5 Ver. IV (Sep. - Ot.2016), PP 95-99 www.osrjournals.org Connetvty n Fuzzy Soft graph and ts Complement Shashkala
More informationPerformance Evaluation of TreeQ and LVQ Classifiers for Music Information Retrieval
Performane Evaluaton of TreeQ and LVQ Classfers for Mus Informaton Retreval Matna Charam, Ram Halloush, Sofa Tsekerdou Athens Informaton Tehnology (AIT) 0.8 km Markopoulo Ave. GR - 19002 Peana, Athens,
More informationProgressive scan conversion based on edge-dependent interpolation using fuzzy logic
Progressve san onverson based on edge-dependent nterpolaton usng fuzzy log P. Brox brox@mse.nm.es I. Baturone lum@mse.nm.es Insttuto de Mroeletróna de Sevlla, Centro Naonal de Mroeletróna Avda. Rena Meredes
More informationTAR based shape features in unconstrained handwritten digit recognition
TAR based shape features n unonstraned handwrtten dgt reognton P. AHAMED AND YOUSEF AL-OHALI Department of Computer Sene Kng Saud Unversty P.O.B. 578, Ryadh 543 SAUDI ARABIA shamapervez@gmal.om, yousef@s.edu.sa
More informationLOCAL BINARY PATTERNS AND ITS VARIANTS FOR FACE RECOGNITION
IEEE-Internatonal Conferene on Reent Trends n Informaton Tehnology, ICRTIT 211 MIT, Anna Unversty, Chenna. June 3-5, 211 LOCAL BINARY PATTERNS AND ITS VARIANTS FOR FACE RECOGNITION K.Meena #1, Dr.A.Suruland
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 informationOptimal shape and location of piezoelectric materials for topology optimization of flextensional actuators
Optmal shape and loaton of pezoeletr materals for topology optmzaton of flextensonal atuators ng L 1 Xueme Xn 2 Noboru Kkuh 1 Kazuhro Satou 1 1 Department of Mehanal Engneerng, Unversty of Mhgan, Ann Arbor,
More informationPerformance Analysis of Hybrid (supervised and unsupervised) method for multiclass data set
IOSR Journal of Computer Engneerng (IOSR-JCE) e-issn: 2278-0661,p-ISSN: 2278-8727, Volume 16, Issue 4, Ver. III (Jul Aug. 2014), PP 93-99 www.osrjournals.org Performane Analyss of Hybrd (supervsed and
More informationA Fast Way to Produce Optimal Fixed-Depth Decision Trees
A Fast Way to Produe Optmal Fxed-Depth Deson Trees Alreza Farhangfar, Russell Grener and Martn Znkevh Dept of Computng Sene Unversty of Alberta Edmonton, Alberta T6G 2E8 Canada {farhang, grener, maz}@s.ualberta.a
More informationMULTIPLE OBJECT DETECTION AND TRACKING IN SONAR MOVIES USING AN IMPROVED TEMPORAL DIFFERENCING APPROACH AND TEXTURE ANALYSIS
U.P.B. S. Bull., Seres A, Vol. 74, Iss. 2, 2012 ISSN 1223-7027 MULTIPLE OBJECT DETECTION AND TRACKING IN SONAR MOVIES USING AN IMPROVED TEMPORAL DIFFERENCING APPROACH AND TEXTURE ANALYSIS Tudor BARBU 1
More informationPixel-Based Texture Classification of Tissues in Computed Tomography
Pxel-Based Texture Classfaton of Tssues n Computed Tomography Ruhaneewan Susomboon, Danela Stan Rau, Jaob Furst Intellgent ultmeda Proessng Laboratory Shool of Computer Sene, Teleommunatons, and Informaton
More informationCluster ( Vehicle Example. Cluster analysis ( Terminology. Vehicle Clusters. Why cluster?
Why luster? referene funton R R Although R and R both somewhat orrelated wth the referene funton, they are unorrelated wth eah other Cluster (www.m-w.om) A number of smlar ndvduals that our together as
More informationBottom-Up Fuzzy Partitioning in Fuzzy Decision Trees
Bottom-Up Fuzzy arttonng n Fuzzy eson Trees Maej Fajfer ept. of Mathemats and Computer Sene Unversty of Mssour St. Lous St. Lous, Mssour 63121 maejf@me.pl Cezary Z. Janow ept. of Mathemats and Computer
More informationGabor-Filtering-Based Completed Local Binary Patterns for Land-Use Scene Classification
Gabor-Flterng-Based Completed Loal Bnary Patterns for Land-Use Sene Classfaton Chen Chen 1, Lbng Zhou 2,*, Janzhong Guo 1,2, We L 3, Hongjun Su 4, Fangda Guo 5 1 Department of Eletral Engneerng, Unversty
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 informationBit-level Arithmetic Optimization for Carry-Save Additions
Bt-leel Arthmet Optmzaton for Carry-Sae s Ke-Yong Khoo, Zhan Yu and Alan N. Wllson, Jr. Integrated Cruts and Systems Laboratory Unersty of Calforna, Los Angeles, CA 995 khoo, zhanyu, wllson @sl.ula.edu
More informationDiscriminative Dictionary Learning with Pairwise Constraints
Dscrmnatve Dctonary Learnng wth Parwse Constrants Humn Guo Zhuoln Jang LARRY S. DAVIS UNIVERSITY OF MARYLAND Nov. 6 th, Outlne Introducton/motvaton Dctonary Learnng Dscrmnatve Dctonary Learnng wth Parwse
More informationIntegrating Fuzzy c-means Clustering with PostgreSQL *
SQL alle pgfcm. Seton 0 brefly susses relate work. Seton 0 ontans onluson remarks an retons for future work. Integratng Fuzzy -Means Clusterng wth PostgreSQL * R. M. Mnakhmetov taven@gmal.om South Ural
More informationComputing Cloud Cover Fraction in Satellite Images using Deep Extreme Learning Machine
Computng Cloud Cover Fraton n Satellte Images usng Deep Extreme Learnng Mahne L-guo WENG, We-bn KONG, Mn XIA College of Informaton and Control, Nanjng Unversty of Informaton Sene & Tehnology, Nanjng Jangsu
More informationPattern Classification: An Improvement Using Combination of VQ and PCA Based Techniques
Ameran Journal of Appled Senes (0): 445-455, 005 ISSN 546-939 005 Sene Publatons Pattern Classfaton: An Improvement Usng Combnaton of VQ and PCA Based Tehnques Alok Sharma, Kuldp K. Palwal and Godfrey
More informationMulti-scale and Discriminative Part Detectors Based Features for Multi-label Image Classification
Proeedngs of the wenty-seventh Internatonal Jont Conferene on Artfal Intellgene (IJCAI-8) Mult-sale and Dsrmnatve Part Detetors Based Features for Mult-lael Image Classfaton Gong Cheng, Deheng Gao, Yang
More informationSession 4.2. Switching planning. Switching/Routing planning
ITU Semnar Warsaw Poland 6-0 Otober 2003 Sesson 4.2 Swthng/Routng plannng Network Plannng Strategy for evolvng Network Arhtetures Sesson 4.2- Swthng plannng Loaton problem : Optmal plaement of exhanges
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 informationA Robust Algorithm for Text Detection in Color Images
A Robust Algorthm for Tet Deteton n Color Images Yangng LIU Satosh GOTO Takesh IKENAGA Abstrat Tet deteton n olor mages has beome an atve researh area sne reent deades. In ths paper we present a novel
More informationQuery Clustering Using a Hybrid Query Similarity Measure
Query clusterng usng a hybrd query smlarty measure Fu. L., Goh, D.H., & Foo, S. (2004). WSEAS Transacton on Computers, 3(3), 700-705. Query Clusterng Usng a Hybrd Query Smlarty Measure Ln Fu, Don Hoe-Lan
More informationEvaluation of Segmentation in Magnetic Resonance Images Using k-means and Fuzzy c-means Clustering Algorithms
ELEKTROTEHIŠKI VESTIK 79(3): 129-134, 2011 EGLISH EDITIO Evaluaton of Segmentaton n Magnet Resonane Images Usng k-means and Fuzzy -Means Clusterng Algorthms Tomaž Fnkšt Unverza v Lublan, Fakulteta za stronštvo,
More informationA Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems
A Unfed Framework for Semantcs and Feature Based Relevance Feedback n Image Retreval Systems Ye Lu *, Chunhu Hu 2, Xngquan Zhu 3*, HongJang Zhang 2, Qang Yang * School of Computng Scence Smon Fraser Unversty
More informationRegion Segmentation Readings: Chapter 10: 10.1 Additional Materials Provided
Regon Segmentaton Readngs: hater 10: 10.1 Addtonal Materals Provded K-means lusterng tet EM lusterng aer Grah Parttonng tet Mean-Shft lusterng aer 1 Image Segmentaton Image segmentaton s the oeraton of
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 informationPerformance Evaluation of Information Retrieval Systems
Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence
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 informationMatrix-Matrix Multiplication Using Systolic Array Architecture in Bluespec
Matrx-Matrx Multplaton Usng Systol Array Arhteture n Bluespe Team SegFault Chatanya Peddawad (EEB096), Aman Goel (EEB087), heera B (EEB090) Ot. 25, 205 Theoretal Bakground. Matrx-Matrx Multplaton on Hardware
More informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
More informationSemi-analytic Evaluation of Quality of Service Parameters in Multihop Networks
U J.T. (4): -4 (pr. 8) Sem-analyt Evaluaton of Qualty of Serve arameters n Multhop etworks Dobr tanassov Batovsk Faulty of Sene and Tehnology, ssumpton Unversty, Bangkok, Thaland bstrat
More informationA MPAA-Based Iterative Clustering Algorithm Augmented by Nearest Neighbors Search for Time-Series Data Streams
A MPAA-Based Iteratve Clusterng Algorthm Augmented by Nearest Neghbors Searh for Tme-Seres Data Streams Jessa Ln 1, Mha Vlahos 1, Eamonn Keogh 1, Dmtros Gunopulos 1, Janwe Lu 2, Shouan Yu 2, and Jan Le
More informationMulti-Collaborative Filtering Algorithm for Accurate Push of Command Information System
Mult-Collaboratve Flterng Algorthm for Aurate Push of Command Informaton System Cu Xao-long,, Du Bo, Su Guo-Png, Yu Yan Urumq Command College of CPAPF, Urumq 83000, Chna XnJang Tehnal Insttute of Physs
More informationDETECTING AND ANALYZING CORROSION SPOTS ON THE HULL OF LARGE MARINE VESSELS USING COLORED 3D LIDAR POINT CLOUDS
ISPRS Annals of the Photogrammetry, Remote Sensng and Spatal Informaton Senes, Volume III-3, 2016 XXIII ISPRS Congress, 12 19 July 2016, Prague, Czeh Republ DETECTING AND ANALYZING CORROSION SPOTS ON THE
More informationThe Simulation of Electromagnetic Suspension System Based on the Finite Element Analysis
308 JOURNAL OF COMPUTERS, VOL. 8, NO., FEBRUARY 03 The Smulaton of Suspenson System Based on the Fnte Element Analyss Zhengfeng Mng Shool of Eletron & Mahanal Engneerng, Xdan Unversty, X an, Chna Emal:
More informationAvatar Face Recognition using Wavelet Transform and Hierarchical Multi-scale LBP
2011 10th Internatonal Conferene on Mahne Learnng and Applatons Avatar Fae Reognton usng Wavelet Transform and Herarhal Mult-sale LBP Abdallah A. Mohamed, Darryl D Souza, Naouel Bal and Roman V. Yampolsky
More informationActive Contours/Snakes
Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng
More informationAVideoStabilizationMethodbasedonInterFrameImageMatchingScore
Global Journal of Computer Sene and Tehnology: F Graphs & vson Volume 7 Issue Verson.0 Year 207 Type: Double Blnd Peer Revewed Internatonal Researh Journal Publsher: Global Journals In. (USA) Onlne ISSN:
More informationClustering Data. Clustering Methods. The clustering problem: Given a set of objects, find groups of similar objects
Clusterng Data The lusterng problem: Gven a set of obets, fnd groups of smlar obets Cluster: a olleton of data obets Smlar to one another wthn the same luster Dssmlar to the obets n other lusters What
More informationMeasurement and Calibration of High Accuracy Spherical Joints
1. Introduton easurement and Calbraton of Hgh Auray Spheral Jonts Ale Robertson, Adam Rzepnewsk, Alexander Sloum assahusetts Insttute of Tehnolog Cambrdge, A Hgh auray robot manpulators are requred for
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationInterval uncertain optimization of structures using Chebyshev meta-models
0 th World Congress on Strutural and Multdsplnary Optmzaton May 9-24, 203, Orlando, Florda, USA Interval unertan optmzaton of strutures usng Chebyshev meta-models Jngla Wu, Zhen Luo, Nong Zhang (Tmes New
More informationOutline. Learning with Missing Data. Examples. Modeling Missing Values ( ) Missing Data Algorithms Experiments Conclusions Future Directions
Outlne earnng wth Mssng Data Onur Ozan Koluoglu Naveen Ramakrshnan Mssng Data lgorthms Eerments Conlusons Future Dretons Mssng Data Eamles What s mssng data? Consder n observatons eatures resonse n. s
More informationImproving Web Search Results Using Affinity Graph
Improvng Web Search Results Usng Affnty Graph Benyu Zhang, Hua L 2, Y Lu 3, Le J 4, Wens X 5, Weguo Fan 5, Zheng Chen, We-Yng Ma Mcrosoft Research Asa, 49 Zhchun Road, Bejng, 00080, P. R. Chna {byzhang,
More informationImproved Accurate Extrinsic Calibration Algorithm of Camera and Two-dimensional Laser Scanner
JOURNAL OF MULTIMEDIA, VOL. 8, NO. 6, DECEMBER 013 777 Improved Aurate Extrns Calbraton Algorthm of Camera and Two-dmensonal Laser Sanner Janle Kong, Le Yan*, Jnhao Lu, Qngqng Huang, and Xaokang Dng College
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 informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More 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 informationTime Synchronization in WSN: A survey Vikram Singh, Satyendra Sharma, Dr. T. P. Sharma NIT Hamirpur, India
Internatonal Journal of Enhaned Researh n Sene Tehnology & Engneerng, ISSN: 2319-7463 Vol. 2 Issue 5, May-2013, pp: (61-67), Avalable onlne at: www.erpublatons.om Tme Synhronzaton n WSN: A survey Vkram
More informationMachine Learning. Topic 6: Clustering
Machne Learnng Topc 6: lusterng lusterng Groupng data nto (hopefully useful) sets. Thngs on the left Thngs on the rght Applcatons of lusterng Hypothess Generaton lusters mght suggest natural groups. Hypothess
More informationAUTOMATICALLY MULTIPLE FEATURES DETECTION OF FACE SKETCH BASED ON MAXIMUM LINE GRADIENT
AUTOMATICALLY MULTIPLE FEATURES DETECTION OF FACE SKETCH BASED ON MAXIMUM LINE GRADIENT Arf Muntasa, Mohamad Harad, Maurdh Her Purnomo 3,,3 Eletral Engneerng Department, Insttut Teknolog Sepuluh Nopember,
More informationAn Adaptive Filter Based on Wavelet Packet Decomposition in Motor Imagery Classification
An Adaptve Flter Based on Wavelet Paket Deomposton n Motor Imagery Classfaton J. Payat, R. Mt, T. Chusak, and N. Sugno Abstrat Bran-Computer Interfae (BCI) s a system that translates bran waves nto eletral
More informationClustering incomplete data using kernel-based fuzzy c-means algorithm
Clusterng noplete data usng ernel-based fuzzy -eans algorth Dao-Qang Zhang *, Song-Can Chen Departent of Coputer Sene and Engneerng, Nanjng Unversty of Aeronauts and Astronauts, Nanjng, 210016, People
More informationA Toolbox for Easily Calibrating Omnidirectional Cameras
A oolbox for Easly Calbratng Omndretonal Cameras Davde Saramuzza, Agostno Martnell, Roland Segwart Autonomous Systems ab Swss Federal Insttute of ehnology Zurh EH) CH-89, Zurh, Swtzerland {davdesaramuzza,
More informationABHELSINKI UNIVERSITY OF TECHNOLOGY Networking Laboratory
ABHELSINKI UNIVERSITY OF TECHNOLOGY Networkng Laboratory Load Balanng n Cellular Networks Usng Frst Poly Iteraton Johan an Leeuwaarden Samul Aalto & Jorma Vrtamo Networkng Laboratory Helsnk Unersty of
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationA Semi-parametric Approach for Analyzing Longitudinal Measurements with Non-ignorable Missingness Using Regression Spline
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 93-9466 Vol., Issue (June 5), pp. 95 - Applatons and Appled Mathemats: An Internatonal Journal (AAM) A Sem-parametr Approah for Analyzng Longtudnal
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 informationOutline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1
4/14/011 Outlne Dscrmnatve classfers for mage recognton Wednesday, Aprl 13 Krsten Grauman UT-Austn Last tme: wndow-based generc obect detecton basc ppelne face detecton wth boostng as case study Today:
More information3D Scene Reconstruction System from Multiple Synchronized Video Images
3D Sene Reonstruton Sstem from Multple Snhronzed Vdeo Images aewoo Han 1, Juho Lee 2, Hung S. Yang 3 AIM Lab., EE/CS Dept., KAIS 1,2,3 373-1, Guseong-dong, Yuseong-gu, Daejon, Republ of Korea { bluebrd
More informationUnsupervised Learning and Clustering
Unsupervsed Learnng and Clusterng Supervsed vs. Unsupervsed Learnng Up to now we consdered supervsed learnng scenaro, where we are gven 1. samples 1,, n 2. class labels for all samples 1,, n Ths s also
More informationA GENETIC APPROACH FOR THE AUTOMATIC ADAPTATION OF SEGMENTATION PARAMETERS
A GENETIC APPROACH FOR THE AUTOMATIC ADAPTATION OF SEGMENTATION PARAMETERS R. Q. Fetosa a, *, G. A. O. P. Costa a, T. B. Cazes a, B. Fejo b a Dept. of Eletral Engneerng, b Dept of Informats, Cathol Unversty
More informationLECTURE : MANIFOLD LEARNING
LECTURE : MANIFOLD LEARNING Rta Osadchy Some sldes are due to L.Saul, V. C. Raykar, N. Verma Topcs PCA MDS IsoMap LLE EgenMaps Done! Dmensonalty Reducton Data representaton Inputs are real-valued vectors
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 informationDiscovering Word Senses from Text
Dsoverng Word Senses from Text Patrk Pantel and Dekang Ln Unversty of Alberta Department of Computng Sene Edmonton, Alberta T6H E1 Canada {ppantel, lndek}@s.ualberta.a ABSTRACT Inventores of manually ompled
More informationTerm Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task
Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto
More informationOn the End-to-end Call Acceptance and the Possibility of Deterministic QoS Guarantees in Ad hoc Wireless Networks
On the End-to-end Call Aeptane and the Possblty of Determnst QoS Guarantees n Ad ho Wreless Networks S. Srram T. heemarjuna Reddy Dept. of Computer Sene Dept. of Computer Sene and Engneerng Unversty of
More informationFULLY AUTOMATIC IMAGE-BASED REGISTRATION OF UNORGANIZED TLS DATA
FULLY AUTOMATIC IMAGE-BASED REGISTRATION OF UNORGANIZED TLS DATA Martn Wenmann, Bors Jutz Insttute of Photogrammetry and Remote Sensng, Karlsruhe Insttute of Tehnology (KIT) Kaserstr. 12, 76128 Karlsruhe,
More informationElsevier Editorial System(tm) for NeuroImage Manuscript Draft
Elsever Edtoral System(tm) for NeuroImage Manusrpt Draft Manusrpt Number: Ttle: Comparson of ampltude normalzaton strateges on the auray and relablty of group ICA deompostons Artle Type: Tehnal Note Seton/Category:
More informationQuery classification using topic models and support vector machine
Query classfcaton usng topc models and support vector machne Deu-Thu Le Unversty of Trento, Italy deuthu.le@ds.untn.t Raffaella Bernard Unversty of Trento, Italy bernard@ds.untn.t Abstract Ths paper descrbes
More informationScalable Parametric Runtime Monitoring
Salable Parametr Runtme Montorng Dongyun Jn Patrk O Nel Meredth Grgore Roşu Department of Computer Sene Unversty of Illnos at Urbana Champagn Urbana, IL, U.S.A. {djn3, pmeredt, grosu}@s.llnos.edu Abstrat
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 informationPath Following Control of a Spherical Robot Rolling on an Inclined Plane
Sensors & ransduers, Vol., Speal Issue, May 3, pp. 4-47 Sensors & ransduers 3 by IFSA http://www.sensorsportal.om Path Followng Control of a Spheral Robot Rollng on an Inlned Plane ao Yu, Hanxu Sun, Qngxuan
More informationA Web Site Classification Approach Based On Its Topological Structure
Internatonal Journal on Asan Language Processng 20 (2):75-86 75 A Web Ste Classfcaton Approach Based On Its Topologcal Structure J-bn Zhang,Zh-mng Xu,Kun-l Xu,Q-shu Pan School of Computer scence and Technology,Harbn
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 Weighted Method to Improve the Centroid-based Classifier
016 Internatonal onference on Electrcal Engneerng and utomaton (IEE 016) ISN: 978-1-60595-407-3 Weghted ethod to Improve the entrod-based lassfer huan LIU, Wen-yong WNG *, Guang-hu TU, Nan-nan LIU and
More informationVolume 3, Issue 9, September 2013 International Journal of Advanced Research in Computer Science and Software Engineering
Volume 3, Issue 9, September 2013 ISSN: 2277 128X International Journal of Advaned Researh in Computer Siene and Software Engineering Researh Paper Available online at: www.ijarsse.om A New-Fangled Algorithm
More informationInternational Journal of Pharma and Bio Sciences HYBRID CLUSTERING ALGORITHM USING POSSIBILISTIC ROUGH C-MEANS ABSTRACT
Int J Pharm Bo S 205 Ot; 6(4): (B) 799-80 Researh Artle Botehnology Internatonal Journal of Pharma and Bo Senes ISSN 0975-6299 HYBRID CLUSTERING ALGORITHM USING POSSIBILISTIC ROUGH C-MEANS *ANURADHA J,
More informationA Novel Dynamic and Scalable Caching Algorithm of Proxy Server for Multimedia Objects
Journal of VLSI Sgnal Proessng 2007 * 2007 Sprnger Sene + Busness Meda, LLC. Manufatured n The Unted States. DOI: 10.1007/s11265-006-0024-7 A Novel Dynam and Salable Cahng Algorthm of Proxy Server for
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationA Model-Based Approach for Automated Feature Extraction in Fundus Images
A Model-Based Approah for Automated Feature Extraton n Fundus Images Huq L Shool of Computng Natonal Unversty of Sngapore dslhq@nus.edu.sg Opas Chutatape Shool of Eletral and Eletron Engneerng Nanyang
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 informationClustering Algorithm of Similarity Segmentation based on Point Sorting
Internatonal onference on Logstcs Engneerng, Management and omputer Scence (LEMS 2015) lusterng Algorthm of Smlarty Segmentaton based on Pont Sortng Hanbng L, Yan Wang*, Lan Huang, Mngda L, Yng Sun, Hanyuan
More informationLearning Ensemble of Local PDM-based Regressions. Yen Le Computational Biomedicine Lab Advisor: Prof. Ioannis A. Kakadiaris
Learnng Ensemble of Local PDM-based Regressons Yen Le Computatonal Bomedcne Lab Advsor: Prof. Ioanns A. Kakadars 1 Problem statement Fttng a statstcal shape model (PDM) for mage segmentaton Callosum segmentaton
More information5 The Primal-Dual Method
5 The Prmal-Dual Method Orgnally desgned as a method for solvng lnear programs, where t reduces weghted optmzaton problems to smpler combnatoral ones, the prmal-dual method (PDM) has receved much attenton
More information