• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권7호
• /
• pp.3475-3496
• /
• 2018

Most of current watermarking algorithms for GIS vector data embed copyright information by means of modifying the coordinate values, which will do harm to its quality and accuracy. To preserve the fidelity of vector line data and protect its copyright at the same time, a lossless watermarking algorithm is proposed based on storage feature in this paper. Firstly, the superiority of embedding watermark based on storage feature is demonstrated theoretically and technically. Then, the basic concepts and operations on storage feature have been defined including length and angle of the polyline feature. In the process of embedding watermark, the watermark information is embedded into directions of polyline feature by the quantitative mechanism, while the positions of embedding watermark are determined by the feature length. Hence, the watermark can be extracted by the same geometric features without original data or watermark. Finally, experiments have been conducted to show that coordinate values remain unchanged after embedding watermark. Moreover, experimental results are presented to illustrate the effectiveness of the method.

• 방송공학회논문지
• /
• 제14권6호
• /
• pp.807-810
• /
• 2009

본 논문은 실감 원격회의 시스템을 위한 실시간 영상기반 재조명 기술을 제안한다. 구체적으로 원격 사용자의 영상을 미리 캡처된 환경맵을 이용하여 재조명해서 사용자가 같은 공간에 있도록 느끼게 한다. 일반적으로 재조명 수행에 사용자 모델의 정교한 기하학적 모델정보를 도출하는 것이 고품질 재조명 영상을 도출하는데 큰 영향을 준다. 본 논문에서는 두 개의 방향성 조명을 사용하여 실시간으로 사용자 모델정보를 도출하는데 중점을 두었다. 도출된 모델정보와 환경맵의 조명정보를 이용하여 재조명 연산을 수행하고, 그래픽 하드웨어를 사용하여 고속으로 연산을 수행한다. 본 논문에서는 두 개의 방향성조명과 동기화된 카메라를 순차적으로 점등하여 사용자 표면의 반사율 맵을 도출한다. 그리고 빛이 반사할 때 표면에서 입사각과 반사각이 동일한 특징에 근거하여 반사맵 영상의 밝기가 밝을수록 사용자 표면의 법선벡터가 조명과 카메라간의 사잇각이 될 확률이 높아진다. 그래서 양방향의 반사율 값과 사잇각 두 개의 파라미터를 곱하여 표면의 법선벡터를 완성한다. 본 연구의 결과를 이용하면 영상기반 재조명 연구의 실제적이고도 폭넓은 적용이 가능할 것으로 사료되며 고화질의 콘텐츠 양산에도 기여할 것으로 사료된다.

• 제어로봇시스템학회논문지
• /
• 제13권7호
• /
• pp.631-636
• /
• 2007

An efficient obstacle avoidance algorithm is proposed in this paper to avoid dynamic obstacles using a collision vector while a tele-operated mobile robot is moving. For the verification of the algorithm, an operator watches through a monitor and controls the mobile robot with a force-reflection joystick. The force-reflection joystick transmits a virtual force to the operator through the Inter-net, which is generated by an adaptive impedance algorithm. To keep the mobile robot safe from collisions in an uncertain environment, the adaptive impedance algorithm generates the virtual force which changes the command of the operator by pushing the operator's hand to a direction to avoid the obstacle. In the conventional virtual force algorithm, the avoidance of moving obstacles was not solved since the operator cannot recognize the environment realistically by the limited communication bandwidth and the narrow view-angle of the camera. To achieve the dynamic obstacle avoidance, the adaptive virtual force algorithm is proposed based on the collision vector that is a normal vector from the obstacle to the mobile robot. To verify the effectiveness of the proposed algorithm, mobile robot navigation experiments with multiple moving obstacles have been performed, and the results are demonstrated.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권12호
• /
• pp.6190-6213
• /
• 2019

For small-scale vector data, restrictions on watermark scheme capacity and robustness limit the use of copyright protection. A watermarking scheme based on robust geometric features and capacity maximization strategy that simultaneously improves capacity and robustness is presented in this paper. The distance ratio and angle of adjacent vertices are chosen as the watermark domain due to their resistance to vertex and geometric attacks. Regarding watermark embedding and extraction, a capacity-improved strategy based on quantization index modulation, which divides more intervals to carry sufficient watermark bits, is proposed. By considering the error tolerance of the vector map and the numerical accuracy, the optimization of the capacity-improved strategy is studied to maximize the embedded watermark bits for each vertex. The experimental results demonstrated that the map distortion caused by watermarks is small and much lower than the map tolerance. Additionally, the proposed scheme can embed a copyright image of 1024 bits into vector data of 150 vertices, which reaches capacity at approximately 14 bits/vertex, and shows prominent robustness against vertex and geometric attacks for small-scale vector data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권1호
• /
• pp.323-343
• /
• 2020

With the rapid development of computer and communication techniques, copyright protection of vector geographic data has attracted considerable research attention because of the high cost of such data. A novel adaptive watermark detection algorithm is proposed for vector geographic data that can be used to qualitatively analyze the robustness of watermarks against data addition attacks. First, a watermark was embedded into the vertex coordinates based on coordinate mapping and quantization. Second, the adaptive watermark detection model, which is capable of calculating the detection threshold, false positive error (FPE) and false negative error (FNE), was established, and the characteristics of the adaptive watermark detection algorithm were analyzed. Finally, experiments were conducted on several real-world vector maps to show the usability and robustness of the proposed algorithm.

• 한국정밀공학회지
• /
• 제23권7호
• /
• pp.187-193
• /
• 2006

This paper introduces and illustrates the results of a new method for offsetting the triangular mesh generated from multiple surfaces. The meshes generated from each surface are separated each other and normal directions are different. The face normal vectors are flipped to upward and the lower faces covered by upper faces are deleted. The virtual normal vectors are introduced and used to of feet boundary. It was shown that new method is better than previous methods in offsetting the triangular meshes generated from multiple surfaces. The introduced offset method was applied for 3-axis tool path generation system and tested by NC machining.

• 전기전자학회논문지
• /
• 제26권2호
• /
• pp.150-159
• /
• 2022

본 논문에서는 증강현실(AR) 당구 콘텐츠를 위한 물리 시뮬레이션을 제안한다. 제안하는 증강현실 당구 콘텐츠에 대한 물리 시뮬레이션의 특징은 다음과 같다. 먼저, 증강현실 환경에서 실제와 비슷한 당구공의 움직임을 구현하기 위해 당구공에 적용되는 힘과 관성모멘트 계산을 하여 물리식을 도출한다. 다음에 타격 지점에 대한 가상 당구공의 회전과 관련된 가상 당구공의 속도와 각속도를 구한다. 다음으로, 가상 당구공의 움직임 궤적이 실제 당구공과 비슷한 움직임을 구현하기 위하여 입사벡터, 법선벡터, 반사벡터 등의 물리식을 도출하게 된다. 이러한 방정식을 증강현실 환경에 적용하여 AR 당구 콘텐츠를 구현할 수 있다. 이러한 물리 시뮬레이션은 사용자가 가상 당구대를 사용하여 실제와 유사함을 느낄 수 있도록 하며 실제 환경과 상호 작용하게 돕는다. 실험 결과 실제 당구공의 경로와 가상 당구공의 경로 사이의 정확도 범위는 97.75%~99.11%로 계산됐다. 따라서 본 논문에서 제안하는 증강현실 당구 콘텐츠에 대한 물리 시뮬레이션의 성능은 실제 당구공의 경로와 유사함을 확인하였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 하계종합학술대회 논문집(3)
• /
• pp.227-230
• /
• 2002

In this paper we concentrate on overall direction of the gaze based on a head pose for human computer interaction. To decide a gaze direction of user in a image, it is important to pick up facial feature exactly. For this, we binarize the input image and search two eyes and the mouth through the similarity of each block ( aspect ratio, size, and average gray value ) and geometric information of face at the binarized image. We create a imaginary plane on the line made by features of the real face and the pin hole of the camera to decide the head orientation. We call it the virtual facial plane. The position of a virtual facial plane is estimated through projected facial feature on the image plane. We find a gaze direction using the surface normal vector of the virtual facial plane. This study using popular PC camera will contribute practical usage of gaze tracking technology.

• 대한전자공학회논문지TC
• /
• 제45권12호
• /
• pp.58-65
• /
• 2008

본 논문에서는 MANET(Mobile Ad hoc Network)에서 가상 위치 기반 라우팅을 위한 GDHT(Geographic Distributed Hash Table)를 적용하는 방법을 제안한다. 기존의 GDHT는 저장하고자할 데이터를 가상 2차원 직교좌표계에 균일하게 매핑 하였다. 그러나, 위치 기반 라우팅을 사용하는 네트워크에서 노드의 분포는 기존 GDHT의 가상 공간과 다르게 분포한다. 따라서, 기존의 GDHT를 바로 적용할 경우, 많은 데이터들이 네트워크의 외곽 또는 특정 노드에 위치하게 된다. 이는 데이터 또는 서비스 검색 거리 및 시간을 늘리는 문제를 발생시킨다. 또한, BVR(Beacon Vector Routing)이나 LCR(Logical Coordinate Routing) 좌표 요소 사이에는 서로 연관관계가 있기 때문에 일반적인 해쉬 함수를 적용할 경우, 존재할 수 없는 좌표에 매핑 될 가능성이 높아진다. 이러한 문제를 해결하기 위하여, 데이터들의 분포를 제어할 수 있도록 하고 좌표 요소 사이의 연관관계가 반영될 수 있는 "Geographic 해쉬 함수"를 제안한다. 분석과 시뮬레이션을 통하여 제안하는 방법이 데이터 분포를 제어할 수 있고, 데이터 검색 성능을 향상시킴을 보인다.

• Current Optics and Photonics
• /
• 제5권4호
• /
• pp.402-408
• /
• 2021

An off-axis system refers to an optical system in which the optical axis and normal vector at the vertex of each surface do not match. The most important specification in an optical system is its focal length. Among the various methods for measuring the focal length, the most suitable method for the off-axis system is the method that adopts magnification. However, head-mounted display (HMD) optics must be measured while considering the virtual image distance, which is not infinity owing to product characteristics. For the virtual image distance, a camera with a focusing function was used. By measuring HMD optics via this magnification method, the error generated in this measurement was 0.68% of the HMD's focal length, which is within the 1%-3% range of the conventionally permitted design error for the focal length allowed at the optical design stage. Therefore, it can be verified that the measurement accuracy of the method proposed in this study is sufficiently feasible in practice.