• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.5
• /
• pp.1733-1751
• /
• 2015

The IEEE 802.15.4 standard not only provides a maximum of seven guaranteed time slots (GTSs) for allocation within a superframe to support time-critical traffic, but also achieves ultralow complexity, cost, and power in low-rate and short-distance wireless personal area networks (WPANs). Real-time wireless body area sensor networks (WBASNs), as a special purpose WPAN, can perfectly use the IEEE 802. 15. 4 standard for its wireless connection. In this paper, we propose an adaptive GTS allocation scheme for real-time WBASN data transmissions with different priorities in consideration of low latency, fairness, and bandwidth utilization. The proposed GTS allocation scheme combines a weight-based priority assignment algorithm with an innovative starvation avoidance scheme. Simulation results show that the proposed method significantly outperforms the existing GTS implementation for the traditional IEEE 802.15.4 in terms of average delay, contention free period bandwidth utilization, and fairness.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.3
• /
• pp.177-183
• /
• 2007

Active queue management (AQM) refers to a family of packet dropping mechanisms for router queues that has been proposed to support end-to-end congestion control mechanisms in the Internet. The proposed AQM algorithm by the IETF is Random Early Detection (RED). The RED algorithm allows network operators simultaneously to achieve high throughput and low average delay. However. the resulting average queue length is quite sensitive to the level of congestion. In this paper, we propose the Refined Adaptive RED(RARED), as a solution for reducing the sensitivity to parameters that affect RED performance. Based on simulations, we observe that the RARED scheme improves overall performance of the network. In particular, the RARED scheme reduces packet drop rate and improves goodput.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.07a
• /
• pp.188-191
• /
• 2010

스테레오 매칭은 Robot Vision 분야에서 가장 활발하게 연구가 진행되어온 주제이다. 과거 많은 연구들은 스테레오 매칭 알고리즘의 정확도를 높이거나 처리속도를 개선하는 것 중 어느 한 쪽에만 집중하고 있었으며, 두 가지를 동시에 고려한 연구는 상대적으로 연구가 미흡한 실정이다. 본 논문에서는 영상의 공간적 중복 성질을 이용하여 스테레오 매칭 알고리즘의 처리속도를 획기적으로 개선하는 방법을 제안하고, 처리 속도 감소에 따라 증가되는 disparity map 추정 오차를 보상하는 기술을 제안한다. 구체적으로 Dynamic Programming (DP) 기반 스테레오 매칭 알고리즘에 제안한 속도 개선 방법을 적용하고, 개선된 Adaptive Support Weight Filter를 사용하여 보다 효과적인 오차 보상을 실현 하였다. 체계적인 실험을 통해, 본 논문에서 제안 하는 스테레오 매칭 알고리즘은 처리속도와 정확도를 동시에 개선할 수 있음을 검증하였다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.303-304
• /
• 2011

영역기반 스테레오 매칭의 분야에서 최근 인간의 시각체계(Human Visual System)에 기반하여 영역내의 밝기값과 거리값에 따라 적응적으로 가중치를 부여하는 적응적 영역 가중치(Adaptive Support-Weight) 방법이 좋은 매칭 결과를 보이고 있다. 하지만 이 방법은 영역 윈도우의 크기가 커짐에 따라 기하급수적으로 계산량이 많아지는 단점을 보이고 있다. 이에 Bilateral filter 수식으로 근사화 후 Integral Histogram 기법을 적용하여 영역 윈도우의 크기에 상관없이 상수 시간 O(1) 내에 매칭을 수행하는 연구가 진행되었다. 하지만 이 방법은 근사화 과정에서의 원 ASW 수식을 왜곡하기 때문에 매칭 정확도의 손실을 가져오게 된다. 이에 본 논문에서는 Bilateral 접근 방식, Sub-Block 방식 및 적응적 시차 탐색 방식에 대하여 각 방식에서 필요한 메모리 자원과 소모되는 계산량의 비용과 동시에 매칭 결과 정확도 면에서 비교하고 가장 좋은 접근 방식을 도출하고자 한다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.2
• /
• pp.180-191
• /
• 2005

The rapid growth of mobile communication technology has provided the expansion of mobile internet services, particularly mobile commerce takes much weight among them. Even though current mobile commerce service has serious problems which check its development, such as limited contents, expensive charge system and hardware restriction of mobile device, it is strongly expected as one of the next generation Internet services. In this paper, we summarize the problems like above and provide some total solution to meet them as follows: a function for automatic gathering of product information on online Internet and automatic translation it to data for mobile commerce, a middlelet application which provides functions for product search and order on the mobile device through off-line processing, and a function of user adaptive recommendation. We have actually designed and implemented the proposed system and verified the functions and effectiveness of the system.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.4
• /
• pp.61-67
• /
• 2017

Low-dose X-ray fluoroscopic image sequences to avoid radiation exposure risk are contaminated by quantum noise. To restore these noisy sequences, we propose a 3D nonlocal means (NLM) filter based on stochastic distancesed can be applied to the denoising of X-ray fluoroscopic image sequences. The stochastic distance is obtained within motion-compensated noise filtering support to remove the Poisson noise. In this paper, motion-adaptive weight which reflected the frame similarity is proposed to restore the noisy sequences without motion artifact. Experimental results including comparisons with conventional algorithms for real X-ray fluoroscopic image sequences show the proposed algorithm has a good performance in both visual and quantitative criteria.

• Journal of Digital Convergence
• /
• v.15 no.6
• /
• pp.229-236
• /
• 2017

An efficient frequent pattern algorithm is essential for mining association rules as well as many other mining tasks for convergence with its application spread over a very broad spectrum. Models for mining pattern have been proposed using a FP-tree for storing compressed information about frequent patterns. In this paper, we propose a centroid frequent pattern growth algorithm which we called "CAWFP-Growth" that enhances he FP-Growth algorithm by making the center of weights and frequencies for the itemsets. Because the conventional constraint of maximum weighted support is not necessary to maintain the downward closure property, it is more likely to reduce the search time and the information loss of the frequent patterns. The experimental results show that the proposed algorithm achieves better performance than other algorithms without scarifying the accuracy and increasing the processing time via the centroid of the items. The MapReduce framework model is provided to handle large amounts of data via a pseudo-distributed computing environment. In addition, the modeling of the proposed algorithm is required in the fully distributed mode.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.4
• /
• pp.1211-1216
• /
• 2000

Asynchronous transfer mode (ATM) can be efficiently used to transport packet data services. The switching system will support voice and packet data services simultaneously from end to end applications. To guarantee quality of service (QoS) of the offered services, source rateot send packet data is needed to control the network overload condition. Most existing control algorithms are shown to provide the threshold-based feedback control technique. However, real-time voice calls can be dynamically connected and released during data services in the network. If the feedback control information delays, quality of the serviced voice can be degraded due to a time delay between source and destination in the high speed link. An adaptive algorithm based on the optimal least mean square error technique is presented for the predictive feedback control technique. The algorithm attempts to predict a future buffer size from weight (slope) adaptation of unknown functions, which are used fro feedback control. Simulation results are presented, which show the effectiveness of the algorithm.

• Journal of Internet Computing and Services
• /
• v.3 no.3
• /
• pp.67-74
• /
• 2002

Asynchronous transfer mode (ATM) can be efficiently used to transport packet data services. The switching system will support voice and packet data services simultaneously from end to end applications. To guarantee quality of service (QoS) of the offered services, source rate to send packet data is needed to control the network overload condition. Most existing control algorithms are shown to provide the threshold-based feedback control technique. However, real-time voice calls can be dynamically connected and released during data services in the network. If the feedback control information delays, quality of the serviced voice can be degraded due to a time delay between source and destination in the high speed link, An adaptive algorithm based on the optimal least mean square error technique is presented for the predictive feedback control technique. The algorithm attempts to predict a future buffer size from weight (slope) adaptation of unknown functions, which are used for feedback control. Simulation results are presented, which show the effectiveness of the algorithm.