The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Discriminative dictionary learning aims to learn a dictionary from training samples in order to improve the discriminative ability of their coding vectors. Gabor wavelets have recently been successfully applied for hyperspectral image (HSI) classification due to their ability to extract joint spatial and spectrum information. Due to the high discriminative power of Gabor features, an efficient method,...
Deployed in various distributed storage systems, erasure coding has demonstrated its advantages of low storage overhead and high failure tolerance. Typically in an erasure-coded distributed storage system, systematic maximum distance seperable (MDS) codes are chosen since the optimal storage overhead can be achieved and meanwhile data can be read directly without decoding operations. However, data...
Erasure coding has been increasingly replacing replication in distributed storage systems, thanks to its lower storage overhead with the same level of failure tolerance. However, with lower storage overhead, the reconstruction overhead of erasure codes can increase significantly as well. Under the ever-changing workload, in which the data access can be highly skewed, it is difficult to achieve a well...
Electroencephalogram (EEG) signal has been widely used to analyze brain activities so as to diagnose certain brain-related diseases. They are usually recorded for a fairly long interval with adequate resolution, which requires considerable amount of memory space for storage and transmission. Compression techniques are necessary to reduce the signal size. As compared to lossless compression techniques,...
In this paper, we propose a novel network coded non-binary low-density generator matrix (LDGM) code structure for a multi-access relay system, where multiple sources transmit lattice signals to a destination with the help of a relay. Specifically, we first develop a network coded non-binary LDGM code structure by jointly considering lattice-signal transmissions at the sources and the relay. Then we...
In this paper we propose a new power adaptive network coding (PANC) strategy for a non-orthogonal multiple-access relay channel (MARC), where two sources transmit their information simultaneously to the destination with the help of a relay. In contrast to the conventional XOR-based network coding (CXNC), the relay in PANC generates network coded symbols by considering the coefficients of the source-to-relay...
Distributed storage systems store redundant data to tolerate failures of storage nodes and lost data should be repaired when storage nodes fail. A class of MDS codes, called minimum-storage regenerating (MSR) codes, has been designed to optimize bandwidth consumption when repairing one single failure. Compared with repairing failures individually, the cooperative repair of multiple failures can help...
We propose the saliency driven nonlinear diffusion filtering as a boost for object recognition. Taking saliency image as mask for magnitudes of gradients, nonlinear diffusion filtering treats foreground and background selectively. It preserves foreground information while filters out background information as much as possible. In salient area, semantically important structures are well preserved,...
This paper presents an improved bag-of-words (BoW) framework for detecting near-duplicates of images on the Web and makes three main contributions. Firstly, based on the SIFT feature descriptors, Locality-constrained Linear Coding (LLC) with the spatial pyramid is introduced to encode features. Secondly, a weighted Chi-square distance metric is proposed to compare two histograms, with an inverted...
This work formulates for the first time a multiple traveling salesman problem (MTSP) with ordinary and exclusive cities, denoted by MTSP for short. In the original MTSP, a city can be visited by any traveling salesman and is thus renamed as an ordinary one in MTSP. A new class of cities is introduced in MTSP, called exclusive ones. They are divided into groups, each of which can be exclusively visited...
In this paper, we focus on network coding design for the wireless sensor networks (WSNs), where multiple source nodes communicate with a common destination node with the help of multiple relay nodes in a two-hop fashion. Specifically, we propose an unequal error protection (UEP) distributed network-channel coding (DNCC) scheme based on Luby-transform (LT) codes. We analyse three properties of the...
In this paper, we focus on the realization of multiple interpretations (MI) in multi-way relay channels (MWRC) with fading, where multiple sources communicate with each other with the help of a relay. We first propose a novel nested convolutional lattice codes (NCLC) over the finite field, which can achieve the MI for each source in two time slots. Then we derive a theoretical upper bound for the...
The finite-SNR Diversity-Multiplexing Tradeoff (DMT) problem is studied in the context of spectrum aggregation, where there exist multiple noncontiguous (discrete) spectrum segments each of which has its own power limit. Firstly, we give an optimal power allocation strategy to achieve the ergodic capacity under Rayleigh fading. Secondly, two different coding schemes, i.e., coding without across sub-channels...
In this work we determine the achievable rate in a multi-source relaying system with Gaussian phase-fading channels. In our system, M sources simultaneously transmit their messages to a common destination in M separate frequency bands with the help of a single relay (an M − 1 − 1 system). The achievable rates of both a separate processing scheme at the relay, and a network coding scheme at the relay,...
In this paper, the authors propose a confidence- based joint orthogonal coding and modulation algorithm for soft information cooperation in the time-division broadcast bi-directional relaying networks. We first compute the log-likelihood ratio (LLR) of the received signals at relay nodes in the first two time slots, then derive the probability distribution of the scaled LLR. Inspired by the space-time...
Distributed storage systems store a substantial amount of data and maintain data integrity by storing redundancy in a large number of storage nodes. When storage nodes fail, the lost data should be regenerated on replacement nodes. Regenerating codes minimize the volume of network traffic brought by the regeneration process. However, regenerating codes consume less traffic by requiring a larger number...
We study the design of network codes for M-source, N-relay wireless networks over slow fading channels. Specifically, vector-wise binary field network coding (BFNC) schemes are proposed. In the construction of our BFNC schemes, we utilize a diversity achieving criterion which can be expressed in terms of the linear independence of quasi-cyclic matrices. Our codes can be implemented with low-complexity...
This paper studies the problem of determining the optimum degree distribution for distributed LDPC codes in multiple-access relay channels. Based on the framework of multi-edge type LDPC codes, we propose a methodology to asymptotically optimize the code's ensemble when different segments within the distributed codeword are transmitted through different channels and experience different SNRs. An average...
Polar code was proposed by Erdal Arikan as an incentive idea splitting input channels to increase its transition performance. The proposed code that is related to the recursive construction of Reed-Muller codes on the basis of 2-order square matrix G2, can achieve the symmetric capacity of arbitrary binary-input discrete memoryless channels. It has already been mentioned that in principle larger matrices...
We consider the iterative decoding of the Turbo-LDPC and Polar code. By using iterative decoding algorithm, we can get good performance and of new research programs. Turbo codes were introduced by Berrou. Polar codes were proposed by Arikan which can achieve the capacity of arbitrary symmetric binary-input channels. LDPC codes could be decoded in a similar manner to Turbo codes and polar codes, and...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.