• Journal of the Korea Society of Computer and Information
• /
• v.19 no.9
• /
• pp.65-73
• /
• 2014

Since Time synchronization is also critical in Wireless Sensor Networks (WSN) like other networks, a time synchronization protocol for WSN called IBS(Indirect-Broadcast Synchronization) has been already proposed in 2012. As IBS operates in cluster tree topology, network lifetime may be mainly shortened by cluster head node[s], which usually consumes more power than cluster member (i.e. non-cluster head) nodes. In this paper, I propose enhanced version of IBS (called EIBS) which saves overall energy and prolongs network lifetime by re-constructing partial cluster tree locally. Compared with other tree construction approaches, this tree reconstruction algorithm is not only simpler, but also more efficient in the light of overall power consumption and network lifetime.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.3
• /
• pp.87-92
• /
• 2008

In this paper, certain scaling functions are generated using the dyadic subband tree structure and applied to a time-hopping, pulse position modulation, ultra-wideband (TH-PPM UWB) system. Scaling functions can be obtained by iterating a lowpass filter at each level using a critically sampled dyadic tree. The performance of the TH-PPM UWB system employing scaling functions as the mono-cycle waveform is evaluated through computer simulations in a Rayleigh fading environment.

• ETRI Journal
• /
• v.36 no.3
• /
• pp.450-459
• /
• 2014

In this paper, we present a new, easy-to-generate system that is capable of creating virtual 3D tree models and simulating a variety of growth processes of a tree from a single, real tree image. We not only construct various tree models with the same trunk through our proposed digital image matting method and skeleton-based abstraction of branches, but we also animate the visual growth of the constructed 3D tree model through usage of the branch age information combined with a scaling factor. To control the simulation of a tree growth process, we consider tree-growing attributes, such as branching orders, branch width, tree size, and branch self-bending effect, at the same time. Other invisible branches and leaves are automatically attached to the tree by employing parametric branch libraries under the conventional procedural assumption of structure having a local self-similarity. Simulations with a real image confirm that our system makes it possible to achieve realistic tree models and growth processes with ease.

• Industrial Engineering and Management Systems
• /
• v.12 no.1
• /
• pp.9-15
• /
• 2013

An inverse minimum spanning tree problem makes the least modification on the edge weights such that a predetermined spanning tree is a minimum spanning tree with respect to the new edge weights. In this paper, the concept of uncertain ${\alpha}$-minimum spanning tree is initiated for minimum spanning tree problem with uncertain edge weights. Using different decision criteria, two uncertain programming models are presented to formulate a specific inverse minimum spanning tree problem with uncertain edge weights involving a sum-type model and a minimax-type model. By means of the operational law of independent uncertain variables, the two uncertain programming models are transformed to their equivalent deterministic models which can be solved by classic optimization methods. Finally, some numerical examples on a traffic network reconstruction problem are put forward to illustrate the effectiveness of the proposed models.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.83-86
• /
• 2005

This paper presents a method for point-based 3D building reconstruction using LiDAR data and digital map. The proposed method consists of three processes: extraction of building roof points, identification of roof types, and 3D building reconstruction. After extracting points inside the polygon of building, the ground surface, wall and tree points among the extracted points are removed through the filtering process. The filtered points are then fitted into the flat plane using ODR(Orthogonal Distance Regression). If the fitting error is within the predefined threshold, the surface is classified as a flat roof. Otherwise, the surface is fitted and classified into a gable or arch roof through RMSE analysis. Based on the roof types identified in automated fashion, the 3D building reconstruction is performed. Experimental results showed that the proposed method classified successfully three different types of roof and that the fusion of LiDAR data and digital map could be a feasible method of modelling 3D building reconstruction.

• The Journal of the Korea Contents Association
• /
• v.7 no.8
• /
• pp.59-65
• /
• 2007

Overlay Multicast is an effective method for efficient utilization of system resources and network bandwidth without a need for hardware customization. Multicast tree reconstruction is required when a non-leaf node leaves or fails. However frequent multicast tree reconstruction introduces serious degradation in performance. In this paper, we propose a tree performance optimization algorithm to solve this defect by using information(RTCP-probing) that becomes a periodic feedback to a source node from each child node. The proposed model is a mechanism performed when a parent node seems to cause deterioration in the tree performance. We have improved the performance of the whole service tree using the mechanism and hence composing an optimization tree. The simulation results show that our proposal stands to be an effective method that can be applied to not only the proposed model but also to existing techniques.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.137-140
• /
• 2001

In this paper, we propose a multicast routing scheme for an efficient and reliable support of multicast service to mobile hosts in IPv6 based networks. The purpose of this paper is to develop an algorithm to reduce both the number of multicast tree reconstruction and the multicast service disrupt time using the RSVP scheme. The proposed multicast routing scheme is a hybrid method using the advantages of the hi-directional tunneling and the remote subscription proposed by the IETF Mobile IP working group. The proposed scheme satisfies the maximum tolerable transfer delay time and supports the maximum tunneling service. The simulation results show that the proposed scheme has better performance in the number of multicast tree reconstruction and the time of multicast service disrupt than the previous schemes does.

• The Korean Journal of Quaternary Research
• /
• v.6 no.1
• /
• pp.21-32
• /
• 1992

The paleoclimate of the Chungbu Mountainous Region, Mts. Seorak and Sobaek, was estimated by means of dendroclimatic methodology, The annual growth value of tree-rings is deeply interrelated with the mean temperature of April-May and July-August. The mean temperature of April-May of the reconstruction period(1635-1911), observation period(1912-1989), and the whole period(1635-1989) is 13.58$^{\circ}C$, 13.69$^{\circ}C$, and 13.6$0^{\circ}C$, respectively. That of July-August is $24.50^{\circ}C$, $24.62^{\circ}C$, and $24.58^{\circ}C$ respectively. The reconstructed mean temperature data for April-May and for July-August reveal 13.2 and 12.9 year cycles.

• International journal of advanced smart convergence
• /
• v.11 no.1
• /
• pp.1-10
• /
• 2022

Single-view reconstruction (SVR) is a fundamental method in computer vision. Often used for reconstructing human-made environments, the Manhattan world assumption presumes that planes in the real world exist in mutually orthogonal directions. Accordingly, this paper addresses an automatic SVR algorithm for Manhattan worlds. A method for estimating the directions of planes using graph-cut optimization is proposed. After segmenting an image from extracted line segments, the data cost function and smoothness cost function for graph-cut optimization are defined by considering the directions of the line segments and neighborhood segments. Furthermore, segments with the same depths are grouped during a depth-estimation step using a minimum spanning tree algorithm with the proposed weights. Experimental results demonstrate that, unlike previous methods, the proposed method can identify complex Manhattan structures of indoor and outdoor scenes and provide the exact boundaries and intersections of planes.

• The Korean Journal of Ecology
• /
• v.20 no.2
• /
• pp.95-102
• /
• 1997

Ring width chronologies of blue pine (pinus wallichiana) from two mesic sites, Kanasar(2, 400 m) and Gangotri(3, 000 m), in the western Himalayan region. India were developed to understand tree growth-climate relationship and its applicability in proxy climate studies. The resoponse function analyses of the two chronologies show that the site conditions play an important role in modulating the effect of climatic variables on tree growth. Winter temperature, prior to the growth year, has been found to play positive influence on blue pine growth at both sites. Summer temperature also has very similar response except for June and August. June temperature has negative influence at the lower in contrary to at the higher site. Low August temperature favors tree growth to precipitation has been found to vary which could be due to different precipitation regime at the two sites. Winter precipitation is important for tree growth at the higher, whereas summer at the lower sits. The present study suggests that the tree ring materials of blue pine from the temperate Himalayan regions could be used to develop chronologies for the reconstruction of seasonal climatic variables.