Impact Factor:6.549
 Scopus Suggested Journal: Tracking ID for this title suggestion is: 55EC484EE39417F0

International Journal
of Computer Engineering in Research Trends (IJCERT)

Scholarly, Peer-Reviewed, Platinum Open Access and Multidisciplinary

Welcome to IJCERT

International Journal of Computer Engineering in Research Trends. Scholarly, Peer-Reviewed, Platinum Open Access and Multidisciplinary

ISSN(Online):2349-7084                 Submit Paper    Check Paper Status    Conference Proposal

Back to Current Issues

Secret Data Embedding using Texture Synthesis

Suphiya P. Inamdar,, Suhas B. Bhagate, , ,
Dept. of Computer Science and Engineering, D.K.T.E. Society’s Textile and Engineering Institute, Ichalkaranji, India.

A steganography is an art of hiding confidential data into digital media such as image, audio, video etc. The proposed the system using steganography using reversible texture synthesis. Texture synthesis uses the concept of the patch which represents an image block of source texture where its size is user specified. A texture synthesis process resamples a smaller texture image and provides a new image with arbitrary size and shape. Instead of using an existing cover image to hide messages, the algorithm conceals the source texture image and embeds secret messages using the process of texture synthesis. This allows extracting the hidden messages and source texture from a stego synthetic texture. The approach offers some advantages. First, the scheme provides the embedding capacity that is proportional to the size of the stego texture image. Second, the reversible capability inherited from this scheme includes functionality, which allows recovery of the source texture. And third, there will be no image distortion since the size of the new texture image is user-specified

Suphiya P. Inamdar,Suhas B. Bhagate (2018). Secret Data Embedding using Texture Synthesis. International Journal of Computer Engineering In Research Trends, 5(7), 207-211. Retrieved from

Keywords : Steganography, Data embedding, Texture synthesis, Cover medium, Index table.

[1]	N. Provos and P. Honeyman, ―Hide and seek: An introduction to steganography,‖ IEEE Security Privacy, vol. 1, no. 3, pp. 32–44, May/Jun. 1999.
[2]	F. A. P. Petitcolas, R. J. Anderson, and M. G. Kuhn, ―Information hiding survey,‖ Proc. IEEE, vol. 87, no. 7, pp. 1062–1078, Jul. 1999. 
[3]	A. Efros and T. K. Leung, “Texture synthesis by non-parametric sampling,” in Proc. of the Seventh IEEE International Conference on Computer Vision, 1999, pp. 1033-1038.
[4]	L.-Y. Wei and M. Levoy, “Fast texture synthesis using tree-structured vector quantization,” in Proc. of the 27th Annual Conference on Computer Graphics and Interactive Techniques, 2000, pp. 479-488.
[5]	L. Liang, C. Liu, Y.-Q. Xu, B. Guo, and H.-Y. Shum, “Real-time texture synthesis by patch-based sampling,” ACM Trans. Graph., vol. 20, no. 3, pp. 127-150, 2001.
[6]	A. Efros and W. T. Freeman, “Image quilting for texture synthesis and transfer,” in Proc. of the 28th Annual Conference on Computer Graphics and Interactive Techniques, 2001, pp. 341-346.
[7]	Renjie Chen, Ligang Liu, Guangchang Dong, ― Local resampling for patch-based texture synthesis in vector fields‖, Int. J. of Computer Applications in Technology ,2004.
[8]	Z. Ni, Y.-Q. Shi, N. Ansari, and W. Su, “Reversible data hiding,” IEEE Trans. Circuits Syst. Video Technol., vol. 16, no. 3, pp. 354-362, 2006.
[9]	H. Otori and S. Kuriyama,―Data-embeddable texture synthesis,‖ in Proc. 8th Int. Symp. Smart Graph., Kyoto, Japan, 2007, pp. 146–157. 
[10]	X. Li, B. Li, B. Yang, and T. Zeng, “General framework to histogram-shifting-based reversible data hiding,” IEEE Trans. Image Process., vol. 22, no. 6, pp. 2181-2191, 2013.
[11]	Kuo- Chen Wu and Chung-Ming Wang, “Steganography Using Reversible Texture Synthesis”, IEEE Transaction On Image Processing ,vol.24,no.1,pp.2015

DOI Link :

Download :

Refbacks : Currently there are no refbacks

Support Us

We have kept IJCERT is a free peer-reviewed scientific journal to endorse conservation. We have not put up a paywall to readers, and we do not charge for publishing. But running a monthly journal costs is a lot. While we do have some associates, we still need support to keep the journal flourishing. If our readers help fund it, our future will be more secure.

Quick Links


Science Central

Score: 13.30

Submit your paper to