499 research outputs found
An efficient error resilience scheme based on wyner-ziv coding for region-of-Interest protection of wavelet based video transmission
In this paper, we propose a bandwidth efficient error resilience scheme for wavelet based video
transmission over wireless channel by introducing an additional Wyner-Ziv (WZ) stream to protect region of
interest (ROI) in a frame. In the proposed architecture, the main video stream is compressed by a generic
wavelet domain coding structure and passed through the error prone channel without any protection.
Meanwhile, the predefined ROI area related wavelet coefficients obtained after an integer wavelet transform
will be specially protected by WZ codec in an additional channel during transmission. At the decoder side, the error-prone ROI related wavelet coefficients will be used as side information to help decoding the WZ stream. Different size of WZ bit streams can be applied in order to meet different bandwidth condition and different
requirement of end users. The simulation results clearly revealed that the proposed scheme has distinct advantages in saving bandwidth comparing with fully applied FEC algorithm to whole video stream and in the meantime offer the robust transmission over error prone channel for certain video applications
Damaged watermarks detection in frequency domain as a primary method for video concealment
This paper deals with video transmission over lossy communication networks. The main idea is to develop video concealment method for information losses and errors correction. At the beginning, three main groups of video concealment methods, divided by encoder/decoder collaboration, are briefly described. The modified algorithm based on the detection and filtration of damaged watermark blocks encapsulated to the transmitted video was developed. Finally, the efficiency of developed algorithm is presented in experimental part of this paper
Recovering Sign Bits of DCT Coefficients in Digital Images as an Optimization Problem
Recovering unknown, missing, damaged, distorted or lost information in DCT
coefficients is a common task in multiple applications of digital image
processing, including image compression, selective image encryption, and image
communications. This paper investigates recovery of a special type of
information in DCT coefficients of digital images: sign bits. This problem can
be modelled as a mixed integer linear programming (MILP) problem, which is
NP-hard in general. To efficiently solve the problem, we propose two
approximation methods: 1) a relaxation-based method that convert the MILP
problem to a linear programming (LP) problem; 2) a divide-and-conquer method
which splits the target image into sufficiently small regions, each of which
can be more efficiently solved as an MILP problem, and then conducts a global
optimization phase as a smaller MILP problem or an LP problem to maximize
smoothness across different regions. To the best of our knowledge, we are the
first who considered how to use global optimization to recover sign bits of DCT
coefficients. We considered how the proposed methods can be applied to
JPEG-encoded images and conducted extensive experiments to validate the
performances of our proposed methods. The experimental results showed that the
proposed methods worked well, especially when the number of unknown sign bits
per DCT block is not too large. Compared with other existing methods, which are
all based on simple error-concealment strategies, our proposed methods
outperformed them with a substantial margin, both according to objective
quality metrics (PSNR and SSIM) and also our subjective evaluation. Our work
has a number of profound implications, e.g., more sign bits can be discarded to
develop more efficient image compression methods, and image encryption methods
based on sign bit encryption can be less secure than we previously understood.Comment: 13 pages, 8 figure
An overview Survey on Various Video compressions and its importance
With the rise of digital computing and visual data processing, the need for storage and transmission of video data became prevalent. Storage and transmission of uncompressed raw visual data is not a good practice, because it requires a large storage space and great bandwidth. Video compression algorithms can compress this raw visual data or video into smaller files with a little sacrifice on the quality. This paper an overview and comparison of standard efforts on video compression algorithm of: MPEG-1, MPEG-2, MPEG-4, MPEG-
Video transmission over a relay channel with a compress-forward code design
There is an increasing demand to support high data rate multimedia applications over the current day wireless networks which are highly prone to errors. Relay channels, by virtue of their spatial diversity, play a vital role in meeting this demand without much change to the current day systems. A compress-forward relaying scheme is one of the exciting prospects in this regard owing to its ability to always outperform direct transmission. With regards to video transmission, there is a serious need to ensure higher protection for the source bits that are more important and sensitive. The objective of this thesis is to develop a practical scheme for transmitting video data over a relay channel using a compress-forward relaying scheme and compare it to direct and multi-hop transmissions. We also develop a novel scheme whereby the relay channel can be used as a means to provide the required unequal error protection among the MPEG-2 bit stream. The area of compress-forward (CF) relaying has not been developed much to date, with most of the research directed towards the decode-forward scheme. The fact that compress-forward relaying always ensures better results than direct transmission is an added advantage. This has motivated us to employ CF relaying in our implementation. Video transmission and streaming applications are being increasingly sought after in the current generation wireless systems. The fact that video applications are bandwidth demanding and error prone, and the wireless systems are band-limited and unreliable, makes this a challenging task. CF relaying, by virtue of their path diversity, can be considered to be a new means for video transmission. To exploit the above advantages, we propose an implementation for video transmission over relay channels using a CF relaying scheme. Practical gains in peak signal-to-noise ratio (PSNR) have been observed for our implementation compared to the simple binary-input additive white Gaussian noise (BIAWGN) and two-hop transmission scenarios
- …