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

Hendrik Theunis

dblp:25/187 · also Rik Theunis · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2000
0009-0009-5350-6105ORCID · reported

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

Systems, architecture and hardware · 1Graphics, computer vision, multimedia, augmented reality and games · 1

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 coding · 100%

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

TopicWeightPapersLastEvidence papers
Image and video coding › transform coding
lapped transform
0.012000
Design of orthogonal and biorthogonal lapped transforms satisfying perception related constraints · IEEE Trans. Image Process. 2000
Image and video coding
transform coding
0.012000
Design of orthogonal and biorthogonal lapped transforms satisfying perception related constraints · IEEE Trans. Image Process. 2000
Image and video coding
transform design
0.012000
Design of orthogonal and biorthogonal lapped transforms satisfying perception related constraints · IEEE Trans. Image Process. 2000

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

recursive optimization · 0.0filter decomposition · 0.0
YearPublicationVenuePosition
2000 Design of orthogonal and biorthogonal lapped transforms satisfying perception related constraints
abstract
We propose a new efficient method for the design of orthogonal and biorthogonal lapped transforms for image coding applications. It is shown how perception related constraints such as decay and smoothness of the filters' impulse responses can be incorporated in the optimization procedure. A decomposition of lapped transforms (orthogonal and biorthogonal) with 50% overlap leads to an efficient recursive optimization procedure, which is robust with respect to initial solutions. The importance of this decomposition lies in the fact that it allows to decouple the design of the even-symmetric and the odd-symmetric filters and hence drastically reduces the number of variables to be optimized. It furthermore reveals all the variables predetermined by perception related and coding-efficiency related constraints imposed on the filters. We present design and coding examples demonstrating the perceptual performance and the rate distortion performance of the resulting transforms.
Helmut Bölcskei, Richard Heusdens, Hendrik Theunis, Augustus J. E. M. Janssen
IEEE Trans. Image Process.3
1993 Subband filtering: Cordic modulation and systolic quadrature mirror filter tree
abstract
The decomposition (analysis) of a finite-energy signal into a relatively small number of mutually independent signals which allows reconstruction (synthesis) of the original signal is called subband filtering. Subbands can be processed in parallel or recursively. In the latter case, one obtains a so-called quadrature mirror filter tree. The former case leads to cosine-modulated filter banks. The authors present a Cordic based cosine-modulated bank and a systolic algorithm for quadrature mirror tree filtering.>
Ed F. Deprettere, Richard Heusdens, Hendrik Theunis
ASAP3