• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3C
• /
• pp.247-254
• /
• 2008

H.264 provides a good coding efficiency compared with existing video coding standards, H.263, MPEG-4, based on the use of multiple reference frame for variable block size motion estimation, quarter-pixel motion estimation and compensation, $4{\times}4$ integer DCT, rate-distortion optimization, and etc. However, many modules used to increase its performance also require H.264 to have increased complexity so that fast algorithms are to be implemented as practical approach. In this paper, among many approaches, fast mode decision algorithm by skipping variable block size motion estimation and spatial-predictive coding, which occupies most encoder complexity, is proposed. This approach takes advantages of temporal and spatial properties of fast mode selection techniques. Experimental results demonstrate that the proposed approach can save encoding time up to 65% compared with the H.264 standard while maintaining the visual perspectives.

• Journal of the Korean Society of Radiology
• /
• v.12 no.4
• /
• pp.519-524
• /
• 2018

Chest examinations and mass chest examinations using the CR(computed radiography) System are frequently used clinically. a factor that degrades image quality in the acquisition process is the use of unused IPs long times. this paper addresses the estimation of winer filter and improved wiener filter to restoration of Chest CR images Experimental results show that the proposed method can reduce noise. in low noise variation image wiener method was excellent than improved method and the result was the opposite at high noise varience. the application of algorithms to chest CR images effectively eliminates noise. the classic Wiener filter was better than the improved method. Multiple patients examined during the process without any erase IP(image plate) process, The proposed algorithm determines that the images can be restored to a good quality and will help to read the images.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.9C
• /
• pp.564-572
• /
• 2011

Distributed video coding (DVC) system has been proposed to reduce encoder complexity by using the correlation of frames in decoders. Since the block based motion estimation operation is not performed in the encoder of DVC system, lapped transforms, in which adjacent two blocks are transformed into one block, can be efficiently used in the DVC system. In this paper, an efficient DVC system using lapped transforms is proposed. The overlapped block motion compensated interpolation is used to produce side information, and the corresponding correlation noise between original Wyner-Ziv frame and side information is modeled. Extensive computer simulations show that the proposed DVC system outperforms conventional DVC systems.

• Journal of Digital Contents Society
• /
• v.15 no.6
• /
• pp.737-743
• /
• 2014

For single image super resolution (SR), interpolation based and example based algorithms are extensively used. The interpolation algorithms have the strength of theoretical simplicity. However, those algorithms are tending to produce high resolution images with jagged edges, because they are not able to use more priori information. Example based algorithms have been studied in the past few years. For example based SR, the nearest neighbor based algorithms are extensively considered. Among them, neighbor embedding (NE) has been inspired by manifold learning method, particularly locally linear embedding. However, the sizes of local training sets are always too small. So, NE algorithm is weak in the performance of the visuality and quantitative measure by the poor generalization of nearest neighbor estimation. An improved NE algorithm with Support Vector Regression (SVR) was proposed to solve this problem. Given a low resolution image, the pixel values in its high resolution version are estimated by the improved NE. Comparing with bicubic and NE, the improvements of 1.25 dB and 2.33 dB are achieved in PSNR. Experimental results show that proposed method is quantitatively and visually more effective than prior works using bicubic interpolation and NE.

• Journal of Korea Multimedia Society
• /
• v.11 no.7
• /
• pp.956-965
• /
• 2008

H.264/AVC is the newest video coding standard of ITU-T VCEG and the ISO/IEC MPEG, offering a significant performance improvement over previous video coding standards. However, the computational complexity of H.264/AVC is drastically increased because of new technologies such as intra prediction, variable block size, quarter-pels motion estimation/compensation, etc. In this paper, we propose a fast intra prediction scheme which has two step processing. The first step is a fast block size decision which can be calculated only in one block without considering all cases of $4{\times}4$ block and $16{\times}16$ block. The complexity of the intra prediction can be reduced by using boundary difference values of macroblock. After selecting the block size, we can make mode decision using the neighbouring reference pixels and representative pixels of the block in the second step. The experimental results show that the proposed algorithm saved on the average 41.5% encoding time without any significant PSNR losses.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.11
• /
• pp.1468-1473
• /
• 2018

The importance of communication and data processing is increasing with the advance of the Fourth Industrial Revolution. Hence, the importance of video and data processing technologies, which directly influence the accuracy and reliability of equipment, is also increasing. In this research report we propose an algorithm for calculating the final output by estimating the standard deviation and estimate required for removing AWGN while adapting to changes in the frequency factors of video. This algorithm calculates the final output by checking an estimated value against the effective pixel range, which is obtained from the standard deviation of mask factors. Subsequently, the weighted value is computed, taking into account the filter output. To evaluate the functionality of this algorithm, it is compared with the most-commonly used present method through simulation. The simulation results show that the important features of the image are preserved and efficient noise cancellation performance is demonstrated.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2022.06a
• /
• pp.205-208
• /
• 2022

Multi-exposure high dynamic range (HDR) image reconstruction, the task of reconstructing an HDR image from multiple low dynamic range (LDR) images in a dynamic scene, often produces ghosting artifacts caused by camera motion and moving objects and also cannot deal with washed-out regions due to over or under-exposures. While there has been many deep-learning-based methods with motion estimation to alleviate these problems, they still have limitations for severely moving scenes. They also require large parameter counts, especially in the case of state-of-the-art methods that employ attention modules. To address these issues, we propose a frequency domain approach based on the idea that the transform domain coefficients inherently involve the global information from whole image pixels to cope with large motions. Specifically we adopt Residual Fast Fourier Transform (RFFT) blocks, which allows for global interactions of pixels. Moreover, we also employ Depthwise Overparametrized convolution (DO-conv) blocks, a convolution in which each input channel is convolved with its own 2D kernel, for faster convergence and performance gains. We call this LFFNet (Lightweight Frequency Fusion Network), and experiments on the benchmarks show reduced ghosting artifacts and improved performance up to 0.6dB tonemapped PSNR compared to recent state-of-the-art methods. Our architecture also requires fewer parameters and converges faster in training.

• Journal of Broadcast Engineering
• /
• v.10 no.4 s.29
• /
• pp.528-539
• /
• 2005

The H.264 has been adopted as the video codec for various multimedia services such as DMB and next-generation DVD because of its superior coding performance. However, the reference codec of the standard, the joint model (JM) contains quite a few algorithms which are too complex to be used for the resource-constraint embedded environment. This paper introduces very low-complexity H.264 encoding algorithm which is applicable for the embedded environment. The proposed algorithm was realized by restricting some coding tools on the basis that it should not cause too severe degradation of RD-performance and adding a few early termination and bypass conditions during the motion estimation and mode decision process. In case of encoding of 7.5fps QCIF sequence with 64kbpswith the proposed algorithm, the encoder yields worse PSNRs by 0.4 dB than the standard JM, but requires only $15\%$ of computational complexity and lowers the required memory and power consumption drastically. By porting the proposed H.264 codec into the PDA with Intel PXA255 Processor, we verified the feasibility of the H.264 based MMS(Multimedia Messaging Service) on PDA.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2C
• /
• pp.130-138
• /
• 2006

In this paper, a new stereo image watermarking scheme based-on adaptive disparity estimation algorithm is proposed. That is, a watermark image is embedded into the right image of a stereo image pair by using the DWT and disparity information is extracted from this watermarked right image and the left image. And then, both of this extracted disparity information and the left image are transmitted to the recipient through the communication channel. At the receiver, the watermarked right image is reconstructed from the received left image and disparity information through an adaptive matching algorithm. a watermark image is finally extracted from this reconstructed right image. From some experiments using CCETT's 'Manege' and 'Friends' images as a stereo image and English alphabet '3DRC' as a watermark image, it is found that the PSNRs of the watermarked image from the reconstructed right images through the adaptive matching algorithm & DWT is improved 2.03 dB, 3.03 dB and robusted against various attacks. These experimental results also suggest a possibility of practical implementation of an adaptive matching also-rithm-based stereo imagewatermarking scheme proposed in this paper.

• Journal of Broadcast Engineering
• /
• v.13 no.3
• /
• pp.310-318
• /
• 2008

The H.264/AVC standard achieves higher coding efficiency than previous video coding standards with the rate-distortion optimization (RDO) technique which selects the best coding mode and reference frame for each macroblock. As a result, the complexity of the encoder have been significantly increased. In this paper, a fast intra-mode decision algorithm is proposed to reduce the computational load of intra-mode search, which is based on the inverse tree-structure edge prediction algorithm. First, we obtained the dominant edge for each $4{\times}4$ block from local edge information, then the RDO process is only performed by the mode which corresponds to dominant edge direction. Then, for the $8{\times}8$ (or $16{\times}16$) block stage, the dominant edge is calculated from its four $4{\times}4$ (or $16{\times}16$) blocks' dominant edges without additional calculation and the RDO process is also performed by the mode which is related to dominant edge direction. Experimental results show that proposed scheme can significantly improve the speed of the intra prediction with a negligible loss in the peak signal to noise ratio (PSNR) and a little increase of bits.