• 제어로봇시스템학회논문지
• /
• 제8권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.

• 한국통신학회논문지
• /
• 제31권2C호
• /
• pp.117-122
• /
• 2006

본 논문에서는 로그 최우비(log likelihood ratio, LLR)를 이용하여 Gray 부호화된 PAM신호를 위한 비트 연판정 계산식을 제안한다. 이 계산식은 Gray 매핑 특성을 이용하여 Max-Log-MAP 알고리듬에서 필요한 max0/min0 함수를 사용하지 않고 산술 연산만을 사용하기 때문에 구현이 간단하다. 제안된 식의 결과는 기존 Max-Log-MAP 알고리듬의 결과와 일치한다. 또한, 식에 사용되는 인자들은 송수신 시스템이 서로 공유하는 정보와 수신된 심벌 값만을 이용하여 계산한다. 따라서 본 논문에서 제안된 알고리듬은 일반적으로 많이 사용하는 이진 반복 복호기 등과 함께 실제 응용 설계에 적용이 가능하며, 특히 실제 설계에 적용되는 기존의 여러 가지 알고리듬에 비하여 구조가 유연하고 효율적이며 정확한 비트별 LLR을 제공하는 효율적인 방법 중의 하나이다.

• Journal of Plant Biotechnology
• /
• 제4권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.

• 한국CDE학회논문집
• /
• 제19권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.

• 한국정밀공학회지
• /
• 제15권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
• /
• 제3권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.

• 한국측량학회:학술대회논문집
• /
• 한국측량학회 2003년도 추계학술발표회 논문집
• /
• 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.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2005년도 춘계종합학술대회
• /
• pp.533-536
• /
• 2005

MAP 알고리즘은 터보코드의 최적 복호알고리즘으로 알려져 있지만, 연산의 복잡도가 매우 크다. 이러한 MAP 방식의 단점을 개선하기 위하여 일반적으로 log-MAP 알고리즘을 이용하게 된다. 본 논문에서는 log-MAP 복호기에서 비교적 연산량이 크고 동작속도에 큰 영향을 미치는 상태 메트릭 계산 블록의 연산 속도를 향상시킨 개선된 구조를 제안하고, LUT(Lookup Table)을 이용하지 않고 간단한 연산에 의해 보상하는 linear 보상기를 제안하여 동작속도를 개선하였다.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제11권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
• /
• 제8권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.