• Journal of KIISE:Databases
• /
• v.34 no.1
• /
• pp.59-69
• /
• 2007

The trajectory of a tag in RFID system is represented as a interval that connects two spatiotemporal locations captured when the tag enters and leaves the vicinity of a reader. Whole trajectories of a tag are represented as a set of unconnected interval because the location of the tag which left the vicinity of a reader is unknown until it enters the vicinity of another reader. The problems are that trajectories of a tag are not connected. It takes a long time to find trajectories of a tag because it leads to searching the whole index. To solve this problem, we propose a technique that links two intervals of the tag and an index scheme called SLR-tree. We also propose a sharing technique of link information between two intervals which enhances space utilization of nodes, and propose a split policy that preserves shared-link information. And finally, we evaluate the performance of the proposed index and prove that the index processes history queries efficiently.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10B
• /
• pp.994-1003
• /
• 2009

For Automatic Meter Reading System, good topology of check machines, concentrators, and repeaters in client field is important. Steiner Minimum Tree is a minimum cost tree connecting all given nodes with introducing Steiner points. In this paper, an efficient mechanism allocating and connecting check machines, concentrators and repeaters which are essential elements in automatic meter reading system is proposed, which conducts repeated applications of building approximate Minimum Steiner Trees. In the mechanism, input nodes and Steiner points might correspond to check machine, concentrators or repeaters and edges might do to the connections between them. Therefore, through suitable conversions and processes of them, an efficient network for automatic meter reading system with both wired and wireless communication techniques could be constructed. In our experiment, for 1000 input nodes and 200 max connections per node, the proposed mechanism shortened the length of produced network by 19.1% comparing with the length of Minimum Spanning Tree built by Prim's algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.6
• /
• pp.147-152
• /
• 2016

Wireless sensor networks that are easy to deploy and install are ideal for building a system that monitors the condition of the equipment in a factory environment where wiring is difficult. The ZigBee has characteristics of low price and low power compared with other wireless communication protocols and is suitable for a monitoring system requiring a plurality of nodes. ZigBee communication requires encryption security between devices because all protocol layers are based on OTM trusted by each other. In the communication between nodes, node authentication must be guaranteed and exposure of confidential information managed by each node should be minimized. The facilities of the factory are regular and stationary in distribution location. In order to protect the information gathered from the sensor in the factory environment and the actuator control information connected to the sensor node, we propose a cryptosystem based on the two - dimensional grid - based key distribution method similar to the distribution environment of the facility.

• Journal of Advanced Navigation Technology
• /
• v.16 no.2
• /
• pp.394-400
• /
• 2012

SURF is a robust local invariant feature descriptor and has been used in many applications such as object recognition. Even though this algorithm has similar matching accuracy compared to the SIFT, which is another popular feature extraction algorithm, it has advantage in matching time. However, these descriptors do not consider relative location information of extracted interesting points to guarantee rotation invariance. Also, since they use gray image of original color image, they do not use the color information of images, either. In this paper, we propose a method for improving matching performance of SURF descriptor using the color and relative location information of interest points. The location information is built from the angles between the line connecting the centers of interest points and the orientation line constructed for the center of each interest points. For the color information, color histogram is constructed for the region of each interest point. We show the performance of our scheme through experiments.

• The Journal of the Convergence on Culture Technology
• /
• v.7 no.4
• /
• pp.331-336
• /
• 2021

This study first examined the social meanings of typicality found in the prison, (solitary) confinement, and conduit(passage) in Peter Halley's works, in which both the prison and (solitary) confinement represent a suppressed structural framework. The former has freedom and escape excluded from it, and the latter allows for mutual regulation and connection as a space of positive mediation. Conduits are interpreted to be flexible and have the potential of creating something new through connection and communication with the outside world. The study then compared and analyzed the meanings of typicality in Halley's works and the concept of segments proposed by Gilles Deleuze and Félix Guattari as social justice in that both of them were in the same context. The findings lead to a conclusion that Halley's prison, (solitary) confinement, and conduit(passage) can be connected to a solid, flexible, and escape segment, respectively, by Deleuze and Guattari.

• The Journal of the Korea Contents Association
• /
• v.5 no.1
• /
• pp.127-134
• /
• 2005

To connect the gap on the contours at the summit area, we propose the linear interpolation in the polar coordinates. Tn the experiments of applying both existing algorithms and a proposed method to some graphic images, the proposed method generated curves that average MAE was 1.940 pixels. In particular, our method with MAE of 1.240 on real map image was superior than the others. Also by generating new curves with neighbors-resembled appearance, the contours were reconstructed seamlessly.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.20 no.1
• /
• pp.7-14
• /
• 1983

Linear feature such as lines and curves are one of important features in image processing. In this paper, new method of linear feature detection is suggested. Also, we have studied approximation technique which transforms detected linear feature into data structure for the practical. This method is based on graph theory and principle of this method is based on minimal spanning tree concept which is widely used in edge linking process. By postprocessing, Hairs and inconsistent line segments are removed. To approximate and describe traced linear feature, piecewise linear approximation is adapted. The algorithm is demonstrated through computer simulations.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04b
• /
• pp.565-567
• /
• 2000

필기 한글 인식에서 원래 패턴의 모양을 유지하는 골격선 추출은 중요하다. 세선화에 의존하는 기존 방법은 작은 잡음에 민감하다는 단점을 안고 있다. 본 논문은 필기 한글 패턴에 적합한 새로운 골격선 추출 방법을 제안한다. 먼저 한글 패턴은 T-접점과 B-접점이라는 두가지 모양 특징을 중심으로 분할할 수 있다는 관찰에 근거하여 유사블록으로 이루어진 부품 집합으로 분할한다. 또한 세 개 이상의 획이 복잡한 형태로 만나는 지점을 결합 부품으로 분할한다. 그런 다음, 각 부품에서 접점의 형태에 따라 결합 부품을 추가 탐지한다. 결합 부품과 인접한 부품들의 연관 관계에 따라 골격선을 구하고, 골격선의 연결성을 보장하기 위해서 선분 연장을 수행한다. 본 논문에서 기존의 방법과의 비교를 위해 다섯 가지 비교 기준을 설정하고, 이를 기반으로 비교 분석하였다. 본 논문에서 제안한 방법이 여러 기준에서 세선화-기반 방법보다 우수함을 보였다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.4 no.1
• /
• pp.50-63
• /
• 1994

기존의 지식 기반 시스템들은 그 지식의 형태를 대부분 규책을 통해서 처리하고 있다. 그리고 이런 규책들은 일반적으로 사람에 의해서 외부에서 주어진며 주어진 규칙은 학습이 진행됨에 따라 그 형태가 바뀌게 된다. 그러나 실생활에서 일어나는 대부분의 일들은 주어진 한정된 수의 규칙에 의해서만 수행되기보다는 반복수행 또는 점진적인 학습에 의해서 동적으로 그 수와 적용범위가 바뀌게 된다. 본 논문에서는 외부로부터 얻어지는 데이터를 통해서 그들 사이의 관계를 알아내고, 이를 통해 새로운 규칙을 생성하며, 계속적으로 학습이 진행됨에 따라서 능동적으로 규칙의 수와 적용범위가 변화하는 시스템을 제안한다. 동적 규칙 생성시스템의 유용성을 검증하기 위해서, 세 선분이 연결된 막대기의 한쪽 끝을 고정시킨 상태에서, 다른 쪽 끝이 원하는 위치에 도달하게 하는 문제에 적용하여 로보트 팔의 자동 조절 및 기계 학습의 자동화에 기여할 수 있음을 보여준다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10b
• /
• pp.457-462
• /
• 2007

사용자가 가능한 센서 가까이에서 이동하는 문제를 최단거리유지문제라 하며, 무선 연결의 안정성을 높이기 위해서 두 개의 센서로부터 가까이에 위치하여 사용자가 움직이는 이동경로를 차선최단거리유지이동경로라고 한다. 이 논문에서는 주어진 센서들의 집합 U와 시작점 s, 끝점 t가 주어질 때, s에서 t까지 이르는 경로로서, 가장 가까운 두 개의 센서까지의 거리가 최소인 차선최단거리유지이동경로를 찾는 $O((c^2n+e)log(c^2n))$-시간 알고리즘을 제시한다. 여기서 c는 집합 U의 하나의 사이트가 갖는 최대 보로노이 선분의 개수이다.