• 한국컴퓨터정보학회논문지
• /
• 제19권9호
• /
• pp.65-73
• /
• 2014

무선 센서 네트워크에서도 다른 네트워크와 마찬가지로 시간 관계를 유지하는 것이 중요하므로, 무선 센서 네트워크의 특성을 고려한 시각 동기화 프로토콜인 IBS(Indirect-Broadcast Synchronization)가 2012년에 개발되었다. IBS는 클러스터 트리 형태에서 동작하므로 일반 노드보다 더 많은 에너지를 소모하는 클러스터 헤더에 의해서 주로 네트워크 전체 수명이 좌우될 수 있다. 이 논문에서는 클러스터 트리를 부분적으로 재구성함으로써 전체 에너지 소모를 줄이고 네트워크 수명을 연장시키는 향상된 IBS(EIBS)를 개발하고자 한다. 다른 트리 구성 접근 방식과 비교할 때, 이 논문에서 사용된 방법은 알고리즘이 간단할 뿐만 아니라 전력 소모나 네트워크 수명 면에서 더 효율적이다.

• 한국인터넷방송통신학회논문지
• /
• 제8권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
• /
• 제36권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
• /
• 제12권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.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2005년도 Proceedings of ISRS 2005
• /
• 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.

• 한국콘텐츠학회논문지
• /
• 제7권8호
• /
• pp.59-65
• /
• 2007

오버레이 멀티캐스트는 하드웨어적인 인프라 구축 없이도 시스템의 자원과 네트워크 대역폭을 효율적으로 사용할 수 있는 기법이며 중간 노드의 이탈이 발생하게 될 경우 멀티캐스트 트리를 재구성한다. 그러나 빈번한 멀티캐스트 트리의 재구성은 심각한 성능 저하를 가져오게 된다. 본 논문에서는 이러한 성능저하를 보완하기 위해 각 자식 노드들로부터 소스 노드에게 주기적으로 피드백 되어오는 정보(RTCP-probing)를 기반으로 트리 성능 최적화 알고리즘을 제안한다. 제안된 모델은 서비스하는 부모노드가 트리의 성능을 저하시키는 원인으로 판단되어질 때 수행하는 메커니즘이다. 메커니즘을 수행하여 성능 최적화 트리를 구성함으로써 전체적인 서비스 트리의 성능을 향상시켰다. 시뮬레이션 결과를 통해 제안된 모델뿐만이 아니라 기존의 기법들에 적용하였을 때도 효과적인 방안임을 보여주고 있다.

• Journal of information and communication convergence engineering
• /
• 제22권3호
• /
• pp.215-220
• /
• 2024

This paper presents an efficient method for expanding interconnections in scenarios involving the reconstruction of interconnections across arbitrarily divided planes. Conventionally, such situations necessitate rebuilding interconnections based on all targets, ensuring minimal cost but incurring substantial time expenditure. In this paper, we present a tinkered tree algorithm designed to efficiently expand interconnections within a Euclidean plane divided into m randomly generated regions. The primary objective of this algorithm is to construct an optimal tree by utilizing the minimum spanning tree (MST) of each region, resulting in swift interconnection expansion. Interconnection construction is applied in various design fields. Notably, in the context of ad hoc networks, which lack a fixed-wired infrastructure and communicate solely with mobile hosts, the heuristic proposed in this paper is anticipated to significantly reduce costs while establishing rapid interconnections in scenarios involving expanded connection targets.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(1)
• /
• 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.

• 한국제4기학회지
• /
• 제6권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
• /
• 제11권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.