ppxscal/embedding_network huggingface dataset:
Model-based human pose estimation and tracking
Authors: Ramakant Nevatia
Venue:  (2006)

Estimating human body pose in static images and tracking pose in monocular video are important for many image and video understanding applications including video surveillance. This is a difficult problem due to the presence of image noise, ambiguities in image observation, high dimensional state space and partial occlusion of the human body. The challenge is to handle realistic scenarios where the person may appear in arbitrary posture and without using special markers on the human body or clothing. A model-based framework is proposed for human pose estimation. A human body model is built to represent important characteristics of human pose, shape and clothing and it is used for pose estimation in an analysis-by-synthesis approach. With an object-centric human model, the proposed method is relatively less sensitive to different camera viewpoints. A statistical inference technique based on data-driven Markov chain Monte Carlo (DD-MCMC) is used to estimate the pose. Body components such as face, shoulders and limbs, are detected using various image cues including pattern, color and edges. A hierarchical approach is also developed to extract 2D positions of limbs efficiently using edge features such as parallel lines and shape contours. The results of these component detections are used to generate data-driven hypotheses of the pose parameters so that the state space can be searched more intelligently and efficiently. To track multiple people in the scene, a multi-level hierarchical state representation is used to estimate their poses in a coarse-to-fine manner. The proposed method addresses several important issues related to pose estimation and tracking. It can handle a large variation of human pose and appearance and from different viewpoints without requiring large number of training data. Different types of image cues are used to guide pose inference and this improve the efficiency and robustness of the method. This enables automatic pose initialization at the beginning of tracking as well as re-initialization of pose following tracking failure. Experimental results on images, indoor and outdoor video sequences show that the method is able to estimate and track poses of single and multiple persons in realistic scenarios.
Dynamically parameterized algorithms and architectures to exploit signal variations for improved performance and reduced power
Authors: W. Burleson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

Signal processing algorithms and architectures can use dynamic reconfiguration to exploit variations in signal statistics with the objectives of improved performance and reduced power consumption. Parameters provide a simple and formal way to characterize incremental changes to a computation and its computing mechanism. This paper examines five parameterized computations which are typically implemented in hardware for a wireless multimedia terminal: (1) motion estimation, (2) discrete cosine transform, (3) Lempel-Ziv lossless compression, (4) 3D graphics light rendering and (5) Viterbi decoding. Each computation is examined for the capability of dynamically adapting the algorithm and architecture parameters to variations in their respective input signals. Dynamically reconfigurable low-power implementations of each computation are currently underway.
A Fast Rejuvenation Technique for Server Consolidation with Virtual Machines
Authors: Kenichi Kourai, Shigeru Chiba
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

As server consolidation using virtual machines (VMs) is carried out, software aging of virtual machine monitors (VMMs) is becoming critical. Performance degradation or crash failure of a VMM affects all VMs on it. To counteract such software aging, a proactive technique called software rejuvenation has been proposed. A typical example of rejuvenation is to reboot a VMM. However, simply rebooting a VMM is undesirable because that needs rebooting operating systems on all VMs. In this paper, we propose a new technique for fast rejuvenation of VMMs called the warm-VM reboot. The warm-VM reboot enables efficiently rebooting only a VMM by suspending and resuming VMs without accessing the memory images. To achieve this, we have developed two mechanisms: on-memory suspend/ resume of VMs and quick reload of VMMs. The warm- VM reboot reduces the downtime and prevents the performance degradation due to cache misses after the reboot
Enhancing Transparency of a Position-Exchange Teleoperator
Authors: Mohsen Mahvash, Allison M. Okamura
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

Dynamic properties of robotic manipulators, including inertia, damping, and friction, limit the transparency of a haptic-feedback teleoperator. In this paper, we de- velop a position-exchange controller to provide haptic- feedback for a surgical teleoperator. The controller con- sists of proportional controllers and model-based feed- forward terms that cancel the dynamic properties of the manipulators. We show that the teleoperator transmits the impedance of a soft environment to the operator when the gains of the proportional controllers are very high and dynamic terms of the manipulators are can- celed. However, the high gains and complete cancel- lation of the dynamic terms of the manipulators can make the teleoperator unstable. We use Llewellyn's cri- teria for absolute stability to limit the controller para- meters to values that keep the teleoperator stable during interactions with any passive user and environment. Experimental results using a custom version of the da Vinci Surgical System show that 70% of the inertia of the slave manipulators during low-frequency motion and almost all static friction of the manipulators dur- ing sliding motion can be canceled.
Source-driven packet marking for speech transmission over differentiated-services networks
Authors: J. C. De Martin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

We present a source-driven approach to packet marking for speech transmission over packet networks implementing the Differentiated Services model. Packets generated by the speech coder are examined: if deemed perceptually critical, they are marked as premium and sent on a "virtual wire;" otherwise, they are sent as regular best-effort traffic. Applied to speech coded with the ITU-T 8 kb/s speech coding standard G.729, the proposed source-driven packet marking scheme outperforms source-transparent techniques and provides clearly better perceptual quality than the unprotected case sending as little as 1/5 of the coded bitstream as premium traffic.
Optimal Selective Huffman Coding for Test-Data Compression
Authors: Xrysovalantis Kavousianos, Emmanouil Kalligeros, Dimitris Nikolos
Venue: IEEE Transactions on Computers (2007)

Selective Huffman coding has been recently proposed for efficient test-data compression with low hardware overhead. In this paper we show that the already proposed encoding scheme is not optimal and we present a new one, proving that it is optimal. Moreover, we compare the two encodings theoretically and we derive a set of conditions which show that, in practical cases, the proposed encoding offers always better compression. In terms of hardware overhead, the new scheme is at least as low-demanding as the old one. The increased compression efficiency, the resulting test-time savings, and the low hardware overhead of the proposed method are also verified experimentally.
A sub-space method for high resolution bathymetry
Authors: A. Antoniou
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

To increase the accuracy and the rate of coverage of a given area in shallow coastal waters, light-detection and ranging (lidar) airborne laser ranging systems have been introduced. A new formulation for ocean-depth measurement using the frequency-domain approach as proposed. This technique uses a high-resolution eigensubspace method to estimate the ocean-depth from backscattered noisy data. The problem is addressed for complex attenuation coefficients by utilizing a double eigenstructure decomposition procedure on a Hankel matrix structure. The approach is similar to obtaining the best rational approximation that fits the actual measured data in a least-square sense.
A C-element Latch Scheme with Increased Transient Fault Tolerance for Asynchronous Circuits
Authors: K. T. Gardiner, A. Yakovlev, A. Bystrov
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

A technique of constructing dual-rail Muller pipelines tolerant to transient faults is proposed. The pipeline datapath is either an NCL-D or NCL-X circuit. A dedicated controller implements the error recovery protocol, which significantly improves fault tolerance with respect to the earlier Rail Synchronization method. A case study featuring transient fault simulation is presented.
BBCLB: A Bulletin-Board based Cooperative Load Balance Strategy for Service Grid
Authors: Tianyu Wo, Liang Zhong, Chunming Hu, Jinpeng Huai
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Although many efforts have been put on the load balance in network and job scheduling systems, most of them, however, can not be applied in the service grid environment directly since they are often designed for a homogeneous system with limited scalability. It is still a challenge problem to balance the load among service grid nodes which are often highly dynamic, heterogeneous and linked by wide-area network. In this paper, we present a load balance strategy using several bulletin-boards as load intermediates among grid nodes. A modified thresholds based load transfer algorithm has been applied with a non-preemptive selection policy. Based on the strategy above, a load balance system is realized in CROWN, a service oriented grid middleware, and deployed in the CROWN testbed. The performance evaluations have shown that our strategy can effectively balance the load of service invocation, and improve the system throughput.
Interactive Community Bulletin Boards as Conversational Hubs and Sites for Playful Visual Repartee
Authors: Elizabeth F. Churchill, Les Nelson
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

In this paper we describe an interactive community bulletin board installed within a neighborhood café and art gallery, and the interactions that take place around and through the board. The board features café information and email list sign up, but also allows customers to create publicly displayed, persistent, finger-drawn, digital scribbles. In providing this community composition and posting feature, our board differs from more commonly available designs for one-way advertising of products. Following analysis of the scribbles, and interviews with scribble creators and readers, we offer a brief description of the textual and visual play and repartee patrons engage in. We discuss content forms posted to the board, differentiating between solitary and collaborative play, messaging, and conversational exchange. Our discussion addresses open questions regarding the perspectives and theories that can be applied to address this new form of site-specific, public media exchange.
External memory algorithms for shortest distance and spatio-temporal queries on road network
Authors: Chinya Ravishankar
Venue:  (2006)

Emerging location based applications (LBA) such as air traffic control, intelligent transportation system, digital battlefields and fleet management are maturing as the underlying technologies of wireless communication and GPS mature. Inherent to all such applications is the need to store, retrieve and manage information about the spatial and the temporal attributes of a large number of mobile entities.Typically, objects move along highly non-linear networks of roads, and distances between objects are frequently measured along the roads, and not as the Euclidean separations in R2 , as in most current work. Spatial queries admit efficient solution because data points lie on the plane and distances, which are Euclidean separations, are efficiently computed. Moreover, spatial databases can easily be partitioned while preserving proximity information. This property is the key to the success of spatial index structures such as R-trees and Quad-Trees.To make spatio-temporal queries as efficient as their spatial counterparts, we need to compute shortest distance quickly and allow for proximity-based partitioning.Current algorithms for shortest distance computation turn out not to have the properties that required for spatio-temporal queries. We first present a novel coding-based technique for answering spatial and spatiotemporal queries on objects moving along a system of curves on the plane, such as road networks. It handles join, range, intercept, and other spatial and spatiotemporal queries with distances being measured along the trajectories.This is an advance toward solving the problem in its more general form. Subsequently, we discuss algorithms that are applicable to shortest distance computation over general non-planar graphs. In particular for planar graphs, our DL algorithm computes shortest distances in O(log n) time using O( n n log n) space and O(1) disk access. Our second algorithm NDL reduces storage cost at the expense of distance computation performance. The data structure requires O(n n4 log n) space while the distance computation requires O( n4 log2 n) time and O( n4 ) disk accesses.
The Linux/ia64 project
Authors: David Mosberger
Venue: Proceedings of the 3rd annual conference on Atlanta Linux Showcase - Volume 3 (1999)

This talk gives an overview of the Linux/ia64 project that was started at HP Labs in early 1998 and has now become part of a broader industry effort. The first implementation of the IA-64 architecture is the Merced chip which, on August 31, was for the first time demonstrated in public to run Linux. With the delivery date of Merced-based systems coming closer, this is a good time to learn more what Linux/ia64 is all about. This talk will start with a brief overview of the IA-64 architecture and is followed by a description of the goals of the project, its current status, and outlook for the future.
The dream of Peter Pan: user interaction arts using computer vision techniques
Authors: Kirak Kim, Wooup Kwon, Eunsun Choi, Jinsu Park, Mijeong Jeon, Hyesun Ju, Hyunchul Choi, Woonhyuk Baek, Dongwuk Kyoung, Keechul Jung
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

In this paper, we present the user interaction arts in mixed reality environment using computer vision techniques. In most of the mixed reality environment, user has to wear specific equipment. However, users want to be free from any device and enable them to have more interaction with the computer's scene. In this study, we propose that the user does not need to wear any device, and virtual scenes can be projected everywhere and this creates an excellent platform for user interaction.
System of fuzzy relation equations as a continuous model of IF-THEN rules
Authors: Irina Perfilieva, Vilém Novák
Venue: Information Sciences: an International Journal (2007)

We claim that a fuzzy relation which models a system of fuzzy IF-THEN rules has the property of continuity only if the underlying system of fuzzy relation equations is solvable. In view of this connection, it is important to consider the problem of solvability of a system of fuzzy relation equations - with respect to an unknown fuzzy relation. This problem is analyzed in the present paper. We propose several new necessary and sufficient criteria for the so-called Mamdani relation to be a solution to the system. We prove that in the general case, these same criteria are sufficient (but not always necessary) for the solvability of the system. A new, easy-to-check criterion is proposed for the solvability of the system with special fuzzy parameters.
Proxy-Based Visual Content Repurposing Using Selection Algorithm
Authors: M. Shamim Hossain, Abdulmotaleb El Saddik
Venue: Proceedings of the Sixth International Conference on Networking (2007)

This paper presents a proxy-based visual content repurposing approach, which is used to repurpose visual content dynamically for the transmission over heterogeneous networks and end devices. We use a series of repurposing proxies in a chain fashion between the server and multiple client devices. In order to find the appropriate chain of repurposing services that maximizes the user's satisfaction with the delivered content, we propose a novel service selection algorithm based on user's satisfaction with the quality of the repurposed content which is used as an optimization metric for the repurposing service selection and configuration process. Experimental results show that our approach performs complicated repurposing tasks by breaking them into a series of intermediate tasks and executing them in distributed repurposing proxies with minimal degradation of the final delivered content quality in terms of PSNR.
Controlling information release in the π-calculus
Authors: Silvia Crafa, Sabina Rossi
Venue: Information and Computation (2007)

We introduce a notion of controlled information release for a typed version of the @p-calculus extended with declassification primitives; this property scales to noninterference when downgrading is not allowed. We provide various characterizations of controlled release, based on a typed behavioural equivalence relative to a security level @s, which captures the idea of external observers of level @s. First, we define our security property through a universal quantification over all the possible active attackers, i.e., malicious processes which interact with the system possibly leaking secret information. Then we characterize the controlled release property in terms of an unwinding condition, which deals with so-called passive attackers trying to infer confidential information just by observing the behaviour of the system. Furthermore, we express controlled information release in terms of partial equivalence relations (per models, for short) in the style of a stream of similar studies for imperative and multi-threaded languages. We show that the controlled release property is compositional with respect to most operators of the language leading to efficient proof techniques for the verification and the construction of (compositional) secure systems.
Dynamic trust domains for secure, private, technology-assisted living
Authors: Jatinder Singh, Jean Bacon, Ken Moody
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Large scale distributed systems comprising many administration domains have been well-researched. An example is a national health service, with domains such as primary care practices, hospitals, specialist clinics, etc. A new and relatively unexplored scenario is technology-assisted living, in which domains are small, dynamically created, and are associated with units of personal living. There is a great deal of commercial interest in providing technology to support assisted living, but services are created in isolation. We explore how such services could be integrated with a system that can ensure security and privacy. We propose to audit both system behaviour and the actions of principals, holding particular regard to the fulfilment of their obligations, to establish a computational expression of the trust to be associated with each principal.
Composite Object Detection in Video Sequences: Application to Controlled Environments
Authors: Xavier Giro, Ferran Marques
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

This paper presents a set of techniques for the detection of composite objects in video recordings of a controlled environment. Firstly, a selective region-based analysis is performed by tuning the algorithm to the perceptual characteristics of the object in the environment. Secondly, the controlled perceptual and semantic variabilities of the object are addressed by the detection analysis thanks to a frame by frame update of the object models, and by allowing multiple models for a single object. The proposed techniques are illustrated in the detection of laptops from a zenithal view in a smart room.
Locally optimal maximum-likelihood estimate of a Toeplitz matrix of given rank
Authors: Y. I. Abramovich
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

We derive an algorithm to compute a maximum-likelihood (ML) estimate of a Toeplitz covariance matrix T whose rank is known a priori that is "locally optimal", by maximising the likelihood ratio in the neighborhood of T. This problem arises, for example, in the detection and/or direction-of-arrival (DOA) estimation of m uncorrelated plane-wave sources using a nonuniform (sparse) M-sensor linear antenna array, where m/spl ges/M (the "superior" case), but the problem is important in its own right, and has application to other areas of signal processing and communications. The algorithm relies upon the solution of a convex linear programming (LP) problem, whose feasibility is guaranteed.
Using Multiple Domain Visual Context in Image Analysis
Authors: Phivos Mylonas, Yannis Avrithis
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

In this paper we propose an algorithm to improve the results of knowledge-assisted image analysis, based on contextual information. In order to achieve this, we utilize fuzzy algebra, fuzzy sets and relations, towards efficient manipulation of image region concepts. We provide a novel context modelling, based on the OWL language, using RDF reification. Initial image analysis results are enhanced by the utilization of domain-independent, semantic knowledge in terms of concepts and relations between them. The novelty of the presented work is the context-driven re-adjustment of the degrees of confidence of the detected concepts produced by any image analysis technique, utilizing a domainindependent ontology infrastructure to handle the knowledge, as well as multiple application domains.
(Re)design considerations for scalable large-file content distribution
Authors: Brian Biskeborn, Michael Golightly, KyoungSoo Park, Vivek S. Pai
Venue: Proceedings of the 2nd conference on Real, Large Distributed Systems - Volume 2 (2005)

The CoBlitz system was designed to provide efficient large file transfer in a managed infrastructure environment. It uses a content distribution network (CDN) coupled with a swarm-style chunk distribution system to reduce the bandwidth required at origin servers. With 6 months of operation, we have been able to observe its behavior in typical usage, and glean information on how it could be redesigned to better suit its target audience. At its heart, this paper describes what happens when a plausible conceptual design meets the harsh realities of life on the Internet. We describe our experiences improving CoBlitz's performance via a range of techniques, including measurement-based feedback, heuristic changes, and new algorithms. In the process, we triple CoBlitz's performance, and we reduce the load it places on origin servers by a factor of five. In addition to improving performance for CoBlitz's users, we believe that our experiences will also be beneficial to other researchers working on large-file transfer and content distribution networks.