The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Our hands are considered one of the most complex to control actuated systems, thus, emulating the manipulative skills of real hands is still an open challenge even in anthropomorphic robotic hand. While the action of the 4 long fingers and simple grasp motions through opposable thumbs have been successfully implemented in robotic designs, complex in-hand manipulation of objects was difficult to achieve...
In this paper, we present an object categorization system capable of assigning multiple and related categories for novel objects using multi-label learning. In this system, objects are described using global geometric relations of 3D features. We propose using the Joint SVM method for learning and we investigate the extraction of hierarchical clusters as a higher-level description of objects to assist...
In this paper, a new Slepian-Wolf codec was constructed with spatially coupled Low-Density Parity-Check Convolutional (SP-LDPCC) codes. The approach is based on considering the correlation as a virtual binary erasure channel (BEC) and Binary-Input Additive White Gaussian Noise (BIAWGN)channel and applying the syndrome concept. The system is focusing on the compression of a equal-probable memory less...
Robust visual tracking is a challenging problem due to pose variance, occlusion and cluttered backgrounds. No single feature can be robust to all possible scenarios in a video sequence. However, exploiting multiple features has demonstrated its effectiveness in overcoming challenging situations in visual tracking. We propose a new framework for multi-modal fusion at both the feature level and decision...
This study addresses the roles of self-regulation, co-regulation, and socially shared regulation in computer supported collaborative learning environment. An empirical study was conducted with 19 groups of university students working on computer virus prevention tasks. The results indicated that self-regulation, co-regulation, and socially shared regulation occurred during collaborative learning....
This paper presents an approach to utilize eye-tracking technology to analyze and understand complex collaborative competencies that are subsumed under the term learning to learn together (L2L2). One challenge here is to combine fruitfully analyses at different levels, ranging between gaze information, deliberate problem-solving actions, and complex collaborative interactions. Our analysis uses automated...
With the increasing popularity of social network, more and more people tend to store and transmit information in visual format, such as image and video. However, the cost of this convenience brings about a shock to traditional video servers and expose them under the risk of overloading. Among the huge amount of online videos, there are quite a number of Near-Duplicate Videos (NDVs). Although many...
Recently a new “Colour-and-Forward” relaying strategy was proposed for the zero-error primitive relay channel, a relay channel in which the relay to destination link is out of band and of fixed, error-free capacity. This “Colour-and-Forward” scheme forwards the colour (from a minimum colouring) of the node corresponding to its received signal. This colouring is of a carefully designed graph based...
The coordination of autonomous agents is a critical issue for decentralized communication networks. Instead of transmitting information, the agents interact in a coordinated manner in order to optimize a general objective function. A target joint probability distribution is achievable if there exists a code such that the sequences of symbols are jointly typical. The empirical coordination is strongly...
This article continues the recent investigation of combinatorial joint source-channel coding. For the special case of a binary source and channel subject to distortion measured by Hamming distance, the lower (converse) bounds on achievable source distortion are improved for all values of channel noise. Operational duality between coding with bandwidth expansion factors ρ and 1 over ρ is established...
The conditions which govern reliable communication over networks are often given as a union of polyhedra. As increasingly larger networks are considered, these conditions become unwieldy and intractable, unless useful structure can be found in them. An example of a polyhedron with a useful underlying structure is a polymatroid, which despite its exponential number of defining inequalities, has a simple...
The classic problem for a channel with inputs X, outputs Y, and conditional probability pY |X(y|x) is to find the distribution pX(x) that maximizes Shannon's I(X; Y) subject perhaps to constraints imposed on pX(x). Here, we seek instead, for a specified pX(x), the channel pY|X(y|x) that maximizes I(X; Y) subject to constraints on pY |X(y|x). That is, we investigate the part of joint source-channel...
We design low-complexity polar codes for empirical and strong coordination in two-node network. Our constructions hinge on the observation that polar codes may be used to approximate distribution; which we leverage to prove that nested polar codes achieve the capacity region of empirical coordination and strong coordination.
The problem of distributed data compression for function computation is considered, where (i) the function to be computed is not necessarily symbol-wise function and (ii) the information source has memory and may not be stationary nor ergodic. We introduce the class of smooth sources and give a sufficient condition on functions so that the achievable rate region for computing coincides with the Slepian-Wolf...
This paper studies the problem of secure communication over broadcast channels under the lens of individual secrecy constraints (i.e., information leakage from each message to an eavesdropper is made vanishing). It is known that, for the communication over the degraded broadcast channels, the stronger receiver is able to decode the message of the weaker receiver. In the individual secrecy setting,...
The asynchronous-communication model is studied by means of i.i.d. codes and ML decoding. A random-coding bound to the joint probability of decoding and synchronization error is determined and used to recover the region of achievable information rates and asynchrony exponents.
It is well-known that feedback does not increase the capacity of point-to-point memoryless channels, however, its effect in secure communications is not fully understood yet. In this work, an achievable scheme for the wiretap channel with generalized feedback -based on joint source-channel coding- is presented. This scheme recovers previous results, thus it can be seen as a generalization and unification...
The problem of mismatched decoding with an additive metric q for a discrete memoryelss channel W is addressed. Two max-min multi-letter upper bounds on the mismatch capacity Cq(W) are derived. We further prove that if the average probability of error of a sequence of codebooks converges to zero sufficiently fast, then the rate of the code-sequence is upper bounded by the “product-space” improvement...
Topological interference management is the study of achievable rates within communication networks with no channel state information at the transmitter (CSIT) beyond knowledge of the network structure itself. In this paper, we consider topological interference management within the context of a two-cell two-user-per-cell interference broadcast channel (IBC) with alternating connectivity. Topological...
We consider the problem of erasure/list decoding using certain classes of simplified decoders. Specifically, we assume a class of erasure/list decoders, such that a codeword is in the list if its likelihood is larger than a threshold. This class of decoders both approximates the optimal decoder of Forney, and also includes the following simplified subclasses of decoding rules: The first is a function...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.