1,312 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
Convolutional neural networks: a magic bullet for gravitational-wave detection?
In the last few years, machine learning techniques, in particular
convolutional neural networks, have been investigated as a method to replace or
complement traditional matched filtering techniques that are used to detect the
gravitational-wave signature of merging black holes. However, to date, these
methods have not yet been successfully applied to the analysis of long
stretches of data recorded by the Advanced LIGO and Virgo gravitational-wave
observatories. In this work, we critically examine the use of convolutional
neural networks as a tool to search for merging black holes. We identify the
strengths and limitations of this approach, highlight some common pitfalls in
translating between machine learning and gravitational-wave astronomy, and
discuss the interdisciplinary challenges. In particular, we explain in detail
why convolutional neural networks alone cannot be used to claim a statistically
significant gravitational-wave detection. However, we demonstrate how they can
still be used to rapidly flag the times of potential signals in the data for a
more detailed follow-up. Our convolutional neural network architecture as well
as the proposed performance metrics are better suited for this task than a
standard binary classifications scheme. A detailed evaluation of our approach
on Advanced LIGO data demonstrates the potential of such systems as trigger
generators. Finally, we sound a note of caution by constructing adversarial
examples, which showcase interesting "failure modes" of our model, where inputs
with no visible resemblance to real gravitational-wave signals are identified
as such by the network with high confidence.Comment: First two authors contributed equally; appeared at Phys. Rev.
An efficient local binary pattern based plantar pressure optical sensor image classification using convolutional neural networks
The objective of this study was to design and produce highly comfortable shoe products guided by a plantar pressure imaging data-set. Previous studies have focused on the geometric measurement on the size of the plantar, while in this research a plantar pressure optical imaging data-set based classification technology has been developed. In this paper, an improved local binary pattern (LBP) algorithm is used to extract texture-based features and recognize patterns from the data-set. A calculating model of plantar pressure imaging feature area is established subsequently. The data-set is classified by a neural network to guide the generation of various shoe-last surfaces. Firstly, the local binary mode is improved to adapt to the pressure imaging data-set, and the texture-based feature calculation is fully used to accurately generate the feature point set; hereafter, the plantar pressure imaging feature point set is then used to guide the design of last free surface forming. In the presented experiments of plantar imaging, multi-dimensional texture-based features and improved LBP features have been found by a convolution neural network (CNN), and compared with a 21-input-3-output two-layer perceptual neural network. Three feet types are investigated in the experiment, being flatfoot (F) referring to the lack of a normal arch, or arch collapse, Talipes Equinovarus (TE), being the front part of the foot is adduction, calcaneus varus, plantar flexion, or Achilles tendon contracture and Normal (N). This research has achieved an 82% accuracy rate with 10 hidden-layers CNN of rotation invariance LBP (RI-LBP) algorithm using 21 texture-based features by comparing other deep learning methods presented in the literature
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. © 2015 KICS
A Bayesian approach to the study of white dwarf binaries in LISA data: The application of a reversible jump Markov chain Monte Carlo method
The Laser Interferometer Space Antenna (LISA) defines new demands on data
analysis efforts in its all-sky gravitational wave survey, recording
simultaneously thousands of galactic compact object binary foreground sources
and tens to hundreds of background sources like binary black hole mergers and
extreme mass ratio inspirals. We approach this problem with an adaptive and
fully automatic Reversible Jump Markov Chain Monte Carlo sampler, able to
sample from the joint posterior density function (as established by Bayes
theorem) for a given mixture of signals "out of the box'', handling the total
number of signals as an additional unknown parameter beside the unknown
parameters of each individual source and the noise floor. We show in examples
from the LISA Mock Data Challenge implementing the full response of LISA in its
TDI description that this sampler is able to extract monochromatic Double White
Dwarf signals out of colored instrumental noise and additional foreground and
background noise successfully in a global fitting approach. We introduce 2
examples with fixed number of signals (MCMC sampling), and 1 example with
unknown number of signals (RJ-MCMC), the latter further promoting the idea
behind an experimental adaptation of the model indicator proposal densities in
the main sampling stage. We note that the experienced runtimes and degeneracies
in parameter extraction limit the shown examples to the extraction of a low but
realistic number of signals.Comment: 18 pages, 9 figures, 3 tables, accepted for publication in PRD,
revised versio
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
- âŠ