1,472 research outputs found
Challenges and Some New Directions in Channel Coding
Three areas of ongoing research in channel coding are surveyed, and recent developments are presented in each area: spatially coupled Low-Density Parity-Check (LDPC) codes, nonbinary LDPC codes, and polar coding.This is the author accepted manuscript. The final version is available from IEEE via http://dx.doi.org/10.1109/JCN.2015.00006
Spread spectrum-based video watermarking algorithms for copyright protection
Merged with duplicate record 10026.1/2263 on 14.03.2017 by CS (TIS)Digital technologies know an unprecedented expansion in the last years. The consumer can
now benefit from hardware and software which was considered state-of-the-art several years
ago. The advantages offered by the digital technologies are major but the same digital
technology opens the door for unlimited piracy. Copying an analogue VCR tape was certainly
possible and relatively easy, in spite of various forms of protection, but due to the analogue
environment, the subsequent copies had an inherent loss in quality. This was a natural way of
limiting the multiple copying of a video material. With digital technology, this barrier
disappears, being possible to make as many copies as desired, without any loss in quality
whatsoever. Digital watermarking is one of the best available tools for fighting this threat.
The aim of the present work was to develop a digital watermarking system compliant with the
recommendations drawn by the EBU, for video broadcast monitoring. Since the watermark
can be inserted in either spatial domain or transform domain, this aspect was investigated and
led to the conclusion that wavelet transform is one of the best solutions available. Since
watermarking is not an easy task, especially considering the robustness under various attacks
several techniques were employed in order to increase the capacity/robustness of the system:
spread-spectrum and modulation techniques to cast the watermark, powerful error correction
to protect the mark, human visual models to insert a robust mark and to ensure its invisibility.
The combination of these methods led to a major improvement, but yet the system wasn't
robust to several important geometrical attacks. In order to achieve this last milestone, the
system uses two distinct watermarks: a spatial domain reference watermark and the main
watermark embedded in the wavelet domain. By using this reference watermark and techniques
specific to image registration, the system is able to determine the parameters of the attack and
revert it. Once the attack was reverted, the main watermark is recovered. The final result is a
high capacity, blind DWr-based video watermarking system, robust to a wide range of attacks.BBC Research & Developmen
ABS+ Polar Codes: Exploiting More Linear Transforms on Adjacent Bits
ABS polar codes were recently proposed to speed up polarization by swapping
certain pairs of adjacent bits after each layer of polar transform. In this
paper, we observe that applying the Arikan transform on certain pairs of adjacent bits after each polar
transform layer leads to even faster polarization.
In light of this, we propose ABS+ polar codes which incorporate the Arikan
transform in addition to the swapping transform in ABS polar codes. In order to
efficiently construct and decode ABS+ polar codes, we derive a new recursive
relation between the joint distributions of adjacent bits through different
layers of polar transforms. Simulation results over a wide range of parameters
show that the CRC-aided SCL decoder of ABS+ polar codes improves upon that of
ABS polar codes by 0.1dB--0.25dB while maintaining the same decoding time.
Moreover, ABS+ polar codes improve upon standard polar codes by 0.2dB--0.45dB
when they both use the CRC-aided SCL decoder with list size . The
implementations of all the algorithms in this paper are available at
https://github.com/PlumJelly/ABS-PolarComment: Final version to be published in IEEE Transactions on Information
Theor
Multiscale relevance and informative encoding in neuronal spike trains
Neuronal responses to complex stimuli and tasks can encompass a wide range of
time scales. Understanding these responses requires measures that characterize
how the information on these response patterns are represented across multiple
temporal resolutions. In this paper we propose a metric -- which we call
multiscale relevance (MSR) -- to capture the dynamical variability of the
activity of single neurons across different time scales. The MSR is a
non-parametric, fully featureless indicator in that it uses only the time
stamps of the firing activity without resorting to any a priori covariate or
invoking any specific structure in the tuning curve for neural activity. When
applied to neural data from the mEC and from the ADn and PoS regions of
freely-behaving rodents, we found that neurons having low MSR tend to have low
mutual information and low firing sparsity across the correlates that are
believed to be encoded by the region of the brain where the recordings were
made. In addition, neurons with high MSR contain significant information on
spatial navigation and allow to decode spatial position or head direction as
efficiently as those neurons whose firing activity has high mutual information
with the covariate to be decoded and significantly better than the set of
neurons with high local variations in their interspike intervals. Given these
results, we propose that the MSR can be used as a measure to rank and select
neurons for their information content without the need to appeal to any a
priori covariate.Comment: 38 pages, 16 figure
- …