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

Kwok-Wai Tam

dblp:23/4216 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1997
—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 · 92% Coding theory · 8%

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

TopicWeightPapersLastEvidence papers
Information theory › statistical inference
information criterion
0.011991
On rates of convergence of general information criteria in signal processing when the noise covariance matrix is arbitrary · IEEE Trans. Inf. Theory 1991
Information theory › statistical inference › model selection
model order selection
0.011991
On rates of convergence of general information criteria in signal processing when the noise covariance matrix is arbitrary · IEEE Trans. Inf. Theory 1991
Information theory › signal processing
statistical signal processing
0.011991
On rates of convergence of general information criteria in signal processing when the noise covariance matrix is arbitrary · IEEE Trans. Inf. Theory 1991
Coding theory › channel coding
error probability bounds
0.011991
On rates of convergence of general information criteria in signal processing when the noise covariance matrix is arbitrary · IEEE Trans. Inf. Theory 1991
Information theory
hypothesis testing
0.011991
On rates of convergence of general information criteria in signal processing when the noise covariance matrix is arbitrary · IEEE Trans. Inf. Theory 1991

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

general information criterion · 0.0exponential bounds · 0.0
YearPublicationVenuePosition
1997 Removal of blocking and ringing artifacts in transform coded images
abstract
Block-based discrete cosine transform (BDCT) image coding techniques are widely used in image and video compression applications such as JPEG and MPEG. At a moderate bit rate, the BDCT is usually a quite satisfactory solution to most of practical coding applications. However, for high compression rates it produces noticeable blocking and ringing artifacts in the decompressed image. We propose a novel post-processing algorithm to remove the blocking and ringing effects at low bit rates. The main steps in this algorithm include block classification, boundary low-pass filtering and mid-point interpolation, edge detection and filtering, and DCT coefficient constraint. The improvement is demonstrated both subjectively and objectively.
Nadir Sinaceur, Fu Li 0004, Kwok-Wai Tam, Zhigang Fan 0001
ICASSP4
1991 On rates of convergence of general information criteria in signal processing when the noise covariance matrix is arbitrary
abstract
The authors give exponential-type bounds on the probabilities of detection error under certain conditions. The bounds tend to zero rapidly as the sample size increases. These procedures are referred to as general information criterion (GIC) procedures since each is consistent and, under certain conditions, the rate of convergence of the estimate of the number of signals to the true value is rapid. The authors give bounds on the probability of wrong detection of the GIC procedure when the noise variance is unknown. Upper bounds on the probabilities of detection error are also obtained.>
Kwok-Wai Tam, Yuehua Wu
IEEE Trans. Inf. Theory1