2003
DOI: 10.1201/9781420035278
|View full text |Cite
|
Sign up to set email alerts
|

Introduction to Information Theory and Data Compression

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0

Year Published

2005
2005
2012
2012

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 76 publications
(16 citation statements)
references
References 0 publications
0
16
0
Order By: Relevance
“…This requirement is known as the admissibility condition. In a more general way, ψ(t) is replaced by (t), allowing a variety of choices, which can enhance certain features for some particular applications (Starck et al, 1998;Stromme, 1999& Hankerson et al, 2005. However, the CWT in the form defined by equation (6) is highly redundant, which makes its direct implementation of minor interest.…”
Section: Continuous Wavelet Transformmentioning
confidence: 99%
See 1 more Smart Citation
“…This requirement is known as the admissibility condition. In a more general way, ψ(t) is replaced by (t), allowing a variety of choices, which can enhance certain features for some particular applications (Starck et al, 1998;Stromme, 1999& Hankerson et al, 2005. However, the CWT in the form defined by equation (6) is highly redundant, which makes its direct implementation of minor interest.…”
Section: Continuous Wavelet Transformmentioning
confidence: 99%
“…However, since equations (28 and 29) compute one output for each two consecutive inputs, a modification needs to be made. The basic operation required here, is derived from the multirate signal processing theory (Fliege, 1994;Hankerson et al, 2005;Cunha et al, 2006;Lu & Do, 2007;Nguyen & Oraintara, 2008& Brislawn, 2010. It simply consists of using a down-sampler or decimator by a factor of two.…”
Section: Filter Banks and Wavelet Implementationsmentioning
confidence: 99%
“…The compression model is presented in Figure 5. The encoding can be by lossless or lossy methods (Hankerson et al, 2005). First, the data in the receiver are the same that in the transmitter; while in the second, a part of the information is lost in the process.…”
Section: Compression Modelmentioning
confidence: 99%
“…The JPEG has four distinct modes of operation [1,2,3,4,5,6]. The Lossy Sequential DCT Based Mode (or Baseline JPEG) is most popular among them since it can achieve highest compression ratio beside preserving maximum possible image quality.…”
Section: Introductionmentioning
confidence: 99%
“…However, Run-length or Arithmetic Coding can also be applied in this stage without compromising the resulting number of bits since all of them are optimal coding [1,7]. As an already optimally compressed bit stream can not further be compressed [6,10], any effort to further compression of a JPEG coded bit stream is meaningless. However, since the Baseline JPEG Default Huffman Coding results different depending on the distribution of the frequency of the input data set, if the data set of an image applied for Huffman Coding is modified, obtaining more optimum result is still possible.…”
Section: Introductionmentioning
confidence: 99%