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

Tuyet-Trang Lam

dblp:l/TTLam · DBLP profile ↗
← Back
9ranked-venue papers
7as first author
0since 2021 · last 2007
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 7 · 6 first-authorComputer networks · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1

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
2 papers
Image and video coding · 100%
Computer networks
2 papers
Transport protocols and congestion control · 57% Physical-layer communications · 22% Content delivery and video streaming · 22%

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

TopicWeightPapersLastEvidence papers
Image and video coding › error resilience
error-resilient image coding
0.112007
Selective Error Detection for Error-Resilient Wavelet-Based Image Coding · IEEE Trans. Image Process. 2007
Image and video coding › quantization
channel-optimized quantization
0.012000
Image coding with robust channel-optimized trellis-coded quantization · IEEE J. Sel. Areas Commun. 2000
Image and video coding
image compression
0.012000
Image coding with robust channel-optimized trellis-coded quantization · IEEE J. Sel. Areas Commun. 2000
Image and video coding
quantization
0.012000
Image coding with robust channel-optimized trellis-coded quantization · IEEE J. Sel. Areas Commun. 2000
Image and video coding › quantization
trellis coded quantization
0.012000
Image coding with robust channel-optimized trellis-coded quantization · IEEE J. Sel. Areas Commun. 2000
Image and video coding › image compression
wavelet-based image coding
0.012000
Image coding with robust channel-optimized trellis-coded quantization · IEEE J. Sel. Areas Commun. 2000
Transport protocols and congestion control › error control
automatic repeat request
0.012007
Selective Error Detection for Error-Resilient Wavelet-Based Image Coding · IEEE Trans. Image Process. 2007
Physical-layer communications
channel coding
0.012000
Image coding with robust channel-optimized trellis-coded quantization · IEEE J. Sel. Areas Commun. 2000
Content delivery and video streaming
error resilience
0.012000
Image coding with robust channel-optimized trellis-coded quantization · IEEE J. Sel. Areas Commun. 2000

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

wavelet-based coding · 0.1similarity check function · 0.1transition probability analysis · 0.1phase scrambling · 0.1
YearPublicationVenuePosition
2007 Selective Error Detection for Error-Resilient Wavelet-Based Image Coding
abstract
This paper introduces the concept of a similarity check function for error-resilient multimedia data transmission. The proposed similarity check function provides information about the effects of corrupted data on the quality of the reconstructed image. The degree of data corruption is measured by the similarity check function at the receiver, without explicit knowledge of the original source data. The design of a perceptual similarity check function is presented for wavelet-based coders such as the JPEG2000 standard, and used with a proposed "progressive similarity-based ARQ" (ProS-ARQ) scheme to significantly decrease the retransmission rate of corrupted data while maintaining very good visual quality of images transmitted over noisy channels. Simulation results with JPEG2000-coded images transmitted over the Binary Symmetric Channel, show that the proposed ProS-ARQ scheme significantly reduces the number of retransmissions as compared to conventional ARQ-based schemes. The presented results also show that, for the same number of retransmitted data packets, the proposed ProS-ARQ scheme can achieve significantly higher PSNR and better visual quality as compared to the selective-repeat ARQ scheme.
Lina J. Karam, Tuyet-Trang Lam
IEEE Trans. Image Process.2
2006 Selective Error Detection for Error-Resilient JPEG2000 Coding
abstract
This paper presents a selective error detection (SED) scheme that is based on a similarity check function designed for the JPEG2000 compression algorithm. The presented scheme takes advantage of the error-resilience properties of JPEG-2000 to significantly reduce the number of corrupted data packets that need to be retransmitted in a typical ARQ scheme. The degree of corruption induced by a particular codeblock is measured by a similarity check function at the receiver, without using any explicit knowledge regarding the original source data. Accordingly, if the data is found to be badly corrupted based on a specified similarity criteria, it is considered unusable and retransmitted. On the other hand, if the corrupted data does not significantly affect the quality of the decoded image, it is simply processed by the decoder without retransmission. Simulation results comparing the proposed selective retransmission scheme to full retransmission of corrupted packets are provided to illustrate the performance of the proposed method.
Tuyet-Trang Lam, Lina J. Karam, Glen P. Abousleman
ICASSP (2)1
2005 Reduced-Delay Selective ARQ for Low Bit-Rate Image and Multimedia Data Transmission
abstract
The paper presents a reduced-delay selective-ARQ scheme based on a similarity check function that measures the degree of corruption in transmitted multimedia data packets. Accordingly, if the packet is found to be badly corrupted based on a specified similarity criterion, it can be considered as a lost packet and retransmitted. The degree of corruption contributed by a particular packet is measured by the proposed similarity check function at the receiver without explicit knowledge of the original source data. Simulation results and comparisons with a conventional ARQ scheme are provided to illustrate the performance of the proposed method.
Tuyet-Trang Lam, Lina J. Karam, Rida A. Bazzi, Glen P. Abousleman
ICASSP (2)1
2004 Selective fec for error-resilient image coding and transmission using similarity check functions
abstract
This paper introduces the concept of similarity check functions that measure the degree of corruption in transmitted multimedia data packets. Rather than directly discarding or directly retransmitting erroneous packets, the degree of corruption contributed by a particular packet is measured by a similarity check function at the receiver, which does not require explicit knowledge of the source data. Accordingly, if the packet is found to be badly corrupted based on a specified similarity criteria, it can be considered as a lost packet and recovered using forward error correcting codes or retransmission. An example of a similarity check function design and a selective forward error correction (S-FEC) scheme that allocates channel protection bits only to those packets that are in most need of correction, is presented to illustrate the proposed concept.
Tuyet-Trang Lam, Lina J. Karam, Rida A. Bazzi, Glen P. Abousleman
ICIP1
2002 Robust hyperspectral image coding with channel-optimized trellis-coded quantization
abstract
This paper presents a wavelet-based hyperspectral image coder that is optimized for transmission over the binary symmetric channel (BSC). The proposed coder uses a robust channel-optimized trellis-coded quantization (COTCQ) stage that is designed to optimize the image coding based on the channel characteristics. This optimization is performed only at the level of the source encoder and does not include any channel coding for error protection. The robust nature of the coder increases the security level of the encoded bit stream, and provides a much higher quality decoded image. In the absence of channel noise, the proposed coder is shown to achieve a compression ratio greater than 70:1, with an average peak SNR of the coded hyperspectral sequence exceeding 40 dB. Additionally, the coder is shown to exhibit graceful degradation with increasing channel errors.
Glen P. Abousleman, Tuyet-Trang Lam, Lina J. Karam
IEEE Trans. Geosci. Remote. Sens.2
2000 Multiple description channel-optimized trellis-coded quantization
abstract
This paper presents the design of multiple description trellis-coded quantizers that are optimized for transmitting data over multiple noisy channels. A multiple description channel-optimized trellis-coded quantization (MDCOTCQ) scheme is developed whereby all trellis-coded quantizers (side and central) are designed to operate over the binary symmetric channel with a given bit error rate (BER). Using the tensor product of trellises, an expression of the multi-channel transition probability matrix is derived. This formulation enables the construction of multiple description channel-optimized trellis-coded quantizers for arbitrary bit rates and arbitrary channel bit error rates. The proposed MDCOTCQ system enables the transmission of compressed data over noisy diversity or packet-based communication systems, and enables outstanding robustness to channel or packet loss. Examples are presented to illustrate the performance of the proposed MDCOTCQ-based source coder.
Tuyet-Trang Lam, Glen P. Abousleman, Lina J. Karam
ICASSP1
2000 Image coding with robust channel-optimized trellis-coded quantization
abstract
This paper presents a wavelet-based image coder that is optimized for transmission over the binary symmetric channel (BSC). The proposed coder uses a robust channel-optimized trellis-coded quantization (COTCQ) stage that is designed to optimize the image coding based on the channel characteristics. A phase scrambling stage is also used to further increase the coding performance and robustness to nonstationary signals and channels. The resilience to channel errors is obtained by optimizing the coder performance only at the level of the source encoder with no explicit channel coding for error protection. For the considered TCQ trellis structure, a general expression is derived for the transition probability matrix. In terms of the TCQ encoding rat and the channel bit error rate, and is used to design the COTCQ stage of the image coder. The robust nature of the coder also increases the security level of the encoded bit stream and provides a much more visually pleasing rendition of the decoded image. Examples are presented to illustrate the performance of the proposed robust image coder.
Tuyet-Trang Lam, Glen P. Abousleman, Lina J. Karam
IEEE J. Sel. Areas Commun.1
1999 Wavelet-based image coder with channel-optimized trellis-coded quantization
abstract
This paper presents a wavelet-based image coder optimized for transmission over binary symmetric channels (BSC). The proposed coder uses a channel-optimized trellis-coded quantization (COTCQ) stage that is designed to optimize the image coding based on the channel characteristics. This optimization is performed only at the level of the source encoder, and does not include any channel coding for error protection. Consequently, the proposed channel-optimized image coder is especially suitable for wireless transmission due to its reduced complexity. Furthermore, the improvement over TCQ-based image coders is significant. Examples are presented to illustrate the performance of the proposed COTCQ-based image coder.
Tuyet-Trang Lam, Glen P. Abousleman, Lina J. Karam
ICASSP1
1999 A Perceptually Tuned Image Coder with Channel-Optimized Trellis-Coded Quantization
abstract
A system is presented for the compression of digital imagery over binary symmetric channels (BSC). The objective is to minimize the perceived distortion for a desired target bit rate. The proposed system utilizes wavelet decomposition, channel-optimized trellis-coded quantization (COTCQ), and a perceptually-tuned rate allocation scheme to control the quantization. Because of the inherent noise-robust properties of the COTCQ stage, no channel coding is employed. Additionally, the COTCQ design does not utilize entropy coding. Consequently, the proposed image coder is especially suitable for wireless transmission due to its reduced complexity and robustness to channel errors. Examples are presented to illustrate the performance of the proposed image coding system.
Tuyet-Trang Lam, Glen P. Abousleman, Lina J. Karam
ICIP (1)1