Fast 4x4 Tchebichef Moment Image Compression

This paper proposes a new approach based on 4×4 discrete orthogonal Tchebichef moment for fast and efficient image compression. The method incorporates a simplified mathematical framework technique using matrices, as well as a block-wise reconstruction technique to eliminate possible occurrences of...

Full description

Saved in:
Bibliographic Details
Published in2009 International Conference of Soft Computing and Pattern Recognition pp. 295 - 300
Main Authors Lang, W.S., Abu, N.A., Rahmalan, H.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2009
Subjects
Computer applications
Constraint optimization
Containers
Design optimization
Image coding
Image Compression
Integer linear programming
Laboratories
Pattern recognition
Printing
Tchebichef Moment Transform
Testing
Online AccessGet full text
ISBN1424453305
9781424453306
DOI10.1109/SoCPaR.2009.66

Cover

More Information
Summary:This paper proposes a new approach based on 4×4 discrete orthogonal Tchebichef moment for fast and efficient image compression. The method incorporates a simplified mathematical framework technique using matrices, as well as a block-wise reconstruction technique to eliminate possible occurrences of numerical instabilities at higher moment orders. The comparison between 4×4 Tchebichef moment transform and discrete cosine transform has been done. The results show significant advantages for 4×4 Tchebichef moment in terms of its error reconstruction and average bit-length of Huffman codes.
ISBN:1424453305
9781424453306
DOI:10.1109/SoCPaR.2009.66