Piecewise Permutation Steganography for 3D Humanoid Mesh Models
|
|
- Judith Moore
- 6 years ago
- Views:
Transcription
1 Piecewise Permutation Steganography for 3D Humanoid Mesh Models Hsin-Chih Lin* and Shan-Jhu Lin Department of Information and Learning Technology National University of Tainan Tainan City, Taiwan * hclin@mail.nutn.edu.tw Abstract A new steganographic method for hiding secret information into a 3D humanoid mesh model is proposed in this study. First of all, the 3D humanoid mesh model is divided into several articulate segments. According to the mesh connectivity of each segment, the proposed method uses Bogomjakov et al. s permutation steganography [3] to hide messages in the index representation of the segment. We also present a new concept of piecewise hiding which embeds messages into segments in a specific order to raise security and applicability of the embedded messages. The proposed method is error-free since it does not modify the geometry of the cover model. Even if the stego-model has a different pose due to articulate motions, the embedded message can be extracted from the model with no errors since the topology of the cover model is not changed. Experiential results reveal the effectiveness of the proposed method. Keywords-permutation steganograph; information hiding; 3D humanoid mesh model. I. INTRODUCTION Steganography conceals the existence of secret messages, as shown in Fig.. Its benefit is that the secret message does not attract notice of attackers and even receivers. Watermarking is another technique to hide messages and it is often used to provide ownership on copyrighted media and to detect originators in illegal copies. An effective watermarking method must be robust against many kinds of attacks. In contrast to watermarking, steganography need to hide messages as much as possible and requires cover media with distortion as little as possible. Therefore, purposes of steganography and watermarking are quite different. Cover Work Source Embedding function Key Channel monitored Extraction function Key Figure. The procedure of steganography. Steganography is a technique of information hiding and consists of two branches, namely () technical steganography and (2) linguistic steganography [, 2]. Technical steganography hides a message by using scientific methods, This study was supported partially by the National Science Council, Taiwan, under the Grant NSC E MY2. such as invisible ink or pin punctures. Linguistic steganography hides a message by using language tricks, such as an arrangement of words within a harmless text. High security, high capacity, low distortion and limited robustness are required for steganographic methods [3-5]. Great deals of research works on information hiding have been proposed in last decades. Since its first proposal on the research domain, information hiding methods have become more and more sophisticated. Traditional steganographic methods try to embed secret messages in the noise of the media [4] by distorting the original media, while requiring unnoticeable distortions. These methods may, for example, modify the least significant bits in an image or a video. A general approach to embedding messages in a 3D model is to slightly perturb vertex positions. Recently, some researchers have proposed steganographic methods to hide secret messages in the representation domain. This kind of steganographic methods is distortion-free. To develop steganographic methods, researchers are interested in maximizing capacity and robustness, and reducing distortion. We describe some related steganographic algorithms as follows. Ohbuchi et al. [6, 7] discuss techniques for embedding messages into a 3D polygonal model. Their proposed triangle similarity quadrature (TSQ) algorithm is the first 3D model information hiding algorithm. TSQ is to mark similar triangles in the model and to embed messages into those triangles that are near the marked triangles. Cayre et al. [8, 9] presented a steganographic algorithm for 3D triangle meshes in the spatial domain. Their concept is to consider a triangle as a two-state (i.e., 0 and ) geometrical object. The position of the orthogonal projection of the triangle peak on the bottom edge is divided into the two states. The vertex is then modified according to the message to be embedded. Cayre et al. s algorithm uses the quantization index modulation (QIM) and its capacity is 0.5 bit per vertex. This algorithm is timeconsuming and usually cannot embed messages in all vertices of the model. Therefore, Wang & Cheng [0] proposed a multilevel embedding procedure (MLEP) to improve Cayre et al. s algorithm. They exploited the adaptability in representing polygon meshes to obtain more capacity. Wang & Cheng uses changing counterclockwise and clockwise orders of vertices to add an extra bit per triangle. Cheng & Wang [] proposed a modified multi-level embed procedure (MMLEP) to improve the MLEP algorithm [0]. This procedure could embed at least
2 three bits per vertex by modifying sliding, extending and arching in each triangle. Cheng & Wang also present a connectivity embedding scheme that raises the capacity by six bits per vertex. This scheme reorder vertices and faces to a reference ordering obtained from the mesh geometry. The place of a vertex or a face in the new ordering can be embedded one bit. Fig.2 is an example of a 3D model's dataset which contains vertex coordinates and faces. Each face is combined by three vertex indices. Cheng & Wang also use cyclic vertex moves on triangles to get another two bits per vertex. Their steganographic techniques are lossless because rearranging faces or vertices does not distort the geometry. Chao et al. [2] proposed a high-capacity and low-distortion steganographic scheme. This scheme is based on a novel multi-layered embedding scheme to hide secret messages in vertices of 3D polygon models. Vertices are modified slightly according to principal component analysis. The average capacity is about 2~33 bits per vertex, but the scheme is not robust to any geometric attack. Vertex coordinates Faces The rest of this paper is organized as follows. In Section 2, we present an overview of the proposed method and then detail our steganographic algorithm. Experimental results are shown in Section 3. Conclusions and future works are given in Section 4. II. THE PROPOSED METHOD A. An overview The proposed steganographic method for 3D humanoid mesh models consists of two procedures, namely () piecewise embedding and (2) piecewise extraction. The embedding procedure is shown in Fig. 3. In the model segmentation step, the cover model is divided into several articulate segments. The initial segment is decided by a key. In the vertex traversal step, the reference order of triangles and vertices in each segment are established. Other neighboring segments are found and pushed into next-segment queue. In the permutation embedding step, the message is embedded into the dataset of each segment by permuting the reference orders. The last 0 bits of the message that are embedded into each segment are calculated in the decimal system and saved as IT value (initial triangle value) for the next segment. The order of non-initial segments to embed messages is decided by nextsegment queue. When the next segment is popped from nextsegment queue, the initial triangle in the segment is determined by IT value. The vertex traversal and permutation steps are repeated until the message is embedded into all segments. Key Cover Model Model Segmentation Figure 2. 3D model's dataset. Bogomjakov et al. [3] proposed a steganographic algorithm for 3D polygonal meshes to hide messages in the indexed representation of a mesh by re-permuting the order of faces and vertices. Their encoding and decoding algorithms consist of two steps: () A reference ordering of the mesh vertices and faces is computed. (2) The messages is encoded as a permutation of vertices and faces which depend on their reference order, or decoded by comparing the ordering present in the dataset to the reference one. Bogomjakov et al. s algorithm is lossless and can hide high capacity as much as bits per vertex. In this study, we present a new steganographic method for hiding secret messages into a 3D humanoid mesh model. First of all, the 3D humanoid mesh model is divided into several segments. According to the mesh connectivity of each segment, the proposed method uses Bogomjakov et al. s permutation steganography [3] to hide messages in the index representation of the model. We also present a concept of piecewise steganography which embeds messages into segments in a specific order to raise security and applicability of the embedded messages. Initial Segment Initial Triangle Searching Vertex Traversal Reference order Permutation Embedding Stego-segments Stego-model Other Segments Initial Vertex Next Segment(s) Figure 3. Embedding procedure. Nextsegment Queue IT Value The extraction procedure, shown in Fig. 4, is very similar to the embedding procedure. The segments information is saved in the stego-model. We traverse each segment of the stegomodel and produce the reference order by the correct key and IT value from the last segment. In each segment, the message is extracted by matching the dataset and reference order.
3 Key Initial Segment Stego-model Initial Triangle Searching Vertex Traversal Reference order Other Segments Initial Vertex Permutation Extraction Nextsegment Queue Next Segment(s) IT Value Key: Initial segment: Head Initial triangle: The 5th Triangle list The 5th triangle Dataset # object body to come... # object head to come... # v v # 004 vertices g head f f f f f f # 884 faces Figure 6. The initial triangle and the initial vertex. Figure 4. Extraction procedure. B. Model segmentation In this study, we propose a concept of piecewise hiding to raise security and applicability of the embedded messages. An example is shown in Fig. 5. The cover model is divided to six segments and the segment order keys are decided by a traversal algorithm. s can be embedded into six segments by different keys. Figure 5. An example of piecewise hiding. The piecewise hiding technique is presented in Sections 2.2~2.5. The initial segment and the initial triangle of the initial segment are decided by a key. The initial vertex is the first vertex of the initial triangle in the model dataset. Shown in Fig. 6 is an example of the initial triangle and the initial vertex. The initial segment that the key decided is "Head". The initial triangle is the 5-th triangle in dataset and its first vertex (with index 942) is the initial vertex. C. Vertex traversal As long as the traversal algorithm is based on the mesh connectivity, it can be used in our method. This property makes our method robust on condition that the topology of the stegomodel is unchanged. Once the initial vertex and edge are selected, the whole traversal is uniquely defined. And the traversal path is regarded as a reference order. The breadth-first traversal algorithm proposed by Cheng & Wang [4] is used in this study. This traversal algorithm is inspired by the concept of epidemics to traverse the mesh, producing a traversal path, as shown in Fig. 7. The initial vertex is defined as a virus vertex. The initial edge is defined as a virus edge. The initial triangle is defined as a virus triangle. All vertices are considered healthy except those of the initial triangle. The virus edge is taken as the medium for infection. A triangle would be infected by the shared virus edge. A triangle that has not been infected is called susceptible. The susceptible triangle is infected by one shared virus edge and in turn become incubative. When all healthy vertices in an incubative triangle become virus ones, the triangle becomes infective and then can infect susceptible neighbor triangles. Finally, when all neighboring triangles have been infected, the originally infective triangle does not infect other triangles anymore and then becomes immune. The four states repeat until all triangles of the mesh are immune. not yet infected Susceptible has susceptible neighbor Infective infected all neighbors have been infected has health vertex Incubative all vertices are virus Immune Figure 7. The four states of a triangle in contagious diffusion.
4 In the vertex traversal process, if a neighboring segment is near a virus edge, we push the segment into the next-segment queue and find the ITS triangle of the segment. Shown in Fig. 8a is an example of ITS triangle. Vt and Vs are virus vertices. The virus edge of Ti in segment A is near segment B. In Fig. 8b, TB_ITS that shares the same edge with Ti is the ITS triangle of segment B. In the step of initial triangle searching, the initial triangle is determined by the ITS triangle. Segment A V t T i Segment B V s Segment A V t T B_ITS Figure 8. ITS triangle of segment B. V s Segment B D. Permutation embedding In this study, we use Bogomjakov et al. s permutation steganographic algorithm [3] to hide messages in each segment. The message is embedded in each segment by permuting reference order. The permutation order which is the result of permuting reference order saved in dataset. The permutation embedding proceeds as follows. Step : Assume there are n vertices in the segment and the number of permuting vertices is i. The number of bits to be embedded is k = log 2 (n - i). Step 2: Late b and b' be decimal values of the next k and k+ bits, respectively, of the message. Step 3: If n - i > b' 2 k, the vertex which is b'-th vertex in reference order is saved in the permutation order. The (n-i-)-th vertex of reference order replaces the b'-th vertex of reference order. Otherwise, the vertex which is b-th vertex in reference order is saved in the permutation order. The (n-i-)th vertex of reference order replaces the b-th vertex of reference order. Step 4: Repeat Steps ~3 until all vertices in the segment are embedded the message. F. Permutation extraction In the extraction procedure, each segment of the stegomodel is traversed and produced the reference orders by a correct key and the IT value. In each segment, the message is extracted by matching dataset and reference order. The permutation extraction proceeds as follows. Step : Assume there are n vertices in the segment and the number of permuting vertices is i. The number of bits to be embedded is k = log2(n - i). Step 2: According permutation order from dataset, the vertex of permutation order is matched with reference order. The vertex of permutation order is the b-th vertex of reference order. Step 3: If b 2 k, b is calculated into binary system by k bits. Otherwise, b is calculated into binary system by k+ bits. Step 4: The (n-i-)-th vertex of reference order replaces the b- th vertex of reference order. Step 5: Repeat Steps ~4 until the message embedded in all vertices of the segment are extracted. Finally, all pieces of message which are extracted from all segments are combined to form the complete message. III. EXPERIMENTAL RESULTS Our experiments were implemented on a personal computer with a 3.4 GHz processor and.5gb memory. The operate system is Microsoft Windows XP Service Pack 2. We implemented the proposed scheme using C++ programming language. The analyses of our steganographic system are based on the following three goals: high capacity, lossless, and high security. There are five triangle mesh models, as show in Figs. 9a~9e, to be tested in this study. The five models dataset are.obj. First of all, we use 3DS Max to divide these models into several articulate segments, as shown in Fig. 9. The last 0 bits of the message that are embedded into the segment are regarded as an IT value. The initial triangle of the next segment is searched by the IT value. E. Initial triangle search In the embedding order of non-initial segments, the next segment is popped from next-segment queue. The initial triangle in the next segment is searched by the ITS triangle and tit value which is from last segment. The traversal algorithm proposed by Cheng & Wang [4] starts from the ITS triangle. When the IT-th vertex is traversed, the vertex is defined as the initial vertex of the segment and the triangle is defined as the initial triangle of the segment. (c) (d) (e) Figure 9. The divisions of experimental models. The model detail and capacity is listed in Table I, where S init (=2) is initial segment, T Sinit (=5) is initial triangle of initial segment. The average capacity is 7.76~27.70 bits per
5 vertex. We could discover that the average capacity is high when the number of vertices is large. The capacity is s ( log 2( vi ) + log 2( ( fi! )) + vi + fi + ) i=!, where s is the number of segments, v i is the number of vertices in the i-th segment, f i is the number of triangles in the i-th segment. TABLE I. MODEL DETAIL AND CAPACITY. Model Capacity [bits] name #vertices #faces #segments total bit/vertex rabbit , spider 2,073 3, , goldfish 2,246 4, , human 4,77 9, , barosaur 6,9 2, , S init = 2, T Sinit = 5 TABLE III. DIFFERENT NUMBERS OF SEGMENTS. Model Capacity [bits] name #segments total bits/vertex human 6 29, human 20, S init = 2, T Sinit = 5 To analyze the relationship between the model pose and the robustness, the pose of the stego-model is changed and then we extract the message from the model. Fig. a is original pose and Fig. b is the pose after articulate motions. The result is shown in Table IV. The normalized correlation (NC) is to estimate the correlation of the message that is extracted from stego-model. When NC is, the message is not lossless. If NC is smaller, the message is loss a lot. From Table IV, the NC of the changed model is so the message is lossless. It means that different poses of the stego-model does not affect the completeness of the embedded message. To analyze the relationship between the key and the capacity, we use different keys to hide messages in the human model. The results are listed in Table II. From experimental results, we can find that the average capacity of the model is similar. It means that the use of different keys affects the capacity slightly. TABLE II. S init USING DIFFERENT KEY TO EMBED MESSAGE. Capacity [bits] T Sinit total bits/vertex , , , , , Model: human.obj To analyze the relationship between the number of segments and the capacity, the human model is divided to different number of segments and then embedded the same message. Figs. 0a and 0b show the human model with 6 and segments, respectively. The capacity is listed in Table III. The average capacity is bits and bits per vertex, respectively. From experimental results, we find that if a model is divided to more segments, the capacity would be lower. Figure 0. Human models with different segmentations. TABLE IV. Figure. Different poses of model. DIFFERENT POSES OF THE STEGO-MODEL. name #segments Pose change NC human 6 Yes human 6 No S init = 2, T Sinit = 5 IV. CONCLUSIONS AND FUTURE WORK In this study, we have presented a new steganographic method for 3D humanoid mesh models. The concept of piecewise hiding is also presented. The message can be embedded into 3D model s dataset by permuting the index of vertices and the index of faces. From experiment results, our method has high capacity and is distortion-free. By the concept of piecewise hiding, the security and applicability of the embedded messages can be raised significantly. In the future, we can combine the concept of piecewise hiding with those of access rights and public key infrastructure (PKI), as shown in Fig. 2. In this figure, different keys mean different access rights. Si denotes the message embedded in the i-th segment; K i denotes the i-th key used to encrypt S i. There are four concepts of access rights. In Fig. 2a, only when S has be decrypted by K, S 2 can be decrypted by K 2 and S, and so on. In Fig. 2b, different messages can be encrypted and decrypted by different keys independently. In Fig. 2c, only when S and S 2 have been encrypted by K and K 2, respectively, S 3 can be decrypted by K 3, S and S 2. In Fig. 2d, only when S
6 has been encrypted by K, S 2 and S 3 can be decrypted by K 2 and K 3, respectively, and S. Our piecewise hiding method can be easily extended to implement the four access right concepts to raise the security and applicability of messages. (c) (d) Figure 2. Different concepts of access right. REFERENCES [] N.Provos, P Honeyman, Hide and seek: an introduction to steganography, IEEE Security and Privacy Magazine, vol., no. 3, pp , [2] C. Cachin, Digital steganography, Encyclopedia of Cryptography and Security. Springer Verlag, [3] I. J. Cox, M. Miller, J. Bloom, J. Fridrich, and T. Kalker, Digital Watermarking and Steganography, 2 ed.: Morgan Kaufmann, [4] F. A. P. Petitcolas, R. J. Anderson, and M.G. Kuhn, Information hiding -a survey, Proc. of the IEEE, vol. 87, no. 7, pp , 999. [5] N. Memon and P. W. Wong, Protecting digital media content, Commun. ACM, vol. 4, no. 7, pp , 998. [6] R. Ohbuchi, H. Masuda, and M. Aono, "Embedding data in 3D models, the 4th International Workshop on Interactive Distributed Multimedia Systems and Telecommunication Services, Darmstadt, Germany, pp. -0, 997. [7] R. Ohbuchi, H. Masuda, and M. Aono, Watermaking three-dimensional polygonal models, the 5th ACM international conference on Multimedia, Seattle, Washington, USA, pp , 997. [8] F. Cayre, O. Devillers, F. Schmitt, and H. Maitre, Watermarking 3D triangle meshes for authentication and integrity, [9] F. Cayre and B. Macq, "Data hiding on 3-D triangle meshes," IEEE Transactions on Signal Processing, vol. 5, no. 4, pp , [0] C.-M. Wang, Y.-M. Cheng, An efficient information hiding algorithm for polygon models, Eurographics, vol. 24, no.3, pp , [] Y. M. Cheng and C. M. Wang, A high-capacity steganographic approach for 3D polygonal meshes, Visual Computer, vol. 22, no. 9, pp , [2] M. W. Chao, C. H. Lin, C. W. Yu, and T. Y. Lee, A high capacity 3D steganography algorithm, IEEE transactions on visualization and computer graphics, vol. 5, no. 2, pp , [3] A. Bogomjakov, C. Gotsman, and M. Isenburg, Distortion-free steganography for polygonal meshes, Eurographics, vol. 27, no. 2, pp , [4] Y. M. Cheng and C. M. Wang, An adaptive steganographic algorithm for 3D polygonal meshes, Visual Computer, vol. 23, no. 9, pp , 2007.
Vertex Shuffling : A Novel Information Hiding on 3D Model
Vertex Shuffling : A Novel Information Hiding on 3D Model Cong-Kai Lin, Charlie Irawan Tan, and Wen-Kai Tai Department of Computer Science and Information Engineering, National Dong Hwa University, Taiwan,
More informationA HIGH-CAPACITY DISTORTION-FREE INFORMATION HIDING ALGORITHM FOR 3D POLYGON MODELS. Received December 2011; revised April 2012
International Journal of Innovative Computing, Information and Control ICIC International c 2013 ISSN 1349-4198 Volume 9, Number 3, March 2013 pp. 1321 1335 A HIGH-CAPACITY DISTORTION-FREE INFORMATION
More informationDistortion-Free Steganography for Polygonal Meshes
EUROGRAPHICS 2008 / G. Drettakis and R. Scopigno (Guest Editors) Volume 27 (2008), Number 2 Distortion-Free Steganography for Polygonal Meshes Alexander Bogomjakov 1 Craig Gotsman 1 Martin Isenburg 2 1
More informationData Hiding on Text Using Big-5 Code
Data Hiding on Text Using Big-5 Code Jun-Chou Chuang 1 and Yu-Chen Hu 2 1 Department of Computer Science and Communication Engineering Providence University 200 Chung-Chi Rd., Shalu, Taichung 43301, Republic
More informationAnalysis of Information Hiding Techniques in HEVC.
Analysis of Information Hiding Techniques in HEVC. Multimedia Processing EE 5359 spring 2015 Advisor: Dr. K. R. Rao Department of Electrical Engineering University of Texas, Arlington Rahul Ankushrao Kawadgave
More informationA Revisit to LSB Substitution Based Data Hiding for Embedding More Information
A Revisit to LSB Substitution Based Data Hiding for Embedding More Information Yanjun Liu 1,, Chin-Chen Chang 1, and Tzu-Yi Chien 2 1 Department of Information Engineering and Computer Science, Feng Chia
More informationInformation Cloaking Technique with Tree Based Similarity
Information Cloaking Technique with Tree Based Similarity C.Bharathipriya [1], K.Lakshminarayanan [2] 1 Final Year, Computer Science and Engineering, Mailam Engineering College, 2 Assistant Professor,
More informationWatermarking Moble Phone Color Images With Error Correction Codes
IOSR Journal of Electronics & Communication Engineering (IOSR-JECE) ISSN(e) : 2278-1684 ISSN(p) : 2320-334X, PP 05-09 www.iosrjournals.org Watermarking Moble Phone Color Images With Error Correction Codes
More informationCOPYRIGHT PROTECTION OF PALETTE IMAGES BY A ROBUST LOSSLESS VISIBLE WATERMARKING TECHNIQUE *
COPYIGHT POTECTION OF PALETTE IMAGES BY A OBUST LOSSLESS VISIBLE WATEMAKING TECHNIQUE * Pei-Pei Chen ( 陳佩貝 ) and Wen-Hsiang Tsai ( 蔡文祥 ), Dept of Computer Science, National Chiao Tung University, Hsinchu,
More informationACEAIT-3055 High-Capacity Steganography Using MRF-Synthesized Cover Images
ACEAIT-3055 High-Capacity Steganography Using MRF-Synthesized Cover Images Chaur-Chin Chen and Wei-Ju Lai Department of Computer Science National Tsing Hua University Hsinchu 30013, Taiwan e-mail: cchen@cs.nthu.edu.tw
More informationDigital Image Steganography Techniques: Case Study. Karnataka, India.
ISSN: 2320 8791 (Impact Factor: 1.479) Digital Image Steganography Techniques: Case Study Santosh Kumar.S 1, Archana.M 2 1 Department of Electronicsand Communication Engineering, Sri Venkateshwara College
More informationImage Steganography (cont.)
Image Steganography (cont.) 2.2) Image Steganography: Use of Discrete Cosine Transform (DCT) DCT is one of key components of JPEG compression JPEG algorithm: (1) algorithm is split in 8x8 pixel squares
More informationA Hybrid Method of Hiding The Text Information Using Stegnography
A Hybrid Method of Hiding The Text Information Using Stegnography M.Grace Vennice, M.Swapna, MD.Ahmad Ali & T.Dharma Reddy CSE Dept, CMRCET, Hyderabad, India. E-mail : grace_vennice@yahoo.co.in, swapna_manthena2007@yahoo.com
More informationOTP-Steg. One-Time Pad Image Steganography Using OTP-Steg V.1.0 Software October 2015 Dr. Michael J. Pelosi
OTP-Steg One-Time Pad Image Steganography Using OTP-Steg V.1.0 Software October 2015 Dr. Michael J. Pelosi What is Steganography? Steganography literally means covered writing Encompasses methods of transmitting
More informationRGB Digital Image Forgery Detection Using Singular Value Decomposition and One Dimensional Cellular Automata
RGB Digital Image Forgery Detection Using Singular Value Decomposition and One Dimensional Cellular Automata Ahmad Pahlavan Tafti Mohammad V. Malakooti Department of Computer Engineering IAU, UAE Branch
More informationKeywords Stegnography, stego-image, Diamond Encoding, DCT,stego-frame and stego video. BLOCK DIAGRAM
Volume 6, Issue 1, January 2016 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Information
More informationA Novel Secure Digital Watermark Generation from Public Share by Using Visual Cryptography and MAC Techniques
Bashar S. Mahdi Alia K. Abdul Hassan Department of Computer Science, University of Technology, Baghdad, Iraq A Novel Secure Digital Watermark Generation from Public Share by Using Visual Cryptography and
More informationCHAPTER 6. LSB based data hiding with double Encryption. 6.1 Introduction
CHAPTER 6 LSB based data hiding with double Encryption 6.1 Introduction In image steganography, the amount of secret data that can be embedded depends on the method and the cover-image as capacity limitation
More informationDIGITAL IMAGE WATERMARKING TECHNIQUES FOR IMAGES USING TWO-DIMENSIONAL WALSH CODING
DIGITAL IMAGE WATERMARKING TECHNIQUES FOR IMAGES USING TWO-DIMENSIONAL WALSH CODING Ajeet Pratap Singh 1, Sachin Kumar 2 1,2 Department of ECE, ASET, Amity University, Lucknow, U.P., (India) ABSTRACT The
More informationA STEGANALYTIC ALGORITHM FOR 3D POLYGONAL MESHES. Department of Computer Science, Yale University
A STEGANALYTIC ALGORITHM FOR 3D POLYGONAL MESHES Ying Yang Ruggero Pintus, Holly Rushmeier Ioannis Ivrissimtzis Department of Computer Science, Yale University CRS4, Italy School of Engineering and Computing
More informationA Novel Information Security Scheme using Cryptic Steganography
A Novel Information Security Scheme using Cryptic Steganography B.RAJA RAO Associate Professor, E.C.E Dept raja_rao_b@ yahoo.com P.ANIL KUMAR Assistant Professor, I.T Dept anilkumar_pallikonda@yahoo.co.in
More informationAdaptive Pixel Pair Matching Technique for Data Embedding
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 1, January 2014,
More information3-D D Digital Watermarking
CORESA 2007, Montpellier 3-D D Digital Watermarking Adrian G. Bors University of York Computer Science Department YORK Y010 5DD, UK adrian.bors@cs.york.ac.uk 9 November 2007 Outline Overview of 3D watermarking
More informationA Novel Method of 3D Image Steganography Using LZW Technique and Chaotic Neural Network
IJCSNS International Journal of Computer Science and Network Security, VOL.13 No.6, June 2013 1 A Novel Method of 3D Image Steganography Using LZW Technique and Chaotic Neural Network B. Geetha vani 1
More informationA Secure Image Communication Scheme based on combination of Compression, Cryptography and Steganography
A Secure Image Communication Scheme based on combination of Compression, Cryptography and Steganography Bhavya Ahuja 1, S. K. Muttoo 2, Deepika Aggarwal 3 ABSTRACT In this paper we propose a new technique
More informationA Detailed look of Audio Steganography Techniques using LSB and Genetic Algorithm Approach
www.ijcsi.org 402 A Detailed look of Audio Steganography Techniques using LSB and Genetic Algorithm Approach Gunjan Nehru 1, Puja Dhar 2 1 Department of Information Technology, IEC-Group of Institutions
More informationRobust Blind Watermarking Mechanism For Motion Data Streams
Robust Blind Watermarking Mechanism For Motion Data Streams Parag Agarwal Ketaki Adi B. Prabhakaran Department of Computer Science, University of Texas at Dallas MS EC 31, PO Box 830688, Richardson, TX
More informationAccepted Manuscript. Optimization approach for 3D model watermarking by linear binary programming. Yu-Ping Wang, Shi-Min Hu
Accepted Manuscript Optimization approach for 3D model watermarking by linear binary programming Yu-Ping Wang, Shi-Min Hu PII: S0167-8396(10)00024-5 DOI: 10.1016/j.cagd.2010.02.003 Reference: COMAID 1208
More informationarxiv: v1 [cs.cr] 31 Dec 2018
Security analysis of a self-embedding fragile image watermark scheme Xinhui Gong, Feng Yu, Xiaohong Zhao, Shihong Wang School of Science, Beijing University of Posts and Telecommunications, Beijing 100876,
More informationHighly Secure Invertible Data Embedding Scheme Using Histogram Shifting Method
www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume 3 Issue 8 August, 2014 Page No. 7932-7937 Highly Secure Invertible Data Embedding Scheme Using Histogram Shifting
More informationBit Adjusting Image Steganography in Blue Channel using AES and Secured Hash Function
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 2320 088X IMPACT FACTOR: 6.017 IJCSMC,
More informationRobust Steganography Using Texture Synthesis
Robust Steganography Using Texture Synthesis Zhenxing Qian 1, Hang Zhou 2, Weiming Zhang 2, Xinpeng Zhang 1 1. School of Communication and Information Engineering, Shanghai University, Shanghai, 200444,
More informationA Reversible Data Hiding Scheme for BTC- Compressed Images
IJACSA International Journal of Advanced Computer Science and Applications, A Reversible Data Hiding Scheme for BTC- Compressed Images Ching-Chiuan Lin Shih-Chieh Chen Department of Multimedia and Game
More informationA Grayscale Image Steganography Based upon Discrete Cosine Transformation
A Grayscale Image Steganography Based upon Discrete Cosine Transformation Chin-Chen Chang 1, Pei-Yu Lin, and Jun-Chou Chuang 3 1 Department of Information Engineering and Computer Science, Feng Chia University,
More informationData Hiding in Video
Data Hiding in Video J. J. Chae and B. S. Manjunath Department of Electrical and Computer Engineering University of California, Santa Barbara, CA 9316-956 Email: chaejj, manj@iplab.ece.ucsb.edu Abstract
More informationA Video Watermarking Algorithm Based on the Human Visual System Properties
A Video Watermarking Algorithm Based on the Human Visual System Properties Ji-Young Moon 1 and Yo-Sung Ho 2 1 Samsung Electronics Co., LTD 416, Maetan3-dong, Paldal-gu, Suwon-si, Gyenggi-do, Korea jiyoung.moon@samsung.com
More informationMeaningful Shadows for Image Secret Sharing with Steganography and Authentication Techniques
Journal of Information Hiding and Multimedia Signal Processing 2014 ISSN 2073-4212 Ubiquitous International Volume 5, Number 3, July 2014 Meaningful Shadows for Image Secret Sharing with Steganography
More informationBlind watermarking of 3D shapes using localized constraints
Blind watermarking of 3D shapes using localized constraints Adrian G. Bors Dept. of Computer Science, University of York, York YO DD, U.K. E-mail: adrian.bors@cs.york.ac.uk Abstract This paper develops
More informationCOPYRIGHT PROTECTION OF PALETTE IMAGES BY A ROBUST LOSSLESS VISIBLE WATERMARKING TECHNIQUE *
COPYRIGHT PROTECTION OF PALETTE IMAGES BY A ROBUST LOSSLESS VISIBLE WATERMARKING TECHNIQUE * Pei-Pei Chen ( 陳佩貝 ) 1 and Wen-Hsiang Tsai ( 蔡文祥 ) 1, 2 1 Dept. of Computer Science, National Chiao Tung University,
More informationMultimedia Security: So What s the Big Deal?
Multimedia Security: So What s the Big Deal? Edward J. Delp Purdue University School of Electrical and Computer Engineering Video and Image Processing Laboratory (VIPER) West Lafayette, Indiana email:
More informationSpectral Graph-Theoretic Approach to 3D Mesh Watermarking
Spectral Graph-Theoretic Approach to 3D Mesh Watermarking Emad E. Abdallah Department of Computer Science Concordia University, Montreal, Canada ee abdal@cs.concordia.ca A. Ben Hamza and Prabir Bhattacharya
More informationCOMPRESSING MATERIAL AND TEXTURE ATTRIBUTES FOR TRIANGULAR MESHES
COMPRESSING MATERIAL AND TEXTURE ATTRIBUTES FOR TRIANGULAR MESHES Guoping Wang 1, Yongzhen Wu 1, Guojing Hu 1, Jingliang Peng,, Member, IEEE 1 Beijing Engineering Research Center of Virtual Simulation
More informationA DWT and DCT based Hybrid Approach for Audio Watermarking
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 2320 088X IJCSMC, Vol. 3, Issue.
More informationDigital Image Steganography Using Bit Flipping
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 18, No 1 Sofia 2018 Print ISSN: 1311-9702; Online ISSN: 1314-4081 DOI: 10.2478/cait-2018-0006 Digital Image Steganography Using
More informationImplementation of Security in Cloud Systems Based using Encryption and Steganography
Implementation of Security in Cloud Systems Based using Encryption and Steganography 1 A.Mahesh Babu, 2 G.A. Ramachandra, 3 M.Suresh Babu 1,2 Department of Computer Science & Technology, Sri Krishnadevaraya
More informationEMPIRICAL ANALYSIS ON STEGANOGRAPHY USING JSTEG, OUTGUESS 0.1 AND F5 ALGORITHMS
EMPIRICAL ANALYSIS ON STEGANOGRAPHY USING JSTEG, OUTGUESS 0.1 AND F5 ALGORITHMS Dr. N.MANOHARAN 1 Dr.R.BALASUBRAMANIAN 2 S.UMA NANDHINI 3 V.SUJATHA 4 1 Assistant Professor in Department of Computer Science,
More informationHiding of Random Permutated Encrypted Text using LSB Steganography with Random Pixels Generator
Hiding of Random Permutated Encrypted Text using LSB Steganography with Random Pixels Generator Noor Kareem Jumaa Department of Computer Technology Engineering Al-Mansour University College, Iraq ABSTRACT
More informationAbstract. Keywords: Genetic Algorithm, Mean Square Error, Peak Signal to noise Ratio, Image fidelity. 1. Introduction
A Report on Genetic Algorithm based Steganography for Image Authentication by Amrita Khamrui Enrolled Scholar Department of Computer Science & Engineering, Kalyani University Prof. (Dr.) J K Mandal Professor
More informationIncreasing Robustness of LSB Audio Steganography Using a Novel Embedding Method
ShriRam College of Engineering & Management 1 Increasing Robustness of LSB Audio Steganography Using a Novel Embedding Method Rinki Baghel Pragya Sharma Abstract In this paper, we present a novel high
More informationImage Error Concealment Based on Watermarking
Image Error Concealment Based on Watermarking Shinfeng D. Lin, Shih-Chieh Shie and Jie-Wei Chen Department of Computer Science and Information Engineering,National Dong Hwa Universuty, Hualien, Taiwan,
More informationAn Information Hiding Scheme Based on Pixel- Value-Ordering and Prediction-Error Expansion with Reversibility
An Information Hiding Scheme Based on Pixel- Value-Ordering Prediction-Error Expansion with Reversibility Ching-Chiuan Lin Department of Information Management Overseas Chinese University Taichung, Taiwan
More informationDigital image steganography using LSB substitution, PVD, and EMD
Digital image steganography using LSB substitution, PVD, and EMD Anita Pradhan, K. Raja Sekhar, Gandharba Swain* Department of Computer Science and Engineering, K L University, Vaddeswaram-522502, Andhra
More informationVARIABLE RATE STEGANOGRAPHY IN DIGITAL IMAGES USING TWO, THREE AND FOUR NEIGHBOR PIXELS
VARIABLE RATE STEGANOGRAPHY IN DIGITAL IMAGES USING TWO, THREE AND FOUR NEIGHBOR PIXELS Anita Pradhan Department of CSE, Sri Sivani College of Engineering, Srikakulam, Andhra Pradesh, India anita.pradhan15@gmail.com
More informationResearch Article A Novel Image Data Hiding Scheme with Diamond Encoding
Hindawi Publishing Corporation EURASIP Journal on Information Security Volume 9, Article ID 65847, 9 pages doi:.55/9/65847 Research Article A Novel Image Data Hiding Scheme with Diamond Encoding Ruey-Ming
More informationResearch Article Improvements in Geometry-Based Secret Image Sharing Approach with Steganography
Hindawi Publishing Corporation Mathematical Problems in Engineering Volume 2009, Article ID 187874, 11 pages doi:10.1155/2009/187874 Research Article Improvements in Geometry-Based Secret Image Sharing
More informationWatermarking 3D images and 3D meshes
Watermarking 3D images and Applications for cultural heritage William PUECH LIRMM Laboratoire d Informatique, de Robotique et de Microélectronique de Montpellier UMR 5506 CNRS, University of Montpellier,
More informationOptimized Watermarking Using Swarm-Based Bacterial Foraging
Journal of Information Hiding and Multimedia Signal Processing c 2009 ISSN 2073-4212 Ubiquitous International Volume 1, Number 1, January 2010 Optimized Watermarking Using Swarm-Based Bacterial Foraging
More informationHybrid Stegnography using ImagesVaried PVD+ LSB Detection Program
www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume 4 Issue 5 May 2015, Page No. 12086-12090 Hybrid Stegnography using ImagesVaried PVD+ LSB Detection Program Shruti
More informationReversible Texture Synthesis for Data Security
Reversible Texture Synthesis for Data Security 1 Eshwari S. Mujgule, 2 N. G. Pardeshi 1 PG Student, 2 Assistant Professor 1 Computer Department, 1 Sanjivani College of Engineering, Kopargaon, Kopargaon,
More informationCOMPARISONS OF DCT-BASED AND DWT-BASED WATERMARKING TECHNIQUES
COMPARISONS OF DCT-BASED AND DWT-BASED WATERMARKING TECHNIQUES H. I. Saleh 1, M. E. Elhadedy 2, M. A. Ashour 1, M. A. Aboelsaud 3 1 Radiation Engineering Dept., NCRRT, AEA, Egypt. 2 Reactor Dept., NRC,
More informationA 3D Mesh Watermarking Based on Improved Vertex Grouping and Piecewise Mapping Function
Journal of Information Hiding and Multimedia Signal Processing c 2017 ISSN 2073-4212 Ubiquitous International Volume 8, Number 1, January 2017 A 3D Mesh Watermarking Based on Improved Vertex Grouping and
More informationEfficient & Secure Data Hiding Using Secret Reference Matrix
Efficient & Secure Data Hiding Using Secret Reference Matrix Laxman Tawade 1, Rajshree Mahajan 2, Chandan Kulthe 3 1 Department of Electronic and Telecommunication Engineering, Pune University, India 2,3
More informationSECURE DATA EMBEDDING USING REVERSIBLE DATA HIDING FOR ENCRYPTED IMAGES
VOL., NO. 7, APRIL 5 ISSN 89-668 6-5 Asian Research Publishing Network (ARPN). All rights reserved. SECURE DATA EMBEDDING USING REVERSIBLE DATA HIDING FOR ENCRYPTED IMAGES R. Selveeswari and P. R. Vijayalakshmi
More informationError-Free correlation in Encrypted Attack Traffic by Watermarking flow through Stepping Stones
e t International Journal on Emerging Technologies 6(2): 235-239(2015) ISSN No. (Print) : 0975-8364 ISSN No. (Online) : 2249-3255 Error-Free correlation in Encrypted Attack Traffic by Watermarking flow
More informationSTEGANOGRAPHIC SECURE DATA COMMUNICATION USING ZIGBEE
STEGANOGRAPHIC SECURE DATA COMMUNICATION USING ZIGBEE MR.NITIN B.NAIK, MRS.ARCHANA NITIN NAIK Vice-Principal, Sharad Institute of Technology,Polytechnic, Yadrav,Dist.Kolhapur(Maharashtra),India HOD E&TC,
More informationCovert Communication with Authentication via Software Programs Using Invisible ASCII Codes --- A New Approach
Covert Communication with Authentication via Software Programs Using Invisible ASCII Codes --- A New Approach I-Shi Lee Dept. of Computer Science, National Chiao Tung University, Hsinchu, Taiwan 30010
More informationSTEGANALYSIS OF STEGOSTORAGE SYSTEM
t m Mathematical Publications DOI: 10.1515/tmmp-2015-0049 Tatra Mt. Math. Publ. 64 (2015), 205 215 STEGANALYSIS OF STEGOSTORAGE SYSTEM Michala Gulášová Matúš Jókay ABSTRACT. The aim of this contribution
More informationA reversible data hiding based on adaptive prediction technique and histogram shifting
A reversible data hiding based on adaptive prediction technique and histogram shifting Rui Liu, Rongrong Ni, Yao Zhao Institute of Information Science Beijing Jiaotong University E-mail: rrni@bjtu.edu.cn
More informationAN IMPROVISED LOSSLESS DATA-HIDING MECHANISM FOR IMAGE AUTHENTICATION BASED HISTOGRAM MODIFICATION
AN IMPROVISED LOSSLESS DATA-HIDING MECHANISM FOR IMAGE AUTHENTICATION BASED HISTOGRAM MODIFICATION Shaik Shaheena 1, B. L. Sirisha 2 VR Siddhartha Engineering College, Vijayawada, Krishna, Andhra Pradesh(520007),
More informationRandom Image Embedded in Videos using LSB Insertion Algorithm
Random Image Embedded in Videos using LSB Insertion Algorithm K.Parvathi Divya 1, K.Mahesh 2 Research Scholar 1, * Associate Professor 2 Department of Computer Science and Engg, Alagappa university, Karaikudi.
More informationChaos-based Modified EzStego Algorithm for Improving Security of Message Hiding in GIF Image
015 International Conference on Computer, Control, Informatics and Its Applications Chaos-based Modified EzStego Algorithm for Improving Security of Message Hiding in GIF Image Rinaldi Munir Informatics
More informationA Formula Diamond Encoding Data Hiding Scheme
Journal of Information Hiding and Multimedia Signal Processing c 2015 ISSN 2073-4212 Ubiquitous International Volume 6, Number 6, November 2015 A Formula Diamond Encoding Data Hiding Scheme Wen-Chung Kuo
More informationComparision in cover media under Stegnography Digital media by Hide and Seek Approach
Comparision in cover media under Stegnography Digital media by Hide and Seek Approach Shruti Deptt. Of Computer science Guru Nank Dev University Gurdaspur, India Abstract:-Although every people have secrets
More informationA BTC-COMPRESSED DOMAIN INFORMATION HIDING METHOD BASED ON HISTOGRAM MODIFICATION AND VISUAL CRYPTOGRAPHY. Hang-Yu Fan and Zhe-Ming Lu
International Journal of Innovative Computing, Information and Control ICIC International c 2016 ISSN 1349-4198 Volume 12, Number 2, April 2016 pp. 395 405 A BTC-COMPRESSED DOMAIN INFORMATION HIDING METHOD
More informationA Framework to Reversible Data Hiding Using Histogram-Modification
A Framework to Reversible Data Hiding Using Histogram-Modification R. Neeraja 1 PG Student, ECE Department Gokula Krishna College of Engineering Sullurpet, India e-mail:r.p.neeru@gmail.com M. Gnana Priya
More informationUse of Visual Cryptography and Neural Networks to Enhance Security in Image Steganography
Use of Visual Cryptography and Neural Networks to Enhance Security in Image Steganography K.S.Seethalakshmi (Department of Computer Science and Engineering, RVCE / VTU, INDIA) ABSTRACT : As a result of
More informationData Hiding in Color Images Using Modified Quantization Table
Data Hiding in Color Images Using Modified Quantization Table Neha Batra 1 Pooja Kaushik 2 1 Pursuing M.Tech, Dept., of ECE, MMU, Mullana, India 2 Assistant Professor, Dept., of ECE, MMU, Mullana, India
More informationSteganography by using Logistic Map Function and Cellular Automata
Research Journal of Applied Sciences Engineering and Technology 4(3): 4991-4995 01 ISSN: 040-7467 Maxwell Scientific Organization 01 Submitted: February 0 01 Accepted: April 30 01 Published: December 01
More informationAvailable online at ScienceDirect. The 4th International Conference on Electrical Engineering and Informatics (ICEEI 2013)
Available online at www.sciencedirect.com ScienceDirect Procedia Technology 11 ( 2013 ) 614 620 The 4th International Conference on Electrical Engineering and Informatics (ICEEI 2013) Reversible Fragile
More informationResearch Article A Novel Steganalytic Algorithm based on III Level DWT with Energy as Feature
Research Journal of Applied Sciences, Engineering and Technology 7(19): 4100-4105, 2014 DOI:10.19026/rjaset.7.773 ISSN: 2040-7459; e-issn: 2040-7467 2014 Maxwell Scientific Publication Corp. Submitted:
More informationInformation and Communications Security: Encryption and Information Hiding
Short Course on Information and Communications Security: Encryption and Information Hiding Tuesday, 10 March Friday, 13 March, 2015 Lecture 10: Information Hiding Contents Covert Encryption Principles
More informationFRAGILE WATERMARKING USING SUBBAND CODING
ICCVG 2002 Zakopane, 25-29 Sept. 2002 Roger ŚWIERCZYŃSKI Institute of Electronics and Telecommunication Poznań University of Technology roger@et.put.poznan.pl FRAGILE WATERMARKING USING SUBBAND CODING
More informationEnhanced Least Significant Bit Scheme Robust Against Chi-Squared Attack
2010 Fourth Asia International Conference on Mathematical/Analytical Modelling and Computer Simulation Enhanced Least Significant Bit Scheme Robust Against Chi-Squared Attack Masoud Afrakhteh Dept. of
More informationJeff Hinson CS525, Spring 2010
DIGITAL WATERMARKING Jeff Hinson CS525, Spring 2010 Outline Introduction Challenges Algorithms / Methods Detection Existing Programs Lessons Learned / Conclusion Questions Jeff Hinson CS525 Slide #1 Introduction
More informationPolygonal mesh watermarking using Laplacian coordinates
Eurographics Symposium on Geometry Processing 1 Olga Sorkine and Bruno Lévy (Guest Editors) Volume 9 (1), Number 5 Polygonal mesh watermarking using Laplacian coordinates Y. Yang and I. Ivrissimtzis School
More informationMultibit Embedding Algorithm for Steganography of Palette-Based Images
Multibit Embedding Algorithm for Steganography of Palette-Based Images Shoko Imaizumi and Kei Ozawa Graduate School of Advanced Integration Science, Chiba University 1 33 Yayoicho, Inage-ku, Chiba-shi,
More informationAnalysis of Steganography as a Security Technique
Analysis of Steganography as a Security Technique Anirudh Sohil Department of Information Technology BVCOE, New Delhi Abstract: Application developers faces many challenges while creating an application
More informationCopyright Protection for Digital Images using Singular Value Decomposition and Integer Wavelet Transform
I. J. Computer Network and Information Security, 2016, 4, 14-21 Published Online April 2016 in MECS (http://www.mecs-press.org/) DOI: 10.5815/ijcnis.2016.04.02 Copyright Protection for Digital Images using
More informationCombined Hashing/Watermarking Method for Image Authentication
Combined Hashing/Watermarking Method for Image Authentication Vlado Kitanovski, Dimitar Taskovski, and Sofija Bogdanova Abstract In this paper we present a combined hashing/watermarking method for image
More informationA New Approach to Compressed Image Steganography Using Wavelet Transform
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661,p-ISSN: 2278-8727, Volume 17, Issue 5, Ver. III (Sep. Oct. 2015), PP 53-59 www.iosrjournals.org A New Approach to Compressed Image Steganography
More informationA Image Steganography based on Non-uniform Rectangular Partition
120 A Image Steganography based on Non-uniform Rectangular Partition Venkata Ramesh Pokala Y. Dasradh Ram Reddy G. Srinivasa Reddy BVSR, Chimakurthy, A.P BVSR, Chimakurthy, A.P BVSR, Chimakurthy, A.P Abstract
More informationFiltering. -If we denote the original image as f(x,y), then the noisy image can be denoted as f(x,y)+n(x,y) where n(x,y) is a cosine function.
Filtering -The image shown below has been generated by adding some noise in the form of a cosine function. -If we denote the original image as f(x,y), then the noisy image can be denoted as f(x,y)+n(x,y)
More informationDATA hiding [1] and watermarking in digital images
14 IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, VOL. 6, NO. 1, MARCH 2011 Data Hiding in Motion Vectors of Compressed Video Based on Their Associated Prediction Error Hussein A. Aly, Member,
More informationLocal patch blind spectral watermarking method for 3D graphics
Local patch blind spectral watermarking method for 3D graphics Ming Luo 1, Kai Wang 2, Adrian G. Bors 1, and Guillaume Lavoué 2 1 Department of Computer Science, University of York, York YO10 5DD, UK 2
More informationAn Improvement Technique based on Structural Similarity Thresholding for Digital Watermarking
An Improvement Technique based on Structural Similarity Thresholding for Digital Watermarking Amin Banitalebi-Dehkordi1, Mehdi Banitalebi-Dehkordi2, Jamshid Abouei3, and Said Nader-Esfahani4 1 Department
More informationAuthentication of 3-D Polygonal Meshes
Authentication of 3-D Polygonal Meshes Hsueh-Yi Lin 1, Hong-Yuan Mark Liao 2, Chun-Shien Lu 2, and Ja-Chen Lin 1 1 Department of Computer and Information Science, National Chiao-Tung University, 1001 Ta
More informationAdaptive Fuzzy Watermarking for 3D Models
International Conference on Computational Intelligence and Multimedia Applications 2007 Adaptive Fuzzy Watermarking for 3D Models Mukesh Motwani.*, Nikhil Beke +, Abhijit Bhoite +, Pushkar Apte +, Frederick
More informationNew Technique for Encoding the Secret Message to Enhance the Performance of MSLDIP Image Steganography Method (MPK Encoding)
New Technique for Encoding the Secret to Enhance the Performance of Image Steganography Method (MPK Encoding) Abdelmgeid Amin Ali Associate Professor, Dept. of Computer Science Faculty of Science, Al -
More informationThree-Dimensional Meshes Watermarking: Review and Attack-Centric Investigation
Three-Dimensional Meshes Watermarking: Review and Attack-Centric Investigation Kai Wang 1, Guillaume Lavoué 1, Florence Denis 2, and Atilla Baskurt 1 1 LIRIS, UMR 5205 CNRS, INSA-Lyon, F-69621 Villeurbanne,
More informationQuality based JPEG Steganography using balanced Embedding Technique
Second International Conference on Emerging Trends in Engineering and Technology, ICETET-09 Quality based JPEG Steganography using balanced Embedding Technique Mohammed Ishaque Department of Computer Science
More information