Research Outputs
Permanent URI for this communityhttps://hdl.handle.net/20.500.14288/2
Browse
7 results
Search Results
Publication Metadata only An audio-driven dancing avatar(Springer, 2008) Balci, Koray; Kizoglu, Idil; Akarun, Lale; Canton-Ferrer, Cristian; Tilmanne, Joelle; Bozkurt, Elif; Erdem, A. Tanju; Department of Computer Engineering; N/A; N/A; Department of Computer Engineering; Department of Electrical and Electronics Engineering; Yemez, Yücel; Ofli, Ferda; Demir, Yasemin; Erzin, Engin; Tekalp, Ahmet Murat; Faculty Member; PhD Student; Master Student; Faculty Member; Faculty Member; Department of Computer Engineering; Department of Electrical and Electronics Engineering; College of Engineering; Graduate School of Sciences and Engineering; Graduate School of Sciences and Engineering; College of Engineering; College of Engineering; 107907; N/A; N/A; 34503; 26207We present a framework for training and synthesis of an audio-driven dancing avatar. The avatar is trained for a given musical genre using the multicamera video recordings of a dance performance. The video is analyzed to capture the time-varying posture of the dancer's body whereas the musical audio signal is processed to extract the beat information. We consider two different marker-based schemes for the motion capture problem. The first scheme uses 3D joint positions to represent the body motion whereas the second uses joint angles. Body movements of the dancer are characterized by a set of recurring semantic motion patterns, i.e., dance figures. Each dance figure is modeled in a supervised manner with a set of HMM (Hidden Markov Model) structures and the associated beat frequency. In the synthesis phase, an audio signal of unknown musical type is first classified, within a time interval, into one of the genres that have been learnt in the analysis phase, based on mel frequency cepstral coefficients (MFCC). The motion parameters of the corresponding dance figures are then synthesized via the trained HMM structures in synchrony with the audio signal based on the estimated tempo information. Finally, the generated motion parameters, either the joint angles or the 3D joint positions of the body, are animated along with the musical audio using two different animation tools that we have developed. Experimental results demonstrate the effectiveness of the proposed framework.Publication Metadata only Classification of semantic relations between nominals(Springer, 2009) Girju, Roxana; Nakov, Preslav; Nastase, Vivi; Szpakowicz, Stan; Turney, Peter; Department of Computer Engineering; Yüret, Deniz; Faculty Member; Department of Computer Engineering; College of Engineering; 179996The NLP community has shown a renewed interest in deeper semantic analyses, among them automatic recognition of semantic relations in text. We present the development and evaluation of a semantic analysis task: automatic recognition of relations between pairs of nominals in a sentence. The task was part of SemEval-2007, the fourth edition of the semantic evaluation event previously known as SensEval. Apart from the observations we have made, the long-lasting effect of this task may be a framework for comparing approaches to the task. We introduce the problem of recognizing relations between nominals, and in particular the process of drafting and refining the definitions of the semantic relations. We show how we created the training and test data, list and briefly describe the 15 participating systems, discuss the results, and conclude with the lessons learned in the course of this exercise.Publication Metadata only Multiple facility location on a network with linear reliability order of edges(Springer, Van Godewijckstraat, 2017) Hassin, Refael; Ravi, R.; Department of Industrial Engineering; Salman, Fatma Sibel; Faculty Member; Department of Industrial Engineering; College of Engineering; 178838We study the problem of locating facilities on the nodes of a network to maximize the expected demand serviced. The edges of the input graph are subject to random failure due to a disruptive event. We consider a special type of failure correlation. The edge dependency model assumes that the failure of a more reliable edge implies the failure of all less reliable ones. Under this dependency model called Linear Reliability Order (LRO) we give two polynomial time exact algorithms. When two distinct LRO's exist, we prove the total unimodularity of a linear programming formulation. In addition, we show that minimizing the sum of facility opening costs and expected cost of unserviced demand under two orderings reduces to a matching problem. We prove NP-hardness of the three orderings case and show that the problem with an arbitrary number of orderings generalizes the deterministic maximum coverage problem. When a demand point can be covered only if a facility exists within a distance limit, we show that the problem is NP-hard even for a single ordering.Publication Metadata only On the online multi-agent O-D k-Canadian traveler problem(Springer, 2017) N/A; Department of Industrial Engineering; Shiri, Davood; Salman, Fatma Sibel; PhD Student; Faculty Member; Department of Industrial Engineering; Graduate School of Sciences and Engineering; College of Engineering; N/A; 178838In this article, we present new results on the online multi-agent O–D k-Canadian Traveler Problem, in which there are multiple agents and an input graph with a given source node O and a destination node D together with edge costs such that at most k edges are blocked. The blocked edges are not known a priori and are not recoverable. All of the agents are initially located at O. The objective is to find an online strategy such that at least one of the agents finds a route from the initial location O to a given destination D with minimum total cost. We focus on the case where communication among the agents is limited in the sense that some travelers can both send and receive information while the others can only receive information. We formalize the definition of agents’ intelligence by specifying three levels. We introduce two online strategies which utilize higher levels of agents’ intelligence to provide updated lower bounds to this problem. We show that one of our strategies is optimal in both cases with complete and limited communication in the special case of O–D edge-disjoint graphs and highest level of agents’ intelligence.Publication Metadata only Solving the capacitated local access network design problem(The Institute for Operations Research and the Management Sciences (INFORMS), 2008) Ravi, R.; Hooker, John N.; Department of Industrial Engineering; Salman, Fatma Sibel; Faculty Member; Department of Industrial Engineering; College of Engineering; 178838We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes to a sink node and to install transmission facilities on the edges of the graph to accommodate the flow at minimum cost. We give a branch-and-bound algorithm that solves relaxations obtained by approximating the noncontinuous cost function by its lower convex envelope. The approximations are refined by branching on the flow ranges on selected edges. Our computational experiments indicate that this method is effective in solving moderate-size problems and provides very good candidate solutions early in the branch-and-bound tree.Publication Metadata only Synchrony and complexity in state-related EEG networks: an application of spectral graph theory(MIT Press, 2020) Ghaderi, Amir Hossein; Baltaretu, Bianca R.; Andevari, Masood Nemati; Bharmauria, Vishal; Department of Psychology; Balcı, Fuat; Faculty Member; Department of Psychology; Koç University Research Center for Translational Medicine (KUTTAM) / Koç Üniversitesi Translasyonel Tıp Araştırma Merkezi (KUTTAM); College of Social Sciences and Humanities; 51269The brain may be considered as a synchronized dynamic network with several coherent dynamical units. However, concerns remain whether synchronizability is a stable state in the brain networks. If so, which index can best reveal the synchronizability in brain networks? To answer these questions, we tested the application of the spectral graph theory and the Shannon entropy as alternative approaches in neuroimaging. We specifically tested the alpha rhythm in the resting-state eye closed (rsEC) and the resting-state eye open (rsEO) conditions, a well-studied classical example of synchrony in neuroimaging EEG. Since the synchronizability of alpha rhythm is more stable during the rsEC than the rsEO, we hypothesized that our suggested spectral graph theory indices (as reliable measures to interpret the synchronizability of brain signals) should exhibit higher values in the rsEC than the rsEO condition. We performed two separate analyses of two different datasets (as elementary and confirmatory studies). Based on the results of both studies and in agreement with our hypothesis, the spectral graph indices revealed higher stability of synchronizability in the rsEC condition. The k-mean analysis indicated that the spectral graph indices can distinguish the rsEC and rsEO conditions by considering the synchronizability of brain networks. We also computed correlations among the spectral indices, the Shannon entropy, and the topological indices of brain networks, as well as random networks. Correlation analysis indicated that although the spectral and the topological properties of random networks are completely independent, these features are significantly correlated with each other in brain networks. Furthermore, we found that complexity in the investigated brain networks is inversely related to the stability of synchronizability. In conclusion, we revealed that the spectral graph theory approach can be reliably applied to study the stability of synchronizability of state-related brain networks.Publication Open Access The effects of odor and body posture on perceived duration(Frontiers, 2014) Schreuder, Eliane; Hoeksma, Marco R.; Smeets, Monique A. M.; Department of Psychology; Semin, Gün Refik; Researcher; Department of Psychology; College of Social Sciences and Humanities; 58066This study reports an examination of the internal clock model, according to which subjective time duration is influenced by attention and arousal state. In a time production task, we examine the hypothesis that an arousing odor and an upright body posture affect perceived duration. The experimental task was performed while participants were exposed to an odor and either sitting upright (arousing condition) or lying down in a relaxing chair (relaxing condition). They were allocated to one of three experimental odor conditions: rosemary (arousing condition), peppermint (relaxing condition), and no odor (control condition). The predicted effects of the odors were not borne out by the results. Self-reported arousal (SRA) and pleasure (PL) states were measured before, during (after each body posture condition) and postexperimentally. Heart rate (HR) and skin conductance were measured before and during the experiment. As expected, odor had an effect on perceived duration. When participants were exposed to rosemary odor, they produced significantly shorter time intervals than in the no odor condition. This effect, however, could not be explained by increased arousal. There was no effect of body posture on perceived duration, even though body posture did induce arousal. The results do not support the proposed arousal mechanism of the internal clock model.