The use of arithmetic coding for binary image compression achieves a high compression ratio while the running time remains rather slow. A composite modelling method presented in this paper reduces the size of the data to be coded by arithmetic coding. The method is to code the uniform areas with les
β¦ LIBER β¦
Using tchebichef moment for fast and efficient image compression
β Scribed by Hidayah Rahmalan; Nur Azman Abu; Siaw Lang Wong
- Book ID
- 110209708
- Publisher
- SP MAIK Nauka/Interperiodica
- Year
- 2010
- Tongue
- English
- Weight
- 376 KB
- Volume
- 20
- Category
- Article
- ISSN
- 1054-6618
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A fast and efficient compression method
β
Pasi FrΓ€nti
π
Article
π
1994
π
Elsevier Science
π
English
β 815 KB
Fast Computation of Moments on Compresse
β
Kuo-Liang Chung; Wen-Ming Yan; Zhi-Hor Liao
π
Article
π
2002
π
Elsevier Science
π
English
β 184 KB
Fast Computation of Moments on Compressed Grey Images using Block Representation I n image processing, moments are useful tools for analyzing shapes. Suppose that the input grey image with size N Γ N has been compressed into the compressed image using the block representation, where the number of bl
A fast and efficient compressed domain J
β
Zargari, F.; Mosleh, A.; Ghanbari, M.
π
Article
π
2008
π
IEEE
π
English
β 782 KB
Fast Exponentiation Using Data Compressi
β
Yacobi, Yacov
π
Article
π
1998
π
Society for Industrial and Applied Mathematics
π
English
β 213 KB
Transform-Coding Image Compression for I
β
Stephen E. Reichenbach; Zia-Ur Rahman; Ramkumar Narayanswamy
π
Article
π
1993
π
Elsevier Science
π
English
β 697 KB
An Efficient Lossless Compression Scheme
β
Cheng-Chen Lin; Yin-Tsung Hwang
π
Article
π
2010
π
IEEE
π
English
β 387 KB