• ETRI Journal
• /
• v.29 no.6
• /
• pp.736-744
• /
• 2007

We propose a fast macroblock (MB) mode prediction and decision algorithm based on temporal correlation for P-slices in the H.264/AVC video standard. There are eight block types for temporal decorrelation, including SKIP mode based on rate-distortion (RD) optimization. This scheme gives rise to exhaustive computations (search) in the coding procedure. To overcome this problem, a thresholding method for fast inter mode decision using a MB tracking scheme to find the most correlated block and RD cost of the correlated block is suggested for early stop of the inter mode determination. We propose a two-step inter mode candidate selection method using statistical analysis. In the first step, a mode is selected based on the mode information of the co-located MB from the previous frame. Then, an adaptive thresholding scheme is applied using the RD cost of the most correlated MB. Secondly, additional candidate modes are considered to determine the best mode of the initial candidate modes that does not satisfy the designed thresholding rule. Comparative analysis shows that a speed-up factor of up to 70.59% is obtained when compared with the full mode search method with a negligible bit increment and a minimal loss of image quality.

• Journal of Korea Society of Industrial Information Systems
• /
• v.13 no.1
• /
• pp.57-67
• /
• 2008

In this paper, we present an adaptive block matching motion estimation using optical flow. In the proposed algorithm, we calculate the temporal and spatial gradient value for each pixel value from tile differential filter, and estimate the optical flow which is used to decide the location and the size of the search region from the gradient values by least square optical flow algorithm. In particular, the proposed algorithm showed a excellent performance with fast and complex motion sequences. From the computer simulation for various motion characteristic sequences. The proposed algorithm shows a significant enhancement of PSNR over previous blocking matching algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8A
• /
• pp.889-897
• /
• 2004

In this Paper, we propose the algorithm to provide stable communication in OFDM system under the highly interfered environment by the same/different systems which use same bandwidth or other jamming signal, i.e., radar signal. The proposed Adaptive Subcarrier Assignment(ASA) method first estimates the received power of each subcarrier in the block or fin or OFDM receiver. Then we estimate the threshold level which is the average power of the transmitted OFDM signal with AWGN. The highly interfered subcarriers, which are greater powers than the specified threshold level, are rejected in the next transmission and the only non-interfered subcarriers are selected as the next transmission. This algorithm provides stable communication in any OFDM systems without changing the physical layer under the highly interfered communication environment. We estimated the status of the subcarriers based on the bandwidth and power of the jamming signal and showed the performance of the proposed algorithm by the simulation.

• Journal of the Institute of Convergence Signal Processing
• /
• v.9 no.4
• /
• pp.272-279
• /
• 2008

Shot change detection is an important technique for effective management of video data, so detection scheme requires adaptive detection techniques to be used actually in various video. In this paper, we propose an adaptive shot change detection algorithm using the mean of feature value on variable reference blocks. Our algorithm determines shot change detection by defining adaptive threshold values with the feature value extracted from video frames and comparing the feature value and the threshold value. We obtained better detection ratio than the conventional methods maximally by 15% in the experiment with the same test sequence. We also had good detection ratio for other several methods of feature extraction and could see realtime operation of shot change detection in the hardware platform with low performance was possible by implementing it in TVUS model of HOMECAST company. Thus, our algerian in the paper can be useful in PMP(portable multimedia player) or other portable players.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1985.10a
• /
• pp.215-219
• /
• 1985

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.4
• /
• pp.1254-1259
• /
• 2010

In this paper, Low Computational Adaptive Expanded Block Search Motion Estimation Method is proposed. Proposed method classifies ME blocks as Average Motion Block(AMB) and Local Motion Block(LMB) according to correlation of reference frame. It could reduce the computational complexity with performing Modified Fast Search(MFS). And accuracy of MV is also increased by 4 sub-blocks on LMB and Block Expansion(BE). The experimental results show that the proposed method has better performance that increased 1.8dB than Diamond Search and 0.6dB than Full Search with 7.5 % computation of Full Search. The proposed method could be applied to video compression and Frame Rate Conversion(FRC).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6C
• /
• pp.801-814
• /
• 2004

In this paper, we propose a block adaptive binarization (BAB) using a modified quadratic filter (MQF) to binarize business card images acquired by personal digital assistant (PDA) cameras effectively. In the proposed method, a business card image is first partitioned into blocks of 8${\times}$8 and the blocks are then classified into character Hocks (CBs) and background blocks (BBs). Each classified CB is windowed with a 24${\times}$24 rectangular window centering around the CB and the windowed blocks are improved by the pre-processing filter MQF, in which the scheme of threshold selection in QF is modified. The 8${\times}$8 center block of the improved block is barbarized with the threshold selected in the MQF. A binary image is obtained tiling each binarized block in its original position. Experimental results show that the MQF and the BAB have much better effects on the performance of binarization compared to the QF and the global binarization (GB), respectively, for the test business card images acquired in a PDA. Also the proposed BAB using MQF gives binary images of much better quality, in which the characters appear much better clearly, over the conventional GB using QF. In addition, the binary images by the proposed BAB using MQF yields about 87.7% of character recognition rate so that about 32.0% performance improvement over those by the GB using QF yielding about 55.7% of character recognition rate using a commercial character recognition software.

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

Motion estimation plays an important role for the compression of video signals. The proposed method utilizes an adaptive threshold and characteristics of a distribution of SAD (sum of absolute difference). Generally, the more complex the SAD distribution is, the larger SAD value tends to be. This proposed algorithm tries to reduce the search points in a simple distribution but increase them in a complex distribution to avoid local minima. A macro block is divided into 9 areas. One of them chosen using spatio-temporal correlation is called the primary area and the others are called the secondary area that will be searched to avoid local minima. The proposed algorithm decides if just one area (the primary area or the secondary area) will be enough to be searched or both areas should be searched, using adaptive threshold. Compared with famous motion estimation algorithms, the simulation result shows that the searching points per macro block and MSE decreases about 16.4% and 32.83 respectively on the average.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.6
• /
• pp.1-9
• /
• 2010

In this paper, we propose an efficient compression method of the integral images. The integral imaging is a well-known technique to represent and record three-dimensional images. The proposed method is based on three dimensional discrete cosine transform (3D-DCT). The 3D-DCT techniques for the integral images have been reported as an efficient coding method for the integral images which reduces the redundancies between adjacent elemental images. The proposed method is a compression method efficient to integral images using adaptive block mode(ABM), based on the 3D-DCT technique. In the ABM, 3D-DCT blocks adaptive to the characteristics of integral images are constructed, which produces variable block size 3D-DCT blocks, and then 3D-DCTs for the 3D blocks are performed. Experimental results show that the proposed method gives significant improvement in coding efficiency. Especially, at the high bit-rates, the proposed method is more excellent since the overhead incurred by the proposed method take less part of the total bits.

• Journal of Internet Computing and Services
• /
• v.21 no.4
• /
• pp.43-49
• /
• 2020

This paper proposes a lossless image compression method based on arithmetic coding using block-adaptive Context Tree Weighting. The CTW method predicts and compresses the input data bit by bit. Also, it can achieve a desirable coding distribution for tree sources with an unknown model and unknown parameters. This paper suggests the method to enhance the compression rate about image data, especially aerial and satellite images that require lossless compression. The value of aerial and satellite images is significant. Also, the size of their images is huger than common images. But, existed methods have difficulties to compress these data. For these reasons, this paper shows the experiment to prove a higher compression rate when using the CTW method with divided images than when using the same method with non-divided images. The experimental results indicate that the proposed method is more effective when compressing the divided images.