Review on SPIHT Algorithm with Huffman Encoding for Image Compression

[1] ChengLi-chi,WangHong-xia,LuoYong.Ripplingtheoryandapplications.Beijing:SciencePress,2004(Chinese)
[2] J. M. SHAPIRO. Embedded image committal to writing victimisation zero trees of wavelets coefficients [J]. IEEE Trans. Signal process 1993 41(12) 3445-346 apairof.
[3]RafaelC.GONZALEZRichardE.WOODS.“Digitalimageprocessing”:secondmaleerecticledysfunction[M].Nationalcapitalbusinessfirmofindu stry2002.
[4] Ameer aforesaid William A.PEARLMAN. “A new quick and economical image codec supported set partitioning in ranked trees [J]”. IEEE Transactions onCircuitsandSystemsforVideo Technology1996.
[5] M. Banerjee and M. K. Kundu, “Edge primarily {based} options for content based image retrieval,” Pattern Recognition., vol. 36, no. 11, pp. 2649–2661,November 2003. [8] Y. S. Chan, P. C. Cosman, and L. B. Milstein, “A cross-layer diversity technique for multi-carrier
OFDM multimedia system networks,” IEEETrans.Image Proc.,vol.15,no.4,pp.833–847,Apr.2006.
[6] R.J. McElieceandW. E.Stark, “Channelswithblockinterference,”IEEETrans.info.Theory, vol. 30,no. 1, pp.44–53,Jan.1984.
[7] RichardVaninheritable and RamjeePrasad,"OFDMforwirelessmultimedia system communications,"ArechHouseBeantown,London,2000.
[8] J. M. Kahn, W. J. Krause, and J. B. Carruthers, "Experimental characterization of non directed indoor infrared channels," IEEE Trans.
Commun., vol.43,pp.1613-1623,1995.