• 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.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.808-810
• /
• 2004

본 논문에서는 Contrast map과 Salient point를 이용하여 영상에서 중요한 객체를 자동으로 추출하는 방법을 제안한다. 우선 인간의 시각 체계와 유사한 밝기(luminance), 색상(color) 그리고 방향성(orientation) 3가지의 특징정보를 이용하여 각각의 특징정보로부터 feature map을 생성하고 이 3가지의 feature map을 선형 결합하여 contrast map을 생성한다. 이렇게 생성된 하나의 contrast map을 이용하여 대략적인 Attention Window (AW)의 위치를 결정한다. 다음으로, 영상으로부터 웨이블릿 변환을 적용하여 salient point를 찾고, salient point의 분포와 contrast map의 중요도에 따라 AW의 크기를 실제 중요 객체의 크기와 가장 유사하도록 축소시킨다. 이렇게 선택되고 축소된 AW안에서 실제 중요 객체를 추출하기 위해 AW 내부에 존재하는 영상에 대해서만 영상 분할을 하고 불필요한 영역을 제거하여 자동으로 중요객체를 추출하도록 한다.

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.1
• /
• pp.93-104
• /
• 2021

In this paper, we present a fixed point theorem for a family of generalized condensing multimaps which have ranges of the Zima-Hadžić type in Hausdorff KKM uniform spaces. It extends Himmelberg et al. type fixed point theorem. As applications, we obtain some new collective fixed point theorems for various type generalized condensing multimaps in abstract convex uniform spaces.

• 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.

• 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.

• 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.

• Korean Journal of Mathematics
• /
• v.10 no.1
• /
• pp.19-23
• /
• 2002

Let X be a Banach space satisfying Opial's condition, C a weakly compact convex subset of $X,F:C{\rightarrow}X$ a nonexpansive map, and let $G:C{\rightarrow}X$ be a compact and demiclosed map. We prove that F + G has a fixed point in C if $F+G:C{\rightarrow}X$ is a weakly inward map.

• Communications of the Korean Mathematical Society
• /
• v.31 no.4
• /
• pp.845-855
• /
• 2016

We introduce the proximal point algorithm in a p-uniformly convex metric space. We first introduce the notion of p-resolvent map in a p-uniformly convex metric space as a generalization of the Moreau-Yosida resolvent in a CAT(0)-space, and then we secondly prove the convergence of the proximal point algorithm by the p-resolvent map in a p-uniformly convex metric space.

• 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.

• 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.