FRAGMENT-VISIBLE MOSAIC IMAGES BY COLOR TRANSFORMATIONS
Abstract
The variety image, which looks much like a randomly selected target image and can be utilized like a camouflage from the secret image, is produced by dividing the key image into fragments and changing their color qualities to become individuals from the corresponding blocks from the target image. Existing data hiding techniques mainly make use of the techniques of LSB substitution, histogram shifting, difference expansion, conjecture-error expansion, recursive histogram modification, and discrete cosine/wavelet changes. A brand new secure image transmission strategy is suggested, which transforms instantly confirmed large-volume secret image right into a so-known as secret-fragment-visible variety image of the identical size. Skilled techniques are made to conduct the color transformation process so the secret image might be retrieved nearly lossless. A plan of handling the overflows/underflows within the converted pixels’ color values by recording the color variations within the untransformed color space can also be suggested. The data needed for recuperating the key image is embedded in to the produced variety image with a lossless data hiding plan utilizing a key. Good experimental results show the practicality from the suggested method. Within the first phase, a variety image is produced; featuring it’s the fragments of the input secret image with color corrections based on a similarity qualifying criterion according to color versions.
Keywords
References
X. Hu, W. Zhang, X. Hu, N. Yu, X. Zhao, and F. Li, “Fast estimation of optimal marked-signal distribution for reversible data hiding,” IEEE Trans. Inf. Forens. Secur., vol. 8, no. 5, pp. 187–193, May 12013.
J. Tian, “Reversible data embedding using a difference expansion,” IEEE Trans. Circuits Syst. Video Technol., vol. 13, no. 8, pp. 890–896, Aug. 2003.
E. Demaine and M. Demaine, “Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity,” Graphs Combinator. vol. 23, no. 1, pp. 195–208, 2007.
R. Z. Wang, C. F. Lin, and J. C. Lin, “Image hiding by optimal LSB substitution and genetic algorithm,” Pattern Recog., vol. 34, no. 3, pp. 671–683, 2001.
J. Fridrich, M. Goljan, and R. Du, “Invertible authentication,” Proc. SPIE, vol. 3971, 2001, pp. 197–208.
D. Xiao, X. Liao, and P. Wei, “Analysis and improvement of a chaosbased image encryption algorithm,” Chaos Solit. Fract., vol. 40, no. 5, pp. 2191–2199, 2009.
V. Patidar, N. K. Pareek, G. Purohit, and K. K. Sud, “A robust and secure chaotic standard map based pseudorandom permutationsubstitution scheme for image encryption,” Opt. Commun., vol. 284, no. 19, pp. 4331–4339, 2011.
C. K. Chan and L. M. Cheng, “Hiding data in images by simple LSB substitution,” Pattern Recognit.., vol. 37, pp. 469–474, Mar. 2004.
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, Mar. 2006.
J. Tian, “Reversible data embedding using a difference expansion,” IEEE Trans. Circuits Syst. Video Technol., vol. 13, no. 8, pp. 890–896, Aug. 2003
Refbacks
- There are currently no refbacks.
Copyright © 2012 - 2023, All rights reserved.| ijitr.com
International Journal of Innovative Technology and Research is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJITR , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.