SearcharxivSearch

arXiv subjects

Babak Seyfe

Publications and source records attributed to Babak Seyfe.

11 recordsLinked to original sources

Model Selection Through Model Sorting

We propose a novel approach to select the best model of the data. Based on the exclusive properties of the nested models, we find the most parsimonious model containing the risk minimizer predictor. We prove the existence of probable approximately correct (PAC) bounds on the difference of the minimum empirical risk of two successive nested models, called successive empirical excess risk (SEER). Based on these bounds, we propose a model order selection method called nested empirical risk (NER). By the sorted NER (S-NER) method to sort the models intelligently, the minimum risk decreases. We construct a test that predicts whether expanding the model decreases the minimum risk or not. With a high probability, the NER and S-NER choose the true model order and the most parsimonious model containing the risk minimizer predictor, respectively. We use S-NER model selection in the linear regression and show that, the S-NER method without any prior information can outperform the accuracy of feature sorting algorithms like orthogonal matching pursuit (OMP) that aided with prior knowledge of the true model order. Also, in the UCR data set, the NER method reduces the complexity of the classification of UCR datasets dramatically, with a negligible loss of accuracy.

cs.LG

A Generalized Expression for the Gradient of Mutual Information with the Application in Multiple Access Channels

Taking a functional approach, we derive a general expression for the gradient of the Mutual Information (MI) with respect to the system parameters in the stochastic systems. This expression covers the cases in which the system input depends on the system parameters. As an application, we consider the K-user Multiple Access Channels (MAC) with feedback and utilize the obtained results to explore the behavior of these systems in terms of the MI. Specializing the results to the additive Gaussian noise MAC, we extend the MI and Minimum Mean Square Error (MMSE) relationship, i.e., I-MMSE to the K-user Gaussian MAC with feedback. In this derivation, we show that the gradient of MI can be decomposed into three distinct parts, where the first part is the MMSE term originated from noise, and the second and third parts reflect the effects of the interference and feedback, respectively. Then, considering the capacity achieving Fourier-Modulated Estimate Correction (F-MEC) strategy of Kramer, we show how feedback compensates the destructive effects of the users' interference in the K-user symmetric Gaussian MAC.

cs.IT

On The Secrecy of the Cognitive Interference Channel with Partial Channel States

The secrecy problem in the state-dependent cognitive interference channel is considered in this paper. In our model, there are a primary and a secondary (cognitive) transmitter-receiver pairs, in which the cognitive transmitter has the message of the primary one as side information. In addition, the channel is affected by a channel state sequence which is estimated partially at the cognitive transmitter and the corresponding receiver. The cognitive transmitter wishes to cooperate with the primary one, and it sends its individual message which should be confidential at the primary receiver. The achievable equivocation-rate regions for this channel are derived using two approaches: the binning scheme coding, and superposition coding. Then the outer bounds on the capacity are proposed and the results are extended to the Gaussian examples.

cs.IT

Capacity of the State-Dependent Wiretap Channel: Secure Writing on Dirty Paper

In this paper we consider the State-Dependent Wiretap Channel (SD-WC). As the main idea, we model the SD-WC as a Cognitive Interference Channel (CIC), in which the primary receiver acts as an eavesdropper for the cognitive transmitter's message. By this point of view, the Channel State Information (CSI) in SD-WC plays the role of the primary user's message in CIC which can be decoded at the eavesdropper. This idea enables us to use the main achievability approaches of CIC, i.~e., Gel'fand-Pinsker Coding (GPC) and Superposition Coding (SPC), to find new achievable equivocation-rates for the SD-WC. We show that these approaches meet the capacity under some constraints on the rate of the channel state. Similar to the dirty paper channel, extending the results to the Gaussian case shows that the GPC lead to the capacity of the Gaussian SD-WC which is equal to the capacity of the wiretap channel without channel state. Hence, we achieve the capacity of the Gaussian SD-WC using the dirty paper technique. Moreover, our proposed approaches provide the capacity of the Binary SD-WC. It is shown that the capacity of the Binary SD-WC is equal to the capacity of the Binary wiretap channel without channel state.

cs.IT

Source Number Estimation via Entropy Estimation of Eigenvalues (EEE) in Gaussian and Non-Gaussian Noise

In this paper, a novel method based on the entropy estimation of the observation space eigenvalues is proposed to estimate the number of the sources in Gaussian and Non-Gaussian noise. In this method, the eigenvalues of correlation matrix of the observation space will be divided by two sets: eigenvalues of signal subspace and eigenvalues of noise subspace. We will use estimated entropy of eigenvalues to determine the number of sources. In this method we do not need any a priory information about signals and noise. The advantages of the proposed algorithm based on the performance is compared with the existing methods in the presence of Gaussian and Non-Gaussian noise. We have shown that our proposed method outperforms those methods in the literature, for different values of observation time and Signal to Noise Ratio, i. e. SNR. It is shown that the algorithm is consistent and also its probability of false alarm and probability of missed detection tend to zero for long observation time.

stat.AP

On The Secrecy of the Cognitive Interference Channel with Channel State

In this paper the secrecy problem in the cognitive statedependent interference channel is considered. In this scenario we have a primary and a cognitive transmitter-receiver pairs. The cognitive transmitter has the message of the primary sender as side information. In addition, the state of the channel is known at the cognitive encoder. So, the cognitive encoder uses this side information to cooperate with the primary transmitter and sends its individual message confidentially. An achievable rate region and an outer bound for the rate region in this channel are derived. The results are extended to the previous works as special cases.

cs.IT

On The Achievable Rate Region of a New Wiretap Channel With Side Information

A new applicable wiretap channel with separated side information is considered here which consist of a sender, a legitimate receiver and a wiretapper. In the considered scenario, the links from the transmitter to the legitimate receiver and the eavesdropper experience different conditions or channel states. So, the legitimate receiver and the wiretapper listen to the transmitted signal through the channels with different channel states which may have some correlation to each other. It is assumed that the transmitter knows the state of the main channel non-causally and uses this knowledge to encode its message. The state of the wiretap channel is not known anywhere. An achievable equivocation rate region is derived for this model and is compared to the existing works. In some special cases, the results are extended to the Gaussian wiretap channel.

cs.IT

Nonparametric Sparse Representation

This paper suggests a nonparametric scheme to find the sparse solution of the underdetermined system of linear equations in the presence of unknown impulsive or non-Gaussian noise. This approach is robust against any variations of the noise model and its parameters. It is based on minimization of rank pseudo norm of the residual signal and l_1-norm of the signal of interest, simultaneously. We use the steepest descent method to find the sparse solution via an iterative algorithm. Simulation results show that our proposed method outperforms the existence methods like OMP, BP, Lasso, and BCS whenever the observation vector is contaminated with measurement or environmental non-Gaussian noise with unknown parameters. Furthermore, for low SNR condition, the proposed method has better performance in the presence of Gaussian noise.

cs.CV

Perfect Secrecy Using Compressed Sensing

In this paper we consider the compressed sensing-based encryption and proposed the conditions in which the perfect secrecy is obtained. We prove when the Restricted Isometery Property (RIP) is hold and the number of measurements is more than two times of sparsity level i.e. M \geq 2k, the perfect secrecy condition introduced by Shannon is achievable if message block is not equal to zero or we have infinite block length

cs.IT

MR-BART: Multi-Rate Available Bandwidth Estimation in Real-Time

In this paper, we propose Multi-Rate Bandwidth Available in Real Time (MR-BART) to estimate the end-to-end Available Bandwidth (AB) of a network path. The proposed scheme is an extension of the Bandwidth Available in Real Time (BART) which employs multi-rate (MR) probe packet sequences with Kalman filtering. Comparing to BART, we show that the proposed method is more robust and converges faster than that of BART and achieves a more AB accurate estimation. Furthermore, we analyze the estimation error in MR-BART and obtain analytical formula and empirical expression for the AB estimation error based on the system parameters.

cs.NI

Multiuser Modulation Classification Based on Cumulants in AWGN Channel

In this paper the negative impacts of interference transmitters on automatic modulation classification (AMC) have been discussed. We proposed two approaches for AMC in the presence of interference: single user modulation classification (SUMC) and multiuser modulation classification (MUMC). When the received power of one transmitter is larger than the other transmitters, SUMC approach recognizes the modulation type of that transmitter and other transmitters are treated as interferences. Alternatively when the received powers of all transmitters are close to each other we propose MUMC method to recognize the modulation type of all of the transmitted signals. The features being used to recognize the modulation types of transmitters for both approaches, SUMC and MUMC are higher order cumulants. The super-position property of cumulants for independent random variables is utilized for SUMC and MUMC. We investigated the robustness of our classifier with respect to different powers of the received signals via analytical and simulation results and we have shown the analytical results will be confirmed by simulations. Also we studied the effect of signal synchroni-zation error via simulation results in the both condition for MUMC and SUMC.

cs.IT