• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.830-833
• /
• 2009

Deblocking Filter (DF) is newly introduced into H.264/AVC to remove blocky artifacts. It improves the picture quality and the improved picture is set to the frame buffer for motion compensation. As a result, higher coding efficiency is achieved by DF. However, if the original image has heavily-slanted patterns, DF removes the edges to be kept because it is applied only perpendicularly to the block boundaries. In this paper, we propose Edge Adaptive Deblocking Filter (EADF) which is applied not only for the perpendicular but also for several slanted directions to deal with the problem. Simulation results showed us that EADF was especially effective for the sequence "Foreman" with PSNR gain of 0.04 dB.

• The Journal of the Acoustical Society of Korea
• /
• v.17 no.1E
• /
• pp.20-29
• /
• 1998

This paper proposes a new stereophonic acoustic echo canceler with deploying delayless subband adpative filters. Due to the storong correlation between stereo signals, a stereophonic acoustic echo canceler is suffering from the slow convergence and the misalignment for estimating impulse responses corresponding to true echo paths at receiving room. Specially, dual adaptive filters for echo cancellation are significantly affected by the abrupt change of the transmission room environment so that the impariments on voice communication could be experienced. To prevent these performance degradations, this paper proposes a robust subband echo canceler employing pre-processing block so as to enhance the convergence speed and provide the insusceptibility to the environment change at transmission room.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.11
• /
• pp.2036-2039
• /
• 2007

This paper proposes an enhanced adaptive mode decision scheme for fast H.264 encoders. By efficiently predicting AZCB (All Zero Coefficient Block), the proposed scheme can encode motion pictures in H.264 up to 2.86 and 1.68 times faster than JM9.3 and AMD [1], respectively. Besides, this scheme significantly reduces the encoding performance fluctuation of AMD across tested bit-rates and video sequences.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.4
• /
• pp.1-8
• /
• 2018

In this paper, we propose an adaptive partition cache replacement policy and evaluate the performance of our scheme using various monitoring ratios to help lifetime extension of non-volatile main memory systems without performance degradation. The proposal combines conventional LRU (Least Recently Used) replacement policy and Early Eviction Zone (E2Z), which considers a dirty bit as well as LRU bits to select a candidate block. In particular, this paper shows the performance of non-volatile memory using various monitoring ratios and determines optimized monitoring ratio and partition size of E2Z for reducing the number of writebacks using cache hit counter logic and hit predictor. In the experiment evaluation, we showed that 1:128 combination provided the best results of writebacks and runtime, in terms of performance and complexity trade-off relation, and our proposal yielded up to 42% reduction of writebacks, compared with others.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.11 no.1
• /
• pp.33-39
• /
• 2011

H.264 decoders usually have pipeline architecture by a macroblock or a 4 ${\times}$ 4 sub-block. The period of the pipeline is usually fixed to guarantee the operation in the worst case which results in many idle cycles and higher data bandwidth. Adaptive pipeline architecture for H.264 decoders has been proposed for efficient decoding and lower the requirement of the bandwidth for the memory bus. However, it requires a controller for the adaptive priority control to utilize the advantage. We propose a smart bus arbiter that replaces the controller. It is introduced to adjust the priority adaptively the QoS (Quality of Service) control of the decoding process. The smart arbiter can be integrated the arbiter of bus systems and it works when certain conditions are met so that it does not affect the original functions of the arbiter. An H.264 decoder using the proposed architecture is designed and implemented to verify the operation using an FPGA.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.83-84
• /
• 2007

Multiple-input multiple-output (MIMO) systems can achieve the increasing of performances by using an adaptive power allocation. The related previous work limited the transmit antenna number because orthogonal space-time block codes (OSTBCs) yield full transmit rate only for two transmit antennas. We extend a robust system under imperfect channel estimation for four transmission antennas with maintaining a full transmission rate.

• Journal of Information Processing Systems
• /
• v.17 no.2
• /
• pp.411-425
• /
• 2021

In this paper, a vehicle recognition algorithm based on deep convolutional neural network and compression dictionary is proposed. Firstly, the network structure of fine vehicle recognition based on convolutional neural network is introduced. Then, a vehicle recognition system based on multi-scale pyramid convolutional neural network is constructed. The contribution of different networks to the recognition results is adjusted by the adaptive fusion method that adjusts the network according to the recognition accuracy of a single network. The proportion of output in the network output of the entire multiscale network. Then, the compressed dictionary learning and the data dimension reduction are carried out using the effective block structure method combined with very sparse random projection matrix, which solves the computational complexity caused by high-dimensional features and shortens the dictionary learning time. Finally, the sparse representation classification method is used to realize vehicle type recognition. The experimental results show that the detection effect of the proposed algorithm is stable in sunny, cloudy and rainy weather, and it has strong adaptability to typical application scenarios such as occlusion and blurring, with an average recognition rate of more than 95%.

• Journal of Korea Multimedia Society
• /
• v.25 no.5
• /
• pp.670-675
• /
• 2022

This study proposes an improved binarization method to improve image recognition rate. The research goal is to minimize the information loss that occurs during the binarization process, and to transform the object of the original image that cannot be determined through the transformation process into an image that can be judged. The proposed method uses a stepwise segmentation method of an image and divides blocks using prime numbers. Also, within one block, a trapezoidal type of fuzzy is applied. The fuzzy trapezoid is binarized by dividing the brightness histogram area into three parts according to the degree of membership. As a result of the experiment, information loss was minimized in general images. In addition, it was found that the converted binarized image expressed the object better than the original image in the special image in which the brightness region was tilted to one side.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.3
• /
• pp.68-74
• /
• 2009

In this paper, we propose an effective memory reduction algorithm to reduce the amount of reference frame buffer and memory bandwidth in video encoder and decoder. In general video codecs, decoded previous frames should be stored and referred to reduce temporal redundancy. Recently, reference frames are recompressed for memory efficiency and bandwidth reduction between a main processor and external memory. However, these algorithms could hurt coding efficiency. Several algorithms have been proposed to reduce the amount of reference memory with minimum quality degradation. They still suffer from quality degradation with fixed-bit allocation. In this paper, we propose an adaptive block-based min-max quantization that considers local characteristics of image. In the proposed algorithm, basic process unit is $8{\times}8$ for memory alignment and apply an adaptive quantization to each $4{\times}4$ block for minimizing quality degradation. We found that the proposed algorithm can obtain around 1.7% BD-bitrate gain and 0.03dB BD-PSNR gain, compared with the conventional fixed-bit min-max algorithm with 37.5% memory saving.

• Journal of Korea Multimedia Society
• /
• v.12 no.3
• /
• pp.354-361
• /
• 2009

Shot change detection is the main technique in the video segmentation which requirs real-time processing and automatical processing in hardware. Until now, there were few research reports about real-time shot change detection for applying to hardware terminals with low performance such as PMPs(Portable Media Player) and cellular phones. In this paper, we propose shot change detection technique using adaptive threshold setting method on variable reference block. Our proposed algorithm determines shot change detection by comparing the feature value of current frame and a mean of a feature value on variable reference blocks. The proposed method can be used independently from the feature value of frame, can adaptively set thresholds using a mean of a feature value on variable reference blocks. We obtained better detection ratio than the conventional methods maximally by precision 0.146, recall 0.083, F1 0.089 in the experiment with the same test sequences. We verified real-time operation of shot change detection by implementing our algorithm on the PMP from some company of H. Therefore, our proposing algorithm will be helpful in searching video data on portable media players such as PMPs and cellular phones.