295 research outputs found
Graded quantization for multiple description coding of compressive measurements
Compressed sensing (CS) is an emerging paradigm for acquisition of compressed
representations of a sparse signal. Its low complexity is appealing for
resource-constrained scenarios like sensor networks. However, such scenarios
are often coupled with unreliable communication channels and providing robust
transmission of the acquired data to a receiver is an issue. Multiple
description coding (MDC) effectively combats channel losses for systems without
feedback, thus raising the interest in developing MDC methods explicitly
designed for the CS framework, and exploiting its properties. We propose a
method called Graded Quantization (CS-GQ) that leverages the democratic
property of compressive measurements to effectively implement MDC, and we
provide methods to optimize its performance. A novel decoding algorithm based
on the alternating directions method of multipliers is derived to reconstruct
signals from a limited number of received descriptions. Simulations are
performed to assess the performance of CS-GQ against other methods in presence
of packet losses. The proposed method is successful at providing robust coding
of CS measurements and outperforms other schemes for the considered test
metrics
Graded quantization for multiple description coding of compressive measurements
Compressed sensing (CS) is an emerging paradigm for acquisition of compressed representations of a sparse signal. Its low complexity is appealing for resource-constrained scenarios like sensor networks. However, such scenarios are often coupled with unreliable communication channels and providing robust transmission of the acquired data to a receiver is an issue. Multiple description coding (MDC) effectively combats channel losses for systems without feedback, thus raising the interest in developing MDC methods explicitly designed for the CS framework, and exploiting its properties. We propose a method called Graded Quantization (CS-GQ) that leverages the democratic property of compressive measurements to effectively implement MDC, and we provide methods to optimize its performance. A novel decoding algorithm based on the alternating directions method of multipliers is derived to reconstruct signals from a limited number of received descriptions. Simulations are performed to assess the performance of CS-GQ against other methods in presence of packet losses. The proposed method is successful at providing robust coding of CS measurements and outperforms other schemes for the considered test metrics
Graded quantization: democracy for multiple descriptions in compressed sensing
The compressed sensing paradigm allows to efficiently represent sparse
signals by means of their linear measurements. However, the problem of
transmitting these measurements to a receiver over a channel potentially prone
to packet losses has received little attention so far. In this paper, we
propose novel methods to generate multiple descriptions from compressed sensing
measurements to increase the robustness over unreliable channels. In
particular, we exploit the democracy property of compressive measurements to
generate descriptions in a simple manner by partitioning the measurement vector
and properly allocating bit-rate, outperforming classical methods like the
multiple description scalar quantizer. In addition, we propose a modified
version of the Basis Pursuit Denoising recovery procedure that is specifically
tailored to the proposed methods. Experimental results show significant
performance gains with respect to existing methods
Sparse linear regression with compressed and low-precision data via concave quadratic programming
We consider the problem of the recovery of a k-sparse vector from compressed
linear measurements when data are corrupted by a quantization noise. When the
number of measurements is not sufficiently large, different -sparse
solutions may be present in the feasible set, and the classical l1 approach may
be unsuccessful. For this motivation, we propose a non-convex quadratic
programming method, which exploits prior information on the magnitude of the
non-zero parameters. This results in a more efficient support recovery. We
provide sufficient conditions for successful recovery and numerical simulations
to illustrate the practical feasibility of the proposed method
Limits on Sparse Data Acquisition: RIC Analysis of Finite Gaussian Matrices
One of the key issues in the acquisition of sparse data by means of
compressed sensing (CS) is the design of the measurement matrix. Gaussian
matrices have been proven to be information-theoretically optimal in terms of
minimizing the required number of measurements for sparse recovery. In this
paper we provide a new approach for the analysis of the restricted isometry
constant (RIC) of finite dimensional Gaussian measurement matrices. The
proposed method relies on the exact distributions of the extreme eigenvalues
for Wishart matrices. First, we derive the probability that the restricted
isometry property is satisfied for a given sufficient recovery condition on the
RIC, and propose a probabilistic framework to study both the symmetric and
asymmetric RICs. Then, we analyze the recovery of compressible signals in noise
through the statistical characterization of stability and robustness. The
presented framework determines limits on various sparse recovery algorithms for
finite size problems. In particular, it provides a tight lower bound on the
maximum sparsity order of the acquired data allowing signal recovery with a
given target probability. Also, we derive simple approximations for the RICs
based on the Tracy-Widom distribution.Comment: 11 pages, 6 figures, accepted for publication in IEEE transactions on
information theor
Non-destructive characterization of thin layer resonant tunnelling diodes
We present an advanced nondestructive characterization scheme for high current density AlAs/InGaAs resonant tunneling diodes pseudomorphically grown on InP substrates. We show how low-temperature photoluminescence spectroscopy (LT-PL) and high-resolution X-ray diffractometry (HR-XRD) are complementary techniques to increase the confidence of the characterized structure. The lattice-matched InGaAs is characterized and found to be of high quality. We discuss the inclusion of an undoped “copy” well (C-well) in terms of enhancements to HR-XRD and LT-PL characterization and quantify the improved precision in determining the structure. As a consequence of this enhanced precision in the determination of physical structure, the AlAs barriers and quantum well (QW) system are found to contain nonideal material interfaces. Their roughness is characterized in terms of the full width to half-maximum of the split LT-PL emission peaks, revealing a ±1 atomic sheet variance to the QW width. We show how barrier asymmetry can be detected through fitting of both optical spectra and HR-XRD rocking curves
Sparse Signal Processing and Statistical Inference for Internet of Things
Data originating from many devices within the Internet of Things (IoT) framework can be modeled as sparse signals. Efficient compression techniques of such data are essential to reduce the memory storage, bandwidth, and transmission power. In this thesis, I develop some theory and propose practical schemes for IoT applications to exploit the signal sparsity for efficient data acquisition and compression under the frameworks of compressed sensing (CS) and transform coding.
In the context of CS, the restricted isometry constant of finite Gaussian measurement matrices is investigated, based on the exact distributions of the extreme eigenvalues of Wishart matrices. The analysis determines how aggressively the signal can be sub-sampled and recovered from a small number of linear measurements. The signal reconstruction is guaranteed, with a predefined probability, via various recovery algorithms.
Moreover, the measurement matrix design for simultaneously acquiring multiple signals is considered. This problem is important for IoT networks, where a huge number of nodes are involved. In this scenario, the presented analytical methods provide limits on the compression of joint sparse sources by analyzing the weak restricted isometry constant of Gaussian measurement matrices.
Regarding transform coding, two efficient source encoders for noisy sparse sources are proposed, based on channel coding theory. The analytical performance is derived in terms of the operational rate-distortion and energy-distortion. Furthermore, a case study for the compression of real signals from a wireless sensor network using the proposed encoders is considered. These techniques can reduce the power consumption and increase the lifetime of IoT networks.
Finally, a frame synchronization mechanism has been designed to achieve reliable radio links for IoT devices, where optimal and suboptimal metrics for noncoherent frame synchronization are derived. The proposed tests outperform the commonly used correlation detector, leading to accurate data extraction and reduced power consumption
Algorithms for super-resolution of images based on Sparse Representation and Manifolds
lmage super-resolution is defined as a class of techniques that enhance the spatial resolution of images. Super-resolution methods can be subdivided in single and multi image methods. This thesis focuses on developing algorithms based on mathematical theories for single image super resolution problems. lndeed, in arder to estimate an output image, we adopta mixed approach: i.e., we use both a dictionary of patches with sparsity constraints (typical of learning-based methods) and regularization terms (typical of reconstruction-based methods). Although the existing methods already per- form well, they do not take into account the geometry of the data to: regularize the solution, cluster data samples (samples are often clustered using algorithms with the Euclidean distance as a dissimilarity metric), learn dictionaries (they are often learned using PCA or K-SVD). Thus, state-of-the-art methods still suffer from shortcomings. In this work, we proposed three new methods to overcome these deficiencies. First, we developed SE-ASDS (a structure tensor based regularization term) in arder to improve the sharpness of edges. SE-ASDS achieves much better results than many state-of-the- art algorithms. Then, we proposed AGNN and GOC algorithms for determining a local subset of training samples from which a good local model can be computed for recon- structing a given input test sample, where we take into account the underlying geometry of the data. AGNN and GOC methods outperform spectral clustering, soft clustering, and geodesic distance based subset selection in most settings. Next, we proposed aSOB strategy which takes into account the geometry of the data and the dictionary size. The aSOB strategy outperforms both PCA and PGA methods. Finally, we combine all our methods in a unique algorithm, named G2SR. Our proposed G2SR algorithm shows better visual and quantitative results when compared to the results of state-of-the-art methods.Coordenação de Aperfeiçoamento de Pessoal de Nível SuperiorTese (Doutorado)Super-resolução de imagens é definido como urna classe de técnicas que melhora a resolução espacial de imagens. Métodos de super-resolução podem ser subdivididos em métodos para urna única imagens e métodos para múltiplas imagens. Esta tese foca no desenvolvimento de algoritmos baseados em teorias matemáticas para problemas de super-resolução de urna única imagem. Com o propósito de estimar urna imagem de saída, nós adotamos urna abordagem mista, ou seja: nós usamos dicionários de patches com restrição de esparsidade (método baseado em aprendizagem) e termos de regularização (método baseado em reconstrução). Embora os métodos existentes sejam eficientes, eles nao levam em consideração a geometria dos dados para: regularizar a solução, clusterizar os dados (dados sao frequentemente clusterizados usando algoritmos com a distancia Euclideana como métrica de dissimilaridade), aprendizado de dicionários (eles sao frequentemente treinados usando PCA ou K-SVD). Portante, os métodos do estado da arte ainda tem algumas deficiencias. Neste trabalho, nós propomos tres métodos originais para superar estas deficiencias. Primeiro, nós desenvolvemos SE-ASDS (um termo de regularização baseado em structure tensor) afim de melhorar a nitidez das bordas das imagens. SE-ASDS alcança resultados muito melhores que os algoritmos do estado da arte. Em seguida, nós propomos os algoritmos AGNN e GOC para determinar um subconjunto de amostras de treinamento a partir das quais um bom modelo local pode ser calculado para reconstruir urna dada amostra de entrada considerando a geometria dos dados. Os métodos AGNN e GOC superamos métodos spectral clustering, soft clustering e os métodos baseados em distancia geodésica na maioria dos casos. Depois, nós propomos o método aSOB que leva em consideração a geometria dos dados e o tamanho do dicionário. O método aSOB supera os métodos PCA e PGA. Finalmente, nós combinamos todos os métodos que propomos em um único algoritmo, a saber, G2SR. Nosso algoritmo G2SR mostra resultados melhores que os métodos do estado da arte em termos de PSRN, SSIM, FSIM e qualidade visual
A Panorama on Multiscale Geometric Representations, Intertwining Spatial, Directional and Frequency Selectivity
The richness of natural images makes the quest for optimal representations in
image processing and computer vision challenging. The latter observation has
not prevented the design of image representations, which trade off between
efficiency and complexity, while achieving accurate rendering of smooth regions
as well as reproducing faithful contours and textures. The most recent ones,
proposed in the past decade, share an hybrid heritage highlighting the
multiscale and oriented nature of edges and patterns in images. This paper
presents a panorama of the aforementioned literature on decompositions in
multiscale, multi-orientation bases or dictionaries. They typically exhibit
redundancy to improve sparsity in the transformed domain and sometimes its
invariance with respect to simple geometric deformations (translation,
rotation). Oriented multiscale dictionaries extend traditional wavelet
processing and may offer rotation invariance. Highly redundant dictionaries
require specific algorithms to simplify the search for an efficient (sparse)
representation. We also discuss the extension of multiscale geometric
decompositions to non-Euclidean domains such as the sphere or arbitrary meshed
surfaces. The etymology of panorama suggests an overview, based on a choice of
partially overlapping "pictures". We hope that this paper will contribute to
the appreciation and apprehension of a stream of current research directions in
image understanding.Comment: 65 pages, 33 figures, 303 reference
Resonant tunnelling diodes for THz communications
Resonant tunnelling diodes realised in the InGaAs/AlAs compound semiconductor system lattice-matched to InP substrates represent one of the fastest electronic solid-state devices, with demonstrated oscillation capability in excess of 2 THz.
Current state-of-the-art offers a poor DC-to-RF conversion efficiency. This thesis discusses the structural issues limiting the device performance and offers structural design optimums based on quantum transport modelling. These structures are viewed in the context of epitaxial growth limitations and their extrinsic oscillator performance. An advanced non-destructive characterisation
scheme based on low-temperature photoluminescence spectroscopy and high-resolution TEM is proposed to verify the epitaxial perfection of the proposed structure, followed by recommendations to improve the statistical process control, and eventually yield of these very high-current density mesoscopic devices. This work concludes with an outward look towards other compound semiconductor systems, advanced layer structures, and antenna designs
- …