Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Rutger L. van Spaendonck

dblp:98/3772 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
0since 2021 · last 2005
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 7 · 3 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Image and video processing · 67% Image and video coding · 33%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Image and video processing › wavelet transform
complex wavelet transform
0.112005
Multidimensional, mapping-based complex wavelet transforms · IEEE Trans. Image Process. 2005
Image and video coding
image compression
0.112005
Multidimensional, mapping-based complex wavelet transforms · IEEE Trans. Image Process. 2005
Image and video processing
wavelet transform
0.112005
Multidimensional, mapping-based complex wavelet transforms · IEEE Trans. Image Process. 2005

Methods — techniques the papers use, named apart from their topics

discrete wavelet transform · 0.1complex double-density DWT · 0.1
YearPublicationVenuePosition
2005 Multidimensional, mapping-based complex wavelet transforms
abstract
Although the discrete wavelet transform (DWT) is a powerful tool for signal and image processing, it has three serious disadvantages: shift sensitivity, poor directionality, and lack of phase information. To overcome these disadvantages, we introduce multidimensional, mapping-based, complex wavelet transforms that consist of a mapping onto a complex function space followed by a DWT of the complex mapping. Unlike other popular transforms that also mitigate DWT shortcomings, the decoupled implementation of our transforms has two important advantages. First, the controllable redundancy of the mapping stage offers a balance between degree of shift sensitivity and transform redundancy. This allows us to create a directional, nonredundant, complex wavelet transform with potential benefits for image coding systems. To the best of our knowledge, no other complex wavelet transform is simultaneously directional and nonredundant. The second advantage of our approach is the flexibility to use any DWT in the transform implementation. As an example, we exploit this flexibility to create the complex double-density DWT: a shift-insensitive, directional, complex wavelet transform with a low redundancy of (3M - 1)/(2M - 1) in M dimensions. No other transform achieves all these properties at a lower redundancy, to the best of our knowledge. By exploiting the advantages of our multidimensional, mapping-based complex wavelet transforms in seismic signal-processing applications, we have demonstrated state-of-the-art results.
Felix C. A. Fernandes, Rutger L. van Spaendonck, C. Sidney Burrus
IEEE Trans. Image Process.2
2003 Orthogonal Hilbert transform filter banks and wavelets
abstract
Complex wavelet transforms offer the opportunity to perform directional and coherent processing based on the local magnitude and phase of signals and images. Although denoising, segmentation, and image enhancement are significantly improved using complex wavelets, the redundancy of most current transforms hinders their application in compression and related problems. In this paper we introduce a new orthonormal complex wavelet transform with no redundancy for both real- and complex-valued signals. The transform's filter bank features a real low pass filter and two complex high pass filters arranged in a critically sampled three-band structure. Placing symmetry and orthogonality constraints on these filters, we find that each high-pass filter can be factored into a real high pass filter followed by an approximate Hilbert transform filter.
Rutger L. van Spaendonck, Thierry Blu, Richard G. Baraniuk, Martin Vetterli
ICASSP (6)1
2003 Complex wavelet transforms with allpass filters
Felix C. A. Fernandes, Ivan W. Selesnick, Rutger L. van Spaendonck, C. Sidney Burrus
Signal Process.3
2002 Shiftable, projection-based complex wavelet transforms
abstract
Shift sensitivity, poor directional selectivity and lack of phase information are three major disadvantages of the discrete wavelet transform, In earlier research, we demonstrated that projection-based complex wavelet transforms have excellent directional selectivity and explicit phase information, In this paper, we discuss the theory of projection-based complex wavelet transforms and we prove that these transforms can have reduced shift sensitivity with low transform redundancy. We also provide experimental results to demonstrate the reduced shift sensitivity of our transforms.
Felix C. A. Fernandes, Rutger L. van Spaendonck, C. Sidney Burrus
ICASSP2
2001 A new directional, low-redundancy, complex-wavelet transform
abstract
Shift variance and poor directional selectivity, two major disadvantages of the discrete wavelet transform, have previously been circumvented either by using highly redundant, non-separable wavelet transforms or by using restrictive designs to obtain a pair of wavelet trees with a transform-domain redundancy of 4.0 in 2D. We demonstrate that excellent shift-invariance properties and directional selectivity may be obtained with a transform-domain redundancy of only 2.67 in 2D. We achieve this by projecting the wavelet coefficients from Selesnick's (Selesnick et al., 2000) almost-shift-invariant, double-density wavelet transform so as to separate approximately the positive and negative frequencies, thereby increasing directionality. Subsequent decimation and a novel inverse projection maintain the low redundancy while ensuring perfect reconstruction. Although our transform generates complex-valued coefficients allowing processing capabilities that are impossible with real-valued coefficients, it may be implemented with a fast algorithm that uses only real arithmetic. To demonstrate the efficacy of our new transform, we show that it achieves state-of-the-art performance in a seismic image-processing application.
Felix C. A. Fernandes, Rutger L. van Spaendonck, C. Sidney Burrus
ICASSP2
2001 A directional, shift insensitive, low-redundancy, wavelet transform
abstract
Shift sensitivity and poor directionality, two major disadvantages of the discrete wavelet transform, have previously been circumvented either by using highly redundant, non-separable wavelet transforms or by using restrictive designs to obtain a pair of wavelet trees with a transform-domain redundancy of 4.0 in 2D. We demonstrate that excellent shift-invariance properties and directional selectivity may be obtained with a transform-domain redundancy of only 2.67 in 2D. We achieve this by projecting the wavelet coefficients from Selesnick's (see Wavelet Applications VII, Proceedings of SPIE, 2000) shift-insensitive, double-density wavelet transform so as to separate approximately the positive and negative frequencies, thereby increasing directionality. Subsequent decimation and a novel inverse projection maintain the low redundancy while ensuring perfect reconstruction. Although our transform generates complex-valued coefficients that provide valuable phase information, it may be implemented with a fast algorithm that uses only real arithmetic. To demonstrate the efficacy of our new transform, we show that it achieves state-of-the-art performance in a seismic image-processing application.
Rutger L. van Spaendonck, Felix C. A. Fernandes, C. Sidney Burrus
ICIP (1)1
2000 Non-Redundant, Directionally Selective, Complex Wavelets
abstract
Poor directional selectivity, a major disadvantage of the 2D separable discrete wavelet transform (DWT), has heretofore been circumvented either by using highly redundant, nonseparable wavelet transforms or by using restrictive designs to obtain a pair of wavelet trees. In this paper, we demonstrate that superior directional selectivity may be obtained with no redundancy in any separable wavelet transform. We achieve this by projecting the wavelet transform coefficients onto the Softy space of signals and decimating before processing. A novel reconstruction step guarantees perfect reconstruction within this critically-sampled framework.
Rutger L. van Spaendonck, Felix C. A. Fernandes, Mark Coates, C. Sidney Burrus
ICIP1