Patrick Vandewalle

Prof. Patrick Vandewalle

KU Leuven - Department of Electrical Engineering (ESAT)
orcid

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

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

Representative Publications

View All Publications
21 February 2006 in EURASIP Journal on Advances in Signal Processing
Verified
Journal Article
Open access
PDF file
Patrick VandewallePatrick Vandewalle
Patrick Vandewalle
SSSabine Süsstrunk
Sabine Süsstrunk
MVMartin Vetterli
Martin Vetterli
Super-resolution algorithms reconstruct a high-resolution image from a set of low-resolution images of a scene. Precise alignment of the input images is an essential part of such algorithms. If the low-resolution images are undersampled and have aliasing artifacts, the performance of standard registration algorithms decreases. We propose a frequency domain technique to precisely register a set of aliased images, based on their low-frequency, aliasing-free part. A high-resolution image is then reconstructed using cubic interpolation. Our algorithm is compared to other algorithms in simulations and practical experiments using real aliased images. Both show very good visual results and prove the attractivity of our approach in the case of aliased input images. A possible application is to digital cameras where a set of rapidly acquired images can be used to recover a higher-resolution final image.

17 April 2009 in IEEE Signal Processing Magazine
Verified
Journal Article
Open access
Patrick VandewallePatrick Vandewalle
Patrick Vandewalle
JKJelena Kovacevic
Jelena Kovacevic
MVMartin Vetterli
Martin Vetterli
What should we do to raise the quality of signal processing publications to an even higher level? We believe it to be crucial to maintain the precision in describing our work in publications, ensured through a high-quality reviewing process. We also believe that if the experiments are performed on a large data set, the algorithm is compared to the state-of-the-art methods, the code and/or data are well documented and available online, we will all benefit and make it easier to build upon each other's work. It is a clear win-win situation for our community: we will have access to more and more algorithms and can spend time inventing new things rather than recreating existing ones.

15 May 2012 in Computing in Science & Engineering
Verified
Journal Article
Closed access
Patrick VandewallePatrick Vandewalle
Patrick Vandewalle
In computational sciences such as image processing, publishing usually isn't enough to allow other researchers to verify results. Often, supplementary materials such as source code and measurement data are required. Yet most researchers choose not to make their code available because of the extra time required to prepare it. Are such efforts actually worthwhile, though?

18 June 2007 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
Patrick VandewallePatrick Vandewalle
Patrick Vandewalle
LSLuciano Sbaiz
Luciano Sbaiz
JVJoos Vandewalle
Joos Vandewalle
MVMartin Vetterli
Martin Vetterli
In many applications, the sampling frequency is limited by the physical characteristics of the components: the pixel pitch, the rate of the analog-to-digital (AID) converter, etc. A low- pass filter is usually applied before the sampling operation to avoid aliasing. However, when multiple copies are available, it is possible to use the information that is inherently present in the aliasing to reconstruct a higher resolution signal. If the different copies have unknown relative offsets, this is a nonlinear problem in the offsets and the signal coefficients. They are not easily separable in the set of equations describing the super-resolution problem. Thus, we perform joint registration and reconstruction from multiple unregistered sets of samples. We give a mathematical formulation for the problem when there are M sets of N samples of a signal that is described by L expansion coefficients. We prove that the solution of the registration and reconstruction problem is generically unique if MN ges L + M - 1. We describe two subspace-based methods to compute this solution. Their complexity is analyzed, and some heuristic methods are proposed. Finally, some numerical simulation results on one- and two-dimensional signals are given to show the performance of these methods.

25 May 2024 in CIRP Journal of Manufacturing Science and Technology
Verified
Journal Article
Closed access
SBSimon Bellens
Simon Bellens
PGPatricio Guerrero
Patricio Guerrero
Patrick VandewallePatrick Vandewalle
Patrick Vandewalle
WDWim Dewulf
Wim Dewulf

23 March 2022 in Polymer Testing
Verified
Journal Article
Open access
SBSimon Bellens
Simon Bellens
GPGabriel M. Probst
Gabriel M. Probst
MJMichel Janssens
Michel Janssens
Patrick VandewallePatrick Vandewalle
Patrick Vandewalle
WDWim Dewulf
Wim Dewulf