• Title/Summary/Keyword: Difference Map

Search Result 812, Processing Time 0.025 seconds

Utilizing Usability Metrics to Evaluate a Subway Map Design

  • Jung, Kwang Tae
    • Journal of the Ergonomics Society of Korea
    • /
    • v.36 no.4
    • /
    • pp.343-353
    • /
    • 2017
  • Objective: This study aims to evaluate the efficiency of two representative subway map design types, namely a diagram type and a geographical type using physiological metrics, performance metrics, and self-reported metrics, which are representative usability metrics. Background: Subway maps need to be designed in order for users to quickly search and recognize subway line information. Although most cities' subway maps currently use the diagram type designed by Henry Beck, New York City's subway map has recently been changed to the subway map type combined with the geographical type designed by Michael Hertz. However, not many studies on its efficiency are found, and the studies that are available mainly depend on questionnaire surveys or take on a subjective behavioral study type based on experts' experiences. In this regard, evaluation through a more objective method is needed. Method: This study employed usability metrics as a method to evaluate the efficiency of information search targeting the diagram type and geographical type subway maps used mostly as subway maps. To this end, physiological metrics obtained through eye tracking, task completion time, representative metric of task performance, and subjective evaluation metrics were used for the suitability evaluation of subway map designs. Results: In the result of gaze movement distance analysis, no significant difference was shown in the two design types in terms of a process finding a departure station from the starting point and a process finding a transfer station between the departure station and arrival station (destination). However, the gaze movement distance in the process finding the arrival station at the departure station was significantly shorter in the geographical type, rather than in the diagram type. The analysis of task completion time showed a result similar to the gaze movement distance analysis result. Task completion time was significantly shorter in the geographical type, rather than in the diagram type, which is in the process finding the arrival station at the departure station. In other information search processes, no significant difference was shown. As a result of subjective evaluation metrics analysis, no significant difference was revealed in the two design types. Conclusion: An analysis on the two representative subway map design types was carried out via the adoption of usability metrics. As a result, although no significant difference was shown in some information search processes, it was revealed that information search was easier in the geographical type overall. Also, it was found that usability metrics can be effectively used to evaluate the design types of subway maps. Application: The study results can be used to set design direction to offer ease in information search on subway lines. The study also can be used as a method to evaluate a subway map's design type.

New reversible data hiding algorithm based on difference expansion method

  • Kim, Hyoung-Joong;Sachnev, Vasiliy;Kim, Dong-Hoi
    • Journal of Broadcast Engineering
    • /
    • v.12 no.2
    • /
    • pp.112-119
    • /
    • 2007
  • Reversible data embedding theory has marked a new epoch for data hiding and information security. Being reversible, the original data and the embedded data as well should be completely restored. Difference expansion transform is a remarkable breakthrough in reversible data hiding scheme. The difference expansion method achieves high embedding capacity and keeps the distortion low. This paper shows that the difference expansion method with simplified location map, and new expandability and changeability can achieve more embedding capacity while keeping the distortion almost the same as the original expansion method.

DIFFERENCE CORDIALITY OF SOME SNAKE GRAPHS

  • Ponraj, R.;Narayanan, S. Sathish
    • Journal of applied mathematics & informatics
    • /
    • v.32 no.3_4
    • /
    • pp.377-387
    • /
    • 2014
  • Let G be a (p, q) graph. Let f be a map from V (G) to {1, 2, ${\ldots}$, p}. For each edge uv, assign the label ${\mid}f(u)-f(\nu){\mid}$. f is called a difference cordial labeling if f is a one to one map and ${\mid}e_f(0)-e_f(1){\mid}{\leq}1$ where $e_f(1)$ and $e_f(0)$ denote the number of edges labeled with 1 and not labeled with 1 respectively. A graph with admits a difference cordial labeling is called a difference cordial graph. In this paper, we investigate the difference cordial labeling behavior of triangular snake, Quadrilateral snake, double triangular snake, double quadrilateral snake and alternate snakes.

Three-Dimensional Map System Using Integral Imaging Technique (집적 영상 기술을 이용한 3차원 지도 시스템)

  • Cho, Myungjin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.11
    • /
    • pp.2799-2804
    • /
    • 2014
  • In this paper, we suggest three-dimensional information extraction map system using integral imaging technique. Integral imaging can record multiple elemental images with different perspectives using a 2D image acquisition device with lenslet array. Using these images, integral imaging can obtain 3D information and display 3D image. In this paper, the position difference between elemental images can be obtained using summation of absolute difference (SAD), and then 3D information can be extracted. Therefore, this technique can find the height information of 3D objects.

Novel VO and HO Map for Vertical Obstacle Detection in Driving Environment (새로운 VO, HO 지도를 이용한 차량 주행환경의 수직 장애물 추출)

  • Baek, Seung-Hae;Park, Soon-Yong
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.2
    • /
    • pp.163-173
    • /
    • 2013
  • We present a new computer vision technique which can detect unexpected or static vertical objects in road driving environment. We first obtain temporal and spatial difference images in each frame of a stereo video sequence. Using the difference images, we then generate VO and HO maps by improving the conventional V and H disparity maps. From the VO and HO maps, candidate areas of vertical obstacles on the road are detected. Finally, the candidate areas are merged and refined to detect vertical obstacles.

Reduction of GPS Latency Using RTK GPS/GNSS Correction and Map Matching in a Car NavigationSystem

  • Kim, Hyo Joong;Lee, Won Hee;Yu, Ki Yun
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.24 no.2
    • /
    • pp.37-46
    • /
    • 2016
  • The difference between definition time of GPS (Global Positioning System) position data and actual display time of car positions on a map could reduce the accuracy of car positions displayed in PND (Portable Navigation Device)-type CNS (Car Navigation System). Due to the time difference, the position of the car displayed on the map is not its current position, so an improved method to fix these problems is required. It is expected that a method that uses predicted future positionsto compensate for the delay caused by processing and display of the received GPS signals could mitigate these problems. Therefore, in this study an analysis was conducted to correct late processing problems of map positions by mapmatching using a Kalman filter with only GPS position data and a RRF (Road Reduction Filter) technique in a light-weight CNS. The effects on routing services are examined by analyzing differences that are decomposed into along and across the road elements relative to the direction of advancing car. The results indicate that it is possible to improve the positional accuracy in the along-the-road direction of a light-weight CNS device that uses only GPS position data, by applying a Kalman filter and RRF.

Turbo Trellis Coded Modulation with Multiple Symbol Detection (다중심벌 검파를 사용한 터보 트렐리스 부호화 변조)

  • Kim Chong Il
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.1 no.2
    • /
    • pp.105-114
    • /
    • 2000
  • In this paper, we propose a bandwidth-efficient channel coding scheme using the turbo trellis-coded modulation with multiple symbol detection. The turbo code can achieve good bit error rates (BER) at low SNR. That comprises two binary component codes and an interleaver. TCM codes combine modulation and coding by optimizing the euclidean distance between codewords. This can be decoded with the Viterbi or the symbol-by- symbol MAP algorithm. But we present the MAP algorithm with branch metrics of the Euclidean distance of the first phase difference as well as the Lth phase difference. The study shows that the turbo trellis-coded modulation with multiple symbol detection can improve the BER performance at the same SNR.

  • PDF

2D Grid Map Compensation using an ICP Algorithm (ICP 알고리즘을 이용한 2차원 격자지도 보정)

  • Lee, Dong-Ju;Hwang, Yu-Seop;Yun, Yeol-Min;Lee, Jang-Myung
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.20 no.11
    • /
    • pp.1170-1174
    • /
    • 2014
  • This paper suggests using the ICP (Iterative Closet Point) algorithm to compensate a two-dimensional map. ICP algorithm is a typical algorithm method using matching distance data. When building a two-dimensional map, using data through the value of a laser scanner, it occurred warping and distortion of a two-dimensional map because of the difference of distance from the value of the sensor. It uses the ICP algorithm in order to reduce any error of line. It validated the proposed method through experiment involving matching a two-dimensional map based reference data and measured the two-dimensional map.

An Evaluation System to Determine the Completeness of a Space Map Obtained by Visual SLAM (Visual SLAM을 통해 획득한 공간 지도의 완성도 평가 시스템)

  • Kim, Han Sol;Kam, Jae Won;Hwang, Sung Soo
    • Journal of Korea Multimedia Society
    • /
    • v.22 no.4
    • /
    • pp.417-423
    • /
    • 2019
  • This paper presents an evaluation system to determine the completeness of a space map obtained by a visual SLAM(Simultaneous Localization And Mapping) algorithm. The proposed system consists of three parts. First, the proposed system detects the occurrence of loop closing to confirm that users acquired the information from all directions. Thereafter, the acquired map is divided with regular intervals and is verified whether each area has enough map points to successfully estimate users' position. Finally, to check the effectiveness of each map point, the system checks whether the map points are identifiable even at the location where there is a large distance difference from the acquisition position. Experimental results show that space maps whose completeness is proven by the proposed system has higher stability and accuracy in terms of position estimation than other maps that are not proven.

The criterion Decision of Map Generalization for building by Human Vision (휴먼비전에 의한 건물의 지도일반화 기준결정)

  • Park, Kyeong-Sik
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.27 no.1
    • /
    • pp.735-742
    • /
    • 2009
  • National Geographic Institute recently has produced a national paper map by means of a computer aided editing system using a national digital map 2.0. However, the map generalization should be made due to the portrayal difference between the digital map and the paper one and the criterion of the map generalization should be determined by the visual image. The tolerance limit of the map generalization has to be decided based on human vision. For this purpose, this study attempts to measure the size of the building on various scale map and then analyze its result. As a consequence, this study shows us that the building size eligible for human vision should be over 0.4mm in the short side of building on the map. The tolerance limit of an isolated building, a reduced building and a densely built-up area for the map generalization is based on the criterion mentioned above.