Network coding (NC) is considered a new paradigm for distributed networks. However, NC has an all-or-nothing property. In this paper, we propose a sparse recovery approach using sparse sensing matrix to solve the NC all-or-nothing problem over a finite field. The effectiveness of the proposed approach is evaluated based on a sensor network.

The error resilient entropy coding (EREC) provides efficient resynchronization method to the coded bitstream, which might be corrupted by transmission errors. The technique has been given more prominence, nowadays, because it achieves fast resynchronization without sizable overhead, and thereby provides graceful quality degradation according to the network conditions. This paper presents a novel framework to analyze the performance of EREC in terms of the error probability in decoding a basic resynchronization unit (RU) for various error prone networks. In order to show the feasibility of the proposed framework, this paper also proposes a novel EREC algorithm based on the slightly modified H.263 bitstream syntax. The proposed scheme minimizes the effect of errors on low frequency DCT coefficients and incorporates near optimal channel-matched searching pattern (SP), which guarantees the best possible quality of reproduced video. Given the number of bits generated for each RU, the near optimal SP is produced by the proposed iterative deterministic partial SP update method, which reduces the complexity of finding optimal solution, O((N-1)!), to O(m·N2). The proposed EREC algorithm significantly improves the decoded video quality, especially when the bit error rate is in the rage of 10-3-10-4. Up to 5 dB enhancement of the PSNR value was observed in a single video frame.

This paper describes a channel-adaptive packet scheduler for improved error control performance in a peer-cooperative distributed media streaming system. The proposed packet-scheduling algorithm was designed for the case in which streaming server peers rely on an error-recovery strategy using retransmission and application-layer automatic repeat request rather than error protection using forward error correction. The proposed scheduler can maximize retransmission opportunities and reduce the frame loss rate by using the observed channel status from each server peer. Simulation results show that the proposed algorithm enhances error-recovery performance in distributed multimedia streaming better than other schedulers.

In transcoding, it is well known that refinement of the motion vectors is critical to enhance the quality of transcoded video while significantly reducing transcoding complexity. This paper proposes a novel cost model to estimate the rate-distortion cost of motion vector composition in order to develop a reliable motion vector re-estimation method that has reasonable computation cost. Based on a statistical analysis of motion compensated prediction errors, we design a basic form of the proposed cost model as a function of distance from the optimal motion vector. Simulations with a transcoder employing the proposed cost model demonstrate a significant quality gain over representative video transcoding schemes with no complexity increase.

In this paper, we propose an optimal bit rate control algorithm which is fully compatible with MPEG-4 or H.263+. The proposed algorithm is designed to identify the optimal quantizer set through Lagrangian optimization when used for optimal bit allocation. To find the optimal quantizer set, we make use of the Viterbi algorithm in order to solve the dependency between quantization parameters of each macroblock due to the unique characteristics of MPEG-4 or H.263+. We set the Lagrangian cost function as a cost function of the Viterbi algorithm. We implement the proposed algorithm in MPEG-4 coders and compare its performance to the VM8 and optimal bit rate control algorithm, using independent quantization parameters in the circumstance of a low bit rate.

Due to the decoding procedure and filtering for edge detection, the feature extraction process of MPEG-7 Edge Histogram Descriptor (EHD) is time-consuming and computationally expensive. We proposed the fast EHD generation method in wavelet domain of JPEG2000 images. Experimental results demonstrate the advantage of this method over EHD.

Fast schemes for compressed-domain image size change, are proposed. Fast Winograd DCTs are applied to resizing images by a factor of two to one. First, we speed up the DCT domain downsampling scheme which uses the bilinear interpolation. Then, we speed up other image resizing schemes which use DCT lowpass truncated approximations. The schemes proposed here reduce the computational complexities significantly, while there is no difference in the overall quality of the images compared to previous works.

This paper introduces the concept of order complexity, which represents the minimum number of partial ordering operations to make a string of perfectly ordered symbols. A novel variable-length code expressing such order complexity using binary digits is proposed herein. The proposed code is general, uniquely decipherable, and useful for coding a string of random permuted symbols having unknown statistics or which are preferred to have a uniform distribution.

Motion blur in TFT-LCD is caused by sample and hold characteristic, slow response time of liquid crystal, and the inconsistency between object tracking of the human eye and the actual object location. In order to solve this problem, a high frame rate driving method based on motion estimation and motion compensation has been applied to LCD products. However, as the required processing time of motion estimation increases in LCD TV and monitor systems, real-time video image processing becomes more difficult. Frame interpolation through the large macro block (MB) size has limitations to detect small objects. So, this paper proposes the efficient motion estimator architecture which uses seven kinds of macro blocks to enhance the accuracy of motion estimation and combines the parallel processing with pre-computation technology and hardware optimization for high-speed processing. Also, for increased efficiency in the hardware architecture, we employed an I2C (Inter Integrated Circuit) communication unit to control the key parameters easily through the personnel computer. Simulation results show that the critical path at the motion estimator is reduced by about 27.47% compared to the conventional structure. As a result, the proposed motion estimator will be applicable for the high-speed frame interpolation of variable video.

This paper proposes a novel image classification scheme for cloth pattern recognition. The rotation and scale invariant delta-HOG (DHOG)-based descriptor and the entire recognition process using random ferns with this descriptor are proposed independent from pose and scale changes. These methods consider maximun orientation and various radii of a circular patch window for fast and efficient classification even when cloth patches are rotated and the scale is changed. It exhibits good performance in cloth pattern recognition experiments. It found a greater number of similar cloth patches than dense-SIFT in 20 tests out of a total of 36 query tests. In addition, the proposed method is much faster than dense-SIFT in both training and testing; its time consumption is decreased by 57.7% in training and 41.4% in testing. The proposed method, therefore, is expected to contribute to real-time cloth searching service applications that update vast numbers of cloth images posted on the Internet.

In this paper, we propose a novel technique for film grain noise removal and synthesis that can be adopted in high fidelity video coding. Film grain noise enhances the natural appearance of high fidelity video, therefore, it should be preserved. However, film grain noise is a burden to typical video compression systems because it has relatively large energy levels in the high frequency region. In order to improve the coding performance while preserving film grain noise, we propose film grain noise removal in the pre-processing step and film grain noise synthesis in the post processing step. In the pre-processing step, the film grain noise is removed by using temporal and inter-color correlations. Specifically, color image denoisng using inter color prediction provides good denoising performance in the noise-concentrated B plane, because film grain noise has inter-color correlation in the RGB domain. In the post-processing step, we present a noise model to generate noise that is close to the actual noise in terms of a couple of observed statistical properties, such as the inter-color correlation and power of the film grain noise. The results show that the coding gain of the denoised video is higher than for previous works, while the visual quality of the final reconstructed video is well preserved.

This paper proposes an improved method of reversible data hiding with increased capacity. The conventional method determines whether to embed a data bit in an image block according to the statistics of pixels in that block. Some images have pixel statistics that are inadequate for data hiding, and seldom or never have data embedded in them. The proposed method modulates the statistics invertibility to overcome such disadvantages, and is also able to improve the quality of the image containing the hidden data using block-adaptive modulation. Simulationresults show the effectiveness of the proposed method.

This letter proposes an adaptive base plane filtering algorithm for the inter-plane estimation of RGB images in HEVC RExt. Because most high-frequency components of RGB images have low inter-plane correlation, our proposed scheme adaptively removes the high-frequency components of the base plane in order to enhance the inter-plane estimation accuracy. The experimental results show that the proposed scheme provides average BD rate gains of 0.6%, 1.0%, and 1.2% in the G, B, and R planes, respectively, with slightly decreased complexity, as compared to the previous inter-plane filtering method.

The performance of conventional error concealment (EC) is significantly affected by the method of selecting candidate motion vectors (MVs). In order to obtain more robust EC results, this letter proposes a new and efficient way to choose candidate MVs. The proposed approach systematically utilizes available neighboring MVs by exploiting a well-known spatiotemporal correlation of block MVs. Through extensive simulations with H.263, this letter demonstrates that the proposed candidate MVs provide superior concealed video quality in comparison to the best results of other existing techniques.

Error concealment is an essential part of reliable video communication systems because transmission errors are inevitable even when the coded bitstream is highly protected. The problem of temporal EC can be factored into two parts regarding candidate motion vectors (MVs) employed and the matching criterion to evaluate the fitness of each candidate MV. In order to obtain more faithful EC results, this paper proposes a novel iterative EC algorithm, in which an efficient way to provide candidate MVs and a new fitness measure are presented. The proposed approach for candidate MVs systematically utilizes all the available neighboring MVs by exploiting a well-known spatiotemporal correlation of block MVs. Also, in order to remove the dependency of a damaged block's quality of concealment on the already concealed adjacent blocks, we develope a new matching criterion. The objective of the proposed fitness measure is to minimize the total boundary matching errors induced by the whole corrupted blocks. Simulations performed using an H.263 codec demonstrate a significant improvement on the subjective and objective concealed video qualities, especially when the corrupted area is wider than a single row of coding blocks.

This letter proposes a novel depth-guided inpainting scheme for the high quality hole-filling in 2D-to-3D video conversion. The proposed scheme detects and removes foreground depth layers in an image patch, enabling appropriate patch formation using only disoccluded background information. This background only patch formation helps to avoid the propagation of wrong depths over hole area, and thus improve the overall quality of converted 3D video experience. Experimental results demonstrate the proposed scheme provides visually much more pleasing inpainting results with better preserved object edges compared to the state-of-the-art depth-guided inpainting schemes.