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.

Fons A. M. L. Bruekers

dblp:68/3962 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1992
—ORCID · none

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

Computer networks · 1 · 1 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.

Theoretical computer science
1 paper
Coding theory · 100%
Computer graphics and multimedia
1 paper
Image and video coding · 50% Image and video processing · 50%

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

TopicWeightPapersLastEvidence papers
Coding theory
perfect reconstruction
0.011992
New Networks for Perfect Inversion and Perfect Reconstruction · IEEE J. Sel. Areas Commun. 1992
Image and video processing
filter bank
0.011992
New Networks for Perfect Inversion and Perfect Reconstruction · IEEE J. Sel. Areas Commun. 1992
Image and video coding › transform coding
subband coding
0.011992
New Networks for Perfect Inversion and Perfect Reconstruction · IEEE J. Sel. Areas Commun. 1992

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

symmetry design · 0.0ladder network structure · 0.0
YearPublicationVenuePosition
1992 New Networks for Perfect Inversion and Perfect Reconstruction
abstract
The authors present a new network structure that realizes perfect inversion networks (PINs) and perfect reconstruction networks (PRNs). In some applications, such as transform source coders, it is important that the cascade of the forward and the inverse transform give the identity exactly (perfect inversion), although the coefficients and the intermediate results are quantized. In subband coders, for example, the split and merge filter banks should preferably have perfect reconstruction. It is advantageous if perfect reconstruction can be accomplished even when the coefficients and the intermediate results are quantized. The proposed network has a ladderlike shape and a predescribed symmetry between the forward and inverse network or between the split and merge bank. In some parts of this ladder network almost any function is allowed. Due to the prescribed symmetry, the property of perfect inversion or perfect reconstruction is structurally assured.>
Fons A. M. L. Bruekers, Ad W. M. van den Enden
IEEE J. Sel. Areas Commun.1