Back close

A reliable anti-counterfieting technique using lossless code

Publication Type : Conference Paper

Publisher : IPCV 2010

Source : Proceedings of the 2010 International Conference on Image Processing, Computer Vision, and Pattern Recognition, IPCV 2010, Volume 1, Las Vegas, NV, p.222-226 (2010)

Url : http://www.scopus.com/inward/record.url?eid=2-s2.0-79952566916&partnerID=40&md5=58715f026e3c447c82c2c190b32c6ebf

ISBN : 9781601321541

Keywords : Arithmetic Coding, Bit planes, Computer vision, Data communication systems, DCT, Digital Image Watermarking, Digital watermarking, Discrete wavelet transforms, DWT, Electronic commerce, Image coding

Campus : Bengaluru

School : School of Engineering

Department : Electrical and Electronics

Year : 2010

Abstract : In today's modern era, networking primarily through internet plays a vital role in commercial applications, suck as internet banking, e-commerce, internet shopping etc. It becomes necessary in such applications to provide security to our confidential information that gets exchanged through these insecure channels. Our present work intends to hide and protect such sensitive information in an arbitrary background image without the sensitive data being exposed to public domains. Though many techniques exist for this purpose, our proposed method differs by embedding encoded sensitive information on a cover image, compressed and then transmitted to the destination. This provides greater security to the data transmission. This paper critically discusses the advantage of using Arithmetic coding technique and Bit Plane Substitution to derive the stego image. A detailed study is made to compare our technique with other prominent techniques like DCT and DWT.

Cite this Research Publication : Dr. S. Ravishankar, Hariharan, S., and V. Kumar, N., “A reliable anti-counterfieting technique using lossless code”, in Proceedings of the 2010 International Conference on Image Processing, Computer Vision, and Pattern Recognition, IPCV 2010, Las Vegas, NV, 2010, vol. 1, pp. 222-226.

Admissions Apply Now