• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5
• /
• pp.1579-1586
• /
• 2000

This paper propose a method of shape analysis and representation for the handwritten Hangul character patterns. Each of the connected components composing a Hangul character is decomposed into many parts, and skeletons are extracted from the decomposed parts. Using the results, we represent the shape of Hangul characters using the attributed graph representation. A node of the attributed graph represents a part and an edge represents their relationships and they store valuable informations of the pattern shapes.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.926-937
• /
• 1996

A graph traversal technique is a certain pattern of visiting nodes of a graph. Many special traversal techniques have been applied to solve graph related problems. For example, the depth first search technique has been used for finding strongly onnected components of a directed graph or biconnected components of a general graph. The distributed protocol to implement his depth first search technique on the distributed network can be divided into a fixed topology problem where there is no topological change and a dynamic topology problem which has some topological changes. Therefore, in this paper, we present a more efficient distributed depth first search protocol with fixed topology and a resilient distributed depth first search protocol where there are topological changes for the distributed network. Also, we analysed the message and time complexity of the presented protocols and showed the improved results than the complexities of the other distributed depth first search protocols.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.5
• /
• pp.57-63
• /
• 2008

Recently, OGC(Open Geospatial Consortium) take the lead in SWE(Sensor Web Enablement) research that collection various context information from sensor networks and show it on map by web. OGC SWE WG(Working Group) defines a standard encoding about realtime spatiotemporal appear geographical feature, sensing data and support web services. This paper proposes a visualization scheme of sensing data based location on 2D maps. We show realtime sensing data on moving node that mapping GPS data on map. First, we present an algorithm and procedure that location information change to position of maps for visualization sensing data based on 2D maps. For verifying that algorithm and scheme, we design and implement a program that collecting GPS data and sensing data, and displaying application on 2D maps. Therefore we confirm effective visualization on maps based on web which realtime image and sensing data collected from sensor network.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.6
• /
• pp.1337-1342
• /
• 2012

In recent years, many researches in Home Networking are being progressed actively. Most of techniques for Home Networking are based on wired but the technique for wireless connection is also needed. This paper focuses on wireless connection in Home Networking. Of many of wireless technologies, such as Wireless LAN, Bluetooth, or HomeRF, we especially propose to apply the new technique called Wireless Sensor Network. We present hardware and protocol stack design consideration for wireless sensor node and wireless sensor network, and then we present how to apply wireless sensor network to Home Networking and how to constitute Wireless Home-Networking with a variety of sensor nodes. Finally, we introduce the wireless sensor node system designed by us and conclude this paper.

• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.507-512
• /
• 2001

Feature-based similarity has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects. the performance of conventional multidimensional data structures tends to deteriorate as the number of dimensions of feature vectors increase. The $R^{*}-Tree$ is the most successful variant of the R-Tree. In this paper, we propose a SOM-based $R^{*}-Tree$ as a new indexing method for high-dimensional feature vectors. The SOM-based $R^{*}-Tree$ combines SOM and $R^{*}-Tree$ to achieve search performance more scalable to high-dimensionalties. Self-Organizingf Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two-dimensional space. The map is called a topological feature map, and preserves the mutual relationships (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. We experimentally compare the retrieval time cost of a SOM-based $R^{*}-Tree$ with of an SOM and $R^{*}-Tree$ using color feature vectors extracted from 40,000 images. The results show that the SOM-based $R^{*}-Tree$ outperform both the SOM and $R^{*}-Tree$ due to reduction of the number of nodes to build $R^{*}-Tree$ and retrieval time cost.