Patrick Wambacq

Patrick Wambacq

Auto-generated profile, based on publicly available information

Patrick Wambacq

ESAT, KU Leuven, Belgium

Research Focus & Metrics

Academic Career Length

45Years (1982-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 1994 in Remote Sensing Reviews
Verified
Journal Article
Closed access
JLJ. S. Lee
J. S. Lee
LJL. Jurkevich
L. Jurkevich
PDP. Dewaele
P. Dewaele
PWP. Wambacq
P. Wambacq
AOA. Oosterlinck
A. Oosterlinck
Speckle, appearing in synthetic aperture radar (SAR) images as granular noise, is due to the interference of waves reflected from many elementary scatterers. Speckle in SAR images complicates the image interpretation problem by reducing the effectiveness of image segmentation and classification. To alleviate deleterious effects of speckle, various ways have been devised to suppress it. This paper surveys several better‐known speckle filtering algorithms. The concept of each filtering algorithm and the interrelationship between algorithms are discussed in detail. A set of performance criteria is established and comparisons are made for the effectiveness of these filters in speckle reduction and edge, line, and point target contrast preservation using a simulated SAR image as well as airborne and spaceborne SAR images. In addition, computational efficiency and implementation complexity are compared. This critical evaluation of speckle suppression filters is mostly new and is presented as a survey paper for the first time. It is believed that the information provided is sufficient for an intelligent selection of speckle filters for various applications.

23 April 2007 in IEEE Transactions on Audio, Speech, and Language Processing
Verified
Journal Article
Closed access
MWMathias De Wachter
Mathias De Wachter
MMMike Matton
Mike Matton
KDKris Demuynck
Kris Demuynck
PWPatrick Wambacq
Patrick Wambacq
RCRonald Cools
Ronald Cools
DCDirk Van Compernolle
Dirk Van Compernolle
Despite their known weaknesses, hidden Markov models (HMMs) have been the dominant technique for acoustic modeling in speech recognition for over two decades. Still, the advances in the HMM framework have not solved its key problems: it discards information about time dependencies and is prone to overgeneralization. In this paper, we attempt to overcome these problems by relying on straightforward template matching. The basis for the recognizer is the well-known DTW algorithm. However, classical DTW continuous speech recognition results in an explosion of the search space. The traditional top-down search is therefore complemented with a data-driven selection of candidates for DTW alignment. We also extend the DTW framework with a flexible subword unit mechanism and a class sensitive distance measure-two components suggested by state-of-the-art HMM systems. The added flexibility of the unit selection in the template-based framework leads to new approaches to speaker and environment adaptation. The template matching system reaches a performance somewhat worse than the best published HMM results for the Resource Management benchmark, but thanks to complementarity of errors between the HMM and DTW systems, the combination of both leads to a decrease in word error rate with 17% compared to the HMM results

13 September 2006 in EURASIP Journal on Advances in Signal Processing
Verified
Journal Article
Open access
PDF file
KHKris Hermus
Kris Hermus
PWPatrick Wambacq
Patrick Wambacq
HHHugo Van hamme
Hugo Van hamme
The objective of this paper is threefold: (1) to provide an extensive review of signal subspace speech enhancement, (2) to derive an upper bound for the performance of these techniques, and (3) to present a comprehensive study of the potential of subspace filtering to increase the robustness of automatic speech recognisers against stationary additive noise distortions. Subspace filtering methods are based on the orthogonal decomposition of the noisy speech observation space into a signal subspace and a noise subspace. This decomposition is possible under the assumption of a low-rank model for speech, and on the availability of an estimate of the noise correlation matrix. We present an extensive overview of the available estimators, and derive a theoretical estimator to experimentally assess an upper bound to the performance that can be achieved by any subspace-based method. Automatic speech recognition experiments with noisy data demonstrate that subspace-based speech enhancement can significantly increase the robustness of these systems in additive coloured noise environments. Optimal performance is obtained only if no explicit rank reduction of the noisy Hankel matrix is performed. Although this strategy might increase the level of the residual noise, it reduces the risk of removing essential signal information for the recogniser's back end. Finally, it is also shown that subspace filtering compares favourably to the well-known spectral subtraction technique.

1 December 1991 in Computers and Electronics in Agriculture
Verified
Journal Article
Closed access
ESE. Van der Stuyft
E. Van der Stuyft
CSC.P. Schofield
C.P. Schofield
JRJ.M. Randall
J.M. Randall
PWP. Wambacq
P. Wambacq
VGV. Goedseels
V. Goedseels

1 January 2005 in Signal Processing
Verified
Journal Article
Closed access
KHKris Hermus
Kris Hermus
WVWerner Verhelst
Werner Verhelst
PLPhilippe Lemmerling
Philippe Lemmerling
PWPatrick Wambacq
Patrick Wambacq
SHSabine Van Huffel
Sabine Van Huffel

1 November 2006 in Speech Communication
Verified
Journal Article
Closed access
VSVeronique Stouten
Veronique Stouten
HHHugo Van hamme
Hugo Van hamme
PWPatrick Wambacq
Patrick Wambacq