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

Gilbert G. Walter

dblp:33/3574 · DBLP profile ↗
← Back
6ranked-venue papers
5as first author
0since 2021 · last 2003
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-authorArtificial intelligence and machine learning · 1Databases, 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 · 100%

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

TopicWeightPapersLastEvidence papers
Information theory › signal processing
sampling theory
0.011992
A sampling theorem for wavelet subspaces · IEEE Trans. Inf. Theory 1992
Information theory › signal processing › sampling theory
shannon sampling
0.011992
A sampling theorem for wavelet subspaces · IEEE Trans. Inf. Theory 1992
Information theory › signal processing › time-frequency analysis
wavelet subspaces
0.011992
A sampling theorem for wavelet subspaces · IEEE Trans. Inf. Theory 1992
Information theory › signal processing › time-frequency analysis
multiresolution analysis
0.011992
A sampling theorem for wavelet subspaces · IEEE Trans. Inf. Theory 1992

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

reproducing kernels · 0.0
YearPublicationVenuePosition
2003 Recovery of digitized signals using Slepian functions
abstract
The continuous prolate spheroidal wave functions (Slepian functions) were found to be useful for analog signal processing several decades ago. But the digital revolution left them in the dust since they did not seem naturally adapted to discrete analysis. Yet they have many desirable, even unique, properties that originally made them fascinating and could lead to some applications in digital and analog-digital signal processing practice. The simplest such applications involve the conversion of a digital signal to an analog signal and recovery of a bandlimited signal from their values at countable many distinct points on the real line. The Shannon sampling theorem, which is based on the sinc expansions, plays the most important theoretical foundation in such approaches. In this work, by using the natural connection between the Slepian functions and sinc function, several new formulae based on integer values of Slepian functions are developed. These formulae are then used to replace the sinc function in sampling theorems for digitizing bandlimited signals. Finally, they are used to construct analysis and synthesis filter banks for sampled values of a bandlimited signal.
Gilbert G. Walter, Xiaoping Shen
ICASSP (6)1
2003 Object representation and recognition in shape spaces
Jun Zhang 0006, Hamid Krim, Gilbert G. Walter
Pattern Recognit.4
2000 Positive hybrid sampling in wavelet subspaces
abstract
It is well known that the Shannon sampling theorem can be put into a wavelet context. But it has also been shown that for most wavelets, a non-negative summability function for the associated subspaces exists. Translation of these are used in a series with sampling coefficients to get a "hybrid" series each of whose terms is non-negative. Such series converge, avoid integration, and eliminate the Gibbs phenomenon.
Gilbert G. Walter
ICASSP1
1999 Non-uniform sampling in wavelet subspaces
abstract
It is well known that the Shannon (1949) sampling theorem can be put into a wavelet context. But it has also been shown that for most wavelets, a sampling theorem for the associated subspaces exists. There is even a non-uniform sampling theorem as in the Shannon case. In general the bounds on the deviations from uniform are not as easy to specify in this case. No simple Kadec 1/4 theorem holds except in special cases (such as the Franklin case where the bound is 1/2). For a particular class, the Meyer (1990) wavelets, which are bandlimited but with a smooth spectrum, a similar bound is sometimes obtainable. Unfortunately, it is much smaller that 1/4.
Gilbert G. Walter
ICASSP1
1992 A sampling theorem for wavelet subspaces
abstract
The classical Shannon sampling theorem is extended to the subspaces used in the multiresolution analysis in wavelet theory. Under weak hypotheses, these subspaces are first shown to have a Riesz basis formed from the reproducing kernels. These in turn are used to construct the sampling sequences. Examples are given.>
Gilbert G. Walter
IEEE Trans. Inf. Theory1
1983 A general approach to classification problems
Gilbert G. Walter
Inf. Sci.1