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

기존의 비디오 부호화 표준에서는 참조영상을 보간하여 해상도를 증가시킨 후, 고정된 움직임 벡터 해상도로 영상 전체를 부호화 한다. 참조 영상의 해상도를 증가시킨 만큼 움직임 보상에 의하여 예측에러가 줄어들지만, 움직임 벡터 해상도가 증가한 만큼 움직임 벡터의 부호화 비트량이 증가한다. 고정된 해상도의 움직임 벡터로 부호화하는 경우, 영상의 지역적인 움직임 특성이 다른 경우 부호화 효율이 떨어질 수 있다. 따라서 본 논문에서는 기존의 비디오 부호화 표준들이 영상의 지역적인 특성을 고려하지 않고 고정된 해상도의 움직임 벡터를 사용하여 부호화하는 문제점을 극복하기 위하여 슬라이스 단위로 1/4 화소 해상도 또는 1/8 화소 해상도 또는 움직임 벡터 단위로 적응적으로 화소 해상도를 결정하는 것 중에서 최적의 슬라이스 움직임 벡터 해상도를 결정하여 부호화하는 방법을 제안한다. 제안한 방법을 사용하여 부호화하면 움직임 벡터의 부호화 비트의 낭비를 막고, 예측 에러도 줄어들어 부호화 효율을 높일 수 있다. 제안하는 방법을 사용하여 부호화 하는 경우 H.264/AVC와 비교하여 평균 1.97%의 BD-RATE을 감소한다.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.50-53
• /
• 2002

There are increasing needs to deliver the multimedia streaming over heterogeneous networks. When considering network environments and equipment accessed by user, delivery of video streaming must be scalable. There are many kinds of scalable video coding: spatial, temporal, SNR, and hybrid. The SNR scalable and spatial resolution, but different SNR quality with respect to layers. The 1-layer SNR scalable encoder produces SNR scalable video streams with ease. But, there is drift problem. Modified 1-layer approach does not have this problem but coding inefficiency, and is not MPEG-compliant. The present MPEG-compliant 2-layer encoder comes out to reduce coding rate. But it still use only base layer to encode whole layer. In this paper, we propose adaptive MPEG-compliant 2-layer encoder. Using linear combination algorithm, encoder use 1 motion vector to encode the sequences efficiently. By dong this, we can achieve the coding efficiency of SNR scalable coding.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.10
• /
• pp.1095-1102
• /
• 2014

In this paper, We proposed the approach of GPU and motion vector to analysis the Human activity in real-time surveillance system. The most important part, that is detect blob(human) in the foreground. We use to detect Adaptive Gaussian Mixture, Weighted subtraction image for salient motion and motion vector. And then, We use motion vector for human activity analysis. In this paper, the activities of human recognize and classified such as meta-classes like this {Active, Inactive}, {Position Moving, Fixed Moving}, {Walking, Running}. We created approximately 300 conditions for the simulation. As a result, We showed a high success rate about 86~98%. The results also showed that the high resolution experiment by the proposed GPU-based method was over 10 times faster than the cpu-based method.

• Journal of Mechanical Science and Technology
• /
• v.15 no.5
• /
• pp.646-655
• /
• 2001

This paper reports the effects of nozzle exit boundary layer swirl on the instability modes of underexpanded supersonic jets emerging from plane rectangular nozzles. The effects of boundary layer swirl at the nozzle exit on thrust and mixing of supersonic rectangular jets are also considered. The previous study was performed with a 30°boundary layer swirl (S=0.41) in a plane rectangular nozzle exit. At this study, a 45°boundary layer swirl (S=1.0) is applied in a plane rectangular nozzle exit. A three-dimensional unsteady compressible Reynolds-Averaged Navier-Stokes code with Baldwin-Lomax and Chiens $\kappa$-$\xi$ two-equation turbulence models was used for numerical simulation. A shock adaptive grid system was applied to enhance shock resolution. The nozzle aspect ratio used in this study was 5.0, and the fully-expanded jet Mach number was 1.526. The \"flapping\" and \"pumping\" oscillations were observed in the jets small dimension at frequencies of about 3,900Hz and 7,800Hz, respectively. In the jets large dimension, \"spanwise\" oscillations at the same frequency as the small dimensions \"flapping\" oscillations were captured. As reported before with a 30°nozzle exit boundary layer swirl, the induction of 45°swirl to the nozzle exit boundary layer also strongly enhances jet mixing with the reduction of thrust by 10%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4259-4271
• /
• 2016

With the increased popularity of IEEE 802.11 WLAN, the density of the WLAN devices per access point has also increased, resulting in throughput performance degradation. One of the solutions to the problem is improving the protocol efficiency by a using multi-round contention scheme. This paper first discusses how to estimate the number of contending stations in a WLAN network by using minimum elapsed backoff counter values that can be easily monitored by each station. An approximate closed form expression is derived for the number of active contending stations using the smallest backoff counter value in the network. We then apply this result to adapt the number of contending rounds according to the network loading level to enhance the throughput performance of a multi-round contention scheme. Through simulation, we show that the accuracy of the estimation algorithm depends on the contention parameters of W and the number of backoff counter observing samples, and found a reasonable value for each parameter. We clearly show that our adaptive multi-round contention scheme outperforms the standard contention scheme that uses a fixed number of rounds.

• Proceedings of the KIEE Conference
• /
• 2003.11b
• /
• pp.191-194
• /
• 2003

In this paper, we propose a new accurate and robust image mosaic technique of the mural underdrawing taken from the infra-red camera, which is based on multiple image registration and adaptive blending technique. The image mosaicing methods which have been developed so far have the following deficits. It is hard to generate a high resolution image when there are regions that do not have features or intensity gradients, and there is a trade-off in overlapping region site in view of registration and blending. We consider these issues as follows. First, in order to mosaic Images with neither noticeable features nor intensity gradients, we use a Projected supplementary pattern and pseudo color image for features in the image Pieces which are registered. Second, we search the overlapping region size with minimum blending error between two adjacent images and then apply blending technique to minimum error overlapping region. Finally, we could find our proposed method is more effective and efficient for image mosaicing than conventional mosaic techniques and also is more adequate for the application of infra-red mural underdrawing mosaicing. Experimental results show the accuracy and robustness of the algorithm.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2000.11b
• /
• pp.63-67
• /
• 2000

디지털 영상 저장 과정에서 일어나는 문제점은 영상 저장부 센서계의 한계로 나타낼 수 있다. 센서계의 충분하지 못한 집적도는 물리적으로 피할 수 없는 현상이다. 이러한 현상을 디지털 신호처리 기술을 적용하여 극복할 수 있다. 센서계의 한계로 인한 문제는 디지털 영상의 가장 큰 문제중의 하나이며, 이러한 한계를 극복하는 고해상도 영상 복원 방법들은 많은 학자들에 의해 제안되어 왔다. 본 논문에서는, 기존의 고해상도 영상 복원 방법들과는 달리 원영상의 공간적 고주파 성분의 특성을 분석과, 주어진 저해상도 영상들의 부화소 단위 움직임 추정 오류에 대한 분석을 통해 영상 복원과정에 이러한 분석들의 결과를 반영한다. 위에서 언급한 추정 오류는 우리에게 하나의 잡음 형태로 나타날 수 있다. 이 잡음은 추정이 이루어지는 축에 따라 그 양이 다르게 나타나게 되고, 이러한 현상은 목적이 되는 영상의 공간적 고주파 성분의 분포와 밀접한 관련이 있다. 우리는 복원 과정에 기존의 영상복원 방법중의 하나인 정규화 방법을 도입한다. 위에서 분석된 현상을 이 복원 과정에 반영하여 기존의 고해상도 영상 복원 방법보다 향상된 결과를 얻을 수 있었다. 결론적으로, 제안하는 알고리즘은 부화소 단위 움직임 추정 오류의 분석 결과를 반영하므로 이러한 추정 오류에 강한 알고리즘이다.

• Journal of Multimedia Information System
• /
• v.4 no.4
• /
• pp.179-188
• /
• 2017

The Internet Video Coding (IVC) standard is due to be published by Moving Picture Experts Group (MPEG) for various Internet applications such as internet broadcast streaming. IVC aims at three things fundamentally: 1) forming IVC patents under a free of charge license, 2) reaching comparable compression performance to AVC/H.264 constrained Baseline Profile (cBP), and 3) maintaining computational complexity for feasible implementation of real-time encoding and decoding. MPEG experts have worked diligently on the intellectual property rights issues for IVC, and they reported that IVC already achieved the second goal (compression performance) and even showed comparable performance to even AVC/H.264 High Profile (HP). For the complexity issue, however, there has not been thorough analysis on IVC decoder. In this paper, we analyze the IVC decoder in view of the time complexity by evaluating running time. Through the experimental results, IVC is 3.6 times and 3.1 times more complex than AVC/H.264 cBP under constrained set (CS) 1 and CS2, respectively. Compared to AVC/H.264 HP, IVC is 2.8 times and 2.9 times slower in decoding time under CS1 and CS2, respectively. The most critical tool to be improved for lightweight IVC decoder is motion compensation process containing a resolution-adaptive interpolation filtering process.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.6
• /
• pp.25-32
• /
• 2004

We propose a hierarchical disparity estimation algorithm with edge-preserving energy-based regularization. Initial disparity vectors are obtained from downsampled stereo images using a feature-based region-dividing disparity estimation technique. Dense disparities are estimated from these initial vectors with shape-adaptive windows in full resolution images. Finally, the vector fields are regularized with the minimization of the energy functional which considers both fidelity and smoothness of the fields. The first two steps provide highly reliable disparity vectors, so that local minimum problem can be avoided in regularization step. The proposed algorithm generates accurate disparity map which is smooth inside objects while preserving its discontinuities in boundaries. Experimental results are presented to illustrate the capabilities of the proposed disparity estimation technique.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.2
• /
• pp.141-146
• /
• 1999

In this paper, picture set filter is proposed for preserving compression ratio and video qualify. This filter controls the compression ratio of each frame depending on the correlation to the reference frame by selectively eliminating less important high-resolution areas. Consequently, video quality can be preserved and bit rate can be controlled adaptively. In the simulation, to test the performance of the proposed coding method, comparisons with the full search block matching algorithm and the differential image coding algorithm are made. In the former case, video quality, compression ratio and encoding time is improved. In the latter case, video quality is degraded, but compression ratio and encoding time is improved. Consequently. the proposed method shows a reasonably good performance over existing ones.