A Novel Technique for Image Steganography Based On Block-DCT and
Huffman Encoding
Arunima Kurup P& Poornima D Sreenagesh
S8, Department of Information Technology,
Mohandas College Of Engineering And Technology,Anad,Thiruvananthapuram



Abstract
Image steganography is the art of hiding information into a cover image. This paper presents a novel
technique for Image steganography based on Block-DCT, where DCT is used to transform original image
(cover image) ....etc

[:=Read Full Message Here=:]

Adaptive Huffman coding (also called Dynamic Huffman coding) is an adaptive coding technique based on Huffman coding. It permits building the code as the symbols are being transmitted, having no initial knowledge of source distribution, that allows one-pass encoding and adaptation to changing conditions in data.The benefit of one-pass procedure is that the source can be encoded in real time, though it becomes more sensitive to transmission errors, since just a single loss ruins the whole code. ....etc

[:=Read Full Message Here=:]

huffman algorithm and adaptive huffman algorithm binary image using matlab

Consider a black and white image. This image is made up of many pixels that are all different shades of gray which have a number value corresponding to the brightness or darkness of the shade. Black is 0, white is 255, and all the numbers in between are shades of gray. So, each pixel is coded as some integer from 0 to 255. In order to encode these integers, we must use bits. A bit have a value of either 0 or 1, and the maximum number of bits needed to code any number be ....etc

[:=Read Full Message Here=:]

Presented By
V. RAJITHA P.KAUMUDI


ABSTRACT:
In this paper, we propose a simple and efficient technique for embedded color image coding. The proposed algorithm exploits inter- and intra-sub band correlations of the wavelet transformed luminance (Y) and chrominance (U and V) planes as well as the interdependency among the coefficients of the three-color planes. The coefficients of the three-color planes are linked through the composite spatial orientation trees (CSOT) having root nodes in the Y-plane onl ....etc

[:=Read Full Message Here=:]

give me difference between static huffman coding and dynamic huffman coding. ....etc

[:=Read Full Message Here=:]

SUMMARY:
In this article, we strive to present a general introduction of steganography, or concealment, as sometimes just is not known. Then we turn to data hiding in images. In considering these data hiding techniques, we have in mind, Bender's technical characteristics, such as data loss, the cover should be minimized and hidden data should be made as immune as possible attack data manipulation cover. Steganography in images really come of age with the invention of fast, powerful computers. The software is easily available from the Internet a ....etc

[:=Read Full Message Here=:]

Data Compression Using Dynamic Huffman Coding ....etc

[:=Read Full Message Here=:]

to get information about the topic steganography using dct full report ppt related topic refer the page link bellow

http://seminarsprojects.net/Thread-steganography-in-images-download-seminar-report?pid=40952

http://seminarsprojects.net/Thread-image-steganography ....etc

[:=Read Full Message Here=:]

Abstract

Huffman coding can be used to compress all sorts of data. It is an entropy-based algorithm that relies on an analysis of the frequency of symbols in an array. Huffman coding can be demonstrated most vividly by compressing a raster image. Suppose we have a 5 5 raster image with 8-bit color, i.e. 256 different colors. The uncompressed image will take 5 x 5 x 8 = 200 bits of storage. This compression technique is used broadly to encode music, images, and certain communication protocols. Lossless JPEG compression uses the Huffman algorit ....etc

[:=Read Full Message Here=:]

i want modified huffman coding with matlab code for free download.
i'm studing matlab but it's very difficult.Therefor help me please ....etc

[:=Read Full Message Here=:]