Exploring Image, Text and Geographic Evidences in ImageCLEF 2007
|
|
- Bryce Basil Atkins
- 6 years ago
- Views:
Transcription
1 Explorng Image, Text and Geographc Evdences n ImageCLEF 2007 João Magalhães 1, Smon Overell 1, Stefan Rüger 1,2 1 Department of Computng Imperal College London South Kensngton Campus London SW7 2AZ, UK 2 Knowledge Meda Insttute The Open Unversty Walton Hall Mlton Keynes MK7 6AA, UK (j.magalhaes@mperal.ac.uk, smon.overell01@mperal.ac.uk, s.rueger@open.ac.uk) Abstract Ths year, ImageCLEF2007 data provded multple evdences that can be explored n many dfferent ways. In ths paper we descrbe an nformaton retreval framework that combnes mage, text and geographc data. Text analyss mplements the vector space model based on non-geographc terms. Geographc analyss mplements a placename dsambguaton method and placenames are ndexed by ther Getty TGN Unque Id. Image analyss mplements a query by semantc example model. The paper concludes wth an analyss of our results. Fnally we dentfy the weaknesses n our approach and ways n whch the system could be optmsed and mproved. Categores and Subject Descrptors H.3 [Informaton Storage and Retreval]: H.3.1 Content Analyss and Indexng; H.3.3 Informaton Search and Retreval; H.3.4 Systems and Software; H.3.7 Dgtal Lbrares; H.2.3 [Database Managment]: Languages Query Languages General Terms Measurement, Performance, Expermentaton Keywords Semantc Image Retreval, Geographc Image Retreval 1 Introducton Ths paper presents a system that ntegrates vsual, text and geographc data. Such systems are n great demand as the rchness of metadata nformaton ncrease together wth the sze of multmeda collectons. We evaluated the system on the ImageCLEF Photo IAPR TC-12 photographc collecton to assess some of the evdence combnaton strateges and other desgn aspects of our system. As the system mplemented a set of prelmnary algorthms we were able to clearly see the dfferent mpacts of each component of our system. Ths paper s organzed as follows: secton 2 dscusses the dataset characterstcs; sectons 3 to 6 present our system: the text data processng algorthms, the geographc data processng algorthms, the mage data processng algorthms, and the combnaton strateges. Results are presented n secton 7 and fnally secton 8 presents the conclusons. 2 ImageCLEF Photo Data ImageCLEF Photo dataset s deal to test our system: t ncludes metadata nformaton (both textual descrptons and geographc nformaton), and vsual nformaton. The dataset has 20,000 mages wth the correspondng metadata. The photos vary n qualty, levels of nose, and llustrate several concepts, actons or events. Metadata enrches the mages by addng nformaton such as the fact that a street s n some locaton or the professon of one of the persons n the photos. A more thorough descrpton of the dataset can be found n [4]. The goal of ths dataset s to smulate a scenaro where collectons have heterogeneous sources of data and users submt textual queres together wth vsual examples. Ths s smlar to TRECVID search task wth a slght
2 dfference concernng geographc data and actons that are only possble to detect on vdeos (e.g. walkng/runnng). 3 System DOCNO TITLE NOTES LOCATION annotatons/00/60.eng Palma The man shoppng street n Paraguay Asuncón, Paraguay DATE March 2002 IMAGE THUMBNAIL mages/00/60.jpg thumbnals/00/60.jpg Table 1 Example of metadata nformaton avalable on the collecton. The mplemented system has two separate ndexes for mages related data and another one for metadata related data. Next we wll descrbe how nformaton s analysed and stored on both ndexes. 3.1 Metadata Indexes The ndexng stage of Forostar begns by extractng named enttes from text usng ANNIE, the Informaton Extracton engne bundled wth GATE. GATE s Sheffeld Unversty's General Archtecture for Text Engneerng. Of the seres of tasks ANNIE s able to perform, the only one we use s named entty recognton. We consder ANNIE a black box where text goes n, and categorsed named enttes are returned; because of ths, we wll not dscuss the workngs of ANNIE further here but rather refer you to the GATE manual [2] Named Entty Felds We ndex all the named enttes categorsed by GATE n a Named Entty feld n Lucene (e.g. Polce, Cty Councl, or Presdent Clnton ). The named enttes tagged as Locatons by ANNIE we ndex as Named Entty Locaton (e.g. Los Angeles, Scotland or Calforna ) and as a Geographc Locaton (descrbed n Secton 3.1.3). The body of the GeoCLEF artcles and the artcle ttles are ndexed as text felds. Ths process s descrbed n the next secton Text Felds Text felds are pre-processed by a customsed analyser smlar to Lucene s default analyser [1]. Text s splt at whte space nto tokens, the tokens are then converted to lower case, stop words dscarded and stemmed wth the Snowball Stemmer. The processed tokens are held n Lucene s nverted ndex Geographc Felds The locatons tagged by the named entty recognser are passed to the dsambguaton system. We have mplemented a smple dsambguaton method based on heurstc rules. For each placename beng classfed we buld a lst of canddate locatons, f the placename beng classfed s followed by a referent locaton ths can often cut down the canddate locatons enough to make the placename unambguous. If the placename s not followed by a referent locaton or s stll ambguous we dsambguate t as the most commonly occurrng locaton wth that name. Topologcal relatonshps between locatons are looked up n the Getty Thesaurus of Geographcal Names (TGN) [5]. Statstcs on how commonly dfferent placenames refer to dfferent locatons and a set of synonyms for each locaton are harvested from our Geographc Co-occurrence model, whch n turn s bult by crawlng Wkpeda [13]. Once placenames have been mapped to unque locatons n the TGN, they need to be converted nto Geographc felds to be stored n Lucene. We store locatons n two felds: Coordnates. The coordnate feld s smply the lattude and longtude as read from the TGN. Unque strngs. The unque strng s the unque d of ths locaton, preceded wth the unque d of all the parent locatons, separated wth slashes. Thus the unque strng for the locaton London, UK s the unque d for London ( ), preceded by ts parent, Greater London ( ), preceded by
3 ts parent, Brtan ( )... untl the root locaton, the World ( ) s reached. Gvng the unque strng for London as \ \ \ \ \ Note the text, named entty and geographc felds are not orthogonal. Ths has the effect of multplyng the mpact of terms occurrng n multple felds. For example f the term London appears n text, the token london wll be ndexed n the text feld. London wll be recognsed by ANNIE as a Named Entty and tagged as a locaton (and ndexed as Locaton Entty, London ). The Locaton Entty wll then be dsambguated as locaton and correspondng geographc felds wll be added. Prevous experments conducted on the GeoCLEF data set n [11] showed mproved results from havng overlappng felds. We concluded from these experments that the ncreased weghtng gven to locatons caused these mprovements. 3.2 Images Indexes The mage ndexng part of our system creates hgh-level semantc ndexng unts that allow the user to access the vsual content wth query-by-keyword or query-by-semantc-example. In our ImageCLEF experments we only used query by semantc example. Followng the approach proposed n [9], each keyword corresponds to a statstcal model that represents that keyword n terms of the vsual features of the mages. These keyword models are then used to ndex mages wth the probablty of observng the keyword on each partcular mage. Next we wll descrbe the dfferent steps of the vsual analyss algorthm, see [9] for detals Vsual Features Three dfferent low-level features are used n our mplementaton: margnal HSV dstrbuton moments, a 12 dmensonal colour feature that captures the hstogram of 4 central moments of each colour component dstrbuton; Gabor texture, a 16 dmensonal texture feature that captures the frequency response (mean and varance) of a bank of flters at dfferent scales and orentatons; and Tamura texture, a 3 dmensonal texture feature composed by measures of mage s coarseness, contrast and drectonalty. We tled the mages n 3 by 3 parts before extractng the low-level features. Ths has two advantages: t adds some localty nformaton and t greatly ncreases the amount of data used Feature Data Representaton We create a vsual vocabulary where each term corresponds to a set of homogenous vsual characterstcs (colour and texture features). Snce we are gong to use a feature space to represent all mages, we need a set of vsual terms that s able to represent them. Thus, we need to check whch vsual characterstcs are more common n the dataset. For example, f there are a lot of mages wth a wde range of blue tones we requre a larger number of vsual terms representng the dfferent blue tones. Ths draws on the dea that to learn a good hgh-dmensonal vsual vocabulary we would beneft from examnng the entre dataset to look for the most common set of colour and texture features. We buld the hgh-dmensonal vsual vocabulary by clusterng the entre dataset and representng each term as a cluster. We follow the approach presented n [8], where the entre dataset s clustered wth a herarchcal EM algorthm usng a Gaussan mxture model. Ths approach generates a herarchy of cluster models that corresponds to a herarchy of vocabulares wth a dfferent number of terms. The deal number of clusters s selected va the MDL crteron Maxmum Entropy Model Maxmum entropy (or logstc regresson) s a statstcal tool that has been appled to a great varety of felds, e.g. natural language processng, text classfcaton, mage annotaton. Thus, each keyword w s represented by a maxmum entropy model, ( ) MaxEnt ( w = β F ( )), p w V V F V s the feature data representaton defned on the prevous secton of vsual feature vector V, and where ( ) w β s the vector of the regresson coeffcents for keyword w. We mplemented the bnomal model, where one class s always modelled relatvely to all other classes, and not a multnomal dstrbuton, whch would mpose a model that does not reflect the realty of the problem: the
4 multnomal model mples that events are exclusve, whereas n our problem keywords are not exclusve. For ths reason, the bnomal model s a better choce as documents can have more than one keyword assgned Images Indexng by Keyword ImageCLEF data s not annotated wth keywords, thus we used a dfferent dataset. Ths dataset was compled by Duygulu et al. [3] from a set of COREL Stock Photo CDs. The dataset has some vsually smlar keywords (jet, plane, Boeng), and some keywords have a lmted number of examples (10 or less). Each mage s annotated wth 1-5 keywords from a vocabulary of 371 keywords of whch we modelled 179 keywords to annotate ImageCLEF mages. 4 Query Processng The prevous sectons descrbed how the dataset nformaton s processed and stored. Ths secton wll descrbe how the user query s processed and matched to the ndexed documents. Smlarly to the documents processng the user s query s dvded nto ts text and mage elements. Fgure 1 llustrates the query processng and how multple evdences are combned. Fgure 1 Query processng and evdence combnaton. The textual part s processed n the same way as at ndexng tme and a combnaton strategy fuses the results from the dfferent textual part processng (text terms, named enttes and nameplaces). Each mage s also processed n the same way as prevously descrbed and a combnaton strategy fuses the results from the mages. Thus, only the documents-query smlarty and the evdence combnaton s new n the query processng part. 4.1 Text Query Processng The queryng stage s a two step process: (1) manually constructed queres are expanded and converted nto Lucene s bespoke queryng language; (2) then we query the Lucene ndex wth these expanded queres Manually Constructed Query The queres are manually constructed n a smlar structure to the Lucene ndex. Queres have the followng parts: a text feld, a Named Entty feld and a locaton feld. The text feld contans the query wth no alteraton. The named entty feld contans a lst of named enttes referred to n the query (manually extracted). The locaton feld contans a lst of locaton relatonshp pars. These are the locatons contaned n the query and ther to the locaton beng searched for. A locaton can be specfed ether wth a placename (optonally dsambguated wth a referent placename), a boundng box, a boundng crcle (centre and radus), or a geographc feature type (such as lake or cty ). A relatonshp can ether be exact match, contaned n (vertcal topology), contaned n (geographc area), or same parent (vertcal topology). The negaton of relatonshps can also be expressed.e. excludng, outsde, etc. We beleve such a manually constructed query could be automated wth relatve ease n a smlar fashon to the processng that documents go through when ndexed. Ths was not mplemented due to tme constrants.
5 4.1.2 Expandng the Geographc Query The geographc queres are expanded n a ppe-lne. The locaton relaton pars are expanded n turn. The relaton governs at whch stage the locaton enters the ppelne. At each stage n the ppelne the geographc query s added to. At the frst stage an exact match for ths locaton s unque strng s added: for London ths would be \ \ \ \ \ Then places wthn the locaton are added, ths s done usng Lucene s wld-card character notaton: for locatons n London ths becomes \ \ \ \ \ \*. Then places sharng the same parent locaton are added, agan usng Lucene s wld-card character notaton. For London ths becomes all places wthn Greater London, \ \ \ \ \*. Fnally the coordnates of all the locatons fallng close to ths locaton are added. A closeness value can manually be set n the locaton feld, however default values are based on feature type (default values were chosen by the authors). The feature of London s Admnstratve Captal, the default value of closeness for ths feature s 100km. See [12] for further dscusson on the handlng of geographc queres Combnng usng the VSM A Lucene query s bult usng the text felds, named entty felds and expanded geographc felds. The text feld s processed by the same analyzer as at query tme and compared to both the notes and ttle felds n the Lucene ndex. We defne a separate boost factor for each feld. We defne a separate boost factor for each feld. These boost values were set by the authors durng ntal teratve tests (they are comparable to smlar weghtng n past GeoCLEF papers [10] and [14]). The ttle had a boost of 10, the notes a boost of 7, named enttes a boost of 5, geographc unque strng a boost of 5 and geographc co-ordnates a boost of 3. The geographc, text and named entty relevance are then combned usng Lucene s Vector Space Model. 4.2 Image Query Processng In automatc retreval systems, processng tme s a pressng feature that drectly mpacts the usablty of the system. We envsage a responsve system that processes a query and retreves results wthn 1 second per user, meanng that to support multple users t must be much less than 1 second. Fgure 2 presents the archtecture of the system. We mplemented a query by semantc example algorthm [7] that s dvded nto three parts: Semantc Multmeda Analyser: The semantc multmeda analyser nfers the keywords probabltes and s desgned to work n less than 100ms. Another mportant ssue s that t should also support a large number of keywords so that the semantc space can accommodate the semantc understandng that the user gves to the query. Secton 3.2 presented the semantc multmeda analyser used n ths paper, see [9] for detals. Fgure 2 Query by semantc example system. Indexer: Indexer uses a smple storage mechansm capable of storng and provdng easy access to each keyword of a gven multmeda document. It s not optmsed for tme complexty. The same ndexng mechansms used for content based mage retreval can be used to ndex content by semantcs.
6 Semantc Multmeda Retreval: The fnal part of the system s n charge of retrevng the documents that are semantcally close to the gven query. Frst t must run the semantc multmeda analyser on the example to obtan the keyword vector of the query. Then t searches the database for the relevant documents accordng to a semantc smlarty metrc on the semantc space of keywords. In ths part of the system we are only concerned wth studyng functons that mrror human understandng of semantc smlarty. See [7] for detals Semantc Space In the semantc space multmeda documents are represented as a feature vector of the probabltes of the T keywords (179 n our case), = d dw dw [ ] 1,..., T where each dmenson s the probablty of keyword w beng present on that document. Note that the vector of keywords s normalsed f the smlarty metrc needs so (normalsaton s dependent on the metrc). These keywords are extracted by the semantc-multmeda-analyser algorthm descrbed n Secton 3.2. It s mportant that the semantc space accommodates as many keywords as possble to be sure that the user dea s represented n that space wthout losng any concepts. Thus, systems that extract a lmted number of keywords are less approprate. Ths desgn requrement pushes us to the research area of metrcs on hghdmensonal spaces. We use the tf-df vector space model. Each document s represented as a vector d, where each dmenson corresponds to the frequency of a gven term (keyword) w from a vocabulary of T terms (keywords). The only dfference between our formulaton and the tradtonal vector space model s that we use P ( w d ) nstead of the classc term frequency TF ( w d ). Ths s equvalent because all documents are represented by a hgh-dmensonal vocabulary of length T and P ( w d ) T TF ( w d ). Thus, to mplement a vector space model we set each dmenson of a document vector as d = P ( w d ) IDF ( w ). The nverse document frequency s defned as the logarthm of the nverse of the probablty of a keyword over the entre collecton D, Semantc Smlarty Metrc = D. IDF ( w ) log ( P ( w )) Documents d and queres q are represented by vectors of keyword probabltes that are computed as was explaned n the prevous secton. Several dstance metrcs exst n the tf-df representaton that compute the smlarty between a document dj vector and a query vector q. We rank documents by ther smlarty to the query mage accordng to the cosne-dstance metrc. The cosne smlarty metrc expresson s: ( q d ) sm, = Multple Images Query Combnaton T, q d = 1. T 2 T 2 ( q ) ( d ) 1 1 = = The semantc smlarty metrc gves us the dstance between a sngle mage query and the documents n the database. There are two major strateges of combnng multple examples of a query: (1) mergng the examples nto a sngle query nput and produce a sngle rank; (2) submt several queres and combne the ranks. Obvously each of these two types of combnatons uses dfferent algorthms. For ImageCLEF2007 we mplemented a smple and straght forward combnaton strategy: we submt one query for each example and combne the smlarty values from all ndvdual queres: ( q1 q2 q3 D) = { ( q1 D) ( q2 D) ( q3 D) } sm,,, sm,, sm,, sm,.
7 Ths s an OR operaton whle an AND operaton would be acheved wth a query vector that s the product of all ndvdual query mage vectors. We return the top 1000 results. 4.3 Rank Combnaton The text query and the mage query are processed ndependently and are later combned by a smple lnear combnaton. Prevous work on ths area has found a set of good weghts to combne text and mage ranks. Applyng these weghts we reach the expresson that combnes ranks: CombnedRank = ( 1000 ImageRankPos ) ( 1000 TextGeoRankPos ). The dfferent metrc spaces hold dfferent smlarty functons, thus producng ncompatble numercal measures. Thus, we used the document rank poston (e.g. ImageRankPos ) to compute the fnal rank. The produced metrc gves the mportance of each document for the gven query. Ths lnear combnaton only consders the top 1000 documents of each rank. Documents beyond ths poston are not consdered. 5 Results and Dscusson We ran 5 experments: Text: The Text part of the query only; TextNoGeo: The Text part of the query wth geographc elements removed; ImageOnly: The Image part of the query only; Geo: The geographc part of the mage only; and Combnaton: A combnaton of the Text, ImageOnly and Geo runs. Note the TextNoGeo, ImageOnly and Geo runs are orthogonal. Results are presented on Fgure 3. We can see that TextNoGeo results acheved the best results. Next was the Text results, however, there s not a sgnfcant dfference (usng the Wlcoxon Sgned Rank Test [6]). Ths was a bt surprsng as one would expect to mprove results when you add locaton nformaton to the query and to the documents. We beleve that the decrease n performance was due to the fact that some queres use the geographc part as nclusve or exclusve. Text TextNoGeo ImageOnly Geo Combnaton Fgure 3 Retreval results for the dfferent types of analyss. The Geo results were statstcally sgnfcantly worse than all the other results wth a confdence of 99.98%. Ths s due to mnmal nformaton beng used (generally a lst of placenames). Only 26 of the 60 queres contaned geographc references. Across these geographc queres the Geo method acheved an MAP of compared to for TextNoGeo and for ImageOnly. In fact across these 26 queres there s no sgnfcant dfference between Text, TextNoGeo, Combnaton and Geo methods. Ths shows that (for the geographc queres) the geographc component of the query s extremely mportant. Image results also acheved very low results, whch gven the scope of the evaluaton mght seem a bt surprsng. Ths s related to the uses of the mages to llustrate keywords that are not obvous. For example from Fgure 4 we can see that n some cases t s very dffcult to guess the query or how mages should be combned.
8 Fgure 4 Image examples for query people n San Francsco. Summng up all these problems that we faced on sngle data-type evdences, together wth unbalanced combnatons of the dfferent types of evdences, we found that the fnal rank s almost an average of ndvdual ranks. 6 Conclusons and Future Work Most of our work was done on the documents analyss and ndexng part of the evaluaton. However, t became evdent that our sngle combnaton strategy does not cover all possble types of queres. In some cases mages should be combned wth AND, others wth OR operatons. The same happened wth text and geographc, e.g. locatons can be nclusve ( n San Francsco ) or exclusve ( outsde Australa ). Moreover, some mages only llustrate part of the query ( people n San Francsco, Fgure 4) and t s obvously dffcult to dentfy correct results wth only the vsual part of the query. All these lessons show that t s essental to make good use of the dfferent algorthms by combnng them properly accordng to the query text. Moreover, the query analyss must produce an accurate logcal combnaton of the dfferent enttes of the query to acheve a good retreval performance. In our future work we would lke to repeat the experments descrbed n ths paper usng a combnaton strategy based on the logcal structure of the query. 7 References [1] "Apache Lucene Project," [2] H. Cunnngham, "GATE, a General Archtecture for Text Engneerng," Computers and the Humantes, vol. 36, pp , May [3] P. Duygulu, K. Barnard, N. de Fretas, and D. Forsyth, "Object recognton as machne translaton: Learnng a lexcon for a fxed mage vocabulary," n European Conf. on Computer Vson, Copenhagen, Denmark, 2002, pp [4] M. Grubnger, P. Clough, HanburyAllan, and H. Müller, "Overvew of the ImageCLEF 2007 Photographc Retreval Task," n Workng Notes of the 2007 CLEF Workshop, Budapest, Hungary, [5] P. Harpng, User s Gude to the TGN Data Releases. The Getty Vocabulary Program 2.0 edton, 200. [6] D. Hull, "Usng statstcal testng n the evaluaton of retreval experments," n ACM SIGIR Conference, Pttsburgh, PA, USA, 1993, pp [7] J. Magalhães, S. Overell, and S. Rüger, "A semantc vector space for query by mage example," n ACM SIGIR Conf. on research and development n nformaton retreval, Multmeda Informaton Retreval Workshop, Amsterdam, The Netherlands, [8] J. Magalhães and S. Rüger, "Logstc regresson of generc codebooks for semantc mage retreval," n Int'l Conf. on Image and Vdeo Retreval, Phoenx, AZ, USA, [9] J. Magalhães and S. Rüger, "Informaton-theoretc semantc multmeda ndexng," n ACM Conference on Image and Vdeo Retreval Amsterdam, The Netherlands, [10] B. Martns, N. Cardoso, M. Chaves, L. Andrade, and M. Slva, "The Unversty of Lsbon at GeoCLEF 2006," n Workng Notes for the CLEF Workshop, Alcante, Span, [11] S. Overell, J. Magalhães, and S. Rüger, "Forostar: A system for GIR," n Lecture Notes from the Cross Language Evaluaton Forum 2006, 2006.
9 [12] S. Overell, J. Magalhães, and S. Rüger, "GIR experements wth Forostar at GeoCLEF 2007," n ImageCLEF 2007, Budapest, Hungary, [13] S. Overell and S. Rüger, "Geographc co-occurrence as a tool for GIR," n CIKM Workshop on Geographc Informaton Retreval, Lsbon, Portugal, [14] M. E. Ruz, S. Shapro, J. Abbas, S. B. Southwck, and D. Mark, "UB at GeoCLEF 2006," n In Workng Notes for the CLEF Workshop, 2006.
UB at GeoCLEF Department of Geography Abstract
UB at GeoCLEF 2006 Mguel E. Ruz (1), Stuart Shapro (2), June Abbas (1), Slva B. Southwck (1) and Davd Mark (3) State Unversty of New York at Buffalo (1) Department of Lbrary and Informaton Studes (2) Department
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 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 informationGIR experiements with Forostar at GeoCLEF 2007
GIR experiements with Forostar at GeoCLEF 2007 Simon Overell 1, João Magalhães 1 and Stefan Rüger 2,1 1 Multimedia & Information Systems Department of Computing, Imperial College London, SW7 2AZ, UK 2
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 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 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 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 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 informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
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 informationSemantic Image Retrieval Using Region Based Inverted File
Semantc Image Retreval Usng Regon Based Inverted Fle Dengsheng Zhang, Md Monrul Islam, Guoun Lu and Jn Hou 2 Gppsland School of Informaton Technology, Monash Unversty Churchll, VIC 3842, Australa E-mal:
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 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 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 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 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 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 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 informationKIDS Lab at ImageCLEF 2012 Personal Photo Retrieval
KD Lab at mageclef 2012 Personal Photo Retreval Cha-We Ku, Been-Chan Chen, Guan-Bn Chen, L-J Gaou, Rong-ng Huang, and ao-en Wang Knowledge, nformaton, and Database ystem Laboratory Department of Computer
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 informationImproving Web Image Search using Meta Re-rankers
VOLUME-1, ISSUE-V (Aug-Sep 2013) IS NOW AVAILABLE AT: www.dcst.com Improvng Web Image Search usng Meta Re-rankers B.Kavtha 1, N. Suata 2 1 Department of Computer Scence and Engneerng, Chtanya Bharath Insttute
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 informationCombining Multiple Resources, Evidence and Criteria for Genomic Information Retrieval
Combnng Multple Resources, Evdence and Crtera for Genomc Informaton Retreval Luo S 1, Je Lu 2 and Jame Callan 2 1 Department of Computer Scence, Purdue Unversty, West Lafayette, IN 47907, USA ls@cs.purdue.edu
More informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
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 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 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 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 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 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 informationSimulation Based Analysis of FAST TCP using OMNET++
Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months
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 informationCSCI 5417 Information Retrieval Systems Jim Martin!
CSCI 5417 Informaton Retreval Systems Jm Martn! Lecture 11 9/29/2011 Today 9/29 Classfcaton Naïve Bayes classfcaton Ungram LM 1 Where we are... Bascs of ad hoc retreval Indexng Term weghtng/scorng Cosne
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 informationMachine Learning 9. week
Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below
More informationDescription of NTU Approach to NTCIR3 Multilingual Information Retrieval
Proceedngs of the Thrd NTCIR Workshop Descrpton of NTU Approach to NTCIR3 Multlngual Informaton Retreval Wen-Cheng Ln and Hsn-Hs Chen Department of Computer Scence and Informaton Engneerng Natonal Tawan
More informationA Deflected Grid-based Algorithm for Clustering Analysis
A Deflected Grd-based Algorthm for Clusterng Analyss NANCY P. LIN, CHUNG-I CHANG, HAO-EN CHUEH, HUNG-JEN CHEN, WEI-HUA HAO Department of Computer Scence and Informaton Engneerng Tamkang Unversty 5 Yng-chuan
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 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 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 informationPRÉSENTATIONS DE PROJETS
PRÉSENTATIONS DE PROJETS Rex Onlne (V. Atanasu) What s Rex? Rex s an onlne browser for collectons of wrtten documents [1]. Asde ths core functon t has however many other applcatons that make t nterestng
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 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 informationCMPS 10 Introduction to Computer Science Lecture Notes
CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not
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 informationKeyword-based Document Clustering
Keyword-based ocument lusterng Seung-Shk Kang School of omputer Scence Kookmn Unversty & AIrc hungnung-dong Songbuk-gu Seoul 36-72 Korea sskang@kookmn.ac.kr Abstract ocument clusterng s an aggregaton of
More information1. Introduction. Abstract
Image Retreval Usng a Herarchy of Clusters Danela Stan & Ishwar K. Seth Intellgent Informaton Engneerng Laboratory, Department of Computer Scence & Engneerng, Oaland Unversty, Rochester, Mchgan 48309-4478
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 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 informationK-means and Hierarchical Clustering
Note to other teachers and users of these sldes. Andrew would be delghted f you found ths source materal useful n gvng your own lectures. Feel free to use these sldes verbatm, or to modfy them to ft your
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 informationBootstrapping Structured Page Segmentation
Bootstrappng Structured Page Segmentaton Huanfeng Ma and Davd Doermann Laboratory for Language and Meda Processng Insttute for Advanced Computer Studes (UMIACS) Unversty of Maryland, College Park, MD {hfma,
More informationInformation Retrieval
Anmol Bhasn abhasn[at]cedar.buffalo.edu Moht Devnan mdevnan[at]cse.buffalo.edu Sprng 2005 #$ "% &'" (! Informaton Retreval )" " * + %, ##$ + *--. / "#,0, #'",,,#$ ", # " /,,#,0 1"%,2 '",, Documents are
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 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 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 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 informationRelated-Mode Attacks on CTR Encryption Mode
Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationProblem Set 3 Solutions
Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
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 informationBioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.
[Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented
More informationAssignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.
Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton
More informationHigh-Boost Mesh Filtering for 3-D Shape Enhancement
Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,
More informationFor instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)
Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A
More informationSelecting Query Term Alterations for Web Search by Exploiting Query Contexts
Selectng Query Term Alteratons for Web Search by Explotng Query Contexts Guhong Cao Stephen Robertson Jan-Yun Ne Dept. of Computer Scence and Operatons Research Mcrosoft Research at Cambrdge Dept. of Computer
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 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 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 informationAlignment Results of SOBOM for OAEI 2010
Algnment Results of SOBOM for OAEI 2010 Pegang Xu, Yadong Wang, Lang Cheng, Tany Zang School of Computer Scence and Technology Harbn Insttute of Technology, Harbn, Chna pegang.xu@gmal.com, ydwang@ht.edu.cn,
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 informationLearning-Based Top-N Selection Query Evaluation over Relational Databases
Learnng-Based Top-N Selecton Query Evaluaton over Relatonal Databases Lang Zhu *, Wey Meng ** * School of Mathematcs and Computer Scence, Hebe Unversty, Baodng, Hebe 071002, Chna, zhu@mal.hbu.edu.cn **
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 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 informationELEC 377 Operating Systems. Week 6 Class 3
ELEC 377 Operatng Systems Week 6 Class 3 Last Class Memory Management Memory Pagng Pagng Structure ELEC 377 Operatng Systems Today Pagng Szes Vrtual Memory Concept Demand Pagng ELEC 377 Operatng Systems
More informationLRD: Latent Relation Discovery for Vector Space Expansion and Information Retrieval
LRD: Latent Relaton Dscovery for Vector Space Expanson and Informaton Retreval Techncal Report KMI-06-09 March, 006 Alexandre Gonçalves, Janhan Zhu, Dawe Song, Vctora Uren, Roberto Pacheco In Proc. of
More informationFeature Reduction and Selection
Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components
More informationEnhanced Watermarking Technique for Color Images using Visual Cryptography
Informaton Assurance and Securty Letters 1 (2010) 024-028 Enhanced Watermarkng Technque for Color Images usng Vsual Cryptography Enas F. Al rawashdeh 1, Rawan I.Zaghloul 2 1 Balqa Appled Unversty, MIS
More informationAvailable online at Available online at Advanced in Control Engineering and Information Science
Avalable onlne at wwwscencedrectcom Avalable onlne at wwwscencedrectcom Proceda Proceda Engneerng Engneerng 00 (2011) 15000 000 (2011) 1642 1646 Proceda Engneerng wwwelsevercom/locate/proceda Advanced
More informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
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 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 informationLearning-based License Plate Detection on Edge Features
Learnng-based Lcense Plate Detecton on Edge Features Wng Teng Ho, Woo Hen Yap, Yong Haur Tay Computer Vson and Intellgent Systems (CVIS) Group Unverst Tunku Abdul Rahman, Malaysa wngteng_h@yahoo.com, woohen@yahoo.com,
More informationReal-time Motion Capture System Using One Video Camera Based on Color and Edge Distribution
Real-tme Moton Capture System Usng One Vdeo Camera Based on Color and Edge Dstrbuton YOSHIAKI AKAZAWA, YOSHIHIRO OKADA, AND KOICHI NIIJIMA Graduate School of Informaton Scence and Electrcal Engneerng,
More informationCan We Beat the Prefix Filtering? An Adaptive Framework for Similarity Join and Search
Can We Beat the Prefx Flterng? An Adaptve Framework for Smlarty Jon and Search Jannan Wang Guolang L Janhua Feng Department of Computer Scence and Technology, Tsnghua Natonal Laboratory for Informaton
More informationExperiments in Text Categorization Using Term Selection by Distance to Transition Point
Experments n Text Categorzaton Usng Term Selecton by Dstance to Transton Pont Edgar Moyotl-Hernández, Héctor Jménez-Salazar Facultad de Cencas de la Computacón, B. Unversdad Autónoma de Puebla, 14 Sur
More informationSignature and Lexicon Pruning Techniques
Sgnature and Lexcon Prunng Technques Srnvas Palla, Hansheng Le, Venu Govndaraju Centre for Unfed Bometrcs and Sensors Unversty at Buffalo {spalla2, hle, govnd}@cedar.buffalo.edu Abstract Handwrtten word
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 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 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 informationOnline Detection and Classification of Moving Objects Using Progressively Improving Detectors
Onlne Detecton and Classfcaton of Movng Objects Usng Progressvely Improvng Detectors Omar Javed Saad Al Mubarak Shah Computer Vson Lab School of Computer Scence Unversty of Central Florda Orlando, FL 32816
More informationKeywords - Wep page classification; bag of words model; topic model; hierarchical classification; Support Vector Machines
(IJCSIS) Internatonal Journal of Computer Scence and Informaton Securty, Herarchcal Web Page Classfcaton Based on a Topc Model and Neghborng Pages Integraton Wongkot Srura Phayung Meesad Choochart Haruechayasak
More informationVisual Thesaurus for Color Image Retrieval using Self-Organizing Maps
Vsual Thesaurus for Color Image Retreval usng Self-Organzng Maps Chrstopher C. Yang and Mlo K. Yp Department of System Engneerng and Engneerng Management The Chnese Unversty of Hong Kong, Hong Kong ABSTRACT
More informationPersonalized Concept-Based Clustering of Search Engine Queries
IEEE TRANSACTIONS ON JOURNAL NAME, MANUSCRIPT ID 1 Personalzed Concept-Based Clusterng of Search Engne Queres Kenneth Wa-Tng Leung, Wlfred Ng, and Dk Lun Lee Abstract The exponental growth of nformaton
More information11. HARMS How To: CSV Import
and Rsk System 11. How To: CSV Import Preparng the spreadsheet for CSV Import Refer to the spreadsheet template to ad algnng spreadsheet columns wth Data Felds. The spreadsheet s shown n the Appendx, an
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 information