• Title/Summary/Keyword: Map to point

Search Result 1,097, Processing Time 0.03 seconds

Edge Map-Based Fingerprint Reference-Point Detection (에지맵 기반 지문 기준점 검출)

  • Song, Young-Chul
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.56 no.7
    • /
    • pp.1321-1323
    • /
    • 2007
  • A new reference point location method based on an edge map is proposed, where an orientation map is defined and used to find the edge map. Experimental results show that the proposed method can effectively detect the core point in poor quality and arch-type fingerprint images and produces better results in terms of the detection rate and accuracy than the sine map-based method.

Map Error Measuring Mechanism Design and Algorithm Robust to Lidar Sparsity (라이다 점군 밀도에 강인한 맵 오차 측정 기구 설계 및 알고리즘)

  • Jung, Sangwoo;Jung, Minwoo;Kim, Ayoung
    • The Journal of Korea Robotics Society
    • /
    • v.16 no.3
    • /
    • pp.189-198
    • /
    • 2021
  • In this paper, we introduce the software/hardware system that can reliably calculate the distance from sensor to the model regardless of point cloud density. As the 3d point cloud map is widely adopted for SLAM and computer vision, the accuracy of point cloud map is of great importance. However, the 3D point cloud map obtained from Lidar may reveal different point cloud density depending on the choice of sensor, measurement distance and the object shape. Currently, when measuring map accuracy, high reflective bands are used to generate specific points in point cloud map where distances are measured manually. This manual process is time and labor consuming being highly affected by Lidar sparsity level. To overcome these problems, this paper presents a hardware design that leverage high intensity point from three planar surface. Furthermore, by calculating distance from sensor to the device, we verified that the automated method is much faster than the manual procedure and robust to sparsity by testing with RGB-D camera and Lidar. As will be shown, the system performance is not limited to indoor environment by progressing the experiment using Lidar sensor at outdoor environment.

WEIERSTRASS SEMIGROUPS OF PAIRS ON H-HYPERELLIPTIC CURVES

  • KANG, EUNJU
    • The Pure and Applied Mathematics
    • /
    • v.22 no.4
    • /
    • pp.403-412
    • /
    • 2015
  • Kato[6] and Torres[9] characterized the Weierstrass semigroup of ramification points on h-hyperelliptic curves. Also they showed the converse results that if the Weierstrass semigroup of a point P on a curve C satisfies certain numerical condition then C can be a double cover of some curve and P is a ramification point of that double covering map. In this paper we expand their results on the Weierstrass semigroup of a ramification point of a double covering map to the Weierstrass semigroup of a pair (P, Q). We characterized the Weierstrass semigroup of a pair (P, Q) which lie on the same fiber of a double covering map to a curve with relatively small genus. Also we proved the converse: if the Weierstrass semigroup of a pair (P, Q) satisfies certain numerical condition then C can be a double cover of some curve and P, Q map to the same point under that double covering map.

Faster MapToPoint over $F_{3^m}$ for Pairing-based Cryptosystems (페어링 암호 시스템을 위한 $F_{3^m}$에서의 효율적인 MapToPoint 방법)

  • Park, Young-Ho;Cho, Young-In;Chang, Nam-Su
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.21 no.6
    • /
    • pp.3-12
    • /
    • 2011
  • A hashing function that maps arbitrary messages directly onto curve points (MapToPoint) has non-negligible complexity in pairing-based cryptosystems. Unlike elliptic curve cryptosystems, pairing-based cryptosystems require the hashing function in ternary fields. Barreto et al. observed that it is more advantageous to hash the message to an ordinate instead of an abscissa. So, they significantly improved the hashing function by using a matrix with coefficients of the abscissa. In this paper, we improve the method of Barreto et al. by reducing the matrix. Our method requires only 44% memory of the previous result. Moreover we can hash a message onto a curve point 2~3 times faster than Barreto's Method.

Development of 3D Point Cloud Mapping System Using 2D LiDAR and Commercial Visual-inertial Odometry Sensor (2차원 라이다와 상업용 영상-관성 기반 주행 거리 기록계를 이용한 3차원 점 구름 지도 작성 시스템 개발)

  • Moon, Jongsik;Lee, Byung-Yoon
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.16 no.3
    • /
    • pp.107-111
    • /
    • 2021
  • A 3D point cloud map is an essential elements in various fields, including precise autonomous navigation system. However, generating a 3D point cloud map using a single sensor has limitations due to the price of expensive sensor. In order to solve this problem, we propose a precise 3D mapping system using low-cost sensor fusion. Generating a point cloud map requires the process of estimating the current position and attitude, and describing the surrounding environment. In this paper, we utilized a commercial visual-inertial odometry sensor to estimate the current position and attitude states. Based on the state value, the 2D LiDAR measurement values describe the surrounding environment to create a point cloud map. To analyze the performance of the proposed algorithm, we compared the performance of the proposed algorithm and the 3D LiDAR-based SLAM (simultaneous localization and mapping) algorithm. As a result, it was confirmed that a precise 3D point cloud map can be generated with the low-cost sensor fusion system proposed in this paper.

Efficient Sketch Map Representation in Mobile Environment (모바일 환경에서 효율적인 약도 표현 방법)

  • Lee Ki-Jung;Viswanathan Murlikrishna;Whangbo Taeg-Keun;Yang Young-Kyu;So Yong-Uk
    • Korean Journal of Remote Sensing
    • /
    • v.21 no.4
    • /
    • pp.329-339
    • /
    • 2005
  • In the mobile phone map service there are some restrictions of resolutions and process in terminals. So providing a sketch map is very efficient. This simplifies the map data and increases the understanding of the user. This sketched map marks the starting point and ending point. Then simplifies the surroundings like important roads or building so the user can find his/her way easily. First of all this sketch map service needs a method to simplify the route between starting point and ending point and the surroundings. After that it needs to make the simplified data into a sketch map and suitable to the terminal's resolution. To solve these problems this paper proposes a new method to manifest a sketch map efficiently through a mobile phone. The method, introduced in this paper, is surveyed to have a higher efficiency in data usage compared to the current services available in the market. And also it is examined to have a clear vision in process and easily understandable.

SEMI-COMPATIBILITY, COMPATIBILITY AND FIXED POINT THEOREMS IN FUZZY METRIC SPACE

  • Singh, Bijendra;Jain, Shishir
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.18 no.1
    • /
    • pp.1-22
    • /
    • 2005
  • The object of this paper is to introduce the concept of a pair of semi-compatible self-maps in a fuzzy metric space to establish a fixed point theorem for four self-maps. It offers an extension of Vasuki [10] to four self-maps under the assumption of semi-compatibility and compatibility, repsectively. At the same time, these results give the alternate results of Grebiec [5] and Vasuki [9] as well.

  • PDF

Extraction of Non-Point Pollution Using Satellite Imagery Data

  • Lee, Sang-Ik;Lee, Chong-Soo;Choi, Yun-Soo;Koh, June-Hwan
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.96-99
    • /
    • 2003
  • Land cover map is a typical GIS database which shows the Earth's physical surface differentiated by standardized homogeneous land cover types. Satellite images acquired by Landsat TM were primarily used to produce a land cover map of 7 land cover classes; however, it now becomes to produce a more accurate land cover classification dataset of 23 classes thanks to higher resolution satellite images, such as SPOT-5 and IKONOS. The use of the newly produced high resolution land cover map of 23 classes for such activities to estimate non-point sources of pollution like water pollution modeling and atmospheric dispersion modeling is expected to result a higher level of accuracy and validity in various environmental monitoring results. The estimation of pollution from non-point sources using GIS-based modeling with land cover dataset shows fairly accurate and consistent results.

  • PDF

Secure MAP Discovery Schemes in Hierarchical MIPv6 (계층적 Mobile IPv6에서의 안전한 MAP 검색 기법)

  • Choi, Jong-Hyoun;Mun, Young-Song
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.1
    • /
    • pp.41-47
    • /
    • 2007
  • The Hierarchical Mobile IPv6 (HMIPv6) has been proposed to accommodate frequent mobility of the Mobile Node and to reduce the signaling load. A Mobility Anchor Point is a router located in a network visited by the Mobile Node. The Mobile Node uses the Mobile Anchor Point as a local Home Agent. The absence of any protections between Mobile Node and Mobile Anchor Point may lead to malicious Mobile Nodes impersonating other legitimate ones or impersonating a Mobile Anchor Point. In this paper, we propose a mechanism of the secure Mobile Anther Point discovery in HMIPv6. The performance analysis and the numerical results presented in this paper show that our proposal has superior performance to other methods.

Improved depth map generation method using Vanishing Point area (소실점 영역을 이용한 개선된 Depth-map 생성 기법)

  • Ban, Kyeong-Jin;Kim, Jong-Chan;Kim, Kyoung-Ok;Kim, Eung-Kon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.10a
    • /
    • pp.357-359
    • /
    • 2010
  • In monocular images that are used to determine the depth of the vanishing point, the buildings, roads and buildings, such as outdoor video or hallway with room inside for the interior structure, such as the vanishing point in the video is a very strong depth cue. Depth map using the vanishing point in the three-dimensional space, the two-dimensional imaging is used to restore the structure. But if there is a vanishing point vanishing point in the video also depends on the location of the relative depth of different ways to express that need. In this paper we present images of a vanishing point with respect to the improved depth-map was created. Proposed an area where the loss of seven points and areas defined as areas along the proposed direction of different depth.

  • PDF