• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4C
• /
• pp.355-362
• /
• 2009

A new intra field deinterlacing algorithm with edge map in the image block is introduced. Conventional deinterlacing methods usually employ edge-based line average algorithm within pixel-by-pixel approach. However, it is sensitive to variation of intensity. To reduce this shortcoming, we proposed edge direction vector computed by edge map, and also its interpolation technique. We first introduce an edge direction vector, which is computed by Sobel mask, so that finer resolution of the edge direction can be acquired. The proposed edge direction vector oriented deinterlacer operates by identifying small pixel variations in five orientations, while weighted averaging to estimate missing pixel. According to the edge direction of the direction vector, we calculate weights on each edge direction. These weight values multiplied by the candidate deinterlaced pixels in order to successively build approximations of the deinterlaced sequence.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.6
• /
• pp.1377-1383
• /
• 2012

The first frame of a GOP is encoded in intra mode which generates a larger number of bits. In addition, the first frame is used for the inter mode encoding of the following frames. Thus the intial QP for the first frame affects the first frame as well as the following frames. Traditionally, the initial QP is determined among four constant values only depending on the bpp. Although this initialization scheme is simple, yet it is not accurate enough. An accurate intial QP prediction scheme should not only depends on bpp but also on the complexity of the video sequence and the output bandwidth. In this paper, we propose a traffic model for finding the optimal initial QP which maximizes the PSNR of the GOP. We also propose a method to find model parameters for real-time video encoding. It is shown by experimental results that the proposed traffic model captures initial QP characteristics effectively and the proposed method for model parameters accurately estimates the real values.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2012.07a
• /
• pp.87-88
• /
• 2012

Because intra prediction modes in H.264 are determined by the brightness continuity between neighboring blocks, they can be used as a method for extracting edge information in the compression domain. However, if we just consider 9 intra prediction modes in H.264 as 9 different edge directions, we have the following two problems. First, intra prediction modes tend to yield too many edge blocks, generating unnecessary edge information. Second, we may not need all 9 directional edges (including the DC type) in H.264 intra prediction modes. For example, the EHD (edge histogram descriptor) in MPEG-7 defines only 4 directional edge types, namely horizontal, vertical, diagonal (HVD) edges with $0^{\circ}$, $90^{\circ}$, $45^{\circ}$, and $135^{\circ}$. Here, semi-diagonal (SD) edge types with $112.5^{\circ}$, $157.5^{\circ}$, $22.5^{\circ}$, and $67.5^{\circ}$ in the intra prediction modes in H.264 are not used. In this paper. we prepose a method that removes unnecessary edges from the intra prediction modes by utilizing the total average coefficient of 4x4 blocks in each slice and assign SD edges to HVD (horizontal, vertical, diagonal, $0^{\circ}$, $90^{\circ}$, $45^{\circ}$, $135^{\circ}$) edges by the contextual information of the neighboring blocks. Experimental results show that the edges determined by the proposed method in the compression domain are comparable to those of the previous edge detection methods in the spatial domain.

• Journal of Broadcast Engineering
• /
• v.13 no.5
• /
• pp.732-743
• /
• 2008

In H.264/AVC, 4$\times$4 block transform is used for intra and inter prediction instead of 8$\times$8 block transform. Using small block size coding, H.264/AVC obtains high temporal prediction efficiency, however, it has limitation in utilizing spatial redundancy. Motivated on these points, we propose a multi-dimensional transform which achieves both the accuracy of temporal prediction as well as effective use of spatial redundancy. From preliminary experiments, the proposed multi-dimensional transform achieves higher energy compaction than 2-D DCT used in H.264. We designed an integer-based transform and quantization coder for multi-dimensional coder. Moreover, several additional methods for multi-dimensional coder are proposed, which are cube forming, scan order, mode decision and updating parameters. The Context-based Adaptive Variable-Length Coding (CAVLC) used in H.264 was employed for the entropy coder. Simulation results show that the performance of the multi-dimensional codec appears similar to that of H.264 in lower bit rates although the rate-distortion curves of the multi-dimensional DCT measured by entropy and the number of non-zero coefficients show remarkably higher performance than those of H.264/AVC. This implies that more efficient entropy coder optimized to the statistics of multi-dimensional DCT coefficients and rate-distortion operation are needed to take full advantage of the multi-dimensional DCT. There remains many issues and future works about multi-dimensional coder to improve coding efficiency over H.264/AVC.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.4
• /
• pp.58-66
• /
• 2009

Recently the emerging demands of the light-video encoder promotes lots of research efforts on DVC (Distributed Video Coding). As an appropriate video compression method, DVC has been studied, and Wyner-Ziv (WZ) video compression is its one representative structure. The WZ encoder splits the image into two kinds of frames, one is key frame which is compressed by conventional intra coding, and the other is WZ frame which is encoded by WZ coding. The WZ decoder decodes the key frame first, and estimates the WZ frame using temporal correlation between key frames. Estimated WZ frame (Side Information) cannot be the same as the original WZ frame due to the absence of the WZ frame information at decoder. As a result, the difference between the estimated and original WZ frames are regarded as virtual channel noise. The WZ frame is reconstructed by removing noise in side information. Therefore precise noise estimation produces good performance gain in WZ video compression by improving error correcting capability by channel code. But noise cannot be estimated precisely at WZ decoder unless there is good WZ frame information, and generally it is estimated from the difference of corresponding key frames. Also the estimated noise is limited by comparing with frame level noise to reduce the uncertainty of the estimation method. However these methods cannot provide good noise estimation for every frame or each bit plane. In this paper, we propose a noise nodel selection method which chooses a better noise model for each bit plane after generating candidate noise models. Experimental result shows PSNR gain up to 0.8 dB.