Data Compression Conference, 2004. Proceedings. DCC 2004 2004
DOI: 10.1109/dcc.2004.1281540
|View full text |Cite
|
Sign up to set email alerts
|

Reversible n-bit to n-bit integer Haar-like transforms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
10
0

Year Published

2007
2007
2009
2009

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 7 publications
(10 citation statements)
references
References 3 publications
0
10
0
Order By: Relevance
“…Points in the domain that are equidistant from the origin lie on a circle [3]. Given input values A and B , the high-pass value H and low-pass value L can be computed by equations 1 and 2.…”
Section: Underflow And/or Overflowmentioning
confidence: 99%
See 1 more Smart Citation
“…Points in the domain that are equidistant from the origin lie on a circle [3]. Given input values A and B , the high-pass value H and low-pass value L can be computed by equations 1 and 2.…”
Section: Underflow And/or Overflowmentioning
confidence: 99%
“…We use PLHaar [3] Transform to decompose the original cover audio to obtain the coefficients for coarse signal and detail signal. LSB method is applied to embed the secret information into the transform coefficients.…”
Section: Introductionmentioning
confidence: 99%
“…For general mathematical representation, for vector , if , the infinity-norm rotation transform can be formulated as a piecewise linear transform (13) where is absolute operator, gives the runlength, and is the transformed vector. When the vector is sheared out of the dynamic range after moving a distance , i.e., when and , the vector should turn to shear along the adjacent vertical plane with the remaining If or , the similar formula can be derived.…”
Section: Implementation and Examplesmentioning
confidence: 99%
“…Thus, the recovered images suffer severe blocking artifacts and salt-and-pepper noise when transform coefficients are lossily compressed. The other two approaches to avoid the dynamic range expansion is Table-Lookup Haar-like transform (TLHaar) and Piecewise Linear Haar-like transform (PLHaar) proposed by Senecal et al [13], [14]. TLHaar and PLHaar are two-point transforms, both evolving from the S Transform, the integer realization of Haar wavelet transform.…”
mentioning
confidence: 99%
“…Besides, linearity or piecewise linearity of a transform is also desirable to guarantee that little change of coefficients results in little degradation of image quality after reconstruction. Piecewise Linear Haar-like transform (PLHaar) is such a transform, proposed by Senecal [7] for lossless and lossy coding, which is a special case of our proposed infinity-norm rotation.…”
Section: Introductionmentioning
confidence: 99%