storage capacity and communication is relatively weak
which posed a great challenge on video coding and transmission. This article will improve SPIHT(set partitioning in hierarchical trees) algorithm and propose an improved three-dimensional set partitioning in hierarchical trees(3D-MSPIHT)video coding algorithm. This algorithm uses three-dimensional lifting wavelet decomposition
improved methods of the root and partition
to achieve the resorting of coefficients and ensure that more important information can be encoded earlier in the bit stream. At the same time
it adopted the listless coding structure
as well as no need for complex and heavy motion estimation and compensation
achieved less memory and energy consumption
and considerable QoS(quality of service).The experimental results show that this algorithm is better than 3D-SPIHT
particularly in low bit rate circumstances; and compared to coding schemes such as H.264