Leila Ghabeli

• PhD
• Professor (Assistant) at Islamic Azad University Central Tehran Branch

Using machine vision and image processing methods has an important role in the identification of defects of agricultural products, especially potatoes. The applications of image processing and artificial intelligence in agriculture in identifying and classifying pests and diseases of plants and fruits have increased and research in this field is on...

Using machine vision and image processing as a non-destructive and rapid method can play an important role in examining defects of agricultural products, especially potatoes. In this paper, we propose a convolution neural network (CNN) to classify the diseased potato into five classes based on their surface image. We trained and tested the develope...

Abstract The “Gaussian BroadCast channel (GBC) with States non‐causally Known at the Transmitter” (GBC‐SKT) introduces Gaussian broadcast channel with additive i.i.d. Gaussian states non‐causally known at the transmitter. In this model additive interferences on links are considered as states which are only non‐causally known to the transmitter. Suc...

Objective Several de-noising methods for medical images have been applied such as Wavelet Transform, CNN, linear and Non-linear method. Methods In this paper, a median filter algorithm will be modified and explain the image de-noising to wavelet transform and Non-local means (NLM), deep convolutional neural network (DnCNN) and Gaussian noise and S...

Different methods of feature selection find the best subdivision from the candidate subset. In all methods, based on the application and the type of the definition, a subset is selected as the answer; which can optimize the value of an evaluation function. The large number of features, high spatial and temporal complexity, and even reduced accuracy...

This studies the capacity of a class of K-user Gaussian broadcast channels with additive i.i.d. Gaussian state sequences which are non-causally known at the transmitter (GBC-SKT). The transmitter wishes to reliably communicate both a common and a private message to each receiver, thus attempting to simultaneously pre-code the common message against...

This paper studies the capacity of the general Gaussian broadcast channel with states non-causally known at the transmitter. This channel is obtained from the two-user Gaussian broadcast channel by further considering the presence of an additive state sequence in each channel output. Having anti-causal knowledge of both the channel state sequences,...

1 In this paper we review the previously proposed methods for successive compute-and-forward and discuss about their incompleteness through some examples. Then we present a comprehensive formulation for multi-step successive interference cancellation problem through the asymmetric successive compute-and-forward strategy. It is shown that the genera...

The authors present an improved achievable rate region for two-pair bidirectional Gaussian relay networks based on successive compute-and-forward method. In these networks, one relay helps in the communication between two pairs of users. In their proposed scheme, the authors use nested lattice codes for encoding the messages at the users, and Gauss...

In this paper, we study a 3-node asymmetric full-duplex AWGN two-way relay channel with relay private messages where two nodes can communicate with each other only through a third node called the relay, while the relay can itself exchange private messages with two other nodes. Cut-set upper bound and single sided genie upper bound are presented for...

A symmetric semideterministic relay network is introduced, generalizing Aref networks. In the considered model, there is no interference at the relays, but the links from the source and the relays to the sink are interfering and nondeterministic. An achievable rate is determined for an arbitrary number of relays, based on symmetric relaying and sim...

In this study, the authors extend the concept of relay channel with orthogonal components to define a class of symmetric relay networks with orthogonal components named symmetric orthogonal relay network. In the defined network, the channels diverge from each node sender use different frequency bands whereas the channels converge to each node recei...

The authors introduce a generalisation of the multiple-access-relay-channel (MARC) called multiple-access-relay-network (MARN). The MARC model was first introduced by Kramer et al. and consists of many transmitters, one receiver and only one relay. In the MARN, there are many transmitters, many relays and one receiver. The authors obtained an achie...

In this paper, we investigate the performance of two strategies: simultaneous sliding window decoding (SimSlide) and simultaneous backward decoding (SimBack) when generalizing partial decode-and-forward to the relay networks. We show that these two methods yield the same achievable rates for relay networks but in comparison with sequential decoding...

The authors consider the problem of broadcast-relay-networks with two cooperative relays. There are a transmitter, two relays and two receivers in the network. The message of the transmitter intended to the receivers has common and private parts. The relays fully cooperate with each other and with the transmitter to send the common part of the mess...

In this paper, we obtain an outer bound on the capacity region of the Broadcast-Relay-Channel (BRC). BRC is a four node network with one source, one relay and two destinations. To the best of our knowledge, this work represents the first effort to find an outer bound on the capacity region of the BRC. In the proof, we jointly utilize the ideas of t...

Compress-and-Forward (CF) is a well-known coding strategy proposed for relay channels. Few works which were done about the generalization of the CF strategy to the relay networks, are based on irregular encoding/successive decoding. In this paper, a new generalization of the CF strategy to the relay networks based on regular encoding/backward decod...

In this paper, we consider a different strategy for broadcast-relay-networks (BRN) with two relays. There are a transmitter, two relays and two receivers in this network. The message of the transmitter intended to the receivers, has both common and private parts. The relays partially cooperate with each other and with the transmitter to send the co...

In this paper we define Broadcast Relay Networks (BRN) with two relays. There are a transmitter, two relays and two receivers in the network. We find an achievable rate region for it by considering full cooperation between relays. We use symmetric relaying method at relays and Marton's broadcast code construction for the transmitter. We will show t...

In this paper, we introduce a generalization of the multiple-access-relay-channel (MARC) called multiple-access-relay-network (MARN). In the proposed network, there are many transmitters, many relays and one receiver. The MARC model was first introduced by Kramer and consists of many transmitters, one receiver and only one relay.We also define semi...

In this paper we consider the real, discrete time asymmetric Gaussian parallel relay network, the more realistic model than the symmetric one considered by Schein-Gallagar. We present achievable rates for this network that are superior rates to the Schein-Gallagar rates. The proposed methods are based on the superimposition technique used for the d...

In this paper, we propose a new achievable rate for two-level relay networks by introducing a new strategy named simultaneous partial and backward decoding. In the proposed method, benefitting from regular encoding/backward decoding strategy, different message parts transmitted in the network are simultaneously decoded at the relays and the receive...

Partial decoding scheme is a scheme in which each relay decodes only part of the transmitted message. Obviously, the achievable rates proposed by the partial decoding scheme subsume the achievable rates proposed by the full decoding scheme. The other motivation of using partial decoding scheme is that there are some special classes of relay network...

Symmetric relaying is a method of relaying in which the relays can decode the message of other relays in the network in addition to the source message. In this paper an achievable rate is presented for a symmetric two-relay network based on partial decoding. The strategy make use of familiar techniques such as product binning, regular encoding/slid...

In this paper, we propose a concept of relaying named symmetric relaying strategy for two relay network. In our strategy, we have two relays in the network and both relays can completely decode the message transmitted by the other relay. The proposed rate is shown to subsume the previously proposed rate for feed-forward relay network based on decod...

In this paper, we propose a new concept of relaying named parallel relaying to obtain a new achievable rate for relay networks. The proposed encoding scheme is based on partial decoding, where the relay decodes only part of the transmitted message. The superiority of our proposed method to the previous ones is that, it can be applied to the relay n...

A new achievable rate based on a partial decoding scheme is proposed for the multilevel relay network. A novel application of regular encoding and backward decoding is presented to implement the proposed rate. In our scheme, the relays are arranged in feed-forward structure from the source to the destination. Each relay in the network decodes only...

In this paper, we propose an information-theoretic constructive scheme based on generalized block Markov encoding strategy for obtaining an achievable rate for multirelay networks. The coding scheme is based on partial decoding scheme where the relay decodes only part of the transmitted message. The proposed achievable rate is then used to establis...

In this paper a new method is proposed for image denoising based on HMM (hidden Markov modeling). In this manner the noisy imageis modeled as a hidden Markov process, we use the local statistics of the images in defining the HMM parameters, and the image restoration is achieved by computing the most likely state at each pixel. Among the features of...