• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2001.05a
• /
• pp.288-299
• /
• 2001

In transcoding, simply reusing the motion vectors extracted from an incoming video bit stream may not result in the best quality because the incoming motion vectors become non-optimal due to the reconstruction errors. To achieve the best video quality possible, a new motion estimation should be performed in the transcoder. An adaptive motion vector refinement is proposed that refines the base motion vector according to the activity of macroblock using intermediate data extracted from an incoming video bit stream. Experimental results shows that the proposed method can improve the video quality to the level achieved by using the full-scale motion estimation with minimal computational complexity.

• The KIPS Transactions:PartB
• /
• v.15B no.6
• /
• pp.533-542
• /
• 2008

Background subtraction from video data is one of the most important task in various realtime machine vision applications. In this paper, a new scheme for background subtraction based on the hexagonal pixel sampling is proposed. Generally it has been found that hexagonal spatial sampling yields smaller quantization errors and remarkably improves the understanding of connectivity. We try to apply the hexagonally sampled image to the LBP based non-parametric background subtraction algorithm. Our scheme makes it possible to omit the bilinear pixel interpolation step during the local binary pattern generation process, and, consequently, can reduce the computation time. Experimental results revealed that our approach based on hexagonal spatial sampling is very efficient and can be utilized in various background subtraction applications.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.12
• /
• pp.109-120
• /
• 1998

An image segmentation approach based on the fuzzy worm searching and MIN-MAX clustering algorithm is proposed in this paper. This algorithm deals with fuzzy worm value and min-max node at a gross scene level, which investigates the edge information including fuzzy worm action and spatial relationship of the pixels as the parameters of its objective function. But the conventional segmentation methods for edge extraction generally need the mask information for the algebraic model, and take long run times at mask operation, whereas the proposed algorithm has single operation according to active searching of fuzzy worms. In addition, we also propose both genetic fuzzy worm searching and genetic min-max clustering using genetic algorithm to complete clustering and fuzzy searching on grey-histogram of image for the optimum solution, which can automatically determine the size of ranges and has both strong robust and speedy calculation. The simulation results showed that the proposed algorithm adaptively divided the quantized images in histogram region and performed single searching methods, significantly alleviating the increase of the computational load and the memory requirements.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.6
• /
• pp.549-558
• /
• 2001

It is important to reuse existing motion capture data for reduction of the animation producing cost as well as efficiency of producing process. Because its motion curve has no control point, however, it is difficult to modify the captured data interactively. The motion transition is a useful method to reuse the existing motion data. It generates a seamless intermediate motion with two short motion sequences. In this paper, Uniform Posture Map (UPM) algorithm is proposed to perform the motion transition. Since the UPM is organized through quantization of various postures with an unsupervised learning algorithm, it places the output neurons with similar posture in adjacent position. Using this property, an intermediate posture of two active postures is generated; the generating posture is used as a key-frame to make an interpolating motion. The UPM algorithm needs much less computational cost, in comparison with other motion transition algorithms. It provides a control parameter; an animator could control the motion simply by adjusting the parameter. These merits of the UPM make an animator to produce the animation interactively. The UPM algorithm prevents from generating an unreal posture in learning phase. It not only makes more realistic motion curves, but also contributes to making more natural motions. The motion transition algorithm proposed in this paper could be applied to the various fields such as real time 3D games, virtual reality applications, web 3D applications, and etc.

• The KIPS Transactions:PartB
• /
• v.12B no.3 s.99
• /
• pp.223-232
• /
• 2005

In this paper, we propose a novel post-filtering algorithm with low computational complexity that improves the visual quality of decoded images using block boundary classification and simple adaptive filter (SAF). At first, each block boundary is classified into smooth or complex sub-region. And for smooth-smooth sub-regions, the existence of blocking artifacts is determined using blocky strength. And simple adaptive filtering is processed in each block boundary area. The proposed method processes adaptively, that is, a nonlinear 1-D 8-tap filter is applied to smooth-smooth sub-regions with blocking artifacts, and for smooth-complex or complex-smooth sub-regions, a nonlinear 1-D variant filter is applied to block boundary pixels so as to reduce the blocking and ringing artifacts. And for complex-complex sub-regions, a nonlinear 1-D 2-tap filter is only applied to adjust two block boundary pixels so as to preserve the image details. Experimental results show that the proposed algorithm produced better results than those of conventional algorithms both subjective and objective viewpoints.

• Journal of Korea Multimedia Society
• /
• v.6 no.3
• /
• pp.508-517
• /
• 2003

This paper presents perceptual model with a stochastic multiresolution characteristic that can be applied with watermark embedding in the biorthogonal wavelet domain. The perceptual model with adaptive watermarking algorithm embeds at the texture and edge region for more strongly embedded watermark by the SSQ. The watermark embedding is based on the computation of a NVF that has local image properties. This method uses non- stationary Gaussian and stationary Generalized Gaussian models because watermark has noise properties. The particularities of embedding in the stationary GG model use shape parameter and variance of each subband regions in multiresolution. To estimate the shape parameter, we use a moment matching method. Non-stationary Gaussian model uses the local mean and variance of each subband. The experiment results of simulation were found to be excellent invisibility and robustness. Experiments of such distortion are executed by Stirmark 3.1 benchmark test.

• Journal of Korean Society of Transportation
• /
• v.20 no.5
• /
• pp.81-98
• /
• 2002

This paper documents the development of a bi-objective(minimizing delays and Queue lengths) cycle-free signal timing length model using Genetic Algorithm. The model was embodied using MATLAB. the language of technical computing. A special feature of this model is its ability to concurrently manage delays and queue lengths of turning movement concurrently. The model produces a cycle-free signal timing(cycles and green times) for each intersection on the cycle basis. Appropriate offsets could be also accomplished by applying cycle-free based signal timings for respective intersections. The model was applied to an example network which consists of four intersections. The result shows that the model produces superior signal timings to the existing signal timing model in terms of managing delays and queue lengths of turning movements.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.1 no.3
• /
• pp.97-103
• /
• 2008

In this paper, $256{\times}256$ input image is classified into a validity block and an edge block of $8{\times}8$ block for image compression. DCT(Discrete Cosine Transform) is executed only for the DC coefficient that is validity coefficients for a validity block. Predict the position where a quantization coefficient becomes 0 for an edge block, I propose new algorithm to execute DCT in the reduced region. Not only this algorithm that I proposed reduces computational complexity of FDCT(Forward DCT) and IDCT(Inverse DCT) and decreases encoding time and decoding time. I let compressibility increase by accomplishing other stability verticality zigzag scan by the block size that was classified for each block at the time of huffman encoding each. In addition, the algorithm that I suggested reduces Run-Length by accomplishing the level verticality zigzag scan that is good for a classified block characteristic and, I offer the compressibility that improved thereby.

• Journal of Navigation and Port Research
• /
• v.28 no.1
• /
• pp.9-16
• /
• 2004

The purpose of this study is to examine the algorithm of ship collision avoidance system and to improve its performance. The study on the algorithm of ship collision avoidance system have been carried out by many researchers. We can divide the study according to the adopted theory into two category such as 'collision risk calculation method' and 'risk area method'. It is not so difficult to find heir merit and demerit in the respective method. This study suggested newly modified model, which can overcome a limit in the two method. The suggested model is based on collision risk calculation method and suggests how to solve the threshold value problem, that is, one of the unsolved issues in collision risk calculation method. To solve that problem this study proposed new system under which the users can select appropriate threshold value according to environments such as traffic situations and weathers conditions. Simulation results of new model is schematized using 'risk area method'to examine the relationships between the two method. In addition, in case of 'collision risk method', when TCPA and DCPA are used to determine collision risk, a problem happens, that is, two ships become too close in their stem area, therefore, partial function of 'risk area method'is adopted to solve the problem in suggested model.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2014.06a
• /
• pp.203-205
• /
• 2014

본 논문에서는 HEVC 기반 비디오 부호화에 있어 CTU 단위의 시각 민감도에 따라 CTU 별로 QP 를 조절하여 주관적 화질을 향상시키는 방법을 제안한다. 시각 민감도를 측정하는 방법으로서 화소 영역에서의 최소가지차(JND, just noticeable distortion)를 계산하여 이용하였고, 이를 HM 12.0 참조 소프트웨어에서 이용되는 $R-{\lambda}$ 모델 기반의 율 제어 모듈에 결합하여 시각 민감도에 따라 QP 를 제어할 수 있도록 하였다. 시각 민감도가 큰 영상의 영역에 대해서는 상대적으로 작은 QP 값을, 시각민감도가 작은 영역에 대해서는 큰 QP 값을 양자화 과정에 적용함으로써, 시각 민감도가 작은 영역에 대해서는 사용 비트양을 절약하고, 절약된 비트를 상대적으로 시각 민감도가 큰 영역을 위해 사용함으로써 비디오의 주관적 화질을 향상시킬 수 있었다. 뿐만 아니라 이를 하드웨어에 적용 가능하게 하기 위해 HM 12.0 기반 하드웨어 구현을 위한 소프트웨어 플랫폼에 구현하여 실험한 결과, $R-{\lambda}$ 모델 율 제어 알고리즘으로 율 제어 하여 부호화 한 경우 Y-PSPNR(peak signal to perceptual noise ratio)에 대한 BD-rate 는 평균 9.4%의 이득이 있었음을 확인하였다.