• 로봇학회논문지
• /
• 제6권3호
• /
• pp.247-254
• /
• 2011

This paper presents a method of sonar grid map matching for topological place recognition. The proposed method provides an effective rotation invariant grid map matching method. A template grid map is firstly extracted for reliable grid map matching by filtering noisy data in local grid map. Using the template grid map, the rotation invariant grid map matching is performed by Ring Projection Transformation. The rotation invariant grid map matching selects candidate locations which are regarded as representative point for each node. Then, the topological place recognition is achieved by calculating matching probability based on the candidate location. The matching probability is acquired by using both rotation invariant grid map matching and the matching of distance and angle vectors. The proposed method can provide a successful matching even under rotation changes between grid maps. Moreover, the matching probability gives a reliable result for topological place recognition. The performance of the proposed method is verified by experimental results in a real home environment.

• 대한수학회지
• /
• 제41권2호
• /
• pp.379-396
• /
• 2004

In this article, we study rotation surfaces in the 4-dimensional pseudo-Euclidean space E$_2$$^4$. Also, we obtain the complete classification theorems for the flat rotation surfaces with finite type Gauss map, pointwise 1-type Gauss map and an equation in terms of the mean curvature vector. In fact, we characterize the flat rotation surfaces of finite type immersion with the Gauss map and the mean curvature vector field, namely the Gauss map of finite type, pointwise 1-type Gauss map and some algebraic equations in terms of the Gauss map and the mean curvature vector field related to the Laplacian of the surfaces with respect to the induced metric.

• 대한수학회보
• /
• 제42권1호
• /
• pp.23-27
• /
• 2005

In this paper, we study rotation surfaces in a Euclidean space with pointwise 1-type Gauss map and obtain by the use of the concept of pointwise finite type Gauss map, a characterization theorem for rotation surfaces of constant mean curvature.

• 대한수학회지
• /
• 제41권6호
• /
• pp.1007-1021
• /
• 2004

In this paper, we study rotation surfaces in the Minkowski 3-dimensional space with pointwise 1-type Gauss map and obtain by the use of the concept of pointwise finite type Gauss map, a characterization theorem concerning rotation surfaces and constancy of the mean curvature of certain open subsets on these surfaces.

• 대한수학회보
• /
• 제39권1호
• /
• pp.175-184
• /
• 2002

A Cellular embedding of a graph G into an orientable surface S can be considered as a cellular decomposition of S into 0-cells, 1-cells and 2-cells and vise versa, in which 0-cells and 1-cells form a graph G and this decomposition of S is called a map in S with underlying graph G. For a map M with underlying graph G, we define a natural rotation on the line graph of the graph G and we introduce the line map for M. we find that genus of the supporting surface of the line map for a map and we give a characterization for the line map to be embedded in the sphere. Moreover we show that the line map for any life of a map M is map-isomorphic to a lift of the line map for M.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1987년도 한국자동제어학술회의논문집; 한국과학기술대학, 충남; 16-17 Oct. 1987
• /
• pp.382-388
• /
• 1987

In this paper, the performance of Mini MAP architecture is analyzed by simulation method. Token rotation time and waiting time are obtained by simulation. The results of the simulation are compared with these of the analytic model. From these comparisons, it is shown that simulation results are approximately identical to analytic results. Mini MAP architecture has good real time performances in token rotation time and waiting time and can be used to many real time applications.

• International Journal of Precision Engineering and Manufacturing
• /
• 제9권4호
• /
• pp.45-50
• /
• 2008

The Fourier-Mellin transform is the theoretical basis for the translation, rotation, and scale invariance of an image. However, its implementation requires a log-polar map of the original image, which requires logarithmic sampling of a radial variable in that image. This means that the mapping process is accompanied by considerable loss of data. To solve this problem, we propose a dual log-polar map that uses both a forward image map and a reverse image map simultaneously. Data loss due to the forward map sub-sampling can be offset by the reverse map. This is the first step in creating an invertible log-polar map. Experimental results have demonstrated the effectiveness of the proposed scheme.

• Journal of Computing Science and Engineering
• /
• 제8권4호
• /
• pp.187-198
• /
• 2014

In this paper an efficient image encryption scheme based on cyclic rotations and multiple blockwise diffusions with two chaotic maps is proposed. A Sin map is used to generate round keys for the encryption/decryption process. A Pomeau-Manneville map is used to generate chaotic values for permutation, pixel value rotation and diffusion operations. The encryption scheme is composed of three stages: permutation, pixel value rotation and diffusion. The permutation stage performs four operations on the image: row shuffling, column shuffling, cyclic rotation of all the rows and cyclic rotation of all the columns. This stage reduces the correlation significantly among neighboring pixels. The second stage performs circular rotation of pixel values twice by scanning the image horizontally and vertically. The amount of rotation is based on $M{\times}N$ chaotic values. The last stage performs the diffusion four times by scanning the image in four different ways: block of $8{\times}8$ pixels, block of $16{\times}16$ pixels, principal diagonally, and secondary diagonally. Each of the above four diffusions performs the diffusion in two directions (forwards and backwards) with two previously diffused pixels and two chaotic values. This stage makes the scheme resistant to differential attacks. The security and performance of the proposed method is analyzed systematically by using the key space, entropy, statistical, differential and performance analysis. The experimental results confirm that the proposed method is computationally efficient with high security.

• 대한교통학회지
• /
• 제16권1호
• /
• pp.47-58
• /
• 1998

자동차 항법장치의 디스플레이는 도로, 교통정보, 부가정도 등 ITS 정보를 운전자에게 직접전달 하는 부분으로 그 핵샘부품인 도로지도는 정보의 정확성 및 신뢰성의 획득과 함께 운전자의 안전 및 수 행도 향상 항법장치의 사용성 향상을 위하여 운전자가 쉽고 빠르고 정확하게 자신이 원하는 정보를 획 득할 수 있도록 운전자 중심의 설계가 실시되어야 한다. 이에 97년 G7 Navigation 시스템 제작기술 프 로젝트의 일환으로 실시된 본 연구는 지도의 회전방법(map-rotation)방법인 Heading-Up 및 North-Up 과 지도상 지형지물 명칭 문자정보의 회전(text-rota-tion)을 실험변수로 하여 운전자의 반응시간 에러발 생 정신적부하의 측면에서 교차로 유형별 지도진행방법에 따른 인간공학적 평가를 실시한다. 본 연구의 결과로 한국인의 정보인지 형태에 적합한 항법장치 도로지도 진행방법을 제시하며 각 진행방법의 특징 및 운전자의 정보인지에 영향을 주는 요인을 추출한다.

• International Journal of Contents
• /
• 제11권4호
• /
• pp.56-69
• /
• 2015

This paper proposes an efficient image encryption scheme based on quintuple encryption using two chaotic maps. The encryption process is realized with quintuple encryption by calling the encrypt(E) and decrypt(D) functions five times with five different keys in the form EDEEE. The decryption process is accomplished in the reverse direction by invoking the encrypt and decrypt functions in the form DDDED. The keys for the quintuple encryption/decryption processes are generated by using a Tent map. The chaotic values for the encrypt/decrypt operations are generated by using a Gumowski-Mira map. The encrypt function E is composed of three stages: permutation, pixel value rotation and diffusion. The permutation stage scrambles all the rows and columns to chaotically generated positions. This stage reduces the correlation radically among the neighboring pixels. The pixel value rotation stage circularly rotates all the pixels either left or right, and the amount of rotation is based on chaotic values. The last stage performs the diffusion four times by scanning the image in four different directions: Horizontally, Vertically, Principal diagonally and Secondary diagonally. Each of the four diffusion steps performs the diffusion in two directions (forward and backward) with two previously diffused pixels and two chaotic values. This stage ensures the resistance against the differential attacks. The security and performance of the proposed method is investigated thoroughly by using key space, statistical, differential, entropy and performance analysis. The experimental results confirm that the proposed scheme is computationally fast with security intact.