40,418 research outputs found
Alternating minimisation for glottal inverse filtering
A new method is proposed for solving the glottal inverse filtering (GIF) problem. The goal of GIF is to separate an acoustical speech signal into two parts: the glottal airflow excitation and the vocal tract filter. To recover such information one has to deal with a blind deconvolution problem. This ill-posed inverse problem is solved under a deterministic setting, considering unknowns on both sides of the underlying operator equation. A stable reconstruction is obtained using a double regularization strategy, alternating between fixing either the glottal source signal or the vocal tract filter. This enables not only splitting the nonlinear and nonconvex problem into two linear and convex problems, but also allows the use of the best parameters and constraints to recover each variable at a time. This new technique, called alternating minimization glottal inverse filtering (AM-GIF), is compared with two other approaches: Markov chain Monte Carlo glottal inverse filtering (MCMC-GIF), and iterative adaptive inverse filtering (IAIF), using synthetic speech signals. The recent MCMC-GIF has good reconstruction quality but high computational cost. The state-of-the-art IAIF method is computationally fast but its accuracy deteriorates, particularly for speech signals of high fundamental frequency (F0). The results show the competitive performance of the new method: With high F0, the reconstruction quality is better than that of IAIF and close to MCMC-GIF while reducing the computational complexity by two orders of magnitude.Peer reviewe
A Primal-Dual Proximal Algorithm for Sparse Template-Based Adaptive Filtering: Application to Seismic Multiple Removal
Unveiling meaningful geophysical information from seismic data requires to
deal with both random and structured "noises". As their amplitude may be
greater than signals of interest (primaries), additional prior information is
especially important in performing efficient signal separation. We address here
the problem of multiple reflections, caused by wave-field bouncing between
layers. Since only approximate models of these phenomena are available, we
propose a flexible framework for time-varying adaptive filtering of seismic
signals, using sparse representations, based on inaccurate templates. We recast
the joint estimation of adaptive filters and primaries in a new convex
variational formulation. This approach allows us to incorporate plausible
knowledge about noise statistics, data sparsity and slow filter variation in
parsimony-promoting wavelet frames. The designed primal-dual algorithm solves a
constrained minimization problem that alleviates standard regularization issues
in finding hyperparameters. The approach demonstrates significantly good
performance in low signal-to-noise ratio conditions, both for simulated and
real field seismic data
A constrained-based optimization approach for seismic data recovery problems
Random and structured noise both affect seismic data, hiding the reflections
of interest (primaries) that carry meaningful geophysical interpretation. When
the structured noise is composed of multiple reflections, its adaptive
cancellation is obtained through time-varying filtering, compensating
inaccuracies in given approximate templates. The under-determined problem can
then be formulated as a convex optimization one, providing estimates of both
filters and primaries. Within this framework, the criterion to be minimized
mainly consists of two parts: a data fidelity term and hard constraints
modeling a priori information. This formulation may avoid, or at least
facilitate, some parameter determination tasks, usually difficult to perform in
inverse problems. Not only classical constraints, such as sparsity, are
considered here, but also constraints expressed through hyperplanes, onto which
the projection is easy to compute. The latter constraints lead to improved
performance by further constraining the space of geophysically sound solutions.Comment: International Conference on Acoustics, Speech and Signal Processing
(ICASSP 2014); Special session "Seismic Signal Processing
Underdetermined-order recursive least-squares adaptive filtering: The concept and algorithms
Published versio
Graph Spectral Image Processing
Recent advent of graph signal processing (GSP) has spurred intensive studies
of signals that live naturally on irregular data kernels described by graphs
(e.g., social networks, wireless sensor networks). Though a digital image
contains pixels that reside on a regularly sampled 2D grid, if one can design
an appropriate underlying graph connecting pixels with weights that reflect the
image structure, then one can interpret the image (or image patch) as a signal
on a graph, and apply GSP tools for processing and analysis of the signal in
graph spectral domain. In this article, we overview recent graph spectral
techniques in GSP specifically for image / video processing. The topics covered
include image compression, image restoration, image filtering and image
segmentation
Depth Superresolution using Motion Adaptive Regularization
Spatial resolution of depth sensors is often significantly lower compared to
that of conventional optical cameras. Recent work has explored the idea of
improving the resolution of depth using higher resolution intensity as a side
information. In this paper, we demonstrate that further incorporating temporal
information in videos can significantly improve the results. In particular, we
propose a novel approach that improves depth resolution, exploiting the
space-time redundancy in the depth and intensity using motion-adaptive low-rank
regularization. Experiments confirm that the proposed approach substantially
improves the quality of the estimated high-resolution depth. Our approach can
be a first component in systems using vision techniques that rely on high
resolution depth information
Enhanced monopulse radar tracking using optimum fractional Fourier transform
Conventional monopulse radar processors are used to track a target that appears in the look direction beam width. The distortion produced when additional targets appear in the look direction beam width can cause severe erroneous outcomes from the monopulse processor. This leads to errors in the target tracking angles that may cause target mistracking. A new signal processing algorithm is presented in this paper which offers a solution to this problem. The technique is based on the use of optimal Fractional Fourier Transform (FrFT) filtering. The relative performance of the new filtering method over traditional based methods is assessed using standard deviation angle estimation error (STDAE) for a range of simulated environments. The proposed system configuration succeeds in significantly cancelling additional target signals appearing in the look direction beam width even if these targets have the same Doppler frequency
Fractional fourier transform based monopulse radar for combating jamming interference
Monopulse radars are used to track a target that appears in the look direction beam width. The distortion produced when manmade high power interference (jamming). Jamming scenarios are achieved by introducing high power interference to the radar processor through the radar antenna main lobe (main lobe interference) or antenna side lobe (side lobe interference). This leads to errors in the target tracking angles that may cause target mistracking. A new monopulse radar structure is presented in this paper which offers a solution to this problem. This structure is based on the use of optimal Fractional Fourier Transform (FrFT) filtering. The proposed system configurations with the optimum FrFT filters is shown to reduce the simulated interfered signal and improve the signal to noise ratio (SNR) in the processors outputs in both processor using the proposed monopulse structure
- …