• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.595-598
• /
• 2005

MPEG-4 Visual is, and international standard for the object-based video compression, designed for supporting a wide range of applications from multimedia communication to HDTV. To control the minimum decoding complexity required at the decoder, the MPEG-4 Visual standard defines the co-called video buffering mechanism, which includes three video buffer models. Among them, the VCV(Video Complexity Verifier) defines the control of the processing speed for decoding of a macroblock, there are two models: VCV and B-VCV distinguishing the boundary and non-boundary MB. This paper presents the evaluation results of decoding complexity by measuring decoding time of a MB for rectangular, arbitrarily shaped video objects and the various types of objects supporting the resolution of HDTV using the optimized MPEG-4 Reference Software. The experimental results shows that decoding complexity varies depending on the coding type and more effective usage of decoding resources may be possible.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1900-1906
• /
• 1997

In this paper, the efficient BILBO(named EBILBO) is designed for BIST that is able to batch the testing when circuit is designed on FPGA. The proposed algorithm of batch testing is able to test the normal operation speed with one-pin-count that can control all part of large and complex circuit. PRTPG is used for the test pattern and MISR is used for PSA. The proposed algorithm of batch testing is VHDL coding on behavioral description, so it is easily modified the model of test pattern generation, signature analysis and compression. The EBILBO's area and the performance of designed BIST are evaluated with ISCAS89 benchmark circuit on FPGA. In circuit with above 600 cells, it is shown that area is reduced below 30%, test pattern is flexibly generated about 500K and the fault coverage is from 88.3% to 100%. EBILBO for the proposed batch testing BIST is able to execute concurrently normal and test mode operation in real time to the number of $s+n+(2^s/2^p-1)$ clock(where, in CUT, # of PI;n, # of register, p is order # of polynomial). The proposed algorithm coded with VHDL is made of library, then it well be widely applied to DFT that satisfy the design and test field on sme time.

• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.2
• /
• pp.126-131
• /
• 2004

Full search algorithm(FA) provides the best performance but this is usually impractical because of the large number of computations required for large search region. Fast search and conventional Boolean matching algorithms reduce computational complexity and data processing time but this algorithms have disadvantages that is difficult of implementation of hardware because of high control overhead and that is less performance than FA. This paper presents new Boolean matching algorithm, called BCBM(Bit Converted Boolean Matching). Proposed algorithm has performance closed to the FA by Boolean only block matching that may be very efficiently implemented in hardware for real time video communication. Simulation results show that the PSNR of the proposed algorithm is about 0.08㏈ loss than FA but is about 0.96∼2.02㏈ gain than fast search algorithm and conventional Boolean matching algorithm.

• Journal of Broadcast Engineering
• /
• v.12 no.6
• /
• pp.574-584
• /
• 2007

As the real time multimedia service become more popular, the needs of transmission with low delay and high quality are getting more stronger. Among those video compression technologies, the rate control method dose an important role in getting the effective data transmitting and the high image quality. In this paper, we combined the feature of CBR and VBR coding methods to propose a new bit-rate control method witch allows each frame to generates bits in the defined fluctuation range and applies a scene change detection at a part of frame and also can maintain low-delay and high quality even if the perfect VBR transmission environment is not guaranteed. The experiment result shows the proposed algorithm provides more effective method than TMN8 in real time application.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.175-178
• /
• 2009

H.264/AVC is a video coding standard of ITU-T and ISO/IEC, and widely spreads its application due to its high compression ratio more than twice that of MPEG-2 and high image quality. In this paper, we explained Intra Prediction in H.264/AVC, which is able to achieve higher compressing efficiency from correlation removal of adjacent samples in spatial domain, and proposed efficient Intra Predictor architecture design for H.264/AVC decoder. The proposed system reduced computation cycle using processing element and precomputation processing element and also reduced the number of access to external memory using efficient register. We designed the proposed system with Verilog-HDL and verified with suitable test vector. The proposed Intra Predictor achieved about 60% cycle reduction comparing with existing Intra Predictors.

• Journal of Broadcast Engineering
• /
• v.28 no.2
• /
• pp.194-212
• /
• 2023

The MPEG immersive video (MIV) coding standard achieved high compression efficiency by removing inter-view redundancy and merging the residuals of immersive video which consists of multiple texture (color) and geometry (depth) pairs. Grouping of views that represent similar spaces enables quality improvement and implementation of selective streaming, but this has not been actively discussed recently. This paper introduces an implementation of group-based encoding into the recent version of MIV reference software, provides experimental results on optimal views and videos per group, and proposes a decision method for optimal number of videos for global immersive video representation by using portion of residual videos.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9C
• /
• pp.849-860
• /
• 2007

Because the H.264/AVC standard adopts the variable length coding algorithm, the rate of encoded video bitstream fluctuates a lot as time flows, though its compression efficiency is superior to that of existing standards. When a video is transmitted in real-time over networks with fixed low-bandwidth, it is necessary to control the bit rate which is generated from encoder. Many existing rate control algorithms have been adopting the quadratic rate-distortion model which determines the target bits for each frame. We propose a new rate control algorithm for H.264/AVC video transmission over networks with fixed bandwidth. The proposed algorithm predicts quantization parameter adaptively to reduce video distortion using the quadratic rate-distortion model, which uses the target bit rate and the mean absolute difference for current frame considering pixel difference between macroblocks in the previous and the current frame. On video samples with high motion and scene change cases, experimental results show that (1) the proposed algorithm adapts the encoded bitstream to limited channel capacity, while existing algorithms abruptly excess the limit bit rate; (2) the proposed algorithm improves picture quality with $0.4{\sim}0.9dB$ in average.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.3
• /
• pp.32-43
• /
• 2010

This paper presents deblocking filter for low-complexity video decoder. Baseline profile of the H.264/AVC used for mobile devices such as mobile phones has two times higher compression performance than the MPEG-4 Visual but it has a problem of serious complexity as using 1/4-pel interpolation filter, adaptive entropy model and deblocking filter. This paper presents low-complexity deblocking filter for decreasing complexity of decoder with preserving the coding efficiency of the H.264/AVC. In this paper, the proposed low-complexity deblocking filter decreased 49% of branch instruction than conventional approach as calculating value of BS by using the CBP. In addition, a range of filtering of strong filter applied in intra macroblock boundaries was limited to two pixels. According to the experimental results, the proposed low-complexity deblocking filter decreased -0.02% of the BDBitrate comparison with baseline profile of the H.264/AVC, decreased 42% of the complexity of deblocking filter, and decreased 8.96% of the complexity of decoder.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.1 s.13
• /
• pp.25-37
• /
• 2005

Recently, with the development of wireless communications and mobile computing, interest about mobile computing is rising. Mobile computing can be regarded as an environment where a user carries mobile devices, such as a PDA or a notebook, and shares resources with a server computer via wireless communications. A mobile database refers to a database which is used in these mobile devices. The mobile database can be used in the fields of insurance business, banking business, medical treatment, and so on. Especially, LBS(Location Based Service) which utilizes location information of users becomes an essential field of mobile computing. In order to support LBS in the mobile environment, there must be an Embedded Spatial MMDBMS(Main-Memory Database Management System) that can efficiently manage large spatial data in spatial mobile devices. Therefore, in this paper, we designed and implemented the Embedded Spatial MMDBMS, extended from the HSQLDB which is an existing MMDBMS for PC, to manage spatial data efficiently in spatial mobile devices. The Embedded Spatial MMDBMS adopted the spatial data model proposed by ISO(International Organization for Standardization), provided the arithmetic coding method that is suitable for spatial data, and supported the efficient spatial index which uses the MBR compression and hashing method suitable for spatial mobile devices. In addition, the system offered the spatial data display capability in low-performance processors of spatial mobile devices and supported the data caching and synchronization capability for performance improvement of spatial data import/export between the Embedded Spatial MMDBMS and the GIS server.

• Journal of Broadcast Engineering
• /
• v.14 no.3
• /
• pp.322-331
• /
• 2009

This paper proposes an efficient data representation of stereo images using edge-based mesh optimization. Mash-based two dimensional warping for stereo images mainly depends on the performance of a node selection and a disparity estimation of selected nodes. Therefore, the proposed method first of all constructs the feature map which consists of both strong edges and boundary lines of objects for node selection and then generates a grid-based mesh structure using initial nodes. The displacement of each nodal position is iteratively estimated by minimizing the predicted errors between target image and predicted image after two dimensional warping for local area. Generally, iterative two dimensional warping for optimized nodal position required a high time complexity. To overcome this problem, we assume that input stereo images are only horizontal disparity and that optimal nodal position is located on the edge include object boundary lines. Therefore, proposed iterative warping method performs searching process to find optimal nodal position only on edge lines along the horizontal lines. In the experiments, we compare our proposed method with the other mesh-based methods with respect to the quality by using Peak Signal to Noise Ratio (PSNR) according to the number of nodes. Furthermore, computational complexity for an optimal mesh generation is also estimated. Therefore, we have the results that our proposed method provides an efficient stereo image representation not only fast optimal mesh generation but also decreasing of quality deterioration in spite of a small number of nodes through our experiments.