15046188
Human Motion Synthesis by Motion Manifold Learning and Motion Primitive Segmentation
We propose motion manifold learning and motion primitive segmentation framework for human motion synthesis from motion-captured data. High dimensional motion capture date are represented using a low dimensional representation by topology preserving network, which maps similar motion instances to the neighborhood points on the low dimensional motion manifold. Nonlinear manifold learning between a low dimensional manifold representation and high dimensional motion data provides a generative model to synthesize new motion sequence by controlling trajectory on the low dimensional motion manifold. We segment motion primitives by analyzing low dimensional representation of body poses through motion from motion captured data. Clustering techniques like k-means algorithms are used to find motion primitives after dimensionality reduction. Motion dynamics in training sequences can be described by transition characteristics of motion primitives. The transition matrix represents the temporal dynamics of the motion with Markovian assumption. We can generate new motion sequences by perturbing the temporal dynamics
123666477
Separating style and content on a nonlinear manifold
Bilinear and multi-linear models have been successful in decomposing static image ensembles into perceptually orthogonal sources of variations, e.g., separation of style and content. If we consider the appearance of human motion such as gait, facial expression and gesturing, most of such activities result in nonlinear manifolds in the image space. The question that we address in this paper is how to separate style and content on manifolds representing dynamic objects. In this paper we learn a decomposable generative model that explicitly decomposes the intrinsic body configuration (content) as a function of time from the appearance (style) of the person performing the action as time-invariant parameter. The framework we present in this paper is based on decomposing the style parameters in the space of nonlinear functions which map between a learned unified nonlinear embedding of multiple content manifolds and the visual input space.
5313535
Variable Length Genomes for Evolutionary Algorithms
A variable length genome has been developed to search variable dimensionality/complexity spaces efficiently. A simple proof of concept experiment shows the utility of such a representation.
32239506
An intelligent fuzzy agent for meeting scheduling decision support system
Abstract An Intelligent Fuzzy Agent for Meeting Scheduling Decision Support System is proposed in this paper. The proposed Intelligent Fuzzy Agent including Meeting Negotiation Agent, Fuzzy Inference Agent and Genetic Learning Agent can search and decide the suitable meeting time for the specified meeting in an organization. When a meeting host requests a meeting, the Meeting Negotiation Agent immediately sends the invitees’ names to Meeting Scheduling Decision Support System for retrieving their schedules from Group Calendar Data Base, then Meeting Scheduling Decision Support System will compute the possible meeting time and respond the results to Meeting Negotiation Agent. Moreover, the Fuzzy Inference Agent infers the adequate meeting time based on the information provided by Meeting Negotiation Agent and Personalized Knowledge Base, and sends the computing result back to Meeting Scheduling Decision Support System. The meeting host will decide the final meeting time based on Meeting Scheduling Decision Support System and announce the meeting information by various devices including PDA, WAP, FAX, or E-mail. Furthermore, the invitees’ decisions for attending the meeting or not will be stored into Meeting Information Knowledge Base, then the Genetic Learning Agent will adjust the Personalized Knowledge Base for the next meeting. By the experimental results, the proposed Intelligent Fuzzy Agent can work efficiently and effectively for Meeting Scheduling Decision Support System.
41633235
Automatic generation of error recovery knowledge through learned reactivity
Develops a new method for automatic generation of error recovery procedures in the assembly workcell. Current reactive systems have integrated planning and learning capabilities to allow them to augment their store of reactive behaviors whenever they are forced to plan. The cycle of evaluation and reaction used by these systems implicitly detects and corrects any errors made in prior behavior execution. By capitalizing on this analogy to error recovery, the authors are able to gain the benefits of a reactive system for use in error recovery while minimizing the perception and evaluation burden that is inherent in those approaches. The authors present a system that uses the new learning reactive paradigm to quickly correct known errors and autonomously learn to recover new errors without human intervention.<<ETX>>
20308502
Object signatures for supporting efficient navigation in object-oriented databases
Most methods that have been proposed to improve query processing in object-oriented databases are designed for the aggregation hierarchy. Although the structure of the generalization hierarchy is similar to the aggregation hierarchy, techniques developed for the aggregation hierarchy cannot fully use the characteristics of the generalization hierarchy to improve performance. We devise a new object signature for the generalization hierarchy. The object signature consists of two parts: a reference signature and a structure signature. The former can be used to eliminate objects that do not match the nested predicates specified in the query, and the latter can be used to eliminate objects that do not belong to the target classes. We propose some processing methods using the object signatures for queries that involve generalization hierarchies. In addition, we define cost models of the object signature and then compare the performance of the traditional query processing method with the object signature method. The results show that using the object signatures can effectively reduce the number of disk accesses in a query.
25374947
A graph-theoretic model for optimizing queries involving methods
Abstract. Traditional algorithms for optimizing the execution order of joins are no more valid when selections and projections involve methods and become very expensive operations. Selections and projections could be even more costly than joins such that they are pulled above joins, rather than pushed down in a query tree. In this paper, we take a fundamental look at how to approach query optimization from a top-down design perspective, rather than trying to force one model to fit into another. We present a graph model which is designed to characterize execution plans. Each edge and each vertex of the graph is assigned a weight to model execution plans. We also design algorithms that use these weights to optimize the execution order of operations. A cost model of these algorithms is developed. Experiments are conducted on the basis of this cost model. The results show that our algorithms are superior to similar work proposed in the literature.