Most of current facial animation editing techniques are frame-based approaches (i.e., manually edit one keyframe every several frames), which is ineffective, time-consuming, and prone to editing inconsistency. In this...
详细信息
Automated negotiation mechanisms can be helpful in contexts where users want to reach mutually satisfactory agreements about issues of shared interest, especially for complex problems with many interdependent issues. ...
详细信息
Automated negotiation mechanisms can be helpful in contexts where users want to reach mutually satisfactory agreements about issues of shared interest, especially for complex problems with many interdependent issues. A variety of automated negotiation mechanisms have been proposed in the literature. The effectiveness of those mechanisms, however, may depend on the charaeteristics of the underlying negotiation problem (e.g. on the complexity of participant's utility functions, as well as the degree of conflict between participants). While one mechanism may be a good choice for a negotiation problem, it may be a poor choice for another. In this paper, we pursue the problem of selecting the most effective negotiation mechanism given a particular problem by (1) defining a set of scenario metrics to capture the relevant features of negotiation problems, (2) evaluating the performance of a range of negotiation mechanisms on a diverse test suite of negotiation scenarios, (3) applying machine learning techniques to identify which mechanisms work best with which scenarios, and (4) demonstrating that using these classification rules for mechanism selection enables significantly better negotiation performance than any single mechanism alone.
Geometric Algebra (GA) supports the geometrically intuitive development of an algorithm with its build-in geometric primitives such as points, lines, spheres or planes. But on the negative side GA has a huge computati...
详细信息
ISBN:
(纸本)9788086943909
Geometric Algebra (GA) supports the geometrically intuitive development of an algorithm with its build-in geometric primitives such as points, lines, spheres or planes. But on the negative side GA has a huge computational footprint. In this paper we study how GA can compete with traditional methods from Linear Algebra (LA) in the field of raytracing. We examine the raytracing algorithm for both GA and LA on the basis of primitive operations. Furthermore we introduce a novel framework for rendering point clouds based on spheres and planes as surface elements. We use this model to benchmark implementations of both algebras. Our results show that depending on the microprocessor architecture like CPUs, FPGAs or GPUs Geometric Algebra and Linear Algebra can raytrace with comparable speed.
Most current research on automatically captioning and describing scenes with spatial content focuses on images. We outline that generating descriptive text for a synthesized 3D scene can be achieved via a suitable int...
详细信息
A natural language based color naming system for color raster graphics, the Artist's Color Naming System (ACNS), is introduced. ACNS is an English-based nomenclature which is a high-level alternative to the numeri...
详细信息
Point-based geometry representations have become widely used in numerous contexts,ranging from particle-based simulations,over stereo image matching,to depth sensing via light detection and *** application focus is on...
详细信息
Point-based geometry representations have become widely used in numerous contexts,ranging from particle-based simulations,over stereo image matching,to depth sensing via light detection and *** application focus is on the reconstruction of curved line structures in noisy 3D point cloud *** algorithms operating on such point clouds often rely on the notion of a local *** the latter,our approach employs multi-scale neighborhoods,for which weighted covariance measures of local points are *** line structures are reconstructed via vector field tracing,using a bidirectional piecewise streamline *** also introduce an automatic selection of optimal starting points via multi-scale geometric *** pipeline development and choice of parameters was driven by an extensive,automated initial analysis process on over a million prototype test *** behavior of our approach is controlled by several parameters—the majority being set automatically,leaving only three to be controlled by a *** an extensive,automated final evaluation,we cover over one hundred thousand parameter sets,including 3D test geometries with varying curvature,sharp corners,intersections,data holes,and systematically applied varying types of ***,we analyzed different choices for the point of reference in the co-variance computation;using a weighted mean performed best in most *** addition,we compared our method to current,publicly available line reconstruction *** to thirty times faster execution times were achieved in some cases,at comparable error ***,we also demonstrate an exemplary application on four real-world 3D light detection and ranging datasets,extracting power line cables.
In recent years, Geometric Algebra (GA) has become more and more popular in fields of science and engineering due to its potential for compact algorithms. However, the execution of GA algorithms and the related need f...
详细信息
ISBN:
(纸本)9788086943855
In recent years, Geometric Algebra (GA) has become more and more popular in fields of science and engineering due to its potential for compact algorithms. However, the execution of GA algorithms and the related need for high computational power is still the limiting factor for these algorithms to be used in practice. Therefore, it would be desirable to automatically detect parts that can be calculated in parallel by a software tool. In this paper, we present Gaalop 2.0, a Geometric Algebra Algorithm Compiler, which takes as input the description of a GA algorithm, symbolically optimizes the output multivectors and compiles the optimized code into a target language source file such as C++, for instance. For each output multivector the code for the different coefficients is generated, which is finally adjusted to contain only basic arithmetic operations instead. This allows the optimized output to be compiled for parallel computing platforms like FPGAs, for instance.
A method is discussed for combining flexibility in defining 3-dimensional geometric shape with system maintained integrity. Such capabilities allow the user to concentrate on local considerations in modifying design d...
详细信息
The authors present, in a unifying framework, the principles of the IIICAD system, a generic design apprentice currently under development at CWI. IIICAD incorporates three kinds of design knowledge. First, it has gen...
详细信息
AbstractThe ability of the finite octree and finite quadtree automatic mesh generators to satisfy effectively a wide variety of meshing capabilities is demonstrated. Areas considered include the ability to integrate e...
AbstractThe ability of the finite octree and finite quadtree automatic mesh generators to satisfy effectively a wide variety of meshing capabilities is demonstrated. Areas considered include the ability to integrate easily with geometric modelling systems, versatile interactive mesh control functions, the ability to reorder unknowns directly from the finite element data structure and the ability to support automated finite element modelling.
暂无评论