• Journal of Korean Society for Geospatial Information Science
• /
• v.3 no.2 s.6
• /
• pp.213-220
• /
• 1995

Map Matching is the method for correcting the current position from dead reckoning in Car Navigation System. In this paper, we proposed the new map matching algorithm that can correct the positioning error caused by sensors and digital map data around the cross road area. To do this, first we set the error boundary of the cross road area by combining the relative error of moving distance and the absolute error of road length, second, we find out the starting point of turning within the determined error boundary of the cross point area, third, we compare the turning angle of the car to the angle of each possible road, and the last, we decide the matched road. We used wheel sensor as a speed sensor and used optical fiber gyro as a directional sensor, and assembled the sensors to the notebook computer. We testified our algorithm by driving the Daejeon area-which is a part of south Korea-as a test area. And we proved the efficiency by doing that.

• Journal of Broadcast Engineering
• /
• v.21 no.6
• /
• pp.957-964
• /
• 2016

Acquisition of reliable depth maps is a critical requirement in many applications such as 3D videos and free-viewpoint TV. Depth information can be obtained from the object directly using physical sensors, such as infrared ray (IR) sensors. Recently, Time-of-Flight (ToF) range camera including KINECT depth camera became popular alternatives for dense depth sensing. Although ToF cameras can capture depth information for object in real time, but are noisy and subject to low resolutions. Recently, filter-based depth up-sampling algorithms such as joint bilateral upsampling (JBU) and noise-aware filter for depth up-sampling (NAFDU) have been proposed to get high quality depth information. However, these methods often lead to texture copying in the upsampled depth map. To overcome this limitation, we formulate a convex optimization problem using higher order regularization for depth map upsampling. We decrease the texture copying problem of the upsampled depth map by using edge weighting term that chosen by the edge information. Experimental results have shown that our scheme produced more reliable depth maps compared with previous methods.

• Journal of Korea Multimedia Society
• /
• v.15 no.7
• /
• pp.837-846
• /
• 2012

This paper presents a watermarking scheme based on the perspective distance for the secure mash-up service. The proposed scheme embeds the watermark of the location information of satellite image and the user information using edge color histogram, which is dissimilar to general digital image. Therefore, this scheme can trace the illegal distributor and can protect private information of user through the watermarking scheme that is adaptive to satellite image. Experimental results verified that our scheme has the invisibility and also the robustness against geometric attacks of rotation and translation.

• Journal of the Korea Society for Simulation
• /
• v.16 no.3
• /
• pp.57-63
• /
• 2007

In real time rendering of fetus the empty space leaping while traversing a ray is most frequently used accelerating technique. The main idea is to skip empty voxel samples which do not contribute the result image and it speeds up the rendering time by avoiding sampling data while traversing a ray in the empty region, saving a substantial number of interpolations. Calculating the distance from the nearest object boundary for every yokel can reduce the sampling operation. Among widely-well-known distance maps, those estimates the true distance, such as euclidean distance, takes a long time to compute because of the complicated floating-point operations, and others which uses approximated distance functions, such as city-block and chessboard, provides faster computation time but sampling error may can occur. In this paper, therefore, we analyze the characteristics of several distance maps and compare the number of samples and rendering time. And we aim to suggest the most appropriate distance map for rendering of fetus in ultrasound image.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10c
• /
• pp.183-184
• /
• 1998

본 논문에서는 목적어-동사 관계의 분포에 따라 한국어 동사를 자동적으로 클러스터링하는 방법을 제시한다. SOM(Self-Organizing Map)이 입력 패턴을 분석하고 가시화하는데 뛰어난 성능을 보이므로, 본 논문에서는 클러스터링하는 방법으로 SOM을 채택하였다. 일단 맵(map)이 만들어지고 나면 학습하는 동안 경험하지 못한 동사도 쉽게 적당한 클러스터로 분류될 수 있고 클러스터들 간의 의미 거리도 맵을 이용하여 쉽게 계산할 수 있다. 본 논문에서 제안한 방법을 명사 확률 분포의 상대 엔트로피(relative entropy)에 기반한 클러스터링 방법과 비교해 본 결과, SOM에 의해 만들어진 동사 클러스터가 상대 엔트로피를 이용해서 만들어진 클러스터를 잘 반영한다는 것을 알 수 있었다.

• The KIPS Transactions:PartD
• /
• v.13D no.4 s.107
• /
• pp.455-462
• /
• 2006

Recently, the filtering approach using vector approximation such as VA-file[1] or LPC-file[2] have been proposed to support similarity search in high dimensional data space. This approach filters out many irrelevant vectors by calculating the approximate distance from a query vector using the compact approximations of vectors in database. Accordingly, the total elapsed time for similarity search is reduced because the disk I/O time is eliminated by reading the compact approximations instead of original vectors. However, the search time of the VA-file or LPC-file is not much lessened compared to the brute-force search because it requires a lot of computations for calculating the approximate distance. This paper proposes a new bitmap index structure in order to minimize the calculating time. To improve the calculating speed, a specific value of an object is saved in a bit pattern that shows a spatial position of the feature vector on a data space, and the calculation for a distance between objects is performed by the XOR bit calculation that is much faster than the real vector calculation. According to the experiment, the method that this paper suggests has shortened the total searching time to the extent of about one fourth of the sequential searching time, and to the utmost two times of the existing methods by shortening the great deal of calculating time, although this method has a longer data reading time compared to the existing vector approximation based approach. Consequently, it can be confirmed that we can improve even more the searching performance by shortening the calculating time for filtering of the existing vector approximation methods when the database speed is fast enough.

• Science of Emotion and Sensibility
• /
• v.16 no.1
• /
• pp.29-42
• /
• 2013

In this paper, we analyze the effect of the depth perception, volume perception and visual discomfort according to the change of the quality of the depth image and the depth of the major object. For the analysis, a 2D image was converted to eighteen 3D images using depth images generated based on the different depth position of a major object and background, which were represented in three detail levels. The subjective test was carried out using eighteen 3D images so that the degrees of the depth perception, volume perception and visual discomfort recognized by the subjects were investigated according to the change in the depth position of the major object and the quality of depth map. The absolute depth position of a major object and the relative depth difference between background and the major object were adjusted in three levels, respectively. The details of the depth map was also represented in three levels. Experimental results showed that the quality of the depth image differently affected the depth perception, volume perception and visual discomfort according to the absolute and relative depth position of the major object. In the case of the cardboard depth image, it severely damaged the volume perception regardless of the depth position of the major object. Especially, the depth perception was also more severely deteriorated by the cardboard depth image as the major object was located inside the screen than outside the screen. Furthermore, the subjects did not felt the difference of the depth perception, volume perception and visual comport from the 3D images generated by the detail depth map and by the rough depth map. As a result, it was analyzed that the excessively detail depth map was not necessary for enhancement of the stereoscopic perception in the 2D-to-3D conversion.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.37 no.5
• /
• pp.470-475
• /
• 2009

This paper is the study which is head tracker using pattern matching. Proposal algorithm obtains initial attitude of head tracker using pattern matching. Optical head tracker consists of infrared LEDs(features) which are attached helmet as pattern, stereo infrared cameras. Proposal algorithm analyzes patterns by error rate of feature distance and estimates feature characteristic number. Initial attitude of head tracker is obtained to compare map data and feature characteristic number.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.3
• /
• pp.71-77
• /
• 2004

While doing games, units have to find goal And according to algorism, there is great difference in time and distance. In this paper the researcher compared and described characteristics of each of the improved algorism and A* algorism by giving depth-first search, breadth-first search and distance value and then argued algorism. In addition. by actually calculating the presumed value in A* a1gorism, the researcher finds the most improved value. Finally, by means of comparison between A* algorism and other one, the researcher verified its excellence and did simple path-finding using A* algorism.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10d
• /
• pp.562-564
• /
• 2002

본 논문에서는 자기상관함수의 국소적 특징을 사용하여 에지 특징을 추출한 후, 이를 이용해 유사이미지를 검색하는 방법을 제시한다. 자기상관함수의 국소적 특징을 이용하여 이미지를 검색할 경우 크기, 밝기, 색상등과 같은 이미지 요소가 서로 다를 경우에도 영향을 받지 않고 에지 특징정보를 추출해 낼 수 있다. 이는 얻어진 에지 특징을 이미지 크기와 고차 국소 자기상관함수의 변위에 의해 변하지 않도록 정규화를 하고, 동일 이미지에 대해 밝기가 조금 달라지면 검색효율이 떨어지는 점을 해결하기 위해 거리척도로서 방향여현거리(direction cosine distance)를 이용함으로써 가능하다. 이렇게 추출된 특징벡터를 자기조직화 맵에 의하여 클러스터링하고, 유사이미지 검색의 효율성을 비교해본 결과, 본 논문에서 제시한 방법을 사용하여 검색한 경우 재현율이 기존의 방법에 비해서 비교적 높은 수치를 나타냈다.