Soft Feature-Based Watermark Decoding with Insertion/Deletion Correction
|
|
- August Maxwell
- 6 years ago
- Views:
Transcription
1 Soft Feature-Based Watermark Decoding with Insertion/Deletion Correction Mathias Schlauweg, Dima Pröfrock, and Erika Müller Institute of Communications Engineering, Faculty of Computer Science and Electrical Engineering, University of Rostock, Rostock 18119, Germany, {mathias.schlauweg, dima.proefrock, Abstract. Hard decisions constitute the major problem in digital watermarking applications, especially when content adaptive embedding methods are used. Soft-decision decoding, on the other hand, has proved to be performance gaining, often realized during forward error correction. But despite this insight, no adaptive watermarking approach integrates the adaptation process into soft decoding, up to now. Further, insertion/deletion errors can occur in a content dependent watermarking system due to hard decisions if data is embedded only in some selected regions of the host signal. This kind of error usually desynchronizes the decoder and disables the correct watermark extraction. In this paper, we work out three fundamental properties of content dependent quantization-based watermarking. We show how the coupling between these properties and common soft-decision forward error correction decoding can be used to build up an overall soft processing watermarking. No pre-distortion has to be used, and hence, the image quality is not degraded. Even adaptation techniques can be used where it is computational infeasible to project a pre-distortion back onto the host image. Afterwards, we describe how to modify a common Viterbi decoder to enable the correction of insertion/deletion errors combined with our new soft decoding approach and hence improve the overall performance. Key words: Digital watermarking, image segmentation, adaptive decoding, soft-decision forward error correction, re-synchronization. 1 Introduction After several years of watermarking research, more and more sophisticated methods have been developed to embed additional data into multimedia content. All these methods have in common that they strive after a good compromise between invisibility and robustness of the embedding. In image watermarking, invisibility means that degradations of the perceptual quality of the host image must be avoided. Hence, newer content adaptive watermarking methods take advantage of the property that the HVS (human visual system) is less sensitive to changes
2 2 Mathias Schlauweg et al. in textured regions than in smooth regions of an image [1]. Data can be embedded with higher robustness against watermark attacks in stronger textured regions without being visible, commonly known as perceptual shaping [2]. Basically, there are two kinds of adaptive watermarking outlined in literature. The first embeds data into all regions. Less as well as more perceptually significant areas are used, whereas the embedding strength is adapted to the image content, as in [1], [2]. The second approach is based on the idea only embedding in regions where the perceivable distortion is low and leaving perceptually sensitive areas undisturbed [3], [4], [6]. In both cases, the image has to be separated into regions with different HVS properties, and during the extraction process, the same separation has to be determined from the host signal. Discrepancies yield errors, even if no attack has been applied [5]. While the former approach has to deal with common substitution errors (binary: 0 1 or 1 0), the later would result in catastrophic de-synchronization. That means a deletion error occurs when an embedded symbol is not detected by the receiver and an insertion error occurs when the receiver detects a symbol that was not transmitted. The most often applied technique to circumvent discrepancies between both separation feature maps is to form a gap around the separation threshold. In other words, the used feature is pre-distorted to leave a margin. As a consequence the image quality is degraded. Furthermore, there are separation approaches where it is computational infeasible or even impossible to project the pre-distortion back onto the host image. For example, the separation feature could have been calculated using higher order statistics from extensive data. In this case, errors are ignored or tried to be corrected by FEC (forward error correction), usually with moderate success, because common forward error correction schemes are designed to correct substitutions. They cannot detect or correct insertions/deletions. In such systems, synchronization loss will result in a sequence or burst of errors until synchronization is re-established. In this paper, we propose to integrate commonly used hard region separation into an overall soft processing framework, as in Fig. 1 c). Three interesting key properties deviated from content dependent quantization-based watermarking a) F s Region Separation Bit Decision FEC- Decoding m b) F Region Separation FEC- Decoding m s c) F s Soft Region Separation, FEC-Decoding & Bit Decision m Fig. 1. Overall hard processing a), hard region separation with soft bit decoding b), overall soft processing c). F = separation feature, s = host signal, m = watermark.
3 Soft Feature-Based Watermark Decoding with Insertion/Deletion Correction 3 are presented in section 2. These properties can be used to combine HVS-based region separation and watermark decoding with impressive improvements in error correction capability. Afterwards in section 3, we give an overview of recent insertion/deletion/substitution error correction approaches and present a new solution to the problem of bit re-synchronization in adaptive watermarking. Experimental results for the combination of both new techniques are shown in section 4 and conclusions will be given in section 5. 2 Soft-Decoded Adaptive Watermarking As mentioned earlier, if there are discrepancies of the region separation during adaptively embedding and extracting the watermark m, as in Fig. 2 b) and c), then wrong parameters are used and errors can occur. If both less as well as more perceptually significant areas are used, for example, with different embedding strengths, only single bit errors occur. In the case of bit sensitive, signature-based applications such as image authentication [1] these bit errors are problematic but can be corrected using common forward error correction. But if data are only embedded in regions where the perceivable distortion is low, long bursts of errors occur until re-synchronization. For example, the nine mask differences in Fig. 2 c) would result in three insertions and six deletions anywhere in the extracted watermark stream if the decoder assumes that data is only embedded in the white blocks. a) b) c) Fig. 2. Original image a). Hard embedding mask b), hard extraction mask after JPEG compression with quality factor QF = 50 c) using the DWT-based segmentation (τ =2). Thus, the first goal must be to find a segmentation scheme that yields less decision errors. Furthermore, we require the segmentation feature map F to consist of real values, F R. These soft values, the soft mask, will be used during our new soft-decision decoding for weighting the input signal s. In section 2.1 and 2.2, we propose two separation approaches that fulfill these requirements. Afterwards in 2.3, three interesting properties of content adaptive quantization-based watermarking are presented. We show how these properties can be combined and integrated into a soft-decision decoding in section 2.4.
4 4 Mathias Schlauweg et al. 2.1 DWT-based Soft Mask Generation In [1], we applied texture segmentation in the DWT (discrete wavelet transform) domain for an image authentication scheme. Large DWT-coefficients indicate image positions with strong texture, whereas small ones stand for homogenous regions. As in Fig. 3 except for the LL 4 -subband, all coefficients of the fourth decomposition level are compared to a threshold. Afterwards, the known morphologic operations closing and erosion are used to eliminate small gaps and to refine the separation. The binary masks are combined logically and used during embedding as well as extraction to select between two different watermarking strengths 1 and 2. HL 4 HH 4 τ 2τ Closing Closing Erosion Hard Mask F H 4 levels DWT decomposition LH 4 τ Threshold Closing 2-of-3 Combination Fig. 3. Hard mask generation for adaptive embedding as described in [1]. But the described DWT segmentation approach was originally designed for a hard region separation and hard FEC-decoding. Now, in this paper we modify it to a soft version, whereas the texture threshold τ is subtracted rather than being used for binarization. As shown in Fig. 4, the resulting three matrices are summed and multiplied element-wise by the signed hard mask values F H, which are calculated as described above. Compared to the original image the homogenous sky yields negative values, whereas for stronger textured regions the feature F S is positive. HL 4 τ 2 F H - 1 Soft Mask F S HH 4 2τ * 0 LH 4 τ Subtraction Element-wise Multiplication Fig. 4. Soft mask generation based on DWT coefficient amplitude.
5 Soft Feature-Based Watermark Decoding with Insertion/Deletion Correction Gradient-Based Soft Mask Generation For the proposed DWT segmentation approach it would be easy to pre-distort the feature to leave a margin to lower the number of segmentation errors at the decoder. But for another approach that turns out to be even more robust to signal processing a feature pre-distortion is computational more complex. In this second, gradient-based segmentation we propose to detect horizontal, vertical and diagonal edges using the Sobel operator. That means the image is filtered using the Sobel filter matrices from Fig. 5 at first. Afterwards, a Gaussian low pass filtering is applied and the four feature maps are compared to a threshold and summed as in the DWT-based approach. Again, morphologic operations are used for the binary hard mask to refine the segmentation, whereupon the filtered edge masks are multiplied element-wise by the hard mask similar to Fig a) b) c) d) Fig. 5. Sobel filter matrices for horizontal a), vertical b), diagonal c-d) edge detection. The following figure indicates the robustness of both described segmentation methods determined from several tests on natural images. By the term robustness here the probability of occurrence of a feature threshold transition is meant, which would yield additional errors to be corrected by the FEC-decoder. Probability of error 10 0 DWT-based DWT-based separat. separation Gradient-based separat. gaussian filtering (mask size 3x3) 10-1 gaussian filtering (mask size 5x5) 10-2 unsharp masking (mask size 5x5) % % % JPEG Quality Factor Gradient-based separation % % % Fig. 6. Probability of occurrence of a feature threshold transition during region segmentation at the receiver site due to non-malicious signal processing. 2.3 Three Key Properties towards Soft Decoding For watermark embedding we use QIM (quantization index modulation) in the DWT domain as it is described in [1]. But for the extraction site, we found
6 6 Mathias Schlauweg et al. three new interesting properties to be used for soft-decoding during nearestneighbor quantization. Thereby, Λ 1 and Λ 2 denote the two quantization lattices that each consist of sub-lattices marked with and accordingly. Although here we describe the embedding for the DWT domain, other domains, e.g., DCT (discrete cosine transform) or pixel domain could be used as well. Firstly, we assume that data is embedded in both less as well as more textured regions. Later on, in section 3, we consider the case that data is embedded only in strong textured regions but not in homogenous parts of the image. We show that this so-called selective watermarking is a special case of adaptive watermarking where the embedding strength 1 is zero at the encoder. Property I - Lattice Point Coverage. In Fig. 7, the natural covers of Λ 1 and Λ 2 are shown for the case of lattice crossings due to false feature separation. The shaded areas indicate natural positive crossings. For example, suppose Λ 1 has been used during watermark embedding and the host signal was quantized to the highlighted point. If afterwards the mask changes slightly as in Fig. 2 c), then Λ 2 would be used during extraction. In this case the nearestneighbor quantization would yield the correct bit decision as long as the sample keeps inside the shaded area, even if the separation feature has passed over the decision threshold. But if the point right beside it has been used, it would be falsely decided to a point in lattice Λ 2. In this case, a bit substitution error would occur. Λ 1 1 correct wrong Λ 2 2 = 3 1 Fig. 7. Covers of two different QIM lattices ( 2 = 3 1). However, the possibility is highest that no error occurs during a transition Λ 1 Λ 2 in the case of an exactly three times larger quantization interval 2. Thereby, in at least 50 percent of all cases there is no problem if a transition occurs if the distortion to the quantized signal is less than 1 /2. Property II - Distortion Probability Function. In [11], Vila-Forcén et al. studied additive attacks against quantization-based watermarking. For attacks such as lossy compression, noise adding or filtering the distortion to the quantized signal can be expected to be Gaussian distributed. Since the variance of this distribution is the same for both lattices Λ 1 and Λ 2, following distortion probability density functions pdf (s i ) can be expected (see Fig. 8). Due to the nearest-neighbor quantization s i = { 1 s i +1 : s i R}, i {1, 2} for one periodical quantization bin, if we consider s 1 = s/ 1 and s 2 = s/ 2.
7 for both lattices Λ 1 and Λ 2, following distortion probability density functions pdf (s i ) can be expected. Due to the nearest-neighbor quantization s i = {-1 s i +1: s i }, Soft i {1, Feature-Based 2} for one periodical Watermark quantization Decoding bin, withif Insertion/Deletion we consider s 1 = s / Correction 1 and s 2 = s / 2. 7 pdf ( s1 ) Λ 1 1/2 s pdf ( s2) Λ 2 2/2 = 3 1/2 s Fig. 8. Probability density functions of the disturbed signal ( 2 / 1 = 3). Fig. 8. Probability density functions of the disturbed signal ( 2/ 1 = 3). Both probability density functions are drawn one upon the other in Fig. 8 to better visualize that there are spaces at the second lattice where it is unlikely that a signal Both probability density functions are drawn one upon the other in Fig. 8 to sample is located. In other words, if the feature is close to the decision threshold and visualize that there are spaces at the second lattice where it is unlikely that a the signal sample is somewhere in the space where pdf (s 2 ) is small, it is more likely signal that the sample sample is was located. originally In other embedded words, using if lattice the feature Λ 1. is close to the decision threshold and the signal sample is somewhere in the space where pdf (s 2 ) is small, it is Property more likely III that Certainty the sample of Decision. was originally We define embedded C as certainty using of lattice how close Λ 1. the input feature F is to the selected feature threshold τ. That means if the feature is close Property to the decision III threshold, - Certainty it is uncertain of Decision. which QIM Welattice define has Cto as be used. certainty In this ofcase how close the the certainty inputis feature zero. If the F is feature to the is far selected from the feature threshold threshold and it is τ. oblivious That means which if thelattice feature was is chosen closeduring to theembedding, decision threshold, the certainty itis is high. uncertain which QIM lattice has to be used. In this case the certainty is zero. If the feature is far from the threshold and it is oblivious whichc lattice = F - τ. was chosen during embedding, (1) the certainty is high. Using this certainty we propose two weighting functions, f 1 andusing f 2, for this the certainty input signals we propose in Λtwo 1 and weighting Λ 2. functions, f 1 and f 2, for the input signals in Λ 1 and Λ 2. Thereby s 1 and s 2 will be coupled to the soft key properties I, II described above. C = F τ (1) ( C ) arctan 1 f 1 f (C) ( C ) = 1 +. (2) 2 arctan(c) (2) π π 2 (,, ) 1 ( ( )) f 2 (C, f Cs 2 s, O) O= 1 f 1 C(C ( s s 2 + O+ O)). (3) (3) C x f1 ( C ) f 2( C, s2, O ) C x f ( C ) f ( C, s, O ) 0 10,5 2 0,52 0 0,5 1 0, The weighting function f 2 for lattice Λ 2 depends on the absolute value of input signal s 2 to implement Property II. The value O should be set to the ratio 1 / 2, e.g., O = 1/3. For one periodical quantization bin the weighting functions are visualized in Fig. 9. Considering the input signal both functions are drawn opposed to each other.
8 8 Mathias Schlauweg et al. f ( C) 1 1 f ( Cs,, O) s 1 C C s 2 Fig. 9. Soft feature input signal weighting functions. Since data embedded using the weaker embedding strength 1 is less robust to attacks or common signal processing than data embedded using 2 afterwards we stretch the signal s w by the factor 2 / 1 at all mask positions where the separation feature is larger than the threshold τ. s w = s 1 f 1 (C) + s 2 f 2 (C, s 2, O) 2 { s s w = w C < 0 2 / 1 s w C 0 (4) (5) 2.4 Soft-Decision Decoding of the Weighted Signal After the weighing process, the FEC-decoder receives a stream containing information about the reliability of each received symbol. For example, the common Viterbi decoder with soft-decision input used to decode convolutional codes can be employed to determine the embedded message m. By observing a sequence of symbols this decoder determines multiple paths of message states in a kind of state machine. Each of these states is valuated by a path metric, representing the reliability of each bit-decision. Afterwards, in a trace back process the maximum likelihood path survives. The weighting approach directly influences this metric. The improvement of the described input signal weighting approach concerning substitution error correction performance will be presented in section 4. Prior to this in the following section, we discuss the case that data is embedded exclusively in stronger textured regions, whereas perceptually sensitive areas are left undisturbed. This embedding can yield insertions as well as deletions at unpredictable locations within the watermarking sequence at the decoder. 3 Insertion/Deletion Error Correction The term watermark de-synchronization is used twice in literature. The term sometimes often refers to the whole embedded message in consequence of geometric attacks such as shifting, rotation, or scaling. But it may also refer to a nonlinear drift within the message sequence. This second kind of de-synchronization
9 Soft Feature-Based Watermark Decoding with Insertion/Deletion Correction 9 caused by bit insertions and deletions is the major problem in content adaptive watermarking. Known approaches such as ESD (exhaustive search detection) or TMD (template matching detection), recently analyzed by Barni [7], usually applied to re-synchronize the whole message are computational infeasible in the case of IDS (insertions/deletions/substitutions). Most error correction schemes are designed to correct substitution errors. It is assumed that the decoder knows the block boundaries in the case of block codes or the message length in the case of convolutional codes. They can neither detect nor correct insertions/deletions. In such systems, synchronization loss will result in a sequence or burst of errors until synchronization is re-established. Basically, there are two categories of re-establishing synchronization. While the first detects synchronization loss and discards incorrect code words to regain synchronization, the second is able to correct insertions/deletions and hence to recover the transmitted data. In [5] and [10], the authors give an overview of recent approaches to channel re-synchronization. One technique is, for example, to use an inner code to infer the positions of insertion/deletion errors and an outer code to correct errors in a concatenated coding scheme, as in [4], [5]. Thereby, carrier signals (marker) are provided for the outer burst-error-correcting decoder. If these markers are not in their expected positions, the outer decoder can infer the insertion/deletion positions. In this case, exhaustive search detection can be used for the inner code partition with reduced computational effort. Another technique, published by Solanki et al., treats the host signal locations where no data is embedded as erasures [6]. Similar to the idea of punctured channel coding, the encoder simply drops the code symbols at these locations. Afterwards, the decoder inserts don t-care states for the assumed locations knowing only the selection criterion but not the explicit locations. Insertions now become errors, and deletions become additional don t-care states that can be corrected by the decoder. Both these solutions require extra coding effort at the sender. In contrast, a third technique that works only at the receiver is the use of extended dynamic programming during FEC-decoding. Here, existing codes and standard encoding methods are used. Only the decoder is slightly modified, as in [8] - [10]. 3.1 Interconnected Viterbi Decoders The first extended dynamic programming approach for the purpose of IDS-error correction in a watermarking system with selective embedding was proposed by Mansour and Tewfik [8]. Their technique recovers the correct message if extra bits (false alarms) are added to the body of the message at random locations. They modify the Viterbi algorithm used to decode the embedded watermark that was previously encoded with convolutional codes. The decoder is designed to handle substitution as well as insertion errors, but no deletions. To get only substitutions and insertions the threshold τ for selecting embedding positions at the decoder is chosen to be less than the threshold at the embedding site. The new threshold is τ T. Hence, the probability of occurrence of deletion errors is lower than for insertion errors (see Fig. 10). But in this case all embedding positions with a feature value in the distance d T to the threshold unavoidably
10 10 Mathias Schlauweg et al. turn out to be insertions. As a consequence the FEC-decoder has to deal with an extra error rate that degrades the overall correction capability. pdf ( d ) pdf ( d) Insertions Deletions 0 d 0 T d Fig. 10. Probability density functions of the occurrence of threshold transitions (zerocrossings) and hence insertion/deletion errors at the decoder (left). If the threshold at the decoder is chosen to be less than the threshold at the embedding, most deletions turn out to be insertions (right). Recently, another approach was described by Swart et al. [10]. Multiple parallel Viterbi decoders are used to correct IDS-errors. Each decoder receives a stream containing information about the reliability of each received symbol. By observing a sequence of symbols the common decoder determines several paths of message states in a kind of state machine. Each of these states is valuated by a metric, representing the reliability of each bit-decision. Afterwards, in a trace back process the maximum likelihood path survives. Synchronization errors result in all metrics to have high rate of change for the decoders that are out of sync. Since each of the parallel-interconnected Viterbi decoders is one bit out of sync with the others (see Fig. 11), by monitoring the rate of change for the accumulated error metrics, one is able to ascertain which of the Viterbi decoders is in synchronization. Based on the idea in [9], where several standalone decoders were used, Swart et al. integrated the framework into one larger Viterbi decoder and called it super trellis decoder. -1: w k -1 w k w k +1 w k +2 0 : w k w k +1 w k +2 w k +3 +1: w k +1 w k +2 w k +3 w k +4 Fig. 11. Representation of the super trellis [10] (left). Another illustration of the super trellis to better visualize the indices of the input samples, for an 1/2-rate code (right). The sub decoder lagging by one bit is denoted by -1, the sub decoder leading by one bit is denoted by +1.
11 Soft Feature-Based Watermark Decoding with Insertion/Deletion Correction 11 We implemented the proposed algorithm and made some modifications on the super trellis decoder. These modifications allow us to directly input the previously described soft-weighted samples s w to the decoder stage. A further input to the decoder must be the feature decision certainty C to infer the subset of s w that is assumed to be the embedded watermark w k at the host signal positions p k prior re-synchronization. That means if N is the number of all possible candidates of embedding locations and K is the number of, e.g., coefficients for data embedding selected using the local perceptual criterion C, w k := s w (p k ), whereas p k = {p k N : 0 C(p k ), 1 k K}. Modifications: 1. Deletions can only have been occured at those positions where p k < p k+1 1. This reduces the computational effort as well as the number of false positives. 2. Swarts decoder simply repeats the previous sample, e.g., w k+1 in Fig. 11, if a deletion is assumed for a symbol in the range p k...p k+1. But since the decoder has knowledge about all samples, we propose to integrate the sample delivered by the watermark extractor that is assumed to be deleted. In the example in Fig. 12, such a deleted sample is labeled D. If p k < p k+1 n, where 2 n, or in other words if there are more than one deletion candidate, we suggest from all n samples D(p k + 1)...D(p k + n) to chose the one with the lowest absolute value C. 3. Considering Fig. 11, the old super trellis decoder is not able to deduce the actual insertion/deletion position within a pair of symbols, e.g., the tupel [w k, w k+1 ] in the case of a 1/2-rate code. As can be seen in Fig. 12, our trellis extension checks for all possible combinations of insertion/deletion positions and hence, finds as well as corrects the actual error location. 4. Additionally, we apply a weighting to the first pair of samples within the window for the decoders out of sync using the certainty of the sample positions assumed to be inserted or deleted, respectively. w k D w k +1 w k +2 w k +7 w k +8 D w k w k +1 w k +2 w k +3 w k +4 w k +3 w k +4 w k +4 w k +5 w k +5 w k +6 w k +5 w k +6 w k +5 w k +6 w k +5 w k +6 w k +6 w k +7 w k +7 w k +8 w k +7 w k +8 w k +7 w k +8 w k w k +1 w k +2 w k +3 w k +8 w k +9 w k +9 w k +10 w k +9 w k +10 w k w k +2 w k +3 w k +4-1: -1: 0 : +1: +1: w k +1 w k +2 w k +3 w k +4 Fig. 12. Modified super trellis for a 1/2-rate code, where 2 input samples form a pair of symbols. Here, the decoder considers the input within a window of length 5.
12 12 Mathias Schlauweg et al. 4 Experimental Results The probability of mask transitions using the described soft region segmentation is very low, as shown in Fig. 6. Thus, we had to perform a huge number of simulations to assess the improvement in bit error correction during watermark retrieval. To get an impression of how the image from Fig. 2 a) is changed due to the embedding process, in Fig. 13 and Fig. 14 the watermarked image is displayed. In the first image, less as well as more perceptually significant regions are used for data embedding. Here, only bit substitution errors have to be expected if the segmentation mask changes during watermark extraction. On the other hand, in Fig. 14, the host image is only watermarked in regions where the separation feature is larger than the threshold. That means for this approach also insertion/deletion errors have to be expected. As already mentioned, we call the second approach selective embedding and claim that selective embedding is a special form of adaptive embedding, where 1 is zero. a) b) Fig. 13. Adaptively watermarked image a) bits are embedded in less as well as more perceptually significant regions, 2 = 3 1, where 1 = 2, PSNR = db. Difference to original b). a) b) Fig. 14. Selectively watermarked image a). 541 bits are only embedded ( 2 = 6) in regions where the separation feature is larger than the threshold, PSNR = db. Difference to original b).
13 Soft Feature-Based Watermark Decoding with Insertion/Deletion Correction 13 All results shown in this paper have been calculated for the same parameters for a set of 32 natural photos. We show the results of our new solution for JPEG compression. Other watermark attacks such as filtering or noise-adding have similar effect on the probability of mask transitions and hence, functionality of our approach. In this paper, malicious attacks such as cropping or geometric attacks are not considered since the original intention was to propose an extension for the image authentication watermarking system in [1]. 4.1 Adaptive Watermarking Fig. 15 shows that our soft-mask/soft-fec solution outperforms common adaptive watermarking using hard region separation combined with either soft or hard forward error correction. The soft-masking approach helps to lower the bit error rate approximately by a factor 5 for commonly used JPEG compression (QF 10) without any extra coding effort or quality degradations during watermark embedding hard mask / hard FEC hard mask / soft FEC soft mask / soft FEC BER (bit error rate) Quality Factor QF Fig. 15. Empirical bit error rate for lossy JPEG compression for different values of quality factor after forward error correction for the adaptive watermarking approach. 4.2 Selective Watermarking If in Equ. 3 (section 2.3) the step size 1 is zero and no data is embedded in the perceptually sensitive regions, it follows that O, and s 1 are zero too. Although this special form, the weighting function f 2 (C, s 2 ) and hence the segmentation feature have still influence. That means if the feature is far from the threshold, the probability of occurrence of an insertion/deletion error is low. On the other hand, if the feature is close to the threshold the new super trellis decoder can benefit from this knowledge since the weighting process raises the error metric for all interconnected decoders that are out of sync. In Fig. 16, the propability of occurence of mask transitions, which we denote as mask error rate, is shown against the bit error rate (BER). The bit error
14 14 Mathias Schlauweg et al. rate also includes burst errors that result from de-synchronization due to insertions/deletions BER (bit error rate) no re-sync. with re-sync mask error rate Fig. 16. Empirical mask error rate against the bit error rate after forward error correction with and without re-synchronization for the selective watermarking approach. 5 Conclusions In this paper, an integration of perceptual watermarking adaptation into the soft-decision decoding of common forward error correction was proposed. In prior watermarking approaches this adaptation process was always excluded from softdecoding. We proved that a soft-integration yields impressive improvements in bit error correction during watermark retrieval. No pre-distortion has to be used to avoid adaptation errors during watermark extraction. Hence, the host image quality is not degraded. Furthermore, even adaptation techniques can be used where it is computational infeasible to project a pre-distortion back onto the host image. We showed that the performance can be further gained by combining our soft-decoding approach with a recently proposed channel coding technique capable of correcting insertion/deletion errors at the decoder site. We introduced some modifications for this insertion/deletion correction algorithm to improve the overall performance. Our proposed technique can be integrated very easily into numerous watermarking applications without loss of security, performance or functionality. References 1. Schlauweg, M., Pröfrock, D., Müller E.: JPEG2000-Based Secure Image Authentication. In Proc. of ACM Multimedia and Security Workshop, Geneva, Switzerland, (2006) 62-67
15 Soft Feature-Based Watermark Decoding with Insertion/Deletion Correction Wolfgang, R. B., Podilchuk, C. I., and Delp, E.J.: Perceptual Watermarks for Images and Video. In Proc. of IEEE - Special Issue on Identification and Protection of Multimedia, Vol. 87 (7), (1999) Hernández, J. R., Delaigle, J.-F., and Macq, B.: Improving Data Hiding by Using Convolutional Codes and Soft-Decision Decoding, In Proc. of SPIE Security and Watermarking of Multimedia Contents, San José, USA, (2000) Sharma, G., and Coumou, D. J.: Watermark Synchronization: Perspectives and a New Paradigm, In Proc. of Conference on Information Sciences and Systems, Princeton, USA, (2006) Davey, M. C., and MacKay, D. J. C.: Reliable Communication over Channels with Insertions, Deletions and Substitutions, IEEE Transactions on Information Theory, Vol. 47 (2), (2001) Solanki, K., Jacobsen, N., Madhow, U., Manjunath, B. S., and Chandrasekaran, S.: Robust Image-Adaptive Data Hiding Using Erasure and Error Correction, IEEE Transactions on Image Processing, Vol. 13 (12), (2004) Barni, M.: Shedding Light on Some Possible Remedies Against Watermark De- Synchronization: A Case Study, In Proc. of SPIE Security, Steganography, and Watermarking of Multimedia Contents VII, San José, USA, (2005) Mansour, M. F., and Tewfik, A. H.: Efficient Decoding of Watermarking Schemes in the Presence of False Alarms, In Proc. of IEEE Workshop on Multimedia and Signal Processing, Cannes, France, (2001) Dos Santos, M. P. F., Clarke, W. A., Ferreira, H. C., and Swart, T. G.: Correction of Insertions/Deletions using Standard Convolutional Codes and the Viterbi Decoding Algorithm, In Proc. of IEEE Information Theory Workshop, Paris, France, (2003) Swart, T. G., Ferreira, H. C., and dos Santos, M. P. F.: Using Parallel- Interconnected Viterbi Decoders to Correct Insertion/Deletion Errors, In Proc. of IEEE AFRICON Conference in Africa, Gaborone, Botswana, (2004) Vila-Forcén, J. E., Voloshynovskiy, S., Koval, O., Pun, T., and Pérez-González, F.: Worst Case Additive Attack against Quantization-Based Data-Hiding Methods, In Proc. of SPIE Security, Steganography, and Watermark of Multimedia Contents VII, San José, USA, (2005)
DATA hiding technologies have been widely studied in
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL 18, NO 6, JUNE 2008 769 A Novel Look-Up Table Design Method for Data Hiding With Reduced Distortion Xiao-Ping Zhang, Senior Member, IEEE,
More informationOBJECT-BASED IMAGE COMPRESSION WITH SIMULTANEOUS SPATIAL AND SNR SCALABILITY SUPPORT FOR MULTICASTING OVER HETEROGENEOUS NETWORKS
OBJECT-BASED IMAGE COMPRESSION WITH SIMULTANEOUS SPATIAL AND SNR SCALABILITY SUPPORT FOR MULTICASTING OVER HETEROGENEOUS NETWORKS Habibollah Danyali and Alfred Mertins School of Electrical, Computer and
More informationDigital Watermarking for Telltale Tamper Proofing and Authentication
Digital Watermarking for Telltale Tamper Proofing and Authentication DEEPA KUNDUR, STUDENT MEMBER, IEEE, AND DIMITRIOS HATZINAKOS, SENIOR MEMBER, IEEE Invited Paper In this paper, we consider the problem
More informationAutomatic Commercial Monitoring for TV Broadcasting Using Audio Fingerprinting
Automatic Commercial Monitoring for TV Broadcasting Using Audio Fingerprinting Dalwon Jang 1, Seungjae Lee 2, Jun Seok Lee 2, Minho Jin 1, Jin S. Seo 2, Sunil Lee 1 and Chang D. Yoo 1 1 Korea Advanced
More informationRobust Joint Source-Channel Coding for Image Transmission Over Wireless Channels
962 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 10, NO. 6, SEPTEMBER 2000 Robust Joint Source-Channel Coding for Image Transmission Over Wireless Channels Jianfei Cai and Chang
More informationAn Efficient Low Bit-Rate Video-Coding Algorithm Focusing on Moving Regions
1128 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 11, NO. 10, OCTOBER 2001 An Efficient Low Bit-Rate Video-Coding Algorithm Focusing on Moving Regions Kwok-Wai Wong, Kin-Man Lam,
More informationChannel models for high-capacity information hiding in images
Channel models for high-capacity information hiding in images Johann A. Briffa a, Manohar Das b School of Engineering and Computer Science Oakland University, Rochester MI 48309 ABSTRACT We consider the
More informationEMBEDDED ZEROTREE WAVELET CODING WITH JOINT HUFFMAN AND ARITHMETIC CODING
EMBEDDED ZEROTREE WAVELET CODING WITH JOINT HUFFMAN AND ARITHMETIC CODING Harmandeep Singh Nijjar 1, Charanjit Singh 2 1 MTech, Department of ECE, Punjabi University Patiala 2 Assistant Professor, Department
More informationSpatial Error Concealment Technique for Losslessly Compressed Images Using Data Hiding in Error-Prone Channels
168 JOURNAL OF COMMUNICATIONS AND NETWORKS, VOL. 12, NO. 2, APRIL 2010 Spatial Error Concealment Technique for Losslessly Compressed Images Using Data Hiding in Error-Prone Channels Kyung-Su Kim, Hae-Yeoun
More informationResearch Article Design and Analysis of a High Secure Video Encryption Algorithm with Integrated Compression and Denoising Block
Research Journal of Applied Sciences, Engineering and Technology 11(6): 603-609, 2015 DOI: 10.19026/rjaset.11.2019 ISSN: 2040-7459; e-issn: 2040-7467 2015 Maxwell Scientific Publication Corp. Submitted:
More informationPERCEPTUAL QUALITY ASSESSMENT FOR VIDEO WATERMARKING. Stefan Winkler, Elisa Drelie Gelasca, Touradj Ebrahimi
PERCEPTUAL QUALITY ASSESSMENT FOR VIDEO WATERMARKING Stefan Winkler, Elisa Drelie Gelasca, Touradj Ebrahimi Genista Corporation EPFL PSE Genimedia 15 Lausanne, Switzerland http://www.genista.com/ swinkler@genimedia.com
More informationWYNER-ZIV VIDEO CODING WITH LOW ENCODER COMPLEXITY
WYNER-ZIV VIDEO CODING WITH LOW ENCODER COMPLEXITY (Invited Paper) Anne Aaron and Bernd Girod Information Systems Laboratory Stanford University, Stanford, CA 94305 {amaaron,bgirod}@stanford.edu Abstract
More informationOptimal look-up table-based data hiding
Published in IET Signal Processing Received on 9th December 2008 Revised on 19th December 2009 Optimal look-up table-based data hiding X. Wang X.-P. Zhang ISSN 1751-9675 Department of Electrical & Computer
More informationStudy and Analysis of Robust DWT-SVD Domain Based Digital Image Watermarking Technique Using MATLAB
2015 IEEE International Conference on Computational Intelligence & Communication Technology Study and Analysis of Robust DWT-SVD Domain Based Digital Image Watermarking Technique Using MATLAB Asna Furqan
More informationError Performance Analysis of a Concatenated Coding Scheme with 64/256-QAM Trellis Coded Modulation for the North American Cable Modem Standard
Error Performance Analysis of a Concatenated Coding Scheme with 64/256-QAM Trellis Coded Modulation for the North American Cable Modem Standard Dojun Rhee and Robert H. Morelos-Zaragoza LSI Logic Corporation
More informationResearch Article. ISSN (Print) *Corresponding author Shireen Fathima
Scholars Journal of Engineering and Technology (SJET) Sch. J. Eng. Tech., 2014; 2(4C):613-620 Scholars Academic and Scientific Publisher (An International Publisher for Academic and Scientific Resources)
More informationSteganographic Technique for Hiding Secret Audio in an Image
Steganographic Technique for Hiding Secret Audio in an Image 1 Aiswarya T, 2 Mansi Shah, 3 Aishwarya Talekar, 4 Pallavi Raut 1,2,3 UG Student, 4 Assistant Professor, 1,2,3,4 St John of Engineering & Management,
More informationComparative Analysis of Wavelet Transform and Wavelet Packet Transform for Image Compression at Decomposition Level 2
2011 International Conference on Information and Network Technology IPCSIT vol.4 (2011) (2011) IACSIT Press, Singapore Comparative Analysis of Wavelet Transform and Wavelet Packet Transform for Image Compression
More informationNUMEROUS elaborate attempts have been made in the
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 46, NO. 12, DECEMBER 1998 1555 Error Protection for Progressive Image Transmission Over Memoryless and Fading Channels P. Greg Sherwood and Kenneth Zeger, Senior
More informationUnequal Error Protection Codes for Wavelet Image Transmission over W-CDMA, AWGN and Rayleigh Fading Channels
Unequal Error Protection Codes for Wavelet Image Transmission over W-CDMA, AWGN and Rayleigh Fading Channels MINH H. LE and RANJITH LIYANA-PATHIRANA School of Engineering and Industrial Design College
More informationPerformance Improvement of AMBE 3600 bps Vocoder with Improved FEC
Performance Improvement of AMBE 3600 bps Vocoder with Improved FEC Ali Ekşim and Hasan Yetik Center of Research for Advanced Technologies of Informatics and Information Security (TUBITAK-BILGEM) Turkey
More information52 IEEE TRANSACTIONS ON MULTIMEDIA, VOL. 7, NO. 1, FEBRUARY 2005
52 IEEE TRANSACTIONS ON MULTIMEDIA, VOL. 7, NO. 1, FEBRUARY 2005 Spatially Localized Image-Dependent Watermarking for Statistical Invisibility and Collusion Resistance Karen Su, Student Member, IEEE, Deepa
More informationCHAPTER 8 CONCLUSION AND FUTURE SCOPE
124 CHAPTER 8 CONCLUSION AND FUTURE SCOPE Data hiding is becoming one of the most rapidly advancing techniques the field of research especially with increase in technological advancements in internet and
More informationError Resilience for Compressed Sensing with Multiple-Channel Transmission
Journal of Information Hiding and Multimedia Signal Processing c 2015 ISSN 2073-4212 Ubiquitous International Volume 6, Number 5, September 2015 Error Resilience for Compressed Sensing with Multiple-Channel
More informationISSN (Print) Original Research Article. Coimbatore, Tamil Nadu, India
Scholars Journal of Engineering and Technology (SJET) Sch. J. Eng. Tech., 016; 4(1):1-5 Scholars Academic and Scientific Publisher (An International Publisher for Academic and Scientific Resources) www.saspublisher.com
More informationA Novel Approach towards Video Compression for Mobile Internet using Transform Domain Technique
A Novel Approach towards Video Compression for Mobile Internet using Transform Domain Technique Dhaval R. Bhojani Research Scholar, Shri JJT University, Jhunjunu, Rajasthan, India Ved Vyas Dwivedi, PhD.
More informationENCODING OF PREDICTIVE ERROR FRAMES IN RATE SCALABLE VIDEO CODECS USING WAVELET SHRINKAGE. Eduardo Asbun, Paul Salama, and Edward J.
ENCODING OF PREDICTIVE ERROR FRAMES IN RATE SCALABLE VIDEO CODECS USING WAVELET SHRINKAGE Eduardo Asbun, Paul Salama, and Edward J. Delp Video and Image Processing Laboratory (VIPER) School of Electrical
More informationCERIAS Tech Report Preprocessing and Postprocessing Techniques for Encoding Predictive Error Frames in Rate Scalable Video Codecs by E
CERIAS Tech Report 2001-118 Preprocessing and Postprocessing Techniques for Encoding Predictive Error Frames in Rate Scalable Video Codecs by E Asbun, P Salama, E Delp Center for Education and Research
More informationMULTI-STATE VIDEO CODING WITH SIDE INFORMATION. Sila Ekmekci Flierl, Thomas Sikora
MULTI-STATE VIDEO CODING WITH SIDE INFORMATION Sila Ekmekci Flierl, Thomas Sikora Technical University Berlin Institute for Telecommunications D-10587 Berlin / Germany ABSTRACT Multi-State Video Coding
More information2-Dimensional Image Compression using DCT and DWT Techniques
2-Dimensional Image Compression using DCT and DWT Techniques Harmandeep Singh Chandi, V. K. Banga Abstract Image compression has become an active area of research in the field of Image processing particularly
More informationColour Reproduction Performance of JPEG and JPEG2000 Codecs
Colour Reproduction Performance of JPEG and JPEG000 Codecs A. Punchihewa, D. G. Bailey, and R. M. Hodgson Institute of Information Sciences & Technology, Massey University, Palmerston North, New Zealand
More informationDICOM medical image watermarking of ECG signals using EZW algorithm. A. Kannammal* and S. Subha Rani
126 Int. J. Medical Engineering and Informatics, Vol. 5, No. 2, 2013 DICOM medical image watermarking of ECG signals using EZW algorithm A. Kannammal* and S. Subha Rani ECE Department, PSG College of Technology,
More informationSkip Length and Inter-Starvation Distance as a Combined Metric to Assess the Quality of Transmitted Video
Skip Length and Inter-Starvation Distance as a Combined Metric to Assess the Quality of Transmitted Video Mohamed Hassan, Taha Landolsi, Husameldin Mukhtar, and Tamer Shanableh College of Engineering American
More informationMULTI WAVELETS WITH INTEGER MULTI WAVELETS TRANSFORM ALGORITHM FOR IMAGE COMPRESSION. Pondicherry Engineering College, Puducherry.
Volume 116 No. 21 2017, 251-257 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu MULTI WAVELETS WITH INTEGER MULTI WAVELETS TRANSFORM ALGORITHM FOR
More informationNearest-neighbor and Bilinear Resampling Factor Estimation to Detect Blockiness or Blurriness of an Image*
Nearest-neighbor and Bilinear Resampling Factor Estimation to Detect Blockiness or Blurriness of an Image* Ariawan Suwendi Prof. Jan P. Allebach Purdue University - West Lafayette, IN *Research supported
More informationCONSTRUCTION OF LOW-DISTORTED MESSAGE-RICH VIDEOS FOR PERVASIVE COMMUNICATION
2016 International Computer Symposium CONSTRUCTION OF LOW-DISTORTED MESSAGE-RICH VIDEOS FOR PERVASIVE COMMUNICATION 1 Zhen-Yu You ( ), 2 Yu-Shiuan Tsai ( ) and 3 Wen-Hsiang Tsai ( ) 1 Institute of Information
More informationUniversity of Bristol - Explore Bristol Research. Peer reviewed version. Link to published version (if available): /ISCAS.2005.
Wang, D., Canagarajah, CN., & Bull, DR. (2005). S frame design for multiple description video coding. In IEEE International Symposium on Circuits and Systems (ISCAS) Kobe, Japan (Vol. 3, pp. 19 - ). Institute
More informationDigital Video Telemetry System
Digital Video Telemetry System Item Type text; Proceedings Authors Thom, Gary A.; Snyder, Edwin Publisher International Foundation for Telemetering Journal International Telemetering Conference Proceedings
More informationINTRA-FRAME WAVELET VIDEO CODING
INTRA-FRAME WAVELET VIDEO CODING Dr. T. Morris, Mr. D. Britch Department of Computation, UMIST, P. O. Box 88, Manchester, M60 1QD, United Kingdom E-mail: t.morris@co.umist.ac.uk dbritch@co.umist.ac.uk
More information176 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 13, NO. 2, FEBRUARY 2003
176 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 13, NO. 2, FEBRUARY 2003 Transactions Letters Error-Resilient Image Coding (ERIC) With Smart-IDCT Error Concealment Technique for
More informationMotion Video Compression
7 Motion Video Compression 7.1 Motion video Motion video contains massive amounts of redundant information. This is because each image has redundant information and also because there are very few changes
More informationMEMORY ERROR COMPENSATION TECHNIQUES FOR JPEG2000. Yunus Emre and Chaitali Chakrabarti
MEMORY ERROR COMPENSATION TECHNIQUES FOR JPEG2000 Yunus Emre and Chaitali Chakrabarti School of Electrical, Computer and Energy Engineering Arizona State University, Tempe, AZ 85287 {yemre,chaitali}@asu.edu
More information3D MR Image Compression Techniques based on Decimated Wavelet Thresholding Scheme
3D MR Image Compression Techniques based on Decimated Wavelet Thresholding Scheme Dr. P.V. Naganjaneyulu Professor & Principal, Department of ECE, PNC & Vijai Institute of Engineering & Technology, Repudi,
More informationAdaptive decoding of convolutional codes
Adv. Radio Sci., 5, 29 214, 27 www.adv-radio-sci.net/5/29/27/ Author(s) 27. This work is licensed under a Creative Commons License. Advances in Radio Science Adaptive decoding of convolutional codes K.
More informationRegion Adaptive Unsharp Masking based DCT Interpolation for Efficient Video Intra Frame Up-sampling
International Conference on Electronic Design and Signal Processing (ICEDSP) 0 Region Adaptive Unsharp Masking based DCT Interpolation for Efficient Video Intra Frame Up-sampling Aditya Acharya Dept. of
More informationPCM ENCODING PREPARATION... 2 PCM the PCM ENCODER module... 4
PCM ENCODING PREPARATION... 2 PCM... 2 PCM encoding... 2 the PCM ENCODER module... 4 front panel features... 4 the TIMS PCM time frame... 5 pre-calculations... 5 EXPERIMENT... 5 patching up... 6 quantizing
More informationCOMPRESSION OF DICOM IMAGES BASED ON WAVELETS AND SPIHT FOR TELEMEDICINE APPLICATIONS
COMPRESSION OF IMAGES BASED ON WAVELETS AND FOR TELEMEDICINE APPLICATIONS 1 B. Ramakrishnan and 2 N. Sriraam 1 Dept. of Biomedical Engg., Manipal Institute of Technology, India E-mail: rama_bala@ieee.org
More informationPerformance of a Low-Complexity Turbo Decoder and its Implementation on a Low-Cost, 16-Bit Fixed-Point DSP
Performance of a ow-complexity Turbo Decoder and its Implementation on a ow-cost, 6-Bit Fixed-Point DSP Ken Gracie, Stewart Crozier, Andrew Hunt, John odge Communications Research Centre 370 Carling Avenue,
More informationThe Development of a Synthetic Colour Test Image for Subjective and Objective Quality Assessment of Digital Codecs
2005 Asia-Pacific Conference on Communications, Perth, Western Australia, 3-5 October 2005. The Development of a Synthetic Colour Test Image for Subjective and Objective Quality Assessment of Digital Codecs
More informationReduced-reference image quality assessment using energy change in reorganized DCT domain
ISSN : 0974-7435 Volume 7 Issue 10 Reduced-reference image quality assessment using energy change in reorganized DCT domain Sheng Ding 1, Mei Yu 1,2 *, Xin Jin 1, Yang Song 1, Kaihui Zheng 1, Gangyi Jiang
More informationA SVD BASED SCHEME FOR POST PROCESSING OF DCT CODED IMAGES
Electronic Letters on Computer Vision and Image Analysis 8(3): 1-14, 2009 A SVD BASED SCHEME FOR POST PROCESSING OF DCT CODED IMAGES Vinay Kumar Srivastava Assistant Professor, Department of Electronics
More informationA LOW COST TRANSPORT STREAM (TS) GENERATOR USED IN DIGITAL VIDEO BROADCASTING EQUIPMENT MEASUREMENTS
A LOW COST TRANSPORT STREAM (TS) GENERATOR USED IN DIGITAL VIDEO BROADCASTING EQUIPMENT MEASUREMENTS Radu Arsinte Technical University Cluj-Napoca, Faculty of Electronics and Telecommunication, Communication
More informationTERRESTRIAL broadcasting of digital television (DTV)
IEEE TRANSACTIONS ON BROADCASTING, VOL 51, NO 1, MARCH 2005 133 Fast Initialization of Equalizers for VSB-Based DTV Transceivers in Multipath Channel Jong-Moon Kim and Yong-Hwan Lee Abstract This paper
More informationTransmission System for ISDB-S
Transmission System for ISDB-S HISAKAZU KATOH, SENIOR MEMBER, IEEE Invited Paper Broadcasting satellite (BS) digital broadcasting of HDTV in Japan is laid down by the ISDB-S international standard. Since
More informationINTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATION ENGINEERING & TECHNOLOGY (IJECET)
INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATION ENGINEERING & TECHNOLOGY (IJECET) International Journal of Electronics and Communication Engineering & Technology (IJECET), ISSN 0976 ISSN 0976 6464(Print)
More informationPACKET-SWITCHED networks have become ubiquitous
IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 13, NO. 7, JULY 2004 885 Video Compression for Lossy Packet Networks With Mode Switching and a Dual-Frame Buffer Athanasios Leontaris, Student Member, IEEE,
More informationVideo coding standards
Video coding standards Video signals represent sequences of images or frames which can be transmitted with a rate from 5 to 60 frames per second (fps), that provides the illusion of motion in the displayed
More informationReducing False Positives in Video Shot Detection
Reducing False Positives in Video Shot Detection Nithya Manickam Computer Science & Engineering Department Indian Institute of Technology, Bombay Powai, India - 400076 mnitya@cse.iitb.ac.in Sharat Chandran
More informationUsing Raw Speech as a Watermark, Does it work?
Using Raw Speech as a Watermark, Does it work? P. Nintanavongsa and T. Amomraksa Multimedia Communications Laboratory, Department of Computer Engineering, King Mongkut's University of Technology Thonburi,
More informationHardware Implementation of Viterbi Decoder for Wireless Applications
Hardware Implementation of Viterbi Decoder for Wireless Applications Bhupendra Singh 1, Sanjeev Agarwal 2 and Tarun Varma 3 Deptt. of Electronics and Communication Engineering, 1 Amity School of Engineering
More informationJoint Optimization of Source-Channel Video Coding Using the H.264/AVC encoder and FEC Codes. Digital Signal and Image Processing Lab
Joint Optimization of Source-Channel Video Coding Using the H.264/AVC encoder and FEC Codes Digital Signal and Image Processing Lab Simone Milani Ph.D. student simone.milani@dei.unipd.it, Summer School
More informationHigher-Order Modulation and Turbo Coding Options for the CDM-600 Satellite Modem
Higher-Order Modulation and Turbo Coding Options for the CDM-600 Satellite Modem * 8-PSK Rate 3/4 Turbo * 16-QAM Rate 3/4 Turbo * 16-QAM Rate 3/4 Viterbi/Reed-Solomon * 16-QAM Rate 7/8 Viterbi/Reed-Solomon
More informationTRAFFIC SURVEILLANCE VIDEO MANAGEMENT SYSTEM
TRAFFIC SURVEILLANCE VIDEO MANAGEMENT SYSTEM K.Ganesan*, Kavitha.C, Kriti Tandon, Lakshmipriya.R TIFAC-Centre of Relevance and Excellence in Automotive Infotronics*, School of Information Technology and
More informationAUDIOVISUAL COMMUNICATION
AUDIOVISUAL COMMUNICATION Laboratory Session: Recommendation ITU-T H.261 Fernando Pereira The objective of this lab session about Recommendation ITU-T H.261 is to get the students familiar with many aspects
More informationPart 2.4 Turbo codes. p. 1. ELEC 7073 Digital Communications III, Dept. of E.E.E., HKU
Part 2.4 Turbo codes p. 1 Overview of Turbo Codes The Turbo code concept was first introduced by C. Berrou in 1993. The name was derived from an iterative decoding algorithm used to decode these codes
More informationPERCEPTUAL QUALITY OF H.264/AVC DEBLOCKING FILTER
PERCEPTUAL QUALITY OF H./AVC DEBLOCKING FILTER Y. Zhong, I. Richardson, A. Miller and Y. Zhao School of Enginnering, The Robert Gordon University, Schoolhill, Aberdeen, AB1 1FR, UK Phone: + 1, Fax: + 1,
More informationImage watermarking technique in MDCT domain exploiting the properties of the JND model
watermarking technique in MDCT domain exploiting the properties of the JND model [ Maha Bellaaj, Kais Ouni ] Abstract View the development of the internet in the 90s and the orientation of the world to
More informationResearch Topic. Error Concealment Techniques in H.264/AVC for Wireless Video Transmission in Mobile Networks
Research Topic Error Concealment Techniques in H.264/AVC for Wireless Video Transmission in Mobile Networks July 22 nd 2008 Vineeth Shetty Kolkeri EE Graduate,UTA 1 Outline 2. Introduction 3. Error control
More informationSchemes for Wireless JPEG2000
Quality Assessment of Error Protection Schemes for Wireless JPEG2000 Muhammad Imran Iqbal and Hans-Jürgen Zepernick Blekinge Institute of Technology Research report No. 2010:04 Quality Assessment of Error
More informationWipe Scene Change Detection in Video Sequences
Wipe Scene Change Detection in Video Sequences W.A.C. Fernando, C.N. Canagarajah, D. R. Bull Image Communications Group, Centre for Communications Research, University of Bristol, Merchant Ventures Building,
More informationAn Implementation of a Forward Error Correction Technique using Convolution Encoding with Viterbi Decoding
An Implementation of a Forward Error Correction Technique using Convolution Encoding with Viterbi Decoding Himmat Lal Kumawat, Sandhya Sharma Abstract This paper, as the name suggests, shows the working
More informationIntra-frame JPEG-2000 vs. Inter-frame Compression Comparison: The benefits and trade-offs for very high quality, high resolution sequences
Intra-frame JPEG-2000 vs. Inter-frame Compression Comparison: The benefits and trade-offs for very high quality, high resolution sequences Michael Smith and John Villasenor For the past several decades,
More informationModule 8 VIDEO CODING STANDARDS. Version 2 ECE IIT, Kharagpur
Module 8 VIDEO CODING STANDARDS Lesson 27 H.264 standard Lesson Objectives At the end of this lesson, the students should be able to: 1. State the broad objectives of the H.264 standard. 2. List the improved
More informationRobust Transmission of H.264/AVC Video using 64-QAM and unequal error protection
Robust Transmission of H.264/AVC Video using 64-QAM and unequal error protection Ahmed B. Abdurrhman 1, Michael E. Woodward 1 and Vasileios Theodorakopoulos 2 1 School of Informatics, Department of Computing,
More informationImplementation of CRC and Viterbi algorithm on FPGA
Implementation of CRC and Viterbi algorithm on FPGA S. V. Viraktamath 1, Akshata Kotihal 2, Girish V. Attimarad 3 1 Faculty, 2 Student, Dept of ECE, SDMCET, Dharwad, 3 HOD Department of E&CE, Dayanand
More informationMPEG has been established as an international standard
1100 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 9, NO. 7, OCTOBER 1999 Fast Extraction of Spatially Reduced Image Sequences from MPEG-2 Compressed Video Junehwa Song, Member,
More informationFigure 2: Original and PAM modulated image. Figure 4: Original image.
Figure 2: Original and PAM modulated image. Figure 4: Original image. An image can be represented as a 1D signal by replacing all the rows as one row. This gives us our image as a 1D signal. Suppose x(t)
More informationRobust 3-D Video System Based on Modified Prediction Coding and Adaptive Selection Mode Error Concealment Algorithm
International Journal of Signal Processing Systems Vol. 2, No. 2, December 2014 Robust 3-D Video System Based on Modified Prediction Coding and Adaptive Selection Mode Error Concealment Algorithm Walid
More informationImage Compression Techniques Using Discrete Wavelet Decomposition with Its Thresholding Approaches
Image Compression Techniques Using Discrete Wavelet Decomposition with Its Thresholding Approaches ABSTRACT: V. Manohar Asst. Professor, Dept of ECE, SR Engineering College, Warangal (Dist.), Telangana,
More information(12) (10) Patent No.: US 7,197,164 B2. Levy (45) Date of Patent: Mar. 27, 2007
United States Patent US007 1971 64B2 (12) () Patent No.: Levy (45) Date of Patent: Mar. 27, 2007 (54) TIME-VARYING VIDEO WATERMARK 5,9,044 A 6/1999 Gardos et al.... 382,236 5,9,377 A 7/1999 Powell et al.......
More informationThe Design of Efficient Viterbi Decoder and Realization by FPGA
Modern Applied Science; Vol. 6, No. 11; 212 ISSN 1913-1844 E-ISSN 1913-1852 Published by Canadian Center of Science and Education The Design of Efficient Viterbi Decoder and Realization by FPGA Liu Yanyan
More informationDigital Color Images Ownership Authentication via Efficient and Robust Watermarking in a Hybrid Domain
536 M. CEDILLO-HERNANDEZ, A. CEDILLO-HERNANDEZ, F. GARCIA-UGALDE, ET AL., DIGITAL COLOR IMAGES OWNERSHIP Digital Color Images Ownership Authentication via Efficient and Robust Watermarking in a Hybrid
More informationColor Quantization of Compressed Video Sequences. Wan-Fung Cheung, and Yuk-Hee Chan, Member, IEEE 1 CSVT
CSVT -02-05-09 1 Color Quantization of Compressed Video Sequences Wan-Fung Cheung, and Yuk-Hee Chan, Member, IEEE 1 Abstract This paper presents a novel color quantization algorithm for compressed video
More informationDELTA MODULATION AND DPCM CODING OF COLOR SIGNALS
DELTA MODULATION AND DPCM CODING OF COLOR SIGNALS Item Type text; Proceedings Authors Habibi, A. Publisher International Foundation for Telemetering Journal International Telemetering Conference Proceedings
More informationFPGA Implementation of Convolutional Encoder And Hard Decision Viterbi Decoder
FPGA Implementation of Convolutional Encoder And Hard Decision Viterbi Decoder JTulasi, TVenkata Lakshmi & MKamaraju Department of Electronics and Communication Engineering, Gudlavalleru Engineering College,
More informationScalable Foveated Visual Information Coding and Communications
Scalable Foveated Visual Information Coding and Communications Ligang Lu,1 Zhou Wang 2 and Alan C. Bovik 2 1 Multimedia Technologies, IBM T. J. Watson Research Center, Yorktown Heights, NY 10598, USA 2
More informationBehavior Forensics for Scalable Multiuser Collusion: Fairness Versus Effectiveness H. Vicky Zhao, Member, IEEE, and K. J. Ray Liu, Fellow, IEEE
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, VOL. 1, NO. 3, SEPTEMBER 2006 311 Behavior Forensics for Scalable Multiuser Collusion: Fairness Versus Effectiveness H. Vicky Zhao, Member, IEEE,
More information... A Pseudo-Statistical Approach to Commercial Boundary Detection. Prasanna V Rangarajan Dept of Electrical Engineering Columbia University
A Pseudo-Statistical Approach to Commercial Boundary Detection........ Prasanna V Rangarajan Dept of Electrical Engineering Columbia University pvr2001@columbia.edu 1. Introduction Searching and browsing
More informationExtraction Methods of Watermarks from Linearly-Distorted Images to Maximize Signal-to-Noise Ratio. Brandon Migdal. Advisors: Carl Salvaggio
Extraction Methods of Watermarks from Linearly-Distorted Images to Maximize Signal-to-Noise Ratio By Brandon Migdal Advisors: Carl Salvaggio Chris Honsinger A senior project submitted in partial fulfillment
More informationRobust Transmission of H.264/AVC Video Using 64-QAM and Unequal Error Protection
Robust Transmission of H.264/AVC Video Using 64-QAM and Unequal Error Protection Ahmed B. Abdurrhman, Michael E. Woodward, and Vasileios Theodorakopoulos School of Informatics, Department of Computing,
More informationDistortion Compensated Lookup-Table Embedding: Joint Security and Robustness Enhancement for Quantization Based Data Hiding
Distortion Compensated Lookup-Table Embedding: Joint Security and Robustness Enhancement for Quantization Based Data Hiding Min Wu ECE Department, University of Maryland, College Park, U.S.A. ABSTRACT
More informationContents. xv xxi xxiii xxiv. 1 Introduction 1 References 4
Contents List of figures List of tables Preface Acknowledgements xv xxi xxiii xxiv 1 Introduction 1 References 4 2 Digital video 5 2.1 Introduction 5 2.2 Analogue television 5 2.3 Interlace 7 2.4 Picture
More informationTranscription of the Singing Melody in Polyphonic Music
Transcription of the Singing Melody in Polyphonic Music Matti Ryynänen and Anssi Klapuri Institute of Signal Processing, Tampere University Of Technology P.O.Box 553, FI-33101 Tampere, Finland {matti.ryynanen,
More informationModule 8 VIDEO CODING STANDARDS. Version 2 ECE IIT, Kharagpur
Module 8 VIDEO CODING STANDARDS Lesson 24 MPEG-2 Standards Lesson Objectives At the end of this lesson, the students should be able to: 1. State the basic objectives of MPEG-2 standard. 2. Enlist the profiles
More informationAN UNEQUAL ERROR PROTECTION SCHEME FOR MULTIPLE INPUT MULTIPLE OUTPUT SYSTEMS. M. Farooq Sabir, Robert W. Heath and Alan C. Bovik
AN UNEQUAL ERROR PROTECTION SCHEME FOR MULTIPLE INPUT MULTIPLE OUTPUT SYSTEMS M. Farooq Sabir, Robert W. Heath and Alan C. Bovik Dept. of Electrical and Comp. Engg., The University of Texas at Austin,
More informationReduced complexity MPEG2 video post-processing for HD display
Downloaded from orbit.dtu.dk on: Dec 17, 2017 Reduced complexity MPEG2 video post-processing for HD display Virk, Kamran; Li, Huiying; Forchhammer, Søren Published in: IEEE International Conference on
More informationECE 5765 Modern Communication Fall 2005, UMD Experiment 10: PRBS Messages, Eye Patterns & Noise Simulation using PRBS
ECE 5765 Modern Communication Fall 2005, UMD Experiment 10: PRBS Messages, Eye Patterns & Noise Simulation using PRBS modules basic: SEQUENCE GENERATOR, TUNEABLE LPF, ADDER, BUFFER AMPLIFIER extra basic:
More informationColor Image Compression Using Colorization Based On Coding Technique
Color Image Compression Using Colorization Based On Coding Technique D.P.Kawade 1, Prof. S.N.Rawat 2 1,2 Department of Electronics and Telecommunication, Bhivarabai Sawant Institute of Technology and Research
More informationProject Proposal: Sub pixel motion estimation for side information generation in Wyner- Ziv decoder.
EE 5359 MULTIMEDIA PROCESSING Subrahmanya Maira Venkatrav 1000615952 Project Proposal: Sub pixel motion estimation for side information generation in Wyner- Ziv decoder. Wyner-Ziv(WZ) encoder is a low
More informationFast MBAFF/PAFF Motion Estimation and Mode Decision Scheme for H.264
Fast MBAFF/PAFF Motion Estimation and Mode Decision Scheme for H.264 Ju-Heon Seo, Sang-Mi Kim, Jong-Ki Han, Nonmember Abstract-- In the H.264, MBAFF (Macroblock adaptive frame/field) and PAFF (Picture
More information