Sharif Digital Repository

Temporal action localization (TAL) task which is to predict the start and end of each action in a video along with the class label of the action has numerous applications in the real world. But due to the complexity of this task, acceptable accuracy rates have not been achieved yet, whereas this is not the case regarding the action recognition task. In this paper, we propose a new network based on gated recurrent unit (GRU) and two novel post-processing methods for TAL task. Specifically, we propose a new design for the output layer of the conventionally GRU resulting in the so-called GRU-Split network. Moreover, linear interpolation is used to generate the action proposals with precise... 

Temporal action localization (TAL) task which is to predict the start and end of each action in a video along with the class label of the action has numerous applications in the real world. But due to the complexity of this task, acceptable accuracy rates have not been achieved yet, whereas this is not the case regarding the action recognition task. In this paper, we propose a new network based on gated recurrent unit (GRU) and two novel post-processing methods for TAL task. Specifically, we propose a new design for the output layer of the conventionally GRU resulting in the so-called GRU-Split network. Moreover, linear interpolation is used to generate the action proposals with precise... 

In this paper, we study transmission of a memoryless Laplacian source over three types of channels: additive white Laplacian noise (AWLN), additive white Gaussian noise (AWGN), and slow flat-fading Rayleigh channels under both bandwidth compression and bandwidth expansion. For this purpose, we analyze two well-known hybrid digital-analog (HDA) joint source-channel coding schemes for bandwidth compression and one for bandwidth expansion. Then we obtain achievable (absolute-error) distortion regions of the HDA schemes for the matched signal-to-noise ratio (SNR) case as well as the mismatched SNR scenario. Using numerical examples, it is shown that these schemes can achieve a distortion very... 

We study transmission of a memoryless Laplacian source over an average-power limited additive white Laplacian noise (AWLN) channel under bandwidth compression in two cases: 1) matched signal-to-noise ratio (SNR), 2) mismatched SNR. A hybrid digital-analog (HDA) joint source-channel coding (JSCC) scheme is proposed and show that this scheme can achieve a distortion very close to the lower bound on mean-absolute error (MAE) distortion under matched SNR conditions  

Cooperative relaying can be introduced as a promising approach for data communication in the Internet of Things (IoT), where the source and the destination may be placed far away. In this paper, by taking a variety of realistic hardware imperfections (HWIs) and channels estimation errors (CEEs) into account, the secrecy performance of a three-hop cooperative network with a source, a destination and two consecutive amplify-and-forward (AF) relays is investigated. The relays are considered to be untrusted, i.e., while they are mandatory helpers for data transmission, they may overhear the received signals. We adopt the artificial noise injection scheme, to keep the source message secret from... 

In this paper, we investigate the diversity-multiplexing tradeoff (DMT) for multi-relay channels in finite-SNR regime. In our analysis, we consider the decode and forward (DF) relaying strategy and a line of sight path from source to destination. First, we determine the outage probability in a multi-relay scenario and obtain its exact analytical expressions. Then, the outage probability of a multi-relay channel with relay selection is calculated and provided as a closed-form expression. Based on these results, we determine the DMT in finite-SNR regime. Finally, using simulation results, we show that our analysis has accurate results which coincides with that of obtained from Monte-Carlo... 

In this paper, we study the power allocation problem in multi-cell OFDMA networks, where given the tradeoff between user satisfaction and profit of the service provider, maximizing the revenue of the service provider is also taken into account. Consequently, two Stackelberg games are proposed for allocating proper powers to central and cell-edge users. In our algorithm, assuming the fact that users agree to pay more for better QoS level, the service provider imposes optimum prices for unit-power transmitted to users as they request different levels of QoS. In addition, in order to improve system performance at cell-edge locations, users are divided into two groups based on their distance to... 

In this letter, the Gaussian two-way relay channel with direct links is investigated in which two users aim at exchanging their messages with the help of a relay node. We propose a new lattice-based compress-and-forward strategy and obtain its achievable rate-region. We show that the proposed scheme is superior to all previously known achievable schemes for channel gains larger than one. In particular, under the symmetric case, the proposed scheme is able to achieve a capacity region within 0.5 bit or (1/2)log 3 ≅ 0.79 bit, depending on the power of the relay  

Node cooperation can protect wireless networks from eavesdropping by using the physical characteristics of wireless channels rather than cryptographic methods. Allocating the proper amount of power to cooperative nodes is a challenging task. In this paper, we use three cooperative nodes, one as relay to increase throughput at the destination and two friendly jammers to degrade eavesdropper’s link. For this scenario, the secrecy rate function is a non-linear non-convex problem. So, in this case, exact optimization methods can only achieve suboptimal solution. In this paper, we applied different meta-heuristic optimization techniques, like Genetic Algorithm (GA), Partial Swarm Optimization... 

Node cooperation approaches improve physical layer security in wireless networks without applying data encryption. Selecting the appropriate nodes to cooperate as relays or friendly jammers, to degrade eavesdropper's link, is a challenging problem which has attracted a lot of attention in recent years. Various approaches, based on conventional exhaustive search, have been suggested for optimal relay-jammer selection and power allocation in the literature. The complexity of these methods is proportional to the number of intermediate nodes. As the number of intermediate nodes exceeds a specific bound, conventional exhaustive search appears infeasible due to high computational complexity. In... 

This paper presents a novel approach for power allocation and cooperative node selection to enhance physical layer security in presence of an eavesdropper in a wireless network. Our network consists of a source–destination pair and a number of cooperative nodes which can be used as relays to increase throughput at the destination, or as friendly jammers to confuse eavesdropper. First, we introduce a low complexity method, for which relay−jammer selection and power allocation are performed, simultaneously. Then, we propose self-adaptive genetic algorithm to solve the non-linear non-convex programing problem. Using the proposed method, the number of friendly jammers that ensure the secrecy... 

The quality assessment is a vital routine in videorelated industries such as broadcast service providers. Due to the duration and the excessive number of the video files, case by case assessment of the files by operators is no longer feasible. Therefore, a computer-based video quality assessment mechanism is the only solution. While it is common to measure the quality of a video file at the compression stage by comparing it against the raw data, at later stages no reference video is available for comparison. Therefore, a no-reference (Blind) video quality assessment (NR-VQA) technique is essential. The common NRVQA methods learn a quality metric based on a number of features extracted from... 

With the ever-growing portion of internet traffic associated with multimedia data and the existence of multiple copies of the same content in various forms, it has become vital to measure the quality of the image and video files. In most cases, without access to the original file, the quality shall be assessed solely based on the available file. Specifically, the challenge of no-reference image quality assessment (NR-IQA) is to predict a quality measure for given images in a consistent manner with human perception of quality. Conventional NR-IQA methods try to fit certain distortion models to a given image and quantify the quality. In practice, however, an image is affected by a combination... 

With the recent advancements in deep learning, high performance neural networks have been introduced. These neural networks also can be used to solve similar problems in a transfer learning approach. Recently, several state-of-The-Art Convolutional Neural Networks (CNNs) are proposed for computer vision tasks. On the other hand, in-The-wild No-Reference (Blind) Image Quality Assessment (NR-IQA) problem is known as a challenging human perceptual problem. In this paper, a transfer learning approach is used to solve the problem of in-The-wild NR-IQA. With a few training times, the proposed neural network exceeds all the previous methods which are not using deep neural networks. Further, the... 

Cooperative relaying is utilized as an efficient method for data communication in wireless sensor networks and the Internet of Things. However, sometimes due to the necessity of multi-hop relaying in such communication networks, it is challenging to guarantee the secrecy of cooperative transmissions when the relays may themselves be eavesdroppers, i.e., we may face with the untrusted relaying scenario where the relays are both necessary helpers and potential adversary. To obviate this issue, a new cooperative jamming scheme is proposed in this paper, in which the data can be confidentially communicated from the source to the destination through multiple untrusted relays. In our proposed... 

In conventional arrays, improving angular resolution requires larger aperture which demands more number of elements. On the other hand, array thinning is an efficient method of achieving narrow beamwidth (high angular resolution) with fewer number of elements. Reducing the number of elements results in reducing weight, cost, hardware complexity, and energy consumption. In this paper, a novel dynamic programming algorithm of array thinning with the objective of reducing sidelobe levels (SLLs), desired for large circular arrays, is proposed. The circular array is partitioned into annular rings, and the objective of the optimization problem is to determine the number of active elements in each... 

Video quality assessment is a crucial routine in the broadcasting industry. Due to the duration and the excessive number of video files, a computer-based video quality assessment mechanism is the only solution. While it is common to measure the quality of a video file at the compression stage by comparing it against the raw data, at later stages, no reference video is available for comparison. Therefore, a noreference (Blind) video quality assessment (NR-VQA) technique is essential. The current NR-VQA methods predict only the mean opinion score (MOS) and do not provide further information about the distribution of people score. However, this distribution is informative for the evaluation of... 

Cooperative relaying is utilized as an efficient method for data communication in wireless sensor networks and the Internet of Things. However, sometimes due to the necessity of multi-hop relaying in such communication networks, it is challenging to guarantee the secrecy of cooperative transmissions when the relays may themselves be eavesdroppers, i.e., we may face with the untrusted relaying scenario where the relays are both necessary helpers and potential adversary. To obviate this issue, a new cooperative jamming scheme is proposed in this paper, in which the data can be confidentially communicated from the source to the destination through multiple untrusted relays. In our proposed... 

With the emergence of social networks and improvements in the internet speed, the video data has become an ever-increasing portion of the global internet traffic. Besides the content, the quality of a video sequence is an important issue at the user end which is often affected by various factors such as compression. Therefore, monitoring the quality is crucial for the video content and service providers. A simple monitoring approach is to compare the raw video content (uncompressed) with the received data at the receiver. In most practical scenarios, however, the reference video sequence is not available. Consequently, it is desirable to have a general reference-less method for assessing the... 

Recently, V. Sorokine et al. (see IEEE Trans. Commun., vol.48, no.10, p.1660-8, 2000; vol.48, no.11, p.1818-28, 2000) have introduced a class of low-density parity-check (LDPC) codes which, when applied on an IS-95 CDMA system, show, at BER=10-3, a five-fold and two-fold increase in capacity compared to the traditional uncoded scheme and to state-of-the-art low-rate orthogonal convolutional codes, respectively. However, these codes suffer from an error-floor at lower BERs which are needed for high-quality services, such as data. To enhance the capacity of CDMA systems, not only for moderate BER values but also for lower BER values, we modify the construction of these codes slightly, to...