A Multi-sprite Based Anaglyph 3D Video Watermarking Approach Robust Against Collusion

Dhaou, Dorra; Jabra, Saoussen Ben; Zagrouba, Ezzeddine

doi:10.1007/s13319-019-0231-1

Cited by 6 publications

(5 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This watermarking scheme is invisible and robust against geometric attacks, additional noise, filtering, frame-based attacks, and different video compression formats. In [282], a hybrid scheme using the DWT and the middle significant bit embedding (MIDSB) technique is proposed for improving the robustness of watermarks against collusion attacks. In this approach, the anaglyph 3D video is grouped into batches of 25 frames from which sprites (mosaic images) are generated, containing all data spread in the video sequence.…”

Section: D Mesh Mediamentioning

confidence: 99%

LSB Data Hiding in Digital Media: A Survey

Tran¹,

Zepernick²,

Chu³

2022

EAI Endorsed Transactions on Industrial Networks and Intelligen

View full text Add to dashboard Cite

Data hiding or information hiding is a prominent class of information security that aims at reliably conveying secret data embedded in a cover object over a covert channel. Digital media such as audio, image, video, and three-dimensional (3D) media can act as cover objects to carry such secret data. Digital media security has acquired tremendous significance in recent years and will be even more important with the development and delivery of new digital media over digital communication networks. In particular, least significant bit (LSB) data hiding is easy to implement and to combine with other hiding techniques, offers high embedding capacity for data, can resist steganalysis and several types of attacks, and is well suited for real-time applications. This article provides a comprehensive survey on LSB data hiding in digital media. The fundamental concepts and terminologies used in data hiding are reviewed along with a general data hiding model. The five attributes of data hiding, i.e., capacity, imperceptibility, robustness, detectability, and security, and the related performance metrics used in this survey to compare the characteristics of the different LSB data hiding methods are discussed. Given the classification of data hiding methods with respect to audio, image, video, and 3D media, a comprehensive survey of LSB data hiding for each of these four digital media is provided. In particular, landmark studies, state-of-the-art approaches, and applications of LSB data hiding are described for each of the four digital media. Their performance is compared with respect to the data hiding attributes which illustrates benefits and drawbacks of the reviewed LSB data hiding methods. The article concludes with summarizing main findings and suggesting directions for future research. This survey will be helpful for researchers and practitioners to keep abreast about the potential of LSB data hiding in digital media and to develop novel applications based on suitable performance trade-offs between data hiding attributes.

show abstract

Section: D Mesh Mediamentioning

confidence: 99%

LSB Data Hiding in Digital Media: A Survey

Tran¹,

Zepernick²,

Chu³

2022

EAI Endorsed Transactions on Industrial Networks and Intelligen

View full text Add to dashboard Cite

show abstract

“…Pick up two AC values from the location (7,8) and (8,8). If both these values are also zero then no change at all and it considered as both watermark bit have been inserted otherwise make them zero else if the watermark bits are the combination of 01 then check if (7,8) is lower than (8,8) then no change in the current AC values and considered as two values are entered otherwise make (7,8) must be less than (8,8) else if the watermark bits are the combination of 10 then check if (7,8) is greater than (8,8) then no change in the current AC values and considered as the pair of 10 is inserted otherwise make (7,8) greater than (8,8) else the remaining option is the pair of bits are 11 can be considered as inserted if both AC value are nonzero and equal. 6) If entire watermark bits have not exhausted then Go to step v-d to pick next DCT block to insert next three adjacent bit 7) AdjusteSeqRanSelected I-frame to their original sequential order and replaced watermarked I-frames with original one.…”

Section: Watermark Embedding Processmentioning

confidence: 99%

“…c) The odd value of DC extracted the watermark bit 1 else 0. Two more locations (7,8) and (8,8) are processed to getone pair of bits. If both ACvalues are also zero then increment the vector array of extracted watermark as 00 into 2 more adjacent location of an array.…”

Section: Watermark Extraction Process 1) Read Watermarked Videomentioning

confidence: 99%

“…If both ACvalues are also zero then increment the vector array of extracted watermark as 00 into 2 more adjacent location of an array. if (7,8) is lower than (8,8) then augmented the array with 01 else if (7,8) is greater than (8,8) then filled the array of next two location with 10 else if both AC value are nonzero then increment the array of extracted bits with 11.This method extracted three bits from the same DCT block. d) Choose another DCT block to extract three more bits.…”

Section: Watermark Extraction Process 1) Read Watermarked Videomentioning

confidence: 99%

“…But, actually, both are identical in nature and measured as the series of separate frames. Therefore, methods used for image watermarking [1][2][3][4] can also stretched to video watermarking scheme [5][6][7][8] also. Yet, the downside to use the original host signal for embedding is that the bit rate of watermarked contents is increased.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Compressed domain based robust digital video watermarking scheme to protect the copyright

Ahuja

Gupta

et al. 2021

IJEECS

View full text Add to dashboard Cite

<p><span>Digital video watermarking is an effective way to protect the ownership of the multimedia contents. A novel compressed domain based digital video watermarking algorithm scheme is proposed by exploiting MPEG-2 structure. Watermark bits are embedded in DC and AC coefficients both of only smooth discrete cosine transform (DCT) blocks from selected I-frames in the original digital video. The algorithms never exploited entire frames but explore only three location from the subset of DCT blocks from the subgroup of I-frames only. This process maintains the perceptibility of the watermarked video. Two parameters, normalized correlation (NC) and bit error rate (BER) are used to evaluate the degree of similarity and dissimilarity respectively to check the robustness against image processing and video specific intentional and non-intentional attacks. The security of embedded watermark is enhanced by applying three cryptographic keys. The experimental results demonstrated that the better robustness and perceptibility achieved by comparing the results with the state of art. </span></p>

show abstract