• Journal for History of Mathematics
• /
• v.20 no.4
• /
• pp.49-60
• /
• 2007

In this article, the concept of rigidity of smooth surfaces in the three dimensional Euclidean space which naturally arises in elementary geometry is introduced, and the natural process of the development of rigidity theory for compact surfaces and its generalizations are investigated.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.06a
• /
• pp.221-222
• /
• 2018

본 논문에서는 공간적 분포 정보를 이용한 3D 포인트 클라우드 압축 기법을 제안한다. 우선, 3D 포인트 클라우드에 대해 팔진 트리 구조를 생성한다. 그리고 잎사귀 노드들에 대해서 해당 복셀의 중심으로부터의 유클리드 거리를 구하고, 이를 통해서 공간적 분포 정보를 구성한다. 이때, 복셀 내 포인트들의 분포를 고려하여, 포인트들이 밀집하여 분포하는 경우 복셀 내 포인트들을 하나의 대표 위치로 표현하여 압축한다. 최종적으로 산술부호화를 수행하여 압축 성능을 높인다. 실험 결과 제안하는 기법이 3D 포인트 클라우드를 효율적으로 압축함을 확인할 수 있다.

• Journal of Digital Convergence
• /
• v.14 no.8
• /
• pp.555-564
• /
• 2016

Space perception is generally treated as a problem relevant to the ability to recognize objects. Alternatively, the data from shape perception studies contributes to discussions about the geometry of visual space. This geometry is generally acknowledged not to be Euclidian, but instead, elliptical, hyperbolic or affine, which is to say, something that admits the distortions found in so many shape perception studies. The purpose of this review article is to understand perceived shape and the geometry of visual space in the context of visually guided action. Thus, two prominent approaches that explain the relation between perception and action were compared. It is important to understand the fundamental information of how human perceive visual space and perform visually guided action for the convergence on embodied cognition, and further on artificial intelligence researches.

• The Journal of the Acoustical Society of Korea
• /
• v.23 no.6
• /
• pp.454-461
• /
• 2004

This paper describes the acoustic characteristics of 8 Korean monophthongs. Two acoustic variables were newly manipulated the distance between Fl and F2 (Δ［F2-Fl］). which might be of help for the judgement of the vowel backness. and Euclidian distance between two vowels. ［에］ & ［애］ were observed to be merged in both male vowel space and the female's. respectively. The merger of ［우］ & ［오］, on the other hand, was only seen in the female space. In case of Fl, which concerns the vowel height. the scope of the females' was 1.36 times longer than that of the males' Regarding F2, which is related to the vowel backness. the females used a space 1.29 times longer than the males. The observation of Euclidian distance between the basic 3 vowels (이. 아. 우) showed that the females have longer distance than the males: ［이-아］ 1.25 times, ［아-우］ 1.45 times, and ［이-우］ 1.35 times. respectively.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.336-339
• /
• 2009

본 논문에서는 최단 경로 탐색 및 거리 계산의 필요성을 가지고 근사 인덱싱 방법의 후처리 부분을 제안한다. 근사 인덱싱 방법이란 오프라인에서 네트워크 공간상의 객체들을 유클리드 공간 상의 절대 좌표로 사상하여 인덱싱한 후, k-최근접 이웃 질의를 처리하는 방법이다. 그러나 기존 연구는 질의 점으로부터 각 정적 객체까지의 경로를 탐색해주지 않을 뿐만 아니라 착오 기각이 발생한다. 따라서 본 논문에서는 질의 점으로부터 k개의 정적 객체까지의 경로를 효과적으로 탐색할 수 있는 방법을 제안한다. 또한, 이 방법을 통하여 착오 기각 역시 완화시킬 수 있는 방법을 제안한다. 실험을 통하여 제안하는 방법이 기존 경로 탐색 기법들에 비해 노드 탐색 횟수 및 실행 성능이 크게 향상시킨 것으로 나타났다.

• Journal of KIISE:Databases
• /
• v.35 no.5
• /
• pp.447-458
• /
• 2008

In this paper, we address an efficient processing scheme for k-nearest neighbor queries to retrieve k static objects in road network databases. Existing methods cannot expect a query processing speed-up by index structures in road network databases, since it is impossible to build an index by the network distance, which cannot meet the triangular inequality requirement, essential for index creation, but only possible in a totally ordered set. Thus, these previous methods suffer from a serious performance degradation in query processing. Another method using pre-computed network distances also suffers from a serious storage overhead to maintain a huge amount of pre-computed network distances. To solve these performance and storage problems at the same time, this paper proposes a novel approach that creates an index for moving objects by approximating their network distances and efficiently processes k-nearest neighbor queries by means of the approximate index. For this approach, we proposed a systematic way of mapping each moving object on a road network into the corresponding absolute position in the m-dimensional space. To meet the triangular inequality this paper proposes a new notion of average network distance, and uses FastMap to map moving objects to their corresponding points in the m-dimensional space. After then, we present an approximate indexing algorithm to build an R*-tree, a multidimensional index, on the m-dimensional points of moving objects. The proposed scheme presents a query processing algorithm capable of efficiently evaluating k-nearest neighbor queries by finding k-nearest points (i.e., k-nearest moving objects) from the m-dimensional index. Finally, a variety of extensive experiments verifies the performance enhancement of the proposed approach by performing especially for the real-life road network databases.

• The KIPS Transactions:PartD
• /
• v.16D no.3
• /
• pp.317-326
• /
• 2009

Recently, there have been many research efforts proposed on trajectory information. Most of them mainly focus their attention on those objects moving in Euclidean space. Many real-world applications such as telematics, however, deal with objects that move only over road networks, which are highly restricted for movement. Thus, the existing methods targeting Euclidean space cannot be directly applied to the road network space. This paper proposes a new clustering scheme for a large volume of trajectory information of objects moving over road networks. To the end, we first define a trajectory on a road network as a sequence of road segments a moving object has passed by. Next, we propose a similarity measurement scheme that judges the degree of similarity by considering the total length of matched road segments. Based on such similarity measurement, we propose a new clustering algorithm for trajectories by modifying and adjusting the FastMap and hierarchical clustering schemes. To evaluate the performance of the proposed clustering scheme, we also develop a trajectory generator considering the observation that most objects tend to move from the starting point to the destination point along their shortest path, and perform a variety of experiments using the trajectories thus generated. The performance result shows that our scheme has the accuracy of over 95% in comparison with that judged by human beings.

• Journal of Korea Multimedia Society
• /
• v.15 no.2
• /
• pp.215-225
• /
• 2012

In multimedia database, a multidimensional space-based indexing has been used to increase search efficiency. However, this method is inefficient in terms of ubiquity because it uses Euclidean distance as a scale of distance calculation. On the contrary, a metric space-based indexing method, in which metric axiom is prerequisite is widely available because a metric scale other than Euclidean distance could be used. This paper is attempted to propose a way of improving VP-tree, one of the metric space indexing methods. The VP-tree calculates the distance with an object which is ultimately linked to the a leaf node depending on the node fit for the search range from a root node and examines if it is appropriate with the search range. Because search speed decreases as the number of distance calculations at the leaf node increases, however, this paper has proposed a method which uses the latest interface on query object as the base point of trigonometric inequality for improvement after focusing on the trigonometric inequality-based range compression method in a leaf node. This improvement method would be able to narrow the search range and reduce the number of distance calculations. According to a system performance test using 10,000 video data, the new method reduced search time for similar videos by 5-12%, compared to a conventional method.

• Journal of Platform Technology
• /
• v.9 no.4
• /
• pp.60-70
• /
• 2021

This paper proposes a method capable of stably tracking the coordinates of a patterned laser image in a curved screen shooting system using two or more channels of multiple cameras. This method can track and acquire target points very effectively when applied to a multi-screen shooting method that can replace the HMD shooting method. Images of curved screens with severe deformation obtained from individual cameras are corrected through image normalization, image binarization, and noise removal. This corrected image is created and applied as an Euclidean space map that is easy to track the firing point based on the matching point. As a result of the experiment, the image coordinates of the pattern laser were stably extracted in the curved screen shooting system, and the error of the target point position of the real-world coordinate position and the broadband Euclidean map was minimized. The reliability of the proposed method was confirmed through the experiment.

• Journal of Broadcast Engineering
• /
• v.4 no.2
• /
• pp.87-102
• /
• 1999

We propose an algorithm for augmenting a real video sequence with views of graphics ojbects without metric calibration of the video camera by representing the motion of the video camera in projective space. We define a virtual camera, through which views of graphics objects are generated. attached to the real camera by specifying image locations of the world coordinate system of the virtual world. The virtual camera is decomposed into calibration and motion components in order to make full use of graphics tools. The projective motion of the real camera recovered from image matches has a function of transferring the virtual camera and makes the virtual camera move according to the motion of the real camera. The virtual camera also follows the change of the internal parameters of the real camera. This paper shows theoretical and experimental results of our application of non-metric vision to augmented reality.