• International journal of advanced smart convergence
• /
• v.8 no.1
• /
• pp.126-132
• /
• 2019

Creative thinking appears even before it is expressed in language, and its existence is revealed through emotion, intuition, image and body feeling before logic or linguistics rules work. In this study, Lego is intended to present experimental child interactive content that is applied with a computer vision based on image processing techniques. In the case of infants, the main purpose of this content is the development of hand muscles and the ability to implement imagination. The purpose of the analysis algorithm of the OpenCV library and the image processing using the 'VVVV' that is implemented as a 'Node' in the midst of perceptual changes in image processing technology that are representative of object recognition, and the objective is to use a webcam to film, recognize, derive results that match the analysis and produce interactive content that is completed by the user participating. Research shows what Lego children have made, and children can create things themselves and develop creativity. Furthermore, we expect to be able to infer a diverse and individualistic person's thinking based on more data.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.3
• /
• pp.51-61
• /
• 2012

This paper suggests an algorithm that obtains Directed Graph Minimum Spanning Tree (DMST), using Prim MST algorithm which is Minimum Spanning Tree (MST) of undirected graph. At first, I suggested the Prim DMST algorithm that chooses Minimum Weight Arc(MWA) from out-going nodes from each node, considering differences between undirected graph and directed graph. Next, I proved a disadvantage of Prim DMST algorithm and Chu-Liu/Edmonds DMST (typical representative DMST) of not being able to find DMST, applying them to 3 real graphs. Last, as an algorithm that can always find DMST, an advanced Prim DMST is suggested. The Prim DMST algorithm uses a method of choosing MWA among out-going arcs of each node. On the other hand, the advanced Prim DMST algorithm uses a method of choosing a coinciding arc from the out-going and in-going arcs of each node. And if there is no coinciding arc, it chooses MWA from the out-going arcs from each node. Applying the suggested algorithm to 17 different graphs, it succeeded in finding the same DMST as that found by Chu-Liu/Edmonds DMST algorithm. Also, it does not require such a complicated calculation as that of Chu-Liu/Edmonds DMST algorithm to delete the cycle, and it takes less time for process than Prim DMST algorithm.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.17 no.4
• /
• pp.101-111
• /
• 2014

Spatial events are predictable using data mining classification algorithms. Decision trees have been used as one of representative classification algorithms. And they were normally used in the classification tasks that have label class values. However since using rule ranking methods, spatial prediction have been applied in the spatial prediction problems. This paper compared rule ranking methods for the spatial prediction application using a decision tree. For the comparison experiment, C4.5 decision tree algorithm, and rule ranking methods such as Laplace, M-estimate and m-branch were implemented. As a spatial prediction case study, landslide which is one of representative spatial event occurs in the natural environment was applied. Among the rule ranking methods, in the results of accuracy evaluation, m-branch showed the better accuracy than other methods. However in case of m-brach and M-estimate required additional time-consuming procedure for searching optimal parameter values. Thus according to the application areas, the methods can be selectively used. The spatial prediction using a decision tree can be used not only for spatial predictions, but also for causal analysis in the specific event occurrence location.

• Journal of the Korean housing association
• /
• v.17 no.4
• /
• pp.119-130
• /
• 2006

Apartment houses, the representative type of urban housing, are becoming an important element in Korea urban landscape. In this regard, this study aims to consider landscape in view of city residents reflecting human's visual perceptual characteristic, and in line with this, the urban landscape of apartment houses viewed from the urban center main intersections has been embodied according to the physical components of the intersections, which was followed by preference survey of the city residents, and then based on this, the visual-perceptual characteristics were examined. The findings are as follows: 1. The findings gained from the average of the landscape types indicate that the city residents are more satisfied when the shielding by surrounding buildings is minimized, view securing is relatively good, the whole complex is clearly observed because of its proximity to the visual point, and the view of the complex is well recognized from the focus point. 2. The examination concerning the preferred factors positively evaluated in terms of architectural planning shows that when the complex view is changeable sophisticated, makes the residents feel comfortable with its stable, open plan, and it's in harmony with surroundings, such housing attracts the city residents. 3. In terms of architectural planning factors, it turned out that the complex is more preferred when the visibility of the complex and the scale of surrounding green space are in good condition, and such elements of the complex as the sky line, the overall shape, the elevation, variation of the shape and height are harmonious with one another.

• The KIPS Transactions:PartC
• /
• v.14C no.2
• /
• pp.191-198
• /
• 2007

A mobile ad-hoc network (MANET) is an autonomous, infrastructure-less system that consists of mobile nodes. In MANET, on demand routing protocols are usually used because network topology changes frequently. AODV, which is a representative on demand routing protocol, operates using the routing table of each node that includes next hop of a route for forwarding packets. It maintains the established route if there is not an expiration of route or any link break. In the paper, we propose a partially adaptive route maintenance scheme (AODV-PA) based on AODV, which provides dynamic route modification of initial route for selecting the effective route using not only next hop but also next-hop of next-hop (i.e. 2-hop next node) acquired through route discovery process. In addition, the proposed scheme additionally manages the routing table for preventing exceptional link breaks by route modification using HELLO messages. We use NS 2 for the computer simulation and validate that the proposed scheme is better than general AODV in terms of packet delivery ratio, latency, routing overhead.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.40-44
• /
• 2009

Data-centric storage schemes(DCS) are one of representative researches that efficiently store and manage sensor readings in sensor nodes in the sensor networks. In DCS, a sensor sends the sensed data to a specific node in order to store them. However, it has a problem that sensor nodes consume a lot of energy for transmitting their readings to remote sensor node. In this paper, we propose a novel sensor data compression algorithm to reduce communication costs. The proposed algorithm does not transmit all the sensed data and establishes a safe region. It transmits the sensed data only when current measurement is out of the safe region, As a result, the propposed algorithm extends network life time and reduces data transmission. It is shown through performance evaluation that our proposed algorithm reduces energy consumption by about 60% over the conventional algorithm.

• The Journal of the Korea Contents Association
• /
• v.14 no.3
• /
• pp.33-39
• /
• 2014

Domestic and international researches, about intelligent systems based on a variety of location recognitions using location information, have actively proceeded. The representative location recognition method based on PTMP(Point To Multi Point) communication uses TOA(Time Of Arrival) to calculate distances to a fixed node that you want to recognize a position. The method is used to obtain the fixed node location information from three nodes location information that is applied by the triangulation method. There are disadvantages, an infrastructure should be established at a specific space and the system established cost is needed, in the location recognition method based on the PTMP communication, In this paper, the ranging based PTP(Point To Point) location recognition method is proposed to revise the disadvantage of PTMP location recognition method. And then it is compared with PTMP communication location recognition to evaluate performance. In this way, PTMP and PTP communication location recognition systems based on ranging were constructed and tested in an indoor environment. Experiment results show that the proposed PTP location recognition method could be confirmed to improve accuracy more than 3 times when it was compared with the existed PTMP location recognition method.

• The Journal of the Korea Contents Association
• /
• v.10 no.11
• /
• pp.58-67
• /
• 2010

Data-centric storage schemes(DCS) are one of representative researches that efficiently store and manage sensor readings in sensor nodes in the sensor networks. In DCS, a sensor sends the sensed data to a specific node in order to store them. However, it has a problem that sensor nodes consume a lot of energy for transmitting their readings to remote sensor node. In this paper, we propose a novel sensor data compression algorithm to reduce communication costs for DCS. The proposed algorithm establishes a safe region and transmits the sensed data only when current measurement is out of the safe region, As a result, the proposed algorithm extends network life time and reduces data transmission. It is shown through performance evaluation that our proposed algorithm reduces energy consumption by about 60% over the conventional algorithm.

• Journal of the Institute of Convergence Signal Processing
• /
• v.14 no.1
• /
• pp.45-50
• /
• 2013

Sensors have limited resources in sensor networks, so efficient use of energy is important. Representative clustering methods, LEACH, LEACHC, TEEN generally use direct transmission methods from cluster headers to a sink node to pass collected data. If clusters are located at a long distance from the sink node, the cluster headers exhaust a lot of energy in order to transfer the data. As a consequence, the life of sensors is shorten and re-clustering is needed. In the process of clustering, sensor nodes consume some energy and the energy depletion of the cluster headers meet another energy exhaustion. A method of transferring data from cluster headers to the sink using neighbor clusters is needed for saving energy. In this paper, we propose a novel routing method using a multi-hop transmission method in cluster sensor networks. This method uses the topology matrix which presents cluster topology. One-hop routing and two-hop routing are proposed in order to increase the energy efficiency.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.4
• /
• pp.51-57
• /
• 2020

WSN is a wirelessly configured network of sensor nodes with limited power such as batteries. If the sensor node's battery is exhausted, the node is no longer available. Therefore, if the network is to be used for a long time, energy consumption should be minimized. There are many Wireless Sensor Network Protocols to improve energy efficiency, including Cluster-based and chain-based Protocols. This paper seeks to examine the performance evaluation of routing protocols studied separately for the improvement of performance in wireless sensor network. The criteria for comparison were selected as the LEACH protocol, a representative hierarchical routing protocol, and the comparison targets considered CHEF and FLCFP and LEACH-DFL routing protocols with Fuzzy Logic. Various criteria for performance comparison were presented in this paper, and the performance was compared through simulation of each protocol. The purpose is to present a reference point for comparing the performance of other protocols through the performance comparison of CHEF, FLCFP, and LEACH-DFL, protocols with LEACH and Fuzzy Logic, and to provide additional design methods for improving the performance of protocols.