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

Ming H. Chan

dblp:27/5796 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 1995
—ORCID · none

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

Computer networks · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2

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.

Computer networks
2 papers
Wireless networking · 33% Network performance modeling · 33% Internet architecture and protocols · 33%
Computer graphics and multimedia
2 papers
Image and video coding · 87% Multimedia systems and quality of experience · 13%

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

TopicWeightPapersLastEvidence papers
Image and video coding › predictive coding
differential pulse code modulation
0.011995
The performance of DPCM operating on lossy channels with memory · IEEE Trans. Commun. 1995
Image and video coding
predictive coding
0.011995
The performance of DPCM operating on lossy channels with memory · IEEE Trans. Commun. 1995
Wireless networking › unreliable channel
lossy link
0.011995
The performance of DPCM operating on lossy channels with memory · IEEE Trans. Commun. 1995
Internet architecture and protocols › packet scheduling
prioritized multiplexing
0.011995
Prioritized statistical multiplexing of PCM sources · IEEE/ACM Trans. Netw. 1995
Network performance modeling
statistical multiplexing
0.011995
Prioritized statistical multiplexing of PCM sources · IEEE/ACM Trans. Netw. 1995

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

statistical multiplexing models · 0.0signal-to-reconstruction-noise analysis · 0.0queueing analysis · 0.0markov chain modeling · 0.0
YearPublicationVenuePosition
1995 The performance of DPCM operating on lossy channels with memory
abstract
We study the performance of DPCM operating over lossy channels in cell-based networks such as ATM, when statistical multiplexing is used. Since the loss of data is mainly due to traffic congestion, and the minimum unit of loss is a cell which may contain multiple DPCM codewords, the loss process can be highly correlated. The contribution of this work comes in two parts. We first give a formulation which relates the performance of DPCM, in terms of signal-to-reconstruction-noise ratio, to the channel loss conditions. In particular we take into account any correlation that exists in the loss process. We then study in detail mechanisms which give rise to such correlation. Using simple source and multiplexing models, formulae are given which characterise the loss process as a result of statistical multiplexing. As a direct result of this treatment, we know that the maximum achievable performance of DPCM with reoptimised predictors further deteriorates when the loss process is correlated.>
Ming H. Chan
IEEE Trans. Commun.1
1995 Prioritized statistical multiplexing of PCM sources
abstract
Using simple multiplexer models, the performances of two prioritization mechanisms for the transmission of PCM coded signals modeled as exponential on/off sources are investigated and compared with nonprioritized transmission using statistical multiplexing and peak allocation. In both mechanisms the source traffic is partitioned into a low-priority stream and a high-priority stream. In the first approach independent channels of different quality of service are used to transport the two-priority streams. In the second approach a single channel is used in conjunction with a selective packet discarding procedure which attempts to restrict loss to the low-priority traffic. For a given source partitioning, new formulae are given to describe the average loss ratio for the low- and high-priority traffic. The effect of loss on quality for PCM coded signal is quantified by a new formula which relates signal-to-reconstruction-noise ratio to low- and high-priority-loss. The results of the investigation show that both methods of prioritized transmission can provide significant improvements in overall service quality when the channel utilization is high.>
Ming H. Chan, John Princen
IEEE/ACM Trans. Netw.1
1994 Frequency scalable video coding using the MDCT
abstract
Efficient video coding incorporating motion compensation and overlapped transforms requires different coding architectures and methods of motion estimation to those used in traditional DCT block based coding schemes. In this paper a transform domain motion estimation procedure is proposed for the MDCT. This method of motion estimation, while performed in the spatial domain, is equivalent to minimising the sum square error of transform coefficients. The application of the MDCT to frequency scalable video coding is investigated. A performance advantage is achieved over an equivalent DCT based coder for both the reconstructed low resolution and high resolution sequences of an open loop frequency scalable video coder.>
Andrew W. Johnson, John Princen, Ming H. Chan
ICASSP (5)3
1994 Minimum generalised quadratic error quantisation for image and video coding
abstract
We propose a method of quantisation which explicitly minimises a generalised quadratic error measure. The method is applied to block based image and video coding schemes, and is shown to be useful in reducing block artefacts. Since no alteration to the decoding process is required, the method can be used in standards based coding in a fully compatible fashion.>
John Princen, Ming H. Chan
ICASSP (5)2