Wonpil Yu

Wonpil Yu

Auto-generated profile, based on publicly available information

Wonpil Yu

Robot and Cognitive Convergence Research Dept., ETRI, Republic of Korea

Research Focus & Metrics

Academic Career Length

28Years (1999-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 April 2009 in IEEE Transactions on Automation Science and Engineering
Verified
Journal Article
Closed access
HAHyo-Sung Ahn
Hyo-Sung Ahn
WYWonpil Yu
Wonpil Yu
This paper addresses a novel method for localizing a stationary object in an indoor office environment. The proposed method utilizes the received-signal-strength index (RSSI) of radio signals radiating from fixed reference nodes and reference tags placed at known positions to generate a precise signal propagation model. Signal attenuation parameters are updated online according to environmental variation; thus, the proposed method has environmental-adaptation capabilities. Subsequent experiments were conducted to demonstrate the superiority of the proposed technique over a commercial location-based service (LBS) chipset.

1 October 2009
Verified
Conference Paper
Closed access
JJJi Hoon Joung
Ji Hoon Joung
KAKwang Ho An
Kwang Ho An
JKJung Won Kang
Jung Won Kang
MCMyung Jin Chung
Myung Jin Chung
WYWonpil Yu
Wonpil Yu
In this paper, we propose a system which reconstructs the environment with both color and 3D information. We perform extrinsic calibration of a camera and a LRF (laser range finder) to fuse 3D information and color information of objects. We also formularize an equation to measure the result of the calibration. Moreover, we acquire 3D data by rotating 2D LRF with camera, and use ICP (iterative closest point) algorithm to combine data acquired in other places. We use the SIFT (scale invariant feature transform) matching for the initial estimation of ICP algorithm. It offers accurate and stable initial estimation robust to motion change compare to odometry. We also modify the ICP algorithm using color information. Computation time of ICP algorithm can be reduced by using color information.

1 December 2011
Verified
Conference Paper
Closed access
JLJae-Yeong Lee
Jae-Yeong Lee
WYWonpil Yu
Wonpil Yu
Histogram-based mean-shift is an efficient tool for visual object tracking. However, it often fails to locate a target object correctly in complex environment especially when the background contains similar colors with the object. In this paper, we present a novel visual tracking method that combines advantages of real-time performance of the mean-shift and exact localization of template matching and is robust to background changes, partial occlusions, and pose changes. The proposed method uses a partition-based object model represented by multiple patch histograms. The method first estimates the densities of the object pixels by histogram backprojection of each patch histogram, which gives a set of patch-wise density estimates. A target object is then located by pixel-wise evaluation of the maximum likelihood which is computed by the sum of the densities of the object pixels within target candidate. The suggested localization criteria overcomes many problems of the conventional mean-shift and gives significant improvement of tracking performance. The proposed tracker is very fast and the tracking accuracy is comparable to recent state-of-the-art trackers. The experiment on extensive challenging video sequences confirms the efficiency of our method.

1 November 2012
Verified
Conference Paper
Closed access
SCSunglok Choi
Sunglok Choi
JPJaehyun Park
Jaehyun Park
ELEulgyoon Lim
Eulgyoon Lim
WYWonpil Yu
Wonpil Yu
This paper introduce about graph-search based global path planning on uneven elevation maps. An elevation map is an efficient and popular representation for 3-D terrains due to its easy manipulation by a computer. On the elevation map, we investigate three different optimal paths in the aspects of travel distance, travel time, and energy consumption. A distance/time-optimal path is derived by simple extension of A* on 2-D grid maps. A formulation on energy consumption leads an energy-optimal version and traversiblity criteria. We demonstrate effectiveness of our proposed method by experiments on randomly generated Gaussian hills.

1 May 2011
Verified
Conference Paper
Closed access
SCSunglok Choi
Sunglok Choi
WYWonpil Yu
Wonpil Yu
A* on grid maps generates a path with zig-zag pattern, but Theta* is known to be free from this disadvantage. Theta* assumes that cost of each cell, cell-cost, is uniform, but non-uniform costs are effective ways to represent traversability on grid maps. Theta* does not work on non-uniform costmaps. In this paper, we generalize Theta* toward non-uniform costmaps. To extend Theta*, we propose two kinds of cost functions considering non-uniform cell-costs. The first function adopts the arithmetic mean under the assumption that all cells contribute equally to the overall cost. The second function uses the weighted mean by considering the true traversal length on each cell. We applied the proposed methods to two types of maps: synthetic and real maps. An experiment on synthetic maps quantifies performance of the two methods in terms of accuracy and computing time. The other experiment on real maps presents the effectiveness of Theta* with the proposed methods. The generalized Theta* generated the least-cost path compared with the original Theta* and A* on non-uniform costmaps.

1 October 2009
Verified
Conference Paper
Closed access
SCSunglok Choi
Sunglok Choi
TKTaemin Kim
Taemin Kim
WYWonpil Yu
Wonpil Yu
The core step of video stabilization is to estimate global motion from locally extracted motion clues. Outlier motion clues are generated from moving objects in image sequence, which cause incorrect global motion estimates. Random sample consensus (RANSAC) is popularly used to solve such outlier problem. RANSAC needs to tune parameters with respect to the given motion clues, so it sometimes fail when outlier clues are increased than before. Adaptive RANSAC is proposed to solve this problem, which is based on maximum likelihood sample consensus (MLESAC). It estimates the ratio of outliers through expectation maximization (EM), which entails the necessary number of iteration for each frame. The adaptation sustains high accuracy in varying ratio of outliers and faster than RANSAC when fewer iteration is enough. Performance of adaptive RANSAC is verified in experiments using four images sequences.