40,368 research outputs found
A review of RFI mitigation techniques in microwave radiometry
Radio frequency interference (RFI) is a well-known problem in microwave radiometry (MWR). Any undesired signal overlapping the MWR protected frequency bands introduces a bias in the measurements, which can corrupt the retrieved geophysical parameters. This paper presents a literature review of RFI detection and mitigation techniques for microwave radiometry from space. The reviewed techniques are divided between real aperture and aperture synthesis. A discussion and assessment of the application of RFI mitigation techniques is presented for each type of radiometer.Peer ReviewedPostprint (published version
Load curve data cleansing and imputation via sparsity and low rank
The smart grid vision is to build an intelligent power network with an
unprecedented level of situational awareness and controllability over its
services and infrastructure. This paper advocates statistical inference methods
to robustify power monitoring tasks against the outlier effects owing to faulty
readings and malicious attacks, as well as against missing data due to privacy
concerns and communication errors. In this context, a novel load cleansing and
imputation scheme is developed leveraging the low intrinsic-dimensionality of
spatiotemporal load profiles and the sparse nature of "bad data.'' A robust
estimator based on principal components pursuit (PCP) is adopted, which effects
a twofold sparsity-promoting regularization through an -norm of the
outliers, and the nuclear norm of the nominal load profiles. Upon recasting the
non-separable nuclear norm into a form amenable to decentralized optimization,
a distributed (D-) PCP algorithm is developed to carry out the imputation and
cleansing tasks using networked devices comprising the so-termed advanced
metering infrastructure. If D-PCP converges and a qualification inequality is
satisfied, the novel distributed estimator provably attains the performance of
its centralized PCP counterpart, which has access to all networkwide data.
Computer simulations and tests with real load curve data corroborate the
convergence and effectiveness of the novel D-PCP algorithm.Comment: 8 figures, submitted to IEEE Transactions on Smart Grid - Special
issue on "Optimization methods and algorithms applied to smart grid
Multitask learning without label correspondences
We propose an algorithm to perform multitask learning where each task has potentially distinct label sets and label correspondences are not readily available. This is in contrast with existing methods which either assume that the label sets shared by different tasks are the same or that there exists a label mapping oracle. Our method directly maximizes the mutual information among the labels, and we show that the resulting objective function can be efficiently optimized using existing algorithms. Our proposed approach has a direct application for data integration with different label spaces for the purpose of classification, such as integrating Yahoo! and DMOZ web directories
Quality of Information in Mobile Crowdsensing: Survey and Research Challenges
Smartphones have become the most pervasive devices in people's lives, and are
clearly transforming the way we live and perceive technology. Today's
smartphones benefit from almost ubiquitous Internet connectivity and come
equipped with a plethora of inexpensive yet powerful embedded sensors, such as
accelerometer, gyroscope, microphone, and camera. This unique combination has
enabled revolutionary applications based on the mobile crowdsensing paradigm,
such as real-time road traffic monitoring, air and noise pollution, crime
control, and wildlife monitoring, just to name a few. Differently from prior
sensing paradigms, humans are now the primary actors of the sensing process,
since they become fundamental in retrieving reliable and up-to-date information
about the event being monitored. As humans may behave unreliably or
maliciously, assessing and guaranteeing Quality of Information (QoI) becomes
more important than ever. In this paper, we provide a new framework for
defining and enforcing the QoI in mobile crowdsensing, and analyze in depth the
current state-of-the-art on the topic. We also outline novel research
challenges, along with possible directions of future work.Comment: To appear in ACM Transactions on Sensor Networks (TOSN
Novel Complex Adaptive Signal Processing Techniques Employing Optimally Derived Time-varying Convergence Factors With Applicatio
In digital signal processing in general, and wireless communications in particular, the increased usage of complex signal representations, and spectrally efficient complex modulation schemes such as QPSK and QAM has necessitated the need for efficient and fast-converging complex digital signal processing techniques. In this research, novel complex adaptive digital signal processing techniques are presented, which derive optimal convergence factors or step sizes for adjusting the adaptive system coefficients at each iteration. In addition, the real and imaginary components of the complex signal and complex adaptive filter coefficients are treated as separate entities, and are independently updated. As a result, the developed methods efficiently utilize the degrees of freedom of the adaptive system, thereby exhibiting improved convergence characteristics, even in dynamic environments. In wireless communications, acceptable co-channel, adjacent channel, and image interference rejection is often one of the most critical requirements for a receiver. In this regard, the fixed-point complex Independent Component Analysis (ICA) algorithm, called Complex FastICA, has been previously applied to realize digital blind interference suppression in stationary or slow fading environments. However, under dynamic flat fading channel conditions frequently encountered in practice, the performance of the Complex FastICA is significantly degraded. In this dissertation, novel complex block adaptive ICA algorithms employing optimal convergence factors are presented, which exhibit superior convergence speed and accuracy in time-varying flat fading channels, as compared to the Complex FastICA algorithm. The proposed algorithms are called Complex IA-ICA, Complex OBA-ICA, and Complex CBC-ICA. For adaptive filtering applications, the Complex Least Mean Square algorithm (Complex LMS) has been widely used in both block and sequential form, due to its computational simplicity. However, the main drawback of the Complex LMS algorithm is its slow convergence and dependence on the choice of the convergence factor. In this research, novel block and sequential based algorithms for complex adaptive digital filtering are presented, which overcome the inherent limitations of the existing Complex LMS. The block adaptive algorithms are called Complex OBA-LMS and Complex OBAI-LMS, and their sequential versions are named Complex HA-LMS and Complex IA-LMS, respectively. The performance of the developed techniques is tested in various adaptive filtering applications, such as channel estimation, and adaptive beamforming. The combination of Orthogonal Frequency Division Multiplexing (OFDM) and the Multiple-Input-Multiple-Output (MIMO) technique is being increasingly employed for broadband wireless systems operating in frequency selective channels. However, MIMO-OFDM systems are extremely sensitive to Intercarrier Interference (ICI), caused by Carrier Frequency Offset (CFO) between local oscillators in the transmitter and the receiver. This results in crosstalk between the various OFDM subcarriers resulting in severe deterioration in performance. In order to mitigate this problem, the previously proposed Complex OBA-ICA algorithm is employed to recover user signals in the presence of ICI and channel induced mixing. The effectiveness of the Complex OBA-ICA method in performing ICI mitigation and signal separation is tested for various values of CFO, rate of channel variation, and Signal to Noise Ratio (SNR)
Collaborative Spectrum Sensing from Sparse Observations in Cognitive Radio Networks
Spectrum sensing, which aims at detecting spectrum holes, is the precondition
for the implementation of cognitive radio (CR). Collaborative spectrum sensing
among the cognitive radio nodes is expected to improve the ability of checking
complete spectrum usage. Due to hardware limitations, each cognitive radio node
can only sense a relatively narrow band of radio spectrum. Consequently, the
available channel sensing information is far from being sufficient for
precisely recognizing the wide range of unoccupied channels. Aiming at breaking
this bottleneck, we propose to apply matrix completion and joint sparsity
recovery to reduce sensing and transmitting requirements and improve sensing
results. Specifically, equipped with a frequency selective filter, each
cognitive radio node senses linear combinations of multiple channel information
and reports them to the fusion center, where occupied channels are then decoded
from the reports by using novel matrix completion and joint sparsity recovery
algorithms. As a result, the number of reports sent from the CRs to the fusion
center is significantly reduced. We propose two decoding approaches, one based
on matrix completion and the other based on joint sparsity recovery, both of
which allow exact recovery from incomplete reports. The numerical results
validate the effectiveness and robustness of our approaches. In particular, in
small-scale networks, the matrix completion approach achieves exact channel
detection with a number of samples no more than 50% of the number of channels
in the network, while joint sparsity recovery achieves similar performance in
large-scale networks.Comment: 12 pages, 11 figure
- …