• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10B
• /
• pp.1979-1985
• /
• 1999

In this paper, we offer an analysis method for SL/D/1/K queueing system, where the shifting-level (SL) process proposed in the part I of this study[1]. Since an exact analysis of SL/D/1/K queueing system is very difficult, we propose an approximation method, where the queze sizes at input state transition epochs is quantized and thus the name 'quantization reduction method'. We provide the upper and lower bounds of the approximation for the system size distribution also, In addition, since the continuos version of well-known DAR(1) model is a kind of SL process with exponential correlation term only, the proposed method can be directly applied to the analysis of DAR(1)/D/1/K queueing system as well.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1252-1260
• /
• 1999

The HFC network has a architecture of a star topology in fiber optic trunks, and tree and branch topology is used in the part of coaxial cable. It is well known that the HFC upstream channel is noisy. Ingress, common mode distortion and impulse noise exist in the upstream channel. In order to provide Quality of Service(QoS) to users with real-time data such as voice, video and interactive services, the evolving IEEE 802.14 standard for HFC networks must include an effective priority scheme. The scheme separates and resolves collisions between stations in a priority order. It is important to simulate protocols under a practical environment. The proposed algorithm in this paper is simulated with the assumption that the collision detector made certain mistake due to noises. Simulation results show that the proposed algorithm is more efficient than existing tree-based algorithm under practical environment.

• Journal of KIISE:Information Networking
• /
• v.35 no.6
• /
• pp.549-556
• /
• 2008

To achieve flexible visual content adaption for multimedia communications, the ISO/IEC MPEG & ITU-T VCEG form the JVT to develop SVC amendment for the H.264/AVC standard. JVT uses inter-layer prediction as well as inter prediction and intra prediction that are provided in H.264/AVC to remove the redundancy among layers. The main goal consists of designing inter-layer prediction tools that enable the usage of as much as possible base layer information to improve the rate-distortion efficiency of the enhancement layer. But inter layer prediction causes the computational complexity to be increased. In this paper, we proposed an efficient residual prediction. In order to reduce the computational complexity while maintaining the high coding efficiency. The proposed residual prediction uses modified interpolation that is defined in H.264/AVC SVC.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10C
• /
• pp.787-797
• /
• 2008

In this paper, we propose a fast disparity estimation method considering temporal and spatial redundancy based on a dynamic programming for stereo matching. For the first step, the dynamic programming is performed to estimate disparity vectors with correlation between neighboring pixels in an image. Next, we efficiently compensate regions, which disparity vectors are not allocated, with neighboring disparity vectors assuming that disparity vectors in same object are quite similar. Moreover, in case of video sequence, we can decrease a complexity with temporal redundancy between neighboring frames. For performance comparison, we generate an intermediate-view image using the estimated disparity vector. Test results show that the proposed algorithm gives $0.8{\sim}2.4dB$-increased PSNR(peak signal to noise ratio) compared to a conventional block matching algorithm, and the proposed algorithm also gives approximately 0.1dB-increased PSNR and $48{\sim}68%$-lower complexity compared to the disparity estimation method based on general dynamic programming.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3C
• /
• pp.92-101
• /
• 2005

It is difficult to detect the accurate detection which leads the camera it moves follows in change of the noise or illumination and Also, it could be recognized with backgound if the object doesn't move during hours. In this paper, the proposed method is updating changed background image as much as N＊M pixel mask as time goes on after get a difference between imput image and first background image. And checking image pixel can efficiently detect moving by computing fixed distance pixel instead of operate all pixel. Also, set up minimum area of object to use boundary point of object abstracted through checking image pixel and motion detect of object. Therefore motion detection is available as is fast and correct without doing checking image pixel every Dame. From experiment, the designed and implemented system showed high precision ratio in performance assessment more than 90 percents.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.9
• /
• pp.3011-3018
• /
• 2000

On ATM networks, ABR services are provided using the remained bandwidth after allocating CBR and VBR traffic. Realtime services such as transmitting audio or video data may be provided using CBR and VBR which have a constrained transmission delay, but in these cases, the communications bandwidth may be wasted. This paper proposes an efficient bandwidth allocation algorithm to transfer real-time data using ABR service. The proposed algorithm guarantees MCR and allocates bandwidth to each connection proportional to its MCR. The proposed algorithm divides the connections in two groups - a satisfied state group and a bottlenecked state group - and enhances bandwidth utilization by allowing the remained bandwidth after allocating the connections in the satisfied state to be allocated to the connections in the bottlenecked state. Our algorithm uses a Queue control function proposed by Ghani[5] to keep the Queue length within some boundary, which makes the transmission delay constant. We simulate and compare the performance of the proposed algorithm with that of the algorithms proposed by ATM Forum[1] and Kalampoukas[2].

• Journal of Broadcast Engineering
• /
• v.15 no.6
• /
• pp.791-802
• /
• 2010

Recent prevalence of progressive scan display such as LCD TV demands the quality improvement of existing deinterlacing techniques that convert interlaced scan images including HDTV broadcasting to progressive scan images. In this paper, we proposea motion adaptive deinterlacing technique which can be used for spatial methods, temporal methods, and the spatial-temporal methods can be used for the deinterlacing techniques selectively based on the threshold values calculated by the statistics of motion in the video contents. We also propose an improved spatial deinterlacing technique that adaptively use M-ELA and DOI based on the slant of edges that are obtained by Sobel operation. The improved picture quality of the proposed algorithm is confirmed by objective and subjective quality tests on many test image sequences.

• Journal of Satellite, Information and Communications
• /
• v.9 no.1
• /
• pp.13-16
• /
• 2014

In applying LCD to TV application, one of the most significant factors to be improved is image sticking on the moving picture. LCD is different from CRT in the sense that it's continuous passive device, which holds images in entire frame period, while impulse type device generate image in very short time. To reduce image sticking problem related to hold type display mode, we made an experiment to drive TN-LCD like CRT. We made articulate images by fast refreshing images, and we realized the ratio of refresh time by counting between on time and off time for video signal input during 1 frame (16.7ms). Conventional driving signal cannot follow fast on-off speed, so we evaluated new signal generator using SDI (Serial Data Interface) mode signal generator. We realized articulate image generation similar to CRT by high fast full HD (High Definition) signals and TN-LCD overdriving. As a result, reduced image sticking phenomenon was validated by naked eye and response time measurement.

• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.586-588
• /
• 2007

The Moore's law states that the number of transistors on a chip doubles about every 18 months. And it was reported that the network speed has been doubled about every 9 months. This indicates that computing power and network is no longer the obstacles for the high performance applications requiring terabits networks. We believe that the application motivates the network and vice versa. This presentation will introduce the GLORIAD which is the first ring network connecting six countries around the world and provides scientists with advanced networking tools that improve a communications and data exchange. The GLORIAD trans-Pacific link started its service on August 1, 2005. Since then, there has been remarkable demonstrations were performed through major conferences like Supercomputing Conference. This paper will introduce the global collaborative works on demonstrations of VMT, high energy physics, SDSS and HD video transmission during SC'06 in Tampa, FL.

• Journal of Satellite, Information and Communications
• /
• v.10 no.1
• /
• pp.56-61
• /
• 2015

In this paper, the 3D positioning of IoT sensors with the Unity engine of android platform based home-hub was proposde for IoT(Internet of Things) users. Especially, the monitoring of IoT sensor and battery status was designed with the clustering of IoT sensor's position. The 3D positioning of RSSI(received signal strength indicator) and angle for new IoT sensor according to clustering method was described with the cooperation of beacon and received arrival signal time. This unity engine based smart hub platform can monitor the working situation of IoT sensors, and apply 3D video with texture for the life-cycling of many IoT sensors simultaneously. rs was described with RSSI(received signal strength indicator) and received angle.