18,919 research outputs found
Wireless Interference Identification with Convolutional Neural Networks
The steadily growing use of license-free frequency bands requires reliable
coexistence management for deterministic medium utilization. For interference
mitigation, proper wireless interference identification (WII) is essential. In
this work we propose the first WII approach based upon deep convolutional
neural networks (CNNs). The CNN naively learns its features through
self-optimization during an extensive data-driven GPU-based training process.
We propose a CNN example which is based upon sensing snapshots with a limited
duration of 12.8 {\mu}s and an acquisition bandwidth of 10 MHz. The CNN differs
between 15 classes. They represent packet transmissions of IEEE 802.11 b/g,
IEEE 802.15.4 and IEEE 802.15.1 with overlapping frequency channels within the
2.4 GHz ISM band. We show that the CNN outperforms state-of-the-art WII
approaches and has a classification accuracy greater than 95% for
signal-to-noise ratio of at least -5 dB
Multiple pattern classification by sparse subspace decomposition
A robust classification method is developed on the basis of sparse subspace
decomposition. This method tries to decompose a mixture of subspaces of
unlabeled data (queries) into class subspaces as few as possible. Each query is
classified into the class whose subspace significantly contributes to the
decomposed subspace. Multiple queries from different classes can be
simultaneously classified into their respective classes. A practical greedy
algorithm of the sparse subspace decomposition is designed for the
classification. The present method achieves high recognition rate and robust
performance exploiting joint sparsity.Comment: 8 pages, 3 figures, 2nd IEEE International Workshop on Subspace
Methods, Workshop Proceedings of ICCV 200
Process of image super-resolution
In this paper we explain a process of super-resolution reconstruction
allowing to increase the resolution of an image.The need for high-resolution
digital images exists in diverse domains, for example the medical and spatial
domains. The obtaining of high-resolution digital images can be made at the
time of the shooting, but it is often synonymic of important costs because of
the necessary material to avoid such costs, it is known how to use methods of
super-resolution reconstruction, consisting from one or several low resolution
images to obtain a high-resolution image. The american patent US 9208537
describes such an algorithm. A zone of one low-resolution image is isolated and
categorized according to the information contained in pixels forming the
borders of the zone. The category of it zone determines the type of
interpolation used to add pixels in aforementioned zone, to increase the
neatness of the images. It is also known how to reconstruct a low-resolution
image there high-resolution image by using a model of super-resolution
reconstruction whose learning is based on networks of neurons and on image or a
picture library. The demand of chinese patent CN 107563965 and the scientist
publication "Pixel Recursive Super Resolution", R. Dahl, M. Norouzi, J. Shlens
propose such methods. The aim of this paper is to demonstrate that it is
possible to reconstruct coherent human faces from very degraded pixelated
images with a very fast algorithm, more faster than compressed sensing (CS),
easier to compute and without deep learning, so without important technology
resources, i.e. a large database of thousands training images (see
arXiv:2003.13063).
This technological breakthrough has been patented in 2018 with the demand of
French patent FR 1855485 (https://patents.google.com/patent/FR3082980A1, see
the HAL reference https://hal.archives-ouvertes.fr/hal-01875898v1).Comment: 19 pages, 10 figure
Compressive Imaging Using RIP-Compliant CMOS Imager Architecture and Landweber Reconstruction
In this paper, we present a new image sensor architecture for fast and accurate compressive sensing (CS) of natural images. Measurement matrices usually employed in CS CMOS image sensors are recursive pseudo-random binary matrices. We have proved that the restricted isometry property of these matrices is limited by a low sparsity constant. The quality of these matrices is also affected by the non-idealities of pseudo-random number generators (PRNG). To overcome these limitations, we propose a hardware-friendly pseudo-random ternary measurement matrix generated on-chip by means of class III elementary cellular automata (ECA). These ECA present a chaotic behavior that emulates random CS measurement matrices better than other PRNG. We have combined this new architecture with a block-based CS smoothed-projected Landweber reconstruction algorithm. By means of single value decomposition, we have adapted this algorithm to perform fast and precise reconstruction while operating with binary and ternary matrices. Simulations are provided to qualify the approach.Ministerio de Economía y Competitividad TEC2015-66878-C3-1-RJunta de Andalucía TIC 2338-2013Office of Naval Research (USA) N000141410355European Union H2020 76586
- …