• Journal of Institute of Control, Robotics and Systems
• /
• v.21 no.5
• /
• pp.465-470
• /
• 2015

This paper proposes a robust 3D mapping system for a UAV (Unmanned Aerial Vehicle) that carries a LRF (Laser Range Finder) using the sinusoidal trajectory algorithm. In the case of previous 3D mapping research, the UAV usually takes off vertically and flights up and down while the LRF is measuring horizontally. In such cases, the measuring range is limited and it takes a long time to do mapping. By using the sinusoidal trajectory algorithm proposed in this research, the 3D mapping can be time-efficient and the measuring range can be widened. The 3D mapping experiments have been done to evaluate the performance of the sinusoidal trajectory algorithm by scanning indoor walls.

• Proceedings of the IEEK Conference
• /
• 2003.07b
• /
• pp.1169-1172
• /
• 2003

In this paper, a CLB-based CPLD low-power technology mapping algorithm consider area and delay time is proposed. To perform low power technology mapping for CPLD, a given Boolean network have to be represented to DAG. The proposed algorithm are consist of three step. In the first step, TD(Transition Density) calculation have to be performed. In the second step, the feasible clusters are generated by considering the following conditions: the number of output, the number of input and the number of OR-terms for CLB(Common Logic Block) within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. In the final step, low power technology mapping based on the CLBs is packing the feasible clusters into the several proper CLBs. The proposed algorithm is examined by using benchmarks in SIS. In the case of that the number of OR-terms is 5, the experiments results show that reduce the power consumption by 30.73% comparing with that of TEMPLA, and 17.11% comparing with that of PLAmap respectively.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.8
• /
• pp.55-64
• /
• 1999

In this paper, new gamut-mapping algorithm (GMA) that utilizes variable anchor points (center of gravity on the luminance axis) is proposed. The proposed algorithm increases luminance range, which is reduced from conventional gamut mapping toward an anchor point. In this process, this algorithm utilizes multiple anchor points with constant slopes to both reduce a sudden color change on the gamut boundary of the printer and to maintain a uniform color change during the mapping process. Accordingly, the proposed algorithm can reproduce high quality images with low-cost color devices.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.174-177
• /
• 2016

Wireless network-on-chip (WNoC) can alleviate critical path problem of existing typical NoCs by integrating radio-frequency module on router. In this paper, core-connection-aware genetic algorithm-based core and WIR mapping methodology at small world WNoC is presented. The methodology could optimize the critical path between cores with heavy communication. The 33% of average latency improvement is achieved compared to random mapping methodology.

• Journal of Mechanical Science and Technology
• /
• v.18 no.1
• /
• pp.92-105
• /
• 2004

A new algorithm for planning a collision-free path based on algebraic curve is developed and the concept of collision-free Path Space (PS) is introduced. This paper presents a Geometry Mapping (GM) based on two straight curves in which the intermediate connection point is organized in elliptic locus ($\delta$, $\theta$). The GM produces two-dimensional PS that is used to create the shortest collision-free path. The elliptic locus of intermediate connection point has a special property in that the total distance between the focus points through a point on ellipse is the same regardless of the location of the intermediate connection point on the ellipse. Since the radial distance, a, represents the total length of the path, the collision-free path can be found as the GM proceeds from $\delta$=0 (the direct path) to $\delta$=$\delta$$\_$max/(the longest path) resulting in the minimum time search. The GM of elliptic workspace (EWS) requires calculation of interference in circumferential direction only. The procedure for GM includes categorization of obstacles to .educe necessary calculation. A GM based on rectangular workspace (RWS) using Cartesian coordinate is also considered to show yet another possible GM. The transformations of PS among Circular Workspace Geometry Mapping (CWS GM) , Elliptic Workspace Geometry Mapping (EWS GM) , and Rectangular Workspace Geometry Mapping (RWS GM), are also considered. The simulations for the EWS GM on various computer systems are carried out to measure performance of algorithm and the results are presented.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.6
• /
• pp.672-677
• /
• 2016

Development of Internet has been successfully inspired with extensive deployment of the network technology and application. However, increases in Internet usage had caused a lot of traffic overload in these days. Thus, we need a continuous research and development on the network virtualization for effective resource allocation. In this paper, we propose a minimal cost virtual network mapping algorithm using Piecewise Linear Cost Function. We exploited an algorithm with Linear Programming and D-VINE for node mapping, and Shortest Path Algorithm based on linear programming solution is used for link mapping. In this way, we compared and analyzed the average cost for arrival rate of VN request with linear and tree structure. Simulation results show that the average cost of our algorithm shows better efficiency than ViNEyard.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.359-362
• /
• 2003

In PDP(Plasma Display Panel), sub-field method is used to implement gray scale. Each sub-field has different periods. And Every gray level has information of which sub-field has to be displayed. This is called sub-field mapping. There are several sub-field mapping values in some gray levels. So, it is possible to select best choice in this paper, we propose new sub field mapping method using a fuzzy inference system to select best sub-field mapping values in accordance with input image and environment temperature. In order to implement fuzzy system, we used MATLAB fuzzy inference editor.

• Journal of applied mathematics & informatics
• /
• v.27 no.3_4
• /
• pp.693-702
• /
• 2009

In this paper, we introduce and study a system of mixed variational inequalities in Banach spaces. By using J-proximal mapping and its Lipschitz continuity for a nonconvex, lower semicontinuous, subdifferentiable, proper functional, an iterative algorithm for computing the approximate solutions of system of mixed variational inequalities is suggested and analyzed. The convergence criteria of the iterative sequences generated by iterative algorithm is also discussed.

• Journal of Ship and Ocean Technology
• /
• v.9 no.4
• /
• pp.23-34
• /
• 2005

Increased usage of AUVs has led to the development of alternative navigational methods that use the acoustic beacons and dead reckoning. This paper describes a concurrent mapping and localization (CML) scheme that uses range sonars mounted on SNUUV­I, which is a small test AUV developed by Seoul National University. The CML is one of such alternative navigation methods for measuring the environment that the vehicle is passing through. In addition, it is intended to provide relative position of AUV by processing the data from sonar measurements. A technique for CML algorithm which uses several ranging sonars is presented. This technique utilizes an extended Kalman filter to estimate the location of the AUV. In order for the algorithm to work efficiently, the nearest neighbor standard filter is introduced as the algorithm of data association in the CML for associating the stored targets the sonar returns at each time step. The proposed CML algorithm is tested by simulations under various conditions. Experiments in a towing tank for one dimensional navigation are conducted and the results are presented. The results of the simulation and experiment show that the proposed CML algorithm is capable of estimating the position of the vehicle and the object and demonstrates that the algorithm will perform well in the real environment.

• Journal of Biomedical Engineering Research
• /
• v.24 no.4
• /
• pp.275-280
• /
• 2003

The method of simultaneous data acquisition of arteries and veins(SAAV) was suggested to obtain MR angiography of arteries and veins at 0.3T low filed MRI system (Magfinder, AlLab. Korea). Two separated artery- and vein-images were put together using AVCM(Artery-Vein Color Mapping) algorithm and presented in the same image. In this study, artery- and vein-separated angiograms of volunteer's neck were obtained. Two dimensioal blood-enhanced images wre sequentially obtained using SAAV pulse sequence based on time-of-flight(TOF) method with flow compensation. Imaging parameters were TR/TE=70/12msec. FOV=230mm, slice thickness = 3mm, flip angle=90$^{\circ}$, matrix size=256${\times}$256${\times}$64mm. TSat TH/SPA=15/20mm, Ts_v=10msec and Ts_a=40ms. 3D MRA images were reconstructed using the maximum intensity projection(MIP) and the artery-vein color mapping(AVCM) algorithm. This study showed good possibility of clinical applications of MRA in 0.3T which provides valuable diagnostic information of clinical vascular diseases.