• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.4
• /
• pp.93-100
• /
• 2021

The Ethereum shard system for solving the scalability problem of the blockchain has a load balancing issue, which is modeled as a graph partitioning problem. In this paper, we propose an adaptive online weighted graph partitioning algorithm that can negotiate between two utility of the shard system using the game theory's bargaining solution. The bargaining solution is an axiomatic solution that can fairly determine the points of conflict of utility. The proposed algorithm was improved to apply the existing online graph partitioning algorithm to the weighted graph, and load balancing was performed efficiently through the design considering the situation of the sharding system using the extension of Nash bargaining solution, which is extended to apply solution to non-convex feasible set of bargaining problem. As a result of the experiment, it showed up to 37% better performance than typical load balancing algorithm of shard system.

• Proceedings of the KIEE Conference
• /
• 2006.07d
• /
• pp.1864-1865
• /
• 2006

무인지능형로봇 시스템에 있어서 자세의 정확도를 향상시키기 위한 많은 연구가 이루어져 왔다. 시스템의 자세 제어는 사용되는 모터의 위치 제어로 대응된다. 이와 같은 시스템은 운용 시에 충격 진동이 발생하게 된다. 이러한 충격 진동 외란을 잘 제거해야 요구되는 위치 정도로 제어를 수행할 수 있다. 로봇 제어 분야에서 불확실한 로봇에 대한 자세 제어 분야는 가장 기본적이면서 중요한 분야중의 하나이다. 이러한 문제를 다루기 위하여 계산 토크 방식에 기초한 선형 제어 기법이나 적응 제어 기법, 강인 제어 기법 등을 이용한 연구 결과들이 발표되고 있다. 그러나 그러한 기법은 일반적으로 로봇의 정확한 동력학식을 알아야 하며, 구현하기 복잡하다. 따라서 본 논문에서는 적응 규칙에 의하여 모델의 불확실성, 시스템의 변화, 외란으로 인해 발생하는 공칭 플랜트와의 오차를 보상하도록 제어 입력을 생성하는 내부 루프 부분과 공칭 플랜트 모델의 명령을 추종하도록 하는 제어 입력을 생성하는 외부 루프 부분으로 구성되는 방법인 외란관측기(Disturbance OBserver : DOB) 제어 알고리즘을 제안한다. 또한 프로세서의 신뢰성과 수치 연산 및 알고리즘의 빠른 처리를 위해 현재 사용 빈도가 높은 TI사의 DSP시리즈 중에서 부동 소수점 연산 기능을 가지면서 모터 제어에 적합한 TMS320C2000계열의 TMS320F2812을 사용하여, 운용 시 발생되는 진동 둥에 대한 외란 제거를 목적으로 한다. 본 논문은 규명된 시스템 모델식을 바탕으로 DOB 제어 시뮬레이션을 수행하고 PMSM 모터모델 시뮬링크 블록을 구성하여 검증된 외란 관측기 제어 알고리즘을 검증한다. 시뮬레이션으로 검증된 DOB 모터 자세 제어 알고리즘을 DSP에 적용하기 위해 코드변환하고 모터 실험 시스템에 실제 적용함으로써 타당성을 검증하여 상용 제어기로 실제 현장에 적용 가능함을 입증한다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.1 s.307
• /
• pp.75-84
• /
• 2006

With considering center-biased characteristic, NTSS(New Three-Step Search Algorithm) can improve the performance of TSS(Three-Step Search Algorithm) which is one of the most popular fast block matching algorithms(BMA) to search a motion vector in a video sequence. Although NTSS has generally better Quality than TSS for a small motion sequence, it is hard to say that NTSS can provide better quality than TSS for a large motion sequence. It even deteriorates the quality to increase a search window size using NTSS. In order to address this drawback, this paper aims to develop a new adaptive window size-based three step search scheme, called AWTSS, which can improve quality at various window sizes in both the small and the large motion video sequences. In this scheme, the search window size is dynamically changed to improve coding efficiency according to the characteristic of motion vectors. AWTSS can improve the video quality more than 0.5dB in case of large motion with keeping the same quality in case of small motion.

• Journal of Broadcast Engineering
• /
• v.18 no.2
• /
• pp.167-177
• /
• 2013

In this paper, a motion adaptive deinterlacing algorithm is proposed. It consists of three parts: (1) modified edge-based line average, (2) pixel-based consequent five-field motion detection, and (3) block-based local characteristic for detecting true motion and calculating the motion intensity by using an improved method which is able to detect the inner part of moving objects precisely as well as to reduce the risk of false detection caused by intrinsic noises in the image. Depending on the detected motion activity level, it combines spatial and temporal methods with weighting factor. Simulations conducted on several video sequences indicate that the performance of the proposed method is superior to the conventional methods in terms of both subjective and objective video quality.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.7
• /
• pp.1672-1686
• /
• 2013

In this paper, we propose a hybrid super-resolution algorithm robust to cut-change. Existing single-frame based super-resolution algorithms are usually fast, but quantity of information for interpolation is limited. Although the existing multi-frame based super-resolution algorithms generally robust to this problem, the performance of algorithm strongly depends on motions of input video. Furthemore at boundary of cut, applying of the algorithm is limited. In the proposed method, we detect a define boundary of cut using cut-detection algorithm. Then we adaptively apply a single-frame based super-resolution method to detected cut. Additionally, we propose algorithms of normalizing motion vector and analyzing pattern of edge to solve various problems of existing super-resolution algorithms. The experimental results show that the proposed algorithm has better performance than other conventional interpolation methods.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.6
• /
• pp.62-69
• /
• 2015

In this paper, a new frame rate up conversion (FRUC) algorithm using adaptive motion estimation (AME-FRUC) is proposed. The proposed algorithm performs extended bilateral motion estimation (EBME) conducts motion estimation (ME) processes on the static region, and extract region of interest with the motion vector (MV). In the region of interest block, the proposed AME-FRUC uses the texture block partitioning scheme and the unilateral motion estimation for improving ME accuracy. Finally, motion compensated frame interpolation (MCFI) are adopted to interpolate the intermediate frame in which MCFI is employed adaptively based on ME scheme. Experimental results show that the proposed algorithm improves the PSNR up to 3dB, the SSIM up to 0.07 and 68% lower SAD calculations compared to the EBME and the conventional FRUC algorithms.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.5
• /
• pp.39-47
• /
• 2007

In this thesis, a method of generating an adaptable Region-Of-Interest(ROI) Mask for the Region-Of-Interest coding is suggested. In the method, an ROI Mask is generated using the information of the ROI designated by a user. In the existed method of ROI coding, after scanning all the pixels in order and discriminating an ROI, an ROI Mask is generated. But, in our method, after scanning a part of pixels based on the shape pattern of an ROI and discriminating a ROI by one code block unit, an ROI Mask is generated. Moreover, from the method, a pattern number, threshold of a ROI and background threshold parameter are provided. According to the result of its comparing test with the existed methods to show the usability, it is proved that our method is superior in speed to the existed ones.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.5
• /
• pp.37-43
• /
• 2009

Streaming video service over wireless and mobile communication networks has received significant interests from both academia and industry recently. Specifically, mobile WiMAX (IEEE 802.16e) is capable of providing high data rate and flexible Quality of Service (QoS) mechanisms, supporting mobile streaming very attractive. However, we need to note that streaming videos can be partially deteriorated in their macroblocks and/or slices owing to errors on OFDMA subcarriers, as we consider that compressed video sequence is generally sensitive to the error-prone channel status of the wireless and mobile network. In this paper, we introduce an OFDMA subcarrier-adaptive mobile streaming server based on cross-layer design. This streaming server system is substantially efficient to reduce the deterioration of streaming video transferred on the subcarriers of low power strength without any modifications of the existing schedulers, packet ordering/reassembly, and subcarrier allocation strategies in the base station.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9A
• /
• pp.1395-1404
• /
• 2000

In this paper, we propose a heuristic wavelength routing algorithm for IP datagrams in WDM (Wavelength-Division Multiplexing) networks which operates in a distributed manner, while most previous works have focused centralized algorithms. We first present an efficient construction method for a loose virtual topology with a connectivity property, which reserves a few wavelength to cope with dynamic traffic demands properly. This connectivity property assures that data from any source node could reach any destination node by hopping one or multiple lightpaths. We then develop a high-speed distributed wavelength routing algorithm adaptive to dynamic traffic demands by using such a loose virtual topology and derive the general bounds on average utilization in the distributed wavelength routing algorithms. Finally, we show that the performance of the proposed algorithms is better than that of the FSP(Fixed Shortest-Path) wavelength routing algorithms through simulation using the NSFNET[1] and a dynamic hot-spot traffic model, and that the algorithms is a good candidate in distributed WDM networks in terms of the blocking performance, the control traffic overhead, and the computation complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6A
• /
• pp.547-554
• /
• 2010

Recently, the multi-band orthogonal frequency division multiplexing(MB-OFDM) system, one of UWB system, can satisfy the requirement and can be applied to various wireless communication services because ultra-wideband(UWB) is a wireless communication technique that supports high data rate with low power. In this paper, the method applying Alamouti's space time block code(STBC) and cyclic delay diversity(CDD) is proposed. The proposed method can be easily applied with arbitrary number of relays and only needs two time slots of quasi stationary assumption. And it is applied to the MB-OFDM system. Second, an optimal relaying scheme based on decode-and-forward(DF) method is proposed which is provides good error performance compared to conventional schemes.