271,483 research outputs found
Collaborative Estimation in Distributed Sensor Networks
Networks of smart ultra-portable devices are already indispensable in our lives, augmenting our senses and connecting our lives through real time processing and communication of sensory (e.g., audio, video, location) inputs. Though usually hidden from the user\u27s sight, the engineering of these devices involves fierce tradeoffs between energy availability (battery sizes impact portability) and signal processing / communication capability (which impacts the smartness of the devices). The goal of this dissertation is to provide a fundamental understanding and characterization of these tradeoffs in the context of a sensor network, where the goal is to estimate a common signal by coordinating a multitude of battery-powered sensor nodes. Most of the research so far has been based on two key assumptions -- distributed processing and temporal independence -- that lend analytical tractability to the problem but otherwise are often found lacking in practice. This dissertation introduces novel techniques to relax these assumptions -- leading to vastly efficient energy usage in typical networks (up to 20% savings) and new insights on the quality of inference. For example, the phenomenon of sensor drift is ubiquitous in applications such as air-quality monitoring, oceanography and bridge monitoring, where calibration is often difficult and costly. This dissertation provides an analytical framework linking the state of calibration to the overall uncertainty of the inferred parameters.
In distributed estimation, sensor nodes locally process their observed data and send the resulting messages to a sink, which combines the received messages to produce a final estimate of the unknown parameter. In this dissertation, this problem is generalized and called collaborative estimation , where some sensors can potentially have access to the observations from neighboring sensors and use that information to enhance the quality of their messages sent to the sink, while using the same (or lower) energy resources. This is motivated by the fact that inter-sensor communication may be possible if sensors are geographically close. As demonstrated in this dissertation, collaborative estimation is particularly effective in energy-skewed and information-skewed networks, where some nodes may have larger batteries than others and similarly some nodes may be more informative (less noisy) compared to others. Since the node with the largest battery is not necessarily also the most informative, the proposed inter-sensor collaboration provides a natural framework to route the relevant information from low-energy-high-quality nodes to high-energy-low-quality nodes in a manner that enhances the overall power-distortion tradeoff.
This dissertation also analyzes how time-correlated measurement noise affects the uncertainties of inferred parameters. Imperfections such as baseline drift in sensors result in a time-correlated additive component in the measurement noise. Though some models of drift have been reported in the literature earlier, none of the studies have considered the effect of drifting sensors on an estimation application. In this dissertation, approximate measures of estimation accuracy (Cramer-Rao bounds) are derived as a function of physical properties of sensors -- namely the drift strength, correlation (Markov) factor and the time-elapsed since last calibration. For stationary drift (Markov factor less than one), it is demonstrated that the first order effect of drift is asymptotically equivalent to scaling the measurement noise by an appropriate factor. When the drift is non-stationary (Markov factor equal to one), it is established that the constant part of a signal can only be estimated inconsistently (with non-zero asymptotic variance). The results help quantify the notions that measurements taken sooner after calibration result in more accurate inference
Covariance Estimation in Elliptical Models with Convex Structure
We address structured covariance estimation in Elliptical distribution. We
assume it is a priori known that the covariance belongs to a given convex set,
e.g., the set of Toeplitz or banded matrices. We consider the General Method of
Moments (GMM) optimization subject to these convex constraints. Unfortunately,
GMM is still non-convex due to objective. Instead, we propose COCA - a convex
relaxation which can be efficiently solved. We prove that the relaxation is
tight in the unconstrained case for a finite number of samples, and in the
constrained case asymptotically. We then illustrate the advantages of COCA in
synthetic simulations with structured Compound Gaussian distributions. In these
examples, COCA outperforms competing methods as Tyler's estimate and its
projection onto a convex set
Advanced Algorithms for Satellite Communication Signal Processing
Dizertační práce je zaměřena na softwarově definované přijímače určené k úzkopásmové družicové komunikaci. Komunikační kanály družicových spojů zahrnujících komunikaci s hlubokým vesmírem jsou zatíženy vysokými úrovněmi šumu, typicky modelovaného AWGN, a silným Dopplerovým posuvem signálu způsobeným mimořádnou rychlostí pohybu objektu. Dizertační práce představuje možné postupy řešení výpočetně efektivní digitální downkonverze úzkopásmových signálů a systému odhadu kmitočtu nosné úzkopásmových signálů zatížených Dopplerovým posuvem v řádu násobků šířky pásma signálu. Popis navrhovaných algoritmů zahrnuje analytický postup jejich vývoje a tam, kde je to možné, i analytické hodnocení jejich chování. Algoritmy jsou modelovány v prostředí MATLAB Simulink a tyto modely jsou využity pro ověření vlastností simulacemi. Modely byly také využity k experimentálním testům na reálném signálu přijatém z družice PSAT v laboratoři experimentálních družic na ústavu radioelektroniky.The dissertation is focused on software defined receivers intended for narrowband satellite communication. The satellite communication channel including deep space communication suffers from a high level of noise, typically modeled by AWGN, and from a strong Doppler shift of a signal caused by the unprecedented speed of an object in motion. The dissertation shows possible approaches to the issues of computationally efficient digital downconversion of narrowband signals and the carrier frequency estimation of narrowband signals distorted by the Doppler shift in the order of multiples of the signal bandwidth. The description of the proposed algorithms includes an analytical approach of its development and, if possible, the analytical performance assessment. The algorithms are modeled in MATLAB Simulink and the models are used for validating the performance by the simulation. The models were also used for experimental tests on the real signal received from the PSAT satellite at the laboratory of experimental satellites at the department of radio electronics.
Tensor Decompositions for Signal Processing Applications From Two-way to Multiway Component Analysis
The widespread use of multi-sensor technology and the emergence of big
datasets has highlighted the limitations of standard flat-view matrix models
and the necessity to move towards more versatile data analysis tools. We show
that higher-order tensors (i.e., multiway arrays) enable such a fundamental
paradigm shift towards models that are essentially polynomial and whose
uniqueness, unlike the matrix methods, is guaranteed under verymild and natural
conditions. Benefiting fromthe power ofmultilinear algebra as theirmathematical
backbone, data analysis techniques using tensor decompositions are shown to
have great flexibility in the choice of constraints that match data properties,
and to find more general latent components in the data than matrix-based
methods. A comprehensive introduction to tensor decompositions is provided from
a signal processing perspective, starting from the algebraic foundations, via
basic Canonical Polyadic and Tucker models, through to advanced cause-effect
and multi-view data analysis schemes. We show that tensor decompositions enable
natural generalizations of some commonly used signal processing paradigms, such
as canonical correlation and subspace techniques, signal separation, linear
regression, feature extraction and classification. We also cover computational
aspects, and point out how ideas from compressed sensing and scientific
computing may be used for addressing the otherwise unmanageable storage and
manipulation problems associated with big datasets. The concepts are supported
by illustrative real world case studies illuminating the benefits of the tensor
framework, as efficient and promising tools for modern signal processing, data
analysis and machine learning applications; these benefits also extend to
vector/matrix data through tensorization. Keywords: ICA, NMF, CPD, Tucker
decomposition, HOSVD, tensor networks, Tensor Train
Acoustical Ranging Techniques in Embedded Wireless Sensor Networked Devices
Location sensing provides endless opportunities for a wide range of applications in GPS-obstructed environments;
where, typically, there is a need for higher degree of accuracy. In this article, we focus on robust range
estimation, an important prerequisite for fine-grained localization. Motivated by the promise of acoustic in
delivering high ranging accuracy, we present the design, implementation and evaluation of acoustic (both
ultrasound and audible) ranging systems.We distill the limitations of acoustic ranging; and present efficient
signal designs and detection algorithms to overcome the challenges of coverage, range, accuracy/resolution,
tolerance to Doppler’s effect, and audible intensity. We evaluate our proposed techniques experimentally on
TWEET, a low-power platform purpose-built for acoustic ranging applications. Our experiments demonstrate
an operational range of 20 m (outdoor) and an average accuracy 2 cm in the ultrasound domain. Finally,
we present the design of an audible-range acoustic tracking service that encompasses the benefits of a near-inaudible
acoustic broadband chirp and approximately two times increase in Doppler tolerance to achieve better performance
Overview of Constrained PARAFAC Models
In this paper, we present an overview of constrained PARAFAC models where the
constraints model linear dependencies among columns of the factor matrices of
the tensor decomposition, or alternatively, the pattern of interactions between
different modes of the tensor which are captured by the equivalent core tensor.
Some tensor prerequisites with a particular emphasis on mode combination using
Kronecker products of canonical vectors that makes easier matricization
operations, are first introduced. This Kronecker product based approach is also
formulated in terms of the index notation, which provides an original and
concise formalism for both matricizing tensors and writing tensor models. Then,
after a brief reminder of PARAFAC and Tucker models, two families of
constrained tensor models, the co-called PARALIND/CONFAC and PARATUCK models,
are described in a unified framework, for order tensors. New tensor
models, called nested Tucker models and block PARALIND/CONFAC models, are also
introduced. A link between PARATUCK models and constrained PARAFAC models is
then established. Finally, new uniqueness properties of PARATUCK models are
deduced from sufficient conditions for essential uniqueness of their associated
constrained PARAFAC models
- …