ppxscal/embedding_network huggingface dataset:
On the minimum sum rate of Gaussian multiterminal source coding: new proofs
Authors: Jia Wang, Jun Chen, Xiaolin Wu
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

We show that the minimum sum rate of the Gaussian multiterminal source coding problems can be derived in a unified manner by exploiting the semidefinite partial order of the distortion covariance matrices associated with the MMSE estimation and the so-called reduced optimal linear estimation. In contrast to the existing proofs, the new method does not rely on Shannon's entropy power inequality. Furthermore, this new method leads to a direct proof of the minimum sum rate of the Gaussian two-terminal source coding problem without coupling it to a Gaussian CEO problem.
An optical IM/DD channel based relay scheme for indoor healthcare communication system
Authors: Jiang Liu, Hiroshi Takano, Shigeru Shimamoto
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

This paper presents a wireless relay scheme for indoor healthcare communication system, in which an optical relay link, instead of a traditional Radio Frequency (RF) relay link, is established between the relay station (RS) and the mobile terminal (MT). To simplify the structures of RS and the additional optical parts that shall be installed in the MT, the subcarrier-modulation based intensity-modulated direct-detection (IM/DD) is also adopted for both the up-link and the down-link. The proposed relay scheme not only enhances the transmission power, but also creates safe signal propagation environment, which is much meaningful for wireless and pervasive healthcare communication. Simulation results show that the proposed interference-reduced relay scheme provides a stable and high quality communication link when the average optical receiving power is larger than -25dBm.
Assessing the energy efficiency of localization in wireless sensor networks
Authors: Dominik Lieckfeldt, Jiaxi You, Ralf Behnke, Jakob Salzmann, Dirk Timmermann
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

We propose a measure to characterize the energy efficiency of algorithms for localization in wireless networks. The measure presented differs from previous approaches in that it is bounded and supports objective comparison. Furthermore, it corresponds to the general understanding that a high value should indicate high efficiency. Simulation results for localization using Maximum Likelihood Estimation (MLE), for Least Squares Estimation (LS) and for Multidimensional Scaling (MDS) are briefly discussed.
A 3D resolution measure for optical microscopy
Authors: Jerry Chao, Sripad Ram, E. Sally Ward, Raimund J. Ober
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

An information-theoretic three-dimensional (3D) resolution measure for the optical microscope is introduced. Based on the Cramer-Rao inequality, this resolution measure specifies a lower bound on the accuracy with which a given distance separating two objects in 3D space can be estimated from the acquired image. Useful in many applications, accurate determination of the distance of separation can, for example, help to characterize the interaction that occurs between two closely spaced biomolecules in a biological cell. In addition to presenting the underlying theory, we show that the resolution measure predicts that, by detecting a sufficient number of photons from an object pair, arbitrarily small distances of separation can be estimated with prespecified accuracy. Furthermore, we illustrate its dependence on properties such as the object pair's 3D spatial orientation. With estimations on simulated images, we show that the maximum likelihood estimator is capable of attaining the accuracy predicted by the resolution measure.
A quantitative comparison of three methods for inflating cortical meshes
Authors: Erik Bonner, Oscar Acosta, Jurgen Fripp, Olivier Salvado
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

Polygon meshes representing the cerebral cortex have been increasingly used for visualisation and analysis in biomedical imaging in recent years. Due to the highly convoluted structure of the cerebral cortex, a number of methods have been proposed for inflating cortical meshes to expose information buried in sulci and simplify the surface for further computation. Such inflations necessarily introduce geometric metric distortions to the surface. In this paper we present a quantitative comparison of three methods for inflating cortical surfaces: CARET, FreeSurfer and Diffusion-based Deformation. The methods were evaluated by how well they preserved a set of surface metrics, as well as their computational efficiency. We show that CARET is best for area preservation, while FreeSurfer performs best with respect to angular distortion and computational efficiency.
Codes over M2(F2) and applications to golden space-time coded modulation
Authors: Frédérique Oggier, Patrick Solé, Jean-Claude Belfiore
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1 (2009)

In this paper, we study code constructions over the finite ring M2(F2), the ring of 2×2 matrices with coefficients in the finite field F2. We show how they can be related to classical codes over F4. We provide as application the design of outer codes for 2 × 2 space-time coded modulation, when the inner code is the so-called Golden code.
Towards location based QoS-aware network selection mechanism for the nomadic mobile services
Authors: Pravin Pawar, Bert-Jan van Beijnum, Katarzyna Wac, Hermie Hermens, Dimitri Konstantas
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

The advances in the area of location based computing will soon make it feasible to predict the availability of wireless networks and their application level Quality of Service (QoS) characteristics along the location and time dimensions. Such predictions are referred to as QoS predictions which are provided by the QoS Context Source (QoSCS) hosted in the fixed network. Herewith we present a network selection mechanism on the mobile device which requests QoS predictions as needed and uses these predictions combined with the current location and time to select the wireless network which satisfies QoS requirements of the services hosted on a mobile device. We evaluate the performance of the proposed scheme using simulations and compare the results with the other mechanism that only uses information locally available on the mobile device for the network selection. The results obtained from the simulations encourage further system development and prototyping.
Soft decision helper data algorithm for SRAM PUFs
Authors: Roel Maes, Pim Tuyls, Ingrid Verbauwhede
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

In this paper we propose the idea of using soft decision information in helper data algorithms (RDA). We derive and verify a distribution for the responses of SRAM-based physically unclonable functions (PUFs) and show that soft decision information becomes available without loss in min-entropy of the fuzzy secret. This significantly improves the implementation overhead of using an SRAM PUF + RDA for cryptographic key generation compared to previous constructions.
An authenticated self-healing key distribution scheme based on bilinear pairings
Authors: Biming Tian, Elizabeth Chang, Tharam S. Dillon, Song Han, Farookh K. Hussain
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Self-healing key distribution mechanism can be utilized for distributing session keys over an unreliable network. A self-healing key distribution scheme using bilinear pairings is proposed in this paper. As far as we know, it is the first pairing-based authenticated self-healing key distribution scheme. The scheme achieves a number of excellent properties. Firstly, the users can check the integrity and correctness of the ciphertext before carrying out more complex key recovery operations thus fruitless work can be avoided. Secondly, the scheme is collusion-free for any coalition of non-authorized users. Thirdly, the private key has nothing to do with the number of revoked users and can be reused as long as it is not disclosed. Finally, the storage overhead for each user is a constant.
Differential equation-driven regularization for joint FMT-CT imaging
Authors: Damon Hyde, Eric Miller, Dana Brooks, Vasilis Ntziachristos
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

A primary motivation for multi-modal imaging is to improve reconstructions for low resolution functional modalities using high resolution structural information. Most such approaches assume that the anatomic and functional images share a common physical structure. For fluorescence molecular tomography (FMT), however, this may be only approximately valid. We thus present and analyze a regularization scheme that allows more flexible use of anatomic images. Using parallels between regularization and statistical modeling, we develop a stochastic PDE that shares information across structural boundaries. Simulations indicate that our approach is capable of obtaining more accurate reconstructions than methods treating each tissue independently.
Demonstration of call-to-web session linkage system
Authors: Masashi Toyama, Koji Murakami, Yoshiko Sueda, Yasushi Okano, Osamu Mizuno
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

We demonstrate a prototype of a call-to-Web session linkage system for sharing a Web application between caller and receiver. The system makes a session linkage between Web browsers based on call session information of SIP, which is an application-layer control protocol mainly used for IP telephony systems. After that, the system offers Web servers information for the linkage so that Web servers can provide a shared Web service easily. This system can even be uses by a browser of home appliances, which are difficult to upgrade because those linkage protocols consist of basic browser functions such as HTTP redirect and JavaScript.
Decoding frequency permutation arrays under infinite norm
Authors: Min-Zheng Shieh, Shi-Chun Tsai
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4 (2009)

A frequency permutation array (FPA) of length n = mλ). and distance d is a set of permutations on a multiset over m symbols, where each symbol appears exactly λ times and the distance between any two elements in the array is at least d. FPA generalizes the notion of permutation array. In this paper, under the distance metric l∞-norm, we first prove lower and upper bounds on the size of FPA. Then we give a construction of FPA with efficient encoding and decoding capabilities. Moreover, we show our design is locally decodable, i.e., we can decode a message bit by reading at most λ + 1 symbols, which has an interesting application for private information retrieval.
Number of measurements in sparse signal recovery
Authors: Paul Tune, Sibi Raj Bhaskaran, Stephen Hanly
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1 (2009)

We analyze the asymptotic performance of sparse signal recovery from noisy measurements. In particular, we generalize some of the existing results for the Gaussian case to subgaussian and other ensembles. An achievable result is presented for the linear sparsity regime. A converse on the number of required measurements in the sub-linear regime is also presented, which cover many of the widely used measurement ensembles. Our converse idea makes use of a correspondence between compressed sensing ideas and compound channels in information theory.
A comparative study of quantized compressive sensing schemes
Authors: Wei Dai, Hoa Vinh Pham, Olgica Milenkovic
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1 (2009)

We study the average distortion introduced by scalar, vector, and entropy coded quantization of compressive sensing (CS) measurements. The asymptotic behavior of the underlying quantization schemes is either quantified exactly or characterized via bounds. We also modify two benchmark CS reconstruction algorithms to accommodate quantization effects, and empirically demonstrate that these methods significantly reduce the reconstruction distortion.
A polynomial-time construction of self-orthogonal codes and applications to quantum error correction
Authors: Mitsuru Hamada
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2 (2009)

A polynomial-time construction of a sequence of self-orthogonal geometric Goppa codes attaining the Tsfasman-Vlidut-Zink (TVZ) bound is presented. The issue of constructing such a code sequence was addressed in a context of constructing quantum error-correcting codes (Ashikhmin et al., 2001). Naturally, the obtained construction has implications on quantum error-correcting codes. In particular, the best known asymptotic lower bounds on the largest minimum distance of polynomially constructible quantum error-correcting codes are improved.
Linear precoded cooperative transmission protocol for wireless broadcast channels
Authors: Chee Yen Leow, Zhiguo Ding, Kin K. Leung
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

One of the main challenges in the wireless broadcast channels is the co-channel interference among multiple destinations. Practical linear precoding techniques such as zero-forcing beamforming (ZFBF) is used to avoid the co-channel interference. However, the achievable diversity order of the ZFBF is bounded by the number of transmitter antennas. In this paper, we introduce a spectral efficient cooperative broadcast channels transmission protocol in the MISO channels using linear precoding. We evaluate the performance of the proposed protocol using the diversity and multiplexing tradeoff. The proposed protocol can achieve the maximum diversity order expressed as a sum of the transmitter antennas and the number of participating relays. For a large number of relay candidates, the diversity and multiplexing tradeoff of the proposed protocol completely surpasses the performance of the comparable scheme. Simulations have also shown the outage probability of the proposed protocol outperforms the existing scheme.
STREAMCOMPLETE: an architecture for mesh-based peer-to-peer live video streaming
Authors: Federico Covino, Massimo Mecella
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

The increasing of bandwidth capacity and the rising of more active and more demanding Internet users motivate the research of the best solution in P2P multimedia streaming. This paper presents STREAM COMPLETE, a new architecture and prototype system for mesh-based P2P live video streaming; it realizes a new concept of overlay network's management as well as merges the best practices of tree- and mesh-based approaches. STREAM COMPLETE creates a dynamic overlay network that optimizes itself basing on local conditions of peers. The two core operations are: (i) FastTop, that reorganizes peers in order to improve the general performance of the network; (ii) LoopCheck, that detects bounded loops of the multimedia streaming in the mesh overlay network. We have extensively evaluated the performance and the behavior of STREAM COMPLETE over the Planet Lab. Our experiments demonstrate the ability of peers in managing the overlay network with autonomic behavior in case of network changes. Furthermore the system is scalable w.r.t. the cardinality of the overlay network, by requiring very few control traffic.
Using entropy based clustering method to optimize heterogenous antennas in ad hoc wireless networks
Authors: Yong Wang, Kang K. Yen, Hao Zhu
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Directional antennas widely used in IEEE 802.11 series protocols can offer high gain and low interference to other stations. But they also cause some side effects like the hidden terminal and deafness problems, which will deteriorate the performance of the networks significantly. Therefore, omni-directional antennas have to be used in some cases to avoid these problems. So a station equipped with antennas capable of operating in both omni-directional and directional modes is desired. In this paper, an entropy-based clustering algorithm is proposed to find an improved solution between using omni- and directional antennas, which utilizes the advantage of directional antennas and meanwhile alleviates the effects brought by directional antennas. We compare our proposed algorithms with the traditional ones and the simulation results confirm the effectiveness of our proposed method.
On diversity-multiplexing tradeoff of the interference channel
Authors: Hamid Ebrahimzad, Amir K. Khandani
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

In this paper, the tradeoff between diversity and multiplexing gains in the two-user quasi-static Raleigh fading Interference Channel (IC) is derived. Under the short-term average power constraint and for the delay limited communication, we show that only a partial Channel State Information at the Transmitter (CSIT) is enough to achieve the optimum Diversity-Multiplexing Tradeoff (DMT) at the IC. We develop a coding scheme for the two-user quasi-static Raleigh fading IC. At the low rate region, this results in a one-level Gaussian code independent of the channel condition. At the high rate region, the result can be one-level or two-level Gaussian codes depending on the partial CSIT. The partial state information for each channel gain can be represented by only one bit corresponding to its absolute value. At the high rate region, we assume that the partial state information of all channel gains is available at the two transmit sides. The optimality of the proposed scheme is established by deriving an outer bound, which coincides with the achieved DMT.
A neuro-fuzzy approach to virtual screening in molecular bioinformatics
Authors: Jürgen Paetz, Gisbert Schneider
Venue: Fuzzy Sets and Systems (2005)

Molecular bioinformatics is a transdisciplinary working area. One hot topic is the design of drugs using computers and intelligent algorithms. This is known as in silico approach. We use a new in silico approach for separating active ligand molecules from inactive ones for different drug targets. This kind of retrospective virtual screening is performed by using encoded molecule data and a neuro-fuzzy methodology for classification, feature selection, and rule generation. We generate rules in a retrospective screening process that identify regions, where clearly more active compounds can be found compared to their a priori probability. We show that our approach is superior to a common descriptor-based standard technique.
Comparison of H.264/AVC, H.264 with AIF, and AVS based on different video quality metrics
Authors: S. Pasqualini, F. Fioretti, A. Andreoli, P. Pierleoni
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

Video communication has a very important role nowadays. Also very efficient video coding techniques are developed in order to provide high quality video streams using all the available bandwidth. In this work we perform a comparison between three different video codecs: the ITU-T H.264, an improved ITU-T H.264 version including the AIF (Adaptive Interpolation Filter), and the AVS (Audio and Video Coding Standard) that is the Chinese standard video codec. The realized tests involve eight standard video sequences that are coded end decoded using the mentioned standards. Then, for each sequence we evaluate the video quality using four objective metrics: PSNR (Peak Signal-to-Noise Ratio), VQM (Video Quality Metric), SSIM (Structural SIMilarity), and the HSM (HVS - Human Visual System - Similarity Measure). While PSNR and VQM take into account the mathematical features of the video sequences, SSIM and HSM are based on the HVS theory. So it is possible to evaluate also the human eye perceived quality. The realized analysis is related to the relationship between the bitrate and the quality indexes. The conclusions of our analysis can give an evaluation about several codec performances and can be useful for developers to plan and manage their network. Also, taking into account the HSM scores, the AVS has better performance than the ITV-T video codecs.
Hybrid digital-analog joint source-channel coding for broadcasting correlated Gaussian sources
Authors: Hamid Behroozi, Fady Alajaji, Tamás Linder
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4 (2009)

We consider the transmission of a bivariate Gaussian source S = (S1, S2) across a power-limited two-user Gaussian broadcast channel. User i (i = 1, 2) observes the transmitted signal corrupted by Gaussian noise with power σi2 and wants to estimate Si. We study hybrid digital-analog (HDA) joint source-channel coding schemes and analyze these schemes to obtain achievable (squared-error) distortion regions. Two cases are considered: 1) source and channel bandwidths are equal, 2) broadcasting with bandwidth compression. We adapt HDA schemes of Wilson et al, [1] and Prabhakaran et al, [2] to provide various achievable distortion regions for both cases. Using numerical examples, we demonstrate that for bandwidth compression, a three-layered coding scheme consisting of analog, superposition, and Costa coding performs well compared to the other provided HDA schemes. In the case of matched bandwidth, a three-layered coding scheme with an analog layer and two layers, each consisting of a Wyner-Ziv coder followed by a Costa coder, performs best.
Automatic recognition of speech emotion using long-term spectro-temporal features
Authors: Siqing Wu, Tiago H. Falk, Wai-Yip Chan
Venue: Proceedings of the 16th international conference on Digital Signal Processing (2009)

This paper proposes a novel feature type for the recognition of emotion from speech. The features are derived from a long-term spectro-temporal representation of speech. They are compared to short-term spectral features as well as popular prosodic features. Experimental results with the Berlin emotional speech database show that the proposed features outperform both types of compared features. An average recognition accuracy of 88.6% is achieved by using a combined proposed & prosodic feature set for classifying 7 discrete emotions. Moreover, the proposed features are evaluated on the VAM corpus to recognize continuous emotion primitives. Estimation performance comparable to human evaluations is furnished.