2007
DOI: 10.2481/dsj.6.19
|View full text |Cite
|
Sign up to set email alerts
|

Burrows-Wheeler based JPEG

Abstract: Recently, the use of the Burrows-Wheeler

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
14
0

Year Published

2011
2011
2017
2017

Publication Types

Select...
5
4
1

Relationship

5
5

Authors

Journals

citations
Cited by 28 publications
(14 citation statements)
references
References 13 publications
0
14
0
Order By: Relevance
“…When we insert more bits, the chance to have a non-zero value will grow. In addition, small numbers are handled more efficiently by the compression method implemented in JPEG [21]. Usually, when there is a non-zero value in a latter coefficient, a long sequence of zeros will be before this coefficient.…”
Section: Steganography System Using Jpegmentioning
confidence: 99%
“…When we insert more bits, the chance to have a non-zero value will grow. In addition, small numbers are handled more efficiently by the compression method implemented in JPEG [21]. Usually, when there is a non-zero value in a latter coefficient, a long sequence of zeros will be before this coefficient.…”
Section: Steganography System Using Jpegmentioning
confidence: 99%
“…Yair [6] has proposed a paper on Burrows Wheeler based JPEG compression. In that paper he suggested a replacement of traditional Hoffman coding by Burrows wheeler compression.…”
Section: Burrows-wheeler Transform Based Jpegmentioning
confidence: 99%
“…In order to reduce this execution time, usually the data is split into blocks, at some loss in compression efficiency, because shorter data is less effectively compressed. This paper uses the SGI version of the Burrows-Wheeler Transform (Wiseman, 2007a).…”
Section: The Burrows-wheeler Transformationmentioning
confidence: 99%