|Rajesh Kumar. S1, Prasath Kumar. S2, Usha. P3
Assistant Professor, Department of Electrical and Electronics Engineering, Magna College of Engineering, Chennai, India
|Related article at Pubmed, Scholar Google|
Visit for more related articles at International Journal of Innovative Research in Science, Engineering and Technology
The majority of digital image processing featuring JPEG image compression uses on-chip image processing circuits for JPEG computations. For these computations, the JPEG algorithm employs the traditional method of computing the discrete cosine transform(DCT).These methods operate with multiplications, which leads to a moderate level of computational complexity. In proposed, we describe an entirely new approach that uses a novel signal processing algorithm namely arithmetic Fourier transform(AFT) for computing the DCT. This new method requires only additions which makes the computation much more efficient and low power. Before compression of image, the image is freed from salt and pepper noise,with the help of median filter.This further describes an encryption technique using Advance Encryption Standard (AES). The security offered by AES algorithm is unbreakable. This resists all the known types of attacks. The architecture and circuits may be implemented in a conventional CMOS process.
|Advance encryption standard(AES),image compression, arithmetic Fourier transform, JPEG image compression.|
|Recently, the image compression is performed by a separate digital signal processing circuit employing the DCT algorithms in the digital domain. The development of a new generation of image sensors that efficiently integrates the compression with the sensor itself will find widespread use in imaging applications where compression is needed and power consumption must be limited. The Arithmetic Fourier Transform (AFT) is computationally more efficient than currently used DCT computation methods. This new method requires only additions which makes the computation much more efficient and low power. For example, if a is the number of bits in the addends, a multiply operation requires an equivalent (Ã¯Â¿Â½Ã¯Â¿Â½−1)2number of adder circuits. The key element in the method that we are using in this implementation is the two-dimensional arithmetic Fourier transform (2-D AFT) algorithm.With some pre-scaling of the data, the AFT computes the DCT coefficients solely by performing additions.Unlike the conventional DCT algorithm, the AFT-based algorithm requires no multiplications. Further, there is a need of secure communication.|
|Hence encryption of data image is done based upon AES algorithm. Encryption is the the process of encoding messages (or information) in such a way that third parties cannot read it, but only authorized parties can Encryption doesn't prevent hacking but it prevents the hacker from reading the data that is encrypted. The AES is one of the most secure, robust, and reliable algorithms. AES encrypts 128-bit blocks of data, using multiple substitution and permutation operations.|
|In proposed, we first convert the analog image obtained from CMOS sensor into digital image and this image is compressed using AFT and further encryption of image is done using AES and finally it is decrypted as original image. The image considered here is JPEG image. This AFT algorithm provides a reduced computational complexity since only additions are taken. Given its relative mathematical simplicity, the AFT algorithm is well suited for efficient VLSI implementation.|
II. PROCEDURE FOR IMAGE COMPRESSION AND ENCRYPTION
|AFT algorithm is used for image compression,where the computational time is reduced since only addition operation is performed and multiplication is eliminated.AES provides encryption which gives an unbreakable security. The following diagram shows the general procedure of how image compression and encryption are done.|
|A.CMOS image sensor|
|A CMOS image sensor is an image sensor consisting of an integrated circuit containing an array of pixel sensors, each pixel containing a photodetector and an active amplifier. There are many types of sensors used most commonly in cell phone cameras, web cameras, most digital pocket cameras.|
|B. Pixel correction|
|A pixel that responds differently from its neighbors can be distracting and is often unacceptable. This correction adjusts the signal response of every pixel in the image.|
|C. Image compression|
|Compression is useful because it helps reduce resources usage, such as data storage space or transmission capacity. Because compressed data must be decompressed to use, this extra processing imposes computational or other costs through decompression|
|Encryption is the process of encoding messages (or information) in such a way that third parties cannot read it, but only authorized parties can. Image encryption encypts a text into an image, by appling an offset to each single byte. The following example shows how an image is obtained after applying 2-D AFT algorithm.|
|The work here has addressed the data compression by demonstrating a unique way of capturing images. Compression is an essential step in the image capture and processing chain, especially in power and bandwidth constrained remote viewing applications. The 2-D AFT methodology is feasible for image capture and can be implemented in silicon. Then further the compressed image is encrypted using Advance Encryption Standard (AES). To encrypt data before transmission, this sequence was combined with the plaintext using XOR operation. Therefore, this scheme is secure and has a high encryption speed.|
| Edwin J. Tan, ZeljkoIgnjatovic, Ã¢ÂÂNon-Uniformly Tiled CMOS Image Sensors for Efficient On-Chip Image Compression,Ã¢ÂÂ in Proc.IEEE Int. Symp. Circuits Syst., Kos, Greece, Aug 2012, pp. 5318–5321.
 A.Bandyopadhyay, J. Lee, R. Robucci, and P. Hasler, Ã¢ÂÂA 80 μW/frame 104 × 128 CMOS imager front end for JPEG compression,Ã¢ÂÂ in Proc.IEEE Int. Symp. CircuitsSyst., Kos, Greece, May 2005, pp. 5318–5321.
 S. Li, X. Mou, and Y Cai, Z. Ji, and J. Zhang, Ã¢ÂÂOn the security of a chaotic encryption scheme: Problems with computerized chaos in finite computing precision,Ã¢ÂÂ Comput. Phys. Commun., vol. 153, no. 1, pp.52–58, 2003.
 M.Zhang and A. Bermak, Ã¢ÂÂCMOS image sensor with on-chip image compression: A Review and performance analysis,Ã¢ÂÂJ. Sensors, vol. 2010, Article ID 920693, 17 pages, 2010. doi:10.1155/2010/920693.
 W.H.Chen, C. H. Smith, and S. C. Fralick, Ã¢ÂÂA fast computational algorithm for the discrete cosine transform,Ã¢ÂÂ IEEE Trans. Commun., vol. 25, no. 9, pp. 1004–1009, Sep. 1977.