• ETRI Journal
• /
• v.31 no.2
• /
• pp.151-161
• /
• 2009

In this paper, we propose an adaptive multiview video coding scheme based on spatiotemporal correlation analyses using hierarchical B picture (AMVC-HBP) for the integrative encoding performances, including high compression efficiency, low complexity, fast random access, and view scalability, by integrating multiple prediction structures. We also propose an in-coding mode-switching algorithm that enables AMVC-HBP to adaptively select a better prediction structure in the encoding process without any additional complexity. Experimental results show that AMVC-HBP outperforms the previous multiview video coding scheme based on H.264/MPEG-4 AVC using the hierarchical B picture (MVC-HBP) on low complexity for 21.5%, on fast random access for about 20%, and on view scalability for 11% to 15% on average. In addition, distinct coding gain can be achieved by AMVC-HBP for dense and fast-moving sequences compared with MVC-HBP.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.6 s.312
• /
• pp.11-19
• /
• 2006

The recent video coding standard H.264 employs the rate-distortion optimization (RDO) method for choosing the best coding mode; however, it causes a large amount of encoding time. Thus, in order to reduce the encoding time, we need a fast mode decision algorithm. In this paper, we propose a fast inter mode decision algorithm considering quantization parameter (QP). The occurrence of best modes depends on QP. In order to reflect these characteristics, we consider the coded block pattern (CBP) which has 0 value when all quantized discrete cosine transform (DCT) coefficients are zero. We also use the early SKIP mode decision and early $16{\times}16$ mode decision methods. By computer simulations, we have verified that the proposed algorithm requires less encoding time than the fast inter mode decision method of the H.264 reference software for the Baseline and Main profiles by 19.6% and 18.8%, respectively.

• The Journal of the Convergence on Culture Technology
• /
• v.9 no.3
• /
• pp.835-843
• /
• 2023

Given the structure of XML data, path and tree pattern matching algorithms play an important role in XML query processing. To facilitate decisions or relationships between nodes, nodes in an XML tree are typically labeled in a way that can quickly establish an ancestor-descendant on relationship between two nodes. However, these techniques have the disadvantage of re-labeling existing nodes or recalculating certain values if insertion occurs due to sequential updates. Therefore, in current labeling techniques, the cost of updating labels is very high. In this paper, we propose a new labeling technique called Fast XML encoding, which supports the update of order-sensitive XML documents without re-labeling or recalculation. It also controls the length of the label by reusing deleted labels at the same location in the XML tree. The proposed reuse algorithm can reduce the length of the label when all deleted labels are inserted in the same location. The proposed technique in the experimental results can efficiently handle order-sensitive queries and updates.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12C
• /
• pp.1231-1238
• /
• 2005

This paper presents a new fast encoding algorithm for image vector quantization that incorporates the partial distances of multiple features with a multidimensional look-up table (LUT). Although the methods which were proposed earlier use the multiple features, they handles the multiple features step by step in terms of searching order and calculating process. On the other hand, the proposed algorithm utilizes these features simultaneously with the LUT. This paper completely describes how to build the LUT with considering the boundary effect for feasible memory cost and how to terminate the current search by utilizing partial distances of the LUT Simulation results confirm the effectiveness of the proposed algorithm. When the codebook size is 256, the computational complexity of the proposed algorithm can be reduced by up to the $70\%$ of the operations required by the recently proposed alternatives such as the ordered Hadamard transform partial distance search (OHTPDS), the modified $L_2-norm$ pyramid ($M-L_2NP$), etc. With feasible preprocessing time and memory cost, the proposed algorithm reduces the computational complexity to below the $2.2\%$ of those required for the exhaustive full search (EFS) algorithm while preserving the same encoding quality as that of the EFS algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12C
• /
• pp.1055-1061
• /
• 2008

H.264 is the prominent video coding standard in various applications such as real-time streaming and digital multimedia broadcasting, since it provides enhanced compression performance, error resilience tools, and network adaptation. Compression efficiency of H.264 has been improved, however, it requires more computing and memory access than traditional methods. In this paper we proposed adaptive intra fast algorithm for real-time video surveillance system reducing the encoding complexity of H264/A VC. For this aim, temporal interrelationship between macroblock in the previous and the current frame is used to decide the encoding mode of macroblock fast. As a result, though video quality was deteriorated a little, less than 0.04dB, and bit rate was somewhat increased in suggested method, however, proposed method improved encoding time significantly and, in particular, encoding time of an image with little changes of neighboring background such as surveillance video was more shortened than traditional methods.

• The Magazine of the IEIE
• /
• v.28 no.6
• /
• pp.92-92
• /
• 2001

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.3
• /
• pp.405-417
• /
• 2001

In this paper, since we currently using surveillance system of analog type bring about waste of resource and efficiency deterioration problems, we describe new solution that design and implementation to the digital surveillance system of new type applying compression techniques and encoding techniques of image data using MPEG-2 international standard. Also, we proposed fast motion estimation algorithm requires much less than the convectional digital surveillance camera system. In this paper a fast motion estimation algorithm is proposed the MPEG-2 video encoding. This algorithm is based on a hybrid use of the block matching technique and gradient technique. Also, we describe a method of moving object extraction directly using MPEG-2 video data. Since proposed method is very simple and requires much less computational power than the conventional object detection methods. In this paper we don't use specific H/W and this system is possible only software encoding, decoding and transmission real-time for image data.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.943-946
• /
• 2006

XML is the most widely used document format by advantage that self-contained for platform. So, currently the most used among other document format. but XML appeared new problem that memory and transmission. And that be used in environment a request restriction memory and fast transmission as like mobile field. Although discussion of XML binarization is going on progress. And fast Infoset configuration using XML Information Set is receiving attention that a way to lower file size of hold down a existing usage. In this paper, we designed of module using fast Infoset and PER among ASN.1 Encoding Rule for XML binarization. And we implementation of encoder constructed interlace by stage of translation from XML into binary XML.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.3
• /
• pp.559-566
• /
• 2012

In this paper, we propose a fast fractal image coding algorithm to shorten long time to take on fractal image encoding. For its performance evaluation, the algorithm compares with other traditional fractal coding methods. In the traditional fractal image coding methods, an original image is contracted by a factor in order to make the corresponding image to be compared with. Then, the whole area of the contracted image is searched in order to find the fixed point of contractive transformation of the original image corresponding to the contracted image. It needs a lot of searching time on encoding. However, the proposed algorithm considerably reduces encoding time by using scaling method and limited search area method. On comparison of the proposed algorithm with Jacquin's method, the proposed algorithm is dozens of times as fast as that of Jacquin's method on encoding time with a little degradation of the decoded image quality and a little increase of the compression rate. Therefore, it is found that the proposed algorithm largely improves the performance in the aspect of encoding time when compared with other fractal image coding methods.

• The KIPS Transactions:PartB
• /
• v.11B no.2
• /
• pp.177-186
• /
• 2004

It is a weak point of the motion estimation technique for video compression that the predicted video encoding algorithm requires higher-order computational complexity. To reduce the computational complexity of encoding algorithms, researchers introduced techniques such as 3D-WT that don't require motion prediction. One of the weakest points of previous 3D-WT studies is that they require too much memory for encoding and too long delay for decoding. In this paper, we propose a technique called `FS (Fast playable and Scalable) 3D-WT' This technique uses a modified Haar wavelet transform algorithm and employs improved encoding algorithm for lower memory and shorter delay requirement. We have executed some tests to compare performance of FS 3D-WT and 3D-V. FS 3D-WT has exhibited the same high compression rate and the same short processing delay as 3D-V has.