• Title/Summary/Keyword: local map

Search Result 897, Processing Time 0.036 seconds

Usability evaluation of the local map structures on a hypertext (하이퍼텍스트상의 Local Map 구조에 대한 사용편의성 평가)

  • Han, Sung-H.;Choi, Pil-Sung
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.21 no.3
    • /
    • pp.397-407
    • /
    • 1995
  • Use of a hypertext is growing as multimedia and hypermedia systems become popular. The major difference between hypertext-based and ordinary user interfaces is navigation. Typically, there are two major navigation problems in a hypertext compared to the ordinary user interface: "Disorientation" and "Cognitive Overload". To reduce or eliminate these problems of the hypertext system, a variety of aiding tools have been proposed. Among them, a local map is a good tool for helping users navigate through screens, especially for a large and complex system. This study examined three major design variables of a local map in a hypertext: breadth, depth, and functionality of a map. A human factors experiment was conducted to investigate the effects of these variables. Based upon the results of the experiment, design guidelines are suggested.

  • PDF

Extraction of Line Segment based on the Orientation Probability in a Grid Map (그리드지도 내에서 방향확률을 이용한 직선선분의 위치평가)

  • 강승균;임종환;강철웅
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2003.06a
    • /
    • pp.176-180
    • /
    • 2003
  • The paper presents an efficient method of extracting line segment in a local map of a robot's surroundings. The local map is composed of 2-D grids that have both the occupancy and orientation probabilities using sonar sensors. To find the shape of an object in a local map from orientation information, the orientations are clustered into several groups according to their values. The line segment is , then, extracted from the clusters based on Hough transform. The proposed technique is illustrated by experiments in an indoor environment.

  • PDF

Profile Management System of Material Piles by Dynamic Range Finding (동적 Range 검출에 의한 원료 Pile 형상 관리 시스템)

  • 안현식
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2000.08a
    • /
    • pp.333-336
    • /
    • 2000
  • In this paper, a profile management system consisting of global and local range finders is presented for the automat ion of material pile handling. A global range finder detects range data of the front part of the piles of material and a profile map is obtained from a 3D profile detection algorithm. A local range finder attached on the side of the arm of the reclaimer detects range data with the handling function dynamically, and a local profile patch is acquired from the range data A yard profile map manager constructs a map by using the 3D profile of the global range finder and revises the map by replacing it with the local profile patch obtained Iron the local range finder. The developed vision system was applied to a simulator and the results of test show that it is appropriate to use for automating the material handling.

  • PDF

Localization of Mobile Robot Using Active Omni-directional Ranging System (능동 전방향 거리 측정 시스템을 이용한 이동로봇의 위치 추정)

  • Ryu, Ji-Hyung;Kim, Jin-Won;Yi, Soo-Yeong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.14 no.5
    • /
    • pp.483-488
    • /
    • 2008
  • An active omni-directional raging system using an omni-directional vision with structured light has many advantages compared to the conventional ranging systems: robustness against external illumination noise because of the laser structured light and computational efficiency because of one shot image containing $360^{\circ}$ environment information from the omni-directional vision. The omni-directional range data represents a local distance map at a certain position in the workspace. In this paper, we propose a matching algorithm for the local distance map with the given global map database, thereby to localize a mobile robot in the global workspace. Since the global map database consists of line segments representing edges of environment object in general, the matching algorithm is based on relative position and orientation of line segments in the local map and the global map. The effectiveness of the proposed omni-directional ranging system and the matching are verified through experiments.

Modified Local Color Transfer with Color Category Map (컬러 카테고리 맵을 이용한 수정된 지역적인 색변환)

  • Ha, Ho-Gun;Kyung, Wang-Jun;Kim, Dae-Chul;Ha, Yeong-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.49 no.3
    • /
    • pp.67-73
    • /
    • 2012
  • Local color transfer is the process of assigning a given color to a local region in a target image. The local region that contains the given color has to be segmented. Conventionally, the segmentation of the corresponding local region in a target image is based on the color distance. The region which is the closest in color distance is separated. However, since the close range of color distance separating a given color from target image is ambiguous and uncertain, color distortion is often generated around a separated local region. Therefore, this paper addresses the problem of segmentation in a local color transfer. To prevent color distortion, a modified color influence map is proposed with color categories. First, the target image is roughly segmented using a color category map, which groups similar colors in color space. It restricts the color transfer to a specific color category according to a given color. Second, modified color influence map assigning different weight to lightness and chroma, respectively, is used instead of Euclidian color distance. Then, by combining a modified color influence map and color category map filtered with anisotropic diffusion, a local region that contains a given color can be segmented more strictly than conventional method.

Global Topological Map Building Using Local Grid Maps

  • Park, Chang-Hyuk;Song, Jae-Bok;Woojin Chung;Kim, Munsang
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2002.10a
    • /
    • pp.38.3-38
    • /
    • 2002
  • $\textbullet$ The topological map using a thinning needs much simpler computation than that using a Voronoi. $\textbullet$ A thinning can provide much information on the environment (additional nodes). $\textbullet$ Each node created in a local map is considered as temporary and redundant nodes are discarded. $\textbullet$ A global topological map can be built fast and correctly through a thinning algorithm. $\textbullet$ Path planning can be easily achieved with a topological map.

  • PDF

Modified $A^*$ - Local Path Planning Method using Directional Velocity Grid Map for Unmanned Ground Vehicle (Modified $A^*$ - 방향별 속도지도를 활용한 무인차량의 지역경로계획)

  • Lee, Young-Il;Lee, Ho-Joo;Park, Yong-Woon
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.14 no.3
    • /
    • pp.327-334
    • /
    • 2011
  • It is necessary that UGV(Unmanned Ground Vehicle) should generate a real-time travesability index map by analyzing raw terrain information to travel autonomously tough terrain which has various slope and roughness values. In this paper, we propose a local path planning method, $MA^*$(Modified $A^*$) algorithm, using DVGM (Directional Velocity Grid Map) for unmanned ground vehicle. We also present a path optimization algorithm and a path smoothing algorithm which regenerate a pre-planned local path by $MA^*$ algorithm into the reasonable local path considering the mobility of UGV. Field test is conducted with UGV in order to verify the performance of local path planning method using DVGM. The local path planned by $MA^*$ is compared with the result of $A^*$ to verify the safety and optimality of proposed algorithm.

An Efficient Local Map Building Scheme based on Data Fusion via V2V Communications

  • Yoo, Seung-Ho;Choi, Yoon-Ho;Seo, Seung-Woo
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.2 no.2
    • /
    • pp.45-56
    • /
    • 2013
  • The precise identification of vehicle positions, known as the vehicle localization problem, is an important requirement for building intelligent vehicle ad-hoc networks (VANETs). To solve this problem, two categories of solutions are proposed: stand-alone and data fusion approaches. Compared to stand-alone approaches, which use single information including the global positioning system (GPS) and sensor-based navigation systems with differential corrections, data fusion approaches analyze the position information of several vehicles from GPS and sensor-based navigation systems, etc. Therefore, data fusion approaches show high accuracy. With the position information on a set of vehicles in the preprocessing stage, data fusion approaches is used to estimate the precise vehicular location in the local map building stage. This paper proposes an efficient local map building scheme, which increases the accuracy of the estimated vehicle positions via V2V communications. Even under the low ratio of vehicles with communication modules on the road, the proposed local map building scheme showed high accuracy when estimating the vehicle positions. From the experimental results based on the parameters of the practical vehicular environments, the accuracy of the proposed localization system approached the single lane-level.

  • PDF

Metaphor and Cognitive Map: Analysis on the image of local government (메타포(metaphor)와 인지지도 분석: 지방정부에 대한 이미지를 중심으로)

  • Kim, Dong-Hwan
    • Korean System Dynamics Review
    • /
    • v.12 no.3
    • /
    • pp.5-23
    • /
    • 2011
  • Studies in social science are performed on the language of social actors. While a metaphor analysis focuses on the meaning of the language, a cognitive map analysis deals with its external relationships. If we can put together both analyses, it will be possible to investigate the internal meanings and external relationship of the language and image at the same time. In this paper, metaphor analysis and cognitive map approach is applied to find the image of local governments. This study shows how to link metaphor analysis to the cognitive map and the benefit of using both approaches together.

  • PDF

Conformational Analysis and Molecular Dynamics Simulation of Lactose

  • 오재택;김양미;원영도
    • Bulletin of the Korean Chemical Society
    • /
    • v.16 no.12
    • /
    • pp.1153-1162
    • /
    • 1995
  • The conformational details of β-lactose are investigated through molecular dynamics simulations in conjunction with the adiabatic potential energy map. The adiabatic energy map generated in vacuo contains five local minima. The lowest energy structure on the map does not correspond to the structure determined experimentally by NMR and the X-ray crystallography. When aqueous solvent effect is incorporated into the energy map calculation by increasing the dielectric constant, one of the local minima in the vacuum energy map becomes the global minimum in the resultant energy map. The lowest energy structure of the energy map generated in aquo is consistent with the one experimentally determined. Molecular dynamics simulations starting from those fivelocal minima on the vacuum energy map reveal that conformational transitions can take place among various conformations. Molecular dynamics simulations of the lactose and ricin B chain complex system in a stochastic boundary indicate that the most stable conformation in solution phase is bound to the binding site and that there are conformational changes in the exocyclic region of the lactose molecule upon binding.