Interfaces for networked media exploration and collaborative annotation

Size: px
Start display at page:

Download "Interfaces for networked media exploration and collaborative annotation"

Transcription

1 Interfaces for networked meda exploraton and collaboratve annotaton Preetha Appan Bageshree Shevade Har Sundaram Davd Brchfeld Arts Meda and Engneerng Program, AME-TR Arzona State Unversty Tempe, AZ emal: {preetha.appan, bageshree.shevade, har.sundaram, ABSTRACT In ths paper, we present our efforts towards creatng nterfaces for networked meda exploraton and collaboratve annotaton. The problem s mportant snce onlne socal networks are emergng as conduts for exchange of everyday experences. These networks do not currently provde meda-rch communcaton envronments. Our approach has two parts collaboratve annotaton, and a meda exploraton framework. The collaboratve annotaton takes place through a web based nterface, and provdes to each user personalzed recommendatons, based on meda features, and by usng a common sense nference toolkt. We develop three meda exploraton nterfaces that allow for two-way nteracton amongst the partcpants (a spato-temporal evoluton, (b event cones and (c vewpont centrc nteracton. We also analyze the user actvty to determne mportant people and events, for each user. We also develop subtle vsual nterface cues for actvty feedback. Prelmnary user studes ndcate that the system performs well and s well lked by the users. Categores and Subject descrptors H.5.1 [Multmeda Informaton Systems]: Artfcal, augmented, and vrtual realtes, H.5.4 [Hypertext/Hypermeda]: Archtectures, Navgaton, H.5.2 [User Interfaces]: Theory and methods, User-centered desgn General Terms Algorthms, Desgn, Human Factors Keywords Networked meda, communcaton, collaboratve annotaton, meda exploraton, personalzed meda nteracton 1. INTRODUCTION In ths paper we develop a system (ref. Fgure 1 that allows for a network of users to explore the actvtes of a group of frends. The system ncorporates a collaboratve annotaton and a meda rch exploraton framework. Ths s an emergng problem n several contexts: (a sharng of meda s mportant n onlne socal-networks such as Frendster [2], where a set of frends share a set of multmeda experences. (b Wth the ready avalablty of dgtal stll and vdeo cameras, t has become easy Permsson to make dgtal or hard copes of all or part of ths work for personal or classroom use s granted wthout fee provded that copes are not made or dstrbuted for proft or commercal advantage and that copes bear ths notce and the full ctaton on the frst page. To copy otherwse, or republsh, to post on servers or to redstrbute to lsts, requres pror specfc permsson and/or a fee. IUI 05, January 9-12, 2005, San Dego, Calforna, USA. Copyrght 2004 ACM /05/ $5.00. Upload Annotaton Clent Recommendaton System Database User Presentaton System Presentaton Clent Actvty Analyzer Fgure 1: Overall system dagram. Users upload meda to database and annotate usng the recommendaton system that ncorporates user-context. The actvty analyzer updates the user-context whch n turn affects the presentaton system. The dark arrows ndcate data flow from server to clent and the grey arrows, vce versa. to archve events n our daly lves. The popularty of socal networks such as Frendster, as well the formaton of moblogs suggests that users are wllng to share personal meda experences onlne. There has been pror work n creatng collaboratve annotaton systems [7,9]. In [7], the authors explore a collaboratve annotaton system for moble devces. There they used appearance based recommendatons to suggest annotatons to moble users. In [9], the authors descrbe a collaboratve annotaton procedure for scentfc vsualzaton tasks, that can done remotely. A key nnovaton n our approach s to augment the feature based recommendaton systems wth a common sense toolkt [12], thus makng the recommendatons more useful. There has been pror work n explorng mage collectons. Pror work n [10,11], provdes a summary vew of meda through thumbnal dsplay of mages. Temporal arrangement of meda can be explctly quered for, and smlarly other types of Boolean queres can be used to search for meda effectvely. However, these vsualzatons provde no nformaton on spato-temporal or semantc relatonshps amongst meda. Dsplayng mages as clusters around locatons n a map as done n [13], gves an dea of how the meda are dstrbuted across space. In ths work temporal relatonshps between mages are lost. We now present our approach to both the collaboratve annotaton and networked exploraton. In our approach, our collaboratve recommendaton system conssts of the followng components: (a meda and ts features,

2 (b user / group context, (c common sense based recommendatons. The user annotates the mages usng a webbased nterface. As the user begns to annotate mages, the system provdes personalzed recommendatons usng a combnaton of low-level features and a common sense toolkt [12]. After the user has fnshed annotatng an mage, the system creates postve example mage sets (or clusters for the assocated annotaton words wthn each feld (who, when, where, what. The clusters are based on annotaton words/concepts entered by the users and not on automatc groupng of low-level features. These clusters wll help the annotaton process mprove for all users of the network. Our goal s to develop an nteractve exploratory framework that enables easy and ntutve exploraton of shared meda, for a group of users n a socal network, through mplct rather than explct queryng. Our nteracton framework has two key components (a a vsualzaton subsystem (b an nteracton analyss module. The user nteracts wth the shared meda set, through three novel vsualzaton schemes. Her nteractons get captured by the nteracton analyss module, whch then sends nformaton back to the presentaton system. Then, the presentaton system provdes vsual cues to the user that ndcates how she nteracts wth other members. Prelmnary user studes ndcate that the annotaton / exploraton system s well lked by members of the network. The rest of ths paper s as follows. In the next secton, we present a bref overvew of our collaboratve recommendaton system. In Secton 3, we shall descrbe the features extracted, and how we use ConceptNet. In Secton 4, we descrbe our recommendaton system algorthm n detal. In Secton 5, we descrbe the webbased nterface for collaboratve annotaton and show how collaboratve annotaton s related to networked exploraton. Secton 6, dscusses our networked exploraton framework vsualzatons. Secton 7 dscusses detals on actvty analyss and vsual feedback. Fnally, we present our experments n Secton 8 and conclusons n Secton COLLABORATIVE ANNOTATION The motvaton behnd collaboratve annotaton s to share the process of annotatng shared personal meda wthn a socal network. Ths s ntutve as members of a small socal network share the same meda and partcpate n the same events. The shared personal meda n our framework conssts largely of mages and audo assocated wth everyday events. Ths meda needs to be annotated before beng used n the nteractve exploraton framework. Our system requres mnmal authorng the users provde meta-data for the mages n the form of who, where, when and what felds. The system takes advantage of the fact that other users n the network have entered annotaton for ther meda for shared events. 2.1 Context User context models are crucal to collaboratve annotaton as they help to gve personalzed recommendatons to each user. The dctonary defnton of context s gven as: the nterrelated condtons n whch somethng exsts or occurs. These condtons could be the physcal locaton, tme, user s actvty and past actons, envronment etc [14]. In our system, the user s context model comprses (a the ntal user profle entered by the user whch ncludes demographc nformaton lke age, background, hobbes/nterests etc. (b statstcal nformaton lke number of mages contrbuted n the shared socal network and (c usage statstcs whch ncludes the words she has used for annotaton and ther frequency. Mantanng a frequency count of annotatons s ntutve as the meda that s shared by the members of the socal network conssts of everyday events (people, places, what that recur. We also model the group context usng (a the mages uploaded by all the members of the group and (b the annotaton words used by all the members of the group. The group context s therefore, the unon of the user context of all the members of the group. Our system uses the group context to provde group recommendatons usng low-level features. 3. MEDIA ANALYSIS In ths secton, we dscuss the low-level features used and the use of semantcs through ConceptNet. 3.1 Low-level features In ths secton, we gve a bref overvew of the low-level features as well as feature-based mage dstance used n our recommendaton system. In ths work, our feature vector comprses of color, texture and edge hstograms. The color hstogram comprses of 166 bns n the HSV space. The edge hstogram conssts of 71 bns and the texture hstogram conssts of 3 bns. We then concatenate these three hstograms wth an equal weght to get the fnal composte hstogram. The low-level Eucldean feature dstance d between two mages and j s now gven as follows: N b b j 2 <1> b= 1 dj (, = ( h h where N s the total number of bns n the fnal feature vector and h s the hstogram for mage. 3.2 Meda Semantcs Semantcs are ncorporated n our framework through the use of ConceptNet. ConceptNet s a large repostory of commonsense concepts and ts relatons [12]. The repostory represents twenty semantc relatons between concepts lke effect-of, capable-of, made-of etc. In our system, semantcs are ncorporated through the use of ConceptNet. Snce the shared personal meda conssts of everyday events and actvtes; we beleve that usng a commonsense knowledge base such as ConceptNet wll enhance the qualty of the recommendatons. 3.3 Semantc dstance In ths secton, we determne a procedure to compute semantc dstance between any two concepts usng ConceptNet. The ConceptNet toolkt allows three basc operatons on a concept (a fndng contextual neghborhoods that determne the context around a concept or around the ntersecton of several concepts, (b fndng analogous concepts, that returns semantcally smlar concepts for a source concept and (c fndng paths n the semantc network graph between two concepts. In our system, we use the ConceptNet toolkt to determne the semantc dstance between two gven concepts e and f n the followng manner: Context of Concepts: Let us assume that the toolkt returns the contextual neghborhood sets C e and C f for the concepts. Then the context-based semantc dstance d c (e,f s now defned as follows:

3 Ce Cf dc (, e f =, <2> Ce Cf where s the cardnalty operator. Analogous concepts: Let us assume that the returned analogous concept sets are A e and A f. Then the semantc dstance d a (e,f based on analogous concepts s defned as follows: Ae Af da (, e f =. <3> Ae Af Number of paths between two concepts: Gven two concepts, the system extracts the total number of paths between them as well as the number of hops n each path. The path-based semantc dstance d p (e,f s then gven as follows: N 1 1 dp( a, b = N h <4> = 1 where N s the total number of paths between concepts e and f n the semantc network graph of ConceptNet and h s the number of hops n path. The fnal semantc dstance between concepts e and f s then computed as the weghted sum of the above dstances. We have defned equal weght for each of the above dstances. The fnal semantc dstance s gven as follows: d( e, f = w d ( e, f + w d ( e, f + w d ( e, f. <5> c c a a p p 4. RECOMMENDATION ALGORITHM In ths secton, we dscuss the algorthm for the recommendaton system. The goal s to provde recommendatons as the user s tryng to annotate mages uploaded by her. Let us consder the followng scenaro. Let us assume that the user has entered an ntal user profle and the system has been seeded wth a few annotated mages. When the user chooses to annotate an mage, the system provdes recommendatons based on low-level features, user-context, group-context and ConceptNet. As the user annotates mages, the system creates postve example mage sets for the assocated annotatons. The system forms clusters for each dstnct annotaton ntroduced n the system. These clusters grow n number and sze as the users n the network annotate ther shared meda. Thus wth a larger partcpaton by the members of the group, the recommendatons get more refned and reflect the group as a whole. 4.1 Algorthm Detals In ths secton, we present the detals of the algorthm for the recommendaton system. Fgure 2 shows the flow chart of the algorthm. Let us assume that the user wshes to annotate an mage a wth the who, where, when, and what felds. Let us also assume that the database contans N clusters for annotatons wthn each feld Frequency based Personal Recommendaton When the user chooses mage a for annotatng, the system provdes two knds of recommendaton lst for each of the above mentoned felds (a personal recommendaton lst and (b group recommendaton lst. The personal lst s obtaned from the frequency count of the annotaton words used by the user. As the user annotates mages, the system mantans a frequency count wthn each feld for each annotaton word used by the user for Augment personal recommendatons based on ConceptNet. Select mage to annotate Generate group recommendaton based on low-level features. Are group recommendatons semantcally close to user profle? Yes No Annotate mage by choosng recommendatons or addng new annotaton words. Treat the mage as a postve example of the annotaton words. Update cluster centers and create new clusters as needed. Generate personal recommendatons based only on frequency count. Fgure 2: Flow Chart for Recommendaton System Algorthm annotatng her mages. The system then pcks the three most frequently used words wthn each feld to generate the personal lst for each feld Group Recommendaton and Concept Flterng The group recommendaton for each feld s obtaned by computng the low-level feature dstance between uploaded mage Event snowboardng User Context {skng, ce-skatng} {game, snow, break leg} Fgure 3: Flterng of group recommendaton by usercontext usng ConceptNet.

4 and the cluster centers. The system then presents the top three closest cluster center words as recommendatons n the group lst. The system also flters ths group recommendaton lst by the user profle of the currently logged n user to get addtonal personal recommendatons for the what feld of the mage. Ths s done by computng the semantc dstance gven by equaton <5> between every concept n the user s profle and the concepts returned n the group recommendaton lst. When the semantc dstance between the user profle concept and the group recommendaton concept s less than one, the system uses the ConceptNet toolkt to Table 1: Example recommendatons obtaned by flterng group recommendatons wth user-profle usng ConceptNet. The arrow ndcates the sequence of actons taken for the annotatons to be personalzed. Photo Group dnner cake golf User Profle flm musc tenns ConceptNet move, people, char at party, actvty, group, fun game, ball, sports, actvty, fun get a lst of concepts whch are n the context of user profle concept based by group recommendaton concept. For e.g. Suppose the user profle concept contaned the word skng and the group recommendaton contaned the word snowboardng. We now use ConceptNet to get a lst of concepts n the context of skng whch are based by the context of the concept snowboardng. An example of such a lst would contan concepts lke game, snow, break leg etc. The system then pcks the top fve concepts n the lst and adds t to the personal recommendaton lst for the what feld. Ths s done for every concept n the user profle that s semantcally close to the concept n the group recommendaton lst. Ths s shown n Fgure 3. Table 1 shows the recommendatons that are obtaned by flterng group context usng user-context Updatng the System When the user has annotated mage a wth the recommendatons provded or by enterng her own annotatons, the system treats mage a as a postve example of all the annotatons assocated wth t. The system thus creates semantc clusters correspondng to all annotatons that exst n the system. If the user has ntroduced a new annotaton nto the system, then system creates a new cluster for the annotaton wth only mage a as the postve example. The system then computes the semantc dstance between the newly ntroduced annotatons and all the concepts n all the user profles present n the system. Ths s done as a background process to ensure real tme nteractvty and to make the system scalable. The user can now contnue annotatng other mages and ncrease the meta-data n the system. 5. THE ANNOTATION INTERFACE In ths secton, we descrbe the web nterface used for annotatng mages. Let us assume that the user has logged nto the system and has created a sesson. The user now uploads some mages to the shared meda repostory. When the user uploads the mages, the system scales these mages to a fxed sze and computes the color, texture and edge hstograms on these scaled mages. Image chosen for annotaton Personal and group recommendaton for who, where and what. Fgure 5: Web nterface that provdes users wth personal and group recommendatons that facltates authorng of meda. When the user has uploaded the mages, she s requred to group them nto events [3]. In our framework, events have the followng propertes assocated wth them: name, locaton, tme, meda elements (set of mages, sounds, text, as well as partcpants. Once the user has uploaded the mages, the system presents the user wth all the mages that she has uploaded n the system so far but has not grouped nto events. The user can then group mages and creates a new event or she can add mages to an already exstng event. After the user has created events, the user can now choose to annotate mages. Then, the system presents the user wth all the mages that have been grouped by the user nto events but have not been annotated. When she chooses an mage for annotaton, the system provdes her wth recommendaton for the who, where, and what felds of the mage. Ths s shown n Fgure 5. The recommendatons are provded based on the algorthm descrbed n the prevous secton. Collaboratve Annotaton Networked Exploraton Tempe, 11/2/2004, Harn wth frends Harn uploads Preetha recommends Tempe, 11/2/2004, Harn wth frends Harn browses photos Fgure 4: Meda flow through Collaboratve Annotaton and Networked Exploraton framework. Collaboratve Annotaton system helps users annotate meda whch can then be explored wth Networked Exploraton framework. Our web nterface also allows the user to add vewponts to events. Vewpont s defned as a personal narratve about an

5 event [3]. When the user chooses to add vewpont, she s asked to select the event to whch she wants to add vewponts. When the event s selected, the system presents all the mages whch are grouped n that event but have been uploaded and annotated by other users of the network. The user can now choose an mage and add her own personal narratve to that mage. When the user annotates mages, the system updates the cluster centers as descrbed n the prevous secton. These updates get reflected n the recommendatons n the next sesson. Our web nterface also allows the user to browse photographs va the vsualzaton tool. Fgure 4 shows an example of how the collaboratve annotaton framework affects a specfc user s event exploraton. 6. NETWORKED MEDIA EXPLORATION In ths secton, we descrbe the nteractve vsualzaton framework that we have developed, to allow users to explore events and actvtes of frends n ther socal network. 6.1 Desgn Goals It s a challengng task to buld a vsualzaton framework that presents meda to users n novel ways, as well as enables them to understand the relatonshps between people and events. We begn by enumeratng our desgn goals, for ths framework: 1. The framework should be nteractve, and preferably webbased. Ths would requre new vsualzatons and nteracton mechansms that dffer from current query based photo browsng systems. 2. In addton to browsng, the framework should also allow users to perform certan tasks through mplct queryng. Three such tasks are lsted below. In the followng, we shall use magnary users Alce and Bob: Event condtonng: What has Alce done snce a partcular event? (e.g. party at Bob s house Event support: What was the sequence of events that led Alce to meet Bob at partcular locaton? (e.g. Alce meets Bob at the mall. Interestng events: What are the set of events of nterest to Alce? Note that nterest s user context dependent. 3. The authorng envronment should place mnmal burden on the user. Ths ssue was addressed by our annotaton framework. 4. The system should be able to provde feedback to users about ther socal network, by analyzng user nteracton. 5. The communcaton between users should be two way,.e. users should be able to provde feedback to events authored by other users through the system. We have dealt wth desgn goals one and two n pror work [3]. We are addressng the other three goals n ths paper. 6.2 Meda Exploraton framework We now present our meda exploraton framework. Whle we had presented a prelmnary nterface n pror work [3], t now sgnfcantly augmented by real-tme user actvty analyss, a new novel vsual feedback cues Spato-temporal Evoluton Ths vsualzaton addresses the task of event condtonng, as well the nterestng events task descrbed n the desgn goals secton. Pror work n [11] show collectons of dgtal meda organzed ether by space or tme. Our vsualzaton ntroduces the dea of evoluton of meda through both space and tme. We use map data avalable n XML format [1], on whch events unfold over tme and space. The nteracton begns by the user selectng a frend. The system responds by showng the spato-temporal sldeshow of events, over tme and by locaton (e.g. GPS.The temporal transtons between locatons s ndcated usng arcs, and saturaton of the arc color s used to ndcate tme. Ths s llustrated n Fgure 6. Ths vsualzaton addtonally addresses the problem of vsualzng nterestng events. It s reasonable to assume that users are nterested n knowng who n ther group of frends went to the same places as themselves. Hence, when the user moves her mouse over a specfc event locaton, then all the frends of the selected user who partcpated n the same event are hghlghted n green. The other frends of the selected user, who partcpated n other events at the same locaton, are hghlghted n purple. Users can then clck on hghlghted members, to see a spatotemporal sldeshow, startng at that event of nterest Event Cone temporal transton arcs selected user sldeshow Fgure 6: Spato-Temporal Evoluton. For every user, the system shows the events that the user partcpates n over space and tme. events tme selected event two frends meet agan Fgure 7: Ths s a snapshot of all the events assocated wth the selected users. The events are ordered along the vertcal axs and the horzontal axs shows tme. The event cone vsualzaton addresses the task of event support. Ths vsualzaton attempts to provde a summarzed snapshot of the event relatons over tme and space. We call such a summary event cone, as seen n Fgure 7. Note that, whle the spatotemporal evoluton does enable users to understand what happens to a person over tme, t doesn t allow a proper understandng of the event relatonshps. When the user selects her event of nterest n the spato-temporal browser, an event cone of that event s shown, whch shows the

6 tmelne of events of all the partcpants of that event, pror to and after that event. Each partcpant has a dstnct path and s ndvdually colored. When the paths ntersect, they mply that the frends meet. Users can contnue nteractng wth ths vsualzaton by choosng other events from the currently dsplayed event cone, whch wll redraw the event cone wth the chosen event as the center Vewpont Based Evoluton supports Current Event vewponts next event (vewpont dependent Sldeshow Fgure 8: The user can dynamcally change the vewpont, thus changng the sldeshow assocated wth the vewpont, as well as the future event. We present our vsualzaton scheme that allows for vewpont (.e. personalzed narratves based exploraton of events. The dea that users desre agency [5] users proactvely nteract wth the system to control the sequence of events they see, s ncorporated n ths vsualzaton. Intally, crcles representng events assocated wth the selected user appear on locatons n the map. As seen n Fgure 8, the vewponts assocated wth an event, are dsplayed around t. Also the set of precedng events for the current event and one succeedng event are shown as red and blue crcles respectvely. The set of precedng events for each event are calculated as the unon of all events that precede each of the vewponts of the event. The dea behnd ths s to provde context for the user to understand how the event happened, through each vewpont s perspectve. Now users can select vew ponts around the current event, to see a sldeshow of meda assocated wth the event (and the selected vewpont. Also the succeedng event for each event, changes accordng to the chosen vewpont. Thus, the user can contnue to explore any event/vewpont of ther nterest. Thus ths s a very dynamc envronment that allows users to explore events/vewponts n a non lnear manner. 7. ANALYSIS AND FEEDBACK In [8], the authors dscuss why t s vtal for the desgn of user nterfaces for onlne communtes to provde the means to communcate socal cues and nformaton. We attempt to provde such cues to users about ther socal network as they nteract wth our system. 7.1 Actvty Our system allows users to upload meda about ther events and experences, and share them wth frends n ther socal network, through the vsualzaton nterface. Hence the term actvty has two dfferent meanngs assocated wth t (a User actvty by partcpaton and (b User actvty by nteracton. The former refers to actual socal actvty.e. users partcpatng n events and sharng them through our system wth other frends. Ths nformaton s lmted to the extent that the user uploads to the system. The latter refers to the way users nteract wth the system,.e. how they actually vew the meda n the system, who they pay attenton to, etc. Ths can be captured by keepng detaled logs of user nteracton n our system. We would lke to use avalable nformaton about user actvty (.e. by both partcpaton and nteracton to provde vsual feedback to users through the system. Two questons that we attempt to answer for each user through actvty analyss are: (a Who are the people (wthn my network, that I nteract the most wth? and (b Whch are the most mportant events to me? In the followng sub-secton, we descrbe the capture and computaton of user actvty. 7.2 Actvty Capture The three vsualzaton schemes descrbed n the prevous secton complement each other. The functonalty of each vsualzaton wll determne the type of user actvty data we collect from them. We shall descrbe the nformaton collected from each n detal n the followng sectons. Note that the actvty results wll be n general dfferent for each member of the network Spato-Temporal Evoluton Snce ths vsualzaton provdes users choce to watch the actvtes of the socal network members they are nterested n, we conjecture that the tme spent by the user on each member s a good ndcator of the user nterest n that member. Snce ths tme s based by the number of photographs uploaded by that member, we use a normalzed tme score ( t ST. See <6>. To calculate the score of the user wth respect to each member of the socal network, we defne an exponental growth functon on the normalzed tme spent on each member, by the user. The ntuton behnd usng a functon that vares exponentally wth tme s that concepts added to memory also grow at an exponental rate. The equaton used s gven below: np ( tst ( U, P = ts( U, P, NP ( ST W ( U, P = 1 e αt, ST <6> where W ST (U, P s the weght assgned to partcpant P wth respect to the currently logged user U n the spato temporal vsualzaton. n(p s the number of photographs of partcpant P s spato temporal sldeshow that the user saw, N(P s the total number of photographs for P, and t s s the total tme spent by the user on P Event-Cones Ths vsualzaton allows users to see a snapshot of how an event occurred. Thus, n ths vsualzaton users focus on the event tself, rather than ts partcpants. Consequently, we conjecture that the tme spent by users vewng each event s a good ndcator of that event s mportance. We proceed as follows. We record the tme spent on the event by the user, and apply the exponental growth equaton to get the mportance score of each event for the gven user. Snce every event n the event cone s represented by a sngle photograph, we do not need to normalze the tme score here. te W ( U, E = 1 e α <7> EC Where W EC (U, E s the score of the event E for the gven user U, n the event cone vsualzaton, te s the tme spent by the gven user on event E n the event cone vsualzaton.

7 7.2.3 Vewpont Centrc Vsualzaton Whle browsng n ths vsualzaton, users can ether follow all events of a partcular user, or choose a completely non-lnear path, by followng dfferent vewponts of arbtrary events. Hence, user actvty n ths vsualzaton can gve us nformaton about both event mportance and mportance of the members to the user. We measure event mportance as a fracton gven by the rato of number of vewponts of that event that have been seen, to the total number of vewponts for that event. Thus, events, for whch all vewponts have been vewed by the user, would have the maxmum weght. NVseen( E WVP( U, E = NVtotal ( E <8> Where W VP (U,E s the weght of the event E for user U n the vewpont centrc vsualzaton, NV seen (E s the number of vewponts of that event that have been seen, and NV total (E s the total number of vewponts of that event. For member mportance, we record the aggregate of tme spent by the user n browsng that partcpant s vewpont and normalze t. We also use a smlar exponental functon as n <6> to arrve at the weght of the frend wth respect to the gven user, descrbed as follows. np ( t ( U, P (,, VP = ts U P N( P tvp W ( U, P = 1 e α, VP <9> Where W VP (U, P s the weght assgned to partcpant P wth respect to the currently logged user U n the vewpont centrc vsualzaton. n(p and N(P are the total number of photographs of P s vewpont that the user saw, and total number of photographs for P s vewpont respectvely, and t s s the total tme spent by the user on P. 7.3 Aggregate Actvty Scores We descrbe how we arrve at aggregate event mportance scores and user mportance scores, from the data collected on user actvty. Snce we calculate both event scores and people scores for a gven user from dfferent vsualzatons, we need a way to compare the scores across vsualzatons. Hence we perform another normalzaton step, where we obtan the mean and standard devaton of each score per vsualzaton, across sessons. Let us assume that we are calculatng the normalzed score for the vewpont centrc vsualzaton. We use the raw scores to obtan a re-weghted score, as follows: E ( µ e En( =, 3σ e Pm ( µ p Pn ( m =, 3σ p <10> Where E N corresponds to the score of the event, µ e s the mean of all event scores for that vsualzaton, and σ e s the standard devaton of the event scores dstrbuton over all sessons. The correspondng normalzed people score P N s also calculated n the same way as gven above. Dong ths step ensures that the sgnfcance of scores obtaned across vsualzatons s comparable. We repeat ths calculaton for the other two vsualzatons as well. To calculate event mportance scores for each user, we use data about user actvty collected from two vsualzatons the event cone and the vewpont centrc vsualzaton. The average of the normalzed event mportance from these two vsualzatons (E Ne (, E Nv (, gves the fnal event mportance. Here E Ne ( and E Nv ( corresponds to event scores from event cone and vewpont vsualzatons respectvely, computed usng <10>. To calculate mportance scores per user, wth respect to all the other users n the network, we use actvty nformaton collected from spato-temporal evoluton and vewpont centrc vsualzatons. Smlar to event mportance, partcpant mportance s also calculated as average of the normalzed scores obtaned from both the above mentoned vsualzatons (P Ns (m and P Nv (m. 7.4 Vsual cues We descrbe n ths secton, how we use mportance scores obtaned above, to provde vsual feedback to each user, through the system. The purpose of ths s two fold (a provdng feedback to the user about her nteracton, gves her nterestng nsghts and (b the system can learn from user behavor and adapt vsualzaton and nteracton to sut user preferences and resource constrants. Most mportant Least mportant Fgure 9: The above fgure shows vsual cues that ndcate mportant people and mportant events. Color ndcates mportance n people, and saturaton ndcates mportance n events. Red dots above photographs also ndcate partcpant mportance. Our goal s to provde subtle vsual feedback to users nteractng wth the system, rather than explct dsplay of the nformaton calculated. We are motvated by ethnographc studes on Frendster [4]. We use color rather than text, as the prmary form of provdng feedback, guded by general prncples of graphc desgn gven n [15]. We use varyng levels of color to ndcate mportance levels amongst frends n the network, for each user. Photographs of mportant frends n the network appear the brghtest, and frends wth whom the user s actvty ndex s low, appear grayed out. The contrast perceved when the network members photographs vary from color to grey scale, communcates ther mportance or rank very well. We addtonally use red dots above member photographs to ndcate the top fve mportant people to the user. See Fgure 9. To ndcate mportant events to users as they are browsng n the system, we use color saturaton. The saturaton of the color of the event beng rendered ncreases (as the events become less mportant. Thus the most mportant events (accordng to that user s nteracton hstory, would appear darkest. (See Fgure 9.

8 8. EXPERIMENTS We had conducted some prelmnary experments n [3] to only evaluate our vsualzatons. Users were asked to evaluate each of the three vsualzaton schemes.e. vewpont based evoluton, spato-temporal evoluton and event cones. We found our vsualzaton schemes were well lked. In order to evaluate the current system, we asked a group of nne members, seven students and two faculty members to partcpate n the evaluaton. Partcpants could use the web nterface to upload ther everyday personal meda, or send photos to the system through emal from ther cell phone. The partcpants nteracted wth the annotaton and presentaton systems for a perod of one week and recorded ther observatons of partcpaton n the socal network. We opted for a observerpartcpant user-study analyss as opposed to a plot user study, to understand the practce of networked meda use. Most users found the dea of collaboratve annotaton to be nterestng. Some of the postve comments are as follows: The recommendatons make thngs easer for annotaton and are often approprate, recommendatons of names, usng frequency worked well, as mages related to a sngle event are uploaded one after another at one go. Comments about the vsualzaton nterface the event cone vsualzaton s awesome really deal for seeng whose paths crossed when and where, vewpont centrc vsualzaton s a good dea, as many tmes we see a photographs of frends and would lke to add your vewpont about them. Some of the negatve feedback were the sldeshow n the spato temporal evoluton was a lttle too fast, the event cone becomes cluttered when there are more photographs, we should not be forced to create new events, for events that occur perodcally, that mean the same thng but at dfferent tme spans e.g. drvng to work, takng dance lessons. We found these observatons very helpful and encouragng we also plan on conductng a long-term user study to gan further nsght. 9. CONCLUSIONS AND FUTURE WORK We now present our conclusons. In ths paper, we descrbed our system to enable users n a socal network communcate ther everyday experences. Our framework provdes (a an easy to use web nterface to upload meda, b a novel recommendaton system to help users author the uploaded meda, (c presentaton and nteractons schemes to share and vsualze the meda and (d vsual cues to provde feedback to users about ther nteracton. Our collaboratve annotaton system uses meda features, usercontext, group-context and a common sense knowledge base (ConceptNet, to provde recommendatons that enable users to author shared meda. Our presentaton schemes enable users n the socal network to vsualze and nteract wth the shared meda. The actvty analyss subsystem provdes vsual cues that reflect users nteracton wth each other. Our ntal study ndcates that our nterfaces were well lked. We plan to address ssues such as allowng users to structure events and create semantc relatonshps between them. We also plan to conduct extensve user studes to evaluate the system further as well as add more vsualzatons and use Support Vector Machnes [6] to mprove feature based group recommendatons. 10. REFERENCES [1] TIGER maps [2] Frendster [3] P. APPAN and H. SUNDARAM (2004. Networked event exploraton and nteracton summarzaton, Proc. ACM Multmeda 2004, New York, New York, also AME TR , Oct [4] D. BOYD (2004. Frendster and Publcly Artculated Socal Networks, Conference on Human Factors and Computng Systems, Venna, [5] K. M. BROOKS (1997. Do story agents use rockng chars? The theory and mplementaton of one model for computatonal narratve, Proceedngs of the fourth ACM nternatonal conference on Multmeda, , [6] N. CRISTIANINI and J. SHAWE-TAYLOR (2000. An ntroducton to support vector machnes : and other kernelbased learnng methods. Cambrdge, U.K. ; New York, Cambrdge Unversty Press. [7] M. DAVIS, N. GOOD and R. SARVAS (2004. From Context to Content: Leveragng Context for Moble Meda Metadata, MobSys 2004 Workshop on Context Awareness, Boston, MA, [8] J. S. DONATH (1997. Inhabtng the vrtual cty:the desgn of socal envronments for electronc communtes, MIT, PhD Thess. [9] S. E. ELLIS and D. P. GROTH (2004. A collaboratve annotaton system for data vsualzaton, Proceedngs of the workng conference on Advanced vsual nterfaces, ACM Press, , [10] J. GEMMELL, G. BELL, R. LUEDER, et al. (2002. MyLfeBts: fulfllng the Memex vson, Proceedngs of the 10 th ACM nternatonal conference on Multmeda, Juan Les-Pns, France, pp , Dec [11] H. KANG and B. SHNEIDERMAN (2000. Vsualzaton Methods for Personal Photo Collectons : Browsng and Searchng n the PhotoFnder, (ICME2000, New York:, IEEE, , [12] H. LIU and P. SINGH (2004. ConceptNet: a practcal commonsense reasonng toolkt. BT Technology Journal 22(4: pp [13] C. SHEN, B. MOGHADDAM, N. LESH, et al. (2001. Personal Dgtal Hstoran: User Interface Desgn, In Proceedngs of Extended Abstracts of Human Factors n Computng Systems (CHI 2001, ACM Press, [14] H. SRIDHARAN, H. SUNDARAM and T. RIKAKIS (2003. Context, memory and Hyper-medaton n Experental Systems, 1st ACM Workshop on Experental Telepresence, n conjuncton wth ACM Multmeda 2003,, Berkeley CA, AME-TR , Nov [15] A. WHITE (2002. The elements of graphc desgn : space, unty, page archtecture, and type. New York, Allworth Press.

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

For 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 information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler 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 information

TN348: Openlab Module - Colocalization

TN348: 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 information

Query Clustering Using a Hybrid Query Similarity Measure

Query 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 information

PRÉSENTATIONS DE PROJETS

PRÉ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 information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace 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 information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.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 information

Real-time Motion Capture System Using One Video Camera Based on Color and Edge Distribution

Real-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 information

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems

A 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 information

Mathematics 256 a course in differential equations for engineering students

Mathematics 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 information

Reducing Frame Rate for Object Tracking

Reducing 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 information

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following. Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal

More information

Cluster Analysis of Electrical Behavior

Cluster 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 information

UB at GeoCLEF Department of Geography Abstract

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 information

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.

BioTechnology. 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 information

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

Term 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 information

Performance Evaluation of Information Retrieval Systems

Performance 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 information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM 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 information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning 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 information

Problem Set 3 Solutions

Problem 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 information

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content 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 information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki 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

An Optimal Algorithm for Prufer Codes *

An 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 information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R 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 information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The 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 information

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps 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 information

Support Vector Machines

Support 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 information

Classifier Selection Based on Data Complexity Measures *

Classifier 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 information

The Effect of Similarity Measures on The Quality of Query Clusters

The Effect of Similarity Measures on The Quality of Query Clusters The effect of smlarty measures on the qualty of query clusters. Fu. L., Goh, D.H., Foo, S., & Na, J.C. (2004). Journal of Informaton Scence, 30(5) 396-407 The Effect of Smlarty Measures on The Qualty of

More information

User Authentication Based On Behavioral Mouse Dynamics Biometrics

User 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 information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A 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 information

Real-time Joint Tracking of a Hand Manipulating an Object from RGB-D Input

Real-time Joint Tracking of a Hand Manipulating an Object from RGB-D Input Real-tme Jont Tracng of a Hand Manpulatng an Object from RGB-D Input Srnath Srdhar 1 Franzsa Mueller 1 Mchael Zollhöfer 1 Dan Casas 1 Antt Oulasvrta 2 Chrstan Theobalt 1 1 Max Planc Insttute for Informatcs

More information

CMPS 10 Introduction to Computer Science Lecture Notes

CMPS 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 information

Simulation Based Analysis of FAST TCP using OMNET++

Simulation 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 information

3D vector computer graphics

3D vector computer graphics 3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres

More information

X- Chart Using ANOM Approach

X- 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 information

CS 534: Computer Vision Model Fitting

CS 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 information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

USING GRAPHING SKILLS

USING GRAPHING SKILLS Name: BOLOGY: Date: _ Class: USNG GRAPHNG SKLLS NTRODUCTON: Recorded data can be plotted on a graph. A graph s a pctoral representaton of nformaton recorded n a data table. t s used to show a relatonshp

More information

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE 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 information

user journey: a series of steps (typically 4-12) which represent a scenario in which a user might interact with the thing you are designing.

user journey: a series of steps (typically 4-12) which represent a scenario in which a user might interact with the thing you are designing. Topc Dscovery user journey: a seres of steps (typcally 4-12) whch represent a scenaro n whch a user mght nteract wth the thng you are desgnng. Two (2) man uses: 1. demonstratng the way users currently

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A 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 information

Private Information Retrieval (PIR)

Private Information Retrieval (PIR) 2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stock-market

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A 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 information

Lecture 5: Multilayer Perceptrons

Lecture 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 information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

with Optic65 and Optic25 Cameras FOR OUTDOOR TRACKING ONLY unless used in conjunction with the Indoor Tracking Accessory.

with Optic65 and Optic25 Cameras FOR OUTDOOR TRACKING ONLY unless used in conjunction with the Indoor Tracking Accessory. wth Optc6 and Optc Cameras Quck Start Gude FOR OUTDOOR TRACKING ONLY unless used n conjuncton wth the Indoor Trackng Accessory. CONGRATULATIONS ON SCORING YOUR SOLOSHOT Our category-creatng lne of personal

More information

FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK

FINDING 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 information

Load Balancing for Hex-Cell Interconnection Network

Load 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 information

Classifying Acoustic Transient Signals Using Artificial Intelligence

Classifying 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 information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism 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 information

Analysis of Collaborative Distributed Admission Control in x Networks

Analysis of Collaborative Distributed Admission Control in x Networks 1 Analyss of Collaboratve Dstrbuted Admsson Control n 82.11x Networks Thnh Nguyen, Member, IEEE, Ken Nguyen, Member, IEEE, Lnha He, Member, IEEE, Abstract Wth the recent surge of wreless home networks,

More information

Load-Balanced Anycast Routing

Load-Balanced Anycast Routing Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance

More information

On Some Entertaining Applications of the Concept of Set in Computer Science Course

On Some Entertaining Applications of the Concept of Set in Computer Science Course On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,

More information

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

Video Proxy System for a Large-scale VOD System (DINA)

Video Proxy System for a Large-scale VOD System (DINA) Vdeo Proxy System for a Large-scale VOD System (DINA) KWUN-CHUNG CHAN #, KWOK-WAI CHEUNG *# #Department of Informaton Engneerng *Centre of Innovaton and Technology The Chnese Unversty of Hong Kong SHATIN,

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem 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 information

Summarizing Data using Bottom-k Sketches

Summarizing Data using Bottom-k Sketches Summarzng Data usng Bottom-k Sketches Edth Cohen AT&T Labs Research 8 Park Avenue Florham Park, NJ 7932, USA edth@research.att.com Ham Kaplan School of Computer Scence Tel Avv Unversty Tel Avv, Israel

More information

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information

PYTHON IMPLEMENTATION OF VISUAL SECRET SHARING SCHEMES

PYTHON IMPLEMENTATION OF VISUAL SECRET SHARING SCHEMES PYTHON IMPLEMENTATION OF VISUAL SECRET SHARING SCHEMES Ruxandra Olmd Faculty of Mathematcs and Computer Scence, Unversty of Bucharest Emal: ruxandra.olmd@fm.unbuc.ro Abstract Vsual secret sharng schemes

More information

Edge Detection in Noisy Images Using the Support Vector Machines

Edge 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 information

(1) The control processes are too complex to analyze by conventional quantitative techniques.

(1) The control processes are too complex to analyze by conventional quantitative techniques. Chapter 0 Fuzzy Control and Fuzzy Expert Systems The fuzzy logc controller (FLC) s ntroduced n ths chapter. After ntroducng the archtecture of the FLC, we study ts components step by step and suggest a

More information

Visual Thesaurus for Color Image Retrieval using Self-Organizing Maps

Visual 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 information

Wightman. Mobility. Quick Reference Guide THIS SPACE INTENTIONALLY LEFT BLANK

Wightman. Mobility. Quick Reference Guide THIS SPACE INTENTIONALLY LEFT BLANK Wghtman Moblty Quck Reference Gude THIS SPACE INTENTIONALLY LEFT BLANK WIGHTMAN MOBILITY BASICS How to Set Up Your Vocemal 1. On your phone s dal screen, press and hold 1 to access your vocemal. If your

More information

High-Boost Mesh Filtering for 3-D Shape Enhancement

High-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 information

Empirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap

Empirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap Int. Journal of Math. Analyss, Vol. 8, 4, no. 5, 7-7 HIKARI Ltd, www.m-hkar.com http://dx.do.org/.988/jma.4.494 Emprcal Dstrbutons of Parameter Estmates n Bnary Logstc Regresson Usng Bootstrap Anwar Ftranto*

More information

MODULE DESIGN BASED ON INTERFACE INTEGRATION TO MAXIMIZE PRODUCT VARIETY AND MINIMIZE FAMILY COST

MODULE DESIGN BASED ON INTERFACE INTEGRATION TO MAXIMIZE PRODUCT VARIETY AND MINIMIZE FAMILY COST INTERNATIONAL CONFERENCE ON ENGINEERING DESIGN, ICED 07 28-31 AUGUST 2007, CITE DES SCIENCES ET DE L'INDUSTRIE, PARIS, FRANCE MODULE DESIGN BASED ON INTERFACE INTEGRATION TO MAIMIZE PRODUCT VARIETY AND

More information

Optimizing Document Scoring for Query Retrieval

Optimizing 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 information

Computer models of motion: Iterative calculations

Computer models of motion: Iterative calculations Computer models o moton: Iteratve calculatons OBJECTIVES In ths actvty you wll learn how to: Create 3D box objects Update the poston o an object teratvely (repeatedly) to anmate ts moton Update the momentum

More information

KIDS Lab at ImageCLEF 2012 Personal Photo Retrieval

KIDS 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 information

EECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science

EECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science EECS 730 Introducton to Bonformatcs Sequence Algnment Luke Huan Electrcal Engneerng and Computer Scence http://people.eecs.ku.edu/~huan/ HMM Π s a set of states Transton Probabltes a kl Pr( l 1 k Probablty

More information

Virtual Machine Migration based on Trust Measurement of Computer Node

Virtual Machine Migration based on Trust Measurement of Computer Node Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on

More information

Machine Learning: Algorithms and Applications

Machine 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 information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A New Approach For the Ranking of Fuzzy Sets With Different Heights New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays

More information

Synthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007

Synthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007 Syntheszer 1.0 A Varyng Coeffcent Meta Meta-Analytc nalytc Tool Employng Mcrosoft Excel 007.38.17.5 User s Gude Z. Krzan 009 Table of Contents 1. Introducton and Acknowledgments 3. Operatonal Functons

More information

Local Quaternary Patterns and Feature Local Quaternary Patterns

Local 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 information

Related-Mode Attacks on CTR Encryption Mode

Related-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 information

Searching Large Image Databases using Color Information

Searching Large Image Databases using Color Information Searchng Large Image Databases usng Color Informaton Ioan Racu CMSC350: Artfcal Intellgence Wnter Quarter 2004 Department of Computer Scence Unversty of Chcago racu@cs.uchcago.edu ABSTRACT The goal of

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 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 information

AP PHYSICS B 2008 SCORING GUIDELINES

AP PHYSICS B 2008 SCORING GUIDELINES AP PHYSICS B 2008 SCORING GUIDELINES General Notes About 2008 AP Physcs Scorng Gudelnes 1. The solutons contan the most common method of solvng the free-response questons and the allocaton of ponts for

More information

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Інформаційні технології в освіті ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Some aspects of programmng educaton

More information

A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION

A 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 information

Ontology Generator from Relational Database Based on Jena

Ontology Generator from Relational Database Based on Jena Computer and Informaton Scence Vol. 3, No. 2; May 2010 Ontology Generator from Relatonal Database Based on Jena Shufeng Zhou (Correspondng author) College of Mathematcs Scence, Laocheng Unversty No.34

More information

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

NAG 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 information

Enhanced Watermarking Technique for Color Images using Visual Cryptography

Enhanced 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 information

A Gradient Difference based Technique for Video Text Detection

A Gradient Difference based Technique for Video Text Detection A Gradent Dfference based Technque for Vdeo Text Detecton Palaahnakote Shvakumara, Trung Quy Phan and Chew Lm Tan School of Computng, Natonal Unversty of Sngapore {shva, phanquyt, tancl }@comp.nus.edu.sg

More information

A Clustering Algorithm for Key Frame Extraction Based on Density Peak

A Clustering Algorithm for Key Frame Extraction Based on Density Peak Journal of Computer and Communcatons, 2018, 6, 118-128 http://www.scrp.org/ournal/cc ISSN Onlne: 2327-5227 ISSN Prnt: 2327-5219 A Clusterng Algorthm for Key Frame Extracton Based on Densty Peak Hong Zhao

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement 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 information

Analysis of Continuous Beams in General

Analysis 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 information

Learning-Based Top-N Selection Query Evaluation over Relational Databases

Learning-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 information

A Gradient Difference based Technique for Video Text Detection

A Gradient Difference based Technique for Video Text Detection 2009 10th Internatonal Conference on Document Analyss and Recognton A Gradent Dfference based Technque for Vdeo Text Detecton Palaahnakote Shvakumara, Trung Quy Phan and Chew Lm Tan School of Computng,

More information

Hybrid Non-Blind Color Image Watermarking

Hybrid Non-Blind Color Image Watermarking Hybrd Non-Blnd Color Image Watermarkng Ms C.N.Sujatha 1, Dr. P. Satyanarayana 2 1 Assocate Professor, Dept. of ECE, SNIST, Yamnampet, Ghatkesar Hyderabad-501301, Telangana 2 Professor, Dept. of ECE, AITS,

More information

CHAPTER 2 DECOMPOSITION OF GRAPHS

CHAPTER 2 DECOMPOSITION OF GRAPHS CHAPTER DECOMPOSITION OF GRAPHS. INTRODUCTION A graph H s called a Supersubdvson of a graph G f H s obtaned from G by replacng every edge uv of G by a bpartte graph,m (m may vary for each edge by dentfyng

More information

Parallel matrix-vector multiplication

Parallel matrix-vector multiplication Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more

More information

AVO Modeling of Monochromatic Spherical Waves: Comparison to Band-Limited Waves

AVO Modeling of Monochromatic Spherical Waves: Comparison to Band-Limited Waves AVO Modelng of Monochromatc Sphercal Waves: Comparson to Band-Lmted Waves Charles Ursenbach* Unversty of Calgary, Calgary, AB, Canada ursenbach@crewes.org and Arnm Haase Unversty of Calgary, Calgary, AB,

More information

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.

More information

Estimating Costs of Path Expression Evaluation in Distributed Object Databases

Estimating Costs of Path Expression Evaluation in Distributed Object Databases Estmatng Costs of Path Expresson Evaluaton n Dstrbuted Obect Databases Gabrela Ruberg, Fernanda Baão, and Marta Mattoso Department of Computer Scence COPPE/UFRJ P.O.Box 685, Ro de Janero, RJ, 2945-970

More information

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process

More information