ppxscal/embedding_network huggingface dataset:
Minimum description length and clustering with exemplars
Authors: Po-Hsiang Lai, Joseph A. O'Sullivan, Robert Pless
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2 (2009)

We propose an information-theoretic clustering framework for density-based clustering and similarity or distance-based clustering with objective functions of clustering performance derived from stochastic complexity and minimum description length (MDL) arguments. Under this framework, the number of clusters and parameters can be determined in a principled way without prior knowledge from users. We show that similarity-based clustering can be viewed as combinatorial optimization on graphs. We propose two clustering algorithms, one of which relies on a minimum arborescence tree algorithm which returns optimal clustering under the proposed MDL objective function for similarity-based clustering. We demonstrate clustering performance on synthetic data.
The rate transfer argument in two-stage scenarios: when does it matter?
Authors: Ertem Tuncel
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1 (2009)

The significance of the rate transfer argument used in a class of two-stage source and channel coding problems is discussed. A very simple necessary and sufficient condition is derived as to when the argument helps expand the achievability region. Special attention is paid to several example scenarios such as successive refinement with or without side information, and degraded broadcast channels. Finally, for reliable separate source-channel coding, whether a test based on comparing marginal source and channel rate regions is more restrictive than comparing cumulative rate regions, obtained after using the rate transfer argument, is discussed. It turns out that if rate transfer does not matter in either the source or the channel coding problem, the two tests are equivalent.
Analysis of multiple-unicast throughput in finite-buffer delay-tolerant networks
Authors: Ramanan Subramanian, Faramarz Fekri
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

The problem of computing the throughput capacity of general unicast in a Delay-Tolerant Network under the finite-buffer regime is addressed in this paper. A sparse mobile wireless network deployed on an M × M square-grid is considered, wherein m unique mobile source/destination pairs communicate with the aid of n mobile relay nodes using the store, carry, and forward paradigm. Each mobile relay node is equipped with a finite storage. Thus, several source/destination pairs contend for limited network resources. Under this setup, the throughput achieved per source-destination pair at steady-state node-mobility is analyzed, incorporating practical considerations such as node-to-node contention and finite communication range, for a class of two-hop relay protocols. In addition, two different approaches for buffer management are considered. The paper shows that, using a novel approach based on embedded Markov-chains, accurate analysis of the throughput can be achieved for the above model, as it is validated by simulations. A significant conclusion of this work is that considerable throughput improvements can be achieved by judicially managing the relay-node buffer-space.
Vulnerabilities of the real-time transport (RTP) protocol for voice over IP (VoIP) traffic
Authors: Mike Adams, Minseok Kwon
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Over the past decade, Voice over IP (VoIP) has revolutionalized the telecommunications industry. VoIP has become more prevalent than ever, and consequently more users have switched to IP-based data networks for their telephone use from the analogue Public Switched Telephone Network (PSTN). One challenge, though, is to secure and protect these VoIP connections. In this paper, we investigate a new approach to demonstrate the vulnerability of VoIP connections. Our approach monitors real-time data streams (e.g., RTP), and inserts packets containing fraudulent voice data at expected times estimated from the monitoring. As false packets are well-aligned with original packets, we can maximize the effects of the test while minimizing the number of inserted packets. This minimal number of false packets also helps eschew the detection efforts of denial-of-service defense mechanisms. Our results indicate that the inserted packets at desired times can indeed disrupt the original RTP stream without any noticeable traffic increase.
Constructions of families with unequal auto and cross-correlation constraints
Authors: José Ortiz-Ubarri, Oscar Moreno
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1 (2009)

Yang and Fuja [1] presented constructions of codes with unequal correlation constraints (λc < λa). And specifically they have constructions for the case where λa = 2 > λc = 1. In their work they argue that it is important to make the cross-correlation (λc) as small as possible, and not necessarily λa = λc. In this work we present a method to generate new Yang-Fuja type families with correlation constraints where λc < λa. In [12], [10], [9] we presented a method to increase the size of a family of a double periodic sequence with Optical Orthogonal Code (OOC) length n = mp where m = p - 1, and p is a prime. In this work we present a new method that increases the size of a family of double periodic sequences without the restriction on m, we present a method to increase the weight of a double periodic array, and then combine both methods to produce Yang-Fuja type families of double periodic arrays with λc < λa. One of our main results is a theorem (Theorem 3, Section IV) that estimates λc. With this theorem we obtain two new constructions of Optical Orthogonal Codes with λc < λa.
Semi-reversible quantization based data hiding using missing samples recovery technique
Authors: Ali Ameri, Mohammad J. Saberian, Mohammad A. Akhaee, Farokh Marvasti
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

A blind semi-invertible quantization based data hiding scheme, which reconstructs the original signal with high precision has been proposed. In order to produce correlated quantization yielding reversibility of the quantization based approach, a new transform domain has been introduced. In decoder, by compensating the quantization error and using the iterative technique, the original signal is recovered; then the watermarked signal is compared with the reconstructed original signal and hidden data is retrieved Simulation results show that the proposed method in comparison with other reversible methods imposes less distortion and thus a higher Signal to Noise Ratio (SNR) is achieved.
Features selection for intrusion detection systems based on support vector machines
Authors: Safaa Zaman, Fakhri Karray
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Intrusion detection systems (IDSs) deal with large amounts of data containing irrelevant and/or redundant features. These features result in a slow training and testing process, heavy computational resources, and low detection accuracy. Features selection, therefore, is an important issue in IDSs. A reduced features set improves system accuracy and speeds up the training and testing process considerably. In this paper, we propose a novel and simple method-Enhanced Support Vector Decision Function (ESVDF)-for features selection. This method selects features based on two important factors: the feature's rank (weight), which is calculated using Support Vector Decision Function (SVDF), and the correlation between the features, which is determined by either the Forward Selection Ranking (FSR) or Backward Elimination Ranking (BER) algorithm. Our method significantly decreases training and testing times without loss in detection accuracy. Moreover, it selects the features set independently of the classifier used. We have examined the feasibility of our approach by conducting several experiments using the DARPA dataset. The experimental results indicate that the proposed algorithms can deliver satisfactory results in terms of classification accuracy, training time, and testing time.
Design and construction of protocol sequences: shift invariance and user irrepressibility
Authors: Kenneth W. Shum, Wing Shing Wong, Chi Wan Sung, Chung Shue Chen
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2 (2009)

Protocol sequences are used for channel access in the collision channel without feedback. Each user is assigned a deterministic zero-one pattern, called protocol sequence. The zeros and ones in a protocol sequence are read out periodically, and a packet is sent if and only if it is one. A collision occurs if two or more users transmit at the same time. Due to the lack of feedback from the receiver and cooperation among users, the beginning of the protocol sequences cannot be synchronized and relative delay offsets are incurred. We study the design of protocol sequences from two different perspectives. Under the first one, called shift invariance, we aim at minimizing the fluctuation of throughput due to relative delay offsets. As for the second one, called user irrepressibility, we want to guarantee that each user can send at least one packet successfully in each period. For both design criteria, we derive a lower bound on sequence period and give an optimal construction that achieves this lower bound.
Link adaptation for video multicasting in mobile WiMAX network
Authors: Jianfeng Chen, Ning Liao, Yntao Shi, Jun Li
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

IEEE802.16e based mobile WiMAX network provides a promising technology for broadband wireless access. Among all types of services supported by WiMAX, real time video multicast has attracted much attention. However, because of the absence of feedback channel for multicast service, it is challenging to provide link adaptation and resource allocation under the situation with diverse receiver distribution. The legacy method-using the most robust modulation mode for multicasting service, or select a leader as the representative-can not accurately reflect the variety of channel condition. In this paper, we firstly analyze the overhead problem caused by the periodic downlink channel quality report, then propose a light-weighted terminal triggered feedback mechanism to reduce the signaling overhead. Furthermore, with the combined consideration of layered video coding and adaptive modulation and coding, a utility-based resource allocation approach is proposed. The utility function is relating with the reception satisfaction and spectrum efficiency. The scheduling algorithm dynamically adjusts layer number and its bandwidth according to receiver distribution. Simulation results show the proposed feedback mechanism can greatly reduce the signaling overhead while maintain the accurate channel condition report. The scheduling algorithm can not only improve the link adaptation capability following the receivers' expectation and program popularity, but also outperform the fixed allocation method in term of system utility.
Analysis of PAPR reduction performance of SLM schemes with correlated phase vectors
Authors: Seok-Joong Heo, Hyun-Seung Joo, Jong-Seon No, Dae-Woon Lim, Dong-Joon Shin
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

The peak to average power ratio (PAPR) reduction performance depends on the phase vectors of selected mapping (SLM) scheme where the alternative input symbol vectors are generated by multiplying an input symbol vector by phase vectors. Thus, the symbol powers of alternative orthogonal frequency division multiplexing (OFDM) signals obtained by inverse Fourier transforming the alternative input symbol vectors become correlated. In this paper, the relationship between the correlations of component powers of alternative OFDM signal vector and the correlations of phase vectors are evaluated. Then, the complementary cumulative distribution function (CCDF) of PAPR in SLM scheme is derived using multivariate gamma distribution. The derived CCDF coincides exactly with the simulation result for peak reduced OFDM system with SLM.
Quantitative comparison of spot detection methods in live-cell fluorescence microscopy imaging
Authors: Ihor Smal, Marco Loog, Wiro Niessen, Erik Meijering
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

In live-cell fluorescence microscopy imaging, quantitative analysis of biological image data generally involves the detection of many subresolution objects, appearing as diffraction-limited spots. Due to acquisition limitations, the signal-to-noise ratio (SNR) can be extremely low, making automated spot detection a very challenging task. In this paper, we quantitatively evaluate the performance of the most frequently used supervised and unsupervised detection methods for this purpose. Experiments on synthetic images of three different types, for which ground truth was available, as well as on real image data sets acquired for two different biological studies, for which we obtained expert manual annotations for comparison, revealed that for very low SNRs (≅2), the supervised (machine learning) methods perform best overall, closely followed by the detectors based on the so-called h-dome transform from mathematical morphology and the multiscale variance-stabilizing transform, which do not require a learning stage. At high SNRs (>5), the difference in performance of all considered detectors becomes negligible.
Automated actin filament segmentation, tracking and tip elongation measurements based on open active contour models
Authors: Hongsheng Li, Tian Shen, Matthew B. Smith, Ikuko Fujiwara, Dimitrios Vavylonis, Xiaolei Huang
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

This paper presents an automated method for actin filament segmentation and tracking for measuring tip elongation rates in Total Internal Reflection Fluorescence Microscopy (TIRFM) images. The main contributions of the paper are: (i) we use a novel open active contour model for filament segmentation and tracking, which is fast and robust against noise; and (ii) different strategies are proposed to solve the filament intersection problem, which is shown to be the main difficulty in filament tracking. Application to experimental results demonstrated the robustness and effectiveness of this method.
Multiresolution local polynomial regression: A new approach to pointwise spatial adaptation
Authors: Vladimir Katkovnik
Venue: Digital Signal Processing (2005)

In nonparametric local polynomial regression the adaptive selection of the scale parameter (window size/bandwidth) is a key problem. Recently new efficient algorithms, based on Lepski's approach, have been proposed in mathematical statistics for spatially adaptive varying scale denoising. A common feature of these algorithms is that they form test-estimates y@?"h different by the scale h@?H and special statistical rules are exploited in order to select the estimate with the best pointwise varying scale. In this paper a novel multiresolution (MR) local polynomial regression is proposed. Instead of selection of the estimate with the best scale h a nonlinear estimate is built using all of the test-estimates y@?"h. The adaptive estimation consists of two steps. The first step transforms the data into noisy spectrum coefficients (MR analysis). On the second step, this noisy spectrum is filtered by the thresholding procedure and used for estimation (MR synthesis).
Fixed-interval smoothing algorithm based on covariances with correlation in the uncertainty
Authors: S. Nakamori, R. Caballero-Águila, A. Hermoso-Carazo, J. Linares-Pérez
Venue: Digital Signal Processing (2005)

A least-squares linear fixed-interval smoothing algorithm is derived to estimate signals from uncertain observations perturbed by additive white noise. It is assumed that the Bernoulli variables describing the uncertainty are only correlated at consecutive time instants. The marginal distribution of each of these variables, specified by the probability that the signal exists at each observation, as well as their correlation function, are known. The algorithm is obtained without requiring the state-space model generating the signal, but just the covariances of the signal and the additive noise in the observation equation. The covariance function of the signal must be expressed in a semi-degenerate kernel form, assumption which covers many general situations, including stationary and non-stationary signals.
Moving beyond color: the case for multispectral imaging in brightfield pathology
Authors: William J. Cukierski, Xin Qi, David J. Foran
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

A multispectral camera is capable of imaging a histologic slide at narrow bandwidths over the range of the visible spectrum. While several uses for multispectral imaging (MSI) have been demonstrated in pathology [1, 2], there is no unified consensus over when and how MSI might benefit automated analysis [3, 4]. In this work, we use a linear-algebra framework to investigate the relationship between the spectral image and its standard-image counterpart. The multispectral "cube" is treated as an extension of a traditional image in a high-dimensional color space. The concept of metamers is introduced and used to derive regions of the visible spectrum where MSI may provide an advantage. Furthermore, histological stains which are amenable to analysis by MSI are reported. We show the Commission internationale de l'éclairage (CIE) 1931 transformation from spectrum to color is non-neighborhood preserving. Empirical results are demonstrated on multispectral images of peripheral blood smears.
Cooperative and non-cooperative game-theoretic analyses of adoptions of security policies for DRM
Authors: Zhiyong Zhang, Qingqi Pei, Jianfeng Ma, Lin Yang, Kefeng Fan
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Digital Rights Management ecosystem is composed of various participants, which adopt different security policies to meet their own security requirements, with a goal to achieve individual optimal benefits. However, from the perspective of the whole DRM-enabling contents industry, a simple adoption of several increasingly enhanced security policies does not necessarily implement an optimal benefit balance among participants. A game-theoretic analysis of adoptions of security policies was emphasized based on a proposed General DRM value chain ecosystem without the loss of generality. First, we formalized security policies and fundamental properties that include internal relativity and external one, together with multiparty game on adoptions of security policies. Also, a cooperative game among digital Contents Provider, Rights/Service Provider and digital Devices Provider, as well as a non-cooperative game between Providers and Consumers were presented. Final, a stable core allocation of benefits and Nash Equilibriums were found out, respectively. It is clearly concluded that the cooperative game has important super-addivitity and convexity, thus simultaneous adoptions of security policies with external relativity being helpful to achieve Pareto Optimality by using a pre-established cooperative relation; and that Pareto Optimality also exists between Providers and Consumer with the increase of users' purchase transactions when both have a repeated game.
A fast band selection method to increase image contrast for multispectral image segmentation
Authors: Xuqing Wu, Shishir K. Shah
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

Multispectral microscopy for applications in histology and cytology has attracted much attention in recent years. It has been shown that the unique transmission spectra of biological tissue provides additional information that is potentially useful for better classification of the pathologies. However, irrelevant features in multispectral data may affect results and performance of data analysis methods. In this paper, a fast band selection method is proposed to increase the contrast-to-noise ratio such that relevant information is maximized while reducing the number of spectral bands. The new method obtains an optimal selection of bands by solving a specific objective function with low computational costs. A thresholding criterion is developed to decide on the number of bands to be selected.
Tracking cell motion using GM-PHD
Authors: Radford Ray Juang, Andre Levchenko, Philippe Burlina
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

We present a method for tracking the movement of multiple cells and their lineage. We use the Gaussian Mixture Probability Hypothesis Density (GM-PHD) filter, a multi-target tracking algorithm, to track the motion of multiple cells over time and to keep track of the lineage of cells as they spawn. We describe a spawning model for the GM-PHD filter as well as modifications to the original GM-PHD algorithm to track lineage. Experimental results are provided illustrating the approach for dense cell colonies.
A traffic manager for integrated queuing and scheduling of unicast and multicast IP traffic
Authors: Qi Zhang, Alan Marshall, Roger Woods
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

An efficient, programmable Traffic Manager (TM) architecture for supporting simultaneous scheduling of uni- and multi-cast traffic in a packet switch, is presented. By exploiting the use of new, programmable high-speed TMs, the analysis presented shows that by introducing ingress replication into line cards, we can augment a packet switch's multicasting capabilities. A new, multicast-enabled TM that efficiently controls ingress replication in a flexible and non-complex manner is presented. Simulation results are provided that demonstrate the improvement.
In vivo examination of human lipomas with freehand elastography-preliminary results
Authors: E. Brusseau, O. Basset
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

In the context of ultrasound elastography, we recently developed a 2D strain estimation method to image the deformation of a medium during its compression with the probe. This technique was proved to provide good-quality strain images with data acquired in a freehand configuration on elastography-dedicated phantoms and ex vivo dog tissue lesions. In this study, the application to in vivo human benign tumors is presented. The initial results obtained demonstrate that our method is able to provide easily interpretable deformation images in clinical conditions.