A fast and improved Image Compression technique using Huffman coding

Image Compression using Huffman coding technique is simpler & easiest compression technique. Compression of image is an important task as its implementation is easy and obtains less memory. The purpose of this paper is to analyse Huffman coding technique which is basically used to remove the redundant bits in data by analysing different characteristics or specification like Peak Signal to Noise Ratio (PSNR), Mean Square Error (MSE) Bits Per Pixel (BPP) and Compression Ratio (CR) for the various input image of different size and the new method of splitting an input image into equal rows & columns and at final stage sum of all individual compressed images which not only provide better result but also the information content will be kept secure. An image compression technique has various advantages in the field of image analysis and also for the security purpose for the image.