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

Chien-Wu Tsai

dblp:88/6526 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2004
—ORCID · none

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

Computer networks · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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
2 papers
Coding theory · 100%
Computer graphics and multimedia
1 paper
Image and video coding · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › source coding › variable-length codes
reversible variable-length codes
0.122001
Modified symmetrical reversible variable-length code and its theoretical bounds · IEEE Trans. Inf. Theory 2001
On constructing the Huffman-code-based reversible variable-length codes · IEEE Trans. Commun. 2001
Coding theory › source coding
variable-length codes
0.122001
Modified symmetrical reversible variable-length code and its theoretical bounds · IEEE Trans. Inf. Theory 2001
On constructing the Huffman-code-based reversible variable-length codes · IEEE Trans. Commun. 2001
Coding theory › error-correcting codes › coding bounds
code length bounds
0.012001
Modified symmetrical reversible variable-length code and its theoretical bounds · IEEE Trans. Inf. Theory 2001
Coding theory › source coding › variable-length codes › prefix codes
huffman coding
0.012001
Modified symmetrical reversible variable-length code and its theoretical bounds · IEEE Trans. Inf. Theory 2001
Image and video coding › video coding standards
MPEG-4
0.012001
On constructing the Huffman-code-based reversible variable-length codes · IEEE Trans. Commun. 2001

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

codeword selection mechanisms · 0.1code construction algorithm · 0.0
YearPublicationVenuePosition
2004 An efficient JPEG2000-based human image storage system
abstract
JPEG2000 is the latest image compression standard. One of the most attractive functions which JPEG2000 offers is ROI (region of interest). The ROI region of a human image should usually be on face. In this paper, we present two effective frameworks to convert human images stored in uncompressed format and JPEG2000-compressed format without ROI, respectively, into JPEG2000-compressed format with ROI. Furthermore, a hybrid face localization method is developed, which is well combined with JPEG2000 encoding/decoding procedures. The experimental results show that we can convert the JPEG2000 code stream with partial decode/encode and it has a good face localization performance. The speed of the proposed conversion procedure is faster by two or three times than that of a complete decode/encode conversion procedure
Chien-Wu Tsai, Chih-Yuan Hsu
ICME1
2001 On constructing the Huffman-code-based reversible variable-length codes
abstract
In this letter, we propose a generic and efficient algorithm that can construct both asymmetrical and symmetrical reversible variable-length codes (RVLCs). Starting from a given Huffman code, the construction is based on two developed codeword selection mechanisms, for the symmetrical case and the asymmetrical case, respectively; it is shown that the two mechanisms possess simple features and can generate efficient RVLCs easily. In addition, two new asymmetrical RVLCs are constructed and shown to be very efficient for further reducing the coding overheads in MPEG-4 when operating in the reversible decoding mode.
Chien-Wu Tsai, Ja-Ling Wu
IEEE Trans. Commun.1
2001 Modified symmetrical reversible variable-length code and its theoretical bounds
abstract
Reversible variable length codes (RVLCs) have been adopted in emerging video coding standards-H.263+ and MPEG-4-to enhance their error-resilience capabilities (which are important and essential) in error-prone environments. This study proposes an efficient algorithm to construct a symmetrical RVLC from a given Huffman code. In addition, theoretical bounds on the maximum codeword length for fixed-length Huffman codes, and on the optimal average codeword lengths for sources with exponential distribution are provided.
Chien-Wu Tsai, Ja-Ling Wu
IEEE Trans. Inf. Theory1