4,897 research outputs found
Graph Signal Processing: Overview, Challenges and Applications
Research in Graph Signal Processing (GSP) aims to develop tools for
processing data defined on irregular graph domains. In this paper we first
provide an overview of core ideas in GSP and their connection to conventional
digital signal processing. We then summarize recent developments in developing
basic GSP tools, including methods for sampling, filtering or graph learning.
Next, we review progress in several application areas using GSP, including
processing and analysis of sensor network data, biological data, and
applications to image processing and machine learning. We finish by providing a
brief historical perspective to highlight how concepts recently developed in
GSP build on top of prior research in other areas.Comment: To appear, Proceedings of the IEE
Design of near-perfect-reconstructed transmultiplexer using different modulation techniques: A comparative study
AbstractIn this paper, an efficient iterative method for design of near-perfect reconstructed transmultiplexer (NPR TMUX) is proposed for the prescribed roll-off factor (RF) and stop band attenuation (As). In this method, windowing technique has been used for the design of prototype filter, and different modulation techniques have been exploited for designing multi-channel transmultiplexer (TMUX). In this method, inter-channel interference (ICI) is iteratively minimized so that it approximately reduces to ideal value zero. Design example is given to illustrate the superiority of the proposed method over earlier reported work. A comparative study of the performance of different modulation techniques for designing TMUX is also presented
Summed Parallel Infinite Impulse Response (SPIIR) Filters For Low-Latency Gravitational Wave Detection
With the upgrade of current gravitational wave detectors, the first detection
of gravitational wave signals is expected to occur in the next decade.
Low-latency gravitational wave triggers will be necessary to make fast
follow-up electromagnetic observations of events related to their source, e.g.,
prompt optical emission associated with short gamma-ray bursts. In this paper
we present a new time-domain low-latency algorithm for identifying the presence
of gravitational waves produced by compact binary coalescence events in noisy
detector data. Our method calculates the signal to noise ratio from the
summation of a bank of parallel infinite impulse response (IIR) filters. We
show that our summed parallel infinite impulse response (SPIIR) method can
retrieve the signal to noise ratio to greater than 99% of that produced from
the optimal matched filter. We emphasise the benefits of the SPIIR method for
advanced detectors, which will require larger template banks.Comment: 9 pages, 6 figures, for PR
Identification of Parametric Underspread Linear Systems and Super-Resolution Radar
Identification of time-varying linear systems, which introduce both
time-shifts (delays) and frequency-shifts (Doppler-shifts), is a central task
in many engineering applications. This paper studies the problem of
identification of underspread linear systems (ULSs), whose responses lie within
a unit-area region in the delay Doppler space, by probing them with a known
input signal. It is shown that sufficiently-underspread parametric linear
systems, described by a finite set of delays and Doppler-shifts, are
identifiable from a single observation as long as the time bandwidth product of
the input signal is proportional to the square of the total number of delay
Doppler pairs in the system. In addition, an algorithm is developed that
enables identification of parametric ULSs from an input train of pulses in
polynomial time by exploiting recent results on sub-Nyquist sampling for time
delay estimation and classical results on recovery of frequencies from a sum of
complex exponentials. Finally, application of these results to super-resolution
target detection using radar is discussed. Specifically, it is shown that the
proposed procedure allows to distinguish between multiple targets with very
close proximity in the delay Doppler space, resulting in a resolution that
substantially exceeds that of standard matched-filtering based techniques
without introducing leakage effects inherent in recently proposed compressed
sensing-based radar methods.Comment: Revised version of a journal paper submitted to IEEE Trans. Signal
Processing: 30 pages, 17 figure
Provably scale-covariant networks from oriented quasi quadrature measures in cascade
This article presents a continuous model for hierarchical networks based on a
combination of mathematically derived models of receptive fields and
biologically inspired computations. Based on a functional model of complex
cells in terms of an oriented quasi quadrature combination of first- and
second-order directional Gaussian derivatives, we couple such primitive
computations in cascade over combinatorial expansions over image orientations.
Scale-space properties of the computational primitives are analysed and it is
shown that the resulting representation allows for provable scale and rotation
covariance. A prototype application to texture analysis is developed and it is
demonstrated that a simplified mean-reduced representation of the resulting
QuasiQuadNet leads to promising experimental results on three texture datasets.Comment: 12 pages, 3 figures, 1 tabl
Towards low-latency real-time detection of gravitational waves from compact binary coalescences in the era of advanced detectors
Electromagnetic (EM) follow-up observations of gravitational wave (GW) events
will help shed light on the nature of the sources, and more can be learned if
the EM follow-ups can start as soon as the GW event becomes observable. In this
paper, we propose a computationally efficient time-domain algorithm capable of
detecting gravitational waves (GWs) from coalescing binaries of compact objects
with nearly zero time delay. In case when the signal is strong enough, our
algorithm also has the flexibility to trigger EM observation before the merger.
The key to the efficiency of our algorithm arises from the use of chains of
so-called Infinite Impulse Response (IIR) filters, which filter time-series
data recursively. Computational cost is further reduced by a template
interpolation technique that requires filtering to be done only for a much
coarser template bank than otherwise required to sufficiently recover optimal
signal-to-noise ratio. Towards future detectors with sensitivity extending to
lower frequencies, our algorithm's computational cost is shown to increase
rather insignificantly compared to the conventional time-domain correlation
method. Moreover, at latencies of less than hundreds to thousands of seconds,
this method is expected to be computationally more efficient than the
straightforward frequency-domain method.Comment: 19 pages, 6 figures, for PR
- …