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
Demo Data from SIGIR 2026 / reviewers in the wild / expert

Paul P. B. Eggermont

dblp:50/1359 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1999
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 1Theory of computation · 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
Information theory · 100%
Computer graphics and multimedia
1 paper
Image and video processing · 77% Computational photography and imaging · 23%

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

TopicWeightPapersLastEvidence papers
Image and video processing
image reconstruction		 0.011999
Cross Burg entropy maximization and its application to ringing suppression in image reconstruction · IEEE Trans. Image Process. 1999
Information theory › statistical inference › asymptotic theory
asymptotic normality		 0.011999
Best Asymptotic Normality of the Kernel Density Entropy Estimator for Smooth Densities · IEEE Trans. Inf. Theory 1999
Information theory › estimation theory
entropy estimation		 0.011999
Best Asymptotic Normality of the Kernel Density Entropy Estimator for Smooth Densities · IEEE Trans. Inf. Theory 1999
Computational photography and imaging
astronomical imaging		 0.011999
Cross Burg entropy maximization and its application to ringing suppression in image reconstruction · IEEE Trans. Image Process. 1999
Information theory › estimation theory
nonparametric estimation		 0.011999
Best Asymptotic Normality of the Kernel Density Entropy Estimator for Smooth Densities · IEEE Trans. Inf. Theory 1999

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

multiplicative iterative algorithm · 0.0martingale inequality · 0.0kernel density estimation · 0.0jensen's inequality · 0.0convergence proof · 0.0
YearPublicationVenuePosition
1999 Cross Burg entropy maximization and its application to ringing suppression in image reconstruction
abstract
We present a multiplicative algorithm for image reconstruction, together with a partial convergence proof. The iterative scheme aims to maximize cross Burg entropy between modeled and measured data. Its application to infrared astronomical satellite (IRAS) data shows reduced ringing around point sources, compared to the EM (Richardson-Lucy) algorithm.
Paul P. B. Eggermont, Susan Terebey
 IEEE Trans. Image Process.2
1999 Best Asymptotic Normality of the Kernel Density Entropy Estimator for Smooth Densities
abstract
In the random sampling setting we estimate the entropy of a probability density distribution by the entropy of a kernel density estimator using the double exponential kernel. Under mild smoothness and moment conditions we show that the entropy of the kernel density estimator equals a sum of independent and identically distributed (i.i.d.) random variables plus a perturbation which is asymptotically negligible compared to the parametric rate n/sup -1/2/. An essential part in the proof is obtained by exhibiting almost sure bounds for the Kullback-Leibler divergence between the kernel density estimator and its expected value. The basic technical tools are Doob's submartingale inequality and convexity (Jensen's inequality).
Paul P. B. Eggermont, Vincent N. LaRiccia
 IEEE Trans. Inf. Theory1