• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9C
• /
• pp.761-770
• /
• 2010

In this paper, we propose a new Frame Rate Up-Conversion (FRUC) scheme to increase the frame rate from a lower number into a higher one and enhance the decoded video quality at the decoder. The proposed algorithm utilizes the preliminary frames of forward and backward direction using bilateral prediction. In the process of the preliminary frames, an additional interpolation is performed for the occlusion area because if the calculated value of the block with reference frame if larger than the predetermine thresholdn the block is selected as the occlusion area. In order to interpolate the occlusion area, we perform re-search to obtain the osiomal block considerhe osiomnumber of available ne block consblock. The experimental results show that performance of the proposed algorithm has better PSNR and visual quality than the conventional methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11A
• /
• pp.1925-1938
• /
• 2001

In this paper, a new block-matching algorithm for standard video encoder is presented. The slice competition method is proposed as a new scheme, as opposed to a coarse-to-fine approach. The order of calculating the SAD(Sum of Absolute Difference) to fad the best matching block is changed from a raster order to a dispersed one. Based on this scheme, the increasing SAD curve during its calculation is more linear than that of other curves. Then, the candidates of low probability can be removed in the early stage of calculation. And new MV prediction technique with an adaptive search range scheme also assists the proposed block-matching algorithm. As a result, an average of 13% improvement in computational power is recorded by only the proposed MV prediction technique. Synthetically, the computational power is reduced by 3977∼77% than that of the conventional BMAs. The average MAD is always low in various sequences. The results are also very close to the MAD of the full search block-matching algorithm.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.3
• /
• pp.187-187
• /
• 2004

In this paper, we present an efficient architecture of a versatile Reed-Solomon (RS) decoder which can be programmed to decode RS codes continuously with my message length k as well as any block length n. This unique feature eliminates the need of inserting zeros for decoding shortened RS codes. Also, the values of the parameters n and k, hence the error-correcting capability t can be altered at every codeword block. The decoder permits 3-step pipelined processing based on the modified Euclid's algorithm (MEA). Since each step can be driven by a separate clock, the decoder can operate just as 2-step pipeline processing by employing the faster clock in step 2 and/or step 3. Also, the decoder can be used even in the case that the input clock is different from the output clock. Each step is designed to have a structure suitable for decoding RS codes with varying block length. A new architecture for the MEA is designed for variable values of the t. The operating length of the shift registers in the MEA block is shortened by one, and it can be varied according to the different values of the t. To maintain the throughput rate with less circuitry, the MEA block uses both the recursive technique and the over-clocking technique. The decoder can decodes codeword received not only in a burst mode, but also in a continuous mode. It can be used in a wide range of applications because of its versatility. The adaptive RS decoder over GF($2^8$) having the error-correcting capability of upto 10 has been designed in VHDL, and successfully synthesized in an FPGA chip.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.3
• /
• pp.29-38
• /
• 2004

In this paper, we present an efficient architecture of a versatile Reed-Solomon (RS) decoder which can be programmed to decode RS codes continuously with my message length k as well as any block length n. This unique feature eliminates the need of inserting zeros for decoding shortened RS codes. Also, the values of the parameters n and k, hence the error-correcting capability t can be altered at every codeword block. The decoder permits 3-step pipelined processing based on the modified Euclid's algorithm (MEA). Since each step can be driven by a separate clock, the decoder can operate just as 2-step pipeline processing by employing the faster clock in step 2 and/or step 3. Also, the decoder can be used even in the case that the input clock is different from the output clock. Each step is designed to have a structure suitable for decoding RS codes with varying block length. A new architecture for the MEA is designed for variable values of the t. The operating length of the shift registers in the MEA block is shortened by one, and it can be varied according to the different values of the t. To maintain the throughput rate with less circuitry, the MEA block uses both the recursive technique and the over-clocking technique. The decoder can decodes codeword received not only in a burst mode, but also in a continuous mode. It can be used in a wide range of applications because of its versatility. The adaptive RS decoder over GF(2$^{8}$ ) having the error-correcting capability of upto 10 has been designed in VHDL, and successfully synthesized in an FPGA chip.

• Journal of the Korea Computer Graphics Society
• /
• v.9 no.3
• /
• pp.23-29
• /
• 2003

There is the temporal correlation of the video sequence between the motion vector of current block and the motion vector of the previous block. If we can obtain useful and enough information from the motion vector of the same coordinate block of the previous frame, the total number of search points used to find the motion vector of the current block may be reduced significantly. In this paper, we propose the block-matching motion estimation using an adaptive initial search point by the predicted motion information from the same block of the previous frame. And the first search point of the proposed algorithm is moved an initial point on the location of being possibility and the searching process after moving the first search point is processed according to the fast search pattern. Simulation results show that PSNR(Peak-to-Signal Noise Ratio) values are improved UP to the 1.05dB as depend on the image sequences and improved about 0.33~0.37dB on an average. Search times are reduced about 29~97% than the other fast search algorithms. Simulation results also show that the performance of the proposed scheme gives better subjective picture quality than the other fast search algorithms and is closer to that of the FS(Full Search) algorithm.

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

Recently, in order to improve high speed data transmission and spectral efficiency in wireless communication systems, the study on the combination OFDM and space-time coding is active. Also, a solution to improve system capacity in multiuser systems is to use adaptive antennas. In a system using STBC, the signals transmitted from two transmit antennas are superposed at the receive antenna and the interference between two transmit antennas of a user occures. Thus it is difficult to apply the conventional beamforming techniques for single antenna to the systems using space-time coding. In this Paper, we present the MMSE beanforming technique using training sequence for STBC-OFDM systems in reverse link and evaluate the performance by using various parameters in TU and HT channels.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.11a
• /
• pp.200-201
• /
• 2010

블록 기반의 적응적 루프 필터(BALF : Block Adaptive Loop Filter)는 압축 성능에 있어서 상당히 높은 효율을 보이는 기술 중 하나이다. BALF는 복원된 영상을 원본 영상에 최대한 유사하게 만드는 Weiner 필터계수와 해당 필터가 적용될 영역에 대한 정보를 복원된 영상에 적용함으로써 화질을 높일 수 있다. 그러나 BALF는 단위블록 전체에 대해 하나의 필터를 생성하여 적용하는 방법으로, 블록 내부에서 구분되는 신호적 특성을 따로 분류하지 않는다. 그러므로 BALF는 높은 부호화 성능을 보이는 반면, 높은 복호화 복잡도를 요구한다는 단점이 있다. 본 논문에서는 필터가 적용될 블록을 내부와 경계 영역으로 나누어 경계 영역을 위한 필터를 구분하여 생성하는 루프필터를 제안한다. 제안하는 알고리즘은 기존의 BALF에 비해 부호화 성능이 저하되지만, 필터를 적용할 영역을 선택 가능하게 함으로써 복호화 복잡도를 조절할 수 있도록 하였다. 제안한 방법의 실험결과, 기존의 방법인 BALF에 대하여 블록의 경계 영역 필터를 사용할 경우, 약 3.77%의 부호화 성능 저하에 대하여 약 33.76%의 필터링 속도 향상을 보였다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1996.06a
• /
• pp.223-227
• /
• 1996

In this paper we propose an adaptive fast image restoration filter, which is suitable for reducing the blocking artifacts in the compressed image in real-time. The proposed restoration filter is based on the observation that quantization operation in a series of coding process is a nonlinear and many-to-one mapping operator. And then we propose an approximated version of constrained optimization technique as a restoration process for removing the nonlinear and space varying degradation operator. We also propose a novel block classification method for adaptively choosing the direction of a highpass filter, which serves as a constraint in the optimization process. The proposed classification method adopts the bias-corrected maximized likelihood, which is used to determine the number of regions in the image for the unsupervised segmentation. The proposed restoration filter can be realized either in the discrete Fourier transform domain or in the spatial domain in the form of a truncated finite impulse response (FIR) filter structure for real-time processing. In order to demonstrate the validity of the proposed restoration filter experimental results will be shown.

• Clinical and Experimental Pediatrics
• /
• v.48 no.11
• /
• pp.1153-1161
• /
• 2005

As known by other name(natural immunity), the innate immune system comprises all those mechanisms for dealing with infection that are constitutive or built in, changing little with age or with experience of infection. Though in some ways less sophisticated than adaptive immunity, innate immunity should not belittled, since it has evidently protected thousands of species of invertebrates sufficiently to survive for up to 2 billion years. In the innate immune system, molecules of both cellular and humoral types are involved, corresponding to the need to recognize and dispose of different types of pathogen, to promote inflammatory responses and to interact to the adaptive immune system. A major features of innate immunity are the presence of the normal gut flora, complements, macrophages, dendritic cells, natural killer cells and many cytokines that can block the establishment of infection. Both phagocytic cells and complement system have tremendous potential for damaging host cells, but fortunately they are normally only triggered by foreign materials, and usually most of their destructive effects are focussed on the surface of these or in the safe environment of the phagolysosome. This article addreses the comprehensive mechanisms of the major components of the innate immune system to prevent the infection.

• Journal of KIISE:Information Networking
• /
• v.37 no.2
• /
• pp.162-165
• /
• 2010

In the paper, we propose an algorithm that significantly reduces unnecessary computations, while keeping prediction quality almost similar to that of the full search. In the proposed algorithm, we can reduces only unnecessary computations efficiently by taking different search patterns and error criteria of block matching according to distribution probability of motion vectors. Our algorithm takes only 20~30% in computational amount and has decreased prediction quality about 0~0.02dB compared with the fast full search of the H.264 reference software. Our algorithm will be useful to real-time video coding applications using MPEG-2/4 AVC standards.