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

Sceuchin Chuah

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

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 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.

Computer graphics and multimedia
1 paper
Image and video coding · 100%

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

TopicWeightPapersLastEvidence papers
Image and video coding › image compression › lossy image compression
near-lossless image compression
0.212013
ℓ2 Optimized Predictive Image Coding With ℓ∞ Bound · IEEE Trans. Image Process. 2013
Image and video coding › predictive coding
predictive image coding
0.212013
ℓ2 Optimized Predictive Image Coding With ℓ∞ Bound · IEEE Trans. Image Process. 2013
Image and video coding
rate-distortion optimization
0.212013
ℓ2 Optimized Predictive Image Coding With ℓ∞ Bound · IEEE Trans. Image Process. 2013

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

ℓ∞ error bound · 0.2l2 optimization · 0.2context-based quantizer · 0.2DPCM prediction · 0.2
YearPublicationVenuePosition
2013 ℓ2 optimized predictive image coding with ℓ∞ bound
abstract
In many scientific, medical and defense applications of image/video compression, an ℓ∞error bound is required. However, pure ℓ∞-optimized image coding, colloquially known as near-lossless image coding, is prone to structured errors such as contours and speckles if the bit rate is not sufficiently high; moreover, previous ℓ∞-based image coding methods suffer from poor rate control. In contrast, the ℓ2error metric aims for average fidelity and hence preserves the subtlety of smooth waveforms better than the ℓ∞error metric and it offers fine granularity in rate control; but pure ℓ2-based image coding methods (e.g., JPEG 2000) cannot bound individual errors as the ℓ∞-based methods can. This paper presents a new compression approach to retain the benefits and circumvent the pitfalls of the two error metrics.
Sceuchin Chuah, Sorina Dumitrescu, Xiaolin Wu 0001
ICASSP1
2013 ℓ2 Optimized Predictive Image Coding With ℓ∞ Bound
abstract
In many scientific, medical, and defense applications of image/video compression, an [Symbol: see text]∞ error bound is required. However, pure[Symbol: see text]∞-optimized image coding, colloquially known as near-lossless image coding, is prone to structured errors such as contours and speckles if the bit rate is not sufficiently high; moreover, most of the previous [Symbol: see text]∞-based image coding methods suffer from poor rate control. In contrast, the [Symbol: see text]2 error metric aims for average fidelity and hence preserves the subtlety of smooth waveforms better than the ∞ error metric and it offers fine granularity in rate control, but pure [Symbol: see text]2-based image coding methods (e.g., JPEG 2000) cannot bound individual errors as the [Symbol: see text]∞-based methods can. This paper presents a new compression approach to retain the benefits and circumvent the pitfalls of the two error metrics. A common approach of near-lossless image coding is to embed into a DPCM prediction loop a uniform scalar quantizer of residual errors. The said uniform scalar quantizer is replaced, in the proposed new approach, by a set of context-based [Symbol: see text]2-optimized quantizers. The optimization criterion is to minimize a weighted sum of the [Symbol: see text]2 distortion and the entropy while maintaining a strict [Symbol: see text]∞ error bound. The resulting method obtains good rate-distortion performance in both [Symbol: see text]2 and [Symbol: see text]∞ metrics and also increases the rate granularity. Compared with JPEG 2000, the new method not only guarantees lower [Symbol: see text]∞ error for all bit rates, but also it achieves higher PSNR for relatively high bit rates.
Sceuchin Chuah, Sorina Dumitrescu, Xiaolin Wu 0001
IEEE Trans. Image Process.1