Transcript 下載/瀏覽

SPIHT algorithm combined
with Huffman encoding
Wei Li, Zhen Peng Pang, Zhi Jie Liu,
2010 Third International Symposium on
Intelligent Information Technology and Security
Informatics,
pp. 341 - 343 ,2010
Presenter :Yu-Cheng Cheng
Outline
• Introduction
• SPIHT Algorithm
• Conclusion
Introduction
• SPIHT (Set Partitioning In Hierarchical
Trees) is computationally very fast and
among the best image compression
algorithms.
SPIHT Algorithm
Figure1 Parent-child relationship in SPIHT
SPIHT Algorithm
• In the algorithm, three ordered lists are used to store the
significance information during set partitioning. List of insignificant
sets (LIS), list of insignificant pixels (LIP), and list of significant pixels
(LSP) are those three lists.
• O(i, j) :Set of offspring of the coefficient (i, j),
• D(i, j) :Set of all descendants of the coefficient (i, j),
• L(i, j) :D(i, j) -O(i, j)
• H :Roots of the all spatial orientation trees
SPIHT Algorithm
SPIHT Algorithm
the output binary stream:
11100011100010000001010110000
SPIHT Algorithm
output stream every 3 bits as a group: 111 000 111 000 100 000 010
101 100 00.
SPIHT Algorithm
Table 1. Code word comparison table
output stream: 10 00 01 00 01 11 01 1001 101 11 00
Conclusion
Table 2. statistical results at different rate
Conclusion
• Proposing a simple and effective method
combined with Huffman encoding for
further compression in this paper.
Reference
• Wei Li, Zhen Peng Pang, Zhi Jie Liu, “SPIHT algorithm combined
with Huffman encoding”, IEEE Trans. on Intelligent Information
Technology and Security Informatics,2010 341 - 343 .