• Title/Summary/Keyword: 플로어 마크

Search Result 3, Processing Time 0.016 seconds

Indoor Precise Positioning Technology for Vehicles Using Floor Marks (플로어 마크를 이용한 차량용 실내 정밀 측위 기술)

  • Park, Ji-hoon;Lee, Jaesung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.10
    • /
    • pp.2321-2330
    • /
    • 2015
  • A variety of studies for indoor positioning are now being in progress due to the limit of GPS that becomes obsolete in the room. However, most of them are based on private wireless networks and the situation is difficult to commercialize them since they are expensive in terms of installation and maintenance costs, non-real-time, and not accurate. This paper applies the mark recognition algorithm used in existing augmented reality applications to the indoor vehicle positioning application. It installs floor marks on the ground, performs the perspective transformation on it and decodes the internal data of the mark and, as a result, it obtains an absolute coordinate. Through the geometric analysis, it obtains current position (relative coordinates) of a vehicle away from the mark and the heading direction of the vehicle. The experiment results show that when installing the marks every 5 meter, an error under about 30 cm occurred. In addition, it is also shown that the mark recognition rate is 43.2% of 20 frames per second at the vehicle speed of 20km/h. Thus, it is thought that this idea is commercially valuable.

Improved Floorplan Algorithm using O-tree Representation (O-tree 표현법을 이용한 개선된 플로어플랜 알고리즘)

  • Park, Jae-Min;Hur, Sung-Woo
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.06b
    • /
    • pp.482-486
    • /
    • 2007
  • 본 논문은 기존의 O-tree 표현법을 이용한 플로어플랜 알고리즘의 결점을 보완한 새로운 알고리즘을 제안한다. 기존의 방법에선 플로어플랜의 변형을 처리하는 과정에서 몇 가지 변형을 간과하기 때문에 좋은 해를 놓치는 경우가 발생한다. 본 논문에서는 기존의 방법을 수정하여 변형을 처리하는 과정에서 블록이 들어갈 수 있는 모든 위치를 고려하였다. 그 결과 MCNC 밴치마크 회로를 이용한 실험에서 총면적이 이전의 방법에 비해 평균 3% 개선되었다.

  • PDF

Improved Simulated-Annealing Technique for Sequence-Pair based Floorplan (Sequence-Pair 기반의 플로어플랜을 위한 개선된 Simulated-Annealing 기법)

  • Sung, Young-Tae;Hur, Sung-Woo
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.46 no.4
    • /
    • pp.28-36
    • /
    • 2009
  • Sequence-Pair(SP) model represents the topological relation between modules. In general, SP model based floorplanners search solutions using Simulated-Annealing(SA) algorithm. Several SA based floorplanning techniques using SP model have been published. To improve the performance of those techniques they tried to improve the speed for evaluation function for SP model, to find better scheduling methods and perturb functions for SA. In this paper we propose a two phase SA based algorithm. In the first phase, white space between modules is reduced by applying compaction technique to the floorplan obtained by an SP. From the compacted floorplan, the corresponding SP is determined. Solution space has been searched by changing the SP in the SA framework. When solutions converge to some threshold value, the first phase of the SA based search stops. Then using the typical SA based algorithm, ie, without using the compaction technique, the second phase of our algorithm continues to find optimal solutions. Experimental results with MCNC benchmark circuits show that how the proposed technique affects to the procedure for SA based floorplainning algorithm and that the results obtained by our technique is better than those obtained by existing SA-based algorithms.