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

Theodore G. Avgeris

dblp:75/3206 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1980
—ORCID · none

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

Databases, data management, data science and information retrieval · 1 · 1 first-authorTheory 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 · 91% Coding theory · 9%

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

TopicWeightPapersLastEvidence papers
Information theory › signal processing › spectral estimation
maximum entropy method
0.011980
Application of the mutual information principle to spectral density estimation · IEEE Trans. Inf. Theory 1980
Information theory
mutual information analysis
0.011980
Application of the mutual information principle to spectral density estimation · IEEE Trans. Inf. Theory 1980
Information theory › signal processing › spectral estimation
spectral density estimation
0.011980
Application of the mutual information principle to spectral density estimation · IEEE Trans. Inf. Theory 1980
Coding theory › source coding
rate-distortion theory
0.011980
Application of the mutual information principle to spectral density estimation · IEEE Trans. Inf. Theory 1980

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

mutual information principle · 0.0burg's method · 0.0
YearPublicationVenuePosition
1980 Application of the mutual information principle to spectral density estimation
abstract
The power spectrum of a stationary Gaussian random process is estimated when partial knowledge of the autocorrelation function is available {\em a priori}. Particular attention is paid to the case when the {\em a priori} knowledge is not precise, i.e., when there are errors in the measurements, perhaps due to the presence of noise. In the special case when the {\em a priori} knowledge consists ofnpoints of the autocorrelation function, Burg's method of picking the spectrum which maximizes the entropy of the Gaussian process has been recently extended by Newman to account for a weighted average error in the estimates of the correlation function points. A new method is suggested here that uses the mutual information principle (MIP) of Tzannes and Noonan. The firstnpoints of the correlation function (obtained with errors) are used to derive an approximate spectrum by Burg's or any other method. This spectrum, as well as the error constraints involved, is then used to arrive at the underlying spectrum in the framework of the MIP approach.
Theodore G. Avgeris, Eric Lithopoulos, Nicolaos S. Tzannes
IEEE Trans. Inf. Theory1
1978 On reconstituting a process from its quantized form in the presence of noise
Theodore G. Avgeris, Nicolaos S. Tzannes
Inf. Sci.1