• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.6
• /
• pp.492-497
• /
• 2002

Map building is the process of modeling the robot's environment. The map is usually built based on a grid-based or topological approach, which has its own merits and demerits. These two methods, therefore, can be integrated to provide a better way of map building, which compensates for each other's drawbacks. In this paper, a method of building the topological map based on the occupancy grid map through a Voronoi diagram is presented and verified by various simulations. This Voronoi diagram is made by using a labeled Voronoi diagram scheme which is suitable for the occupancy grid maps. It is shown that the Proposed method is efficient and simple fur building a topological map. The simple path-planning problem is simulated and experimented verify validity of the proposed approach.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2C
• /
• pp.117-122
• /
• 2006

In this paper, we present a simple and general soft bit decision expression for a Gray coded PAM signal over additive white Gaussian noise(AWGN) channel with the log likelihood ratio(LLR). In order to reduce the complexity of the LLR calculation, we make the bitwise LLR expression simple by replacing the mathematical max functions of the conventional Max-Log-MAP expression with simple arithmetic functions associated with some deterministic parameters, such as a received value and distance between symbols on a signal space. Taking the implementation issues, like the area of silicon, the power consumption, the timing latency, and so on, into consideration, we submit that the proposed method is a promising alternative way to conventional methods for reconfigurable systems.

• Journal of Plant Biotechnology
• /
• v.4 no.2
• /
• pp.45-52
• /
• 2002

A lot of SSRs (simple sequence repeats) in peach and pear from enriched genomic libraries and in peach from a cDNA library were developed. These SSRs were applied to other related species, giving phenograms of 52 Prunes and 60 pear accessions. Apple SSRs could also be successfully used in Pyrus spp. Thirteen morphological traits were characterized on the basis of the linkage map obtained from an $F_2$ population of peach. This map was compiled with those morphological markers and 83 DNA markers, including SSR markers used as anchor loci, to compare different peach maps. Molecular markers tightly linked to new root-knot nematode resistance genes were also found. A linkage map including disease related genes, pear scab resistance and black spot susceptibility, in the Japanese pear Kinchaku were constructed using 118 RAPD markers. Another linkage map, of the European pear Bartlett, was also constructed with 226 markers, including 49 SSRs from pear, apple, peach and cherry. Maps of other Japanese pear cultivars, i.e., Kousui and Housui, were also constructed. These maps were the first results of pear species.

• Korean Journal of Computational Design and Engineering
• /
• v.19 no.2
• /
• pp.111-118
• /
• 2014

In tangible augmented reality (AR) environments, the user interacts with virtual objects by manipulating their physical counterparts, but he or she often encounters awkward situations in which his or her hands are occluded by the augmented virtual objects, which causes great difficulty in figuring out hand positions, and reduces both immersion and ease of interaction. To solve the problem of such hand occlusion, skin color information has been usefully exploited. In this paper, we propose an approach to simple and effective construction of a skin color map which is suitable for hand segmentation and tangible AR interaction. The basic idea used herein is to obtain hand images used in a target AR environment by simple image subtraction and to represent their color information by a convex polygonal map in the YCbCr color space. We experimentally found that the convex polygonal map is more accurate in representing skin color than a conventional rectangular map. After implementing a solution for resolving hand occlusion using the proposed skin color map construction, we showed its usefulness by applying it to virtual design evaluation of digital handheld products in a tangible AR environment.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.11
• /
• pp.180-188
• /
• 1998

Z-map is a special form of discrete nonparametric representation in which the height values at grid points on the xy-plane are stored as a 2D array z[i.j]. While z-map is the simplest form of representing sculptured surfaces and it is the most versatile scheme for modeling nonparametric objects, its practical application in industry (eg, tool-path generation) aroused much controversy over its weaknesses ; accuracy, singularity (eg, vertical wall), and some excessive storage needs. Although z-map has such limitations, much research on the application of z-map can be found in various articles. However, research on the systematic analysis of sculptured surface shape representation via z-map model is rather rare. Presented in this paper are the following: shape modeling power of the simple z-map model, exact (within tolerance) B-map representation of sculptured surfaces which have some feature-shapes such as vertical-walls and real sharp-edges by adopting some complementary B-map models, and some application examples.

• International Journal of Precision Engineering and Manufacturing
• /
• v.3 no.1
• /
• pp.49-56
• /
• 2002

The Z-map is a special farm of discrete non-parametric representation in which the height values at grid points on the xy-plane are stored as a 2D array z[ij]. While the z-map is the simplest farm of representing sculptured surfaces and is the most versatile scheme for modeling non-parametric objects, its practical application in industry (eg, tool-path generation) has aroused much controversy over its weaknesses, namely its inaccuracy, singularity (eg, vertical wall), and some excessive storage needs. Much research or the application of the z-map can be found in various articles, however, research on the systematic analysis of sculptured surface shape representation via the z-map model is rather rare. Presented in this paper are the following: shape modeling power of the simple z-map model, exact (within tolerance) z-map representation of sculptured surfaces which have some feature-shapes such as vertical-walls and real sharp-edges by adopting some complementary z-map models, and some application examples.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2003.10a
• /
• pp.49-54
• /
• 2003

As of date, the cadastral information which is the utility to be computerized have not been identical with local autonomous entities and relational groups each other and updated real-time, therefore the relation group or the academic circles carried out in many researches on a cadastral map matching, but the cadastral maps have not been even occurred the expansion and contraction so that the theory arrangement doesn't seem simple as to a cadastral map matching. As being take such reality into consideration, We have to be based on $\boxDr$construction ministry of the rules for continuous map$\boxUl$ for a continuous cadastral map with using PBLIS data; so the operators use Autodesk Map 5 which added applications and match the neat line by the identical scale, the different scale, the district boundary and the origin according to the judgement myself We have the purpose to minimize the problem as analyzing the accuracy between the parcel coordinates If the matched map and ones of moved map.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.533-536
• /
• 2005

MAP algorithm is known for optimal decoding algorithm of Turbo codes, but it has very large computational complexity and delay. Generally log-MAP algorithm is used in order to overcome the defect. In this paper we propose modified scheme of the state metric calculation block which can improve the computation speed in log-MAP decoder and simple linear offset unit without using LUT. The simulation results show that the operation speed of the proposed scheme is improved as compared with that of the past scheme.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.11 no.3
• /
• pp.29-36
• /
• 2007

Let T be an ergodic measure preserving transformation on (X, B, ${\mu}$). It is called 2-simple if every 2-fold ergodic joining is either a product measure or an off-diagonal measure. In general, factors of simple maps are not simple. So far, there has been no characterization of the factor of simple maps. In this paper, we give a joining characterization of factors of simple maps.

• Journal of Multimedia Information System
• /
• v.8 no.2
• /
• pp.131-142
• /
• 2021

This paper traces the process of constructing a new one-dimensional chaotic map, and will provide a simple application in color image encryption. The use of Sarkovskii's theorem will make it possible to determine the existence of chaos and restrict all conditions to ensure the existence of this new sequence. In addition, the sensitivity to initial conditions will be proved by Lyapunov's index value. Similarly, the performance of this new chaotic map will be illustrated graphically and compared with other chaotic maps most commonly used in cryptography. Finally, a humble color image encryption application will show the power of this new chaotic map.