Standards compliant watermarking for access management
|
|
- Cameron Carr
- 8 years ago
- Views:
Transcription
1 Standards compliant watermarking for access management Viresh Ratnakar and Onur G. Guleryuz Epson Palo Alto Laboratory 3145 Porter Drive, Suite 104 Palo Alto, CA 94304, USA ABSTRACT We present standards-compliant visible watermarking schemes for digital images and video in DCT-based compressed formats. The watermarked data is in the same compressed format as the original and can be viewed with standard tools and applications. Moreover, for most of the schemes presented, the watermarked data has exactly the same compressed size as the original. The watermark can be inserted and removed using a key for applications requiring content protection. The watermark application and removal algorithms are very efficient and exploit some features of compressed data formats (such as JPEG and MPEG) which allow most of the work to be done in the compressed domain. Keywords: Visible watermarks, scrambler, discrete cosine transform, JPEG, MPEG, content protection. 1. INTRODUCTION Visible watermarks on digital image and video data can be used to prevent or discourage unauthorized use of the data. The watermark may be something simple and unobtrusive, such as a small logo in a corner of the image or frame. But such a watermark can easily be cropped away or concealed without a drastic loss in quality. At the other extreme, the entire image area may be corrupted in a manner that can be undone using a key. This would be similar to encrypting all the data, except that straight-forward encryption would not leave the data format-compliant. In this paper, we address a specific visible watermarking problem which lies in between these extremes, and propose a range of solutions for still images and video. The problem arises in several real and practical commercial imaging applications, and can be described as follows: Let us consider a still image, I (Figure 1 (a)). We would like to devise a keyed scrambling algorithm S such that I = S(I,K) is an image with the same dimensions as I, and is similar to I except in certain regions that form a distinctive pattern. In these regions comprising the visible watermark, the scrambled image I appears random or corrupted. The overall and intended effect is exemplified by the image in Figure 1 (b). The scrambling should be secure in the sense that without knowing the key K, an attacker should not be able to recover the original image from I. Moreover, the scrambling should be fully reversible, given the key. That is, a complementary descrambling algorithm D must exist such that D(I,K)isexactly the same as I. The objective in case of video is the same the scrambled video should be viewable, but should show a distinctive pattern corrupting parts of the video frames. For comparison, examples of two traditional visible watermarking schemes are also shown in Figure 1. Figure 1 (c) shows a blended visible watermark (this example was created by simple alpha-blending, but more secure schemes are also possible). This traditional approach to visible watermarks (, 1 3 for example) has the goal of applying a watermark that does not substantially degrade the quality of the image. Figure 1 (d) shows the simplest possible visible watermark a logo in a corner. Clearly, for uncompressed raw images the desired effect shown in Figure 1 (b) can be achieved, for example, by XORing the pixel values (within the pattern regions) with a keyed pseudo-random number sequence. The interesting case is that of (lossy) compressed data. Let us restrict our attention to still images for the time being; we will return to video towards the end of the paper. Our goal is to take a compressed image I, and scramble it to get I = S(I,K) which is also a valid image in the same compressed format and shows the distinctive pattern. Note that since we will only be dealing with compressed images, we have avoided complicating the notation and have not used any additional qualifiers such as c(i) to indicate compressed images. A nice feature of this format-compliant visible watermarking approach is that I can be viewed by any image viewer, and can also be passed through any compression-aware Further author information: {ratnakar,oguleryuz}@erd.epson.com
2 (a) Original (b) Desired obstructive visible watermark (c) Traditional blended visible watermark (d) Corner logo as visible watermark Figure 1. Different visible watermark possibilities. components of an imaging and/or networking system. But compression introduces a complication: if we take the approach of modifying raw pixels, then we would first have to decompress, then apply the modifications, and then compress again a lossy process. It would be hard to ensure that the original image can be recovered exactly upon subsequent descrambling. We present a scrambler S and descrambler D which solve this problem for Huffman-coded JPEG 4 images, and then discuss complications and partial solutions for extending the same approach to DCT-based video coding formats. Another desirable property of the scrambling algorithm would be that it introduces no coding overheads. That the size (in bytes) of I should be exactly the same as that of I. The main algorithm in this paper does achieve this property. We also describe a variant where a moderate size increase is incurred to make the watermark appear more strongly Applications We consider two sample applications, one for still images and one for video. Consider an Internet-based image shop which sells high-quality professional art that customers may purchase remotely and print. The customer runs an Internet client software to browse thumbnails of the artwork and retrieve the ones that he/she is interested in. When he/she retrieves a high-quality image, the server sends a watermarked image which he/she can view, but only in a much inferior version because of the obtrusive visible watermark. Upon providing the correct key, the client may have an integrated descrambler and printer-driver, which will print the image free of the watermark. We do not address key management issues in this paper, as that will be a part of the overall needs of the system. The key in this system, for example, can be session-based, to be retrieved securely by the client software upon the customer s payment.
3 The advantage of using this visible watermarking scheme in the above system, as opposed to simple encryption of the whole image, is that the client software can display the watermarked image. Moreover, standard technologies for retrieving content over the Internet can be used, with the knowledge that cached copies of the artwork (in the network as well as the client s local disk cache) will only be of marginal value because of the obstructive watermark. For video, the sample application would be delivery over satellite or cable networks. Again, the scrambled video can be viewed to get a flavour of the content without revealing all of it. Paying customers may retrieve the keys needed to descramble and view the unwatermarked video. 2. JPEG REVIEW The JPEG image compression standard is widely used for efficient storage and tranmission of images. The techniques discussed in this paper utilize certain properties of the JPEG format. In this section, we review the core concepts of JPEG, emphasizing those pertinent to our visible watermarking techniques. A JPEG image consists of 8 8 blocks which have been transformed using the Discrete Cosine Transform 5 (DCT), quantized using a table of 64 scalar quantizers, and then entropy-coded. The 8 8 blocks of the image are grouped into Minimum Coded Units or MCUs. Each MCU corresponds to an equal area of the image, with the dimensions of this area being multiples of 8. The number of 8 8 blocks from different color planes that comprise an MCU may be different, depending upon subsampling. Subsampling details can be found in any JPEG reference, such as. 6 For our purpose, it is sufficient to summarize the structure of a JPEG image I consisting of N color planes as follows: 1. I is a sequence of coded MCUs. There are h rows of w MCUs each. The MCUs are coded in raster order. 2. Each MCU consists of m n 8 8 blocks from color component number n (0 n<n). 3. An MCU is coded by coding the m 0 blocks from color component number 0 (in raster order within the MCU), then the m 1 blocks from component 1, and so on. It is useful for us to consider this JPEG image structure in a color component-wise manner. That is, we look at the 8 8 blocks for each (potentially subsampled) color component separately, and in the relative order in which they would be found within the JPEG format. This simplifies our presentation as we do not have to refer to further details about MCUs. Let F n,k denote the 8 8 block (of quantized coefficients) numbered k from color component number n. This notation has absorbed the fact that k is not necessarily the raster index of the block, because of subsampling and MCU structure. Here, 0 n<n and 0 k<whm k. We illustrate this notation in Figure 2, which shows the three color planes of a typical JPEG image in Y,Cb,Cr format where the chrominance components (Cb and Cr) are subsampled by 2 both horizontally and vertically. The blocks lying on the pattern are shown shaded. The image width is 160, MCUs are areas of the image. Let F n,k (z) denote coefficient number z (0 z 63) in the zig-zag order used in JPEG. The first coefficient, F n,k (0) is called the DC coefficient as it is the scaled average of all the pixel values in the 8 8block. The DC values within each color plane s blocks are differentially coded in JPEG, to exploit correlation across blocks. Thus, for k>0, the value coded in the bitstream is F n,k (0) F n,k 1 (0). Let us denote this differential DC value by D n,k, keeping in mind that D n,0 = F n,0 (0). The JPEG standard allows either Huffman coding or arithmetic coding to be used for entropy coding. We restrict our attention to Huffman-coded images as Huffman coding is the chosen alternative most of the time. In a Huffmancoded JPEG image, differential DC values D n,k are coded as follows. Given a value v to code, let s(v) denote the magnitude category of v, which is the number of bits in v up to the most significant 1. For example, s(0) = 0, s(1) = s( 1) = 1, s(3) = s(2) = s( 2) = s( 3) = 2, and so on. The JPEG bitstream consists of a Huffman code for s(d n,k ), followed by s(d n,k ) least significant bits from the 1 s complement representation of D n,k. The DC Huffman coding tables may be different for different color components, or some of them may be the same. The coding of AC coefficients (1 z 63) also uses the magnitude category function s( ). Additionally, the frequently occurring situation of long runs of zeros within AC coefficient sequences is also exploited in the JPEG format. For the sequence of AC coefficients in a block F n,k, consider the representation (R 0,V 0 ), (R 1,V 1 ),...,(R l,v l ).
4 Figure 2. The block ordering notation used in the paper, illustrated using a Y-Cb-Cr JPEG image with width 160 and chrominance subsampled by 2 horizontally and vertically. The thicker lines separate MCUs while the thinner lines separate the 8 8 blocks within the Y-component of the MCU. Each Cb and Cr MCU consists of only one 8 8 block. The shaded blocks are the ones lying on the watermark pattern. Here, R 0 is the length of the run of zeros leading to the first non-zero coefficient (which has the value V 0 ). This is followed by a run of R 1 zeros and then another non-zero value (V 1 ), and so on. The JPEG bitstream consists of Huffman codes for pairs of (R i,s(v i )). Each such code is followed by s(v i ) additional bits taken from the least significant positions in the 1 s complement representation of V i. The AC Huffman coding tables may also be different for different color components. In this review, we have omitted some concepts such as end-of-block codes and restart markers. These concepts are easily incorporated in the techniques we describe, but a detailed exposition would only complicate the presentation. 3. THE SCRAMBLING ALGORITHM In the scrambling process, our goal is to corrupt those 8 8 blocks which lie in the pattern area, while making sure that the decoded image will not be corrupted outside the pattern areas. We also have to ensure that this corruption can be undone by the descrambler. Let ρ(n, k) be a binary function that is 1 if and only if F n,k (block number k from component number n) lies in the pattern region. The function ρ (and hence the pattern) is not a secret, and is available to any attacker. Our scrambling algorithm efficiently produces a JPEG image I = S(I,K) such that I and I are exactly the same for MCUs where ρ(i, j) is 0, and are distinctively different where ρ(i, j) is 1. In other words, the blocks where ρ is 1 are scrambled by S. The descrambler D reverses the scrambling completely, with the right key. The scrambling algorithm consists of a set of operations. In a practical implementation, these operations are applied in a single pass through the image. Here, we present the operations separately, for clarity. The scrambling and descrambling algorithms use a common pseudo random number generator (PRNG) whose seed is the secret key. We will use the PRNG to generate masking values as well as random permutations and selections. To keep the notation simple, we will simply use the subscript PRNG to indicate that a value, permutation, or selection has been obtained by invoking the PRNG.
5 3.1. AC masks For each block F n,k for which ρ(n, k) = 1, we can mask the magnitude bits of the AC coefficients by XORing with a value obtained from the PRNG. Recall that the AC coefficients are coded by grouping them into run-value pairs, (R i,v i ) and that the coded bitstream consists of a Huffman code for (R i,s(v i )) followed by s(v i ) bits from the least significant positions of the 1 s complement representation of V i. Let s refer to these s(v i ) bits as B. Then, the AC masking operation consists of replacing B with B X PRNG, where X PRNG represents random values. This maintains format compliance and does not change the size of the coded image. It is evident that the descrambler can reverse this by XORing again with X PRNG AC swaps Since the AC coefficients are coded independently from block to block, we can swap the entirety of the AC coefficients across any two blocks for which ρ is 1. That is, if ρ(n, k 1 )=ρ(n, k 2 ) = 1, then we can exchange F n,k1 (1,...,63) with F n,k2 (1,...,63). This would not change the bit rate at all. In fact, if the AC Huffman tables for two color components are the same (as is usually the case for the chrominance components Cb and Cr in JPEG images), then the swaps can be done across these components too. In practice, we choose to do the swaps within a small number of rows of MCUs, to minimize the buffering requirements of the scrambler and descrambler. Thus, the AC-swap operation consists of selecting (using the PRNG) a number of pairs of blocks F n1,k 1,F n2,k 2 constrained to lie within a buffered amount of MCU rows and such that both the selected blocks lie in the pattern and use the same AC Huffman table. For each such pair, all the AC coefficients are exchanged. The previous two operations modify the AC coefficients. In practice, the impact upon visiblity of modifications to DC coefficients is far more than AC coefficients. The next two operations modify the DC coefficients DC shuffles Consider (within color component number n), a maximal consecutive sequence of l blocks F n,k,f n,k+1,..., F n,k+l 1, each lying on the pattern. This is maximal in the sense that ρ(n, k 1) = ρ(n, k + l) =0andρ(n, i) =1for k i<k+ l. The DC-shuffle operation corrupts the DC value of each block in the sequence, ensuring that the DC value for the first block after the sequence remains unchanged, and that the bits required remain the same, by shuffling the differential DC values. Recall that we use the notation D n,k to denote the differential DC value for F n,k. It is apparent that the DC value for the block after the sequence is given by Equation 1: k+l F n,k+l (0) = F n,k 1 (0) + D n,i. (1) Thus, as long as we do not change the value of the sum k+l i=k D n,i, we are free to change the individual D n,i values without affecting the DC value of the first block after the sequence. Moreover, if our changes are made by simply permuting the D n,i, then the bit rate will also be exactly the same. The DC-shuffle operation generates a random permutation σ PRNG and applies it to the sequence of D n,i values, k i k + l. Note that the differential DC value of the first block after the sequence also participates in this permutation, but the net result is that its DC value (actual, not differential) is unchanged DC bit-shuffles Figure 3 shows the sequence of DC values identified in the previous subsection. Here, the first l blocks are the ones to be corrupted, while the block F n,k+l has ρ(n, k + l) = 0 and needs to be left unmodified upon decompression. In the figure, we have shown 1 and 0 bit-values starting from the rightmost column (numbered 0) upto the column number corresponding to the magnitude category of the differential DC value. Thus, in the row for D n,i all columns numbered s(d n,i ) and greater are marked by X to indicate that these bits are not present in the bit-stream. i=k
6 Figure 3. The magnitude bits for a sequence of differential DC values. Let s look at the bit-wise composition of the D n,i values in this sequence of blocks, k i k +l. For the moment, we drop the subscript n for simplicity, and let s i denote s(d n,i ). Further, let b i (j), (0 j<s i ) denote the s i bits of the 1 s complement representation of D n,i. Then, s i 1 D n,i =[b i (s i 1) 1][2 si 1] + b i (j)2 j. (2) Here, the first term just makes sure that if the left-most bit (i.e., bit number s i 1) is 0, then the appropriate negative number is obtained (by subtracting 2 si 1). We can rewrite Equation 2 as: s i 2 D n,i =1 2 si + b i (s i 1)[3 2 si 1 1] + b i (j)2 j. (3) Observe that because of the 1 s complement representation, the left-most bit b i (s i 1) of each D n,i has a disproportionate weight. By substituting the value of D n,i from Equation 3 into Equation 1, it can be seen that the DC value of the first block after the sequence, i.e., F n,k+l (0) is a constant plus a weighted sum of all the b i (j) values, with the weight being 2 j for bits other than the left-most ones. The weight of each left-most bit is 3 2 j 1 1. Thus, we can apply bit-plane permutations to these bits, while keeping F n,k+l (0) unchanged, as long as we are careful about not mixing left-most bits with non-left-most bits. Let q denote the maximum value of s i,for k i k + l. Then, for each bit-plane j, (0 j<q), we apply two pseudo-random permutations within the b i (j) values: σ PRNG (j) andπ PRNG (j). In the first permutation, σ PRNG (j), only those bits from bit-plane j particpate which are the left-most bits. That is, only the b i (j) for which s i 1=j participate in σ PRNG (j). The non-left-most bits participate in the second permutation. That is only the b i (j) for which s i 1 >jparticipate in π PRNG (j). It can be seen that applying these 2q permutations (two disjoint permutations σ PRNG (j) andπ PRNG (j) oneach bit-plane) ensures that the DC values within the pattern areas are corrupted securely, while the DC value of the first following block is untouched. Moreover, the coded size remains exactly the same as it was prior to this operation We have now described all the four operations that are applied within our scrambling algorithm S. The descrambler D is straight-forward, as it merely has to apply the inverse operations. We have carefully designed these j=0 j=0
7 Figure 4. The result of applying the scrambling algorithm. operations such that they are reversible the determinations made during scrambling (such as the s(d n,i ) values) are not affected by the scrambling and hence can be repeated by the descrambler with identical results. Figure 4 shows the result of applying these four operations on the test image that we used in Figure A variant with modest size increase We have been very careful in the previous four operations to ensure that the compressed size of the scrambled image I is exactly the same as that of the original image I. Sometimes, this may not be a strict requirement, and it may be acceptable to incur a modest increase in size. In such situations, we can increase the visibility of the watermark considerably, by one additional operation. Here, we just add a pseudo random number to each DC value within the pattern region. Thus, if ρ(n, k) = 1, then we set F n,k (0) = F n,k (0) + X PRNG, where X PRNG can be positive or negative. Note that this is a reversible operation. Since we are modifying the actual DC value, the differential DC values will also change. Moreover, the changes are not guaranteed to maintain the compressed size. Indeed, as we are increasing the randomness of the DC coefficient differentials, the compressed size will increase. By placing limits on the additive value X PRNG, we can keep this size increase small. 4. VIDEO DATA In case of DCT-coded video data, such as in the various MPEG formats (for example, MPEG-1 7,8 ), motion prediction causes a problem. If we apply the still-image scrambler described here to MPEG video, then blocks outside the pattern (for which ρ is 0) may still show corruption because their motion vectors may require prediction from areas of other frames which have been corrupted. Thus, the distinctive pattern would show in the video, but there would be additional corruption outside the pattern. This additional corruption may be small or extensive, depending upon the video sequence and block-matching algorithms used during coding. One way to alleviate this problem is to only apply the scrambling to bidirectional-coded frames (B-frames) as these themselves are not used for predicting any blocks on other frames. Typically, B-frames form a significant fraction of all frames, and in such cases, the desired effect is obtained (the pattern shows up distinctively, albeit in a flashing manner). But sometimes, video sequences are coded without any B-frames at all. In such cases the only frames which can be properly corrupted (without the corruption propogating to arbitrary areas on other frames) are those unidirectionally predicted frames (P-frames) which lie just before a non-predicted frame (I-frame). 5. CONCLUSION We have presented obstructive visible watermarking schemese that leave the data format compliant. The scrambling and descrambling algorithms are very efficient and work mostly in the compressed domain they operate on DCT coefficients obtained by decoding the Huffman codes, and do not require these coefficients to be de-zigzagged or
8 dequantized. In fact, not only is de-zigzagging not needed, the algorithms only examine the compact sequence of non-zero coefficients within each block. A nice feature of the each of the four main scrambling operations presented is that they do not change the compressed size even by one bit. It would be interesting to see if there are any more possible operations that have this property one possibility is to make the operations intelligently use the details of the Huffman tables used in the image to make changes such that the rate does not increase. The general problem for coded video appears hard to solve; we have only sketched some restricted solutions for video. REFERENCES 1. Chen, Pei-Min, A visible watermarking mechanism using a statistic approach, 5th International Conference on Signal Processing 2, pp , Mohanty, S.P., Ramakrishnan, K.R., and Kankanhalli, M.S., A DCT domain visible watermarking technique for images, IEEE International Conference on Multimedia and Expo 2, pp , Meng, J. and Chang, Shih-F, Embedding visible video watermarks in the compressed domain, International Conference on Image Processing 1, pp , ISO JPEG Draft International Standard and CCITT Recommendation T Ahmed, N., Natarajan, T., and Rao, K. R., Discrete Cosine Transform, IEEE Trans. Computers C , Jan Pennebaker, W. B. and Mitchell, J. L., JPEG Still Image Data Compression Standard, Van Nostrand Reinhold, New York, MPEG I draft: Coding of Moving Pictures and associated audio for digital storage, Document ISO/IEC- CD Le Gall, D., MPEG: A Video Compression Standard for Multimedia Applications, Commun. ACM 34, April 1991.
JPEG Image Compression by Using DCT
International Journal of Computer Sciences and Engineering Open Access Research Paper Volume-4, Issue-4 E-ISSN: 2347-2693 JPEG Image Compression by Using DCT Sarika P. Bagal 1* and Vishal B. Raskar 2 1*
More informationFigure 1: Relation between codec, data containers and compression algorithms.
Video Compression Djordje Mitrovic University of Edinburgh This document deals with the issues of video compression. The algorithm, which is used by the MPEG standards, will be elucidated upon in order
More informationA comprehensive survey on various ETC techniques for secure Data transmission
A comprehensive survey on various ETC techniques for secure Data transmission Shaikh Nasreen 1, Prof. Suchita Wankhade 2 1, 2 Department of Computer Engineering 1, 2 Trinity College of Engineering and
More informationVideo-Conferencing System
Video-Conferencing System Evan Broder and C. Christoher Post Introductory Digital Systems Laboratory November 2, 2007 Abstract The goal of this project is to create a video/audio conferencing system. Video
More informationVideo Coding Basics. Yao Wang Polytechnic University, Brooklyn, NY11201 yao@vision.poly.edu
Video Coding Basics Yao Wang Polytechnic University, Brooklyn, NY11201 yao@vision.poly.edu Outline Motivation for video coding Basic ideas in video coding Block diagram of a typical video codec Different
More informationVideo Authentication for H.264/AVC using Digital Signature Standard and Secure Hash Algorithm
Video Authentication for H.264/AVC using Digital Signature Standard and Secure Hash Algorithm Nandakishore Ramaswamy Qualcomm Inc 5775 Morehouse Dr, Sam Diego, CA 92122. USA nandakishore@qualcomm.com K.
More informationStatistical Modeling of Huffman Tables Coding
Statistical Modeling of Huffman Tables Coding S. Battiato 1, C. Bosco 1, A. Bruna 2, G. Di Blasi 1, G.Gallo 1 1 D.M.I. University of Catania - Viale A. Doria 6, 95125, Catania, Italy {battiato, bosco,
More informationCM0340 SOLNS. Do not turn this page over until instructed to do so by the Senior Invigilator.
CARDIFF UNIVERSITY EXAMINATION PAPER Academic Year: 2008/2009 Examination Period: Examination Paper Number: Examination Paper Title: SOLUTIONS Duration: Autumn CM0340 SOLNS Multimedia 2 hours Do not turn
More informationhttp://www.springer.com/0-387-23402-0
http://www.springer.com/0-387-23402-0 Chapter 2 VISUAL DATA FORMATS 1. Image and Video Data Digital visual data is usually organised in rectangular arrays denoted as frames, the elements of these arrays
More informationWhite paper. H.264 video compression standard. New possibilities within video surveillance.
White paper H.264 video compression standard. New possibilities within video surveillance. Table of contents 1. Introduction 3 2. Development of H.264 3 3. How video compression works 4 4. H.264 profiles
More informationData Storage. Chapter 3. Objectives. 3-1 Data Types. Data Inside the Computer. After studying this chapter, students should be able to:
Chapter 3 Data Storage Objectives After studying this chapter, students should be able to: List five different data types used in a computer. Describe how integers are stored in a computer. Describe how
More informationImage Compression through DCT and Huffman Coding Technique
International Journal of Current Engineering and Technology E-ISSN 2277 4106, P-ISSN 2347 5161 2015 INPRESSCO, All Rights Reserved Available at http://inpressco.com/category/ijcet Research Article Rahul
More informationConceptual Framework Strategies for Image Compression: A Review
International Journal of Computer Sciences and Engineering Open Access Review Paper Volume-4, Special Issue-1 E-ISSN: 2347-2693 Conceptual Framework Strategies for Image Compression: A Review Sumanta Lal
More informationWATERMARKING FOR IMAGE AUTHENTICATION
WATERMARKING FOR IMAGE AUTHENTICATION Min Wu Bede Liu Department of Electrical Engineering Princeton University, Princeton, NJ 08544, USA Fax: +1-609-258-3745 {minwu, liu}@ee.princeton.edu ABSTRACT A data
More informationANALYSIS OF THE EFFECTIVENESS IN IMAGE COMPRESSION FOR CLOUD STORAGE FOR VARIOUS IMAGE FORMATS
ANALYSIS OF THE EFFECTIVENESS IN IMAGE COMPRESSION FOR CLOUD STORAGE FOR VARIOUS IMAGE FORMATS Dasaradha Ramaiah K. 1 and T. Venugopal 2 1 IT Department, BVRIT, Hyderabad, India 2 CSE Department, JNTUH,
More informationData Storage 3.1. Foundations of Computer Science Cengage Learning
3 Data Storage 3.1 Foundations of Computer Science Cengage Learning Objectives After studying this chapter, the student should be able to: List five different data types used in a computer. Describe how
More informationStudy and Implementation of Video Compression Standards (H.264/AVC and Dirac)
Project Proposal Study and Implementation of Video Compression Standards (H.264/AVC and Dirac) Sumedha Phatak-1000731131- sumedha.phatak@mavs.uta.edu Objective: A study, implementation and comparison of
More informationAn Incomplete Cryptography based Digital Rights Management with DCFF
An Incomplete Cryptography based Digital Rights Management with DCFF Ta Minh Thanh Department of Computer Science Tokyo Institute of Technology 2-12-2, Ookayama, Meguro, Tokyo, 152-8552, Japan. Email:thanhtm@ks.cs.titech.ac.jp
More informationModule 8 VIDEO CODING STANDARDS. Version 2 ECE IIT, Kharagpur
Module 8 VIDEO CODING STANDARDS Version ECE IIT, Kharagpur Lesson H. andh.3 Standards Version ECE IIT, Kharagpur Lesson Objectives At the end of this lesson the students should be able to :. State the
More informationA Robust and Lossless Information Embedding in Image Based on DCT and Scrambling Algorithms
A Robust and Lossless Information Embedding in Image Based on DCT and Scrambling Algorithms Dr. Mohammad V. Malakooti Faculty and Head of Department of Computer Engineering, Islamic Azad University, UAE
More informationJPEG compression of monochrome 2D-barcode images using DCT coefficient distributions
Edith Cowan University Research Online ECU Publications Pre. JPEG compression of monochrome D-barcode images using DCT coefficient distributions Keng Teong Tan Hong Kong Baptist University Douglas Chai
More informationInformation, Entropy, and Coding
Chapter 8 Information, Entropy, and Coding 8. The Need for Data Compression To motivate the material in this chapter, we first consider various data sources and some estimates for the amount of data associated
More informationIntroduction to image coding
Introduction to image coding Image coding aims at reducing amount of data required for image representation, storage or transmission. This is achieved by removing redundant data from an image, i.e. by
More informationInformation Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay
Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture - 17 Shannon-Fano-Elias Coding and Introduction to Arithmetic Coding
More informationINTERNATIONAL JOURNAL OF APPLIED ENGINEERING RESEARCH, DINDIGUL Volume 1, No 3, 2010
Lossless Medical Image Security Shrikhande Rohini 1, Vinayak Bairagi 2 1 Researcher, Electronics & Telecommunication Department, Sinhgad Academy Of Engg. 2 Assistant Professor, Electronics & Telecommunication
More informationMulti-factor Authentication in Banking Sector
Multi-factor Authentication in Banking Sector Tushar Bhivgade, Mithilesh Bhusari, Ajay Kuthe, Bhavna Jiddewar,Prof. Pooja Dubey Department of Computer Science & Engineering, Rajiv Gandhi College of Engineering
More informationINTERNATIONAL TELECOMMUNICATION UNION TERMINAL EQUIPMENT AND PROTOCOLS FOR TELEMATIC SERVICES
INTERNATIONAL TELECOMMUNICATION UNION CCITT T.81 THE INTERNATIONAL (09/92) TELEGRAPH AND TELEPHONE CONSULTATIVE COMMITTEE TERMINAL EQUIPMENT AND PROTOCOLS FOR TELEMATIC SERVICES INFORMATION TECHNOLOGY
More informationTRANSPARENT ENCRYPTION FOR HEVC USING BIT-STREAM-BASED SELECTIVE COEFFICIENT SIGN ENCRYPTION. Heinz Hofbauer Andreas Uhl Andreas Unterweger
TRANSPARENT ENCRYPTION FOR HEVC USING BIT-STREAM-BASED SELECTIVE COEFFICIENT SIGN ENCRYPTION Heinz Hofbauer Andreas Uhl Andreas Unterweger University of Salzburg, Jakob Haringer Str. 2, 2 Salzburg, Austria
More informationImplementation of ASIC For High Resolution Image Compression In Jpeg Format
IOSR Journal of VLSI and Signal Processing (IOSR-JVSP) Volume 5, Issue 4, Ver. I (Jul - Aug. 2015), PP 01-10 e-issn: 2319 4200, p-issn No. : 2319 4197 www.iosrjournals.org Implementation of ASIC For High
More informationA Secure Data Transmission By Integrating Cryptography And Video Steganography
A Secure Data Transmission By Integrating Cryptography And Video Steganography Shafna P K Computer Science Department KMEA Engineering College Ernakulam, India shabanapk9999@gmail.com Abstract Advances
More informationSecured Lossless Medical Image Compression Based On Adaptive Binary Optimization
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661, p- ISSN: 2278-8727Volume 16, Issue 2, Ver. IV (Mar-Apr. 2014), PP 43-47 Secured Lossless Medical Image Compression Based On Adaptive Binary
More informationBandwidth Adaptation for MPEG-4 Video Streaming over the Internet
DICTA2002: Digital Image Computing Techniques and Applications, 21--22 January 2002, Melbourne, Australia Bandwidth Adaptation for MPEG-4 Video Streaming over the Internet K. Ramkishor James. P. Mammen
More informationBedford, Fowler: Statics. Chapter 4: System of Forces and Moments, Examples via TK Solver
System of Forces and Moments Introduction The moment vector of a force vector,, with respect to a point has a magnitude equal to the product of the force magnitude, F, and the perpendicular distance from
More informationReal-Time DMB Video Encryption in Recording on PMP
Real-Time DMB Video Encryption in Recording on PMP Seong-Yeon Lee and Jong-Nam Kim Dept. of Electronic Computer Telecommunication Engineering, PuKyong Nat'l Univ. sylee9997@pknu.ac.kr, jongnam@pknu.ac.kr
More informationFast Arithmetic Coding (FastAC) Implementations
Fast Arithmetic Coding (FastAC) Implementations Amir Said 1 Introduction This document describes our fast implementations of arithmetic coding, which achieve optimal compression and higher throughput by
More informationMMGD0203 Multimedia Design MMGD0203 MULTIMEDIA DESIGN. Chapter 3 Graphics and Animations
MMGD0203 MULTIMEDIA DESIGN Chapter 3 Graphics and Animations 1 Topics: Definition of Graphics Why use Graphics? Graphics Categories Graphics Qualities File Formats Types of Graphics Graphic File Size Introduction
More informationDecember 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS
December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in two-dimensional space (1) 2x y = 3 describes a line in two-dimensional space The coefficients of x and y in the equation
More informationJPEG File Interchange Format
JPEG File Interchange Format Version 1.02 September 1, 1992 Eric Hamilton C-Cube Microsystems 1778 McCarthy Blvd. Milpitas, CA 95035 +1 408 944-6300 Fax: +1 408 944-6314 E-mail: eric@c3.pla.ca.us JPEG
More informationLossless Grey-scale Image Compression using Source Symbols Reduction and Huffman Coding
Lossless Grey-scale Image Compression using Source Symbols Reduction and Huffman Coding C. SARAVANAN cs@cc.nitdgp.ac.in Assistant Professor, Computer Centre, National Institute of Technology, Durgapur,WestBengal,
More informationVolume 2, Issue 12, December 2014 International Journal of Advance Research in Computer Science and Management Studies
Volume 2, Issue 12, December 2014 International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online at: www.ijarcsms.com
More information2695 P a g e. IV Semester M.Tech (DCN) SJCIT Chickballapur Karnataka India
Integrity Preservation and Privacy Protection for Digital Medical Images M.Krishna Rani Dr.S.Bhargavi IV Semester M.Tech (DCN) SJCIT Chickballapur Karnataka India Abstract- In medical treatments, the integrity
More informationCHAPTER 2 LITERATURE REVIEW
11 CHAPTER 2 LITERATURE REVIEW 2.1 INTRODUCTION Image compression is mainly used to reduce storage space, transmission time and bandwidth requirements. In the subsequent sections of this chapter, general
More informationH.264/MPEG-4 Advanced Video Coding Alexander Hermans
Seminar Report H.264/MPEG-4 Advanced Video Coding Alexander Hermans Matriculation Number: 284141 RWTH September 11, 2012 Contents 1 Introduction 2 1.1 MPEG-4 AVC/H.264 Overview................. 3 1.2 Structure
More informationSystems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and
More informationStreaming Lossless Data Compression Algorithm (SLDC)
Standard ECMA-321 June 2001 Standardizing Information and Communication Systems Streaming Lossless Data Compression Algorithm (SLDC) Phone: +41 22 849.60.00 - Fax: +41 22 849.60.01 - URL: http://www.ecma.ch
More informationMichael W. Marcellin and Ala Bilgin
JPEG2000: HIGHLY SCALABLE IMAGE COMPRESSION Michael W. Marcellin and Ala Bilgin Department of Electrical and Computer Engineering, The University of Arizona, Tucson, AZ 85721. {mwm,bilgin}@ece.arizona.edu
More informationVideo Encryption Exploiting Non-Standard 3D Data Arrangements. Stefan A. Kramatsch, Herbert Stögner, and Andreas Uhl uhl@cosy.sbg.ac.
Video Encryption Exploiting Non-Standard 3D Data Arrangements Stefan A. Kramatsch, Herbert Stögner, and Andreas Uhl uhl@cosy.sbg.ac.at Andreas Uhl 1 Carinthia Tech Institute & Salzburg University Outline
More informationIntroduction to Medical Image Compression Using Wavelet Transform
National Taiwan University Graduate Institute of Communication Engineering Time Frequency Analysis and Wavelet Transform Term Paper Introduction to Medical Image Compression Using Wavelet Transform 李 自
More informationSachin Dhawan Deptt. of ECE, UIET, Kurukshetra University, Kurukshetra, Haryana, India
Abstract Image compression is now essential for applications such as transmission and storage in data bases. In this paper we review and discuss about the image compression, need of compression, its principles,
More informationDCT-JPEG Image Coding Based on GPU
, pp. 293-302 http://dx.doi.org/10.14257/ijhit.2015.8.5.32 DCT-JPEG Image Coding Based on GPU Rongyang Shan 1, Chengyou Wang 1*, Wei Huang 2 and Xiao Zhou 1 1 School of Mechanical, Electrical and Information
More informationA JPEG Decoder Implementation in C Chris Tralie ELE 201 Fall 2007
A JPEG Decoder Implementation in C Chris Tralie ELE 201 Fall 2007 Due 1/11/2008 Professor Sanjeev Kulkarni 1. Introduction The purpose of this project is to create a decoder program in C that can interpret
More informationLecture L3 - Vectors, Matrices and Coordinate Transformations
S. Widnall 16.07 Dynamics Fall 2009 Lecture notes based on J. Peraire Version 2.0 Lecture L3 - Vectors, Matrices and Coordinate Transformations By using vectors and defining appropriate operations between
More informationH 261. Video Compression 1: H 261 Multimedia Systems (Module 4 Lesson 2) H 261 Coding Basics. Sources: Summary:
Video Compression : 6 Multimedia Systems (Module Lesson ) Summary: 6 Coding Compress color motion video into a low-rate bit stream at following resolutions: QCIF (76 x ) CIF ( x 88) Inter and Intra Frame
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
More informationMotion JPEG Video Authentication based on Quantization Matrix Watermarking: Application in Robotics
Motion JPEG Video Authentication based on Quantization Matrix Watermarking: Application in Robotics Lamri Laouamer Lab-STICC,European University of Brittany Al Qassim University Buraydah,15452,KSA Abdelhamid
More informationCryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur
Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture No. # 11 Block Cipher Standards (DES) (Refer Slide
More informationPerformance Study on Image Encryption Schemes
www.ijcsi.org 349 Performance Study on Image Encryption Schemes Jolly Shah and Dr. Vikas Saxena Department of CS & IT, Jaypee Institute of Information Technology Noida, Uttar Pradesh 201307, India Department
More informationImage Authentication Scheme using Digital Signature and Digital Watermarking
www..org 59 Image Authentication Scheme using Digital Signature and Digital Watermarking Seyed Mohammad Mousavi Industrial Management Institute, Tehran, Iran Abstract Usual digital signature schemes for
More informationThnkwell s Homeschool Precalculus Course Lesson Plan: 36 weeks
Thnkwell s Homeschool Precalculus Course Lesson Plan: 36 weeks Welcome to Thinkwell s Homeschool Precalculus! We re thrilled that you ve decided to make us part of your homeschool curriculum. This lesson
More informationENGINEERING COMMITTEE Digital Video Subcommittee SCTE 20 2012 METHODS FOR CARRIAGE OF CEA-608 CLOSED CAPTIONS AND NON-REAL TIME SAMPLED VIDEO
ENGINEERING COMMITTEE Digital Video Subcommittee SCTE 20 2012 METHODS FOR CARRIAGE OF CEA-608 CLOSED CAPTIONS AND NON-REAL TIME SAMPLED VIDEO NOTICE The Society of Cable Telecommunications Engineers (SCTE)
More informationWhite paper. An explanation of video compression techniques.
White paper An explanation of video compression techniques. Table of contents 1. Introduction to compression techniques 4 2. Standardization organizations 4 3. Two basic standards: JPEG and MPEG 4 4. The
More informationOverview: Video Coding Standards
Overview: Video Coding Standards Video coding standards: applications and common structure Relevant standards organizations ITU-T Rec. H.261 ITU-T Rec. H.263 ISO/IEC MPEG-1 ISO/IEC MPEG-2 ISO/IEC MPEG-4
More informationApplication-Specific Biometric Templates
Application-Specific Biometric s Michael Braithwaite, Ulf Cahn von Seelen, James Cambier, John Daugman, Randy Glass, Russ Moore, Ian Scott, Iridian Technologies Inc. Introduction Biometric technologies
More informationSolution of Linear Systems
Chapter 3 Solution of Linear Systems In this chapter we study algorithms for possibly the most commonly occurring problem in scientific computing, the solution of linear systems of equations. We start
More informationA Secure File Transfer based on Discrete Wavelet Transformation and Audio Watermarking Techniques
A Secure File Transfer based on Discrete Wavelet Transformation and Audio Watermarking Techniques Vineela Behara,Y Ramesh Department of Computer Science and Engineering Aditya institute of Technology and
More informationELECTRONIC DOCUMENT IMAGING
AIIM: Association for Information and Image Management. Trade association and professional society for the micrographics, optical disk and electronic image management markets. Algorithm: Prescribed set
More information15.062 Data Mining: Algorithms and Applications Matrix Math Review
.6 Data Mining: Algorithms and Applications Matrix Math Review The purpose of this document is to give a brief review of selected linear algebra concepts that will be useful for the course and to develop
More informationFull Interactive Functions in MPEG-based Video on Demand Systems
Full nteractive Functions in MPEG-based Video on Demand Systems Kostas Psannis Marios Hadjinicolaou Dept of Electronic & Computer Engineering Brunel University Uxbridge, Middlesex, UB8 3PH,UK Argy Krikelis
More informationFrsq: A Binary Image Coding Method
Frsq: A Binary Image Coding Method Peter L. Stanchev, William I. Grosky, John G. Geske Kettering University, Flint, MI 4854, {pstanche, jgeske}@kettering.edu University of Michigan-Dearborn, Dearborn,
More informationUnderstanding Compression Technologies for HD and Megapixel Surveillance
When the security industry began the transition from using VHS tapes to hard disks for video surveillance storage, the question of how to compress and store video became a top consideration for video surveillance
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationA Survey of Error Resilient Coding Schemes for Image/Video Transmission Based on Data Embedding
A Survey of Error Resilient Coding Schemes for Image/Video Transmission Based on Data Embedding Li-Wei Kang*( 康 立 威 ) and Jin-Jang Leou # ( 柳 金 章 ) *Institute of Information Science Academia Sinica, Taipei
More informationClasses of multimedia Applications
Classes of multimedia Applications Streaming Stored Audio and Video Streaming Live Audio and Video Real-Time Interactive Audio and Video Others Class: Streaming Stored Audio and Video The multimedia content
More informationMultimedia Document Authentication using On-line Signatures as Watermarks
Multimedia Document Authentication using On-line Signatures as Watermarks Anoop M Namboodiri and Anil K Jain Department of Computer Science and Engineering Michigan State University East Lansing, MI 48824
More informationBinary Differencing for Media Files
Master Software Engineering Master s Thesis Vladimir Komsiyski July 2013 Supervisors: Jurgen Vinju Jeroen van den Bos Abstract Modern digital asset management systems face the problem of handling hundreds
More informationTracking Moving Objects In Video Sequences Yiwei Wang, Robert E. Van Dyck, and John F. Doherty Department of Electrical Engineering The Pennsylvania State University University Park, PA16802 Abstract{Object
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More informationTECHNICAL OVERVIEW OF VP8, AN OPEN SOURCE VIDEO CODEC FOR THE WEB
TECHNICAL OVERVIEW OF VP8, AN OPEN SOURCE VIDEO CODEC FOR THE WEB Jim Bankoski, Paul Wilkins, Yaowu Xu Google Inc. 1600 Amphitheatre Parkway, Mountain View, CA, USA {jimbankoski, paulwilkins, yaowu}@google.com
More informationSteganographyinaVideoConferencingSystem? AndreasWestfeld1andGrittaWolf2 2InstituteforOperatingSystems,DatabasesandComputerNetworks 1InstituteforTheoreticalComputerScience DresdenUniversityofTechnology
More informationComparison of different image compression formats. ECE 533 Project Report Paula Aguilera
Comparison of different image compression formats ECE 533 Project Report Paula Aguilera Introduction: Images are very important documents nowadays; to work with them in some applications they need to be
More informationTransform-domain Wyner-Ziv Codec for Video
Transform-domain Wyner-Ziv Codec for Video Anne Aaron, Shantanu Rane, Eric Setton, and Bernd Girod Information Systems Laboratory, Department of Electrical Engineering Stanford University 350 Serra Mall,
More informationComputer Networks and Internets, 5e Chapter 6 Information Sources and Signals. Introduction
Computer Networks and Internets, 5e Chapter 6 Information Sources and Signals Modified from the lecture slides of Lami Kaya (LKaya@ieee.org) for use CECS 474, Fall 2008. 2009 Pearson Education Inc., Upper
More informationAccelerating Wavelet-Based Video Coding on Graphics Hardware
Wladimir J. van der Laan, Andrei C. Jalba, and Jos B.T.M. Roerdink. Accelerating Wavelet-Based Video Coding on Graphics Hardware using CUDA. In Proc. 6th International Symposium on Image and Signal Processing
More informationDigital Video Coding Standards and Their Role in Video Communications
Digital Video Coding Standards and Their Role in Video Communications RALF SCHAFER AND THOMAS SIKORA, MEMBER, IEEE Invited Paper The eficient digital representation of image and video signals has been
More informationSolving Simultaneous Equations and Matrices
Solving Simultaneous Equations and Matrices The following represents a systematic investigation for the steps used to solve two simultaneous linear equations in two unknowns. The motivation for considering
More informationChapter 3 ATM and Multimedia Traffic
In the middle of the 1980, the telecommunications world started the design of a network technology that could act as a great unifier to support all digital services, including low-speed telephony and very
More informationStudy and Implementation of Video Compression standards (H.264/AVC, Dirac)
Study and Implementation of Video Compression standards (H.264/AVC, Dirac) EE 5359-Multimedia Processing- Spring 2012 Dr. K.R Rao By: Sumedha Phatak(1000731131) Objective A study, implementation and comparison
More informationReading.. IMAGE COMPRESSION- I IMAGE COMPRESSION. Image compression. Data Redundancy. Lossy vs Lossless Compression. Chapter 8.
Reading.. IMAGE COMPRESSION- I Week VIII Feb 25 Chapter 8 Sections 8.1, 8.2 8.3 (selected topics) 8.4 (Huffman, run-length, loss-less predictive) 8.5 (lossy predictive, transform coding basics) 8.6 Image
More informationencoding compression encryption
encoding compression encryption ASCII utf-8 utf-16 zip mpeg jpeg AES RSA diffie-hellman Expressing characters... ASCII and Unicode, conventions of how characters are expressed in bits. ASCII (7 bits) -
More information9.2 Summation Notation
9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a
More informationKhalid Sayood and Martin C. Rost Department of Electrical Engineering University of Nebraska
PROBLEM STATEMENT A ROBUST COMPRESSION SYSTEM FOR LOW BIT RATE TELEMETRY - TEST RESULTS WITH LUNAR DATA Khalid Sayood and Martin C. Rost Department of Electrical Engineering University of Nebraska The
More informationWatermarking Techniques for Protecting Intellectual Properties in a Digital Environment
Watermarking Techniques for Protecting Intellectual Properties in a Digital Environment Isinkaye F. O*. and Aroge T. K. Department of Computer Science and Information Technology University of Science and
More informationA HIGH PERFORMANCE SOFTWARE IMPLEMENTATION OF MPEG AUDIO ENCODER. Figure 1. Basic structure of an encoder.
A HIGH PERFORMANCE SOFTWARE IMPLEMENTATION OF MPEG AUDIO ENCODER Manoj Kumar 1 Mohammad Zubair 1 1 IBM T.J. Watson Research Center, Yorktown Hgts, NY, USA ABSTRACT The MPEG/Audio is a standard for both
More informationREIHE INFORMATIK 7/98 Efficient Video Transport over Lossy Networks Christoph Kuhmünch and Gerald Kühne Universität Mannheim Praktische Informatik IV
REIHE INFORMATIK 7/98 Efficient Video Transport over Lossy Networks Christoph Kuhmünch and Gerald Kühne Universität Mannheim Praktische Informatik IV L15, 16 D-68131 Mannheim Efficient Video Transport
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationMPEG-1 and MPEG-2 Digital Video Coding Standards
Please note that the page has been produced based on text and image material from a book in [sik] and may be subject to copyright restrictions from McGraw Hill Publishing Company. MPEG-1 and MPEG-2 Digital
More informationCryptography and Network Security. Prof. D. Mukhopadhyay. Department of Computer Science and Engineering. Indian Institute of Technology, Kharagpur
Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Module No. # 01 Lecture No. # 12 Block Cipher Standards
More informationSERIES T: TERMINALS FOR TELEMATIC SERVICES Still-image compression JPEG-1 extensions
International Telecommunication Union ITU-T T.871 TELECOMMUNICATION STANDARDIZATION SECTOR OF ITU (05/2011) SERIES T: TERMINALS FOR TELEMATIC SERVICES Still-image compression JPEG-1 extensions Information
More information