• Journal of KIISE
• /
• v.41 no.11
• /
• pp.974-981
• /
• 2014

These days, use of multimedia streaming service and demand of QoS (Quality of Service) improvement have been increased because of development of network. QoS of streaming service is influenced by a jitter, delay, throughput, and loss rate. For guaranteeing these factors which are influencing QoS, the role of transport layer is very important. But existing TCP which is a typical transport layer protocol increases the size of congestion window slowly and decreases the size of a congestion window drastically. These TCP characteristic have a problem which cannot guarantee the QoS of UHD multimedia streaming service. In this paper, we propose a router buffer based congestion control method for improving the QoS of UHD streaming services. Our proposed scheme applies congestion window growth rate differentially according to a degree of congestion for preventing an excess of available bandwidth and maintaining a high bandwidth occupied. Also, our proposed scheme can control the size of congestion window according to a change of delay. After comparing with other congestion control protocols in the jitter, throughput, and loss rate, we found that our proposed scheme can offer a service which is suitable for the UDH streaming service.

• Journal of KIISE:Information Networking
• /
• v.31 no.1
• /
• pp.91-100
• /
• 2004

This paper presents a receiver-driven TCP flow control mechanism, which is adaptive to the wireless condition, for memory constrained mobile receiver. A receiver-driven TCP flow control is, in general, achieved by adjusting the size of advertised window at the receiver. The proposed method constantly measures at the receiver both the available wireless bandwidth and the packet round-trip time. Depending on the measured values, the receiver adjusts appropriately the size of advertised window. Constrained by the adjusted window which reflects the current state of the wireless network, the sender achieves an improved TCP throughput as well as the reduced round-trip packet delay. Its implementation only affects the protocol stack at the receiver and hence neither the sender nor the router are required to be modified. The mechanism has been implemented in real environments. The experimental results show that in CDMA2000 1x networks the TCP throughput of the proposed method has improved about 5 times over the conventional method when the receiver's buffer size is limited to 2896 bytes. Also, with 64Kbytes of buffer site, the packet round-trip time of the proposed method has been reduced in half, compared the case with the conventional method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10C
• /
• pp.975-981
• /
• 2007

In this paper, we propose a spatially adaptive image restoration algorithm using local and statistics and estimated noise. The ratio of local mean, variance, and maximum values with different window size is used to constrain the solution space, and these parameters are computed at each iteration step using partially restored image. In addition, the additive noise estimated from partially restored image and the local constraints are used to determine a parameter for controlling the degree of local smoothness on the solution. The resulting iterative algorithm exhibits increased convergence speed when compared to the non-adaptive algorithm. In addition, a smooth solution with a controlled degree of smoothness is obtained without a prior knowledge about the noise. Experimental results demonstrate that the proposed algorithm requires the similar iteration number to converge, but there is the improvement of SNR more than 0.2 dB comparing to the previous approach.

• Journal of KIISE:Databases
• /
• v.34 no.5
• /
• pp.379-388
• /
• 2007

Disordered streams may cause inaccurate or delayed results in window-based queries. Existing approaches usually leverage buffers to hand]e the streams. However, most of the approaches estimate the buffer size simply based on the maximum network delay in the streams, which tends to over-estimate the buffer size and result in high latency. In this paper, we propose a probabilistic approach to estimate the buffer size adaptively according to the fluctuated network delays. We first assume that intervals of tuple generations follow an exponential distribution and network delays have a normal distribution. Then, we derive an estimation function from the assumptions. The function takes a drop ratio as an input parameter, which denotes a percentage of tuple drops permissible during query execution. By describing the drop ratio in a query specification, users can control the quality of query results such as accuracy or latency according to application requirements. Our experimental results show that the proposed function has better adaptivity than the existing function based on the maximum network delay.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04a
• /
• pp.148-150
• /
• 2000

자원 예약을 보장하지 못하는 네트워크 상에서 실시간 멀티미디어 응용의 만족스러운 서비스를 위해서는 효과적인 종단 시스템의 운영이 필요하다. 이러한 운영 기술 중 버퍼를 이용한 응용 프로그램 수준의 대역폭 평활화 기술과 태스크 스케줄링 기법은 핵심적인 부분을 차지한다. 기존에 제안된 온라인 대역폭 평활화 기법은 동적 슬라이딩 윈도우와 공적 버퍼를 이용하여 네트워크에 적응할 뿐만 아니라 요구 대역폭 평활화를 통해 지터를 흡수, 완충시킴으로써 더 나은 서비스 품질을 보장한다. 그러나 응용 프로그램 수준에서 동작하기 때문에 프로그램의 수행 품질보장을 위한 시간 대역을 보장하지 못할 뿐만 아니라 지터의 발생 가능성이 높다. 본 연구에서는 효과적인 버퍼 관리를 통해 서비스 품질의 손실을 최소화하는 적응성 있는 온라인 대역폭 평활화 기법이 안정적으로 동작하기 위한 최적화된 태스크 스케줄링 기법을 제안한다. 먼저 태스크 스케줄링 기법은 멀티미디어 데이터의 생산과 소비를 적시에 보장할 수 있도록 하여 지터의 발생을 최소화하고, 만일 네트워크 지터가 발생하더라도 응용 프로그램 수준의 버퍼 관리를 통해 완충시킴으로서 서비스 품질의 손실을 최소화한다. 모의 실험에서는 제안된 기법이 온라인 대역폭 평활화 기법을 효과적으로 지원함을 보인다.

• Journal of Korea Society of Industrial Information Systems
• /
• v.12 no.3
• /
• pp.132-140
• /
• 2007

The quality of the camera image is worse than that of the scanner image because of lighting variation and inaccurate focus. This paper proposes a binarization method for camera-based document recognition, which is tolerant to low-quality camera images. Based on an existing method reported to be effective in previous evaluations, we enhanced the adaptability to the image with a low contrast due to low intensity and inaccurate focus. Furthermore, applying an additional small-size window in the binarization process, it is effective to extract the fine detail of character structure, which is often degraded by conventional methods. In experiments, we applied the proposed method as well as other methods to a document recognizer and compared the performance for many cm images. The result showed the proposed method is effective for recognition of document images captured by the camera.

• Journal of the Institute of Convergence Signal Processing
• /
• v.11 no.3
• /
• pp.189-196
• /
• 2010

In this paper, we proposed the adaptive local sigma filter reducing noises generated by an image sensor. The small noises generated by the image sensor are amplified by increased an analog gain and an exposure time of the image sensor together with information. And the goal of this work was the system design that is reduce the these amplified noises. Edge data are extracted by Flatness Index Map algorithm. We made the threshold adaptively changeable by the luminance average in this algorithm that extracts the edge data not in high luminance, but just low luminance. The Local Sigma Filter performed only about the edge pixel that were extracted by Flatness Index Map algorithm. To verify the performance of the designed filter, we made the Window test program. The hardware was designed with HDL language. We verified the hardware performance of Local Sigma Filter system using FPGA Demonstration board and HD image sensor, $1280{\times}720$ image size and 30 frames per second.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.11
• /
• pp.90-98
• /
• 2013

The stereo system based on local matching is very popular due to its algorithmic simplicity, however it is limited to apply to various applications because it shows poor quality with low matching rates. In this paper, we propose and design a realtime stereo system based on an adaptive support-weight and the system shows low error rates and realtime performance. Generally, in the adaptive support-weight algorithm the intermediate computing results can not be reused to reduce the number of computations. In this research we modify the scheduling to reuse the intermediate results for the better performance by processing rows and columns separately. The nonlinear functions such as exponential or arc tangent have been designed with piecewise linear and step functions by empirical simulations and error analysis. The proposed architecture is composed of 9 processing elements for realtime performance. The proposed stereo system has been designed and synthesized using Donbu Hitek 0.18um standard cell library and can run up to 350Mhz operation frequency (33 frames per second) with 424K gates.

• Proceedings of the KIEE Conference
• /
• 1999.11d
• /
• pp.921-923
• /
• 1999

비휘발성 메모리의 고집적화와 적응학습형 뉴럴 소자의 실현을 위하여 1-트랜지스터 구조 강유전체 비휘발성 메모리(MFS-FET)를 SOI 기판위에 제작하고 평가하였다. 먼저 SBT($Sr_{0.8}Bi_{2.2}Ta_{2}O_{9}$)를 직접 Si위에 증착하고 C-V를 측정하여 1V의 메모리 윈도우를 얻음으로써 비휘발성 메모리로써의 동작가능성을 확인하였다. 또한 다양하게 게이트의 W/L 비를 바꾸어서 MFS-FET를 제작하여 다양한 드레인 전압-드레인 전류 특성을 얻었고 실제로 쓰기와 읽기 동작을 수행하여 MFS-FET가 비휘발성 메모리로써 제대로 동작하고 있음을 확인하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04b
• /
• pp.559-561
• /
• 2001

본 논문에서는 스테레오 영상으로부터 변위를 추정할 수 있는 다양한 방법들 중 특정 기반 방식과 영역 기반 방식의 각각의 장점들을 살리고 단점들을 보완하기 위한 방법은 제안한다. 영상의 경계선을 이루는 특징점들은 전체 영상의 5% 내외의 소수로 추출되면서도 많은 양의 영상 정보를 가지고 있으므로, 이 점들에 대해 일정한 매칭 과정을 통해 대응점을 구하고, 이 중 90% 이상의 정확성 매칭 확률을 가진 대응점들을 영상으로 기준점으로 설정한다. 그리고 이러한 기준점 이외의 점들에 대해서는 추출된 기준점들의 순서에 맞추어 Ordering Constraint를 적용시키고 기준점에 따라 블록의 크기가 달라지는 영역 기반 방식을 적용하여 조밀한 변위를 추정하였다. 이렇게 함으로써 영역 기반 방식과 특징 기반 방식의 각각의 장점들을 이용하면서도 특정기반 방식의 문제점인 보간법 문제를 해결하였고, 또한 블록의 크기 따라 계산 시간과 정합 오차가 많이 좌우되는 영역 기반 방식의 단점들을 해결하였다. 또한 기준점을 이용하여 Ordering constraint 기반하에 영역 정보를 이용하므로 좀 더 올바른 순서 조건에 맞추어 대응점을 찾을 수 있고 또한 폐쇄 영역 부분도 쉽게 찾을 수 있었다.