987011
Similarity normalization for speaker verification by fuzzy fusion
Abstract Similarity or likelihood normalization techniques are important for speaker verification systems as they help to alleviate the variations in the speech signals. In the conventional normalization, the a priori probabilities of the cohort speakers are assumed to be equal. From this standpoint, we apply the theory of fuzzy measure and fuzzy integral to combine the likelihood values of the cohort speakers in which the assumption of equal a priori probabilities is relaxed. This approach replaces the conventional normalization term by the fuzzy integral which acts as a non-linear fusion of the similarity measures of an utterance assigned to the cohort speakers. We illustrate the performance of the proposed approach by testing the speaker verification system with both the conventional and the fuzzy algorithms using the commercial speech corpus TI46. The results in terms of the equal error rates show that the speaker verification system using the fuzzy integral is more flexible and more favorable than the conventional normalization method.
15179866
Audio-Video Person Authentication Based on 3D Facial Feature Warping
In this paper we propose a novel feature warping technique based on thin-plate-spline (TPS) analysis for 3D audio-video person authentication systems. The TPS warp features model information related to non-rigid variations on speaking faces, such as expression lines, gestures, and wrinkles, enhancing the performance of the system against impostor and spoof attacks. Experiments with multimodal fusion of acoustic and TPS shape features for two different speaking face data corpus, VidTIMIT and AVOZES, allowed equal error rates (EERs) of less than 0.5 % for imposter attacks, less than 1 % for type-1 replay attacks (still photo and pre-recorded audio) and less than 2% for more complex type-2 replay attacks (pre-recorded video or fake CG animated video).
43139712
Speaker Verification with Fuzzy Fusion and Genetic Optimization
14972044
Service-Oriented Adaptation in Ubiquitous Computing Environments
Ubiquitous computing environments may offer dynamically discoverable services that can be utilized by adaptive applications to improve their functionality and quality of service. We have developed a general software development framework for context-aware adaptive applications. In this paper we present our novel modeling concepts that extend an existing component-based modeling approach by service-oriented adaptation concepts. With our new extensions a dynamically discovered service may replace an application component if it increases the overall utility of the application. We discuss open questions and point to potential solution approaches.
17740711
Hierarchical data access in structured P2P-networks
Hierarchically structured organizations have clear and relatively short communication paths. However, one does not take advantage of this fact in modern peer-to-peer overlays. We show how a command and control order can be imposed on a given peer-to-peer network. This allows fast hierarchical data storage and data access. Maintaining a hierarchical organization structure upon a given distributed hashtable overlay network scales with O(logN), where N is the number of peers in the network. This approach can be used to benefit from hierarchical structure in any communication system, especially in first response scenarios.
42894925
Modeling of Context-Aware Self-Adaptive Applications in Ubiquitous and Service-Oriented Environments
Mobile computing in ubiquitous environments has to cope with both predictable and unpredictable changes in the execution context, which introduces the need for context-aware adaptive applications. Such environments are also characterized by dynamically discoverable services that can be utilized by applications to improve their functionality and quality of service (QoS). Thus, application adaptation decisions not only depend on context properties, but also on service availability and QoS-properties. In this chapter we present a novel comprehensive modeling approach that facilitates the model-driven development of such applications. Our focus is on modeling concepts which align the description of services and their QoS-properties with the context modeling approach. We provide a harmonized view on context and service properties, bridging the syntactical and semantic differences through an ontology. We also consider related aspects like semantic service discovery and service level agreements.
32510848
Using Augmented Virtuality for Remote Collaboration
This paper describes the concept, prototypical implementation, and usability evaluation of the Augmented Virtuality (AV)-based videoconferencing (VC) system cAR/PE!. We present a solution that allows three participants at different locations to communicate over a network in an environment simulating a traditional face-to-face meeting. Integrated into the AV environment are live video streams of the participants spatially arranged around a virtual table, a large virtual presentation screen for 2D display and application sharing, and 3D geometry (models) within the room and on top of the table. We describe the general concept and application scenario as well as the actual hardware setup, the implementation, and the use of the system in its current state. Results of two usability studies with 87 subjects are presented that show the general usability of our approach as well as good overall satisfaction. Parts of the work described here were presented as a poster at the second International Symposium on Mixed and Augmented Reality (Regenbrecht, Ott, Wagner, Lum, Kohler, et al., 2003. An Augmented Virtuality Approach to 3D Videoconferencing. Poster at 2nd Int. Symp. on Mixed and Aug. Reality, Tokyo.).
751960
Performance Evaluation Methodologies for Abstract Data Type Implementation Techniques
Abstract The runtime management system for a programming language must allow the efficient manipulation of complex objects, such as instances of abstract data types (ADTs). We describe an implementation model for ADTs based on coroutine objects (i.e. as an alternative to ad hoc modifications of the runtime stack). We evaluate the performances of variants of our implementation model using two different approaches: a benchmarking technique which monitors actual costs for test programs and a “pseudo-execution” technique which estimates costs based on idealized instruction timings. The results of our comparison indicate that the two forms of evaluation give very similar cost estimates, supporting the use of the (cheaper) pseudo-execution technique. The overall performance results identify applications in which our coroutine implementation model has definite strengths and weaknesses. Finally, our implementation approach is compared with modified stack implementations used in other ADT systems.